METHODS OF AUTOMATED CREATION OF THEMATIC ONTOLOGY

2019 ◽  
pp. 28-35
Author(s):  
A.N. Dmitrishin ◽  
V.D. Revina ◽  
V.I. Rusnak ◽  
Al-dr A. Khoroshilov ◽  
Al-ey A. Khoroshilov
Keyword(s):  
Semantic Analysis ◽  
Hybrid Methods ◽  
Text Processing ◽  
Basic Research ◽  
Automatic Processing ◽  
Semantic Relation ◽  
Research Project ◽  
Basic Research Project

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).

The Evolution of Technology Research Management Systems in Japan: Government Laboratories, Private Industry and Universities

1998 ◽  
Vol 26 (1) ◽  
pp. 105-112
Author(s):  
Koty Lapid
Keyword(s):  
Project Management ◽  
Technology Policy ◽  
Basic Research ◽  
Research Process ◽  
Research Management ◽  
Management Systems ◽  
Private Industry ◽  
Research Project ◽  
Basic Research Project ◽  
Government Laboratories

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.

Circuit complexity of symmetric Boolean functions in antichain basis

2016 ◽  
Vol 26 (1) ◽  
Author(s):  
Olga V. Podolskaya
Keyword(s):  
Boolean Functions ◽  
Symmetric Function ◽  
Circuit Complexity ◽  
Basic Research ◽  
Characteristic Functions ◽  
Research Project ◽  
Boolean Cube ◽  
Majority Function ◽  
Parity Function ◽  
Basic Research Project

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