Contents authors' list error: Reference source not found 9
V.A. Mustafaev, D.F. Mamedov, T.A. Tagieva Automation of the structure forming of discreet system net model
Download 1.06 Mb.
|
- Navigate this page:
- A.N. Afanasiev, Sibiryov V.V., Kornienko V.V. Automation of managing in educational organizations
- Kuznetsov L.A., Pogodaev A. K., Ovchinnikov V. V. OPTIMIZATION OF QUERIES FOR A RELATIONAL DBMS
V.A. Mustafaev, D.F. Mamedov, T.A. Tagieva Automation of the structure forming of discreet system net modelOne of the essential questions of the system theory makes an appearance a work out methods of dynamically research of complex system, functioning in fuzzy condition . The basics indications, what to complicate this question are followings:
Therefore theirs difficulty claims cretin a new simulation method in fuzzy condition. One of the new simulation method makes an appearance application the stochastic net Petry. A model of discreet system is present in view of stochastic net Petry. After definition of multitude positions and branch, source and target functions to form the model structure.The probalility marcers distribution vector of source and target positions defines in the next stage. For performance each branch, the number of probability vector elements, different of zero is equally or more the number of branch, connecting by means of a arc. After definition stimulating branch, to compute the markers of targets positions. It is forming the Gram of probability vector matrices of source and target positions. Farther it is computing the vector of diagonalling convolution. This vector defines by means elements sum, that symmetric diagonal elements of the Gram matrix vector. It is checking the followings attributes of vector diagonalling convolution: commutative; associative; normal. After performance theirs attributes, to define a minimal element of the vector. That process repeats for all branches, what to connect source positions with a arc. In this connection to define maximum element of minimal vectors and let to perform the branches, becoming of the same value. A.N. Afanasiev, Sibiryov V.V., Kornienko V.V. Automation of managing in educational organizationsThis work is set of tools for automation and simplification work of heads of educational organizations in field of collecting, storing and analyzing information about teachers, students and organization. This automation help to solve next tasks: save time in collecting, storing and processing administrative information; rising of work effectivity; preparing of statistical diagrams; checking for a set of important values and parameters; rise up technical culture of director state. In works with system was reached: satisfaction of informational user’s needs; work with large data arrays of teacher and pupil list; build of comfortable screen forms for non-trained users; limitations of access to databases. Databases of system contains information about teacher and students in found of their personal files, stored in organization. This information completely full and mostly using in filters of reports. From databases system can get next reports: sorted and filtered lists of teacher and students; preparing of yearly reports in ОШ-1 form; statistical diagrams and graphics for analyzing; preparing timetable of studies. This system is released in Delphi 4 environment. Database’s tables format is Paradox. Statistical information for each years is storing in archive and can be used in rollback. Some of yearly information is storing in readable form for future analyzing of yearly changes and tendencies. Contact e-mail: krino@ulstu.ru
M. A. Knyazeva, V. D. Guzhavin SUBSYSTEM OF ASSESSMENT OF TIME COMPLEXITY OF PROGRAMS IN INSTRUMENTAL MODELING SYSTEM OF PROGRAM OPTIMIZATIONAt the base department of Institute of Automation and Control Processes Instrumental Modeling Expert System of Program Optimization (I_MESOP) is developing. I_MESOP is intended for formalization of knowledge related to systems of optimizing transformations and conducting experiments with them. Subsystem of Assessment of Time Complexity of Programs (SATCP) was developed to use both with I_MESOP and separately. The input of SATCP contains program in Model of Structured Programs – form(MSP-form), custom parameters and input values of interpretive program. Custom parameters describe the time complexity of basic operations, such as a addition, subtraction, multiplication, division, saving a value to the memory, loading a value from memory, function call and so on. The output of Subsystem of Assessment of Time Complexity of Programs consist of an output of interpretive program and a tree of this program, tree contains a time complexity values for it’s each node. Since it’s impossible to obtain this result without the program execution, Subsystem of Assessment must be an interpreter of programs in MSP-form, which calculate the time complexity of the interpretive piece of program code. The result of assessment, of course, must fit the requirements for metrics. Kuznetsov L.A., Pogodaev A. K., Ovchinnikov V. V. OPTIMIZATION OF QUERIES FOR A RELATIONAL DBMSThe relational expression optimization algorithm is explained in work [1]. In it each step of optimization is based on known equivalent transformations of relational expressions, which application is described verbally. As is known, the verbal exposition of algorithm is surplus and ambiguous. The verbal algorithm is required to be transformed to a more formal aspect for it realizations within the framework of the computing system. Therefore represents practical interest completely to formalize this algorithm for automation of procedures of optimization. In an outcome the formalization of algorithm not only eliminates marked restrictions but also considerably reduces expeditures of labour. In the report the relational expression formalized model is stated. The developed predicates of a relational expression correctness are represented within the framework of the entered model. The operations of relational expression equivalent transformations on basis of the created model are developed. The formalized algorithm of relational expression optimization is described, the examples of its application are achieved. In an outcome in work the theory is obtained, which objects are the relational expressions and formal ways of their transformation. The further development of the theory will allow to investigate new possibilities of optimization algorithm improving to remove restrictions of verbal representation and to supply a algorithm realization possibility on the computer. References 1. Ульман Дж. Основы систем баз данных. Пер. с англ. – М.: Финансы и статистика, 1983 – 334с. Directory: confer confer -> Tilte : a critical examination of the police relations with bbc confer -> Eavesdropping on a virtuous circle Richard Whately and the Oriel Noetics. Elena Pasquini Douglas uwa business School confer -> Simulation and Prediction of Storm Surges, Waves, and Morphological Changes due to Tropical Cyclones by Using a pc-based Integrated Coastal Process Model confer -> Panel 0511 Disability and Difference I: Post-War Journeys through Disability confer -> Do remittances have a flip side? A general equilibrium analysis of remittances, labor supply responses and policy options for Jamaica* Maurizio Bussolo and Denis Medvedev confer -> Conference approval process made easy for acm in cooperation conferences confer -> Proceedings of gt2009 asme turbo Expo 2009: Power for Land, Sea and Air Orlando, Florida, USA gt2009-59981 dynamics of premixed h2/CH4 flames under near blowoff conditions confer -> South Korea’s Economic Future: Industrial Policy, or Economic Democracy? confer -> Asset rotator Cuff Rehabilitation Course Faculty Dr. Spero Karas confer -> Acm word Template for sig site Download 1.06 Mb. Share with your friends:
|