• Title/Summary/Keyword: P2P Computing

Search Result 267, Processing Time 0.025 seconds

A New Optical Media API for Real-Time Recording (실시간 기록을 위한 광매체 API)

  • Lee, Min-Suk;Song, Jin-Seok;Yun, Chan-Hee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.2
    • /
    • pp.75-85
    • /
    • 2007
  • There are many embedded systems which store and play multimedia streams on optical media such as recordable cd and dvd. Some of those are PVRs, DVRs, and camcorders. In this paper we describe the design and implementation of a new, well structured, fully documented, operating system independent and open source optical media API which can be used in various applications and embedded systems. We also design an ISO-9660 compliant optical media layout, an API set and the scenario for real-time recording. To prove the usability, we develop a text application to replace well-known CD-burning software, cdrecord, and a graphic burning application. All the implementations are firstly done on Linux PC environment, and then ported to a commercial embedded system which uses pSOS as an operating system.

A Study on Evolutionary Computation of Fractal Image Compression (프랙탈 영상 압축의 진화적인 계산에 관한 연구)

  • Yoo, Hwan-Young;Choi, Bong-Han
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.365-372
    • /
    • 2000
  • he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

  • PDF

A Collaborative Framework for Discovering the Organizational Structure of Social Networks Using NER Based on NLP (NLP기반 NER을 이용해 소셜 네트워크의 조직 구조 탐색을 위한 협력 프레임 워크)

  • Elijorde, Frank I.;Yang, Hyun-Ho;Lee, Jae-Wan
    • Journal of Internet Computing and Services
    • /
    • v.13 no.2
    • /
    • pp.99-108
    • /
    • 2012
  • Many methods had been developed to improve the accuracy of extracting information from a vast amount of data. This paper combined a number of natural language processing methods such as NER (named entity recognition), sentence extraction, and part of speech tagging to carry out text analysis. The data source is comprised of texts obtained from the web using a domain-specific data extraction agent. A framework for the extraction of information from unstructured data was developed using the aforementioned natural language processing methods. We simulated the performance of our work in the extraction and analysis of texts for the detection of organizational structures. Simulation shows that our study outperformed other NER classifiers such as MUC and CoNLL on information extraction.

On the Improved Numerical Method for Hydrodynamic Forces Acting on an Arbitrary Cylinder in the Time Domain (2차원 주상체의 강제 동요시 동유체력의 시간 영역 해석법에 관하여)

  • Y.S.,Shin;K.P.,Rhee
    • Bulletin of the Society of Naval Architects of Korea
    • /
    • v.27 no.1
    • /
    • pp.63-72
    • /
    • 1990
  • The linear hydrodynamic forces, acting on a forced oscillating cylinder from its mean position on a free surface with a small amplitude, are calculated in the time domain. The integral equation method using a time dependent Green function is employed. The numerical results for the heaving and swaying circular cylinder are shown and give good agreements with others Furthermore it is shown that the use of the Green function, which is expressed by a series expansion or asymptotic expansion according to time range, reduces computing time greatly.

  • PDF

Prototype-based Classifier with Feature Selection and Its Design with Particle Swarm Optimization: Analysis and Comparative Studies

  • Park, Byoung-Jun;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.2
    • /
    • pp.245-254
    • /
    • 2012
  • In this study, we introduce a prototype-based classifier with feature selection that dwells upon the usage of a biologically inspired optimization technique of Particle Swarm Optimization (PSO). The design comprises two main phases. In the first phase, PSO selects P % of patterns to be treated as prototypes of c classes. During the second phase, the PSO is instrumental in the formation of a core set of features that constitute a collection of the most meaningful and highly discriminative coordinates of the original feature space. The proposed scheme of feature selection is developed in the wrapper mode with the performance evaluated with the aid of the nearest prototype classifier. The study offers a complete algorithmic framework and demonstrates the effectiveness (quality of solution) and efficiency (computing cost) of the approach when applied to a collection of selected data sets. We also include a comparative study which involves the usage of genetic algorithms (GAs). Numerical experiments show that a suitable selection of prototypes and a substantial reduction of the feature space could be accomplished and the classifier formed in this manner becomes characterized by low classification error. In addition, the advantage of the PSO is quantified in detail by running a number of experiments using Machine Learning datasets.

A Design of a Network Module supporting Primitive Messaging Operations for MOM (MOM의 Primitive Messaging Operation을 지원하는 네트워크 모듈 설계)

  • Kang, Tae-Gun;Sohn, Kang-Min;Ham, Ho-Sang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.115-118
    • /
    • 2003
  • 최근 MOM 기술은 비즈니스 로직을 수행하는 애플리케이션 서버의 필수적인 구성요소로서 자리잡고 있으며, 보통 수백에서 수천의 클라이언트 요청을 처리할 수 있는 능력을 제공한다. MOM 은 이러한 대용량의 클라이언트 요청을 효과적으로 처리하기 위해서 효율적이고 확장성있는(스케일러블) 네트워크 모듈이 필요하며, 다양한 네트워크 프로토콜을 지원해야 한다. MOM이 기본적으로 지원하는 메시징 기능은 PTP(Point-To-Point)와 publish/subscribe 메시징 도메인으로 나뉘는데 이 논문에서는 두 가지 메시징 도메인과 그룹통신 메시징 서비스 기능을 동시에 지원하는 MoIM-Message 시스템의 하부 통신 모듈의 설계에 대해 기술한다. PTP와 publish/subscribe 메시징을 지원하기 위해 세가지 프리미티브 메시징 오퍼레이션인 "synchronous send", "synchronous receive", "asynchronous receive"를 정의하였으며 하부 통신 모듈 역할을 하는 메시지 트랜스포트 관리 계층내의 트랜스포트 관리자 내에 구현되었다. 트랜스포트 관리자는 다양한 트랜스포트 프로토콜을 적용할 수 있도록 하기 위해 트랜스포트 어댑터로 설계되었으며, 대량의 통신 요청을 효과적으로 처리하기 위해 "polling with multiple service thread model" 기법을 적용하여 구현되었다. 또한, 모바일 클라이언트 환경을 지원하기 위해 클라이언트 측 통신 모듈을 IPaq PDA 상에 포팅하였다. 본 논문에서 제안하는 세 가지 프리미티브 메시징 오퍼레이션을 제공하는 통신 모듈은 MOM이 기본적으로 지원해야 할 메시징 도메인과 대용량의 클라이언트 요청을 효율적으로 처리할 수 있는 구조를 가진다.es}8$ 모드를 모두 사용한 경우와 $8{\times}8$ 단일모드를 사용한 경우보다 계산 시간이 감소하였음을 확인하였다.행중인 MoIM-Messge서버의 네트워크 모듈로 다중 쓰레드 소켓폴링 모델을 적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는 피험자의 머리 움직임에 의하여 도파민 유리가 과대평가되었으며 이는 이 연구에서 제안한 영상정합을 이용한 움직임 보정기법에

  • PDF

Location Management & Message Delivery Protocol for Multi-region Mobile Agents in Multi-region Environment (다중 지역 환경에서 이동 에이전트를 위한 위치 관리 및 메시지 전달 기법)

  • Choi, Sung-Jin;Baik, Maeng-Soon;Song, Ui-Sung;Hwang, Chong-Sun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.545-561
    • /
    • 2007
  • Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multi-region mobile agent computing environment in order to control mobile agents and guarantee message delivery between them. However, previous works have some problems when they are applied to a multi-region mobile agent computing environment. First, the cost of location management and message delivery is increased relatively. Second, a tracking problem arises. finally, cloned mobile agents and parent-child mobile agents do not get dealt with respect to location management and message delivery. In this paper, we present a HB (Home-Blackboard) protocol, which is a new location management and message delivery protocol in a multi-region mobile agent computing environment. The HB protocol places a region server in each region and manages the location of mobile agents by using intra-region migration and inter-region migration. It also places a blackboard in each region server and delivers messages to mobile agents when a region server receives location update form them. The HB protocol can decrease the cost of location update and message passing and solve the tracking problem with low communication cost. Also, this protocol deals with the location management and message passing of cloned mobile agents and parent-child mobile agents, so that it can guarantee message delivery of these mobile agents and pass messages without passing duplicate messages.

A Test Data Generation Tool based on Inter-Relation of Fields in the Menu Structure (메뉴 구조의 필드간의 상호 연관관계를 기반으로 한 테스트 데이타 자동 생성 도구)

  • 이윤정;최병주
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.2
    • /
    • pp.123-132
    • /
    • 2003
  • The quality certification test is usually conducted by a certifying organization to determine and guarantee the quality of software after the software development phase, commonly without the actual source code, but with by going against the product's manual. In this paper, we implement a Manual-based Automatic Test data generating tool: MaT, the test technique based on manual, that automatizes producing the test data from analysis data of software package and manual. The input data of MaT are the result of the analysis of software and manual. We propose 'menu-based test analysis model' in order to generate the input data. We believe that the proposed technique and tool he]p improving quality and reliability of the software.

A Fast Inversion for Low-Complexity System over GF(2 $^{m}$) (경량화 시스템에 적합한 유한체 $GF(2^m)$에서의 고속 역원기)

  • Kim, So-Sun;Chang, Nam-Su;Kim, Chang-Han
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.9 s.339
    • /
    • pp.51-60
    • /
    • 2005
  • The design of efficient cryptosystems is mainly appointed by the efficiency of the underlying finite field arithmetic. Especially, among the basic arithmetic over finite field, the rnultiplicative inversion is the most time consuming operation. In this paper, a fast inversion algerian in finite field $GF(2^m)$ with the standard basis representation is proposed. It is based on the Extended binary gcd algorithm (EBGA). The proposed algorithm executes about $18.8\%\;or\;45.9\%$ less iterations than EBGA or Montgomery inverse algorithm (MIA), respectively. In practical applications where the dimension of the field is large or may vary, systolic array sDucture becomes area-complexity and time-complexity costly or even impractical in previous algorithms. It is not suitable for low-weight and low-power systems, i.e., smartcard, the mobile phone. In this paper, we propose a new hardware architecture to apply an area-efficient and a synchronized inverter on low-complexity systems. It requires the number of addition and reduction operation less than previous architectures for computing the inverses in $GF(2^m)$ furthermore, the proposed inversion is applied over either prime or binary extension fields, more specially $GF(2^m)$ and GF(P) .

A Study on the Clearance Level(draft) for the Steel Scrap from the KRR-1 & 2 Decommissioning (연구로 1,2호기 해체 철재폐기물의 규제해제농도기준(안) 도출을 위한 연구)

  • 홍상범;이봉재;정운수
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.2 no.1
    • /
    • pp.60-67
    • /
    • 2004
  • The exposure dose form recycling of a large amount of the steel scrap from the KRR-1&2 decommissioning activities was evaluated, and also the clearance level(draft) was derived. The maximum individual dose and collective dose were evaluated by modifying internal dose conversion factor which was based on the concept of effective dose in ICRP 60, applied to the RESRAD-RECYCLE ver 3.06 computing code, IAEA Safety Series 111-P-1.1 and NUREG-1640 as the assessment tool. The result of assessment for individual dose and collective dose is 23.9 $\mu$Sv per year and 0.11 man$.$Sv per year respectively. The clearance levels were ultimately determined by extracting the most conservative value form the results of the generic assessment and specific assessment methodologies. The result of clearance level for radionuclides( $Co^{60}$ , C $s^{l37}$) is less than 1.14${\times}$10$^{-1}$ Bq/g to comply with the clearance criterion(maximum individual dose : 10 $\mu$Sv per year, collective dose : 1 man$.$Sv per year) provided for Korea Atomic Energy Act and relevant regulations.s.

  • PDF