• Journal of Information Processing Systems
• /
• v.3 no.2
• /
• pp.43-53
• /
• 2007

The use of agent paradigm in today's applications is hampered by the security concerns of agents and hosts alike. The agents require the presence of a secure and trusted execution environment; while hosts aim at preventing the execution of potentially malicious code. In general, hosts support the migration of agents through the provision of an agent server and managing the activities of arriving agents on the host. Numerous studies have been conducted to address the security concerns present in the mobile agent paradigm with a strong focus on the theoretical aspect of the problem. Various proposals in Intrusion Detection Systems aim at securing hosts in traditional client-server execution environments. The use of such proposals to address the security of agent hosts is not desirable since migrating agents typically execute on hosts as a separate thread of the agent server process. Agent servers are open to the execution of virtually any migrating agent; thus the intent or tasks of such agents cannot be known a priori. It is also conceivable that migrating agents may wish to hide their intentions from agent servers. In light of these observations, this work attempts to bridge the gap from theory to practice by analyzing the security mechanisms available in Aglet. We lay the foundation for implementation of application specific protocols dotted with access control, secured communication and ability to detect tampering of agent data. As agents exists in a distributed environment, our proposal also introduces a novel security framework to address the security concerns of hosts through collaboration and pattern matching even in the presence of differing views of the system. The introduced framework has been implemented on the Aglet platform and evaluated in terms of accuracy, false positive, and false negative rates along with its performance strain on the system.

• The Journal of Korean Association of Computer Education
• /
• v.3 no.2
• /
• pp.107-114
• /
• 2000

In this study, a program for statistics education is developed. This program deals with statistical hypothesis testing which is indispensible to demonstrate the research hypothesis. Statistical inference which is the process of using data obtained from a sample to make inference about the characteristics of a population is an essential concept to peoples to learn or use statistics. But in practice, there are many cases of wrong application and peoples think that statistics is hard to understand. Therefore, it is very important subject to teach easily and rightly statistics, specially elementary statistics. This program is developed especially for non-specialist. This program under multimedia environment which includes sound, video, animation etc. can interest students greatly. It doesn't show only the result but make it possible for students to execute the program by stages. By executing it, the students can understand the method and meaning of statistical hypothesis testing naturally.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.189-196
• /
• 2012

This paper proposes Swap algorithm for solving Dynamic Economic Dispatch (DED) problem. The proposed algorithm initially balances total load demand $P_d$ with total generation ${\Sigma}P_i$ by deactivating a generator with the highest unit generation cost $C_i^{max}/P_i^{max}$. It then swaps generation level $P_i=P_i{\pm}{\Delta}$, (${\Delta}$=1.0, 0.1, 0.01, 0.001) for $P_i=P_i-{\Delta}$, $P_j=P_j+{\Delta}$ provided that $_{max}[F(P_i)-F(P_i-{\Delta})]$ > $_{min}[F(P_j+{\Delta})-F(P_j)]$, $i{\neq}j$. This new algorithm is applied and tested to the experimental data of Dynamic Economic Dispatch problem, demonstrating a considerable reduction in the prevalent heuristic algorithm's optimal generation cost and in the maximization of economic profit.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.149-155
• /
• 2013

Commonly, one seeks a particular pattern suitable for stock cutting and the number of such patterns through linear programming. However, since the number of the patterns increases exponentially, it is nearly impossible to predetermine all the existing patterns beforehand. This paper thus proposes an algorithm whereby one could accurately predetermine the number of existing patterns by applying Suliman's feasible pattern method. Additionally, this paper suggests a methodology by which one may obtain exact polynomial-time solutions for feasible patterns without applying linear programming or approximate algorithm. The suggested methodology categorizes the feasible patterns by whether the frequency of first occurrence of all the demands is distributed in 0 loss or in various losses. When applied to 2 data sets, the proposes algorithm is found to be successful in obtaining the optimal solutions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.8-15
• /
• 2009

Although traditional single-hop cellular networks had been serving well in past years, they are no longer economically feasible in supporting high data-rate, multimedia services of $4^{th}$Generation (4G) communications due to the requirement of high transmission power By contrast, multi-hop cellular networks (MCN) are capable of dramatically saving the transmission power by overlaying the capability of ad hoc networking among mobile terminals on the cellular network infrastructure. To achieve this performance gain as well as enable 4G services, an efficient routing protocol needs to be designed for MCN. In this paper, we propose a reactive route discovery protocol for MCN that uses directional information to the base station in the route discovery process. Our analysis/simulation results have demonstrated that the proposed protocol significantly reduces flooding overheads. In addition, we consider issues for 4G services in MCN and applications of the proposed protocol.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.2
• /
• pp.112-121
• /
• 2011

The IEEE WAVE standard specification does not support handover operation since it is designed to transmit mainly the ITS-related messages that are limited in length. More advanced multimedia applications such as Internet browsing and streaming of video clips produced by CCTVs, however, require handover support such that a sequence of data packets can be received seamlessly while an OBU's association with the RSUs changes. This paper presents a new handover scheme that can operate without performance degradation in the cases where there are multiple RSUs in the areas of handover by making use of the IEEE 802.11f IAPP Move-notify messages, based on the fast handover scheme with proactive caching by disassociation messages introduced previously. Experimental results from the simulation shows that the proposed handover scheme outperforms the scheme based solely on multicast.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.413-420
• /
• 2020

The Tactical Information and Communication Network system provides real-time multimedia services such as voice and data by utilizing the Mobile Subscriber Access Point. At this time, an external transmission path is constructed through the Low Capacity Trunk Radio and the High Capacity Trunk Radio system. The communication devices of each wireless transmission system are mounted on a tactical vehicle and a secondary battery is used to prevent a power interruption when the supply power to the tactical vehicle is transferred to the integrated power control device. In this paper, the basic design of the Wireless Power Transfer device for charging the battery of the integrated power control system of the mobile base station system using the Loading Distribution Method and checking the number of primary windings and the core material selection by the air gap through the Finite Elements Method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.579-586
• /
• 2020

There is a large amount of multimedia data on the web page, and a method of extracting semantic information from low level visual information for accurate retrieval is being studied. However, most of these techniques extract one of information from a single image, so it is difficult to extract semantic information when multiple objects are combined in the image. In this paper, each low-level feature is extracted to extract various objects and backgrounds in an image, and these are divided into predefined backgrounds and objects using SVM. The objects and backgrounds divided in this way are constructed with ontology, infer the semantic information of location and association using inference engine. It's possible to extract the semantic information. We propose this method process the complex and high-level semantic information in image.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.295-301
• /
• 2014

In the absence of a sorting algorithm faster than O(n log n), Quicksort remains the best and fastest of its kind in practice. For given n data, Quicksort records running in O(n log n) at best and $O(n^2)$ at its worst. In this paper, I propose an algorithm by which 3-points average P=(L+M+H)/3 is set as a pivot for first array L=a[s], last array H=a[e], and middle array $M=a[{\lfloor}(s+e)/2{\rfloor}]$ in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of O(n log n) at its best, average, and worst cases. And the proposed algorithm can be reduce the $O(n^2)$ time of Quicksort to O(n log n).

• 한국정보교육학회:학술대회논문집
• /
• 2011.01a
• /
• pp.211-217
• /
• 2011

Recent IT (information technology) environmental changes, such as emerging social network services or increasing user participation in multimedia environment, have made it necessary for e-learning systems to undergo changes in various ways. Metadata is an agreement for interoperability between different systems. The standardization of metadata for e-learning system has been driven by some domestic and international organizations, but applying diverse environmental changes into the design of e-learning metadata is in dire need. In this paper, we present a methodology for the analysis and design of modeling e-learning metadata and elicit the design requirements, on the basis of the metadata standard KEM 3.0, about the elements that are expected to be needed in future e-learning systems. Based on the requirements from the analysis, we present the three-layer model for classifying the requirements by the importance of metadata elements per Kana Model. An intelligent e-learning system is to be developed based on the proposed modeling design, which we hope to influence the development of an international standard in the future.