• Title/Summary/Keyword: dynamic threshold

Search Result 455, Processing Time 0.031 seconds

Actuator Fault Detection and Isolation Method for a Hexacopter (헥사콥터의 구동기 고장 검출 및 분리 방법)

  • Park, Min-Kee
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.266-272
    • /
    • 2019
  • Multicopters have become more popular since they are advantageous in their ability to take off and land vertically. In order to guarantee the normal operations of such multicopters, the problem of fault detection and isolation is very important. In this paper, a new method for detecting and isolating an actuator fault of a hexacopter is proposed based on the analytical approach. The residual is newly defined using the angular velocities of actuators estimated by the mathematical model and an actuator fault is detected comparing the residuals to a threshold. And a fault is isolated combining a dynamic model and generated residuals when a fault is detected. The proposed method is a simple, but effective technique because it is based on mathematical model. The results of the computer simulation are also given to demonstrate the validity of the proposed algorithm in case of a single failure.

Effective Pre-rating Method Based on Users' Dichotomous Preferences and Average Ratings Fusion for Recommender Systems

  • Cheng, Shulin;Wang, Wanyan;Yang, Shan;Cheng, Xiufang
    • Journal of Information Processing Systems
    • /
    • v.17 no.3
    • /
    • pp.462-472
    • /
    • 2021
  • With an increase in the scale of recommender systems, users' rating data tend to be extremely sparse. Some methods have been utilized to alleviate this problem; nevertheless, it has not been satisfactorily solved yet. Therefore, we propose an effective pre-rating method based on users' dichotomous preferences and average ratings fusion. First, based on a user-item ratings matrix, a new user-item preference matrix was constructed to analyze and model user preferences. The items were then divided into two categories based on a parameterized dynamic threshold. The missing ratings for items that the user was not interested in were directly filled with the lowest user rating; otherwise, fusion ratings were utilized to fill the missing ratings. Further, an optimized parameter λ was introduced to adjust their weights. Finally, we verified our method on a standard dataset. The experimental results show that our method can effectively reduce the prediction error and improve the recommendation quality. As for its application, our method is effective, but not complicated.

Load Balancing Approach to Enhance the Performance in Cloud Computing

  • Rassan, Iehab AL;Alarif, Noof
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.2
    • /
    • pp.158-170
    • /
    • 2021
  • Virtualization technologies are being adopted and broadly utilized in many fields and at different levels. In cloud computing, achieving load balancing across large distributed virtual machines is considered a complex optimization problem with an essential importance in cloud computing systems and data centers as the overloading or underloading of tasks on VMs may cause multiple issues in the cloud system like longer execution time, machine failure, high power consumption, etc. Therefore, load balancing mechanism is an important aspect in cloud computing that assist in overcoming different performance issues. In this research, we propose a new approach that combines the advantages of different task allocation algorithms like Round robin algorithm, and Random allocation with different threshold techniques like the VM utilization and the number of allocation counts using least connection mechanism. We performed extensive simulations and experiments that augment different scheduling policies to overcome the resource utilization problem without compromising other performance measures like makespan and execution time of the tasks. The proposed system provided better results compared to the original round robin as it takes into consideration the dynamic state of the system.

Dynamic Threshold Method for Isolation of Worm Hole Attack in Wireless Sensor Networks

  • Surinder Singh;Hardeep Singh Saini
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.5
    • /
    • pp.119-128
    • /
    • 2024
  • The moveable ad hoc networks are untrustworthy and susceptible to any intrusion because of their wireless interaction approach. Therefore the information from these networks can be stolen very easily just by introducing the attacker nodes in the system. The straight route extent is calculated with the help of hop count metric. For this purpose, routing protocols are planned. From a number of attacks, the wormhole attack is considered to be the hazardous one. This intrusion is commenced with the help of couple attacker nodes. These nodes make a channel by placing some sensor nodes between transmitter and receiver. The accessible system regards the wormhole intrusions in the absence of intermediary sensor nodes amid target. This mechanism is significant for the areas where the route distance amid transmitter and receiver is two hops merely. This mechanism is not suitable for those scenarios where multi hops are presented amid transmitter and receiver. In the projected study, a new technique is implemented for the recognition and separation of attacker sensor nodes from the network. The wormhole intrusions are triggered with the help of these attacker nodes in the network. The projected scheme is utilized in NS2 and it is depicted by the reproduction outcomes that the projected scheme shows better performance in comparison with existing approaches.

Cloud Detection Using HIMAWARI-8/AHI Based Reflectance Spectral Library Over Ocean (Himawari-8/AHI 기반 반사도 분광 라이브러리를 이용한 해양 구름 탐지)

  • Kwon, Chaeyoung;Seo, Minji;Han, Kyung-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.5_1
    • /
    • pp.599-605
    • /
    • 2017
  • Accurate cloud discrimination in satellite images strongly affects accuracy of remotely sensed parameter produced using it. Especially, cloud contaminated pixel over ocean is one of the major error factors such as Sea Surface Temperature (SST), ocean color, and chlorophyll-a retrievals,so accurate cloud detection is essential process and it can lead to understand ocean circulation. However, static threshold method using real-time algorithm such as Moderate Resolution Imaging Spectroradiometer (MODIS), Advanced Himawari Imager (AHI) can't fully explained reflectance variability over ocean as a function of relative positions between the sun - sea surface - satellite. In this paper, we assembled a reflectance spectral library as a function of Solar Zenith Angle (SZA) and Viewing Zenith Angle (VZA) from ocean surface reflectance with clear sky condition of Advanced Himawari Imager (AHI) identified by NOAA's cloud products and spectral library is used for applying the Dynamic Time Warping (DTW) to detect cloud pixels. We compared qualitatively between AHI cloud property and our results and it showed that AHI cloud property had general tendency toward overestimation and wrongly detected clear as unknown at high SZA. We validated by visual inspection with coincident imagery and it is generally appropriate.

Performance Evaluation of Scaling based Dynamic Time Warping Algorithms for the Detection of Low-rate TCP Attacks (Low-rate TCP 공격 탐지를 위한 스케일링 기반 DTW 알고리즘의 성능 분석)

  • So, Won-Ho;Shim, Sang-Heon;Yoo, Kyoung-Min;Kim, Young-Chon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.3 s.357
    • /
    • pp.33-40
    • /
    • 2007
  • In this paper, low-rate TCP attack as one of shrew attacks is considered and the scaling based dynamic time warping (S-DTW) algorithm is introduced. The low-rate TCP attack can not be detected by the detection method for the previous flooding DoS/DDoS (Denial of Service/Distirbuted Denial of Service) attacks due to its low average traffic rate. It, however, is a periodic short burst that exploits the homogeneity of the minimum retransmission timeout (RTO) of TCP flows and then some pattern matching mechanisms have been proposed to detect it among legitimate input flows. A DTW mechanism as one of detection approaches has proposed to detect attack input stream consisting of many legitimate or attack flows, and shown a depending method as well. This approach, however, has a problem that legitimate input stream may be caught as an attack one. In addition, it is difficult to decide a threshold for separation between the legitimate and the malicious. Thus, the causes of this problem are analyzed through simulation and the scaling by maximum auto-correlation value is executed before computing the DTW. We also discuss the results on applying various scaling approaches and using standard deviation of input streams monitored.

Dynamic Channel Management Scheme for Device-to-device Communication in Next Generation Downlink Cellular Networks (차세대 하향링크 셀룰러 네트워크에서 단말 간 직접 통신을 위한 유동적 채널관리 방법)

  • Se-Jin Kim
    • Journal of Internet Computing and Services
    • /
    • v.24 no.1
    • /
    • pp.1-7
    • /
    • 2023
  • Recently, the technology of device-to-device(D2D) communication has been receiving big attention to improve the system performance since the amount of high quality/large capacity data traffic from smart phones and various devices of Internet of Things increase rapidly in 5G/6G based next generation cellular networks. However, even though the system performance of macro cells increase by reusing the frequency, the performance of macro user equipments(MUEs) decrease because of the strong interference from D2D user equipments(DUEs). Therefore, this paper proposes a dynamic channel management(DCM) scheme for DUEs to guarantee the performance of MUEs as the number of DUEs increases in next generation downlink cellular networks. In the proposed D2D DCM scheme, macro base stations dynamically assign subchannels to DUEs based on the interference information and signal to interference and noise ratio(SINR) of MUEs. Simulation results show that the proposed D2D DCM scheme outperforms other schemes in terms of the mean MUE capacity as the threshold of the SINR of MUEs incareases.

Dynamic Virtual Ontology using Tags with Semantic Relationship on Social-web to Support Effective Search (효율적 자원 탐색을 위한 소셜 웹 태그들을 이용한 동적 가상 온톨로지 생성 연구)

  • Lee, Hyun Jung;Sohn, Mye
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.19-33
    • /
    • 2013
  • In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

Characterization of Ecological Networks on Wetland Complexes by Dispersal Models (분산 모형에 따른 습지경관의 생태 네트워크 특성 분석)

  • Kim, Bin;Park, Jeryang
    • Journal of Wetlands Research
    • /
    • v.21 no.1
    • /
    • pp.16-26
    • /
    • 2019
  • Wetlands that provide diverse ecosystem services, such as habitat provision and hydrological control of flora and fauna, constitute ecosystems through interaction between wetlands existing in a wetlandscape. Therefore, to evaluate the wetland functions such as resilience, it is necessary to analyze the ecological connectivity that is formed between wetlands which also show hydrologically dynamic behaviors. In this study, by defining wetlands as ecological nodes, we generated ecological networks through the connection of wetlands according to the dispersal model of wetland species. The characteristics of these networks were then analyzed using various network metrics. In the case of the dispersal based on a threshold distance, while a high local clustering is observed compared to the exponential dispersal kernel and heavy-tailed dispersal model, it showed a low efficiency in the movement between wetlands. On the other hand, in the case of the stochastic dispersion model, a low local clustering with high efficiency in the movement was observed. Our results confirmed that the ecological network characteristics are completely different depending on which dispersal model is chosen, and one should be careful on selecting the appropriate model for identifying network properties which highly affect the interpretation of network structure and function.

Outlier Detection By Clustering-Based Ensemble Model Construction (클러스터링 기반 앙상블 모델 구성을 이용한 이상치 탐지)

  • Park, Cheong Hee;Kim, Taegong;Kim, Jiil;Choi, Semok;Lee, Gyeong-Hoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.11
    • /
    • pp.435-442
    • /
    • 2018
  • Outlier detection means to detect data samples that deviate significantly from the distribution of normal data. Most outlier detection methods calculate an outlier score that indicates the extent to which a data sample is out of normal state and determine it to be an outlier when its outlier score is above a given threshold. However, since the range of an outlier score is different for each data and the outliers exist at a smaller ratio than the normal data, it is very difficult to determine the threshold value for an outlier score. Further, in an actual situation, it is not easy to acquire data including a sufficient amount of outliers available for learning. In this paper, we propose a clustering-based outlier detection method by constructing a model representing a normal data region using only normal data and performing binary classification of outliers and normal data for new data samples. Then, by dividing the given normal data into chunks, and constructing a clustering model for each chunk, we expand it to the ensemble method combining the decision by the models and apply it to the streaming data with dynamic changes. Experimental results using real data and artificial data show high performance of the proposed method.