• Title/Summary/Keyword: vector optimization

Search Result 473, Processing Time 0.025 seconds

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
    • /
    • v.14 no.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.

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

  • Youn, Geun-Jung;Kim, Hye-Young;Jun, Chul-Min
    • Spatial Information Research
    • /
    • v.16 no.2
    • /
    • pp.207-218
    • /
    • 2008
  • Providing services in a wireless environment with existing wired-based GIS solutions have many limitations such as slow communication, processing rates and screen size. This study suggested data optimization techniques in a mobile environment to overcome those limitations in four steps. In order to test the methods suggested in the study, experiments are conducted using Gangnam-gu as a test site. An existing GIS engine built in a wired environment was compared with the optimized GIS engine from the study in terms of performance in the same environment. They were also compared and analyzed in terms of response data size, number of requests processed per second, and average time to process a request. The results proved that the proposed engine shows significant improvements in performance compared with the wired GIS.

  • PDF

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

  • Kim, Gunwoo;Na, Hana;Jung, Woo-Sik
    • Journal of Environmental Science International
    • /
    • v.28 no.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
    • /
    • v.14 no.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)
    • /
    • v.16 no.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)
    • /
    • v.16 no.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.10b
    • /
    • 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
    • /
    • v.7 no.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 (잡음이 존재하는 채널에서 이용되는 분류 벡터 양자화 코드북의 인덱스할당기법)

  • 한종기;김진욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.315-326
    • /
    • 2003
  • Abstract In this paper, an improved index assignment procedure is proposed to reduce the channel error effect in a communication system employing classified vector quantization(CVQ). The proposed algorithm consists of two parts: inner index assignment (IIA) and cross index assignment (CIA). The II A reduces the distortion resulting from the error in order bits, presenting the identity of each code vector in a subcodebook. The CIA modifies the indexes assigned by the IIA in such a way that the effect of the channel error occurring in class bits, indicating the class information of the code vector, can be minimized. Simulation results show that the proposed algorithms enable a reliable communication over noisy channels even without employing the channel encoding. Index Terms Classified vector quantization, index assignment.

Imbalanced SVM-Based Anomaly Detection Algorithm for Imbalanced Training Datasets

  • Wang, GuiPing;Yang, JianXi;Li, Ren
    • ETRI Journal
    • /
    • v.39 no.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.