• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.17 no.2
• /
• pp.227-234
• /
• 2019

A user-friendly modeling interface is developed for a process-based total system performance assessment framework (APro) specialized for a generic geological disposal system for high-level radioactive waste. The APro modeling interface is constructed using MATLAB, and the operator splitting scheme is used to combine COMSOL for simulation of multiphysics and PHREEQC for the calculation of geochemical reactions. As APro limits the modeling domain to the generic disposal system, the degree of freedom of the model is low. In contrast, the user-friendliness of the model is improved. Thermal, hydraulic, mechanical and chemical processes considered in the disposal system are modularized, and users can select one of multiple modules: "Default process" and multi "Alternative process". APro mainly consists of an input data part and calculation execution part. The input data are prepared in a single EXCEL file with a given format, and the calculation part is coded using MATLAB. The final results of the calculation are created as an independent COMSOL file for further analysis.

• Korean Journal of Construction Engineering and Management
• /
• v.20 no.2
• /
• pp.60-67
• /
• 2019

The main purpose of this study is to identify the tasks performed at the construction stage of apartment houses and analyze the major construction tasks that may affect the performance indicators and analyze the impact on project performance. Based on expert opinions through preliminary research, pilot data, construction database, and other research trends, domestic and foreign research trends are divided into five major tasks, and each is divided into process management (P'1 ~ P'6), construction management (C'1 ~ C'5), environmental management (E'1 ~ E'4), quality control (Q'1 ~ Q'5), safety management (S'1 ~ S'5). Subsequently, each major task was subdivided into 24 detailed tasks. An independent t-test was conducted to analyze the impact on cost. We compared the importance of achieving the project goal and identified the construction work of concrete important construction which affects not only the cost but also the schedule performance index for the degree of significance of less than 0.05.

• Journal of Software Assessment and Valuation
• /
• v.17 no.1
• /
• pp.11-16
• /
• 2021

The importance of software is increasing due to the development of information and communication, and software copyright disputes are also increasing. In this paper, the source of the submitted programs and the files necessary for the execution of the program were taken as the scope of analysis. The large-capacity file transfer solution program to be analyzed provides additional functions such as confidentiality, integrity, user authentication, and non-repudiation functions through digital signature and encryption of data.In this paper, we analyze the program A, program B, and the program C. In order to calculate the program similarity rate, the following contents are analyzed. Analyze the similarity of the package structure, package name, source file name in each package, variable name in source file, function name, function implementation source code, and product environment variable information. It also calculates the overall similarity rate of the program. In order to check the degree of agreement between the package structure and the package name, the similarity was determined by comparing the folder structure. It also analyzes the extent to which the package structure and package name match and the extent to which the source file (class) name within each package matches.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.358-370
• /
• 2007

Software simulations have been widely used for the design and application development of a wireless sensor network that is an infrastructure of ubiquitous computing. In this study, we develop a sensor network simulator that can verify the behavior of sensor network applications, estimate execution time and power consumption, and simulate a large-scale sensor network. To implement the simulator, we use an instruction-level parallel discrete-event simulation method. Instruction-level simulation uses executable images loaded into a real sensor board as workload, such that it results in the high degree of details. Parallel simulation makes simulation of a large-scale sensor network possible by distributing workload into multiple computers. The simulator can predict the amount of power consumption based on operating time of modules in a sensor node and counting the number of executed instructions by kind. Also it can simulate ubiquitous applications with various scenarios and debug programs. Instruction traces used as workload for simulations are executable images produced by the cross-compiler for ATmega128L microcontroller.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.519-529
• /
• 2007

In this paper, we investigate the use of fuzzy rules for efficient intrusion detection. We use evolutionary algorithm to optimize the set of fuzzy rules for intrusion detection by constructing fuzzy decision trees. For efficient execution of evolutionary algorithm we use supervised clustering to generate an initial set of membership functions for fuzzy rules. In our method both performance and complexity of fuzzy rules (or fuzzy decision trees) are taken into account in fitness evaluation. We also use evaluation with data partition, membership degree caching and zero-pruning to reduce time for construction and evaluation of fuzzy decision trees. For performance evaluation, we experimented with our method over the intrusion detection data of KDD'99 Cup, and confirmed that our method outperformed the existing methods. Compared with the KDD'99 Cup winner, the accuracy was increased by 1.54% while the cost was reduced by 20.8%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• Journal of Korean Library and Information Science Society
• /
• v.46 no.3
• /
• pp.89-118
• /
• 2015

We had opened a course in the library and information science curriculum, developed and applied a syllabus and some manuals for this course, and analyzed the performance by conducting a survey before and after the training. As the results, first, the necessary components showed a positive relationship of 0.414 with the expected performance effects and showed a positive relationship of 0.452 with the expected learning outcomes. Second, the understanding degree of the Capstone Design course was 3.56 before implementing the curriculum. It was improved to 4.07 after implementing the educational courses. Third, the recognition of the components necessary for the Capstone Design course was improved from 4.13 to 4.39 after carrying out the course. Fourth, the perception of the expected performance effects of the Capstone Design course was improved from 3.77 to 3.88 after the course execution. Fifth, the perception of the expected learning outcomes of the Capstone Design course was improved from 3.79 to 4.22 after the course implementation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2581-2595
• /
• 1997

In this paper, the real-time facility of the operating system for a VOD(Video On Demand) server have been analyzed and implemented. The requirements of the real-time scheduling have been gathered by analyzing the model of the video-data-transfer-path. Particularly, the influence of the bottleneck subsystem have been analyzed. Thus, we have implemented the real-time scheduler and primitives which is proper for processing the digital video. In performance measurements, the degree of the guarantee of the real-time scheduler have been experimented. The measured data show that the most time constraints of the process is satisfied. But, the network protocol processing by the interrupt is a major obstacle of the real-time scheduling. We also have compared the difference between the real-time scheduler and the non-real-time scheduler by measuring the inter-execution time. According to the measured results, the real-time scheduler should be used for efficient video service because the processor time allocated to the process can't be estimated when the non-real-time scheduler is used.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.333-344
• /
• 2008

In recent years, the web services composition has received much attention. By web services composition, we mean providing a new service that does not exist on the repository. In this paper, we propose a new system called PSR for web services composition search using a relational database. We also propose algorithms for pre-computing web services composition using joins and indices. We store ontologies from web services in RDBMS, so that the PSR system returns web services composition in order of similarity with user query through the degree of the ontology matching. We demonstrated that our pre-computing web services composition approach in RDBMS yields lower execution time and good scalability when handling a large number of web services and user queries.