• 제목/요약/키워드: practical transformation algorithm

Search Result 22, Processing Time 0.017 seconds

Practical Algorithms on Lunar Reference Frame Transformations for Korea Pathfinder Lunar Orbiter Flight Operation

  • Song, Young-Joo;Lee, Donghun;Kim, Young-Rok;Bae, Jonghee;Park, Jae-ik;Hong, SeungBum;Kim, Dae-Kwan;Lee, Sang-Ryool
    • Journal of Astronomy and Space Sciences
    • /
    • v.38 no.3
    • /
    • pp.185-192
    • /
    • 2021
  • This technical paper deals the practical transformation algorithms between several lunar reference frames which will be used for Korea pathfinder lunar orbiter (KPLO) flight operation. Despite of various lunar reference frame definitions already exist, use of a common transformation algorithm while establishing lunar reference frame is very important for all members related to KPLO mission. This is because use of slight different parameters during frame transformation may result significant misleading while reprocessing data based on KPLO flight dynamics. Therefore, details of practical transformation algorithms for the KPLO mission specific lunar reference frames is presented with step by step implementation procedures. Examples of transformation results are also presented to support KPLO flight dynamics data user community which is expected to give practical guidelines while post processing the data as their needs. With this technical paper, common understandings of reference frames that will be used throughout not only the KPLO flight operation but also science data reprocessing can be established. It is expected to eliminate, or at least minimize, unnecessary confusion among all of the KPLO mission members including: Korea Aerospace Research Institute (KARI), National Aeronautics and Space Administration (NASA) as well as other organizations participating in KPLO payload development and operation, or further lunar science community world-wide who are interested in KPLO science data post processing.

Design of robust servo systems and application to control of training simulator for radio-controlled helicopter (강인한 서보계설계와 R/C헬리콥터 트레이닝 시뮬레이터 제어에의 응용)

  • 김상봉;박순실
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.15 no.2
    • /
    • pp.497-506
    • /
    • 1991
  • In this paper, a new construction for training simulator of R/C helicopter based on two types of servo controller is proposed. Two modified algorithms (algorithm I and II) for servo controller design are presented. Algorithm I is developed by adopting Davison's method in the case that the expressions for the homogeneous differential equations of reference input and disturbance are different types, and algorithm II is done by considering error weighting function for the servo controller of algorithm I . The linear fractional transformation method is incorporated in both design methods in order to assign the closed loop poles of the servo system in a specified region. The helicopter simulator is composed by the gimbals with two freedom of rolling and pitching. The reliability and validity for the design methods of the proposed servo controller are investigated through the practical experiment for the simulator by using 16bits micro-computer with A/D and D/A converters. It can be observered from the experimental results that the proposed servo controller is applicable to practical plants since the simulator is robust for the arbitrary disturbance and it follows to the given reference input without significant steady state error.

LOLE(Loss of Load Expctatiom) Evaluation using Fuzzy Set Theory (퍼지 집합 이론을 이용한 공급지장 기대치의 산정)

  • 심재홍;정현수;김진오
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.9
    • /
    • pp.1055-1063
    • /
    • 1999
  • This paper present a conceptual possibilistic approach using fuzzy set theory to manage the uncertainties in the given reliability input date of the practical power system. In this paper, an algorithm is introduced to calculate the possibilstic reliability indices according to the degree of uncertainty in the given data. The probability distribution function can be transformed into an appropriate possibilstic representation using the probability-Possibility Consistency principle(PPCP) algorithm. In this the algorithm, the transformation is performation by making a compromise between the transformation consistency and the human updating experience. Fuzzy classifcation theory is applied to reduced the number of load data. The fuzzy classification method determines the closeness of load data points by assigning them to various clusters and then determening the distance between the clusters. The IEEE-RTS with 32-generating units is used to demonstrate the capability of the proposed algorithm.

  • PDF

An Improved Remote Sensing Image Fusion Algorithm Based on IHS Transformation

  • Deng, Chao;Wang, Zhi-heng;Li, Xing-wang;Li, Hui-na;Cavalcante, Charles Casimiro
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1633-1649
    • /
    • 2017
  • In remote sensing image processing, the traditional fusion algorithm is based on the Intensity-Hue-Saturation (IHS) transformation. This method does not take into account the texture or spectrum information, spatial resolution and statistical information of the photos adequately, which leads to spectrum distortion of the image. Although traditional solutions in such application combine manifold methods, the fusion procedure is rather complicated and not suitable for practical operation. In this paper, an improved IHS transformation fusion algorithm based on the local variance weighting scheme is proposed for remote sensing images. In our proposal, firstly, the local variance of the SPOT (which comes from French "Systeme Probatoire d'Observation dela Tarre" and means "earth observing system") image is calculated by using different sliding windows. The optimal window size is then selected with the images being normalized with the optimal window local variance. Secondly, the power exponent is chosen as the mapping function, and the local variance is used to obtain the weight of the I component and match SPOT images. Then we obtain the I' component with the weight, the I component and the matched SPOT images. Finally, the final fusion image is obtained by the inverse Intensity-Hue-Saturation transformation of the I', H and S components. The proposed algorithm has been tested and compared with some other image fusion methods well known in the literature. Simulation result indicates that the proposed algorithm could obtain a superior fused image based on quantitative fusion evaluation indices.

A Practical Synthesis Technique for Optimal Arithmetic Hardware based on Carry-Save-Adders (캐리-세이브 가산기에 기초한 연산 하드웨어 최적화를 위한 실질적 합성 기법)

  • Kim, Tae-Hwan;Eom, Jun-Hyeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.10
    • /
    • pp.520-529
    • /
    • 2001
  • Carry-save-adder(CSA) is one of the most effective operation cells in implementing an arithmetic hardware with high performace and small circuit area. An fundamental drawback of the existing CAS applications is that the applications are limited to the local parts of arithmetic circuit that are directly converted to additions. To resolve the limitation, we propose a set of new CSA transformation techniques: optimizing arithmetics with multiplexors, optimizing arithmetics in multiple designs, and optimizing arithmetics with multiplications. We then design a new CSA transformation algorithm which integrates the proposed techniques, so that we are able to utilize CSAs more globally. An extensive experimentation for practical designs are provided to show the effectiveness of our proposed algorithm over the conventional CSA techniques.

  • PDF

On the Development of Lofts for Doubly Curved Sheet Metal Components

  • Prasad, K.S.R.K.;Selvaraj, P.;Ayachit, Praveen V.;Nagamani, B.V.
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.199-211
    • /
    • 2006
  • Practical automated flat pattern generation with inbuilt production features for doubly curved sheet metal components (SMCs) is addressed here utilizing a new and unique Point Transformation Algorithm (PTA). This is the third in the series of papers on practical Flat Pattern Development (FPD) [8] and Production Loft Generation Systems (PLGS) [9] complementing the pioneering work [6,7]. In the first two publications, automated loft generation programs have addressed sheet metal components having a Principal Flat Surface (PFS) only. The flat pattern development of 3-D components that do not have the flat surface(termed as Non-PFS components) having complex features of double curvature in addition to cutouts and nibbled holes typical of aircraft components were so far not addressed due to lack of relevant published algorithms. This paper traces the evolution of developments and provides the record of fully illustrated, automated loft generation scheme for aircraft SMCs including the Non-PFS components which underwent validation through production tests by sponsors. Details of some of the unique features of the system like simplified surface model generation, termed as topological model and powerful algorithms deployed with potential for CAD/CAM applications are included.

MDS code Creation Confirmation Algorithms in Permutation Layer of a Block Cipher (블록 암호에서 교환 계층의 MDS 코드 생성 확인 알고리즘)

  • 박창수;조경연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1462-1470
    • /
    • 2003
  • According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

An Ensemble Classifier using Two Dimensional LDA

  • Park, Cheong-Hee
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.817-824
    • /
    • 2010
  • Linear Discriminant Analysis (LDA) has been successfully applied for dimension reduction in face recognition. However, LDA requires the transformation of a face image to a one-dimensional vector and this process can cause the correlation information among neighboring pixels to be disregarded. On the other hand, 2D-LDA uses 2D images directly without a transformation process and it has been shown to be superior to the traditional LDA. Nevertheless, there are some problems in 2D-LDA. First, it is difficult to determine the optimal number of feature vectors in a reduced dimensional space. Second, the size of rectangular windows used in 2D-LDA makes strong impacts on classification accuracies but there is no reliable way to determine an optimal window size. In this paper, we propose a new algorithm to overcome those problems in 2D-LDA. We adopt an ensemble approach which combines several classifiers obtained by utilizing various window sizes. And a practical method to determine the number of feature vectors is also presented. Experimental results demonstrate that the proposed method can overcome the difficulties with choosing an optimal window size and the number of feature vectors.

UML Class Diagram for XDR Schema (XDR 스키마를 위한 UML 클래스 다이어그램)

  • Yoo Moon-sung
    • Journal of Internet Computing and Services
    • /
    • v.4 no.4
    • /
    • pp.35-44
    • /
    • 2003
  • XML becomes the standard for exchanging documents and data on the Web. Schema is used to define XML documents. Among schema, XDR schema, developed chiefly by Microsoft, is a leading schema for practical use. UML is a notation in object-oriented software development and a useful tool to represent the structure of a system. In this paper, we study the transformation method and algorithm from XDR schema to UML diagram. By this transformation, the structure of XDR schema is represented graphically. Thus we can easily understand the structure of XDR schema and we can create XML documents effectively by enhancing reusability and flexibility.

  • PDF

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.