• Title/Summary/Keyword: Vector optimization

검색결과 471건 처리시간 0.023초

An Antenna Tracking Profile Design for Communication with a Ground station

  • Lee, Donghun;Lee, Kyung-Min;Rashed, Mohammed Irfan;Bang, Hyochoong
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제14권3호
    • /
    • pp.282-295
    • /
    • 2013
  • In order to communicate with a ground station, the tracking profile design problem for a directional antenna system is considered. Because the motions of the gimbal angles in the antenna system affect the image quality, the main object is to minimize the motion of the gimbal angles during the satellite's imaging phase. For this goal, parameter optimization problems in the imaging and maneuver phases are formulated separately in the body-frame, and solved sequentially. Also, several mechanical constraints, such as the limitation of the gimbal angle and rate, are considered in the problems. The tracking profiles of the gimbal angles in the maneuver phases are designed with N-th order polynomials, to continuously connect the tracking profiles between two imaging phases. The results confirm that if the vector trace of the desired antenna-pointing vector is within the antenna's beam-width angle, motions of the gimbal angles are not required in the corresponding imaging phase. Also, through numerical examples, it is shown that motion of the gimbal angles in the imaging phase can be minimized by the proposed design process.

모바일 GIS를 위한 벡터 데이터 경량화 기법 (The Optimization of Vector Data for Mobile GIS)

  • 윤근정;김혜영;전철민
    • Spatial Information Research
    • /
    • 제16권2호
    • /
    • pp.207-218
    • /
    • 2008
  • 기존의 유선 환경기반의 GIS 솔루션으로 무선 환경에서 서비스를 하기에는 제한된 통신 속도, 처리 속도, 화면 사이즈 등의 한계점이 존재한다. 본 연구에서는 이러한 제한된 특성들을 극복하기 위하여 모바일 환경에서의 벡터 데이터의 경량화 기법에 대하여 네 가지 단계로 제시하였다. 본 논문에서 제시한 방법을 검증하기 위하여 강남구 지역을 대상으로 실험을 실시하였다. 기존의 유선 환경에서 구축되어진 GIS 엔진과 본 논문에서 제시한 방법을 적용한 경량화된 GIS 엔진을 동일한 환경에서 성능 평가를 실시하였고 이에 따라 응답 데이터 크기, 초당 요청 처리 개수, 평균 요청 처리 시간을 비교 분석하였다. 그 결과 경량화가 적용된 GIS 엔진이 기존의 엔진과 비교하여 상당한 성능향상이 있었다는 것을 입증하였다.

  • PDF

기상 및 대기질 정보의 3차원 표출 최적화를 위한 시제품 개발 연구 (Prototype Development for Optimization Technique of 3D Visualization of Atmospheric Environmental Information)

  • 김건우;나하나;정우식
    • 한국환경과학회지
    • /
    • 제28권11호
    • /
    • pp.1047-1059
    • /
    • 2019
  • To address the increase of weather hazards and the emergence of new types of such hazards, an optimization technique for three-dimensional (3D) representation of meteorological facts and atmospheric information was examined in this study as a novel method for weather analysis. The proposed system is termed as "meteorological and air quality information visualization engine" (MAIVE), and it can support several file formats and can implement high-resolution 3D terrain by employing a 30 m resolution digital elevation model. In this study, latest 3D representation techniques such as wind vector fields, contour maps, stream vector, stream line flow along the wind field and 3D volume rendering were applied. Implementation of the examples demonstrates that the results of numerical modeling are well reflected, and new representation techniques can facilitate the observation of meteorological factors and atmospheric information from different perspectives.

Energy Efficient Cross Layer Multipath Routing for Image Delivery in Wireless Sensor Networks

  • Rao, Santhosha;Shama, Kumara;Rao, Pavan Kumar
    • Journal of Information Processing Systems
    • /
    • 제14권6호
    • /
    • pp.1347-1360
    • /
    • 2018
  • Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.

Optimal SVM learning method based on adaptive sparse sampling and granularity shift factor

  • Wen, Hui;Jia, Dongshun;Liu, Zhiqiang;Xu, Hang;Hao, Guangtao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1110-1127
    • /
    • 2022
  • To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

Improved marine predators algorithm for feature selection and SVM optimization

  • Jia, Heming;Sun, Kangjian;Li, Yao;Cao, Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1128-1145
    • /
    • 2022
  • Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

Analysis of dynamic performance of redundant manipulators using the concept of aspects

  • Chung, W.J.;Chung, W.K.;Youm, Y.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.1664-1670
    • /
    • 1991
  • For kinematically redundant manipulators, conventional dynamic control methods of local torque optimization showed the instability which resulted in physically unachievable torque requirements. In order to guarantee stability of the null space vector method which resolves redundancy at the acceleration level, Maciejewski[1] analyzed the kinetic behavior of homogeneous solution component and proposed the condition to identify regions of stability and instability for this method. 'In this paper, a modified null space vector method is first presented based on the Maciejewski's condition which is a function of a manipulator's configuration. Secondly, a new control method which is based on the concept of aspects is proposed. It was shown by computer simulations that the modified null space vector method and the proposed method have a common property that a preferred aspect is preserved during the execution of a task. It was also illustrated that both methods demonstrate a drastic reduction of torque loadings at the joints in the tracking motion of a long trajectory when compared with the null space vector method, and thus guarantee the stability of joint torque.

  • PDF

A Modified Approach to Density-Induced Support Vector Data Description

  • Park, Joo-Young;Kang, Dae-Sung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제7권1호
    • /
    • pp.1-6
    • /
    • 2007
  • The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

잡음이 존재하는 채널에서 이용되는 분류 벡터 양자화 코드북의 인덱스할당기법 (Optimization of CVQ codebook index for noisy channels)

  • 한종기;김진욱
    • 한국통신학회논문지
    • /
    • 제28권3C호
    • /
    • pp.315-326
    • /
    • 2003
  • 본 논문은 분류 벡터 양자화(CVQ)기법을 이용한 통신 시스템에서 채널 오류를 감소시키기 위한 인덱스벡터할당 방식을 다루고 있다. 제안된 시스템은 크게 내부 인덱스 할당방식(IIA inner index assignment)과 교차인덱스 할당방식(CIA : cross index assignment)으로 구성된다. IIA는 부(Sub)코드북 내에서 유사한 코드벡터들에 Hamming거리가 가까운 인덱스들을 할당함으로써 채널에러에 의해 발생된 화질저하를 감소시킨다. CIA는 인덱스 벡터의 클래스 정보를 나타내는 클래스 비트에 발생하는 채널 오류의 영향을 최소화할 수 있는 방법으로서 IIA에 의해 할당된 인덱스 벡터들을 수정한다. 본 논문에서 실시된 컴퓨터 모의실험은 제안된 시스템이 채널 부호화기법을 사용하지 않고도 채널 잡음을 극복할 수 있음을 보여준다.

Imbalanced SVM-Based Anomaly Detection Algorithm for Imbalanced Training Datasets

  • Wang, GuiPing;Yang, JianXi;Li, Ren
    • ETRI Journal
    • /
    • 제39권5호
    • /
    • pp.621-631
    • /
    • 2017
  • Abnormal samples are usually difficult to obtain in production systems, resulting in imbalanced training sample sets. Namely, the number of positive samples is far less than the number of negative samples. Traditional Support Vector Machine (SVM)-based anomaly detection algorithms perform poorly for highly imbalanced datasets: the learned classification hyperplane skews toward the positive samples, resulting in a high false-negative rate. This article proposes a new imbalanced SVM (termed ImSVM)-based anomaly detection algorithm, which assigns a different weight for each positive support vector in the decision function. ImSVM adjusts the learned classification hyperplane to make the decision function achieve a maximum GMean measure value on the dataset. The above problem is converted into an unconstrained optimization problem to search the optimal weight vector. Experiments are carried out on both Cloud datasets and Knowledge Discovery and Data Mining datasets to evaluate ImSVM. Highly imbalanced training sample sets are constructed. The experimental results show that ImSVM outperforms over-sampling techniques and several existing imbalanced SVM-based techniques.