• Title/Summary/Keyword: One-Dimensional Search

Search Result 145, Processing Time 0.022 seconds

Crater Wear Measurement Using Computer Vision and Automatic Focusing (컴퓨터 비젼 및 자동초점장치를 이용한 크레이타 마멸측정)

  • Yang, Min-Yang;Gwon, O-Dal
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.12
    • /
    • pp.3759-3766
    • /
    • 1996
  • In this paper a new gefchmique to measaure the creater wear using image processing and automatic focusing is presented. The contour detection algorithm, which can adopt ina noisy image, is suggested. It is suitable for eliminating high frequency noses with lower processing time and without blurring. An automatic focusing technique is applied to measure a createrwear depth with a one-dimensional search algorithm for finding the bestfocus. This method is implemented in the tool microscope driven by a servo motor. The results show that the countour and depth of crater wear can be measured reliably.

A Practical Method for Computing Wave Resistance (조파저항 계산을 위한 실용적인 방법)

  • Seung-Joon Lee
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.31 no.1
    • /
    • pp.111-120
    • /
    • 1994
  • This is a continuing work of Van & Lee[1]. Some unresolved results of theirs are first discussed more, and then Tulis's[2] exact theory is briefly reviewed. A second order theory derived from Tulin's is used as a basis to judge the accuracy of the Poisson and the Dawson[3] free surface boundary condition(FSBC) in the low speed region for a two-dimensional submerged body. In search of a new FSBC, a purely numerical approach is adopted, and we show one candidate and its performance, which is satisfactory to a certain degree.

  • PDF

An Efficient Concurrency Control Algorithm for Multi-dimensional Index Structures (다차원 색인구조를 위한 효율적인 동시성 제어기법)

  • 김영호;송석일;유재수
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.80-94
    • /
    • 2003
  • In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

xPlaneb: 3-Dimensional Bitmap Index for Index Document Retrieval (xPlaneb: XML문서 검색을 위한 3차원 비트맵 인덱스)

  • 이재민;황병연
    • Journal of KIISE:Databases
    • /
    • v.31 no.3
    • /
    • pp.331-339
    • /
    • 2004
  • XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

Experimental Study on the Dynamic Response of Box Girder Long-Span Bridges under Various Travelling Vehicles (다양한 차량주행에 의한 박스형 장대교량의 동적 응답에 관한 실험적 연구)

  • Lee, Rae-Chul;Lee, Sang-Youl;Yhim, Sung-Soon
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.8 no.1
    • /
    • pp.129-138
    • /
    • 2004
  • In this study we determine a dynamic analysis of the existing two-span prestressed concrete box girder bridge subjected to moving vehicle loads using the experimental measurements. The moving loads applied in this paper are classified as general travelling, suddenly brake, continuous travelling, reversely travelling and reversely travelling impact loads for increasing velocities. For each travelling load, we search dynamic behaviors and characteristic in various measuring point of box girder section. In addition, the three-dimensional numerical results analyzed by the developed finite element program using flat shell element with six degrees of freedom per a node are compared with the measured experimental data. Dynamic behaviors caused impact loads by suddenly braking, reversely travelling, are bigger than by general travelling in box girder. Three-dimensional numerical results are better than one-dimensional results.

Joint Time Delay and Angle Estimation Using the Matrix Pencil Method Based on Information Reconstruction Vector

  • Li, Haiwen;Ren, Xiukun;Bai, Ting;Zhang, Long
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5860-5876
    • /
    • 2018
  • A single snapshot data can only provide limited amount of information so that the rank of covariance matrix is not full, which is not adopted to complete the parameter estimation directly using the traditional super-resolution method. Aiming at solving the problem, a joint time delay and angle estimation using matrix pencil method based on information reconstruction vector for orthogonal frequency division multiplexing (OFDM) signal is proposed. Firstly, according to the channel frequency response vector of each array element, the algorithm reconstructs the vector data with delay and angle parameter information from both frequency and space dimensions. Then the enhanced data matrix for the extended array element is constructed, and the parameter vector of time delay and angle is estimated by the two-dimensional matrix pencil (2D MP) algorithm. Finally, the joint estimation of two-dimensional parameters is accomplished by the parameter pairing. The algorithm does not need a pseudo-spectral peak search, and the location of the target can be determined only by a single receiver, which can reduce the overhead of the positioning system. The theoretical analysis and simulation results show that the estimation accuracy of the proposed method in a single snapshot and low signal-to-noise ratio environment is much higher than that of Root Multiple Signal Classification algorithm (Root-MUSIC), and this method also achieves the higher estimation performance and efficiency with lower complexity cost compared to the one-dimensional matrix pencil algorithm.

Identification of Differentially Expressed Proteins at Four Growing Stages in Chicken Liver

  • Lee, K.Y.;Jung, K.C.;Jang, B.G.;Choi, K.D.;Jeon, J.T.;Lee, J.H.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.21 no.10
    • /
    • pp.1383-1388
    • /
    • 2008
  • Because of high growth rate and large deposition of fat in the abdomen, the chicken has been used as a model organism for understanding lipid metabolism, fattening and growing. In this study, differentially expression of proteins in chicken liver, one of the important organs for lipid metabolism, has been investigated at four different growing stages. After separation of proteins using two-dimensional electrophoresis (2-DE), more than 700 protein spots were detected. Among them, 13 growing stage specific proteins in chicken liver were selected and further investigated by matrix-assisted laser adsorptions ionization-time of flight mass spectrometry (MALDI-TOF MS). Of these, 12 proteins were matched to existing proteins based on a database search. The identified fat-related proteins in this study were fatty acid synthase (FASN) and malic enzyme (ME1). These proteins were more highly expressed at week 32 than at other weeks. In order to confirm the differential expression, one of the proteins, FASN, was confirmed by western blotting. The identified proteins will give valuable information on biochemical roles in chicken liver, especially for lipid metabolism.

A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization (구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구)

  • 박영선;이상헌;박경진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.

Object-Based Video Segmentation Using Spatio-temporal Entropic Thresholding and Camera Panning Compensation (시공간 엔트로피 임계법과 카메라 패닝 보상을 이용한 객체 기반 동영상 분할)

  • 백경환;곽노윤
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.3
    • /
    • pp.126-133
    • /
    • 2003
  • This paper is related to a morphological segmentation method for extracting the moving object in video sequence using global motion compensation and two-dimensional spatio-temporal entropic thresholding. First, global motion compensation is performed with camera panning vector estimated in the hierarchical pyramid structure constructed by wavelet transform. Secondly, the regions with high possibility to include the moving object between two consecutive frames are extracted block by block from the global motion compensated image using two-dimensional spatio-temporal entropic thresholding. Afterwards, the LUT classifying each block into one among changed block, uncertain block, stationary block according to the results classified by two-dimensional spatio-temporal entropic thresholding is made out. Next, by adaptively selecting the initial search layer and the search range referring to the LUT, the proposed HBMA can effectively carry out fast motion estimation and extract object-included region in the hierarchical pyramid structure. Finally, after we define the thresholded gradient image in the object-included region, and apply the morphological segmentation method to the object-included region pixel by pixel and extract the moving object included in video sequence. As shown in the results of computer simulation, the proposed method provides relatively good segmentation results for moving object and specially comes up with reasonable segmentation results in the edge areas with lower contrast.

  • PDF

A Personal Digital Library on a Distributed Mobile Multiagents Platform (분산 모바일 멀티에이전트 플랫폼을 이용한 사용자 기반 디지털 라이브러리 구축)

  • Cho Young Im
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.12
    • /
    • pp.1637-1648
    • /
    • 2004
  • When digital libraries are developed by the traditional client/sever system using a single agent on the distributed environment, several problems occur. First, as the search method is one dimensional, the search results have little relationship to each other. Second, the results do not reflect the user's preference. Third, whenever a client connects to the server, users have to receive the certification. Therefore, the retrieval of documents is less efficient causing dissatisfaction with the system. I propose a new platform of mobile multiagents for a personal digital library to overcome these problems. To develop this new platform I combine the existing DECAF multiagents platform with the Voyager mobile ORB and propose a new negotiation algorithm and scheduling algorithm. Although there has been some research for a personal digital library, I believe there have been few studies on their integration and systemization. For searches of related information, the proposed platform could increase the relationship of search results by subdividing the related documents, which are classified by a supervised neural network. For the user's preference, as some modular clients are applied to a neural network, the search results are optimized. By combining a mobile and multiagents platform a new mobile, multiagents platform is developed in order to decrease a network burden. Furthermore, a new negotiation algorithm and a scheduling algorithm are activated for the effectiveness of PDS. The results of the simulation demonstrate that as the number of servers and agents are increased, the search time for PDS decreases while the degree of the user's satisfaction is four times greater than with the C/S model.