• Title/Summary/Keyword: Fixed-point Algorithm

Search Result 362, Processing Time 0.022 seconds

RSNT-cFastICA for Complex-Valued Noncircular Signals in Wireless Sensor Networks

  • Deng, Changliang;Wei, Yimin;Shen, Yuehong;Zhao, Wei;Li, Hongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4814-4834
    • /
    • 2018
  • This paper presents an architecture for wireless sensor networks (WSNs) with blind source separation (BSS) applied to retrieve the received mixing signals of the sink nodes first. The little-to-no need of prior knowledge about the source signals of the sink nodes in the BSS method is obviously advantageous for WSNs. The optimization problem of the BSS of multiple independent source signals with complex and noncircular distributions from observed sensor nodes is considered and addressed. This paper applies Castella's reference-based scheme to Novey's negentropy-based algorithms, and then proposes a novel fast fixed-point (FastICA) algorithm, defined as the reference-signal negentropy complex FastICA (RSNT-cFastICA) for complex-valued noncircular-distribution source signals. The proposed method for the sink nodes is substantially more efficient than Novey's quasi-Newton algorithm in terms of computational speed under large numbers of samples, can effectively improve the power consumption effeciency of the sink nodes, and is significantly beneficial for WSNs and wireless communication networks (WCNs). The effectiveness and performance of the proposed method are validated and compared with three related BSS algorithms through theoretical analysis and simulations.

Development of Variable Speed Digital Control System for SRM using Simple Position Detector (간단한 위치검출기를 이용한 SRM 가변속 디지털 제어시스템 개발)

  • 천동진;정도영;이상호;이봉섭;박영록
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.6 no.2
    • /
    • pp.202-208
    • /
    • 2001
  • A Switched Reluctance Motor(SRM) has double salient poles structure and the phase windings are wound in stator. SRM hase more simple structure that of other motor, thus manufacture cost is low, mechanically strong, reliable to a poor environment such as high temperature, and maintenance cost is low because of brushless. SRM needs position detector to get rotator position information for phase excitation and tachometer or encoder for constant speed operation. But, this paper doesn\`s use an encoder of high cost for velocity measurement of rotator. Instead of it, the algorithm for position detection and velocity estimation from simple slotted disk has been proposed and developed. To implement variable speed digital control system with velocity estimation algorithm, the TMS320F240-20MIPS fixed point arithmetic processor of TI corporation is used. The experimental results of the developing system are enable to control speed with wide range, not only single pulse, hard chopping mode and soft chopping, ut also variable speed control, and advance angle control.

  • PDF

A Range-Free Localization Algorithm for Sensor Networks with a Helicopter-based Mobile Anchor Node (센서 네트워크에서 모바일 앵커 노드(헬기)를 이용한 위치인식 알고리즘)

  • Lee, Byoung-Hwa
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.8
    • /
    • pp.750-757
    • /
    • 2011
  • Wireless Sensor Network is composed of a lot of sensor nodes that are densely deployed in a field. So generally this sensor nodes are spreaded using Helicopter or Fixed wing. Each node delivers own location and acquired information to user when it detects specific events. In this paper, we propose localization algorithm without range information in wireless sensor network using helicopter. Helicopter broadcasts periodically beacon signal for sensor nodes. Sensor nodes stored own memory this beacon signal until to find another beacon point(satisfied special condition). This paper develops a localization mechanism using the geometry conjecture(perpendicular bisector of a chord) to know own location. And the simulation results demonstrate that our localization scheme outperforms Centroid, APIT in terms of a higher location accuracy.

A Study for Improving Performance of ATM Multicast Switch (ATM 멀티캐스트 스위치의 성능 향상을 위한 연구)

  • 이일영;조양현;오영환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1922-1931
    • /
    • 1999
  • A multicast traffic’s feature is the function of providing a point to multipoints cell transmission, which is emerging from the main function of ATM switch. However, when a conventional point-to-point switch executes a multicast function, the excess load is occurred because unicast cell as well as multicast cell passed the copy network. Additionally, due to the excess load, multicast cells collide with other cells in a switch. Thus a deadlock that losses cells raises, extremely diminishes the performance of switch. An input queued switch also has a defect of the HOL (Head of Line) blocking that less lessens the performance of the switch. In the proposed multicast switch, we use shared memory switch to reduce HOL blocking and deadlock. In order to decrease switch’s complexity and cell's processing time, to improve a throughput, we utilize the method that routes a cell on a separated paths by traffic pattern and the scheduling algorithm that processes a maximum 2N cell at once in the control part. Besides, when cells is congested at an output port, a cell loss probability increases. Thus we use the Output Memory (OM) to reduce the cell loss probability. And we make use of the method that stores the assigned memory (UM, MM) with a cell by a traffic pattern and clears the cell of the Output memory after a fixed saving time to improve the memory utilization rate. The performance of the proposed switch is executed and compared with the conventional policy under the burst traffic condition through both the analysis based on Markov chain and simulation.

  • PDF

Elimination of car's magnetic effect as noise in a car-borne magnetic exploration system (차량 자력탐사에서 차량의 영향의 제거)

  • Lim, Mu-Taek;Park, Yeong-Sue;Chung, Hyun-Key;Rim, Hyoung-Rae;Koo, Sung-Bon;Lee, Young-Chal
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2006.06a
    • /
    • pp.141-151
    • /
    • 2006
  • A blank test was done to calculatee the car itself's magnetic effect as noise and to eliminate it from the data set of total magnetic intensity(=magnetic flux density) exploration in a car-borne magnetic exploration system. To calculate the induced magnetic intensity(= magnetization) and the remanent magnetic intensity(= magnetization) of the car itself, we have installed the magnetometer on a fixed point and measured the magnetic intensity letting the car move around the magnetometer, and we have changed the data set into an analogous data set as if acquired in the condition that we have parked the car on the same fixed point and measured the magnetic intensity moving the magnetometer around the magnetometer. Through an inversion with the later data set as input, we have calculated the magnetic center and the magnetic moments of the induced magnetic intensity(= magnetization) and the remanent magnetic intensity(= magnetization) of the car itself with the two centers coincided because of some barriers of the inversion algorithm that we have used in this study. On the other hand, we have extracted the magnetic anomaly by reducing i. e. vectorially eliminating the induced magnetic intensity(= magnetization) and the remanent magnetic intensity(= magnetization) of the car itself calculated forwardly, from the magnetic exploration data set acquired by the car-borne magnetic exploration system.

  • PDF

Land Use Optimization using Genetic Algorithms - Focused on Yangpyeong-eup - (유전 알고리즘을 적용한 토지이용 최적화 배분 연구 - 양평군 양평읍 일대를 대상으로 -)

  • Park, Yoonsun;Lee, Dongkun;Yoon, Eunjoo;Mo, Yongwon;Leem, Jihun
    • Journal of Environmental Impact Assessment
    • /
    • v.26 no.1
    • /
    • pp.44-56
    • /
    • 2017
  • Sustainable development is important because the ultimate objective is efficient development combining the economic, social, and environmental aspects of urban conservation. Despite Korea's rapid urbanization and economic development, the distribution of resources is inefficient, and land-use is not an exception. Land use distribution is difficult, as it requires considering a variety of purposes, whose solutions lie in a multipurpose optimization process. In this study, Yangpyeong-eup, Yangpyeong, Gyeonggi-do, is selected, as the site has ecological balance, is well-preserved, and has the potential to support population increases. Further, we have used the genetic algorithm method, as it helps to evolve solutions for complex spatial problems such as planning and distribution of land use. This study applies change to the way of mutation. With four goals and restrictions of area, spatial objectives, minimizing land use conversion, ecological conservation, maximizing economic profit, restricting area to a specific land use, and setting a fixed area, we developed an optimal planning map. No urban areas at the site needed preservation and the high urban area growth rate coincided with the optimization of purpose and maximization of economic profit. When the minimum point of the fitness score is the convergence point, we found optimization occurred approximately at 1500 generations. The results of this study can support planning at Yangpyeong-eup.ausative relationship between the perception of improving odor regulation and odor acceptance.

Load Balancing of Unidirectional Dual-link CC-NUMA System Using Dynamic Routing Method (단방향 이중연결 CC-NUMA 시스템의 동적 부하 대응 경로 설정 기법)

  • Suh Hyo-Joon
    • The KIPS Transactions:PartA
    • /
    • v.12A no.6 s.96
    • /
    • pp.557-562
    • /
    • 2005
  • Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

A new Clustering Algorithm for the Scanned Infrared Image of the Rosette Seeker (로젯 탐색기의 적외선 주사 영상을 위한 새로운 클러스터링 알고리즘)

  • Jahng, Surng-Gabb;Hong, Hyun-Ki;Doo, Kyung-Su;Oh, Jeong-Su;Choi, Jong-Soo;Seo, Dong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.2
    • /
    • pp.1-14
    • /
    • 2000
  • The rosette-scan seeker, mounted on the infrared guided missile, is a device that tracks the target It can acquire the 2D image of the target by scanning a space about target in rosette pattern with a single detector Since the detected image is changed according to the position of the object in the field of view and the number of the object is not fixed, the unsupervised methods are employed in clustering it The conventional ISODATA method clusters the objects by using the distance between the seed points and pixels So, the clustering result varies in accordance with the shape of the object or the values of the merging and splitting parameters In this paper, we propose an Array Linkage Clustering Algorithm (ALCA) as a new clustering algorithm improving the conventional method The ALCA has no need for the initial seed points and the merging and splitting parameters since it clusters the object using the connectivity of the array number of the memory stored the pixel Therefore, the ALCA can cluster the object regardless of its shape With the clustering results using the conventional method and the proposed one, we confirm that our method is better than the conventional one in terms of the clustering performance We simulate the rosette scanning infrared seeker (RSIS) using the proposed ALCA as an infrared counter countermeasure The simulation results show that the RSIS using our method is better than the conventional one in terms of the tracking performance.

  • PDF

WebPR : A Dynamic Web Page Recommendation Algorithm Based on Mining Frequent Traversal Patterns (WebPR :빈발 순회패턴 탐사에 기반한 동적 웹페이지 추천 알고리즘)

  • Yoon, Sun-Hee;Kim, Sam-Keun;Lee, Chang-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.187-198
    • /
    • 2004
  • The World-Wide Web is the largest distributed Information space and has grown to encompass diverse information resources. However, although Web is growing exponentially, the individual's capacity to read and digest contents is essentially fixed. From the view point of Web users, they can be confused by explosion of Web information, by constantly changing Web environments, and by lack of understanding needs of Web users. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and Information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent k-Pagesets. We develop a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. Our algorithms provide Web users with new page views, which Include pagesets to recommend, so that users can effectively traverse its Web site. The main distinguishing factors are both a point consistently spanning schemes applying inter-pages association for mining frequent traversal patterns and a point proposing the most efficient tree model. Our experimentation with two real data sets, including Lady Asiana and KBS media server site, clearly validates that our method outperforms conventional methods.

Accuracy of artificial intelligence-assisted landmark identification in serial lateral cephalograms of Class III patients who underwent orthodontic treatment and two-jaw orthognathic surgery

  • Hong, Mihee;Kim, Inhwan;Cho, Jin-Hyoung;Kang, Kyung-Hwa;Kim, Minji;Kim, Su-Jung;Kim, Yoon-Ji;Sung, Sang-Jin;Kim, Young Ho;Lim, Sung-Hoon;Kim, Namkug;Baek, Seung-Hak
    • The korean journal of orthodontics
    • /
    • v.52 no.4
    • /
    • pp.287-297
    • /
    • 2022
  • Objective: To investigate the pattern of accuracy change in artificial intelligence-assisted landmark identification (LI) using a convolutional neural network (CNN) algorithm in serial lateral cephalograms (Lat-cephs) of Class III (C-III) patients who underwent two-jaw orthognathic surgery. Methods: A total of 3,188 Lat-cephs of C-III patients were allocated into the training and validation sets (3,004 Lat-cephs of 751 patients) and test set (184 Lat-cephs of 46 patients; subdivided into the genioplasty and non-genioplasty groups, n = 23 per group) for LI. Each C-III patient in the test set had four Lat-cephs: initial (T0), pre-surgery (T1, presence of orthodontic brackets [OBs]), post-surgery (T2, presence of OBs and surgical plates and screws [S-PS]), and debonding (T3, presence of S-PS and fixed retainers [FR]). After mean errors of 20 landmarks between human gold standard and the CNN model were calculated, statistical analysis was performed. Results: The total mean error was 1.17 mm without significant difference among the four time-points (T0, 1.20 mm; T1, 1.14 mm; T2, 1.18 mm; T3, 1.15 mm). In comparison of two time-points ([T0, T1] vs. [T2, T3]), ANS, A point, and B point showed an increase in error (p < 0.01, 0.05, 0.01, respectively), while Mx6D and Md6D showeda decrease in error (all p < 0.01). No difference in errors existed at B point, Pogonion, Menton, Md1C, and Md1R between the genioplasty and non-genioplasty groups. Conclusions: The CNN model can be used for LI in serial Lat-cephs despite the presence of OB, S-PS, FR, genioplasty, and bone remodeling.