The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 pa...The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 participants, 39 undergraduate students (novice users) and 25 graduate students (intermediate-level users) participated in the study. The experimental design was 2 × 2 × 2 × 3 mixed design using two between-subject variables (display complexity, user experience) and two within-subject variables (display format, question difficulty). The results indicated that response time was superior for graphs (relative to tables), especially when the questions were difficult. The intermediate users seemed to adopt more extensive search strategies than novices, as revealed by an analysis of the number of changes they made to the display prior to answering questions. It was concluded that designers of data displays should consider the (a) type of display, (b) difficulty of the task, and (c) expertise level of the user to obtain optimal levels of performance.展开更多
By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The ...By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.展开更多
A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley cha...A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley characteristic of half-pixel error matching function inside search grid, the minimum distortion direction is predicted with the help of comparative results of sum of absolute difference(SAD) values of four integer-pixel points around integer-pixel motion vector. The experimental results reveal that, to all kinds of video sequences, the proposed algorithm can obtain almost the same video quality as that of the half-pixel full search algorithm with a decrease of computation cost by more than 66%.展开更多
In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting....In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner programming problems, describe relations between results for every pair of successive evaluations of function f in parallel. Properties of optimal search strategies are derived from these equations. The worst-case complexity analysis shows that, if the maximizer is located on a priori unknown interval (n-1], then it can be detected after cp(n)=「2log「p/2」+1(n+1)」-1 parallel evaluations of f(x), where p is the number of processors.展开更多
针对将连续域蚁群优化算法应用于最大似然(maximum likelihood,ML)估计中存在计算量过大的问题,提出一种基于改进蚁群优化(modified ant colony optimization,MACO)算法的最大似然波达方向(maximum likelihood direction of arrival,ML-...针对将连续域蚁群优化算法应用于最大似然(maximum likelihood,ML)估计中存在计算量过大的问题,提出一种基于改进蚁群优化(modified ant colony optimization,MACO)算法的最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计方法.采用精英反向学习策略获得较优初始解群体,结合全局跨邻域搜索和高斯核函数局部搜索对蚁群的寻优方式进行优化,扩大了算法的搜索空间并加快了收敛速度,最终得到ML估计方法的非线性全局最优解.仿真结果表明,与基于粒子群优化(particle swarm optimization,PSO)算法、蚁群优化(ant colony optimization,ACO)算法的ML估计方法相比,ML-MACO算法的收敛速度是ML-ACO算法的4倍,计算量是ML-ACO算法的1/3,分辨成功率高于ML-PSO算法和ML-ACO算法,估计误差小于ML-PSO算法和ML-ACO算法.ML-MACO算法以更低的计算量保持了ML算法的优良估计性能,收敛性能更优且估计精度更高.展开更多
基金4 Acknowledgements The author would like to thank G.L. Long for very helpful discussion, and thank J.Q. Yi for his generous help in plotting the function figures.
文摘The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 participants, 39 undergraduate students (novice users) and 25 graduate students (intermediate-level users) participated in the study. The experimental design was 2 × 2 × 2 × 3 mixed design using two between-subject variables (display complexity, user experience) and two within-subject variables (display format, question difficulty). The results indicated that response time was superior for graphs (relative to tables), especially when the questions were difficult. The intermediate users seemed to adopt more extensive search strategies than novices, as revealed by an analysis of the number of changes they made to the display prior to answering questions. It was concluded that designers of data displays should consider the (a) type of display, (b) difficulty of the task, and (c) expertise level of the user to obtain optimal levels of performance.
文摘蛋白质复合物的检测有助于从分子水平上理解生命的活动过程。针对群智能算法检测蛋白质复合物时假阳/阴性率高、准确率低、种群多样性下降等问题,提出了基于强化学习的离散层级萤火虫算法检测蛋白质复合物(reinforcement learning-based discrete level firefly algorithm for detecting protein complexes,RLDLFA-DPC)。引入强化学习思想提出一种自适应层级划分策略,动态调整层级结构,能有效解决迭代后期种群多样性下降的问题。在层级学习策略中个体向两个优秀层级学习,避免算法陷入局部最优。为了提高蛋白质复合物检测的精度,结合个体环境信息提出自适应搜索半径的局部搜索策略。最后,在酵母蛋白质的4个数据集上,与8种经典的蛋白质复合物检测方法进行对比,验证了该方法的有效性。
基金Project supported by the grant from City University of Hong Kong (Grant No. 7008105)
文摘By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.
基金The authors appreciate the project support from China Scholarship Council, and the National Natural Science Foundation of China (51579143, 51379121, 61304230), Shanghai Shuguang Plan Project (No: 15SG44) and China Postdoctoral Foundation (No. 2015M581585).
文摘A minimum distortion direction prediction-based novel fast half-pixel motion vector search algorithm is proposed, which can reduce considerably the computation load of half-pixel search. Based on the single valley characteristic of half-pixel error matching function inside search grid, the minimum distortion direction is predicted with the help of comparative results of sum of absolute difference(SAD) values of four integer-pixel points around integer-pixel motion vector. The experimental results reveal that, to all kinds of video sequences, the proposed algorithm can obtain almost the same video quality as that of the half-pixel full search algorithm with a decrease of computation cost by more than 66%.
文摘In this paper we consider a parallel algorithm that detects the maximizer of unimodal function f(x) computable at every point on unbounded interval (0, ∞). The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner programming problems, describe relations between results for every pair of successive evaluations of function f in parallel. Properties of optimal search strategies are derived from these equations. The worst-case complexity analysis shows that, if the maximizer is located on a priori unknown interval (n-1], then it can be detected after cp(n)=「2log「p/2」+1(n+1)」-1 parallel evaluations of f(x), where p is the number of processors.
文摘针对将连续域蚁群优化算法应用于最大似然(maximum likelihood,ML)估计中存在计算量过大的问题,提出一种基于改进蚁群优化(modified ant colony optimization,MACO)算法的最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计方法.采用精英反向学习策略获得较优初始解群体,结合全局跨邻域搜索和高斯核函数局部搜索对蚁群的寻优方式进行优化,扩大了算法的搜索空间并加快了收敛速度,最终得到ML估计方法的非线性全局最优解.仿真结果表明,与基于粒子群优化(particle swarm optimization,PSO)算法、蚁群优化(ant colony optimization,ACO)算法的ML估计方法相比,ML-MACO算法的收敛速度是ML-ACO算法的4倍,计算量是ML-ACO算法的1/3,分辨成功率高于ML-PSO算法和ML-ACO算法,估计误差小于ML-PSO算法和ML-ACO算法.ML-MACO算法以更低的计算量保持了ML算法的优良估计性能,收敛性能更优且估计精度更高.