检索结果-内蒙古大学图书馆

Finding Robust Assailant Using Optimization Functions (FiRAO-PG) in Wireless Sensor Network

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-7页

作者： Shukla, Piyush Kumar Goyal, Sachin Wadhvani, Rajesh Rizvi, M. A. Sharma, Poonam Tantubay, Neeraj RGPV UIT Dept Comp Sci & Engn Bhopal India RGPV UIT Dept Informat Technol Bhopal India MANIT Dept Informat Technol Bhopal India NITTTR Dept Comp Engn & Applicat Bhopal India MITS Dept Comp Sci & Informat Technol Gwalior India

Wireless sensor network consists of hundreds or thousands of low cost, low power, and self-organizing tiny sensor nodes that are deployed within the sensor network. Sensor network is susceptible to physical attacks due to deprived power and restricted resource capability and is exposed to external environment for transmitting and receiving data. Node capture attack is one of the most menacing attack in the wireless sensor network and may be physically captured by an adversary for extracting confidential information regarding cryptographic keys, node's unique id, and so forth, from its memory to eliminate the confidentiality and integrity of the wireless links. Node capture attack suffers from severe security breach and tremendous network cost. We propose an empirically designed multiple objectives node capture attack algorithm based on optimization functions as an effective solution against the attacking efficiency of node capture attack. Finding robust assailant optimization-particle swarm optimization and genetic algorithm (FiRAO-PG) consists of multiple objectives: maximum node participation, maximum key participation, and minimum resource expenditure to find optimal nodes using PSO and GA. It will leverage a comprehensive tool to destroy maximum portion of the network realizing cost-effectiveness and higher attacking efficiency. The simulation results manifest that FiRAO-PG can provide higher fraction of compromised traffic than matrix algorithm (MA) so the attacking efficiency of FiRAO-PG is higher.

关键词： ROBUST control MATHEMATICAL optimization FUNCTIONS (Mathematics) WIRELESS sensor networks DATA transmission systems computer algorithms

来源：评论

学校读者我要写书评

暂无评论

SCALED SELF-ORGANIZING MAP - HIDDEN MARKOV MODEL ARCHITECTURE FOR BIOLOGICAL SEQUENCE CLUSTERING

引用

APPLIED ARTIFICIAL INTELLIGENCE 2013年第6期27卷 461-495页

作者： Ferles, Christos Siolas, Georgios Stafylopatis, Andreas Natl Tech Univ Athens Sch Elect & Comp Engn Intelligent Syst Lab Athens 15780 Greece

The self-organizing hidden Markov model map (SOHMMM) introduces a hybrid integration of the self-organizing map (SOM) and the hidden Markov model (HMM). Its scaled, online gradient descent unsupervised learning algorithm is an amalgam of the SOM unsupervised training and the HMM reparameterized forward-backward techniques. In essence, with each neuron of the SOHMMM lattice, an HMM is associated. The image of an input sequence on the SOHMMM mesh is defined as the location of the best matching reference HMM. Model tuning and adaptation can take place directly from raw data, within an automated context. The SOHMMM can accommodate and analyze deoxyribonucleic acid, ribonucleic acid, protein chain molecules, and generic sequences of high dimensionality and variable lengths encoded directly in nonnumerical/symbolic alphabets. Furthermore, the SOHMMM is capable of integrating and exploiting latent information hidden in the spatiotemporal dependencies/correlations of sequences' elements.

关键词： CLUSTER analysis (Statistics) computer algorithms SELF-organizing maps HIDDEN Markov models SEQUENCES (Mathematics) HYBRID systems MACHINE learning

来源：评论

学校读者我要写书评

暂无评论

Stability analysis of iterative optimal control algorithms modelled as linear unit memory repetitive processes

引用

IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS 2000年第3期147卷 229-238页

作者： Roberts, PD City Univ London Dept Elect Elect & Informat Engn London EC1Y 0HB England

The theory of unit memory repetitive processes is used to investigate local convergence and stability properties of algorithms fbr the solution of discrete optimal control problems. in particular, the properties are addressed of a method for finding the correct solution of an optimal control problem where the model used for optimisation is different from reality. Limit profile and stability concepts of unit memory linear repetitive process theory are employed to demonstrate optimality and to obtain necessary and sufficient conditions for convergence. Two main stability theorems are obtained from different approaches and their equivalence is proved: The theoretical results are verified through simulation and numerical analysis, and it is demonstrated that repetitive process theory provides a useful tool for the analysis of iterative algorithms for the solution of dynamic optimal control problems.

关键词： Stability analysis linear unit Repetitive Optimal control computer algorithms optimality Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Health Assessment Approach for Shearer Based on Artificial Immune Algorithm

引用

COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2016年第1期2016卷 1-13页

作者： Wang, Zhongbin Xu, Xihua Si, Lei Ji, Rui Liu, Xinhua Tan, Chao China Univ Min & Technol Sch Mech Engn Xuzhou 221116 Peoples R China China Univ Min & Technol Sch Informat & Elect Engn Xuzhou 221116 Peoples R China China Univ Min & Technol Xuyi Mine Equipment & Mat R&D Ctr Huaian 223001 Peoples R China

In order to accurately identify the dynamic health of shearer, reducing operating trouble and production accident of shearer and improving coal production efficiency further, a dynamic health assessment approach for shearer based on artificial immune algorithm was proposed. The key technologies such as system framework, selecting the indicators for shearer dynamic health assessment, and health assessment model were provided, and the flowchart of the proposed approach was designed. A simulation example, with an accuracy of 96%, based on the collected data from industrial production scene was provided. Furthermore, the comparison demonstrated that the proposed method exhibited higher classification accuracy than the classifiers based on back propagation-neural network (BP-NN) and support vector machine (SVM) methods. Finally, the proposed approach was applied in an engineering problem of shearer dynamic health assessment. The industrial application results showed that the paper research achievements could be used combining with shearer automation control system in fully mechanized coal face. The simulation and the application results indicated that the proposed method was feasible and outperforming others.

关键词： IMMUNOcomputerS computer algorithms COAL products FLOW charts computer simulation INDUSTRIAL productivity

来源：评论

学校读者我要写书评

暂无评论

Modeling and closed-loop control of stretch bending of aluminum rectangular tubes

引用

JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME 2003年第1期125卷 113-119页

作者： Zhu, H Stelson, KA Univ Minnesota Dept Mech Engn Minneapolis MN 55455 USA

During stretch bending, considerable springback will occur after a tube has been plastically bent. To predict the springback, a simplified two-flange model for stretch bending of a rectangular tube has been developed in which the strain history has been considered. A comparison has been made between the springback predicted by this model and experimental data, which shows rough agreement. Based on this model, a real time closed-loop control algorithm is developed.

关键词： control ring tension bending Springback deformation (geologic) computer algorithms Modeling rectangular pipe

来源：评论

学校读者我要写书评

暂无评论

Intelligibility of time-compressed speech: The effect of uniform versus non-uniform time-compression algorithms

引用

JOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA 2014年第3期135卷 1541-1555页

作者： Schlueter, Anne Lemke, Ulrike Kollmeier, Birger Holube, Inga Jade Univ Appl Sci Inst Hearing Technol & Audiol D-26121 Oldenburg Germany Phonak AG Sci & Technol CH-8712 Stafa Switzerland Carl von Ossietzky Univ Oldenburg Inst Phys D-26111 Oldenburg Germany Carl von Ossietzky Univ Oldenburg Cluster Excellence Hearing4all D-26111 Oldenburg Germany

For assessing hearing aid algorithms, a method is sought to shift the threshold of a speech-in-noise test to (mostly positive) signal-to-noise ratios (SNRs) that allow discrimination across algorithmic settings and are most relevant for hearing-impaired listeners in daily life. Hence, time-compressed speech with higher speech rates was evaluated to parametrically increase the difficulty of the test while preserving most of the relevant acoustical speech cues. A uniform and a non-uniform algorithm were used to compress the sentences of the German Oldenburg Sentence Test at different speech rates. In comparison, the non-uniform algorithm exhibited greater deviations from the targeted time compression, as well as greater changes of the phoneme duration, spectra, and modulation spectra. Speech intelligibility for fast Oldenburg sentences in background noise at different SNRs was determined with 48 normal-hearing listeners. The results confirmed decreasing intelligibility with increasing speech rate. Speech had to be compressed to more than 30% of its original length to reach 50% intelligibility at positive SNRs. Characteristics influencing the discrimination ability of the test for assessing effective SNR changes were investigated. Subjective and objective measures indicated a clear advantage of the uniform algorithm in comparison to the non-uniform algorithm for the application in speech-in-noise tests. (C) 2014 Acoustical Society of America.

关键词： HEARING aids MATHEMATICAL models SIGNAL-to-noise ratio SPEECH perception -- Research computer algorithms PHONEMICS -- Research

来源：评论

学校读者我要写书评

暂无评论

The lazy adversary conjecture fails

引用

THEORY OF COMPUTING SYSTEMS 2004年第3期37卷 397-403页

作者： Peserico, E MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

In the context of competitive analysis of online algorithms for the k-server problem, it has been conjectured that every randomized, memoryless online algorithm exhibits the highest competitive ratio against an offline adversary that is lazy, i.e., that will issue requests forcing it to move one of its own servers only when this is strictly necessary to force a move on the part of the online algorithm. We prove that, in general, this lazy adversary conjecture fails. Moreover, it fails in a very strong sense: there are adversaries which perform arbitrarily better than any other adversary which is even slightly "lazier."

关键词： algorithms ONLINE data processing ONLINE algorithms computer algorithms ELECTRONIC data processing computerS

来源：评论

学校读者我要写书评

暂无评论

Random Forest with Adaptive Local Template for Pedestrian Detection

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Xiang, Tao Li, Tao Ye, Mao Liu, Zijian Univ Elect Sci & Technol China Ctr Robot Sch Engn & Comp Sci Chengdu 611731 Peoples R China Chongqing Jiaotong Univ Chongqing 400074 Peoples R China

Pedestrian detection with large intraclass variations is still a challenging task in computer vision. In this paper, we propose a novel pedestrian detection method based on Random Forest. Firstly, we generate a few local templates with different sizes and different locations in positive exemplars. Then, the Random Forest is built whose splitting functions are optimized by maximizing class purity of matching the local templates to the training samples, respectively. To improve the classification accuracy, we adopt a boosting-like algorithm to update the weights of the training samples in a layer-wise fashion. During detection, the trained Random Forest will vote the category when a sliding window is input. Our contributions are the splitting functions based on local template matching with adaptive size and location and iteratively weight updating method. We evaluate the proposed method on 2 well known challenging datasets: TUD pedestrians and INRIA pedestrians. The experimental results demonstrate that our method achieves state-of-the-art or competitive performance.

关键词： RANDOM forest (algorithms) ADAPTIVE control systems computer vision computer algorithms ITERATIVE methods (Mathematics) MATCHING theory

来源：评论

学校读者我要写书评

暂无评论

Theoretical modelling of the storage energy envelope of high frequency AC reactive components to predict chaos boundary

引用

IET POWER ELECTRONICS 2015年第6期8卷 938-946页

作者： Xu, Cui Dong Cheng, Ka Wai Eric Liu, Jun Feng Ding, Kai Hong Kong Polytech Univ Dept Elect Engn Hong Kong Hong Kong Peoples R China

The storage energy of high frequency reactive component for the switched mode power converter is a new factor to assess the performance. The instability of the switched-mode converter under the peak current control mode is examined for its storage energy. Bifurcation and chaos of the storage energy in the inductor and capacitor are observed based on the stroboscopic map. The boundary of maximum storage energy is given to be an alternative to study the instability of the system in this study. Zero energy is obtained in stable period 1 and the storage energy with the same value and opposite direction is obtained in period 2. The simulation results of bifurcation and chaos of energy are obtained under different parameters and verified by experiment. The boundary of instability of energy stored in the reactive component under various parameters is formulated and a single equation can be used to indicate the factors. These results can provide a new guideline to design a stable system and provide a new control algorithm for power electronic system.

关键词： Electronic systems Theoretical Models Control modes energy storage chaos stroboscopic computer algorithms stabilization system BIFURCATION reactive component

来源：评论

学校读者我要写书评

暂无评论

Image Watermark Based on Extended Shearlet and Insertion Using the Largest Information Entropy on Horizontal Cone

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-10页

作者： Zhao Jian Sun Meiling Jia Jian Huang Luxi Han Fan Liu Shan NW Univ Xian Sch Informat Sci & Technol Xian 710069 Peoples R China NW Univ Xian Sch Math Sci Xian 710069 Peoples R China

Extended discrete shearlet provides a directional multiresolution decomposition. It has been mathematically shown that extended discrete shearlet is a more efficient representation for the signals containing distributed discontinuities such as edges, compared to discrete wavelet. Multiresolution analyses such as curvelet and ridgelet share similar properties, yet their directional representations are significantly different from that of extended discrete shearlet. Taking advantage of the unique properties of directional representation of extended discrete shearlet, we develop an image watermark algorithm based on the largest information entropy. In proposed algorithm, firstly, 1-level extended discrete shearlet transform decomposes the test image into directional components on horizontal cone;each directional component reflects directional features and textured features differently. Next, the directional component whose information entropy is the highest is selected to carry watermark. Compared with related algorithms based on DWT and DCT, the proposed algorithm tends to obtain preferable invisibility when it is robust against common attacks.

关键词： ENTROPY (Information theory) WATERMARKS ROBUST control DISCRETE wavelet transforms computer algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：