• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.031 seconds

Characterization of Yeast and Bacterial Type Strains with Food and Agricultural Applications by MALDI-TOF Mass Spectrometry Biotyping

  • Harnpicharnchai, Piyanun;Jaresitthikunchai, Janthima;Seesang, Mintra;Jindamorakot, Sasitorn;Tanapongpipat, Sutipa;Ingsriswang, Supawadee
    • Microbiology and Biotechnology Letters
    • /
    • v.48 no.2
    • /
    • pp.138-147
    • /
    • 2020
  • Various microorganisms play important roles in food fermentation, food spoilage, and agriculture. In this study, the biotype of 54 yeast and bacterial strains having high potential for utilization in food and agriculture, including Candida spp., Lactobacillus spp., and Acetobacter spp., were characterized by matrix-assisted laser desorption/ionization time-of flight mass spectrometry (MALDI-TOF MS). This characterization using a fast and robust method provides much-needed information on the selected microorganisms and will facilitate effective usage of these strains in various applications. Importantly, the unique protein profile of each microbial species obtained from this study was used to create a database of fingerprints from these species. The database was validated using microbial strains of the same species by comparing the mass spectra with the created database through pattern matching. The created reference database provides crucial information and is useful for further utilization of a large number of valuable microorganisms relevant to food and agriculture.

Keypoint Detection Using Normalized Higher-Order Scale Space Derivatives (스케일 공간 고차 미분의 정규화를 통한 특징점 검출 기법)

  • Park, Jongseung;Park, Unsang
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.93-96
    • /
    • 2015
  • The SIFT method is well-known for robustness against various image transformations, and is widely used for image retrieval and matching. The SIFT method extracts keypoints using scale space analysis, which is different from conventional keypoint detection methods that depend only on the image space. The SIFT method has also been extended to use higher-order scale space derivatives for increasing the number of keypoints detected. Such detection of additional keypoints detected was shown to provide performance gain in image retrieval experiments. Herein, a sigma based normalization method for keypoint detection is introduced using higher-order scale space derivatives.

Location Based Routing Service In Distributed Web Environment

  • Kim, Do-Hyun;Jang, Byung-Tae
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.340-342
    • /
    • 2003
  • Location based services based on positions of moving objects are expanding the business area gradually. The location is included all estimate position of the future as well as the position of the present and the past. Location based routing service is active business application in which the position information of moving objects is applied efficiently. This service includes the trajectory of past positions, the real-time tracing of present position of special moving objects, and the shortest and optimized paths combined with map information. In this paper, we describes the location based routing services is extend in distributed web GIS environment. Web GIS service systems provide the various GIS services of analyzing and displaying the spatial data with friendly user - interface. That is, we propose the efficient architecture and technologies for servicing the location based routing services in distributed web GIS environment. The position of moving objects is acquired by GPS (Global Positioning System) and converted the coordinate of real world by map matching with geometric information. We suppose the swapping method between main memory and storages to access the quite a number of moving objects. And, the result of location based routing services is wrapped the web-styled data format. We design the schema based on the GML. We design these services as components were developed in object-oriented computing environment, and provide the interoperability, language-independent, easy developing environment as well as re - usability.

  • PDF

Issues in the Design of Molecular and Genetic Epidemiologic Studies

  • Fowke, Jay H.
    • Journal of Preventive Medicine and Public Health
    • /
    • v.42 no.6
    • /
    • pp.343-348
    • /
    • 2009
  • The final decision of study design in molecular and genetic epidemiology is usually a compromise between the research study aims and a number of logistical and ethical barriers that may limit the feasibility of the study or the interpretation of results. Although biomarker measurements may improve exposure or disease assessments, it is necessary to address the possibility that biomarker measurement inserts additional sources of misclassification and confounding that may lead to inconsistencies across the research literature. Studies targeting multi-causal diseases and investigating gene-environment interactions must not only meet the needs of a traditional epidemiologic study but also the needs of the biomarker investigation. This paper is intended to highlight the major issues that need to be considered when developing an epidemiologic study utilizing biomarkers. These issues covers from molecular and genetic epidemiology (MGE) study designs including cross-sectional, cohort, case-control, clinical trials, nested case-control, and case-only studies to matching the study design to the MGE research goals. This review summarizes logistical barriers and the most common epidemiological study designs most relevant to MGE and describes the strengths and limitations of each approach in the context of common MGE research aims to meet specific MEG objectives.

Multi-Level Motion Estimation Algorithm Using Motion Information in Blocks (블록 내의 움직임 정보를 이용한 다단계 움직임 예측 알고리즘)

  • Heak Bong Kwon
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.2
    • /
    • pp.259-266
    • /
    • 2003
  • In this paper, we propose a multi-level block matching algorithm using motion information in blocks. In the proposed algorithm, the block-level is decided by the motion degree in the block before motion searching procedure, and then adequate motion searching performs according to the block-level. This improves computational efficiency by eliminating the unnecessary searching Process in no motion or low motion regions, and brings more accurate estimation results by deepening motion searching Process in high motion regions. Simulation results show that the proposed algorithm brings the lower estimation error about 20% MSE reduction with the fewer blocks pet frame and the operation number was reduced to 56% compared to TSSA and 98% compared to FS -BMA with constant block size.

  • PDF

A framework for Crowdfunding platforms to match services between funders and fundraisers

  • Hasnan, Baber
    • The Journal of Industrial Distribution & Business
    • /
    • v.10 no.4
    • /
    • pp.25-31
    • /
    • 2019
  • Purpose - A framework is suggested in this paper which will help crowdfunding platforms to match projects according to expectations of funders, leading to successful campaigns and thus increase the profitability of the crowdfunding platform. Research design, data, and methodology - The paper is theoretical and conceptual in nature which proposes a model for crowdfunding platforms to match expectations of crowds with project fundraisers. Results - Crowdfunding platforms are going through incremental innovations in order to match customer (funders and fundraisers) expectations. Leading crowdfunding platforms like Kickstart holds benchmark for other players in the market but the secret of success lies in matching quality projects with the appropriate funders. Crowdfunding platforms have to securitize the projects and allow only quality projects but also provide a wide range of options for funders. Thus, to manage this trade-off between quality and quantity of options, a framework is proposed. Conclusions - Crowdfunding platforms have to adopt a model which will help them in providing a perfect match between crowds and fundraisers. Each member of the crowd and every project will be assigned a category and rating based on the past records. Securitization of projects will help to entertain only demanded projects which will reduce the number of failing campaigns.

Point Cloud Registration Algorithm Based on RGB-D Camera for Shooting Volumetric Objects (체적형 객체 촬영을 위한 RGB-D 카메라 기반의 포인트 클라우드 정합 알고리즘)

  • Kim, Kyung-Jin;Park, Byung-Seo;Kim, Dong-Wook;Seo, Young-Ho
    • Journal of Broadcast Engineering
    • /
    • v.24 no.5
    • /
    • pp.765-774
    • /
    • 2019
  • In this paper, we propose a point cloud matching algorithm for multiple RGB-D cameras. In general, computer vision is concerned with the problem of precisely estimating camera position. Existing 3D model generation methods require a large number of cameras or expensive 3D cameras. In addition, the conventional method of obtaining the camera external parameters through the two-dimensional image has a large estimation error. In this paper, we propose a method to obtain coordinate transformation parameters with an error within a valid range by using depth image and function optimization method to generate omni-directional three-dimensional model using 8 low-cost RGB-D cameras.

Shape Description and Retrieval Using Included-Angular Ternary Pattern

  • Xu, Guoqing;Xiao, Ke;Li, Chen
    • Journal of Information Processing Systems
    • /
    • v.15 no.4
    • /
    • pp.737-747
    • /
    • 2019
  • Shape description is an important and fundamental issue in content-based image retrieval (CBIR), and a number of shape description methods have been reported in the literature. For shape description, both global information and local contour variations play important roles. In this paper a new included-angular ternary pattern (IATP) based shape descriptor is proposed for shape image retrieval. For each point on the shape contour, IATP is derived from its neighbor points, and IATP has good properties for shape description. IATP is intrinsically invariant to rotation, translation and scaling. To enhance the description capability, multiscale IATP histogram is presented to describe both local and global information of shape. Then multiscale IATP histogram is combined with included-angular histogram for efficient shape retrieval. In the matching stage, cosine distance is used to measure shape features' similarity. Image retrieval experiments are conducted on the standard MPEG-7 shape database and Swedish leaf database. And the shape image retrieval performance of the proposed method is compared with other shape descriptors using the standard evaluation method. The experimental results of shape retrieval indicate that the proposed method reaches higher precision at the same recall value compared with other description method.

Deep Learning Model on Gravitational Waves of Merger and Ringdown in Coalescence of Binary Black Holes

  • Lee, Joongoo;Cho, Gihyuk;Kim, Kyungmin;Oh, Sang Hoon;Oh, John J.;Son, Edwin J.
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.46.2-46.2
    • /
    • 2019
  • We propose a deep learning model that can generate a waveform of coalescing binary black holes in merging and ring-down phases in less than one second with a graphics processing unit (GPU) as an approximant of gravitational waveforms. Up to date, numerical relativity has been accepted as the most adequate tool for the accurate prediction of merger phase of waveform, but it is known that it typically requires huge amount of computational costs. We present our method can generate the waveform with ~98% matching to that of the status-of-the-art waveform approximant, effective-one-body model calibrated to numerical relativity simulation and the time for the generation of ~1500 waveforms takes O(1) seconds. The validity of our model is also tested through the recovery of signal-to-noise ratio and the recovery of waveform parameters by injecting the generated waveforms into a public open noise data produced by LIGO. Our model is readily extendable to incorporate additional physics such as higher harmonics modes of the ring-down phase and eccentric encounters, since it only requires sufficient number of training data from numerical relativity simulations.

  • PDF

A Review of Machine Learning Algorithms for Fraud Detection in Credit Card Transaction

  • Lim, Kha Shing;Lee, Lam Hong;Sim, Yee-Wai
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.9
    • /
    • pp.31-40
    • /
    • 2021
  • The increasing number of credit card fraud cases has become a considerable problem since the past decades. This phenomenon is due to the expansion of new technologies, including the increased popularity and volume of online banking transactions and e-commerce. In order to address the problem of credit card fraud detection, a rule-based approach has been widely utilized to detect and guard against fraudulent activities. However, it requires huge computational power and high complexity in defining and building the rule base for pattern matching, in order to precisely identifying the fraud patterns. In addition, it does not come with intelligence and ability in predicting or analysing transaction data in looking for new fraud patterns and strategies. As such, Data Mining and Machine Learning algorithms are proposed to overcome the shortcomings in this paper. The aim of this paper is to highlight the important techniques and methodologies that are employed in fraud detection, while at the same time focusing on the existing literature. Methods such as Artificial Neural Networks (ANNs), Support Vector Machines (SVMs), naïve Bayesian, k-Nearest Neighbour (k-NN), Decision Tree and Frequent Pattern Mining algorithms are reviewed and evaluated for their performance in detecting fraudulent transaction.