• 한국정보시스템학회지:정보시스템연구
• /
• 제7권1호
• /
• pp.181-208
• /
• 1998

In many literatures of model management, various schemes for representing model base schema have proposed. Ultimately, the goal is to arrive at a set of mutually supportive and synergistic methodologies and tools for the modeling problem domain and model base design. This paper focus on how best to structure and represent conceptual model of problem domain and schema of model base. Semantic concepts and modeling constructs are valuable conceptual tools for understanding the structural relationships and constraints involved in an model management environment. To this end, we reviewed the model management literature, and analyzed the constructs of modeling tools of data model management graph-based approach. Although they have good tools but most of them are not enough for the representation of structural relationships and constraints. So we wanted more powerful tools which can represent diverse constructs in a decision support modeling and model base schema design. For the design of a model base, we developed object modeling framework which uses Object Modeling Techniques (OMT). In Object Modeling Framework, model base schema are classified into conceptual schema, logical schema, and physical schema. The conceptual schema represents the user's view of problem domain, and the logical schema represents a model formatted by a particular modeling language. The schema design, this paper proposes an extension of Object Model to overcome some of the limitations exhibited by the OMT. The proposed tool, Extended Object Model(EOM) have diverse constructs for the representation of decision support problem domain and conceptual model base schema.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권5호
• /
• pp.278-286
• /
• 2000

A new large-scale network geometric analysis is introduced. For a large-scale circuit, it must be analyzed with a geometric diagram and figure. So many equations are induced from a geometric loop-node diagram. The results are arranged into a simple matrix, of course. In case of constructing a network diagram, it is not easy to handle voltage and current sources together. Geometric loop analysis is related to voltage sources, and node analysis is to current sources. The reciprocal transfer is possible only to have series or parallel impedance. If not having this impedance, in order to obtain equivalent circuit, many equations must be derived. In this paper a loop-reduction method is proposed. With this method current source branch is included into the other branch, and disappears in circuit diagram. So the number of independent circuit equations are reduced as much as that of current sources. The number is not (b-n+1), but (b-n+1-p). Where p is the number of current sources. The reduction procedure is verified with a geometric principle and circuit theory. A resultant matrix can be constructed directly from this diagram structure, not deriving circuit equations. We will obtain the last results with the help of a computer.

• 제어로봇시스템학회논문지
• /
• 제4권2호
• /
• pp.194-202
• /
• 1998

This paper describes a hardware implementation method of a Petri Net-based controller. A flexible and systematic implementation method, based on look-up tables, is suggested, which enables to build high speed Petri net-based controllers. The suggested method overcomes the inherent speed limit that arises from the microprocessors by using of matrix-based look-up tables. Based on the matrix framework, this paper suggests various specific data path structures as well as a basic data path structure, accompanied by evolution algorithms, for sub-class Petri nets. A new sub-class Petri net, named Biarced Petri Net, resolves memory explosion problem that usually comes with matrix-based look-up tables. The suggested matrix-based method based on the Biarced Petri net has as good efficiency and expendability as the list-based methods. This paper shows the usefulness of the suggested method, evaluating the size of the look-up tables and introducing an architecture of the signal processing unit of a programmable controller. The suggested implementation method is supported by an automatic design support program.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.49-61
• /
• 1996

Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

• 한국인터넷방송통신학회논문지
• /
• 제9권4호
• /
• pp.1-8
• /
• 2009

본 연구 이전에 제안되었던 실시간 교량 모니터링 시스템은 교량 곳곳에 배치되어 있는 센서들로부터 중앙서버로 동축 케이블을 통해 데이터를 송수신하였는데, 동축 케이블을 이용하여 교량 전체의 센서들의 네트워크를 구성하기 위해서는 막대한 인력과 비용이 따르게 된다. 본 연구에서는 USN을 기반으로 한 교량 모니터링 시스템 제안하고, 이에 대한 프로토타입을 설계 및 구현하였다. HSDPA를 통해 얻은 센싱 데이터 값을 TCP/IP 소켓을 통해 교량 모니터링 서버에 전달함으로써 양방향 통신을 구축하여 그래프 변환을 하는 전체 시스템을 구현하였다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1999년도 KOBA 방송기술 워크샵 KOBA Broadcasting Technology Workshop
• /
• pp.213.1-218
• /
• 1999

A virtual studio is a new video production environment using interactive computer graphics and imaging media technology. The traditional chroma-keying with two-dimensional background is replaced by an advanced keying method with a dynamic computer-generated, three-dimensional background. We have developed a virtual studio system that is practical to use in the real production environment. It has not only essential features that are common among various commercial virtual studio systems, but also unique feature that help the producer to construct virtual studio sets and scenarios efficiently such as span graph, robust backup controller, and 3 dimensional character generator supporting all languages. Our virtual studio system was used in live broadcasting and proved that the system was practical enough. In this paper, we will introduce the structure and the major features of our system, called VdreamSet, and application examples to broadcasting.

• 스마트미디어저널
• /
• 제7권2호
• /
• pp.23-33
• /
• 2018

A musical sheet is read by optical music recognition (OMR) systems that automatically recognize and reconstruct the read data to convert them into a machine-readable format such as XML so that the music can be played. This process, however, is very challenging due to the large variety of musical styles, symbol notation, and other distortions. In this paper, we present a model for the recognition of musical symbols through the use of a mobile application, whereby a camera is used to capture the input image; therefore, additional difficulties arise due to variations of the illumination and distortions. For our proposed model, we first generate a line adjacency graph (LAG) to remove the staff lines and to perform primitive detection. After symbol segmentation using the primitive information, we use a covariance-matching method to estimate the similarity between every symbol and pre-defined templates. This method generates the three hypotheses with the highest scores for likelihood measurement. We also add a global consistency (time measurements) to verify the three hypotheses in accordance with the structure of the musical sheets; one of the three hypotheses is chosen through a final decision. The results of the experiment show that our proposed method leads to promising results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3211-3230
• /
• 2014

Recently, sparse coding has achieved remarkable success in image representation tasks. In practice, the performance of clustering can be significantly improved if limited label information is incorporated into sparse coding. To this end, in this paper, a novel semi-supervised algorithm, called constrained sparse concept coding (CSCC), is proposed for image representation. CSCC considers limited label information into graph embedding as additional hard constraints, and hence obtains embedding results that are consistent with label information and manifold structure information of the original data. Therefore, CSCC can provide a sparse representation which explicitly utilizes the prior knowledge of the data to improve the discriminative power in clustering. Besides, a kernelized version of our proposed CSCC, namely kernel constrained sparse concept coding (KCSCC), is developed to deal with nonlinear data, which leads to more effective clustering performance. The experimental evaluations on the MNIST, PIE and Yale image sets show the effectiveness of our proposed algorithms.

• 한국정보과학회논문지:데이타베이스
• /
• 제28권4호
• /
• pp.723-731
• /
• 2001

XML이 웹상에서 정보 교환의 표준으로 채택되면서 XML을 데이타베이스의 데이타로 보고 정보를 추출하는 분야가 주목받고 있다. XML은 그래프 기반의 비정형 데이타(semistructured data) 모델 과 매우 비슷하기 때문에 XML 데이타를 그래프 기반의 비정형 데이타 모델로 매핑한 후, 이에 대하여 질의를 처리할 수 있다. 본 논문에서는 XML 데이타에 대하여 스키마 정보를 가지는 DTB(Document Type Definition)를 이용한 질의 최적화 기법을 제안한다. 제안하는 기법은 인덱싱 효과를 내면서도 기존 방법에 비하여 부가의 메모리를 적게 필요로하고, 입력 데이타의 구조를 그대로 유지하기 때문에 다양한 형태의 질의를 효율적으로 처리할 수 있다. 간단한 예제 데이타베이스에 대하여 제안하는 기법의 실험 결 과를 보였다.

• 대한원격탐사학회지
• /
• 제20권1호
• /
• pp.57-64
• /
• 2004

In GIS-based network analysis, topological measure of network structure can be considered as one of important factors in the urban transportation analysis. Related to this measure, it is known that the connectivity indices such as alpha index and gamma index, which mean degree of network connectivity and complexity on a graph or a circuit, provide fundamental information. On the other hand, shimbel index is one of GIS-based spatial metrics to characterize degree of network concentration. However, the approach using these quantitative indices has not been widely used in practical level yet. In this study, an application program, in complied as extension, running on ArcView- GIS is implemented and demonstrated case examples using basic layers such as road centerline and administrative boundary. In this approach, geo-spatial imagery can be effectively used to actual applications to determine the analysis zone, which is composed of networks to extract these indices. As the results of the implementation and the case examples, it is notified that alpha and gamma indices as well as shimbel index can be used as referential data or auxiliary information for urban planning and transportation planning.