• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.201-205
• /
• 2009

This paper addresses issues to efficiently collect and aggregate data of sources within a local and adjacent region in geographic routing for wireless sensor networks. We first introduce the concept of a local sink which collects and aggregates data form source nodes in the region and delivers the aggregated data to a global sink. We also design a model to determine an optimal location of the local sink and propose a mechanism to collect data through the local sink. Simulation results show that the proposed mechanism with the local sink is more efficient in terms of the energy and the data delivery ratio than the existing mechanism without the local sink in a geographic routing.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.604-609
• /
• 2014

Decoding processes in portable media players have a high computational cost, resulting in high power consumption by the CPU. If decoding computations are reduced, the power consumed by the CPU is also be reduced, but such a choice generally results in a degradation of the video quality for the users, so it is essential to address this tradeoff. We proposed a new CPU power management scheme that can make use of the scalability property available in the H.164/SVC standard. We first proposed a new video quality model that makes use of a video quality metric(VQM) in order to efficiently take into account the different quantization factors in the SVC. We then propose a new dynamic voltage scaling(DVS) scheme that can selectively combine the previous decoding times and frame sizes in order to accurately predict the next decoding time. We then implemented a scheme on a commercial smartphone and performed a user test in order to examine how users react to the VQM difference. Real measurements show that the proposed scheme uses up to 34% fewer energy than the Linux DVFS governor, and user tests confirm that the degradation in the quality is quite tolerable.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.298-305
• /
• 2009

In contrast to content_based filtering systems, collaborative filtering systems not only don't contain information of items, they can not recommend items when users don't provide the information of their interests. In this paper, we propose the recommender agent using association item tree to solve the shortcomings of collaborative filtering systems. Firstly, the proposed method clusters users into groups using vector space model and K-means algorithm and selects group typical rating values. Secondly, the degree of associations between items is extracted from computing mutual information between items and an associative item tree is generated by group. Finally, the method recommends items to an active user by using a group typical rating value and an association item tree. The recommender agent recommends items by combining user information with item information. In addition, it can accurately recommend items to an active user, whose information is insufficient at first rate, by using an association item tree based on mutual information for the similarity between items. The proposed method is compared with previous methods on the data set of MovieLens recommender system.

• KIISE Transactions on Computing Practices
• /
• v.23 no.11
• /
• pp.641-649
• /
• 2017

As Internet of Things devices become pervasive, services improve to better assess the context and to alert other users to deal with emergencies. Such services use Internet of Things devices to detect the context around the user and promptly notify public institutions, hospitals or other parental users in emergencies. Most of these systems analyze an event when the value of the device is unchanged for a period of time or if it detects an abnormal value. However, just monitoring sensor values makes it difficult to accurately understand the context surrounding a user. Also if the device is inactive, it can not identify the context or provide services again. However, understanding the user requirements, services provided through other devices, information sent to other users lets, appropriate actions be taken. This paper, proposes a device search method and system based on a context-aware model that includes user demands. The proposed system analyzes the user's context and demands by using data collected from the internet of things devices. If user devices are inactive, they can recognize other devices by searching for other devices and providing services to users again. Through the proposed method, the user-centric services are provided. This method also analyzes and responds to requirements in various emergencies.

• KSCI Review
• /
• v.14 no.2
• /
• pp.205-214
• /
• 2006

Is need Remote Access through internet for business of Ubiquitous Computing age, and apply OTP for confidentiality about inputed ID and Password, network security of integrity. Current OTP must be possessing hardware or Token, and there is limitation in security. Install a Snooping tool to OTP network in this treatise, and because using Cain, enforce ARP Cache Poisoning attack and confirm limitation by Snooping about user password. Wish to propose new system that can apply Tokenless OTP by new security way, and secure confidentiality and integrity. Do test for access control inflecting Tokenless OTP at Remote Access from outside. and could worm and do interface control with certification system in hundred. Even if encounter hacking at certification process, thing that connection is impossible without pin number that only user knows confirmed. Because becoming defense about outward flow and misuse and hacking of password when apply this result Tokenless OTP, solidify security, and evaluated by security system that heighten safety.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.289-298
• /
• 2006

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the portability of mobile clients. Mobile computing satisfies user's demands for convenience and performance to use information at any time and in any place, but it has many problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Continuous Query Processing System(MCQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client server environments. We proved the superiority of the proposed MCQPS by comparing its performance to the C I S(Client-Intercept-Slaver) model. In Addition, we experiment on proposed index structure and methodology in various methods.

• Journal of Digital Convergence
• /
• v.15 no.6
• /
• pp.229-236
• /
• 2017

An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called "CAWFP-Growth" that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

• Journal of Internet Computing and Services
• /
• v.18 no.4
• /
• pp.89-97
• /
• 2017

The purpose of the present study was to estimate the effect of adolescents' depression on cell phone dependency and to identify mediating effects of parenting style and peer isolation. The study used data from the $6^{th}$ waves of 2015 KCYPS(Korean Children and Youth Panel Survey). Structural Equation Model(SEM) was conducted to examine the mediating effects of parenting style and peer isolation. The results showed that adolescents' depression had positive effects on cell phone dependency. In addition, the relationship between adolescents' depression and cell phone dependency was partially mediated by parenting style, not mediated by peer relationships. Based on these findings, further suggestions are provided to reduce adolescents' cell phone dependency by decreasing parent's over-involvement and improve adolescents' self control opportunities.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.111-117
• /
• 2004

In distributed-computing environments, there is a strong demand for the authentication and the access control of distributed-shared resources. I have presented role-based access control (RBAC) concept that is in the spotlight recently. RBAC model shows the standardized access control of complicated organization's resources. In RBAC, senior role has junior role's permission by virtue of role hierarchy. But, junior role cannot perform the permission, which is granted to the senior or other role groups. Inheritances of permissions in role hierarchies are static. In order to tackle this problem, I propose a dynamic role assignment, which classified into passive role assignment and active role assignment, and design dynamic role assignment protocol and implement role assignment server.