• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.203-203
• /
• 2000

The P&S(Power Plant Simulation System) is a powerful simulation software system for the dynamic behavior of power plants. The P&S module libraries provide plant models with higher flexibility of dynamic simulations for process and control designs. The P&S software was effectively available for PCS based on Linux and modem workstations based on Unix. The P&S was applied for simulating the dynamic behaviors of the SOVR(Supercritical Once-Through Variable Pressure Reheater) according to the operations such as stan-up, shutdown, load following, load change and trip in order to obtain an optimal operation procedure for Unit 5/6 of Taeahn fossil power plant consisted of SOVRs and steam turbines.

• Journal of Ocean Engineering and Technology
• /
• v.21 no.1 s.74
• /
• pp.69-74
• /
• 2007

This paper is concerned about the dynamic analysis of an underwater test miner, which operates on cohesive soil. The test miner consists of tracked vehicles and a pick-up device. The motion of the pick-up device, relative to the vehicle chassis, is controlled by two pairs of hydraulic cylinders. The test miner is modeled by means of commercial software. A terramechanics model of cohesive soft soil is implemented with the software and applied to a dynamic analysis of the test miner model. The dynamic responses of the test miner are studied with respect to four different types of terrain conditions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2384-2392
• /
• 1999

Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variables of current inputs and to use technique of its implementations. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the making table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.375-393
• /
• 2008

The dynamic cast operation allows flexibility in the design and use of data management facilities in object-oriented programs. Dynamic cast has an important role in the implementation of the Data Management Services (DMS) of the Mission Data System Project (MDS), the Jet Propulsion Laboratory's experimental work for providing a state-based and goal-oriented unified architecture for testing and development of mission software. DMS is responsible for the storage and transport of control and scientific data in a remote autonomous spacecraft. Like similar operators in other languages, the C++ dynamic cast operator does not provide the timing guarantees needed for hard real-time embedded systems. In a recent study, Gibbs and Stroustrup (G&S) devised a dynamic cast implementation strategy that guarantees fast constant-time performance. This paper presents the definition and application of a cosimulation framework to formally verify and evaluate the G&S fast dynamic casting scheme and its applicability in the Mission Data System DMS application. We describe the systematic process of model-based simulation and analysis that has led to performance improvement of the G&S algorithm's heuristics by about a factor of 2. In this work we introduce and apply a library for extracting semantic information from C++ source code that helps us deliver a practical and verifiable implementation of the fast dynamic casting algorithm.

• Convergence Security Journal
• /
• v.6 no.1
• /
• pp.13-23
• /
• 2006

It is more desirable to execute AV software on server systems rather than on clients for the minimization of damages due to malicious codes. AV software on server system, however, may aggravate the load of server system. In this paper, we propose a new AV software executed on server system without additional loads with a monitor and multi-agent model. The new AV software supports dynamic load balancing that reflects the features of AV engine, and thus it can be executed efficiently on server systems. The results of performance evaluation on the AV software attest to the strong points of the new AV software.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.597-608
• /
• 2010

Software evolution is an ongoing process carried out with the aim of extending base applications either for adding new functionalities or for adapting software to changing environments. This brings about the need for estimating and determining the overall impact of changes to a software system. In the last few decades many such change/impact analysis techniques have been developed to identify consequences of making changes to software systems. In this paper we propose a new approach of estimating change/impact analysis by classifying change based on type of change classification e.g. (a) nature and (b) extent of change propagation. The impact set produced consists of two dimensions of information: (a) statements affected by change propagation and (b) percentage i.e. statements affected in each category and involving the overall system. We also propose an algorithm for classifying the type of change. To establish confidence in effectiveness and efficiency we illustrate this technique with the help of an example. Results of our analysis are promising towards achieving the aim of the proposed endeavor to enhance change classification. The proposed dynamic technique for estimating impact sets and their percentage of impact will help software maintainers in performing selective regression testing by analyzing impact sets regarding the nature of change and change dependency.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1446-1459
• /
• 2007

This paper presents and analyzes a novel technique that makes it possible to improve the performance of low-end embedded systems through SoC(System-on-a-Chip) platform supporting dynamic cooperation between hardware and software modules. Traditional embedded systems with limited hardware resources have the poor capability of carrying out multi-tasking jobs including complex calculations. The proposed SoC platform, which provides dynamic cooperation between hardware and software modules, decomposes a single specific system into tasks for given system requirements. Additionally, we also propose a technique for efficient communication and synchronization between hardware and software tasks in cooperation with each other. Several experiments are conducted to illustrate the application and efficiency of the proposed SoC platform. They show that the proposed SoC platform outperforms the traditional embedded system, where only software tasks run, as the number of memory access is increased and the system become more complex.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• Journal of KIISE:Software and Applications
• /
• v.36 no.9
• /
• pp.767-776
• /
• 2009

A software birthmark is a set of characteristics that are extracted from a program itself to detect code theft. A dynamic API birthmark is extracted from the run-time API call sequences of a program. The dynamic Windows API birthmarks of Tamada et al. are extracted from API call sequences during the startup period of a program. Therefore. the dynamic birthmarks cannot reflect characteristics of main functions of the program. In this paper. we propose a functional unit birthmark(FDAPI) that is defined as API call sequences recorded during the execution of essential functions of a program. To find out that some functional units of a program are copied from an original program. two FDAPIs are extracted by executing the programs with the same input. The FDAPIs are compared using the semi-global alignment algorithm to compute a similarity between two programs. Programs with the same functionality are compared to show credibility of our birthmark. Binary executables that are compiled differently from the same source code are compared to prove resilience of our birthmark. The experimental result shows that our birthmark can detect module theft of software. to which the existing birthmarks of Tamada et al. cannot be applied.

• Journal of Educational Research in Mathematics
• /
• v.9 no.1
• /
• pp.245-261
• /
• 1999

Proof is an essential characteristic of mathematics and as such should be a key component in mathematics education. But, teaching proof in school mathematics have been unsuccessful for many students. The traditional approach to proofs stresses formal logic and rigorous proof. Thus, most students have difficulties of the concept of proof and students' experiences with proof do not seem meaningful to them. However, different views of proof were asserted in the reassessment of the foundations of mathematics and the nature of mathematical truth. These different views of justification need to be reflected in demonstrative geometry classes. The purpose of this study is to characterize the types of students' justification in demonstrative geometry classes taught using dynamic software. The types of justification can be organized into three categories : empirical justification, deductive justification, and authoritarian justification. Empirical justification are based on evidence from examples, whereas deductive justification are based logical reasoning. If we assume that a strong understanding of demonstrative geometry is shown when empirical justification and deductive justification coexist and benefit from each other, then students' justification should not only some empirical basis but also use chains of deductive reasoning. Thus, interaction between empirical and deductive justification is important. Dynamic geometry software can be used to design the approach to justification that can be successful in moving students toward meaningful justification of ideas. Interactive geometry software can connect visual and empirical justification to higher levels of geometric justification with logical arguments in formal proof.