• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.123-129
• /
• 2009

Ubiquitous home is emerging as the future digital home environments that provide various ubiquitous home services like u-Life, u-Health, etc. It is composed of some home appliances and sensors which are connected through wired/wireless network. Ubiquitous home services become aware of user's context with the information gathered from sensors and make home appliances adapt to the current home situation for maximizing user convenience. In these context-aware home environments, it is the one of significant research topics to predict user behaviors in order to proactively control the home environment. In this paper, we propose Multi-Level prediction algorithm for context-aware services in ubiquitous home environment. The algorithm has two phases, prediction and execution. In the first prediction phase, the next location of user is predicted using tree algorithm with information on users, time, location, devices. In the second execution phase, our table matching method decides home appliances to run according to the prediction, device's location, and user requirement. Since usually home appliances operate together rather than separately, our approach introduces the concept of mode service, so that it is possible to control multiple devices as well as a single one. We also devised some scenarios for the conceptual verification and validated our algorithm through simulations.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.522-527
• /
• 2008

Socially Intelligent agent is the agent not only having the ability to recognize and to process human affect through learning and adaptation, but also having human-like social intelligence. By making human feel familiar with the computer, the agent is expected to enhance human-computer interaction (HCI) by providing users with the personalized services and interfaces. This paper proposes the framework for socially intelligent agents behaving socially according to the emotions recognized by ID3 algorithm and psychological OCC model. Also, the agent could process with the emotion to make socially intelligent response through three layered affect functioning model. Finally, the proposed agent can be applied for the development and application of socially intelligent agent in wide areas as the agent framework having similar affect and cognitive structure with human being.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1353-1362
• /
• 1999

그래프 드로잉이란 추상적인 그래프를 시각적으로 구성하여 2차원 평면상에 그려주는 작업으로 대칭성은 그래프 드로잉시 고려해야 하는 미적 기준들 중에서 그래프의 구조 및 특성을 표현해주는 가장 중요한 기준이다. 그러나 일반 그래프에서 대칭성을 찾아 그려 주는 문제는 NP-hard로 증명이 되어 있기 때문에 현재까지는 트리, 외부평면 그래프, 직병렬 유향 그래프나 평면 그래프 등으로 대상을 한정시켜 연구가 진행되어 왔다. 본 논문에서는 병렬 컴퓨터나 컴퓨터 네트워크 구조를 가시화 시키기 위하여 많이 사용되는 그래프인 상호연결망(interconnection network)의 대칭성을 분석하고 분석된 대칭성을 최대로 보여주는 대칭 드로잉 알고리즘을 제안하였다. 그리고 이를 기반으로 하여 상호연결망의 기존 드로잉 방법들과 본 논문에서 제안한 대칭 드로잉 등 다양한 드로잉을 지원하는 WWW 기반의 상호연결망 드로잉 시스템을 구현하였다.Abstract Graph drawing is constructing a visually-informative drawing of an abstract graph. Symmetry is one of the most important aesthetic criteria that clearly reveals the structures and the properties of graphs. However, the problem of finding geometric symmetry in general graphs is NP-hard. So the previous work has focused on the subclasses of general graphs such as trees, outerplanar graphs, series-parallel digraphs and planar graphs.In this paper, we analyze the geometric symmetry on the various interconnection networks which have many applications in the design of computer networks, parallel computer architectures and other fields of computer science. Based on these analysis, we develope algorithms for constructing the drawings of interconnection networks which show the maximal symmetries.We also design and implement Interconnection Network Drawing System (INDS) on WWW which supports the various drawings including the conventional drawings and our suggested symmetric drawings.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.16-25
• /
• 2008

Today, mobile phone is a necessity of modern life. For that reason, we suggest a particular system of a mobile phone which take a picture of music score image and automatically play it without any technical knowledges about the music score information. This experiment makes midi, acknowleging separate symbols via preprocessing to music score image taken. This paper utilizes 11 sorts of the score image taken by a mobile phone camera for this experiment. Through this method we suggest, as much as 98% on average takes place, which is very high recognizing ratio. Also, as we introduce this system in a mobile phone by porting, it takes 8.63 seconds on average to create midi following input of images.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.6
• /
• pp.187-194
• /
• 2020

This paper proposes a website fingerprinting method using ensemble learning over a Tor network that guarantees client anonymity and personal information. We construct a training problem for website fingerprinting from the traffic packets collected in the Tor network, and compare the performance of the website fingerprinting system using tree-based ensemble models. A training feature vector is prepared from the general information, burst, cell sequence length, and cell order that are extracted from the traffic sequence, and the features of each website are represented with a fixed length. For experimental evaluation, we define four learning problems (Wang14, BW, CW_T, CW_H) according to the use of website fingerprinting, and compare the performance with the support vector machine model using CUMUL feature vectors. In the experimental evaluation, the proposed statistical-based training feature representation is superior to the CUMUL feature representation except for the BW case.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1409-1415
• /
• 2010

In this paper we proposed the watermarking technique using the markspace which is selected by tree-structure between the subbands in the wavelet domain and feature information in the spatial domain. The watermarking candidate region in the wavelet domain is obtained by the markspace selection algorithm divides the highest frequency subband to several segments and calculates theirs energy and the averages value of the total energy of the subband. Also the markspace of the spatial domain is obtained by the boundary information of a image. The final markspace is selected by the markspaces of the wavelet and spatial domain. The watermark is embedded into the selected markspace using the random addresses by LFSR. Finally the watermarking image is generated using the inverse wavelet transform. The proposed watermarking algorithm shows the robustness against the attacks such as JPEG, blurring, sharpening, and gaussian noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.747-752
• /
• 2011

Microarray classification typically possesses two striking attributes: (1) classifier design and error estimation are based on remarkably small samples and (2) cross-validation error estimation is employed in the majority of the papers. A Microarray data of ovarian cancer consists of the expressions of thens of thousands of genes, and there is no systematic procedure to analyze this information instantaneously. In this paper, gene markers are selected by ranking genes according to statistics, popular classification rules - linear discriminant analysis, k-nearest-neighbor and decision trees - has been performed comparing classification accuracy of data selecting gene markers and not selecting gene markers. The Result that apply linear classification analysis at Microarray data set including marker gene that are selected using ANOVA method represent the highest classification accuracy of 97.78% and the lowest prediction error estimate.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.3
• /
• pp.531-539
• /
• 2019

This paper proposes the training features for malware family analysis and analyzes the multi-classification performance of ensemble models. We construct training data by extracting API and DLL information from malware executables and use Random Forest and XGBoost algorithms which are based on decision tree. API, API-DLL, and DLL-CM features for malware detection and family classification are proposed by analyzing frequently used API and DLL information from malware and converting high-dimensional features to low-dimensional features. The proposed feature selection method provides the advantages of data dimension reduction and fast learning. In performance comparison, the malware detection rate is 93.0% for Random Forest, the accuracy of malware family dataset is 92.0% for XGBoost, and the false positive rate of malware family dataset including benign is about 3.5% for Random Forest and XGBoost.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.3
• /
• pp.63-69
• /
• 2022

In this paper, we propose a new GPU-based framework for quickly calculating adaptive and continuous SDF(Signed distance fields), and examine cases related to rendering/collision processing using them. The quadtree constructed from the triangle mesh is transferred to the GPU memory, and the Euclidean distance to the triangle is processed in parallel for each thread by using it to find the shortest continuous distance without discontinuity in the adaptive grid space. In this process, it is shown through experiments that the cut-off view of the adaptive distance field, the distance value inquiry at a specific location, real-time raytracing, and collision handling can be performed quickly and efficiently. Using the proposed method, the adaptive sign distance field can be calculated quickly in about 1 second even on a high polygon mesh, so it is a method that can be fully utilized not only for rigid bodies but also for deformable bodies. It shows the stability of the algorithm through various experimental results whether it can accurately sample and represent distance values in various models.