• Title/Summary/Keyword: Searching Volume

Search Result 89, Processing Time 0.022 seconds

A Study on the Dispute Resolution of MIGA in the Investment Guarantee for Developing Countries (개발도상국 투자에서 MIGA의 분쟁해결제도에 관한 고찰)

  • Yu, Byoung Yook
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.60
    • /
    • pp.79-106
    • /
    • 2013
  • The world is significant increasing investment volume into developing countries from foreign investors. Foreign financial capital is searching in interesting place among the emerging market. However foreign investors put still their experience in the economical and social crisis with political risks in the host countries. MIGA entered into the political risks insurance market which has one of the basic matter of sponsored the private investment guarantee programs. They put guarantee or covering risks of currency inconvertibility, expropriation, breach of contract and political violence. In the case contracts of guarantee concluded between investor and MIGA which are disputes in relation to such MIGA service contract, it should be settled by negotiation, conciliation and arbitration under the convention establishing the Multilateral Investment Guarantee Agency(MIGA). All disputes within the scope to states and investor of MIGA members shall be settled in accordance with the procedure set out in the convention. Recently, MIGA is opening the office in Seoul to strengthen joint efforts between MIGA and Korea. It will be a good chance to consider sustainable improvement and dispute solutions for emerging countries in foreign investment to the korean investors.

  • PDF

MRI Image Retrieval Using Wavelet with Mahalanobis Distance Measurement

  • Rajakumar, K.;Muttan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.5
    • /
    • pp.1188-1193
    • /
    • 2013
  • In content based image retrieval (CBIR) system, the images are represented based upon its feature such as color, texture, shape, and spatial relationship etc. In this paper, we propose a MRI Image Retrieval using wavelet transform with mahalanobis distance measurement. Wavelet transformation can also be easily extended to 2-D (image) or 3-D (volume) data by successively applying 1-D transformation on different dimensions. The proposed algorithm has tested using wavelet transform and performance analysis have done with HH and $H^*$ elimination methods. The retrieval image is the relevance between a query image and any database image, the relevance similarity is ranked according to the closest similar measures computed by the mahalanobis distance measurement. An adaptive similarity synthesis approach based on a linear combination of individual feature level similarities are analyzed and presented in this paper. The feature weights are calculated by considering both the precision and recall rate of the top retrieved relevant images as predicted by our enhanced technique. Hence, to produce effective results the weights are dynamically updated for robust searching process. The experimental results show that the proposed algorithm is easily identifies target object and reduces the influence of background in the image and thus improves the performance of MRI image retrieval.

A Two-level Indexing Method in Flash Memory Environment (플래시 메모리 환경을 위한 이단계 인덱싱 방법)

  • Kim, Jong-Dae;Chang, Ji-Woong;Hwang, Kyu-Jeong;Kim, Sang-Wook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.713-717
    • /
    • 2008
  • Recently, as the capacity of flash memory increases rapidly, efficient indexing methods become crucial for fast searching of a large volume of data stored in flash memory. Flash memory has its unique characteristics: the write operation is much more costly than the read operation and in-place updating is not allowed. In this paper, we propose a novel index structure that significantly reduces the number of write operations and thus supports efficient searches, insertions, and deletions. We verify the superiority of our method by performing extensive experiments.

Development of Delaunay Triangulation Algorithm Using Oct-subdivision in Three Dimensions (3차원 8분할 Delaunay 삼각화 알고리즘 개발)

  • Park S.H.;Lee S.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.3
    • /
    • pp.168-178
    • /
    • 2005
  • The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

Flow Visualization of Pulsatile Flow in a Branching Tube using the PIV System and Numerical Analysis (PIV와 수치해석을 이용한 분지관내 맥동유동의 가시화)

  • Roh, Hyung-Woon;Suh, Sang-Ho;Yoo, Sang-Sin
    • Proceedings of the KSME Conference
    • /
    • 2000.04b
    • /
    • pp.535-540
    • /
    • 2000
  • The objective of the present study is to visualize the pulsatile flow fields by using three-dimensional computer simulation and the PIV system. A closed flow loop system was built for the steady and unsteady experiments. The Harvard pulsatile pump was used to generate the pulsatile pressure and velocity waveforms. Conifer powder as the tracing particles was added to water to visualize the flow field. Two consecutive particle images were captured by a CCD camera for the image processing. The cross-correlation method in combination with the moving searching area algorithm was applied for the image processing of the flow visualization. The pulsatile flow fields were visualized effectively by the PIV system in conjunction with the applied algorithm. The range validation and the area interpolation methods were used to obtain the final velocity vectors with high accuracy. The finite volume predictions were used to analyze three-dimensional flow patterns in the bifurcation model. The results of the PIV experiment and the computer simulation are in good agreement and the results show the recirculation zones and formation of the paired secondary flow distal to the apex of the bifurcated model. The results also show that the branch flow is pushed strongly to the inner wall due to the inertial force effect and helical motions are generated as the flow proceeds toward the outer wall.

  • PDF

An Identification and Feature Search System for Scanned Comics (스캔 만화도서 식별 및 특징 검색 시스템)

  • Lee, Sang-Hoon;Choi, Nakyeon;Lee, Sanghoon
    • Journal of KIISE:Databases
    • /
    • v.41 no.4
    • /
    • pp.199-208
    • /
    • 2014
  • In this paper, we represent a system of identification and feature search for scanned comics in consideration of their content characteristics. For creating the feature of the scanned comics, we utilize a method of hierarchical symmetry fingerprinting. Proposed identification and search system is designed to give online service provider, such as Webhard, an immediate identification result under conditions of huge volume of the scanned comics. In simulation part, we analyze the robustness of the identification of the fingerprint to image modification such as rotation and translation. Also, we represent a structure of database for fast matching in feature point database, and compare search performance between other existing searching methods such as full-search and most significant feature search.

A Study on Efficient Split Algorithms for Single Moving Object Trajectory (단일 이동 객체 궤적에 대한 효율적인 분할 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.10
    • /
    • pp.2188-2194
    • /
    • 2011
  • With the development of wireless network technology, Storing the location information of a spatiotemporal object was very necessary. Each spatiotemporal object has many unnecessariness location information, hence it is inefficient to search all trajectory information of spatiotemporal objects. In this paper, we propose an efficient method which increase searching efficiency. Using EMBR(Extend Minimun Bounding Rectangle), an LinearMarge split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

The Endocardial Boundary Detection based on Statistical Charact'eristics of Echocardiographic Image (초음파 영상의 통계적 특성에 근거한 심내벽 윤곽선 검출)

  • Won, Chul-Ho;Kim, Myoung-Nam;Cho, Jin-Ho
    • Journal of Biomedical Engineering Research
    • /
    • v.17 no.3
    • /
    • pp.365-372
    • /
    • 1996
  • The researches to acquire diagnostic parameters from ultrasonic images are advanced with the progress of the digital image processing technique. Especially, the detection of endocardial boundary is very important in ultrasonic images, because endocardial boundary is used as a clinical parameter to estimate both the cardiac area and the variation of cardiac volume. Various methods to detect cardiac boundary are proposed, but these are insufficient to detect boundary. In this paper, an algorithm that detects the endocardial boundary, expanding the cavity region from the center using statistical information, is proposed The value of mean and sty:nd, wd deviation in cavity region is lower than those in muscle re- gion. Therefore, if we define the multiplication of mean and standard deviation as homogeneous coefficient, it can lead to conclusion that the pixels with small variation of these coefficleno are cavity region, and extraction of endocardial boundary from cavity region is possible. The proposed method detected endocardial boundary more effectively than edge based or threshold based method and is robuster to noise than radial searching method that has high dependency for center position.

  • PDF

A Study on the Development Strategy of Tianjin Bonded Port in China (천진보세항구의 발전방안에 관한 연구)

  • HAN, Jia-Wei;SHIN, Han-Won;SONG, Xiao-Ming
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.28 no.6
    • /
    • pp.1706-1714
    • /
    • 2016
  • In the 21th century, with the development of the economic global progress, the competition is more stiff. During the fierce competition, 85% of the world's trade volume is root from the sea transportation, that means the harbor trade is becoming an important part in the world's trade. With the strong support of the Chinese national ministries, Tianjin Dongjiang Bonded Port Area had made a series of encouraging results and now becoming a positive mode of the chinese harbor trade port. In the meanwhile, the Dongjiang Bonded Port Area is also searching for the change and a better development. From this year, the Dongjiang Bonded Port Area is apply for the experimental unit to change from the Bonded Port Area to the Free Trade Zone. This paper focus on the Tianjin Dongjiang Bonded Port Area which is the largest port area in the northern part of China. The development progress of the Dongjiang Bonded Port Area is concerned and studied in the paper. This paper expected to research on the transformation progress from the Bonded Port Area to the Free Trade Zone, to find out appropriate ways for the blossom of the harbor trade and the bonded area.

An Efficient Complex Event Processing Algorithm based on Multipattern Sharing for Massive Manufacturing Event Streams

  • Wang, Jianhua;Lan, Yubin;Lu, Shilei;Cheng, Lianglun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1385-1402
    • /
    • 2019
  • Quickly picking up some valuable information from massive manufacturing event stream usually faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of large volume, high velocity, many variety and small value. Aiming to solve the problem above for the current complex event processing methods because of not sharing detection during the detecting process for massive manufacturing event streams, an efficient complex event processing method based on multipattern sharing is presented in this paper. The achievement of this paper lies that a multipattern sharing technology is successfully used to realize the quick detection of complex event for massive manufacturing event streams. Specially, in our scheme, we firstly use pattern sharing technology to merge all the same prefix, suffix, or subpattern that existed in single pattern complex event detection models into a multiple pattern complex event detection model, then we use the new detection model to realize the quick detection for complex events from massive manufacturing event streams, as a result, our scheme can effectively solve the problems above by reducing lots of redundant building, storing, searching and calculating operations with pattern sharing technology. At the end of this paper, we use some simulation experiments to prove that our proposed multiple pattern processing scheme outperforms some general processing methods in current as a whole.