• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.369-371
• /
• 2012

Wireless sensor networks have taken immense interest in healthcare systems in recent years. One example of it is in an in vivo sensor that is deployed in critical and sensitive healthcare applications like artificial retina, cardiac pacemaker, drug delivery, blood pressure, internal heat calculation, glucosemonitoring etc. In vivo sensor nodes exhibit temperature that may be very dangerous for human tissues. However, existing in vivo thermal aware routing approaches suffer from hotspot creation, delay, and computational complexity. These limitations motivate us toward an in vivo virtual backbone, a small subset of nodes, connected to all other nodes and involved in routing of all nodes, -based solution. A virtual backbone is lightweight and its fault-tolerant version allows in vivo sensor nodes to disconnect hotspot paths and to use alternative paths. We have formulated the problem as m-connected k-dominating set problem with minimum temperature cost in in vivo sensor network. This is a combinatorial optimization problem and we have been motivated to use evolutionary approach to solve the problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1189-1192
• /
• 2003

본 연구는 어떤 조직 내에서의 네트워크를 내부 네트워크와 외부 네트워크로 구분하고, 이들에 각각의 서버를 할당하여 분산된 서비스를 제공하는 환경을 대상으로 한다. 각 서버의 특성에 맞게 TCP Parameter 중의 하나인 Window Size를 설정하여 내부 네트워크의 성능 향상을 시도하였다. 외부 네트워크에서는 Window Size 가 큰 영향을 미치지 못하나 내부 네트워크에서는 Window Size 에 따라서 처리율(Throughput)이 크게 달라진다. 본 연구에서는 Window Size 의 조절을 통해서 내부 네트워크의 처리율(throughput) 변화를 NS-2 를 사용하여 시뮬레이션 해 보고 그 결과를 비교하여 내부 네트워크의 성능 향상을 확인하고자 한다.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.315-326
• /
• 2007

The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. This paper presents a dynamic anomaly detection scheme that can effectively identify a group of especially harmful internal masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on the feature values, the use pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function with both the age of the user profile and weighted feature values. The performance of our scheme is evaluated by a simulation. Simulation results demonstrate that the anomalies are well detected by the proposed dynamic scheme that considers the age of user profiles.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.423-425
• /
• 2015

최근 대형 마트 및 백화점에서는 옴니채널 형식의 유통전략이 급부상하고 있으나, 소상공인 및 전통시장은 고비용의 옴니채널 형식을 도입하기가 어렵다. 이를 해결하고자 소자본으로 구축 가능한 니즈 분석을 활용한 모바일 플랫폼이 고안되었으나, 단순히 사용자의 행동 및 후기를 활용한 니즈분석은 개인만의 선호도 분석으로서 타인의 선호도를 알 수 없다는 문제점이 있다. 본 논문에서는 앞서 언급한 내 외부 소셜 네트워크 서비스를 활용하여 타인의 상품 선호도 또한 분석하고 결합하여 보다 효과적으로 상품 선호도 분석을 하였으며 사용자 지정 선호도 분석을 지원한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.699-700
• /
• 2013

This paper proposes a new visualization method based on cloud technique which uses internal relationship of user correlation and external relation of social network to visualize user relationship hierarchy. The proposed method use hadoop and hive for distribution storing and parallel processing which the result of calculation visualizes hierarchy graph using D3.

• Language and Information
• /
• v.5 no.1
• /
• pp.35-53
• /
• 2001

As a subtype of English relative clause constructions, free relative constructions like what John ate in I ate what John ate exhibit complicated syntactic and semantic properties. In particular, the constructions have mixed properties of nominal and verbal: they have the internal syntax of sentence and the external syntax of noun phrase. This paper provides a constraint-based approach to these mixed constructions, and shows that simple constructional constraints are enough to capture their complexities. The paper begins by surveying the properties of the constructions. In discusses two types(Specific and nonspecific) of free relatives, their ,lexical restrictions nominal properties and behavior with respect to extraposition, piped piping and stacking Following these it sketches the basic framework of the HPSG(Head-driven Phrase Structure Grammar) which is of relevance in this paper. As the main part, the paper presents a constraint- based analysis in which tight interactions between grammatical constructions and a rich network of inheritance relations play important roles in accounting for the basic as well as complex properties of the constructions is question.

• Journal of the Korean Society for Library and Information Science
• /
• v.41 no.4
• /
• pp.181-199
• /
• 2007

A ubiquitous refers to the integration of the existing documentation. cyber space, and high-tech digital technology into a wireless terminal through ubiquitous computing and network technology. With the ubiquitous environment, a library and museum can extend its roles and functions all the more, and expectedly results in internal and external great changes. The purpose of this study was to examine the changed forms and contents of a ubiquitous-library/museum. Specially, We wished to forecast change that occur in museum user service and government official management side.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.389-405
• /
• 2015

Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce a column-oriented database model based on flash memory and then propose a new column-aware flash indexing scheme for the high-speed column-oriented data warehouse systems. Our index management scheme, which uses an enhanced $B^+$-Tree, achieves superior search performance by indexing an embedded segment and packing an unused space in internal and leaf nodes. Based on the performance results of two test databases, we concluded that the column-aware flash index management outperforms the traditional scheme in the respect of the mixed operation throughput and its response time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.643-644
• /
• 2014

정보기술의 발달과 인터넷의 확산 등의 사회적인 변화에 따라 고객을 효과적으로 만족시킬 수 있도록 기업은 고객과의 장기적인 관계를 구축하는 고객관계관리(CRM: Customer Relationship Management)을 사용하고 있다. 최근에는 블로그나 SNS등에 기업이 상품이나 서비스를 팔고자 하는 소비자들이 가득 모여 있기 때문에 실시간으로 소비자의 니즈를 파악할 수 있는 방법으로 트위터, 블로그, 카페 등 SNS 상의 빅 데이터를 분석하는 시스템을 이용한다. 본 논문에서는 고객의 보다 효율적인 피드백 수집분석을 위해 기존의 기업/기관에서 운영 및 관리하는 내부 CRM 데이터와 SNS 상의 외부 데이터를 연동하여 분석할 수 있는 이기종 데이터의 통합 분석엔진 시스템을 제안한다. 이를 의료서비스에 적용하여 내부 데이터인 매출, 방문자 수, 진료과 정보, 환자 정보, 고객 불만 유형 등을 분석하고 소셜데이터를 통해 해당 의료기관에 대한 소비자 경험 (진료, 시설 등) 정보를 수집한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.38-45
• /
• 2007

With the emergence of new applications, packet classification is essential for supporting advanced internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, internet routers need to classify incoming packet quickly into flows. In this paper, we present multi-phase packet classification architecture using an internal buffer for fast packet processing. Using internal buffer between address pair searching phase and remained fields searching phases, we can hide latency from the characteristic that search times of source and destination header fields are different. Moreover we guarantee the improvement by using single entry caching. The proposed architecture is easy to apply to different needs owing to its simplicity and generality.