• A
• A
• A
• АБB
• АБB
• АБB
• А
• А
• А
• А
• А
Обычная версия сайта
Найдено 33 929 публикаций
Сортировка:
по названию
по году
Глава
Sukhov A., Lyadova L. N. In bk.: Advances in Information Science and Applications. Volumes I & II. Proceedings of the 18th International Conference on Computers (part of CSCC '14). Vol. 1-2. Santorini Island: CSCC, 2014. P. 61-66.

The approaches based on applying of metamodeling and domain-specific languages are widely used in software engineering. There are many different tools for creating visual domain-specific modeling languages with a possibility of determining user’s graphical notations. However, these tools possess disadvantages. The article presents an approach to the development of language workbench that allows to eliminate some restrictions of existing DSM-platforms. The MetaLanguage system is designed for creation of visual dynamic adaptable domain-specific modeling languages and for models construction with these languages. It allows executing transformations of the created models in various textual and graphical notations. Basic metalanguage constructions of this system are described. The formal description of modeling languages metamodel used in MetaLanguage is given. The architecture of MetaLanguage toolkit is presented.

Добавлено: 26 июля 2014
Глава
Belenky A., Egorova L. G. In bk.: Advances in Intelligent Systems and Computing. Iss. 359: Modelling, Computation and Optimization in Information Systems and Management Sciences. Switzerland: Springer, 2015. P. 257-268.
Добавлено: 1 июня 2015
Глава
Seryi A. P., Lyadova L. N. In bk.: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2013. Kazan: 2013. P. 41-46.
Добавлено: 3 сентября 2013
Глава
Tatarnikov A. In bk.: Proceedings of IEEE East-West Design & Test Symposium (EWDTS'2016). Yerevan: IEEE, 2016. P. 270-273.
Добавлено: 22 декабря 2017
Глава
Salakhutdinova K., Krivtsova I., Sukhoparov M. et al. In bk.: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11118 LNCS. Vol. 11118 . Springer, 2018. P. 318-327.

Statement of Research. A need to reduce the increasing number of system vulnerabilities caused by unauthorized software installed on computer aids necessitates development of an approach to automate the data-storage media audit. The article describes an approach to identification of informative assembly instructions. Also, the influence of a chosen feature that is used to create a unified program signature on identification result is shown. Methods. Shannon method allowing a determination of feature informativeness for a random number of object classes and not depending on the sample volume of observed features is used to calculate informativeness. Identification of elf-files was based on applying statistical chi-squared test of homogeneity. Main Findings. Quantitative characteristics of informativeness for 118 assembly instructions have been obtained. The analysis of experimental results for executable files identification with 10 different features used to create program signatures compared by means of the chi-squared test of homogeneity at significance levels p = 0.05 and p = 0.01 has been carried out. Practical Relevance. The importance of using a particular feature in program signature creation has been discovered, as well as the capability of considering several executable file signatures together to provide a summative assessment on their belonging to a certain program.

Добавлено: 24 апреля 2019
Глава
Avdeeva Z., Abramova N., Fedotov A. In bk.: 18th IFAC World Congress. Milan: IFAC publisher, 2011. P. 14246-14252.

Existing diversity of types of formal cognitive maps with corresponding theoretical models makes actual the problem of their systematization for further comparative analysis of their capabilities in solving applied problems and for development of the general theory of formal cognitive maps, when and if it is possible. The lack of the general theory of formal cognitive maps, orientation of many known theoretical models exclusively on simulation, semantic vagueness of some models have already led to incorrect formal statements and solutions of applied problems on the basis of cognitive maps. The general parametrical model of semantics of functional cognitive maps is developed to uniformly describe semantics of formal cognitive maps. The model has covered the major part of known types of formal cognitive maps and has enabled systemizing non-functional types of maps. Efficiency of the proposed approach to systematization of formal cognitive maps is shown on the representative set of types of such maps.

Добавлено: 8 ноября 2013
Глава
Artemova E. In bk.: Proceedings of The Eighth International Conference on Web Search and Data Mining. NY; United States of America: ACM, 2014. Ch. 58. P. 429-434.
Добавлено: 8 декабря 2014
Глава
Lanin V., Uzunova E., Yugov A. et al. In bk.: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2013. Kazan: 2013. P. 139-143.

Today many problems that are dedicated to a particular problem domain can be solved using DSL. Thus to use DSL it must be created or it can be selected from existing ones. Creating a completely new DSL in most cases requires high financial and time costs. Selecting an appropriate existing DSL is an intensive task because such actions like walking through every DSL and deciding if current DSL can handle the problem are done manually. This problem appears because there are no DSL repository and no tools for matching suitable DSL with specific task. This paper observes an approach for implementing an automated detection of requirements for DSL (ontology-based structure) and automated DSL matching for specific task.

Добавлено: 21 января 2014
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 23-23.

We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the job jcompletion time. We have suggest an approximation scheme to find approximate optimal value of the objective function.

Добавлено: 4 марта 2013
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 13-13.

In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of jobs) with minimum of estimation of absolute error that$$0\le L_{max}^A(\pi^B)-L_{max}^A(\pi^A)\le \rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B),$$ where $\rho_d(A,B)=\max\limits_{j\in N}\{d_j^A-d_j^B\}-\min\limits_{j\in N}\{d_j^A-d_j^B\},$ $\rho_r(A,B)=\max\limits_{j\in N}\{r_j^A-r_j^B\}-\min\limits_{j\in N}\{r_j^A-r_j^B\}$ and$\rho_p(A,B)=\sum\limits_{j\in N}|p_j^A-p_j^B|,$ and $\pi^A, \pi^B$ -- optimal schedules for instances $A$ and $B$,respectively. Besides $\rho(A,B)=\rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B)$ satisfies to properties of the metrics in$(3n-2)$-dimensional space $\{(r_j,p_j,d_j)\,|\,j\in N\}$ with fixed in two parameters.

Добавлено: 4 марта 2013
Глава
Korenev P. S., Lazarev A. A. In bk.: 13th International Conference on Project Management and Scheduling (PMS 2012). Leuven, April 1-4, 2012. Leuven: Katholieke Universiteit Leuven, 2012. P. 195-198.

In the paper, we consider the NP-hard total tardiness minimization on a single machine scheduling problem. We propose a metric for that problem and present a new polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance in the metric from an initial instance.

Добавлено: 27 декабря 2012
Глава
Nazarov A., Alireza Nik Aein K. In bk.: Proceedings of 6-th International Conference Engineering & Telecommunication - En&T-2019. Moscow, MIPT. November 20-21, 2019,. IEEE, 2019. P. 1-5.
Добавлено: 9 мая 2020
Глава
Protopopescu T. I. In bk.: Symposium on Logical Foundations of Computer Science (LFCS 2016). Vol. 9537: Logical Foundations of Computer Science. Springer, 2016. P. 317-330.
Добавлено: 25 ноября 2016
Глава
Schang F. In bk.: The square of opposition: a cornerstone of thought. Basel: Birkhäuser, 2016.

An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. To finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.

Добавлено: 14 июня 2016
Глава
Fuad Aleskerov, Sergey Demin. In bk.: Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights. Switzerland: Springer, 2016. P. 1-14.
Добавлено: 19 декабря 2016
Глава
Evguenia Bessonova, Natalia Tourdyeva, Volchkova N. In bk.: The Uppsala Yearbook of Eurasian Studies I. L.: Wildy, Simmonds & Hill Publishing, 2016. Ch. 1. P. 1-19.
Добавлено: 14 марта 2017
Глава
Mirkin B., Artemova E. In bk.: Clusters, orders, trees: methods and applications. In Honor of Boris Mirkin's 70th Birthday. Vol. 92. Berlin: Springer, 2014.

Abstract. A suffix-tree based method for measuring similarity of a key phrase to an unstructured text is proposed. The measure involves less computation and it does not depend on the length of the text or the key phrase. This applies to the following tasks in semantic text analysis:

Finding interrelations between key phrases over a set of texts;

Annotating a research article by topics from a taxonomy of the domain;

Clustering relevant topics and mapping clusters on a domain taxonomy.

Добавлено: 4 ноября 2013
Глава
Shilov V., Silantiev S., Kitov V. A. In bk.: Third International Conference on the History and Philosophy of Computing [HaPoC 2015]. October 8-11, 2015. Pisa, Italy. Preliminary Proceedings. Piza: Pisa University Press, 2015. Ch. 21. P. 53-55.
Добавлено: 15 марта 2016
Глава
Nurullin R. In bk.: Babel und Bibel 7: Annual of Ancient Near Eastern, Old Testament, and Semitic Studies. Winona Lake: Eisenbrauns, 2013. P. 175-229.
Добавлено: 20 октября 2017
Глава
Rybakov M., Balbiani P. In bk.: Twelfth International Tbilisi Symposium on Language, Logic and Computation. Tbilisi State University, 2017. P. 49-53.
Добавлено: 8 октября 2019
Глава
Vasyukov V. L. In bk.: Двенадцатая международная конференция "Современная логика: проблемы теории, истории и применения в науке", 22-24 июня 2016. St. Petersburg: СПбГУ, 2016. P. 204-206.
Добавлено: 23 октября 2016