• Title/Summary/Keyword: realize the algorithm

Search Result 456, Processing Time 0.029 seconds

Deep Packet Inspection Time-Aware Load Balancer on Many-Core Processors for Fast Intrusion Detection

  • Choi, Yoon-Ho;Park, Woojin;Choi, Seok-Hwan;Seo, Seung-Woo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.3
    • /
    • pp.169-177
    • /
    • 2016
  • To realize high-speed intrusion detection by accommodating many regular expression (regex)-based signatures and growing network link capacities, we propose the Service TimE-Aware Load-balancing (STEAL) algorithm. This work is motivated from the observation that utilization of a many-core network intrusion detection system (NIDS) is influenced by unfair computational distribution among many-core NIDS nodes. To avoid such unfair computational distribution, STEAL is designed to dynamically distribute a large volume of traffic among many-core NIDS nodes based on packet service time, which is represented by the deep packet time in many-core NIDS nodes. From experiments, we show that compared to the commonly used load-balancing algorithm based on arrival rate, STEAL increases the number of received packets (i.e., decreases the number of dropped packets) in many-core NIDS. Specifically, by integrating an open source NIDS (i.e. Bro) with STEAL, we show that even under attack-dominant traffic and with many signatures, STEAL can rapidly improve the performance of many-core NIDS to realize high-speed intrusion detection.

Design of High Speed Spindles Active Monitoring and Control Algorithm (고속 주축의 상태모니터링 및 제어 알고리즘 설계)

  • Choi, Hyun-Jin;Park, Chul-Woo;Bae, Jung-Sub;Ahn, Jeong-Hun;Choi, Seong-Dae
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.10 no.5
    • /
    • pp.13-19
    • /
    • 2011
  • In this paper, the active monitoring and control system is developed. This system can monitor the status of high the speed spindle in real time during its processing, and can analyze its influence of dimensional accuracy and processing if any, and can control the machining condition to realize the machining system equipped with active monitoring and self-diagnostic features. Machining experiment was performed on 3 materials Al, Brass and S45C in order to derive the relation between active monitoring and control algorithm by the machining load. In addition, we measured surface roughness of processing specimen along with the data change of spindle rotating speed and conveying speed according to variation of machining load. Based on these experiments, we derived relations for each material that can be applied to the control algorithm to allow self control of the rotating speed and conveying speed according to the machining load.

Design of Solving Similarity Recognition for Cloth Products Based on Fuzzy Logic and Particle Swarm Optimization Algorithm

  • Chang, Bae-Muu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4987-5005
    • /
    • 2017
  • This paper introduces a new method to solve Similarity Recognition for Cloth Products, which is based on Fuzzy logic and Particle swarm optimization algorithm. For convenience, it is called the SRCPFP method hereafter. In this paper, the SRCPFP method combines Fuzzy Logic (FL) and Particle Swarm Optimization (PSO) algorithm to solve similarity recognition for cloth products. First, it establishes three features, length, thickness, and temperature resistance, respectively, for each cloth product. Subsequently, these three features are engaged to construct a Fuzzy Inference System (FIS) which can find out the similarity between a query cloth and each sampling cloth in the cloth database D. At the same time, the FIS integrated with the PSO algorithm can effectively search for near optimal parameters of membership functions in eight fuzzy rules of the FIS for the above similarities. Finally, experimental results represent that the SRCPFP method can realize a satisfying recognition performance and outperform other well-known methods for similarity recognition under considerations here.

Realization of Digital Music Synthesizer Using a Frequency Modulation (FM 방식을 이용한 디지탈 악기음 합성기의 구현)

  • 주세철;김진범;김기두
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.7
    • /
    • pp.1025-1035
    • /
    • 1995
  • In this paper, we realize a real time digital FM synthesizer based on genetic algorithm using a general purpose digital signal processor. Especially, we synthesize diverse music sounds nicely using a synthesis model consisting of a single modulator and multiple carriers. Also we present genetic algorithm-based technique which determines optimal parameters for reconstruction through FM synthesis of a sound after analyzing the spectrum of PCM data as a standard music sound using FFT. Using the suggested parameter extractiuon algorithm, we extract parameters of several instruments and then synthesize digital FM sounds. To verify the validity of the parameter extraction algorithm as well as realization of a real time digital music synthesizer, the evaluation is first done by listening the sound directly as subjective test. Secondly, to evaluate the synthesized sound objectively with an engineering sense, we compare the synthesized sound with an original one in a time domain and a frequency domain.

  • PDF

A Study on Adaptive Routing Algorithm for Changing Environment in Sensor Networks (Sensor Network 환경에서 저전력 기반의 적응적 라우팅 알고리즘 연구)

  • Jun, Jae-Sung;Yang, Hyun-Gyu;Rhee, Byung-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1043-1048
    • /
    • 2005
  • As sensor network is drawing more attention than ever before due to the development of sensors and the technology of communications, various routing-algorithms, to realize a sensor node with low-power and a miniature size, is being introduced in the field. This paper is to discuss a way to find an optimal path by changing a routing- algorithm adequately according to environmental changes. This is also to suggest an appropriate sensor network model in the ubiquitous aera. The result from the experiment that we conducted showed us that as we suggested, an algorithm, changing and adapting itself to each different environment, operated more stably and transmitted data more effectively than the current fixed one. And it was also confirmed that this type of algorithm can provide low-power management, which is very important in sensor network.

  • PDF

Wireless Network Health Information Retrieval Method Based on Data Mining Algorithm

  • Xiaoguang Guo
    • Journal of Information Processing Systems
    • /
    • v.19 no.2
    • /
    • pp.211-218
    • /
    • 2023
  • In order to improve the low accuracy of traditional wireless network health information retrieval methods, a wireless network health information retrieval method is designed based on data mining algorithm. The invalid health information stored in wireless network is filtered by data mapping, and the health information is clustered by data mining algorithm. On this basis, the high-frequency words of health information are classified to realize wireless network health information retrieval. The experimental results show that exactitude of design way is significantly higher than that of the traditional method, which can solve the problem of low accuracy of the traditional wireless network health information retrieval method.

Optimization of Queueing Network by Perturbation Analysis (퍼터베이션 분석을 이용한 대기행렬 네트워크의 최적화)

  • 권치명
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.89-102
    • /
    • 2000
  • In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

  • PDF

A SM2 Elliptic Curve Threshold Signature Scheme without a Trusted Center

  • Jie, Yan;Yu, Lu;Li-yun, Chen;Wei, Nie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.897-913
    • /
    • 2016
  • Threshold signature is very important in identity authentication and some other applications. In December 2010, Chinese Encryption Administration released the SM2 elliptic curve digital signature algorithm as the first standard of the digital signature algorithm in China. At present, the papers on the threshold signature scheme based on this algorithm are few. A SM2 elliptic curve threshold signature scheme without a trusted center is proposed according to the Joint-Shamir-RSS algorithm, the Joint-Shamir-ZSS algorithm, the sum or diff-SS algorithm, the Mul-SS algorithm, the Inv-SS algorithm and the PM-SS algorithm. The proposed scheme is analyzed from correctness, security and efficiency. The correctness analysis shows that the proposed scheme can realize the effective threshold signature. The security analysis shows that the proposed scheme can resist some kinds of common attacks. The efficiency analysis shows that if the same secret sharing algorithms are used to design the threshold signature schemes, the SM2 elliptic curve threshold signature scheme will be more efficient than the threshold signature scheme based on ECDSA.

Real-Time Continuous-Scale Image Interpolation with Directional Smoothing

  • Yoo, Yoonjong;Shin, Jeongho;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.3
    • /
    • pp.128-134
    • /
    • 2014
  • A real-time, continuous-scale image interpolation method is proposed based on a bilinear interpolation with directionally adaptive low-pass filtering. The proposed algorithm was optimized for hardware implementation. The ordinary bi-linear interpolation method has blocking artifacts. The proposed algorithm solves this problem using directionally adaptive low-pass filtering. The algorithm can also solve the severe blurring problem by selectively choosing low-pass filter coefficients. Therefore, the proposed interpolation algorithm can realize a high-quality image scaler for a range of imaging systems, such as digital cameras, CCTV and digital flat panel displays.

Optimal Walking Trajectory for a Quadruped Robot Using Genetic-Fuzzy Algorithm

  • Kong, Jung-Shik;Lee, Bo-Hee;Kim, Jin-Geol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2492-2497
    • /
    • 2003
  • This paper presents optimal walking trajectory generation for a quadruped robot with genetic-fuzzy algorithm. In order to move a quadruped robot smoothly, both generations of optimal leg trajectory and free walking are required. Generally, making free walking is difficult to realize for a quadruped robot, because the patterned trajectory may interfere in the free walking. In this paper, we suggest the generation method for the leg trajectory satisfied with free walking pattern so as to avoid obstacle and walk smoothly. We generate via points of leg with respect to body motion, and then we use the genetic-fuzzy algorithm to search for the optimal via velocity and acceleration information of legs. All these methods are verified with PC simulation program, and implemented to SERO-V robot.

  • PDF