• Title/Summary/Keyword: 부그래프

Search Result 187, Processing Time 0.026 seconds

Determination of the Nonlinear Parameters of Stiffness and Force Factor of the Loudspeaker (스피커 지지부 강성과 Force Factor의 비선형계수 추출)

  • Doo, Se-Jin;Sung, Koeng-Mo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.5
    • /
    • pp.29-35
    • /
    • 1995
  • Nonlinear distortion arising from the nonlinear movement of the loudspeaker diaphragm degradates the tone quality. The distortion is, in low frequency range, mainly caused by nonlinear characteristics of the suspension stiffness and the force factor. In this paper, the nonlinear suspension stiffness and the nonlinear force factor are modeled to the quadratic functions and a method is proposed to determine their coefficients. An additional mass to the diaphragm moved the quiescent point of the diaphragm and uncoupled the stiffness and the force factor. This made it possible to deter mine the coefficients of the nonlinear suspension stiffness by measuring the resonance frequencies at several quiescent points. The coefficients of the nonlinear force factor are then determined by fitting the curve which is calculated from the waveforms of input voltage and input current, and the displacement of the diaphragm at resonance frequency.

  • PDF

Embedding Algorithms Hypercube, HCN, and HFN into HFCube Interconnection Networks (상호연결망 HFCube와 하이퍼큐브, HCN, HFN 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1361-1368
    • /
    • 2014
  • In this paper, we analyze emddings among HFCube(n,n), HCN(n,n), HFN(n,n) with lower network cost than that of Hypercube. The results are as follows. We propose that $Q_{2n}$ can be embedded into HFCube(n,n) with dilation 5, congestion 2. HCN(n,n) and HFN(n,n) are subgraphs of HFCube(n,n). HFCube(n,n) can be embedded into HFN(n,n) with dilation 3. HFCube(n,n) can be embedded into HCN(n,n) with dilation O(n). The results will be helpful to analyze several efficient properties in each interconnection network.

Implementation of FMCW Radar Signal Processing Module Using MPC5775K (MPC5775K를 이용한 FMCW 레이더 신호처리부 구현)

  • Seo, Min-kyo;Oh, Woojin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.684-685
    • /
    • 2017
  • FMCW radar, which is widely used as a front collision warning system for vehicles, is now being commercialized. In this study we develope the radar signal processing system using MPC5775K that is specialized for high performance ADAS. That has special features for ADAS such as 10Msps 12bit ADC, 50MHz Radix-4 FFT, CTE(Cross Triggering Engine) for synchronized triggering between DAC and ADC. The baseband processing board is implemented and shows the result in Matlab.

  • PDF

Comprehensive Performance Analysis and Comparison of various Digital Communication Systems in an Multipath Fading Channel with additive Mixture of Gaussian and Impulsive Noise [Part-1] (가우스성 잡음과 임펄스성 잡음이 혼재하는 다중전파 페이딩 전송로상에서의 제반 디지털 통신 시스템 특성의 종합분석 및 비교에 관한 연구(제 1 부))

  • 김현철;고봉진;공병옥;조성준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.3
    • /
    • pp.263-279
    • /
    • 1989
  • In part-1 of this paper, the error rate equations of digitally modulated signals transmitted though the Gaussian/Impulsive noise channel have been derived. Using the derived equations for the error probabilities of ASK, QAM, CPSK, DPSK, FSK and MSK signals, the error rate performances of digital modulation systems have been evaluated and represented in the figures as the functions of carrier-to-noise power ratio(CNR), impulsive index, and the ration of Gaussian noise power component to impulsive noise power component. The results are shown in graphs to known how much impulsive noise effects on digital signals than Gaussian noise.

  • PDF

A Dynamic Partitioning Scheme for Distributed Storage of Large-Scale RDF Data (대규모 RDF 데이터의 분산 저장을 위한 동적 분할 기법)

  • Kim, Cheon Jung;Kim, Ki Yeon;Yoo, Jong Hyeon;Lim, Jong Tae;Bok, Kyoung Soo;Yoo, Jae Soo
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1126-1135
    • /
    • 2014
  • In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.

An improved Bellman-Ford algorithm based on SPFA (SPFA를 기반으로 개선된 벨만-포드 알고리듬)

  • Chen, Hao;Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.721-726
    • /
    • 2012
  • In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

Automated Generation of Composite Web Services based on Functional Semantics (기능적 의미에 기반한 복합 웹 서비스 자동 구성)

  • Shin, Dong-Hoon;Lee, Kyong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1310-1323
    • /
    • 2008
  • Recently, many studies on automated generation of composite Web services have been done. Most of these works compose Web services by chaining their inputs and outputs, but do not consider the functional semantics. Therefore, they may construct unsatisfied composite services against users' intention. Futhermore, they have high time-complexity since every possible combinations of available services should be considered. To resolve these problems, this paper proposes a sophisticated composition method that explicitly specifies and uses the functional semantics of Web services. Specifically, A graph model is constructed to represent the functional semantics of Web services as well as the dependency among inputs and outputs. On the graph, we search core services which provide the requested function ality and additional services which transform between I/O types of the user request and the core services. Then, composite services are built from combinations of the discovered services. The proposed method improves the semantic correctness of composite services by the functional semantics of Web services, and reduces the time complexity by combinations of functionally related services.

  • PDF

Development of Privacy Impact Assessment Tool (개인정보 영향평가 툴 개발)

  • Heo, Jin-Man;Woo, Chang-Woo;Park, Jung-Ho
    • The Journal of Korean Association of Computer Education
    • /
    • v.15 no.2
    • /
    • pp.75-81
    • /
    • 2012
  • As the number of web users is increasing, the leakage of personal information is increasing. If some personal information is leaked, the victim can suffer from material damage or mental damage at the same time. Most of the leakages are result from the people who works for the personal information by accident or design. Hence, the Ministry of Public Administration and Security proposeed the measuring index and enumerates the details. The index is used in a system to check protection of a personal information. However, because this system is used to evaluate after the leakage, it cannot be used to construct some security system or programming a security system. To solve this problem, it needs to express the diversity of items and be able to count what assessors want to count. Thus, a summary sheet which displays the result of the tool will be presented in a radial form graph. Details will be presented as a bar graph. Therefore, it will be proposed that the tool can grasp the weak point and propose the direction of security.

  • PDF

Design and Implementation of Real-Time Monitoring System for PLGR Work (PLGR 작업을 위한 실시간 모니터링 시스템의 설계 및 구현)

  • Lee, Tae-Oh;Jeong, Seong-Hoon;Yim, Jae-Hong
    • Journal of Navigation and Port Research
    • /
    • v.27 no.1
    • /
    • pp.87-95
    • /
    • 2003
  • Submarine optical fiber cable construction consists of marine survey, PLGR(Pre Lay Grapnel Run), shore-end-work, laying the submarine optical cable. This PLGR is work to ease the cable lay safely in seabed, improve the performance of Plough and ROV (Remotely-Operated Vehicle) laying work, and protect laying equipment. This paper presents the design and implementation of real-time monitoring system for PLGR work in submarine optical fiber cable construction enterprise. In this paper, we designe overall real-time monitoring system. For this purpose, the modules such as serial multiport communication module, real-time processing module, environment configuration module, real-time graph and a printout modules are designed and implemented. For the validity evaluation of this paper, serial multi port communication module, data parsing, realtime graph output are implemented and tested.

An Efficient Technique for Evaluating Queries with Multiple Regular Path Expressions (다중 정규 경로 질의 처리를 위한 효율적 기법)

  • Chung, Tae-Sun;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.449-457
    • /
    • 2001
  • As XML has become an emerging standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. XML queries are based on regular path queries, which find objects reachable by given regular expressions. To answer many kinds of user queries, it is necessary to evaluate queries that have multiple regular path expressions. However, previous work such as query rewriting and query optimization in the frame work of semistructured data has dealt with a single regular expression. For queries that have multiple regular expressions we suggest a two phase optimizing technique: 1. query rewriting using views by finding the mappings from the view's body to the query's body and 2. for rewritten queries, evaluating each query conjunct and combining them. We show that our rewriting algorithm is sound and our query evaluation technique is more efficient than the previous work on optimizing semistructured queries.

  • PDF