• Title/Summary/Keyword: M-algorithm

Search Result 3,951, Processing Time 0.037 seconds

A Study on the Development of Dynamic Models under Inter Port Competition (항만의 경쟁상황을 고려한 동적모형 개발에 관한 연구)

  • 여기태;이철영
    • Journal of the Korean Institute of Navigation
    • /
    • v.23 no.1
    • /
    • pp.75-84
    • /
    • 1999
  • Although many studies on modelling of port competitive situation have been conducted, both theoretical frame and methodology are still very weak. In this study, therefore, a new algorithm called ESD (Extensional System Dynamics) for the evaluation of port competition was presented, and applied to simulate port systems in northeast asia. The detailed objectives of this paper are to develop Unit fort Model by using SD(System Dynamics) method; to develop Competitive Port Model by ESD method; to perform sensitivity analysis by altering parameters, and to propose port development strategies. For these the algorithm for the evaluation of part's competition was developed in two steps. Firstly, SD method was adopted to develop the Unit Port models, and secondly HFP(Hierarchical Fuzzy Process) method was introduced to expand previous SD method. The proposed models were then developed and applied to the five ports - Pusan, Kobe, Yokohama, Kaoshiung, Keelung - with real data on each ports, and several findings were derived. Firstly, the extraction of factors for Unit Port was accomplished by consultation of experts such as research worker, professor, research fellows related to harbor, and expert group, and finally, five factor groups - location, facility, service, cargo volumes, and port charge - were obtained. Secondly, system's structure consisting of feedback loop was found easily by location of representative and detailed factors on keyword network of STGB map. Using these keyword network, feedback loop was found. Thirdly, for the target year of 2003, the simulation for Pusan port revealed that liner's number would be increased from 829 ships to 1,450 ships and container cargo volumes increased from 4.56 million TEU to 7.74 million TEU. It also revealed that because of increased liners and container cargo volumes, length of berth should be expanded from 2,162m to 4,729m. This berth expansion was resulted in the decrease of congested ship's number from 97 to 11. It was also found that port's charge had a fluctuation. Results of simulation for Kobe, Yokohama, Kaoshiung, Keelung in northeast asia were also acquired. Finally, the inter port competition models developed by ESB method were used to simulate container cargo volumes for Pusan port. The results revealed that under competitive situation container cargo volume was smaller than non-competitive situation, which means Pusan port is lack of competitive power to other ports. Developed models in this study were then applied to estimate change of container cargo volumes in competitive relation by altering several parameters. And, the results were found to be very helpful for port mangers who are in charge of planning of port development.

  • PDF

A Study on the Methodology of Extracting the vulnerable districts of the Aged Welfare Using Artificial Intelligence and Geospatial Information (인공지능과 국토정보를 활용한 노인복지 취약지구 추출방법에 관한 연구)

  • Park, Jiman;Cho, Duyeong;Lee, Sangseon;Lee, Minseob;Nam, Hansik;Yang, Hyerim
    • Journal of Cadastre & Land InformatiX
    • /
    • v.48 no.1
    • /
    • pp.169-186
    • /
    • 2018
  • The social influence of the elderly population will accelerate in a rapidly aging society. The purpose of this study is to establish a methodology for extracting vulnerable districts of the welfare of the aged through machine learning(ML), artificial neural network(ANN) and geospatial analysis. In order to establish the direction of analysis, this progressed after an interview with volunteers who over 65-year old people, public officer and the manager of the aged welfare facility. The indicators are the geographic distance capacity, elderly welfare enjoyment, officially assessed land price and mobile communication based on old people activities where 500 m vector areal unit within 15 minutes in Yongin-city, Gyeonggi-do. As a result, the prediction accuracy of 83.2% in the support vector machine(SVM) of ML using the RBF kernel algorithm was obtained in simulation. Furthermore, the correlation result(0.63) was derived from ANN using backpropagation algorithm. A geographically weighted regression(GWR) was also performed to analyze spatial autocorrelation within variables. As a result of this analysis, the coefficient of determination was 70.1%, which showed good explanatory power. Moran's I and Getis-Ord Gi coefficients are analyzed to investigate spatially outlier as well as distribution patterns. This study can be used to solve the welfare imbalance of the aged considering the local conditions of the government recently.

Reverse Baby-step 2k-ary Adult-step Method for 𝜙((n) Decryption of Asymmetric-key RSA (비대칭키 RSA의 𝜙(n) 해독을 위한 역 아기걸음- 2k-ary 성인걸음법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.25-31
    • /
    • 2014
  • When the public key e and the composite number n=pq are disclosed but not the private key d in an asymmetric-key RSA, message decryption is carried out by obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and subsequently computing $d=e^{-1}(mod{\phi}(n))$. The most commonly used decryption algorithm is integer factorization of n/p=q or $a^2{\equiv}b^2$(mod n), a=(p+q)/2, b=(q-p)/2. But many of the RSA numbers remain unfactorable. This paper therefore applies baby-step giant-step discrete logarithm and $2^k$-ary modular exponentiation to directly obtain ${\phi}(n)$. The proposed algorithm performs a reverse baby-step and $2^k$-ary adult-step. As a results, it reduces the execution time of basic adult-step to $1/2^k$ times and the memory $m={\lceil}\sqrt{n}{\rceil}$ to l, $a^l$ > n, hence obtaining ${\phi}(n)$ by executing within l times.

An Improved Search Space for QRM-MLD Signal Detection for Spatially Multiplexed MIMO Systems (공간다중화 MIMO 시스템의 QRM-MLD 신호검출을 위한 개선된 탐색공간)

  • Hur, Hoon;Woo, Hyun-Myung;Yang, Won-Young;Bahng, Seung-Jae;Park, Youn-Ok;Kim, Jae-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.403-410
    • /
    • 2008
  • In this paper, we propose a variant of the QRM-MLD signal detection method that is used for spatially multiplexed multiple antenna system. The original QRM-MLD signal detection method combines the QR decomposition with the M-algorithm, thereby significantly reduces the prohibitive hardware complexity of the ML signal detection method, still achieving a near ML performance. When the number of transmitter antennas and/or constellation size are increased to achieve higher bit rate, however, its increased complexity makes the hardware implementation challenging. In an effort to overcome this drawback of the original QRM-MLD, a number of variants were proposed. A most strong variant among them, in our opinion, is the ranking method, in which the constellation points are ranked and computation is performed for only highly ranked constellation points, thereby reducing the required complexity. However, the variant using the ranking method experiences a significant performance degradation, when compared with the original QRM-MLD. In this paper, we point out the reasons of the performance degradation, and we propose a novel variant that overcomes the drawbacks. We perform a set of computer simulations to show that the proposed method achieves a near performance of the original QRM-MLD, while its computational complexity is near to that of the QRM-MLD with ranking method.

Area-efficient Interpolation Architecture for Soft-Decision List Decoding of Reed-Solomon Codes (연판정 Reed-Solomon 리스트 디코딩을 위한 저복잡도 Interpolation 구조)

  • Lee, Sungman;Park, Taegeun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.59-67
    • /
    • 2013
  • Reed-Solomon (RS) codes are powerful error-correcting codes used in diverse applications. Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The algorithm requires very intensive computations for interpolation, therefore an efficient VLSI architecture, which is realizable in hardware with a moderate hardware complexity, is mandatory for various applications. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list decoding of Reed-Solomon codes. The proposed architecture processes the candidate polynomial in such a way that the terms of X degrees are processed in serial and the terms of Y degrees are processed in parallel. The processing order of candidate polynomials adaptively changes to increase the efficiency of memory access for coefficients; this minimizes the internal registers and the number of memory accesses and simplifies the memory structure by combining and storing data in memory. Also, the proposed architecture shows high hardware efficiency, since each module is balanced in terms of latency and the modules are maximally overlapped in schedule. The proposed interpolation architecture for the (255, 239) RS list decoder is designed and synthesized using the DongbuHitek $0.18{\mu}m$ standard cell library, the number of gate counts is 25.1K and the maximum operating frequency is 200 MHz.

Modification of Cutoff Values for HE4, CA125, the Risk of Malignancy Index, and the Risk of Malignancy Algorithm for Ovarian Cancer Detection in Jakarta, Indonesia

  • Winarto, Hariyono;Laihad, Bismarck Joel;Nuranna, Laila
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.5
    • /
    • pp.1949-1953
    • /
    • 2014
  • Background: CA125 and HE4 are used in calculating Risk of Malignancy Algorithm (ROMA); and Risk of Malignancy Index (RMI). However, studies showed that normal levels of CA125, and HE4 differ among ethnicities such as between Asians and Caucasians, thus affecting the accuracy of the RMI score and ROMA in predicting ovarian malignancy. This study aimed to determine whether new or modified cutoff values for Ca125, HE4, the RMI score, and ROMA resulted in a better prediction of malignancy compared with the previous or standard ones. Materials and Methods: Serum level of CA125 and HE4 from 128 patients with diagnosis of ovarian tumor that had been collected before surgery at Cipto Mangunkusumo General Hospital (CMH) in Jakarta from November 2010 until May 2011 were reviewed and analysed. The standard cutoff values of these biomarkers, RMI, and ROMA were modified by using logistic regression model. The modified cutoff values were compared to the standard cutoff values in terms of sensitivity, specificity, and accuracy. Results: The modified cutoff value of CA125, HE4, RMI score and ROMA were 165.2 U/mL, 103.4 pM, 368.7, 28/54. The sensitivity and specificity of the modified cutoff values CA125, HE 4, RMI score and ROMA in differentiating benign from malignant and borderline were 67% and 75,4%; 73.1% and 85.2%; 73.1% and 80.3%; and 77.6% and 86.9%. While the sensitivity and specificity of the standard cutoff value of CA125; HE4; RMI score; and ROMA were 91% and 24.6%; 83.6% and 65%; 80.6% and 65.6%; and 91.0% and 42.6%. The accuracy of modified cutoff values compared with standard cutoff values were: 71.2% vs 59.3%, 78.9% vs 75% vs, 76.5% vs 73.4%, and 82% vs 67.9%. Conclusions: The new or modified cutoff values of Ca125, HE4, RMI score and ROMA resulted in higher accuracy compared to the previous or standard ones, at the cost of reduced sensitivity.

REAL - TIME ORBIT DETERMINATION OF LOW EARTH ORBIT SATELLITES USING RADAR SYSTEM AND SGP4 MODEL (RADAR 시스템과 SGP4 모델을 이용한 저궤도 위성의 실시간 궤도결정)

  • 이재광;이성섭;윤재철;최규홍
    • Journal of Astronomy and Space Sciences
    • /
    • v.20 no.1
    • /
    • pp.21-28
    • /
    • 2003
  • In case that we independently obtain orbital informations about the low earth satellites of foreign countries using radar systems, we develop the orbit determination algorithm for this purpose using a SGP4 model with an analytical orbit model and the extended Kalman filter with a real-time processing method. When the state vector is Keplerian orbital elements, singularity problems happen to compute partial derivative with respect to inclination and eccentricity orbit elements. To cope with this problem, we set state vector osculating to mean equinox and true equator cartesian elements with coordinate transformation. The state transition matrix and the covariance matrix are numerically computed using a SGP4 model. Observational measurements are the type of azimuth, elevation and range, filter process to each measurement in a lump. After analyzing performance of the developed orbit determination algorithm using TOPEX/POSEIDON POE(precision 0.bit Ephemeris), its position error has about 1 km. To be similar to performance of NORAD system that has up to 3km position accuracy during 7 days need to radar system performance that have accuracy within 0.1 degree for azimuth and elevation and 50m for range.

On the Design of Multi-layered Polygonal Helix Antennas (다각 다단 구조 헬릭스 안테나 설계)

  • Choo Jae-Yul;Choo Ho-Sung;Park Ik-Mo;Oh Yi-Sok
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.3 s.106
    • /
    • pp.249-258
    • /
    • 2006
  • In this letter, we propose a novel printed helix antenna for RFID reader in UHF band. The printed strip line of the antenna is first wound up outside a polygonal shaped layer and then the winding continues on an inner layer to control the overall gain and the radiation pattern. In addition, the winding pitch angles on each layer have either negative or positive values resulting in the broad CP bandwidth. The detail structure of the antenna was optimized using Pareto genetic algorithm(GA), so as to obtain excellent performances for RFID reader antennas. The optimized two-layered polygonal helix was fabricated on the cardboard of a flexible substrate and the performances were measured and compared with the simulations. The fabricated antenna was made up of copper tape which can adhere to a flexible cardboard and had 21.4 % matching bandwidth, 31.9 % CP bandwidth, readable range of $5.5m^2$ with kr=3.2. Also based on the current distribution of the strip line of the antenna and sensitivity of the antenna bents points, we confirmed that the antenna has the quarter-wave transformer near the feed for the broad matching bandwidth and radiates the traveling wave for the broad CP bandwidth using the bent strip line.

Joint Electromagnetic Inversion with Structure Constraints Using Full-waveform Inversion Result (완전파형역산결과를 구조적 제약 조건으로 이용한 고해상도 전자탐사 복합역산 알고리듬 개발)

  • Jeong, Soocheol;Seol, Soon Jee;Byun, Joongmoo
    • Geophysics and Geophysical Exploration
    • /
    • v.17 no.4
    • /
    • pp.187-201
    • /
    • 2014
  • Compared with the separated inversion of electromagnetic (EM) and seismic data, a joint inversion using both EM and seismic data reduces the uncertainty and gives the opportunity to use the advantage of each data. Seismic fullwaveform inversion allows velocity information with high resolution in complicated subsurface. However, it is an indirect survey which finds the structure containing oil and gas. On the other hand, marine controlled-source EM (mCSEM) inversion can directly indicate the oil and gas using different EM properties of hydrocarbon with marine sediments and cap rocks whereas it has poor resolution than seismic method. In this paper, we have developed a joint EM inversion algorithm using a cross-gradient technique. P-wave velocity structure obtained by full-waveform inversion using plane wave encoding is used as structure constraints to calculate the cross-gradient term in the joint inversion. When the jointinversion algorithm is applied to the synthetic data which are simulated for subsea reservoir exploration, images have been significantly improved over those obtained from separate EM inversion. The results indicate that the developed joint inversion scheme can be applied for detecting reservoir and calculating the accurate oil and gas reserves.

Development of Automatized Quantitative Analysis Method in CT Images Evaluation using AAPM Phantom (AAPM Phantom을 이용한 CT 영상 평가 시 자동화된 정량적 분석 방법 개발)

  • Noh, Sung Sun;Um, Hyo Sik;Kim, Ho Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.12
    • /
    • pp.163-173
    • /
    • 2014
  • When evaluating the spatial resolution images and evaluation of low contrast resolution using CT standard phantom, and might present a automated quantitative evaluation method for minimizing errors by subjective judgment of the evaluator be, and try to evaluate the usefulness. 120kVp and 250mAs, 10mm collimation, SFOV(scan field of view) of 25cm or more than, exposure conditions DFOV(display field of view) of 25cm, and were evaluated the 24 passing images and 20 failing images taken using a standard reconstruction algorithm by using the Nuclear Associates, Inc. AAPM CT Performance Phantom(Model 76-410). Quantitative evaluation of low contrast resolution and spatial resolution was using an evaluation program that was self-developed using the company Mathwork Matlab(Ver. 7.6. (R2008a)) software. In this study, the results were evaluated using the evaluation program that was self-developed in the evaluation of images using CT standard phantom, it was possible to evaluate an objective numerical qualitative evaluation item. First, if the contrast resolution, if EI is 0.50, 0.51, 0.52, 0.53, as a result of evaluating quantitatively the results were evaluated qualitatively match. Second, if CNR is -0.0018~-0.0010, as a result of evaluating quantitatively the results were evaluated qualitatively match. Third, if the spatial resolution, as a result of using a image segmentation technique, and automatically extract the contour boundary of the hole, as a result of evaluating quantitatively the results were evaluated qualitatively match.