• Title/Summary/Keyword: matching structure

Search Result 778, Processing Time 0.03 seconds

Contactless Power Charger for Light Electric Vehicles Featuring Active Load Matching

  • Jiang, Wei;Xu, Song;Li, Nailu
    • Journal of Power Electronics
    • /
    • v.16 no.1
    • /
    • pp.102-110
    • /
    • 2016
  • Contactless power transfer technology is gaining increasing attention in city transportation applications because of its high mobility and flexibility in charging and its commensurate power level with conductive power transfer method. In this study, an inductively coupled contactless charging system for a 48 V light electric vehicle is proposed. Although this study does not focus on system efficiency, the generic problems in an inductively coupled contactless power transfer system without ferromagnetic structure are discussed. An active load matching method is also proposed to control the power transfer on the receiving side through a load matching converter. Small signal modeling and linear control technology are applied to the load matching converter for port voltage regulation, which effectively controls the power flow into the load. A prototype is built, and experiments are conducted to reveal the intrinsic characteristics of a series-series resonant inductive power charger in terms of frequency, air gap length, power flow control, coil misalignment, and efficiency issues.

A Novel Scalable and Storage-Efficient Architecture for High Speed Exact String Matching

  • Peiravi, Ali;Rahimzadeh, Mohammad Javad
    • ETRI Journal
    • /
    • v.31 no.5
    • /
    • pp.545-553
    • /
    • 2009
  • String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.

Appearance-Order-Based Schema Matching

  • Ding, Guohui;Cao, Keyan;Wang, Guoren;Han, Dong
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.2
    • /
    • pp.94-106
    • /
    • 2014
  • Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

Autonomous Calibration of a 2D Laser Displacement Sensor by Matching a Single Point on a Flat Structure (평면 구조물의 단일점 일치를 이용한 2차원 레이저 거리감지센서의 자동 캘리브레이션)

  • Joung, Ji Hoon;Kang, Tae-Sun;Shin, Hyeon-Ho;Kim, SooJong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.2
    • /
    • pp.218-222
    • /
    • 2014
  • In this paper, we introduce an autonomous calibration method for a 2D laser displacement sensor (e.g. laser vision sensor and laser range finder) by matching a single point on a flat structure. Many arc welding robots install a 2D laser displacement sensor to expand their application by recognizing their environment (e.g. base metal and seam). In such systems, sensing data should be transformed to the robot's coordinates, and the geometric relation (i.e. rotation and translation) between the robot's coordinates and sensor coordinates should be known for the transformation. Calibration means the inference process of geometric relation between the sensor and robot. Generally, the matching of more than 3 points is required to infer the geometric relation. However, we introduce a novel method to calibrate using only 1 point matching and use a specific flat structure (i.e. circular hole) which enables us to find the geometric relation with a single point matching. We make the rotation component of the calibration results as a constant to use only a single point by moving a robot to a specific pose. The flat structure can be installed easily in a manufacturing site, because the structure does not have a volume (i.e. almost 2D structure). The calibration process is fully autonomous and does not need any manual operation. A robot which installed the sensor moves to the specific pose by sensing features of the circular hole such as length of chord and center position of the chord. We show the precision of the proposed method by performing repetitive experiments in various situations. Furthermore, we applied the result of the proposed method to sensor based seam tracking with a robot, and report the difference of the robot's TCP (Tool Center Point) trajectory. This experiment shows that the proposed method ensures precision.

A Multiresolution Stereo Matching Based on Genetic Algorithm using Edge Information (에지 정보를 이용한 유전 알고리즘 기반의 다해상도 스테레오 정합)

  • Hong, Seok-Keun;Cho, Seok-Je
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.63-68
    • /
    • 2010
  • In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

A Study on Improving Recruiting-Job Seeking Matching Service for Software Developers (소프트웨어인력 취업과 채용 매칭서비스 개선방안 연구)

  • Kim, Hyunsoo
    • Journal of Service Research and Studies
    • /
    • v.3 no.1
    • /
    • pp.55-73
    • /
    • 2013
  • The purpose of this research is to find a solution for matching service between recruiting and job seeking of software developers. An efficient matching service solution is essential for acquiring solid global competitiveness in software industry and IT academia. An in-depth analysis on deep-rooted problems on mismatching has been performed. Past and present policies on mismatching solutions have been reviewed based on desirable co-growth structure. A new matching solution has been derived and a triple-helix strategy has been suggested. A survey result for 14 domain experts and 85 employees of large and small software companies shows that the suggested matching solution is useful. The results of this research can be used for finding a better matching service solution and policies.

  • PDF

An Efficient Application of XML Schema Matching Technique to Structural Calculation Document of Bridge (XML 스키마 매칭 기법의 교량 구조계산서 적용 방안)

  • Park, Sang Il;Kim, Bong-Geun;Lee, Sang-Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.1D
    • /
    • pp.51-59
    • /
    • 2012
  • An efficient application method of XML schema matching technique to the document structure of structural calculation document (SCD) of bridge is proposed. With 30 case studies, a parametric study on weightings of name, sibling, child, and parent elements of XML scheme component that are used in the similarity measure of XML schema matching technique has been performed, and suitable weighting to analyze document structure of SCD is suggested. A simplified formula for quantification of similarity is also introduced to reduce computation time in huge scale document structure of SCDs. Numerical experiments show that the suggested method can increase the accuracy of XML schema matching by 10% with suitable weighting parameters, and can maintain almost the same accuracy without weighting parameters compared to previous studies. In addition, computation time can be reduced dramatically when the proposed simplified formula for the quantification of similarity is used. In the numerical experiments of testing 20 practical SCDs of bridges, the suggested method is superior to previous studies in the accuracy of analyzing document structure and 4 to 460 times faster than the previous results in computation time.

Web Service Discovery based on Process Information and QoS (프로세스 정보와 QoS를 고려한 웹 서비스 발견)

  • You So-Yeon;Yu Jeong-Youn;Lee Kyu-Chul
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.3
    • /
    • pp.85-110
    • /
    • 2005
  • OWL-S has a major leadership in the field of Web Service discovery and is being actively studied in LARKS and METEOR-S projects. These researches do not consider all components of OWL-S standards, and it is needed to enhance their discovery algorithms. In this paper, we propose matching algorithms based on process information such as process structure matching, service classification matching and business pattern matching algorithms. We also improve the QoS matching algorithm of METEOR-S project. Finally, we integrate these two kinds of matching algorithms as accommodate users preferences.

  • PDF

Critical Control Systems Design via LTR Technique

  • Ishihara, Tadashi;Imai, Minoru;Ono, Takahiko;Inooka, Hikaru
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.19-24
    • /
    • 2003
  • A new method for designing critical control systems is proposed in this paper. The controller structure is chosen as a Davison type integral controller with an observer. The proposed method consists of two steps. First, the state feedback critical control system is designed using a quadratic performance index with tunable parameters. Second, the observer gain matrix is determined by the formal LTR procedure using a Riccati equation. Consequently, the search space can be reduced considerably compared with the conventional approach. Although the proposed method sacrifices a large freedom for the choice of controller structure provided by the principle of matching, the controller structure used in this paper is not excessively complex and can be used for most applications. An illustrative design example is presented.

  • PDF

A 6-bit 3.3GS/s Current-Steering DAC with Stacked Unit Cell Structure

  • Kim, Si-Nai;Kim, Wan;Lee, Chang-Kyo;Ryu, Seung-Tak
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.12 no.3
    • /
    • pp.270-277
    • /
    • 2012
  • This paper presents a new DAC design strategy to achieve a wideband dynamic linearity by increasing the bandwidth of the output impedance. In order to reduce the dominant parasitic capacitance of the conventional matrix structure, all the cells associated with a unit current source and its control are stacked in a single column very closely (stacked unit cell structure). To further reduce the parasitic capacitance, the size of the unit current source is considerably reduced at the sacrifice of matching yield. The degraded matching of the current sources is compensated for by a self-calibration. A prototype 6-bit 3.3-GS/s current-steering full binary DAC was fabricated in a 1P9M 90 nm CMOS process. The DAC shows an SFDR of 36.4 dB at 3.3 GS/s Nyquist input signal. The active area of the DAC occupies only $0.0546mm^2$ (0.21 mm ${\times}$ 0.26 mm).