No abstract

No abstract

Finding new industry partners poses a challenge to many public research organizations. This article explores how statistical classification can support partner selection at the example of the Fraunhofer Society in Germany, Europe's largest public organization for applied research. We use internal cooperation data and feature sets based on unstructured data, i.e., text and industry codes, both of which describe business activities of firms. An important advantage of this data is that it is available for most companies in Germany, even small and medium enterprises, which allows for an almost complete screening of the market, in contrast to using other data sources, e.g., patents. In addition, we also include economic variables linked to firms, as turnover, number of employees/managers and firm age. We report the performance of various classification techniques such as logistic regression, support vector machines, and random forests in our dataset for diverse combinations of feature sets. Results show that simple methods with fewer parameters remain competitive in comparison to complex ones. Overall, the performance of most classifiers is high enough to support the decision process of finding new industry partners for public research.

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann–Gibbs–Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner–Davison–Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.