scholarly journals A Tractable Nonconvex Surrogate for the Matrix l0-quasinorm: Applications to Sparse Feedback Design**The work of the first author was supported by the Russian Foundation for Basic Research, project no. 14-08-01230. The work of the second author was supported by the Russian Science Foundation, project no. 16-11-10015.

2016 ◽  
Vol 49 (13) ◽  
pp. 53-58
Author(s):  
A. Bykov ◽  
P. Shcherbakov ◽  
M. Ding
1998 ◽  
Vol 26 (1) ◽  
pp. 105-112
Author(s):  
Koty Lapid

AbstractIn this paper, I describe the development process of "overlapping development models for basic research project management" in Japan during the years 1970-95. I found that Japanese basic research project management models co-evolved through the joint learning of companies, government laboratories and universities. Finally, I present my conclusions and the implications of these management systems for the future development of Japan's technology policy, which includes not just critical technologies, but also the management of the research process.


Author(s):  
A.N. Dmitrishin ◽  
V.D. Revina ◽  
V.I. Rusnak ◽  
Al-dr A. Khoroshilov ◽  
Al-ey A. Khoroshilov

The article describes the methods, the procedures and technology of automated creation of thematic ontology based on automatic processing and semantic analysis of unstructured normative-technical texts and texts of draft documents and determining the semantic relation between detected by concept names. For an application this method necessary to possess procedures complex of automatic semantic the text processing. The article describes the hybrid methods of automated creation of technologies, based for the use of program-linguistic platform of MetaFraz. The research was supported by the Russian Foundation for Basic Research (project 18-37-00110 mol_a).


2016 ◽  
Vol 26 (1) ◽  
Author(s):  
Olga V. Podolskaya

AbstractWe study the circuit complexity of Boolean functions in an infinite basis consisting of all characteristic functions of antichains over the Boolean cube. For an arbitrary symmetric function we obtain the exact value of its circuit complexity in this basis. In particular, we prove that the circuit complexities of the parity function and the majority function ofThe research is supported by the Russian Foundation for Basic Research, project 14–01–00598.


Sign in / Sign up

Export Citation Format

Share Document