• 제목/요약/키워드: Search Speed

검색결과 796건 처리시간 0.028초

분산 멀티미디어 기반의 원격의료시스템 설계 및 구현 (Design and Implementation of a Telemedicine System based on Distributed Multimedia)

  • 이병수;안영두;박두석
    • 한국컴퓨터정보학회논문지
    • /
    • 제5권2호
    • /
    • pp.81-89
    • /
    • 2000
  • 본 논문에서는 효율적이며 편리한 원격의료시스템을 개발하기 위해 분산 멀티미디어 기술을 바탕으로 256kbps 전용선과 10Mbps Ethernet LAN망을 기반으로 원격의료시스템을 설계 및 구현하였다. 원격 의료시스템은 분산멀티미디어 기술을 이용하여 여러 개의 영상획득장치와 저장 장치 및 서버들을 네트워크와 효율적으로 연결함으로써 통한 환경아래 빠르고 간편하게 의료영상을 열람하고 저장, 전송할 수 있게 하였다. 의료영상의 전송 효율을 높이고 추후 Web의로의 확장을 위해서 JPEG방식의 영상압축을 실시하였으며 데이터베이스의 안정성과 효율을 높이기 위해 의료정보를 데이터베이스로 의료영상을 파일로 데이터베이스로 구축하여 관리할 수 있게 설계와 구현을 하였다.

  • PDF

다계층 공생 진화알고리듬을 이용한 공급사슬경영의 생산과 분배의 통합계획 (An Integrated Planning of Production and Distribution in Supply Chain Management using a Multi-Level Symbiotic Evolutionary Algorithm)

  • 김여근;민유종
    • 한국경영과학회지
    • /
    • 제28권2호
    • /
    • pp.1-15
    • /
    • 2003
  • This paper presents a new evolutionary algorithm to solve complex multi-level integration problems, which is called multi-level symbiotic evolutionary algorithm (MEA). The MEA uses an efficient feedback mechanism to flow evolution information between and within levels, to enhance parallel search capability, and to improve convergence speed and population diversity. To show the MEA's applicability, It is applied to the integrated planning of production and distribution in supply chain management. The encoding and decoding methods are devised for the integrated problem. A set of experiments has been carried out, and the results are reported. The superiority of the algorithm's performance is demonstrated through experiments.

Design and Implementation of a Main Memory Index Structure in a DBMS

  • Bae, Duck-Ho;Kim, Jong-Dae;Park, Se-Mi;Kim, Sang-Wook
    • International Journal of Contents
    • /
    • 제3권3호
    • /
    • pp.1-5
    • /
    • 2007
  • The main memory DBMS (MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. An index manager is an essential sub-component of a DBMS used to speed up the retrieval of objects from a large volume of a database in response to a certain search condition. Previous research efforts on indexing proposed various index structures. However, they hardly dealt with the practical issues occurred in implementing an index manager on a target DBMS. In this paper, we touch these issues and present our experiences in developing the index manager. The main issues are (1) compact representation of an index entry, (2) support of variable-length keys. (3) support of multiple-attribute keys, and (4) support of duplicated keys.

진화 프로그램을 이용한 퍼지 클러스터링 (Fuzzy Clustering using Evolution Program)

  • 정창호;임영희;박주영;박대희
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제26권1호
    • /
    • pp.130-130
    • /
    • 1999
  • In this paper, we propose a novel design method for improving performance of existing FCM-type clustering algorithms. First, we define the performance measure which focuses on bothcompactness and separation of clusters. Next, we optimize this measure using evolution program.Especially the proposed method has following merits: ① using evolution program, it solves suchproblems as initialization, number of clusters, and convergence to local optimum ② it reduces searchspace and improves convergence speed of algorithm since it represents chromosome with possiblepotential centers which are selected possible candidates of centers by density measure ③ it improvesperformance of clustering algorithm with the performance index which embedded both compactnessand separation Properties ④ it is robust to noise data since it minimizes its effect on center search.

Lossless Audio Coding using Integer DCT

  • Kang MinHo;Lee Sung Woo;Park Se Hyoung;Shin Jaeho
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.114-117
    • /
    • 2004
  • This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

  • PDF

Pattern Analysis and Performance Comparison of Lottery Winning Numbers

  • Jung, Yong Gyu;Han, Soo Ji;kim, Jae Hee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제6권1호
    • /
    • pp.16-22
    • /
    • 2014
  • Clustering methods such as k-means and EM are the group of classification and pattern recognition, which are used in management science and literature search widely. In this paper, k-means and EM algorithm are compared the performance using by Weka. The winning Lottery numbers of 567 cases are experimented for our study and presentation. Processing speed of the k-means algorithm is superior to the EM algorithm, which is about 0.08 seconds faster than the other. As the result it is summerized that EM algorithm is better than K-means algorithm with comparison of accuracy, precision and recall. While K-means is known to be sensitive to the distribution of data, EM algorithm is probability sensitive for clustering.

Low-Complexity Non-Iterative Soft-Decision BCH Decoder Architecture for WBAN Applications

  • Jung, Boseok;Kim, Taesung;Lee, Hanho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제16권4호
    • /
    • pp.488-496
    • /
    • 2016
  • This paper presents a low-complexity non-iterative soft-decision Bose-Chaudhuri-Hocquenghem (SD-BCH) decoder architecture and design technique for wireless body area networks (WBANs). A SD-BCH decoder with test syndrome computation, a syndrome calculator, Chien search and metric check, and error location decision is proposed. The proposed SD-BCH decoder not only uses test syndromes, but also does not have an iteration process. The proposed SD-BCH decoder provides a 0.75~1 dB coding gain compared to a hard-decision BCH (HD-BCH) decoder, and almost similar coding gain compared to a conventional SD-BCH decoder. The proposed SD-BCH (63, 51) decoder was designed and implemented using 90-nm CMOS standard cell technology. Synthesis results show that the proposed non-iterative SD-BCH decoder using a serial structure can lead to a 75% reduction in hardware complexity and a clock speed 3.8 times faster than a conventional SD-BCH decoder.

Effect of Dark Matter on the Collision of High Velocity Clouds with the Galactic Disk

  • 곽규진;김종수
    • 천문학회보
    • /
    • 제38권1호
    • /
    • pp.46.1-46.1
    • /
    • 2013
  • High velocity clouds (HVCs) are H I clouds that move with large speed (${\mid}V_{LSR}{\mid}$ >100 km/s) in the halo of the Milky Way. It is now evident that at least some populations of HVCs originated from extragalactic sources, either primordial gas left over from the galaxy formation or gaseous material stripped off from other galaxies closely passing by the Milky Way. HVCs with extragalactic origin play an important role in the star formation of the Milky Way when they eventually collide with the disk of the Milky Way. Although it is still observationally controversial whether HVCs are surrounded by dark matter or not, it is theoretically interesting to investigate the effect of dark matter on the collision of HVCs with the disk of the Milky Way. We model this scenario by using hydrodynamic simulations and search for proper parameters that explain the currently available observations such as the Smith Cloud that is thought to have collided with the Galactic disk already.

  • PDF

Linux에서 SQLite 데이터베이스의 검색 성능 분석 (Search Performance Analysis of SQLite Database on Linux)

  • 최진오
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2016년도 춘계학술대회
    • /
    • pp.390-391
    • /
    • 2016
  • SQLite는 리소스 제약이 큰 소형 기기에 적합한 데이터베이스 엔진이며 리눅스 기반 모바일 기기에 많이 사용되고 있다. SQLite는 오픈소스 프로그램이며 가볍고 속도가 빠른 장점을 지닌다. 이 논문에서는 리눅스 기반 환경에서 SQLite 데이터베이스의 검색 성능을 테스트하여 장단점을 분석하고자 한다. 분석은 같은 환경에서 실행되는 다른 데이터베이스와 비교하여 진행한다.

  • PDF

800MW 가스발전소의 모터 설비에 고압 드라이브를 적용한 사례 (Application of medium-voltage drive to motor equipment of 800MW gas power plant.)

  • 김경수;오현석;박종제;전재현;박철현
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2018년도 전력전자학술대회
    • /
    • pp.424-425
    • /
    • 2018
  • In the introduction, this paper introduces LS Industrial Systems' medium-voltage drive installed at Hyundai Green Power, an 800MW gas power plant. In the body, it explains the synchronous transfer technology and new speed search technology applied to Forced Draft(FD) Fan and Boiler Feed-water(BF) Pump, which are power generation facilities. Lastly, it shows the annual energy saving amount and operation status which are applied to each facility and proves that it is a successful application case.

  • PDF