• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.105-109
• /
• 2010

While numerous information services are provided on the Web as a core infrastructure of information society, semantic services using the Semantic Web technologies still stay deployed number and application range. This situation would be mainly originated from the failure of securing reliability to the user. Thus, this paper introduces an evaluation method for measuring reliabilities of the semantic services comparatively. To measure the reliability of the compared systems, the observer assesses 'precision in task performance' as a quantitative analysis and 'reliability of expectation-result' as a qualitative analysis described by the test persons. On the other hand, the test person should rate the functional reliability and reliability of the served information on the vector graph by himself with a scale from 0 to 5. Experimental results show that assessment by the observer is very similar to rating value by test persons, and that the accuracy of the served information has a close effect on the functional reliability. Through this paper, we can verify the essential factors for evaluating the reliability of semantic service systems. These are functional reliability and reliability of served information resulting from function execution. In particular, it has been proven that the reliability of the semantic information services largely influences the "Quality in Use" and therefore determines the major factors of the semantic service reliability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.4
• /
• pp.2170-2178
• /
• 2014

In this paper, electroencephalographic (EEG) signal of one among subjects measured biosignal with visual evoked stimuli inducing the concentration was analyzed to detect the changes in the attention status during attention task fulfillment from January to February, 2011. The independent component analysis (ICA) was applied to EEG signals to isolate the attention related innate source signal within the brain and Electroculogram (EOG) artifact from measured EEG signals at the scalp. The consecutive accumulation of short time Fourier transformed (STFT) attention source signal with excluded EOG artifact can enhance the regular depiction of EPOCH graph and spectral color map representing time-varying pattern. The extracted attention indices associated with somatosensory rhythm (SMR: 12-15 Hz), and theta wave (4-7 Hz) increase marginally over time. Throughout experimental observation, the ICA with STFT can be used for the assessment of participants' status of attention.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.310-313
• /
• 2012

Recently, Land reclamation created agricultural land which is farming. Agricultural land which is farming have accident with frequency it is damage to crop of from brine. So, desalinization is the first priority prerequisite task in using the in reclaimed farm land. Vibrant research and technical development is working for reclaimed of desaliaization. But, Current technology is impossible desalinization of reclaimed land. As fast almost of people don't worry about concentration of salt in using the land reclamation of agricultural land irrigation water and river mouth of fountainhead of efforting from freshwater lake also ebb and flow of the tide land reclamation of agricultural land influnce from an increase of salt concentration by weather conditions and a malfunction of sea dike sluice In this paper, current is increased salt concentration in real time graphs were implemented to utilize external servers in using the WCDMA module. Inaddition it have to operate alarm in increase of salt concentration. besides, this program have implemented realtime concentration of salt monitoring system which save date in realtime the user can check again.

• The Mathematical Education
• /
• v.56 no.3
• /
• pp.281-300
• /
• 2017

This study analyzed the difficulties of middle school students in computer simulation of the law of large numbers through eye movement analysis. Some students did not attend to the simulation results and could not make meaningful inferences. It is observed that students keep the existing concept even though they observe the simulation results which are inconsistent with the misconceptions they have. Since probabilistic intuition influence student's thinking very strongly, it is necessary to design a task that allows students to clearly recognize the difference between their erroneous intuitions and simulation results. In addition, we could confirm through eye movements analysis that students could not make meaningful observations and inferences if too much reasoning was needed even though the simulation included a rich context. It is necessary to use visual representations such as graphs to provide immediate feedback to students, to encourage students to attend to the results in a certain intentional way to discover the underlying mathematical structure rather than simply presenting experimental data. Some students focused their attention on the visually salient feature of the experimental results and have made incorrect conclusion. The simulation should be designed so that the patterns of the experimental results that the student must discover are not visually distorted and allow the students to perform a sufficient number of simulations. Based on the results of this study, we suggested that cumulative relative frequency graph showing multiple results at the same time, and the term 'generally tends to get closer' should be used in learning of the law of large numbers. In addition, it was confirmed that eye-tracking method is a useful tool for analyzing interaction in technology-based probabilistic learning.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.1
• /
• pp.34-42
• /
• 2015

Modeling and control of human-involved manufacturing systems poses a huge challenge on how to model all possible interactions among system components within the time and space dimensions. As the manufacturing environment are getting complicated, the importance of human in the manufacturing system is getting more and more spotlighted to incorporate the manufacturing flexibility. This paper presents a formal modeling methodology of affordance-based MPSG (Message-based Part State Graph) for a human-machine collaboration system incorporating supervisory control scheme for flexible manufacturing systems in automotive industry. Basically, we intend to extend the existing model of affordance-based MPSG to the real industrial application of humanmachine cooperative environments. The suggested extension with the real industrial example is illustrated in three steps; first, the manufacturing process and relevant data are analyzed in perspectives of MABA-MABA and the supervisory control; second, the manufacturing processes and task allocation between human and machine are mapped onto the concept of MABA-MABA; and the last, the affordance-based MPSG of humanmachine collaboration for the manufacturing process is presented with UMLs for verification.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.15 no.2
• /
• pp.150-155
• /
• 2012

One of the primary purposes of tugs is for the towing of other ships in salvage operations. In order to conduct such a task safely, the tug should be capable of generating the appropriate towing forces. Therefore the prediction of resistance against a towed ship during towing operation is a very important and essential procedure. This paper studies the ship resistance calculation program to predict towing force. The calculation program consists of the functions that calculate basic hull resistance in calm water, added resistance due to wind, drifting, hull roughness, waves, shallow water and currents. All predictions are calculated by statistical and empirical methods by graph or formula. The calculation results made by this program are compared with the results from the U.S. Navy's Towing Manual. These results confirm that this computer program is quite capable of appropriately predicting the resistance of damaged ships.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.634-648
• /
• 2001

Message Sequence Charts(MSC) has been used to describe the interactions of numerous concurrent tasks in telecommunication software. After the MSC specification is verified in requirement analysis phase, it can be used not only to synthesize state-based design models, but also to generate test sequences. Until now, the verification is accomplished by generating global state transition graph using the location information only. In this paper, we extend the condition statement of MSC to describe the activation condition of scenarios and the change of state variables, and propose an approach to construct global finite state machine (GFSM) using this information. The GFSM only includes feasible states and transitions of the system. We can generate the test sequences using the existing FSM-based test sequence generation technology.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.