• Title/Summary/Keyword: 지향성능

Search Result 519, Processing Time 0.029 seconds

Performance Evaluation of MSAG-SCS-MMA-I Adaptive Blind Equalization Algorithm with dual step-size (이중 스텝 크기를 가지는 MSAG-SCS-MMA-I 적응 블라인드 등화 알고리즘의 성능 평가)

  • Jeong, Young-Hwa
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.115-121
    • /
    • 2019
  • In this paper, we propose MSAG-SCS-MMA-I adaptive blind equalization with double step size with very small residual ISI and MSE at steady-state while significantly improving the convergence speed of the traditional SCS-MMA-I algorithm in 256-QAM system. And we evaluate the equalization performance for this algorithm. Different step sizes according to the absolute value of decision-directed error instead of a fixed step-size are applied to the tap update equation of MSAG-SCS-MMA-I, which is controlled by binary flags of '1' or '0' obtained from SCS-MMA-I and decision-directed algorithms. This makes for excellent equalization performance. As a result of computer simulation, we confirmed that the proposed algorithm has more better performance than the MMA, SCS-MMA-I, and MSAG-SCS-MMA-I algorithms in terms of the performance index such as residual ISI, MSE, and MD.

Automatic Document Categorization Using K-Nearest Neighbor Algorithm and Object-Oriented Thesaurus (K-NN과 객체 지향 시소러스를 이용한 웹 문서 자동 분류)

  • 방선이;양재동
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10b
    • /
    • pp.145-147
    • /
    • 2001
  • 문서 자동 분류에는 통계적인 기법과 machine learning 기법의 맡은 알고리즘들이 이용되고 있다. 통계적인 기법 알고리즘을 이용한 문서 분류는 높은 성능을 보이지만 분류할 카테고리가 둘 이상인 경우가 빈번할 경우에는 정확률이 급격히 저하되는 단점이 있다. 본 논문에서는 K-NN알고리즘을 이용하여 일차적인 문서 분류를 수행한 후 특정 카테고리로 분류하기에 애매모호한 경우가 생길 경우 시소러스의 일반화 관계와 연관화 관계를 이용하여 모호성을 줄임으로써 문서 자동 분류의 성능을 높이기 위한 새 기법을 제안한다.

  • PDF

A Study on Methods of Searching Multi-Cloud Resources in Cloud Collaboration Based on Program Similarity (프로그램 특성을 고려한 이종 자원 탐색 기술)

  • Kim, Yusik;Youn, Chan-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.151-152
    • /
    • 2013
  • 사용자 지향형 클라우드 협업 시스템이 가지는 장점은 다양한 클라우드 서비스 제공자들로부터 컴퓨팅 자원을 제공받기 때문에, 넓은 폭에서 선택이 가능한 점이다. 이것이 가능하려면, 다양한 컴퓨팅 자원들의 기대 성능값을 사전에 알아서 사용자가 사용하는 애플리케이션의 특성을 고려하여 자원들을 평가하고 가장 높은 성능 기댓값을 가지는 자원을 찾을 수 있어야 한다.

A Study on the Reengineering Tool with Concepts Recognition and Logical l Analysis of Objects (객체의 개념적 인식과 논리적 분석에 의한 재공학 툴에 대한 연구)

  • Kim, Haeng-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.200-210
    • /
    • 1996
  • Re-engineering has the potential to improve software productivity and quality y across the entire life cycle. It involves improving the software maintenance process and improving existing systems by applying new technologies and tools to software maintenance. Re-engineering can help us understanding existing systems and discover software components(e.g., design structure, data structure that are common across systems. These common components then can be reused in the development (or redevelopment )of systems, thereby significantly shortening the time and lessening the risk of developing systems. The Object-Oriented paradigm has been known to improve software maintainability. There still exist many problems in recognizing object, attributes and operations that are conceptually integrated and constructing of object class. In this paper, we propose a method that defines a fundamental theories of re-engineering and a concept recognition for object- oriented paradigm. We also describe the re-engineering tool that translates the existing procedure-oriented program into object-oriented system. This tool has a strength to solve the conceptual integrity problem in object-oriented recognition.

  • PDF

Connector for Dynamic Composition of Aspects Based on AOSD (AOSD기반에서 Aspect의 동적결합을 위한 Connector)

  • Kim Tae-Woong;Kim Tae-Gong
    • The KIPS Transactions:PartD
    • /
    • v.13D no.2 s.105
    • /
    • pp.251-258
    • /
    • 2006
  • Aspect-Oriented Software Development is new software development method. It has many advantages related to software performance, maintenance and repair. Also it offers modularization method to a existing programming language for secondary function such as security and fault tolerance. But the present problem is that we have to use new aspect-oriented programming language. Further more when we apply Aspect to legacy system, we have to recompile the source code in order to build software system based on AOSD. In this paper, we propose and design Connector that can be composed with Aspect in legacy system dynamically. To elaborate this work, we use the information of operations about Core and Aspect, and the information of pointcut described with XML. We validate that the proposed Connector has features such as no need of new compiler, no recompilation and no modification of legacy system through case study.

An Indexing Technique for Object-Oriented Geographical Databases (객체지향 지리정보 데이터베이스를 위한 색인기법)

  • Bu, Ki-Dong
    • Journal of the Korean association of regional geographers
    • /
    • v.3 no.2
    • /
    • pp.105-120
    • /
    • 1997
  • One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

  • PDF

Pointing Accuracy Analysis of Space Object Laser Tracking System at Geochang Observatory (거창 우주물체 레이저 추적 시스템의 추적마운트 지향 정밀도 분석)

  • Sung, Ki-Pyoung;Lim, Hyung-Chul;Park, Jong-Uk;Choi, Man-Soo;Yu, Sung-Yeol;Park, Eun-Seo;Ryou, Jae-Cheol
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.49 no.11
    • /
    • pp.953-960
    • /
    • 2021
  • Korea Astronomy and Space Science Institute has been verifying the multipurpose laser tracking system with three functions of satellite laser tracking, adaptive optics and space debris laser tracking for not only scientific research but also national space missions. The system employs an optical telescope consisting of a 100 cm primary mirror and an altazimuth mount for fast and precise tracking. The precise pointing and tracking capability in a tracking mount is considered as one of important performance metrics in the fields of automatic tracking and precise application research. So it is required to analyze a mount model for investigating pointing error factors and compensating pointing error. In this study, we investigated various factors causing static pointing errors of tracking mount and analyzed the pointing accuracy of the tracking mount at Geochang observatory by estimating mount parameters based on the least square method.

A Dynamic Web Service Orchestration and Invocation Scheme based on Aspect-Oriented Programming and Reflection (관점지향 프로그래밍 및 리플렉션 기반의 동적 웹 서비스 조합 및 실행 기법)

  • Lim, Eun-Cheon;Sim, Chun-Bo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.1-10
    • /
    • 2009
  • The field of the web service orchestration introduced to generate a valuable service by reusing single services. Recently, it suggests rule-based searching and composition by the AI (Artificial Intelligence) instead of simple searching or orchestration based on the IOPE(Input, Output, Precondition, Effect) to implement the Semantic web as the web service of the next generation. It introduce a AOP programming paradigm from existing object-oriented programming paradigm for more efficient modularization of software. In this paper, we design a dynamic web service orchestration and invocation scheme applying Aspect-Oriented Programming (AOP) and Reflection for Semantic web. The proposed scheme makes use of the Reflection technique to gather dynamically meta data and generates byte code by AOP to compose dynamically web services. As well as, our scheme shows how to execute composed web services through dynamic proxy objects generated by the Reflection. For performance evaluation of the proposed scheme, we experiment on search performance of composed web services with respect to business logic layer and user view layer.

精密計測 에 利용되는 센서 (II)

  • 한응교
    • Journal of the KSME
    • /
    • v.22 no.6
    • /
    • pp.424-433
    • /
    • 1982
  • 근년의 각종 센서의 발전은 급속히 측정기의 성능향상을 가져왔다. 즉 전출감도의 향상, 변환률의 향상, 소형화, 응답성의 향상, 신뢰성의 향상등이다. 더욱이 이들의 뛰어난 자동화와 마이콘의 적극적인 활용에 의해 계측의 자동화를 지향하고 있는 것이 많다. 이하에 설명하는 것은 소제 목으로한 측정에 포함되는 센서를 전부 망라한 것은 아니고 구래의 것과 대비하여 독자적인 것을 각각 예시한 것이다.

  • PDF