• Title/Summary/Keyword: 유연한 알고리즘

Search Result 444, Processing Time 0.03 seconds

Highly-reliable Multi-path Protocol by MANET (MANET에 의한 신뢰성 높은 다중 경로 프로토콜)

  • Lee, Yang-Min;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.352-362
    • /
    • 2008
  • In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

A Study on the Internet GPS Data Processing System (인터넷 GPS 자료처리 시스템에 관한 연구)

  • 윤희천;최병길;이용욱
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.22 no.2
    • /
    • pp.145-150
    • /
    • 2004
  • A protocol for the web-based GPS data processing system has been developed. The system is developed following the typical ASP system, in which the GPS data acquired by various users can be uploaded through the web and the data is processed with data processing components selected by the users. After the processing, the results are also transported to the users through the web. The developed system is designed for easy software upgrade and it is an synchronous process mode so that the multiple accesses can be handled with high user flexibility. The database components for the efficient GPS data maintenance are developed so that the data from CORS can be used for the data processing. Currently, the absolute and relative positioning algorithms using code measurements are integrated and much more algorithms such as the data quality control, absolute and relative positioning using phases will be integrated in near future.

A study of Web-Based GPS Data Processing System (웹 기반 GPS 자료처리 시스템 개발에 관한 연구)

  • 최우영;권재현;염재홍;이용욱
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.04a
    • /
    • pp.81-92
    • /
    • 2003
  • A protocol for the web-based GPS data processing system has been developed. The system is developed following the typical ASP system, in which the GPS data acquired by various users can be uploaded through the web and the data is processed with data processing components selected by the users. After the processing, the results are also transported to the users through the web. The developed system is designed for easy software upgrade and it is an asynchronous process mode so that the multiple accesses can be handled with high user flexibility. The database components for the efficient GPS data maintenance are developed so that the data from CORS can be used for the data processing. Currently, the absolute and relative positioning algorithms using code measurements are integrated and much more algorithms such as the data quality control, absolute and relative positioning using phases will be integrated in near future.

  • PDF

An Improved Genetic Algorithm for Integrated Planning and Scheduling Algorithm Considering Tool Flexibility and Tool Constraints (공구유연성과 공구관련제약을 고려한 통합공정일정계획을 위한 유전알고리즘)

  • Kim, Young-Nam;Ha, Chunghun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.2
    • /
    • pp.111-120
    • /
    • 2017
  • This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

Bit-Parallel Systolic Divider in Finite Field GF(2m) (유한 필드 GF(2m)상의 비트-패러럴 시스톨릭 나눗셈기)

  • 김창훈;김종진;안병규;홍춘표
    • The KIPS Transactions:PartA
    • /
    • v.11A no.2
    • /
    • pp.109-114
    • /
    • 2004
  • This paper presents a high-speed bit-parallel systolic divider for computing modular division A($\chi$)/B($\chi$) mod G($\chi$) in finite fields GF$(2^m)$. The presented divider is based on the binary GCD algorithm and verified through FPGA implementation. The proposed architecture produces division results at a rate of one every 1 clock cycles after an initial delay of 5m-2. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. In addition, since the proposed architecture does not restrict the choice of irreducible polynomials and has regularity and modularity, it provides a high flexibility and Scalability with respect to the field size m. Therefore, the proposed divider is well suited to VLSI implementation.

Dynamic Channel Allocation Algorithm for Co-channel Interference Avoidance in Multi-cell OFDMA Systems (OFDMA 다중 셀 환경에서 동일 채널 간섭을 피하기 위한 동적 자원 할당 알고리즘)

  • Lee, Je-Min;Seo, Woo-Hyun;Wang, Hano;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.92-98
    • /
    • 2007
  • We propose the schemes for the dynamic channel allocation (DCA) in multi-cell OFDMA systems to avoid co-channel interference (CCI) without the additional complexity. The allocatable subcarriers areas, which is designed to avoid CCI among cells, are determined for each cell. Each cell allocates the subcarriers within the allocatable subcarriers area of the cell independently. We consider the trade off between the reduced frequency selection diversity and the amount of CCI on a subcarrier by the determination of allocatable subcarriers area. Hence, the equal allocation bound scheme for the high selectivity channel and the flexible allocation bound scheme for the low selectivity channel are proposed. Through the numerical results, it is confirmed that the proposed schemes have better performance in the aspects of the number of overlapping allocated subcarriers, the capacity and the outage probability compared to the case which does not determined the allocatable subcarriers area.

Modeling and Vibration Control of Hull Structure Using Piezoelectric Composite Actuators (압전복합재 작동기를 이용한 Hull 구조물의 모델링 및 진동제어)

  • Kim, Heung-Soo;Sohn, Jung-Woo;Choi, Seung-Bok
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.23 no.1
    • /
    • pp.9-15
    • /
    • 2010
  • In this paper, dynamic modeling of hull structure including surface-bonded piezoelectric composite actuator was developed and structural vibration control performance was evaluated. Cylindrical shell structure with end-caps was considered as a host structure which could be used as a simple model of fuselage of aircraft and underwater vehicles. An advanced piezoelectric composite, macro-fiber composite(MFC), which has been developed in NASA Langley Research Center was applied for the effective structural vibration control. MFC has great flexibility by using piezoceramic fiber sheet and enhanced piezoelectric effect for in-plane motion by utilizing interdigitated electrode. Governing Equations were derived from the finite element model and modal characteristics were investigated. Modal test was conducted to verify the finite element model. Optimal controller was designed and implemented for the evaluation of vibration control performance. Structural vibration was controlled effectively by applying proper control input to the piezoelectric actuators.

A Clustering Technique using Common Structures of XML Documents (XML 문서의 공통 구조를 이용한 클러스터링 기법)

  • Hwang, Jeong-Hee;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.6
    • /
    • pp.650-661
    • /
    • 2005
  • As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.

A Study on Face Recognition using Neural Networks and Characteristics Extraction based on Differential Image and DCT (차영상과 DCT 기반 특징 추출과 신경망을 이용한 얼굴 인식에 관한 연구)

  • 임춘환;고낙용;박종안
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1549-1557
    • /
    • 1999
  • In this paper, we propose a face recognition algorithm based on the differential image method-DCT This algorithm uses neural networks which is flexible for noise. Using the same condition (same luminous intensity and same distance from the fixed CCD camera to human face), we have captured two images. One doesn't contain human face. The other contains human face. Differential image method is used to separate the second image into face region and background region. After that, we have extracted square area from the face region, which is based on the edge distribution. This square region is used as the characteristics region of human face. It contains the eye bows, the eyes, the nose, and the mouth. After executing DCT for this square region, we have extracted the feature vectors. The feature vectors were normalized and used as the input vectors of the neural network. Simulation results show 100% recognition rate when face images were learned and 92.25% recognition rate when face images weren't learned for 30 persons.

  • PDF

The Strain Corrections for Accuracy Improvement to Predict Large Deformation of Wings (날개 대변형 예측의 정확성 향상을 위한 변형률 보정)

  • Lee, Hansol;Kim, In-Gul;Park, Sunghyun;Kim, Min-Sung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.1
    • /
    • pp.1-11
    • /
    • 2016
  • The information about the deformations of high-aspect-ratio wings is needed for the real-time monitoring of structural responses. Wing deformation in flight can be predicted by using relationship between the curvatures and the strains on the wing skin. It is also necessary to consider geometric nonlinearity when the large deformation of wing is occurred. The strain distribution on fixed-end is complex in the chordwise direction because of the geometric shape of fixed-wings on fuselages. Hence, the wing displacement can be diversely predicted by the location of the strain sensing lines in the chordwise direction. We conducted a study about prediction method of displacements regardless of the chordwise strain sensing locations. To correct spanwise strains, the ratio of spanwise strain to chordwise strain, Poisson's ratio, and the ratio of the plate strain to the beam strain were used. The predicted displacements using the strain correction were consistent with those calculated by the FEA and verified through the bending testing.