This paper presents ontlology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontologies and analyser. The parser subsyst...
详细信息
ISBN:
(纸本)9783540855620
This paper presents ontlology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontologies and analyser. The parser subsystem translates the input coded to AST that is constructed as an XML tree. The OWL ontologies define code patterns and general programming concepts. The analyser subsystem constructs instances of the input code as ontology individuals and asks the reasoner to classify them. The experience gained in the implementation of the proposed system and some practical issues are discussed. The recognition system successfully integrates the knowledge representation field and static code analysis. resulting in greater flexibility of the recognition system.
The purpose of our research is to find algorithms for loading large maps on PDA and place on it the geographical location given by latitude and longitude. C++ and C# programming languages have been used for implementa...
详细信息
The purpose of our research is to find algorithms for loading large maps on PDA and place on it the geographical location given by latitude and longitude. C++ and C# programming languages have been used for implementation. It was elaborated a software which runs on PDA with Windows Mobile 2003 OS and implements algorithms for finding the coordinate on a map represented like a TIF image. The application must localize the coordinates known by longitude and latitude over a given image in TIF format which can represent a map with scale 1:200000 or 1:25000. The map headers contain information that refers to map limit. An algorithm that permits map synchronization when the value of current map is out of limit it was necessary.
The scope of our research is finding a correlation between the correctness indicator and the reliability indicator for software programs. For this, the correctness and reliability indicators will be calculated for a s...
详细信息
The scope of our research is finding a correlation between the correctness indicator and the reliability indicator for software programs. For this, the correctness and reliability indicators will be calculated for a simple program, written in C programming language. The computations will be made for each program version obtained by correcting different error type found in the testing process. Will be observed there is a closed correlation between correctness and reliability in the way that for an increasing of the correctness level there will also be a significant increase of the reliability level.
In this paper, an evaluation of the network routing algorithms is made. Problems that arise in routing are treated, each presented in different scenarios in order to obtain a result in comparing different topologies. ...
详细信息
In this paper, an evaluation of the network routing algorithms is made. Problems that arise in routing are treated, each presented in different scenarios in order to obtain a result in comparing different topologies. The comparison analysis is pursuing obtaining a result over the performance of the, network. In order to measure performance, the costs of a network and the delays are aimed. After that, the topology effect is presented. In matter of performance, topology and blocking problems are strongly related. So an analysis of the blocking probability is also presented. As conclusions, solutions for the presented scenarios and also for other important scenarios are given. In all these algorithms the time problem was not yet consider until now, so the average execution time is finally analyzed.
We present a comparative analysis for several multi-agents participating in Trading Agents Competition, Classic. The game is first partitioned into separate modules, for which distinct strategies may be developed. The...
详细信息
We present a comparative analysis for several multi-agents participating in Trading Agents Competition, Classic. The game is first partitioned into separate modules, for which distinct strategies may be developed. The strategies used are taken into consideration both individually and in relation with other agents, but also the game medium. Conclusions regarding possible improvements, better strategies and potential weaknesses are driven from each agent analysis. Alternatives like static market algorithms vs. dynamic market algorithms are considered in detail and advantages and disadvantages are discussed. Also a discussion of TAC market and possibilities for the stochastic system approximation with a deterministic one is realized.
The paper tackles the problem of managing uncertainties during the execution of predictive schedules in a dynamic environment, i.e., the anticipatory recognition of deviations from the planned schedule. The dynamic en...
详细信息
ISBN:
(纸本)9782748345988
The paper tackles the problem of managing uncertainties during the execution of predictive schedules in a dynamic environment, i.e., the anticipatory recognition of deviations from the planned schedule. The dynamic environment in question is represented by simulation models - connected to a production scheduler system - with flexible modelling capabilities. Different production situations can be recognised and tested by applying the proposed simulation-based evaluation and benchmark platform. Therefore, the decision maker is supported in reacting to deviations or disruptions by performing different simulation experiments in advance, i.e., in a proactive manner. A real production facility (large-scale flow-shop system) serves as the test bench of the prototype simulation system. Based on the test results, it can be stated that in several cases simulation can considerably support the decision making in the production control activities.
Through the motion control experiment using Industrial Emulator(Model 220 by ECP), the performance comparison of three kinds of controllers such as PID, RIC and LQR was carried out. It was shown that RIC has the best ...
详细信息
Through the motion control experiment using Industrial Emulator(Model 220 by ECP), the performance comparison of three kinds of controllers such as PID, RIC and LQR was carried out. It was shown that RIC has the best performance in the presence of disturbances such as step one, sinusoidal one and Coulomb friction for the rigid body. LQR using feedback state variables has the best tracking performance for the flexible body. The performance of PID controller is low compared to other controllers, but the design process is simple. The most advanced controller is LQR. In order to attenuate disturbance, an additional state observer should be used to estimate it, making more complex control system. RIC lies between PID and LQR in view of complexity of design. Even though RIC is not complicated, it has good disturbance rejection ability and less tracking error. By considering these aspects, the RIC is suggested as high precision controller to be used in motion control system.
作者：
Šeda, MilošBrno University of Technology
Faculty of Mechanical Engineering Institute of Automation and Computer Science Technická 2 Brno 616 69 Czech Republic
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximat...
详细信息
ISBN:
(纸本)9788021436756
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a wellknown geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
A lot of Learning Management Systems (LMS) were developed in the last ten years since E-Learning opens new possibilities in learning scenarios. They offer the possibility to watch any of the students action on the com...
详细信息
Theoretical study of complex systems receives more and more attention as most sciences broaden their perspectives. The paper first briefly overviews a few important complexity approaches, then it presents a triple-lev...
详细信息
Theoretical study of complex systems receives more and more attention as most sciences broaden their perspectives. The paper first briefly overviews a few important complexity approaches, then it presents a triple-level model for describing and analyzing collaborating enterprises. The environment is treated as a stochastic process, the core topology of the collaboration is represented by a graph and, finally, the dynamic behavior of collaborating enterprises is modeled as a Complex Adaptive System (CAS). Complexity measures for the different sub-models are suggested, some complexity drivers are investigated and it is argued that the resulted model can be effectively analyzed by simulation.
暂无评论