• 제목/요약/키워드: Bounded

검색결과 2,235건 처리시간 0.027초

Detection of a mollicute-like organism in kuruma shrimp, Penaeus japonicus (보리새우(Penaeus japonicus)에 감염된 Mollicute-like Organism)

  • Choi, Dong-Lim;Sohn, Sang-Gyu;Park, Myoung-Ae;Heo, Moon-Soo;Renault, Tristan
    • Journal of fish pathology
    • /
    • 제9권1호
    • /
    • pp.33-40
    • /
    • 1996
  • A filamentous form of mollicute-like bacterium was detected during a routine health survey of wild adult kuruma shrimp Penaeus japonicus. The kuruma shrimp were native to Japan and were imported to Korea. The histology showed no pathological changes. Transmission electron microscopy revealed extensive infections of hepatopancreatic epithelial cell by a pleomorphic, filamentous intracellular bacterium. The filamentous bacterium was of about 60 nm in diameter and 300 nm to more than $1{\mu}m$ in length. Teh morphology of bacteria were filamentous and branched with terminal blebs, or knobs, on the branches. They lacked the cell wall, and were bounded by the plasma membrane. They contained typical prokaryotic ribosomes and fibrillar DNA-like strands. No additional internal structure has been observed. They are considered to be mollicutes, based upon the morphological appearance and upon the cellular location.

  • PDF

Soft-Decision Decoding of the [23,12] Golay Code Using Covering Polynomials (커버링 다항식을 이용한 골레이 부호의 연판정 복호)

  • 성원진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제27권3A호
    • /
    • pp.180-187
    • /
    • 2002
  • The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.

A Negotiation Mechanism for BDI Agents in Distributed Cooperative Environments (협동적인 분산 환경에서 BDI 에이전트를 위한 협상 기법)

  • Lee, Myung-Jin;Kim, Jin-Sang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • 제13권2호
    • /
    • pp.192-199
    • /
    • 2003
  • Agents in multi-agent systems (MAS ) are required to achieve their own goals. An agent s goal, however, can conflict with others either when agents compete with each other to achieve a common goal or when they have to use a set of limited resources to accomplish agents divergent goals. In either case, agents need to be designed to reach a mutual acceptable state where they can avoid any goal conflicts through negotiation with others to achieve their goals. In this paper, we consider a BDI agent architecture where belief, desire, and intention are the three major components for agents mental attitudes and represent resource-bounded BDI agents in logic programming framework. We propose a negotiation algorithm for BDI agents solving their problems without goal conflicts in distributed cooperative environments. Finally, we describe a simple scenario to show the effectiveness of the negotiation algorithm implemented in a negotiation meta-language.

A Study on the Improvement of Real-Time Traffic QoS using the Delay Guarantee Queue Service Discipline of End-to-End (종단간 지연 큐 서비스 방식을 이용한 실시간 트래픽 QoS 개선에 관한 연구)

  • 김광준;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제6권2호
    • /
    • pp.236-247
    • /
    • 2002
  • We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the Proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy It can be comparatively reduce the complexity, and still guarantee the diverse delay bounds of end-to-end. Besides, it consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real -time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic.

Improvement of Frequency Characteristics of Boundary Filter for 2-band Orthogonal Wavelet Transform using Zero Inserting Method (영점 삽입 방법을 이용한 2-대역 직교 웨이브렛 변환의 경계필터 주파수 특성 개선)

  • 권상근;박원우
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제7권6호
    • /
    • pp.1229-1235
    • /
    • 2003
  • When finite length image signal is decomposed into 2-band signal and synthesized using 2-band orthogonal wavelet transform, boundary signals are not reconstructed perfectly. To reconstruct them perfectly, the filters which are different from wavelet filter are applied to the boundary signals. Since the existing boundary filters show poor frequency characteristic, the improvement of performance is bounded in practical applications. In this paper, the design method of improvement of frequency characteristic is proposed using inserting a zero to boundary filters which can reconstruct the boundary regions perfectly. Even though the length of proposed boundary filters is shorter, they show 4.2dB∼6.59dB gains in pass band and stop band error power compared with existing boundary filters. But synthesis process is some complicated.

Contribution Value Estimation on Rural Community by Multi-cultural Family Effect Using WTP (WTP를 이용한 다문화가족이 농촌사회에 미치는 다양한 영향 및 기여가치 평가)

  • Yang, Soon Mi
    • Journal of Agricultural Extension & Community Development
    • /
    • 제20권3호
    • /
    • pp.701-727
    • /
    • 2013
  • To estimate the WTP(Willingness to Pay) for consistent maintenance of rural multi-cultural families' contribution worth such as vitality of rural population, regional economic vitalization, cultural diversity of rural, maintenance of rural family society, and diversity of rural resource, a questionnaire survey was conducted by double-bounded dichotomous choice method based on Weibull model in 41 city county of rural. A estimation models based on Tunball models were developed and applied to WTP estimation with logistic analysis. WTP estimates for consistent maintenance of multi-cultural contribution worth by rural resident was 458 hundred million won. It means that each rural household can pay 13,840 won per annual. WTP estimates assessed by multi-cultural families' husband as a criteria for comparison was 502 hundred million won. It means that each household can pay 15,170 won per annual.

A Leader Election Algorithm and Performance Evaluation for Mobile Ad hoc Networks (이동 에드 혹 네트워크를 위한 제어노드 선택 알로리즘 및 성능 평가)

  • Parvathipuram Pradeep;Yang Gi-Chul;Oh Sooyul
    • The KIPS Transactions:PartC
    • /
    • 제11C권6호
    • /
    • pp.829-834
    • /
    • 2004
  • Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.

Real-Time Traffic Connection Admission Control of Queue Service Discipline (큐 서비스 방식에서 실시간 트래픽 연결 수락 제어)

  • 나하선;나상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제27권5C호
    • /
    • pp.445-453
    • /
    • 2002
  • We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy. The proposed scheme consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real-time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic

Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks (t/k-진단 시스템을 사용한 하이퍼큐브 네트워크의 결함 진단)

  • Kim, Jang-Hwan;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제31권11C호
    • /
    • pp.1044-1051
    • /
    • 2006
  • System level diagnosis algorithms use the properties of t-diagnosable system where the maximum number of the faults does not exceed 1. The existing diagnosis algorithms have limit when dealing with large fault sets in large multiprocessor systems. Somani and Peleg proposed t/k-diagnosable system to diagnose more faults than t by allowing upper bounded few number of units to be diagnosed incorrectly. In this paper, we propose adaptive hypercube diagnosis algorithm using t/k-diagnosable system. When the number of faults exceeds t, we allow k faults to be diagnosed incorrectly. Simulation shows that the performance of the proposed algorithm is better than Feng's HADA algorithm. We propose new algorithm to reduce test rounds by analyzing the syndrome of RGC-ring obtained in the first step of HADA/IHADA method. The proposed algorithm also gives similar performance compared to HYP-DIAG algorithm.

An Improvement Plan of Business Bounded System for Efficiency at Construction Industry through Game Theory (건설산업 효율성 향상을 위한 건설 업역 관련 제도 개선 방안)

  • Chang Su-Zin
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 한국건설관리학회 2004년도 제5회 정기학술발표대회 논문집
    • /
    • pp.388-393
    • /
    • 2004
  • The organic law on the Construction Industry, initially, this law was enacted with a view to preserving and fostering the specialty of each type of industry. By dividing each construction business boundary, it gradually settles the system of construction specialized on the basis of productive stages. Controversy over the abolishing regulations on business boundary still continues to swirl. Since the intensity of exclusion as well as rigidities become increased. This results from the fact that informations are not shared among business boundary and businesses under the protection of the business boundary regulations choose 'rent-sicking activity'. According to dissidents against this law, structure should be established not by artificially enforced institution but by voluntary efforts of participants in construction industry. This paper aims at improving the competitive of the construction industry by showing the efficient system of construction and proving the legitimacy of abolishing business boundary

  • PDF