Complete Issue - International Journal of Information
Transcription
Complete Issue - International Journal of Information
Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 Simulation of Duplex Training System Based on Technical diagnostics of multicomputing complex Kyaw Zaw Ye, Kyaw Zin Lin Department of Informatics and Computer Software System National Research University of Electronic Technology Zelenograd, Moscow, Russia Corresponding author: Kyaw Zaw Ye, Bld. 5, Pas. 4806, Zelenograd, Moscow, Russia, 124498 Email: [email protected], [email protected] Abstract: This paper is devoted to the simulation of duplex training system, which supported interaction of student and teacher, resulting in the development of training simulation. Realized simulation of duplex training system for disciplines «mathematical theory and technical diagnostics of distributed computing» using by the platform of MathLAB and Any Logic. Keywords: simulation, duplex training system, congnitive technology, complexes, technical diagnostics, fault, distributed computing, model knowledge. Introduction At present, a number of high-tech industries, research and educational processes use many kinds of instrumentations and computer complexes that greatly improve the efficiency of information processing. Despite the undoubtedly positive effect of the use of instruments, complex ongoing devices, we have to state their lack of effectiveness, due to a number of technical and economic circumstances. In particular, rather acute problem of improving the resiliency and reliability of elements of instrumentations, the life of which often exceeds the standard. In connection with the above, one of the most important requirements for instrument complexes is their high availability and the ability to effectively identify failures [1]. The analysis showed that the modern industrial technologies used in various fields, require new approaches to ensure their reliability and effective methods of technical diagnostics. In this regard, there is a steady increase in the number of faults and failures, worsening the number of products increase the probability of accidents and crashes. Such a negative situation related to the unreliability of the devices can be neutralized by increased personnel skills, able to justify decisions taken in the event of a negative situation. Thus, current paper of our research aimed to create simulation for efficient information processing during times of technical diagnostics and processing of duplex training system (DTS). Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 11 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 Duplex training SYSTEM In communication theory, the duplex system determines as a link, in which message can be transmitted into the both directions simultaneously. In the context of duplex learning system’s analogy indicates to simultaneous interaction "teacher-student" in the central information hub. In my opinion, those modern communication channels (Internet, telephone) are not fundamentally novel. The central part of the system is a server - the information center of the university, containing all kinds of supporting information which is existing educational systems as the distance form. Process management is performed by one of the basic methods: inductive, deductive or abductive. In accordance with the general theory system, management of multi-level hierarchical system is two counter-flows: flow of information and flow of management impacts [2]. Learner, himself may choose training technology by discipline "from general to specific", "from the specific to the general" or permanent alternation data techniques of the study in all disciplines. Settled task of implementation for training management, in which training management the teacher can generate an individual examination of the particular order of discipline to a particular student in the group; and it is defined as transition to the next lessons, depending on the learning result of the previous steps [3]. Hierarchical learning system is considered in two aspects: qualitative and quantitative. In the quantitative aspect has content of disciplines, it is forming the content of information systems (represented information), which represents in a hierarchical structure. From a mathematical point of view, the content of information hierarchy seems natural restricted language like formatted grammar G: G=(V, , P, ), where: V- complete dictionary (or alphabet); V, where - a set of terminal symbols; Р – a finite set of order pairs of the form (u, v), where u(V-)* и v V*; initial symbol. Creating and presenting the content as language, which formed grammar that not only allows to arrangement knowledge for ensure effective mainstream, and but also it promotes to the implementation of variable control in DTS (fig.1). Discipline can be represented triple: DU V U , RU ,U U , where VU – set of stages training, RU- matrix of adjacency discipline, UU - algorithm for forming individual learning paths for the discipline. Adjacency matrix R shows the relationship between the stages of studying the discipline and possible transition way from i to step j. The algorithm for generating an individual learning path is an analysis of the current state of education, student learning outcomes and their further path. Let U V U v1U , v2U ,..., v11 , where V1U - Elementary stage of education in the discipline. Elementary stage of education is, for example, the theoretical unit, a result of learning in which assessment does not expose or the control unit that consisting of one test task, depending on the correctness or incorrectness of the answer, which will be Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 12 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 transferred to the management and to perform the following elementary stages. We define the following values for the elements of the adjacency matrix: 0 - transition is forbidden; 1 - transition in case of an incorrect answer to the control block ViU, 2 - transition in the case of an incorrect answer to the question of the control block ViU; 3 transition regardless of right or wrong answer to the question of the control block or in case of transformation of a block of theoretical information. Here is an example of the adjacency matrix of discipline: 0 0 0 0 0 R 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 2 0 2 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 1 0 0 0 0 1 0 1 0 Vertices of the graph V1U, V4U, V5U, V9U correspond to the theoretical stages of study. Vertices of the graph V2U, V3U, V6U, V7U, V8U и V10U - blocks of control tasks. V11U - the final stage puts the final assessment on the study subjects. Thus, depending on the level of students' knowledge and embodied in the adjacency matrix structure of the course is carried out taking into account the variability of individual management training, which specify discipline for each group member. By itself the term "variability" implies participation in the learning process of the student, his personal features and qualities [8]. Therefore, technology management training based on DTS enables the following functions: feedback from the student to the teacher, the ability to store information in the DTS enables to expend in to the progress of learning (the intermediate stages), the possibility of adjusting the teacher training process based on the data on the progress of learning; "flexibility" of the system to learner’s action. 2 V4U 3 V5U V6U 3 2 V1U 1 V2U 1 V3U 1 V11U 1 2 2 V8U 1 1 1 V7U 2 V9U 3 V10U 3 Fig. 1 Example for a study course of duplex training system Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 13 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 Diagnostic and Planning Expert Teaching Systems based on using the methodological tools of computer testing [3]. Despite the wide range of scholarly achievements and market offers in the field of computer learning technologies. The purpose of this paper is brief description of the author's results of development of CTP computer simulation concept on the basis of innovative approaches to improving the methodology and expanding the area of using the computer-based testing systems (CBTS) technology. The paper is also aimed at the presenting the key aspects of developing the use of author's simulation propositions as an instrument for receiving and adequate interpretation of the set of quantitative and qualitative identifiers of individual intellectual characteristics of individuals. COMPLETE TESTING ALGORITHM FOR technical diagnostics of distributed computing This paper proposes a model of the system's knowledge of the cognitive area of learning the basics of technical diagnostics. Generalized model of the field of knowledge and relationship training modules presented in Figure 1. Optimize the process of diagnosing for distributed computing system (DCS) using overlapping tests with complete coverage of elements. The theoretical aspects of the problem are the following. Let the beginning of a M-th step of the verification process carried out by a sequence of tests H ( M 1)* = {h1,..., h(M-1)} and the problem reduces to finding a subset of the failed component of ( M 1) . (Before the start ( 0 ) = Ω. ( 0 ) , including all elements of the system, but H(0) does not include any tests of the system checked ). The search algorithm of failed components are follow [4]. 1. Defined values q~ j( 0 ) - conditional probability of failure is the j-th element, if the tested set exactly one element failed: q~ (0) j q j qi i( 0 ) 1 , where qi qi pi1 2. For each significant test to calculate the probability of unsuccessful outcome of the tested subset: Qi( 0 ) j j ( 0 ) q~ j( 0 ) . 3. For each material test hi are associated costs Zi(0) in view of the fact that a test sequence is performed (0) . In general, the costs of conducting the test as hi can decrease or increase, subject to other tests. (For example can be connected by previous inspections necessary for the test devices, or vice versa, holding previous audits may hinder access to the right parts of the system) . For each test ti determined values Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 14 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 gi(0) Zi(0) / Qi(0) 4. Selected this test hk, for which a minimum: 5. Applicable test hk: • If the test succeeds hk , the problem reduces to finding a subset of the failed component Ω(1) = Ω(0) \ Ω𝑘 ; • If the test hk fails, the problem is reduced to finding a subset of the failed componentΩ(1) = Ω(0) ∩ Ω𝑘 . In these cases, if the subset Ω(1) consists of a single element, the search failed element ends here. 6. New fixed sequence of tests applied H h k: H (1) ={H (0) (1) , which contains the previous sequence H (0) and the last applied test , hk}. 7. To Subset Ω(1) , starting with test 1, the procedure checks with the corresponding change in the superscript (0) in the index (1). The verification procedure continues as long as claimed in 6, at some step k is formed subset Ω(1) , which consists of a single element. Procedure described in the application to multi-computer complexness will implement consistent with the development of the verification process. For current calculations and selection of another tests used computer with the necessary software and advance the memorized array of source data (probability of failure, duration of inspections, test specifications). Concretizing the task, when testing DCS chooses to 8 devices (main modules). №1 — LA (line adapter), №2 —controller for internal line devices MCC; №3 –first PC; №4 — second PC; №5 —Linear controller for interfacing of PC; №6 — Analog Input Module; №7 —third PC; №8 — Output of the module of control commands and can be tested within six tests which matrix is shown in Table 1. Table 1 Matrix of testing Numbers of test 1 Numbers of elements 1 2 1 1 2 3 1 3 4 1 5 1 6 1 1 1 1 4 5 7 1 1 1 1 1 1 6 8 1 1 1 1 1 A procedure continues until all the pieces are constructed algorithm complete testing systems to localize the failure to a set of single element. It should be noted that in the case of testing one element after another, we can get a Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 15 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 simple rule for numbering test for finding procedures minimizing search costs failed element. Commutes trick is that from any arbitrary numbering. And the pair permutation tests will only determine to the neighboring finite number of steps to go on with any predetermined sequence of them, including optimal. If we could possibly find a useful criterion for comparing two different tests on the effect of their applications on the target function will give us the average search time failed component. Under certain conditions, it is possible to calculate the criterion for each test and then enumerate all the tests in accordance with a monotonic variation of this criterion [4]. For an arbitrary numbering objective functional tests C [ (i )] z(ki ) Q(ki ) C [ ((ki ) )] (1 Q(ki ) ) C [ ((ki ) )] (1) have a specific form: C [ ()] z1 q1C [ (e1 )] PC 1 [ ( \ e1 )] , (2) Where, as e1-singleton. That is why, which is no longer need to check and C [ ( \ e1 )] c2 C [ ( \ e1 e2 ))] . (3) Finally we get the formula (4). C z1 p1 ( z2 p2 ( z3 p3 ( z4 ...))). (4) Writing a similar expression for this case when the item numbers k and k + 1 changed the procedure for checking and comparing the values of the total cost for both of these cases. And we find the optimal order, if possible, we need to consider to check the components of responsible numbering elements in accordance with the condition: z z1 z 2 ... n . q1 q2 qn To be confirmed, the benefits of the proposed method was carried out in the software simulation for different numbers of test - N hi , providing complete testing of multi-computer complexness. During the simulation of testing тр DCS, we need to compare the relative time spent on the search for a single failed component to the traditional - Z сум i пр and the proposed methodology Z сум . And it defines the improved performance testing by the formula i i тр пр Z сум Z сум i тр Z сум i i . Simulation results are presented in Figure 7 shows a graphical representation of i N hi . Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 16 Conference Proceedings Published by : Institute of Information System and Research Center ( IISRC ) for 3rd ICELEET 2015 & ICCSHCI 2015 Bern, Switzerland – April 12 - 13, 2015 0.25 0.2 0.15 0.1 0.05 0 4 5 6 7 8 9 10 Fig.2. Graphical relationship i N hi From the data presented in Table 2 and in Fig. 2, it is clear that depending on the number of tests provide speedup complete testing multi-computer complexness from 12 to 20%. And the result of simulation will show the advantages of the proposed method, which helps to test the full DCS searching by criteria single failure. CONCLUSION The results of application of the developed duplex training system in the educational process of National Research University of Electronic Technology showed that, depending on the training technology provided by increasing of average achievement in 3-13%, reduction in the average time of a student’s classroom work by 22-33% and the average time spending with the teacher’s monitoring activities at 9-13%, compared with conventional technology. REFERENCES 1. Brusilovsky, P. Adaptive and intelligent technologies for Web-based education. In C. Rollinger and C. Peylo (Eds.). Konstliche Intelligenz, Special Issue on Intelligent Systems and Teleteaching, No. 4, pp. 19-25, 2004. 2. Kyaw Zaw Ye, Lisov O. I. Simulation- training complex for learning processes of technical diagnostics in multicomputer systems // Vecti Vishi higher education institutions Chernozem -№ 1 (23) 2011 - pp.73- 75. 3. Kyaw Zaw Ye. Development of intelligent training system in E-learning technology// Microelectronics and Informatics 2009. 16th National Interuniversity Scientific Conference of students and graduate students: Abstracts. Moscow: MIET, 2009.-pp.185. 4. Kyaw Zaw Ye, Alexander M. Bain. Methods to improve the detection of failures and troubleshooting for technical diagnostics in instrument// 10.13189/mst.2013.010202, Manufacturing Horizon Science and research Technology publishing 1(2): 31-35, 2013, cooperation. DOI: USA, http://www.hrpub.org/download/20131107/MST2-15401707.pdf Proceedings are available on @ International Journal of Information Technology & Computer Science ( IJITCS ) ( http://www.ijitcs.com ) (ISSN : 2091-1610 ) on Volume No : 20 , Issue No : 1 ……………………..Page No …. 17