Computing maximal-exponent factors in an overlap-free word

The exponent of a word is the quotient of its length over its smallest period. The exponent and the period of a word can be computed in time proportional to the word length. We design an algorithm to compute the maximal exponent of all factors of an overlap-free word. Our algorithm runs in linear-time on a fixed-size alphabet, while a naive solution of the question would run in cubic time. The solution for non-overlap-free words derives from algorithms to compute all maximal repetitions, also called runs, occurring in the word.We also show there is a linear number of occurrences of maximal-exponent factors in an overlap-free word. Their maximal number lies between 0.66n and 2.25n in a word of length n. The algorithm can additionally locate all of them in linear time.     

Prevalence and personality correlates of Facebook bullying among university undergraduates

The purpose of the present study was to examine the prevalence of cyber-bullying through Facebook in a sample of 226 Greek university undergraduates, and to explore whether big five personality characteristics, narcissism, as well as attitudes toward Facebook, technological knowledge and skills were predictive of such behavior. Participants completed a self-report questionnaire measuring the above constructs. Results indicated that almost one third of the sample reported Facebook bullying engagement at least once during the past month, with male students reporting more frequent involvement than females. Bullying through Facebook was predicted by low Agreeableness and more time spent on Facebook only for males, whereas for females none of the studied variables predicted engagement in Facebook bullying. Findings are discussed in terms of prevention and intervention strategies.     

基于模糊辨识算法的蓄电池荷电状态测量方法与模块设计

针对蓄电池荷电状态在线监测中对准确度和测量速度的要求,本文提出采用模糊辨识算法对蓄电池进行系统辨识。并通过对蓄电池的荷电状态与内阻、端电压数据的分析,建立了蓄电池荷电状态的模糊规则模型,并以此进行蓄电池荷电状态的测量,得到均方误差为0.0052。测量结果表明基于模糊辨识算法的蓄电池荷电状态测量能够满足蓄电池在线监测的要求,且易于硬件实现。文章还使用DSP Builder设计了蓄电池荷电状态测量模块,其中内阻测量采用了特征分解谱估计的信号提取方法,荷电状态测量则实现了模糊辨识算法所得出的模糊规则模型的运用。     

一种基于ZSP800核改进型LMS自适应滤波算法的实现

针对手机终端语音降噪处理系统中,广泛使用计算复杂度较小的固定步长LMS（Least Mean Square）自适应滤波算法。本文提出一种通过建立步长因子μ（n）和误差信号e（n）非线性函数关系,进而把固定步长LMS自适应算法改进为新的变步长自适应滤波算法,较好地解决了固定步长因子无法解决收敛速度和稳态误差之间相矛盾的不足。最后,给出了改进型算法在ZSP800核数字信号处理器（DSP）上的实现方法。     

基于虚拟静态锚节点的加权质心定位算法术

加权质心定位算法的实施需要布置较多的锚节点,较大的硬件成本限制了该算法在实际中的应用。本文结合余弦定理,利用原有的少量锚节点定位信息构造出虚拟静态锚节点VSAN（Virtual Static Anchor Node）参与定位,降低了该定位算法所需的硬件成本;此外,对加权质心算法进行数学推导和分析,从导数的角度阐述了权重系数和RSSI测距对加权质心算法的影响。仿真结果表明,基于VSAN的加权质心算法所需布置锚节点较少、定位精度较高;并通过实际环境下测试,验证了算法的有效性和可行性。     

电能质量分析中的FFT算法的改进与实现

电能质量分析中要求 算法具有更高的效率,而传统 算法在进行蝶形运算之前需要倒序排列,会产生较大的时间开销,本文提出了一种不需倒序的FFT算法,避免了地址倒序所带来的时间效率的开销。通过C语言实现了该算法,与Matlab自带的FFT算法进行了对比,仿真结果表明该算法是正确而高效的。     

基于P2P的网络流媒体系统及其自适用算法研究

G-N系统是基于P2P模式构建一种拓扑结构,采用节点自适应算法,更好地处理节点与其相邻节点之间的关系,并能够充分利用节点的异构能力,维持更多的连接,获得更多的相关资源。     

Simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection

Tolerance specification is an important part of mechanical design. Design tolerances strongly influence the functional performance and manufacturing cost of a mechanical product. Tighter tolerances normally produce superior components, better performing mechanical systems and good assemblability with assured exchangeability at the assembly line. However, unnecessarily tight tolerances lead to excessive manufacturing costs for a given application. The balancing of performance and manufacturing cost through identification of optimal design tolerances is a major concern in modern design. Traditionally, design tolerances are specified based on the designer’s experience. Computer-aided (or software-based) tolerance synthesis and alternative manufacturing process selection programs allow a designer to verify the relations between all design tolerances to produce a consistent and feasible design. In this paper, a general new methodology using intelligent algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection is presented. The problem has a multi-criterion character in which 3 objective functions, 3 constraints and 5 variables are considered. The average fitness factor method and normalized weighted objective functions method are separately used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed.     

A fast MATLAB program to estimate the multifractal spectrum of multidimensional data: Application to fractures

A MATLAB^® program based on the Hou algorithm for estimation of fractal dimension and multifractal spectrum of fractures is presented. The program performance was tested with many synthetical fractals and field data. Interpolation and sampling effects on the fractal dimension and multifractal spectrum estimation were also studied. Some common problems related to the fractal dimension and multifractal spectrum are also discussed.     

Complexity and design of QoS routing algorithms in wireless mesh networks

Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs.