• Title/Summary/Keyword: Clustering Problem

Search Result 708, Processing Time 0.021 seconds

Analysis on Scalability of Proactive Routing Protocols in Mobile Ad Hoc Networks (Ad Hoc 네트워크에서 테이블 기반 라우팅 프로토콜의 확장성 분석)

  • Yun, Seok-Yeol;Oh, Hoon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.147-154
    • /
    • 2007
  • Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

Reconstruction of 3D Building Model from Satellite Imagery Based on the Grouping of 3D Line Segments Using Centroid Neural Network (중심신경망을 이용한 3차원 선소의 군집화에 의한 위성영상의 3차원 건물모델 재구성)

  • Woo, Dong-Min;Park, Dong-Chul;Ho, Hai-Nguyen;Kim, Tae-Hyun
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.2
    • /
    • pp.121-130
    • /
    • 2011
  • This paper highlights the reconstruction of the rectilinear type of 3D rooftop model from satellite image data using centroid neural network. The main idea of the proposed 3D reconstruction method is based on the grouping of 3D line segments. 3D lines are extracted by 2D lines and DEM (Digital Elevation Map) data evaluated from a pair of stereo images. Our grouping process consists of two steps. We carry out the first grouping process to group fragmented or duplicated 3D lines into the principal 3D lines, which can be used to construct the rooftop model, and construct the groups of lines that are parallel each other in the second step. From the grouping result, 3D rooftop models are reconstructed by the final clustering process. High-resolution IKONOS images are utilized for the experiments. The experimental result's indicate that the reconstructed building models almost reflect the actual position and shape of buildings in a precise manner, and that the proposed approach can be efficiently applied to building reconstruction problem from high-resolution satellite images of an urban area.

Moving Object Tracking using Query Relaying in Wireless Sensor Networks (무선 센서 네트워크에서 질의 중계를 이용한 이동 객체의 위치 추적 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Yim, Yongbin;Kim, Sang-Ha
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.11
    • /
    • pp.598-603
    • /
    • 2014
  • In wireless sensor networks, two methods have been generally used to track continuously moving object: a user query-based method and a periodic report-based method. Although the former method generates more overhead as a result of the user queries, the former one is also an energy-efficient method that does not transfer unnecessary information. For the user query-based method, a virtual tree that consist of sensor nodes is used to perform the user query and the sensor reporting. The tree stores the information of the mobile objects, and the stored information triggers a report b the user query. However, in case of a fast-moving object, the tracking accuracy decreases as a result of the time delay of the end-to-end repeated query. In order to solve this problem, we propose a query-relay method that reduces the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to adjacent nodes according to the movement of mobile object that is tracked. When the query messages are relayed. The end-to-end querying time delay is reduced. and a simulation shows that our method is superior to existing ones in terms of tracking accuracy.

Competition - Ecological Classification of the Prominent Paddy Weed Species around Bulrush(Scirpus juncoides) (올챙고랭이(Scirpus juncoides)를 중심으로 한 주요(主要) 논 잡초종(雜草種)의 벼 경합생태적(競合生態的) 분류(分類))

  • Guh, J.O.;Heo, S.M.
    • Korean Journal of Weed Science
    • /
    • v.5 no.2
    • /
    • pp.96-102
    • /
    • 1985
  • A study on the competition-ecological classification of the 10 prominent paddy weed species around bulrush (Scirpus juneoides) to simplify the weed problem concept for the rice production. A serial assessments on the competition ability in space and dry matter production(nutrient depletion) of respective weed species and paddy rice, and the data were used to compute the phenotypic similarity by Single Link Clustering method. Both growth response of weed species in mono- and under the paddy rice standing was very similar (r = 0.969), but the reduction rate as affected by paddy rice standing was negatively correlated with the ability in space-competition(r=-0.513). Dendrogram of 10 weed species based on the phenotypic similarity computed in 4 characters in mono- and under the paddy rice standing was also similar, as Echinochloa c., Ludwigia p., Cyperus s., and Scirpus m. in I-group, Eleocharis k., Scirpus j, in II-group, and Juncus e., Potamogeton d. in III-group, respectively. Also, that of paddy rice to 10 weed species showed Fimbristylis m., Scirpus j., Eleocharis k., Scirpus m., Juncus e. in I-group, and Ludwigia p., Potamogeton d., Monochoria v. in II-group, respectively. The integrated dendrogram by the above two data indicate the I-group with Fimbristylis m., Scirpus j., Eleocharis k. and Juncus e., as higher growth response with relatively lower competition ability to paddy rice, II-group with Cyperus s., Echinochloa c., Potamogeton d., and Ludwigia p., as higher both in growth and competition, and the last, III-group with Monochoria v., and Scirpus m., as lower growth but higher competition, respectively.

  • PDF

A Design on Face Recognition System Based on pRBFNNs by Obtaining Real Time Image (실시간 이미지 획득을 통한 pRBFNNs 기반 얼굴인식 시스템 설계)

  • Oh, Sung-Kwun;Seok, Jin-Wook;Kim, Ki-Sang;Kim, Hyun-Ki
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.12
    • /
    • pp.1150-1158
    • /
    • 2010
  • In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problem. First, in preprocessing part, we use a CCD camera to obtain a picture frame in real-time. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. We use an AdaBoost algorithm proposed by Viola and Jones, which is exploited for the detection of facial image area between face and non-facial image area. As the feature extraction algorithm, PCA method is used. In this study, the PCA method, which is a feature extraction algorithm, is used to carry out the dimension reduction of facial image area formed by high-dimensional information. Secondly, we use pRBFNNs to identify the ID by recognizing unique pattern of each person. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. Coefficients of connection weight identified with back-propagation using gradient descent method. The output of pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of the Particle Swarm Optimization. The proposed pRBFNNs are applied to real-time face recognition system and then demonstrated from the viewpoint of output performance and recognition rate.

Exploring Cognitive Biases Limiting Rational Problem Solving and Debiasing Methods Using Science Education (합리적 문제해결을 저해하는 인지편향과 과학교육을 통한 탈인지편향 방법 탐색)

  • Ha, Minsu
    • Journal of The Korean Association For Science Education
    • /
    • v.36 no.6
    • /
    • pp.935-946
    • /
    • 2016
  • This study aims to explore cognitive biases relating the core competences of science and instructional strategy in reducing the level of cognitive biases. The literature review method was used to explore cognitive biases and science education experts discussed the relevance of cognitive biases to science education. Twenty nine cognitive biases were categorized into five groups (limiting rational causal inference, limiting diverse information search, limiting self-regulated learning, limiting self-directed decision making, and category-limited thinking). The cognitive biases in limiting rational causal inference group are teleological thinking, availability heuristic, illusory correlation, and clustering illusion. The cognitive biases in limiting diverse information search group are selective perception, experimenter bias, confirmation bias, mere thought effect, attentional bias, belief bias, pragmatic fallacy, functional fixedness, and framing effect. The cognitive biases in limiting self-regulated learning group are overconfidence bias, better-than-average bias, planning fallacy, fundamental attribution error, Dunning-Kruger effect, hindsight bias, and blind-spot bias. The cognitive biases in limiting self-directed decision-making group are acquiescence effect, bandwagon effect, group-think, appeal to authority bias, and information bias. Lastly, the cognitive biases in category-limited thinking group are psychological essentialism, stereotyping, anthropomorphism, and outgroup homogeneity bias. The instructional strategy to reduce the level of cognitive biases is disused based on the psychological characters of cognitive biases reviewed in this study and related science education methods.

A Cluster-Based Channel Assignment Algorithm for IEEE 802.11b/g Wireless Mesh Networks (IEEE 802.11b/g 무선 메쉬 네트워크를 위한 클러스터 기반 채널 할당 알고리즘)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun;Jo, Min-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.87-93
    • /
    • 2009
  • Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

A Study on the Accuracy of Calculating Slopes for Mountainous Landform in Korea Using GIS Software - Focused on the Contour Interval of Source Data and the Resolution - (GIS Software를 이용한 한국 산악 지형의 경사도 산출 정확도에 관한 연구 -원자료의 등고선 간격과 해상력을 중심으로-)

  • 신진민;이규석
    • Spatial Information Research
    • /
    • v.7 no.1
    • /
    • pp.1-12
    • /
    • 1999
  • The DTM(Digital Terrain Model) in GIS(Geographical Information System) shows the elevation from interpolation using data points surveyed. In panoramic flat landform, pixel size, resolution of source data may not be the problem in using DTM However, in mountainous landform like Korea, appropriate resolution accuracy of source data are important factors to represent the topography concerned. In this study, the difference in contour interval of source data, the resolution after interpolation, and different data structures were compared to figure out the accuracy of slope calculation using DTM from the topographic maps of Togyusan National Park Two types of GIS softwares, Idrisi(grid) ver. 2.0 using the altitude matrices and ArcView(TIN) ver. 3.0a using TIN were used for this purpose. After the analysis the conclusions are as follows: 1) The coarser resolution, the more smoothing effect inrepresenting the topography. 2) The coarser resolution the more difference between the grid-based Idrisi and the TIN-based ArcView. 3) Based on the comparison analysis of error for 30 points from clustering, there is not much difference among 10, 20, 30 m resolution in TIM-based Airview ranging from 4.9 to 6.2n However, the coarser resolution the more error for elevation and slope in the grid-based Idrisi. ranging from 6.3 to 10.9m. 4) Both Idrisi and ArcView could net consider breaklines of lanform like hilltops, valley bottoms.

  • PDF

Molecular cloning and expression analysis of the first two key genes through 2-C-methyl-D-erythritol 4-phosphate (MEP) pathway from Pyropia haitanensis (Bangiales, Rhodophyta)

  • Du, Yu;Guan, Jian;Xu, Ruijun;Liu, Xin;Shen, Weijie;Ma, Yafeng;He, Yuan;Shen, Songdong
    • ALGAE
    • /
    • v.32 no.4
    • /
    • pp.359-377
    • /
    • 2017
  • Pyropia haitanensis (T. J. Chang et B. F. Zheng) N. Kikuchi et M. Miyata is one of the most commercially useful macroalgae cultivated in southeastern China. In red algae, the biosynthesis of terpenoids through 2-C-methyl-D-erythritol 4-phosphate (MEP) pathway can produce a direct influence on the synthesis of many biologically important metabolites. In this study, two genes of cDNAs, 1-deoxy-D-xylulose-5-phosphate synthase (DXS) and 1-deoxy-D-xylulose-5-phosphate reductase (DXR), which encoding the first two rate-limiting enzymes among MEP pathway were cloned from P. haitanensis. The cDNAs of P. haitanensis DXS (PhDXS) and DXR (PhDXR) both contained complete open reading frames encoding polypeptides of 764 and 426 amino acids residues, separately. The expression analysis showed that PhDXS was significant differently expressed between leafy thallus and conchocelis as PhDXR been non-significant. Additionally, expression of PhDXR and its downstream gene geranylgeranyl diphosphate synthase were both inhibited by fosmidomycin significantly. Meanwhile, we constructed types of phylogenetic trees through different algae and higher plants DXS and DXR encoding amino acid sequences, as a result we found tree clustering consequences basically in line with the "Cavalier-Smith endosymbiotic theory." Whereupon, we speculated that in red algae, there existed only complete MEP pathway to meet needs of terpenoids synthesis for themselves; Terpenoids synthesis of red algae derivatives through mevalonate pathway came from two or more times endosymbiosis of heterotrophic eukaryotic parasitifer. This study demonstrated that PhDXS and PhDXR could play significant roles in terpenoids biosynthesis at molecular levels. Meanwhile, as nuclear genes among MEP pathway, PhDXS and PhDXR could provide a new way of thinking to research the problem of chromalveolata biological evolution.

The study of Defense Artificial Intelligence and Block-chain Convergence (국방분야 인공지능과 블록체인 융합방안 연구)

  • Kim, Seyong;Kwon, Hyukjin;Choi, Minwoo
    • Journal of Internet Computing and Services
    • /
    • v.21 no.2
    • /
    • pp.81-90
    • /
    • 2020
  • The purpose of this study is to study how to apply block-chain technology to prevent data forgery and alteration in the defense sector of AI(Artificial intelligence). AI is a technology for predicting big data by clustering or classifying it by applying various machine learning methodologies, and military powers including the U.S. have reached the completion stage of technology. If data-based AI's data forgery and modulation occurs, the processing process of the data, even if it is perfect, could be the biggest enemy risk factor, and the falsification and modification of the data can be too easy in the form of hacking. Unexpected attacks could occur if data used by weaponized AI is hacked and manipulated by North Korea. Therefore, a technology that prevents data from being falsified and altered is essential for the use of AI. It is expected that data forgery prevention will solve the problem by applying block-chain, a technology that does not damage data, unless more than half of the connected computers agree, even if a single computer is hacked by a distributed storage of encrypted data as a function of seawater.