• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.33-45
• /
• 2007

Using switches and sensors informing the current on or off state, this paper suggests a sleeping control and remote monitoring system that not only can recognize the sleeping situations but also can control for keeping an appropriate sleeping situation remotely, And we show an example that this system is applied to the healthcare sleeping mat, Our system comprises the following 3 parts: a part for detecting the sleeping situations, a part for extracting sensing data and sending/receiving the relating situated data, and a part controlling and monitoring the all of sleeping situations. In details, in order to develop our system, we used the touch and pressure-sensitive sensors with On/Off functions for a purpose of the first part, The second part consists of the self-developed embedded board with the socket based communication as well as extracting real-time sensing data. And the third part is implemented by service modules for providing controlling and monitoring functions previously described. Finally, these service modules are implemented by the TMO scheme, one of real-time object-oriented programming models and the communications among them is supported using the TMOSM of distributed real-time middleware.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.402-415
• /
• 2001

Advantages of flash memories are their shock resistance and fast read speed, which is much faster than that of a HDD. Because of these characteristics, they are increasingly used in the traditional household electric appliance and portable handset and therefore, development of file systems which use them as storage medium is increasingly needed. But they have two problems as storage medium. First, data stored in them cannot be overwritten: it must be erased before new data can be stored. Unfortunately, this erase operation usually takes about one second. Consequently, updating data in flash memories takes long time. In this paper, their problem is solved by using a data update mechanism like LFS(Log-structured File System). Second, their erase operations are restricted. We propose novel cleaning policy in order to increase the life cycle. We implemented FAT file system, which is suitable to small storage medium and solved problems, which usually happen in implementing FAT. We evaluated the performance of sequential writes and random writes on our implemented flash file system.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2018

Enhancing performance of big data analytics in distributed environment has been issued because most of the big data related applications such as machine learning techniques and streaming services generally utilize distributed computing frameworks. Thus, optimizing performance of those applications at Spark has been actively researched. Since optimizing performance of the applications at distributed environment is challenging because it not only needs optimizing the applications themselves but also requires tuning of the distributed system configuration parameters. Although prior researches made a huge effort to improve execution performance, most of them only focused on one of three performance optimization aspect: application design, system tuning, hardware utilization. Thus, they couldn't handle an orchestration of those aspects. In this paper, we deeply analyze and model the application processing procedure of the Spark. Through the analyzed results, we propose performance optimization schemes for each step of the procedure: inner stage and outer stage. We also propose appropriate partitioning mechanism by analyzing relationship between partitioning parallelism and performance of the applications. We applied those three performance optimization schemes to WordCount, Pagerank, and Kmeans which are basic big data analytics and found nearly 50% performance improvement when all of those schemes are applied.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.506-511
• /
• 2015

IOV is a technology that supports one or more virtual desktops, and can share a single physical device. In general, the virtual desktop uses the virtual IO devices which are provided by virtualization SW, using SW emulation technology. Virtual desktops that use the IO devices based on SW emulation have a problem in which service quality and performance are declining. Also, they cannot support the high-end application operations such as 3D-based CAD and game applications. In this paper, we propose a physical network separation system using Virtual Desktop Service based on HW direct assignments to overcome these problems. The proposed system provides independent desktops that are used to access the intranet or internet using server virtualization technology in a physical desktop computer for the user. In addition, this system can also support a network separation without network performance degradation caused by inspection of the network packet for logical network separations and additional installations of the desktop for physical network separations.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.247-261
• /
• 2002

Aggregation is an important operation that affects the performance of OLAP systems. In this paper we define a new class of aggregation queries, called range-groupby queries, and present a method for processing them. A range-groupby query is defined as a query that, for an arbitrarily specified region of an n-dimensional cube, computes aggregations for each combination of values of the grouping attributes. Range-groupby queries are used very frequently in analyzing information in MOLAP since they allow us to summarize various trends in an arbitrarily specified subregion of the domain space. In MOLAP applications, in order to improve the performance of query processing, a method of maintaining precomputed aggregation results, called the prefix-sum array, is widely used. For the case of range-groupby queries, however, maintaining precomputed aggregation results for each combination of the grouping attributes incurs enormous storage overhead. Here, we propose a fast algorithm that can compute range-groupby queries with minimal storage overhead. Our algorithm maintains only one prefix-sum away and still effectively processes range-groupby queries for all possible combinations of the grouping attributes. Compared with the method that maintains a prefix-sum array for each combination of the grouping attributes in an n-dimensional cube, our algorithm reduces the space overhead by (equation omitted), while accessing a similar number of cells.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• Journal of Advanced Navigation Technology
• /
• v.14 no.3
• /
• pp.452-458
• /
• 2010

In case of an embedded system with computing resource restrictions such as system power and cpu, the overhead due to displaying data on the computer screen may have a significant influence on the system performance. This paper describes an initialization method for LCD-driving components such as an ARM Core, an LCD controller, and an SPI(serial peripheral interface). It also introduces a pixel display function and a panel display method using virtual screen for reducing the display overhead for an LN2440SBC system with an ARM9-based S3C2440A microprocessor. A virtual screen is a large space of computer memories allocated much larger than those needed for one-time display of an image. Displaying a specific region of a virtual screen is done by assigning it as a view-port region. Such a display is useful in an embedded system when concurrently running tasks produce and display their respective results on the screen; it is especially so when the execution result of each task is partially modified, instead of being totally modified, on its turn and displayed. If the tasks running on such a system divide and make efficient use of the region of the virtual screen, the display overhead can be minimized. For the performance comparison with and without using the virtual screen, two different images are displayed in turn and the amount of time consumed for their display is measured. The result shows that the display time of the former is about 5 times faster than that of the latter.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1167-1176
• /
• 2004

Along the advent of Internet technology, the computing environment has been considerably changed in many application domains. Especially, a lot of researches for e-Logistics have been done for the last 3 years. The e-Logistics means the virtual business activity and service architecture among the logistics companies based on the Internet technology. To construct effectively the e-Logistics framework, researches on the development of the Moving Object Technology(MOT) including GPS and GIS with spatiotemporal databases technique so far has been done The Moving Object Technology stands for the efficient management for the spatiotemporal objects such as vehicles, airplanes, and vessels which change continuously their spatial location along with time flows. However, most systems manage just only the location information detected lately by many reasons so that the uncertainty processing for the past and future location of the moving objects is still very hard. In this paper, we propose the moving object uncertainty model and system design for e-Logistics applications. The MOMS architecture in e-Logistics is suggested and the detailed explain of sub-systems including the uncertainty processor of moving objects is described. We also explain the comprehensive examples of MOMS and uncertainty processing in Delivery Parcel Application that is one of major application of e-Logistics domain.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.33-42
• /
• 2012

Rapid evolution of wired and wireless technologies results in various types of embedded systems, and the software to be embedded into those devices now needs the flexibility rather than the fixedness which was well-known property for the embedded software in the past. Mobile agent is one of the useful distributed technologies of reducing network load and latency because of its disconnected operations and high asynchrony. In this paper, a component-based mobile agent framework, called EmHUMAN, is designed and implemented for structural embedding into the devices showing different functions and resource constraints. It consists of 3 layers of components. Based on those components, a structural embedding, considering resource constraints of required functions, amount of storage space, computing power, network bandwidth, ${\ldots} $ etc can be performed. The components in each layer can be extended with addition of new components, removing some components and modifying components. EmHUMAN plays the role of a framework for developing mobile agent based distributed systems. It is also a mobile agent system by itself. EmHUMAN provides several utilities as built-in API's, and thus high effectiveness in programming mobile agents can be achieved.

• Science of Emotion and Sensibility
• /
• v.10 no.4
• /
• pp.583-601
• /
• 2007

The desktop interface is not suitable for the environment in which mobile devices are used commonly with moving, because much attention should be paid for it. And the miniaturizing of mobile devices increases the workload for using them, makes the operation speeds lower and makes more errors. So the study of appropriate level of the input interface for this changing environment is needed. In the aspect of mobile devices. input style and the complexity of the menu hierarchy, this study will look for the way to decrease the workload when doing some primary tasks and using mobile devices simultaneously with moving. The input style was classified into gesture input style, button input style, and pointing input style. The accuracy and speed were measured when doing dual tasks, including a menu searching task and a figure memory task, through one input style of three. By Changing the level of menu hierarchy in the menu searching task, the accuracy of task execution was examined. These Experiments were done in standing state and moving state. In both state the pointing input style was the highest in the accuracy of task execution but the slowest in the speed. In contrast, the gesture input style was not high in the accuracy but the fastest in the speed. This fact shows that the gesture input style is suitable for the condition needed for speedy processing rather than accurate execution when moving.