• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.83-97
• /
• 2015

IEEE 802.15.4 is a global standard designed for emerging applications in low-rate wireless personal area networks (LR-WPANs). The standard provides beneficial features, such as a beacon-enabled mode and guaranteed time slots for realtime data delivery. However, how to optimally operate those features is still an open issue. For the optimal operation of the features, this paper proposes a holistic optimization method that jointly optimizes three cross-related problems: cluster-tree construction, nodes' power configuration, and duty-cycle scheduling. Our holistic optimization method provides a solution for those problems so that all the real-time packets can be delivered within their deadlines in the most energy-efficient way. Our simulation study shows that compared to existing methods, our holistic optimization can guarantee the on-time delivery of all real-time packets while significantly saving energy, consequently, significantly increasing the lifetime of the network. Furthermore, we show that our holistic optimization can be extended to take advantage of the spatial reuse of a radio frequency resource among long distance nodes and, hence, significantly increase the entire network capacity.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.53-66
• /
• 2013

Bounding the worst-case DRAM performance for a real-time application is a challenging problem that is critical for computing worst-case execution time (WCET), especially for multicore processors, where the DRAM memory is usually shared by all of the cores. Typically, DRAM commands from consecutive DRAM accesses can be pipelined on DRAM devices according to the spatial locality of the data fetched by them. By considering the effect of DRAM command pipelining, we propose a basic approach to bounding the worst-case DRAM performance. An enhanced approach is proposed to reduce the overestimation from the invalid DRAM access sequences by checking the timing order of the co-running applications on a dual-core processor. Compared with the conservative approach, which assumes that no DRAM command pipelining exists, our experimental results show that the basic approach can bound the WCET more tightly, by 15.73% on average. The experimental results also indicate that the enhanced approach can further improve the tightness of WCET by 4.23% on average as compared to the basic approach.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

• Journal of Advanced Navigation Technology
• /
• v.2 no.2
• /
• pp.132-142
• /
• 1998

In optical scanning holography, 3-D holographic information of an object is generated by 2-D active optical scanning. The optical scanning beam can be a time-dependent Gaussian apodized Fresnel zone plate. In this technique, the holographic information manifests itself as an electrical signal which can be sent to an electron-beam-addressed spatial light modulator for coherent image reconstruction. This technique can be applied to 3-D optical remote sensing especially for identifying flying objects. In this paper, we first briefly review optical scanning holography and analyze the resolution achievable with the system. We then present mathematical expression of real and virtual image which are responsible for holographic image reconstruction by using Gaussian beam profile.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.259-266
• /
• 2011

Femtocells are expected as the surest way to increase the system capacity with higher-quality links and more spatial reuse in future networks. In spite of their great potential, the system capacity is highly susceptible to network density because a large portion of users are exposed to inter-cell interference (ICI). In this work, we proposed a dynamic interference avoidance scheme in densely deployed cell environments. Our proposed DDIA (Distributed Dynamic ICI Avoidance) scheme not only works in a fully distributed manner, but also controls interference link connectivity of users with high agility so that it is suited for self-organizing networks (SONs). We introduced the concept of ICI-link and two-tier scheduling in designing the DDIA scheme. To avoid ICI without any central entity, our scheme tries to harmonize all base stations (BSs) with users adaptively. Through extensive simulations, it was shown that our proposed scheme improves the throughput of users by more than twice on average compared to the frequency reuse factor 1 scheme, who are exposed to ICI while maintaining or even improving overall network performance. Our scheme operates well regardless of network density and topology.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.355-364
• /
• 2000

Application sharing for collaborative works make multiple participants to be capable of collaborative developments through sharing development tools and applications which is distributed to various system without spatial restriction. However, applying legacy application sharing to CSCW based virtual environment has a problem because it dont consider 3D space and it disturbs the harmonic interaction of participants. In this study, we designed application sharing system for collaborative works in 3D virtual environment to share application effectively on collaborative virtual environment. The designed application sharing system for collaborative works in 3D virtual environment consist of application sharing manager, group manager and communication manager. This system is able to perceive event of 3D space about application of participant on 3D virtual environment by agent which moves to participant sites and get an ordered events and conflict among participants through scheduling. Therefore, designed application sharing system for collaborative work in 3D virtual environment can support efficient collaborative works and improve reusability of legacy application through using easily legacy application in 3D virtual environment when CSCW application development for virtual environments.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• Research in Plant Disease
• /
• v.8 no.2
• /
• pp.84-91
• /
• 2002

Disease forecasting in Korea was first studied in the Department of Fundamental Research, in the Central Agricultural Technology Institute in Suwon in 1947, where the dispersal of air-borne conidia of blast and brown spot pathogens in rice was examined. Disease forecasting system in Korea is operated based on information obtained from 200 main forecasting plots scattered around country (rice 150, economic crops 50) and 1,403 supplementary observational plots (rice 1,050, others 353) maintained by Korean government. Total number of target crops and diseases in both forecasting plots amount to 30 crops and 104 diseases. Disease development in the forecasting plots is examined by two extension agents specialized in disease forecasting, working in the national Agricul-tural Technology Service Center(ATSC) founded in each city and prefecture. The data obtained by the extension agents are transferred to a central organization, Rural Development Administration (RDA) through an internet-web system for analysis in a nation-wide forecasting program, and forwarded far the Central Forecasting Council consisted of 12 members from administration, university, research institution, meteorology station, and mass media to discuss present situation of disease development and subsequent progress. The council issues a forecasting information message, as a result of analysis, that is announced in public via mass media to 245 agencies including ATSC, who informs to local administration, the related agencies and farmers for implementation of disease control activity. However, in future successful performance of plant disease forecasting system is thought to be securing of excellent extension agents specialized in disease forecasting, elevation of their forecasting ability through continuous trainings, and furnishing of prominent forecasting equipments. Researches in plant disease forecasting in Korea have been concentrated on rice blast, where much information is available, but are substan-tially limited in other diseases. Most of the forecasting researches failed to achieve the continuity of researches on specialized topic, ignoring steady improvement towards practical use. Since disease forecasting loses its value without practicality, more efforts are needed to improve the practicality of the forecasting method in both spatial and temporal aspects. Since significance of disease forecasting is directly related to economic profit, further fore-casting researches should be planned and propelled in relation to fungicide spray scheduling or decision-making of control activities.