Earticle

현재 위치 Home

International Journal of Hybrid Information Technology

간행물 정보
  • 자료유형
    학술지
  • 발행기관
    보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
  • pISSN
    1738-9968
  • 간기
    격월간
  • 수록기간
    2008 ~ 2016
  • 주제분류
    공학 > 컴퓨터학
  • 십진분류
    KDC 505 DDC 605
Vol.6 No.4 (10건)
No
1

A Kind of Energy-efficient Routing Algorithm for WSN Based on HQEA

Lingxia Liu, Qiang Song

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.1-10

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

This paper proposes a new hierarchical routing algorithm for wireless sensor networks called hybrid QEA-based energy-efficient routing algorithm (HERA), which is based on LEACH and PEGASIS algorithms in the environment of wireless sensor networks. In order to reduce the data transmission distance, this algorithm uses the hybrid quantum evolutionary algorithm (HQEA) to establish the best cluster-based multi-chain topology. For the sake of balancing energy dissipation, node’s residual energy and its distance from the target are considered as criterions of cluster head election, and each cluster head relays the sensed data of other clusters to the sink. Simulation results demonstrate comparing with LEACH and PEGASIS, this proposed algorithm HERA can shorten total transmission distance significantly, which is also more efficient to save and balance energy of consumption, meanwhile it prolongs the living time of whole network and eliminates the affection of sink’s location on the network lifetime.

2

Fingerprint Image Enhancement: Iterative Fast Fourier Transform Algorithm and Performance Evaluation

Sandhya Tarar, Ela Kumar

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.11-20

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Fingerprint Identification System performance largely depends on the quality of input fingerprint images. High quality input fingerprint images are prerequisite for high performance systems. In this paper, we have proposed an algorithm of fingerprint image enhancement by using Iterative Fast Fourier Transform (IFFT). Iterative image reconstruction algorithms play an important role in fingerprint identification systems in order to achieve higher degree of efficiency. With the fast increase of the sizes of the fingerprint data, design of the reconstruction algorithms is of great importance in order to improve the performance. Fourier-based frequency orientation methods have the potential to considerably reduce the computation time in iterative reconstruction. We also have designed an approach for removing the false minutia generated during the fingerprint processing and a method to reduce the false minutia to increase the efficacy of identification system. We have used fingerprint Verification Competition 2006 (FVC 2006) as a database for implementation of proposed algorithm to verify the degree of efficiency of proposed algorithm. Experimental result shows that the proposed enhancement algorithm is better than existing Fast Fourier Transform algorithm.

3

Study Emergency in Spreading Activation Model by Modeling Path Finding Problems

Xixu Fu, Kaijun Wu, Xizhang Gong

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.21-30

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Spreading activation theory is an important theory for human reasoning. It is significant to study this theory for finding how human minds differ and superior to machines in many fields. To study process based spreading and activation, a process based model named SCO was set up according spreading activation theory in this paper. Emergency, efficiency and termination of spreading activation is carried out based on this model. To analyze the soaking process, the model was applied to several path finding problems. The result showed how spreading activation inspired methods superior to traditional searching methods in complicated tasks and muddy tasks.

4

Design PID Estimator Fuzzy Plus Backstepping to Control of Uncertain Continuum Robot

Omid Reza Sadrnia, Farzin Piltan, Mahdi Jafari, Mehdi Eram, Mohammad Shamsodini

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.31-48

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The increasing demand for multi-degree-of-freedom (DOF) continuum robot in presence of highly nonlinear dynamic parameters in a number of industries has motivated a flurry of research in the development of soft computing nonlinear methodology. Compared to conventional robotic manipulators that offer the same motion capabilities, the innovative continuum robot possesses several advantages. Not only can the continuum robot flexible, it has a large range of motion with no singularities in its workspace. This research contributes to the on-going research effort by exploring alternate methods for controlling the continuum robot manipulator. This research addresses two basic issues related to the control of a continuum robots; (1) a more accurate nonlinear controller based on backstepping methodology, and (2) the design of a robust feedback linear plus nonlinear estimator to estimate the highly nonlinear parameters. The robust backstepping controller proposed in this research is used to further demonstrate the appealing features exhibited by the continuum robot. Robust feedback controller is used to position control of continuum robot in presence of uncertainties. Using Lyapunov type stability arguments, a robust backstepping controller is designed to achieve this objective. The Proportional Integral Derivative (PID) plus fuzzy estimator is used to solution uncertainty problem. The fuzzy model free problem is formulated to minimize the nonlinear formulation of continuum robot. The eventual stability of the controller depends on the torque generating capabilities of the continuum robots.

5

An efficient, smart, energy-saving automated container terminal (ACT) scheme is introduced in this paper, in which one three-dimensional container distribution system is proposed between crane yard and storage yard. In this scheme, container vehicle-low bridge coupled vibration greatly affects the ACT’s structural safety and handling efficiency. Firstly, the coupled vibration time-domain responses, inspired by self-excitation including track irregularity and hunting movement as well as environmental (wind and seismic) load, were obtained by using free-interface component mode synthesis (CMS) method. The relationship of response and vehicle speed, wind velocity and ground motion intensity was studied as well. Accordingly, the structural safety, running safety and stationarity were assessed by indicators such as deflection-span ratio, vibration acceleration, wheel-rail relative displacement, etc. The container vehicle speed limits of the low bridge rigid supported or lead rubber bearing (LRB) supported under seismic and operational wind load were compared. The results of model test and prototype simulation prove with each other, which validates LRB’s effects on vibration isolation and absorption, thus can increase ground motion intensity and vehicle speed thresholds to structural safety.

6

Square over Finite Field GF(2n) using Self-Assembly of DNA Tiles

Yongnan Li, Limin Xiao, Li Ruan, Ke Xie, Guangchao Yao

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.63-70

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The tile assembly model is a highly distributed parallel model of molecular computation. Plenty of experiments have proved that the simple binary arithmetic could be fulfilled by the process of self-assembly of DNA (deoxyribonucleic acid) tiles. Finite field GF(2n) is one of the most commonly used mathematic sets. A DNA computing system was designed based on the tile assembly model and applied to perform the operation of square over finite field GF(2n). One concrete example is proposed to show the details of our tile assembly system.

7

Parameterization of Some Surfaces of Revolution Through Curvature-Varying Curves: A Computational Analysis

Andre´s Iglesias, R. Velezmoro, R. Ipanaque

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.71-82

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

This paper describes a computational analysis of various parameterizations of a surface of revolution. The idea is to generate the parameterization of the surface by using different (not necessarily planar) curves with varying curvature. The approach to the practical case of obtaining the parameterization of a torus through different planar curves other than circles, such as planar lemniscates. The analysis is also extended to the interesting case of non-planar curves. Our work relies on the intensive use of Mathematica, a powerful computational system very well suited for symbolic calculations while also providing valuable numerical and graphical options, a user-friendly graphical interface and a compact and efficient programming language. All calculations in this paper have been carried out with Mathematica v8.0.

8

A Quick String Matching Employing Mixing Up

Tianlong Yang, Hongli Zhang

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.83-94

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Most of the current string matching algorithms behave slowly when the amount of patterns increases. In this paper a fast matching algorithm named SSEMatch was designed. PHADDW instruction from SSE (Streamed SIMD Extension) set was used in SSEMatch to produce data confusion, by which the patterns can be distributed into pseudo hash address such that there will be less patterns left for verification matching. With the help of PHADDW, the whole matching time was reduced. Our SSEMatch holds a O(n/m) complexity. Experiment shows that similarly to WM algorithm, SSEMatch performs better when the length of the shortest pattern increases. Also when the amount of patterns increases SSEMatch performs better than WM.

9

Design of Wheat Drought Index Insurance in Shandong Province

Cao Jie, Yang Li, Li Sijia

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.95-104

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Agro-meteorological index insurance can transfer the risks in the agricultural production, reduce the farmers' economic losses, and promote a sustainable development of agricultural production. However, traditional agricultural insurance with a single rate has the problems of the presence of adverse selection, the difficulty of determining premium rates and assessing the claims. As a new agricultural insurance product, weather index insurance, is based on the objective meteorological data, and it can determine the fee rates, make up for the damages, lower costs and make the claims more efficient .Thus, the paper establishes the wheat drought index which combines the precipitation anomaly percentage indicators with the growth characteristics of wheat in Shandong Province. Then, according to the meteorological data and wheat yields date of 17 cities of Shandong Province in 1981-2010, the paper analyzes the relationship between wheat drought and wheat production rate. Finally, this paper designs the wheat drought index insurance in Shandong Province which can provide a reference for the research and development of the policy agricultural insurance.

10

Min-max Vehicle Routing Problem Based on Ant Colony Algorithm

Lingxia Liu, Qiang Song

보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.6 No.4 2013.07 pp.105-116

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends strongly on the given parameter values, these parameters include expectation heuristic factor, choice probability, level of pheromone persistence, and the number of ants, are self-adaptive at different stages in the course of algorithm execution, which help to accelerate convergence and enhance the searching around optimal solution, as well as to guarantee the diversity of solution to avoid falling into local optimization. Seven classical instances are tested for min-max vehicle routing problem; the results demonstrate that max-min ant system with parameter adaptation has high effectiveness, fast convergence speed, and robustness in solving these problems.

 
페이지 저장