• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.399-404
• /
• 2006

A real-time system is used for various systems from small embedded systems to distributed enterprise systems. Because it has a characteristic that provides a service on time, developers should make efforts to keep this property about time when developing real-time applications. As the result of research about real-time system indicates, TMO model supports various functions for time processing according to the real-time concept. And it guarantees response time which developers defined. So developers need a point of reference to define deadline and check the correctness of time. This paper proposes an improved PS-Block as an infrastructure of analysis tools for TMO to present a point of reference. There is a problem that the existing PS-Block has overhead caused by a policy making duplicated blocks. As such, this paper implements a PS-Block Timing Model to reduce the overhead due to block duplication, and defines a base class for searching in PS-Block. The PS-Block Timing Model, using an improved PS-Block structure, offers a point of reference of deadline and an infrastructure of execution time analysis according to the PS-Block configuration policy. Therefore, TMO developers can easily verify deadline of real-time methods, and improve reliability, and reduce development terms.

• Polymer(Korea)
• /
• v.38 no.4
• /
• pp.411-416
• /
• 2014

Due to the polar characteristics of silica compared to carbon black, the degree of silica dispersion, which affects the mechanical properties of rubber compounds, is an important issue. Wolff first introduced the in-rubber structure of particles (${\alpha}_F$) to express the structure development in the compounds; however, with the introduction of bifunctional silanes, his theory could not explain the 3-dimensional network structure of the compounds. Later his theory was expanded to express the composite interaction parameter (in-rubber structure of the compound) (${\alpha}_C$), which included Wolff's filler-filler interaction parameter (${\alpha}_F$), however, there was no reported experimental result proving the theory. This research first experimentally expressed the in-rubber structure of the compound ${\alpha}_C$ (= ${\alpha}_F+{\alpha}_{FP}$(filler-silane-rubber interaction parameter) + ${\alpha}_P$ (rubber-rubber interaction parameter)) upon mono- and bifunctional silane treated silica filled natural rubber (NR) compounds. Using different structure silanes, i.e. PTES, OTES, TESPD, and TESPT, the ${\alpha}_C$ value of each compound was measured and calculated. The ${\alpha}_C$ value of TESPT treated silica filled compound was 1.64, which composed of ${\alpha}_F$ (0.99), ${\alpha}_{FP}$ (0.31), and ${\alpha}_P$ (0.34).

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.56-64
• /
• 1997

An HDTV frame has 4~6 times more pixels than a DTV frame. In order to encode the HDTV image in real time, parallel processing architectures have been widely used in many HDTV codec developments. That is, an HDTV Image is divided into several subbands and each subband is encoded in parallel using some DTV level encoders. In this paper, we adopt an HDTV codec architecture which divides an HDTV frame into 4 subbands and propose a new scene change detection algorithm using local variance. In addition, a new adaptive multichannel rate control scheme which allocate target bits adaptively to each subband of the HDTV image based on the activities of subband images is suggested in this paper. The activities of subband images are calculated at scene change detection part and reused at the adaptive rate control part. The simulation results show that the proposed scene change detection algorithm detects the scene change of HDTV video very accurately. Also the suggested adaptive multichannel rate control scheme shows better performance than the rate control method which allocates target bits equally to each subbands of the HDTV image.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.47-55
• /
• 2009

As the wireless internet technology such as mobile phone, WIBRO, HSDPA develops, customized location-based services for traffic, tourism, shopping, and emergency relief has lately attracted attention. For giving customized services. we should consider dynamic characteristics of moving object which continuously change their location. In this paper, we define the context trigger type of moving object and design triggering method for processing context generated by moving object. Also we propose location-based push service platform including context trigger of moving object for supporting location-based information to user. The proposed system gathers moving object stream from the terminal based on MS-assisted or Stand-alone positioning mode of embedded GPS in terminal extract user context by user device agent, and send context information to server.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.641-650
• /
• 2001

Jini architecture's Network Plug and Work provides simple and flexible network environment for distributed applications. Through the Jini technology, facilities for dynamically registering and locating mobile agent services can be easily supported, as well as the services useful for activities of mobile agents can be dynamically supported. In this paper, we describe a Jini-based mobile agent system named JMoblet, which provides the basic functions of a mobile agent system such as creation, control, transfer, location and communication among agents. To increase the reliability of the system, it also provides exception handling and persistence of the mobile agent systems for reliability.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.27-36
• /
• 2009

The leaking of personal information is mostly occurred by internal users. The confidential information such as credit card number can be disclosed or modified by system manager easily. The secure storaging and managing scheme for sensitive data of individual and enterprise is required for distributed data management. The manager owning private data is needed to have a weight which is a right to disclose a private data. For deciding a weight, it is required that system is able to designate the level of user's right. In this paper, we propose the new algorithm named digit-independent algorithm. And we propose a new data management scheme of gathering and processing the data based on digit-independent algorithm. Our sharing and recovering scheme have the efficient computation operation for managing a large quantity of data using weight table. The proposed scheme is able to use for secure e-business data management and storage in ubiquitous computing environment.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.517-526
• /
• 2008

Stereo vision is a fundamental method for measuring 3D structures by observing them from two cameras placed on different positions. In order to reconstruct 3D structures, it is necessary to create a disparity map from a pair of stereo images. To create a disparity map we compute the matching cost for each point correspondence and compute the disparity that minimizes the sum of the whole matching costs. In this paper, we propose a method to estimate a dense disparity map using region segmentation. We segment each scanline using region homogeneity properties. Using the segmented regions, we prohibit false matches in the stereo matching process. Disparities for pixels that failed in matching are filled by interpolating neighborhood disparities. We applied the proposed method to various stereo images of real environments. Experimental results showed that the proposed method is stable and potentially viable in practical applications.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.389-396
• /
• 2006

P2P(Peer To Peer) system, a most attractive file sharing system, is the largest channel of contents distribution and it takes 50% of network traffic. But P2P systems are infamous for used to illegal contents distribution channel not only in music industry, but also in movie industry. But, DRM(Digital Right Management) enabled P2P models are not suggested until now that interrupting illegal contents distribution and keeping advantage of P2P. So in this paper, we suggest a DRM enabled P2P model that can support distributed processing ability and high scalability with no modification in exist P2P model or architecture.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.145-147
• /
• 2003

홈 제어 네트워크는 전력선으로 대표되는 물리적 네트워크를 기반으로 저속의 신뢰도 있는 통신을 한다. 현재 홈 제어 네트워크의 표준으로 거론되고 있는 것들은 CEBUS, EIB, LonWorks 등이 있다. 본 논문에서는 ETRI에서 작년에 개발한 론웍스(LonWorks) 시스템을 구성 관리하는 서버 소프트웨어인 LonWare(version 2.0)의 다중 바인딩을 지원하기 위한 연결(Connections) 구조를 제안한다. Echelon사에서 제안하는 LonWorks 시스템의 구성관리 도구로서의 LonMaker는 자체적으로 개발한 LNS (LonWorks Network Service)라고 하는 비 표준화된 구성 관리 기술을 통해서 네트워크를 관리하도록 지원하며, 상기한 LNS를 인프라로 활용하는 도구로서, LNS는 빌딩 혹은 가정 내에 LonWorks 네트워크로 연결되어 있는 디바이스들에 대한 정보를 DB화하여 구축된 자료를 기반 으로 디바이스들간에 연동이 가능하도록 지원한다. 그러나 고가이며, 바인딩 과정 시 론웍스 네트워크 상에 필요 이상의 패킷을 발생시켜 전력선 채널의 Bandwidth를 감소시키며, 또한 바이딩 과정을 마치는데 걸리는 시간을 증가시킨다. 이에 본 논문에서는 다중 바이딩을 지원하는 홈 네트워크 구성 관리 서버 소프트웨어의 연결 구조를 통해서 LonWare v2.0의 유니캐스트(unicast) 바이딩시 발생 했던 모든 문제를 제거하고, 바인딩에 필요한 패킷을 최적화 하여 바인딩에 걸리는 시간을 단축시키며, 성능의 주요한 요소인 디바이스의 리소스를 최소화하는 방법으로 접근하여 바인딩 시 처리능력의 한계를 가지고 있는 뉴런칩 기반의 론웍스 디바이스의 시스템 사양에 영향을 주지 않도록 제안하였다. 제안된 리눅스 기반의 홈 네트워크 구성 관리 소프트웨어의 다중 바인딩 기능을 통해 론웍스 네트워크상의 다양한 디바이스들간의 네트워크 다양화와 분산화 기능을 얻을 수 있었고, 기존의 고가의 해외 솔루션인 Echelon사의 LonMaker 소프트웨어를 사용하지 않고도 국내의 순수 솔루션인 리눅스 기반의 LonWare 3.0 다중 바인딩 기능을 통해 저 비용으로 홈 네트워크 구성 관리 서버 시스템 개발에 대한 비용을 줄일 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1035-1044
• /
• 1998

A new multi-channel access scheme and the associated network architecture for a single-hop WDM local area network is proposed in this paper. The proposed architecture has Central Scheduling Node (CSN) for the transmission coordination among many users, which is one of the key issues in single-hop WDM networks. The data channels, source nodes, and destination nodes are selected at CSN in very simple menner. Our scheme can relive the control processing overhead at all nodes in the network which is caused in existing distributed scheduling algorithms. CSN is simple in the architecture can be implemented easily. in respect to the network performance, the maximum obtainable throughput is up to that of the ideal output queuing because of collision free scheduling. We use the MQMS (multi-queue multi-server) model for performance analaysis.