• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.032 seconds

Developing Matching Table and Classification Code for Efficient Management of HAZMAT (효율적인 위험물 관리를 위한 매칭테이블 구축 및 코드화 방안)

  • An, Chan-Gi;Chung, Sung-Bong;Park, Min-Jun;Jang, Seong-Yong
    • Journal of the Korea Safety Management & Science
    • /
    • v.14 no.3
    • /
    • pp.143-150
    • /
    • 2012
  • In Korea more than 38,000 types of hazardous material(HAZMAT) are distributed, accordingly the accidents during transportation are also increasing. The agencies related to HAZMAT such as Environment Ministry, National Emergency Management Agency and National Police Agency have their own regulations. However, the classification criteria of HAZMAT are different to each other, which causes many problems in response to transportation accidents. In this study the classification standard of HAZMAT and the classification code using CAS number are suggested to manage HAZMAT efficiently. Through efficient management and standard classification of HAZMAT, the rapid and systematic response to transportation accidents related to HAZMAT is expected to be possible.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

An In-Band Noise Filtering 32-tap FIR-Embedded ΔΣ Digital Fractional-N PLL

  • Lee, Jong Mi;Jee, Dong-Woo;Kim, Byungsub;Park, Hong-June;Sim, Jae-Yoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.15 no.3
    • /
    • pp.342-348
    • /
    • 2015
  • This paper presents a 1.9-GHz digital ${{\Delta}{\Sigma}}$ fractional-N PLL with a finite impulse response (FIR) filter embedded for noise suppression. The proposed digital implementation of FIR provides a simple method of increasing the number of taps without complicated calculation for gain matching. This work demonstrates 32 tap FIR filtering for the first time and successfully filtered the in-band phase noise generated from delta-sigma modulator (DSM). Design considerations are also addressed to find the optimum number of taps when the resolution of time-to-digital converter (TDC) is given. The PLL, fabricated in $0.11-{\mu}m$ CMOS, achieves a well-regulated in-band phase noise of less than -100 dBc/Hz for the entire range inside the bandwidth of 3 MHz. Compared with the conventional dual-modulus division, the proposed PLL shows an overall noise suppression of about 15dB both at in-band and out-of-band region.

Modeling of 18-Pulse STATCOM for Power System Applications

  • Singh, Bhim;Saha, R.
    • Journal of Power Electronics
    • /
    • v.7 no.2
    • /
    • pp.146-158
    • /
    • 2007
  • A multi-pulse GTO based voltage source converter (VSC) topology together with a fundamental frequency switching mode of gate control is a mature technology being widely used in static synchronous compensators (STATCOMs). The present practice in utility/industry is to employ a high number of pulses in the STATCOM, preferably a 48-pulse along with matching components of magnetics for dynamic reactive power compensation, voltage regulation, etc. in electrical networks. With an increase in the pulse order, need of power electronic devices and inter-facing magnetic apparatus increases multi-fold to achieve a desired operating performance. In this paper, a competitive topology with a fewer number of devices and reduced magnetics is evolved to develop an 18-pulse, 2-level $\pm$ 100MVAR STATCOM in which a GTO-VSC device is operated at fundamental frequency switching gate control. The inter-facing magnetics topology is conceptualized in two stages and with this harmonics distortion in the network is minimized to permissible IEEE-519 standard limits. This compensator is modeled, designed and simulated by a SimPowerSystems tool box in MATLAB platform and is tested for voltage regulation and power factor correction in power systems. The operating characteristics corresponding to steady state and dynamic operating conditions show an acceptable performance.

GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS

  • Liu, Shaoqiang;Peng, Yuejian
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.4
    • /
    • pp.1027-1039
    • /
    • 2019
  • The concept of jump concerns the distribution of $Tur{\acute{a}}n$ densities. A number ${\alpha}\;{\in}\;[0,1)$ is a jump for r if there exists a constant c > 0 such that if the $Tur{\acute{a}}n$ density of a family $\mathfrak{F}$ of r-uniform graphs is greater than ${\alpha}$, then the $Tur{\acute{a}}n$ density of $\mathfrak{F}$ is at least ${\alpha}+c$. To determine whether a number is a jump or non-jump has been a challenging problem in extremal hypergraph theory. In this paper, we give a way to generate non-jumps for hypergraphs. We show that if ${\alpha}$, ${\beta}$ are non-jumps for $r_1$, $r_2{\geq}2$ respectively, then $\frac{{\alpha}{\beta}(r_1+r_2)!r_1^{r_1}r_2^{r_2}}{r_1!r_2!(r_1+R_2)^{r_1+r_2}}$ is a non-jump for $r_1+r_2$. We also apply the Lagrangian method to determine the $Tur{\acute{a}}n$ density of the extension of the (r - 3)-fold enlargement of a 3-uniform matching.

Critical Appraisal Study of Knowledge Management and its Importance Among Public Sector

  • Gharieb, Magdah
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.273-283
    • /
    • 2021
  • The aim of this paper is to review the current knowledge management (KM) practices and their importance in the public sector of Saudi Arabia. Using the term "knowledge management in public sector", a search for available works was done in Google Scholar. In the first stage, the search for literature published under anytime choice was done in the first 10 pages of the search engine. Then another nine pages of Goggle Scholar were searched for more recent works published setting the time as 2014 to 2018. The search yielded 37 usable works for this review. The results of this literature search and review indicated that out of the 37 works reviewed, only three works were related to Saudi Arabia. Number of papers on factors of KM were maximum, many of them giving diagrammatic presentation of their results. KM modelling itself is not easy as only very few papers on KM modelling were available. Problems of too much reliance on qualitative data and hypotheses not matching with the literature backgrounds for them were also found. Considering the works related to KM, the number of papers in various categories may indicate the dimensions of KM to be considered when KM is implemented or evaluated in any public sector of any country. This applies to Saudi Arabian public sector organizations also. There is a fertile ground of research waiting to be investigated by researchers in Saudi Arabia.

An Operational Analysis for Solving Linear Equation Problems (조작적 분석을 통한 일차방정식 해결 연구)

  • Shin, Jae-Hong;Lee, Joong-Kweon
    • Journal of Educational Research in Mathematics
    • /
    • v.19 no.3
    • /
    • pp.461-477
    • /
    • 2009
  • In this study, an operational analysis in the context of linear equations is presented. For the analysis, several second-order models concerning students' whole number knowledge and fraction knowledge based on teaching experiment methodology were employed, in addition to our first-order analysis. This ontogenetic analysis begins with students' Explicitly Nested number Sequence (ENS) and proceeds on through various forms of linear equations. This study shows that even in the same representational forms of linear equations, the mathematical knowledge necessary for solving those equations might be different based on the type of coefficients and constants the equation consists of. Therefore, the pedagogical implications are that teachers should be able to differentiate between different types of linear equation problems and propose them appropriately to students by matching the required mathematical knowledge to the students' potential constructs.

  • PDF

Fingerprint Recognition using Information of Ridge Shape of Minutiae (특징점의 융선형태 정보를 이용한 지문인식)

  • Park Joong-Jo;Lee Kil-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.2
    • /
    • pp.67-73
    • /
    • 2005
  • Recently, the social requirement of personal identification techniques has been increasing. Fingerprint recognition is one of the biometries methods that has been widely used for this requirement. This paper proposes the fingerprint matching algorithm that uses the information of the ridge shapes of minutiae. In which, the data of the ridge shape are expressed in one-dimensional discrete-time signals. In our algorithm, we obtain one-dimensional discrete-time signals for ridge at every minutiae from input and registered fingerprints, and find pairs of minutia which have the similar ridge shape by comparing input fingerprint with registered fingerprint, thereafter we find candidates of rotation angle and moving displacement from the pairs of similar minutia, and obtain the final rotation angle and moving displacement value from those candidates set by using clustering method. After that, we align an input fingerprint by using obtained data, and calculate the matching rate by counting the number of corresponded pairs of minutia within the overlapped area of an input and registered fingerprints. As a result of experiment, false rejection rate(FRR) of $18.0\%$ at false acceptance rate(FAR) of $0.79\%$ is achieved.

  • PDF

Automatic Recognition of Local Wrinkles in Textile Using Block Matching Algorithm (블록 정합을 이용한 국부적인 직물 구김 인식)

  • Lee, Hyeon-Jin;Kim, Eun-Jin;Lee, Il-Byeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.3165-3177
    • /
    • 1999
  • With the recent outstanding advance in computer software and hardware, a number of researches to enhance the manufacturing speed and the process accuracy has been undertaken in many fields of textile industry. Frequently issued problems of automatic recognition of textile wrinkles in a grey scale image are as follows. First, changes in grey level intensity of wrinkles are so minute. Second, as both colors and patterns in a grey scale image appear in grey level intensity, it is difficult to sort out the wrinkle information only. Third, it is also difficult to distinguish grey level intensity changed by wrinkles from those by uneven illumination. This paper suggests a method of automatic recognition of textile wrinkles that can solve above problems concerned with wrinkles, which can be raised in a manufacturing process as one of errors. In this paper, we first make the outline of wrinkles distinctly, apply the block matching algorithm used in motion estimation, and then estimate block locations of target images corresponding to blocks of standard images with the assumption that wrinkles are kind of textile distortions caused by directional forces. We plot a "wrinkle map" considering distances between wrinkles as depths of wrinkles. But because mismatch can occur by different illumination intensity and changes in tensions and directions of the force, there are also undesirable patterns in the map. Post processing is needed to filter them out and get wrinkles information only. We use average grey level intensity of wrinkle map to recognize wrinkles. When it comes to textile with colors and patterns, previous researches on wrinkles in grey scale image hasn't been successful. But we make it possible by considering wrinkles as distortion.istortion.

  • PDF

Discovery and Execution Techniques of Semantic Web Services for Dynamic Web Services Composition (동적 웹 서비스 조합을 위한 시멘틱 웹 서비스 발견 및 실행 기법)

  • Lee Yong-ju
    • The KIPS Transactions:PartD
    • /
    • v.12D no.6 s.102
    • /
    • pp.889-898
    • /
    • 2005
  • Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.