期刊文献+
共找到172,420篇文章
< 1 2 250 >
每页显示 20 50 100
Constrained maximum weighted bipartite matching:a novel approach to radio broadcast scheduling
1
作者 Shaojiang WANG Tianyong WU +2 位作者 Yuan YAO Dongbo BU Shaowei CAI 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第7期156-169,共14页
Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete alg... Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete algorithm to solve the problem, which is based on a branch-and-bound(BnB) algorithm. We formulate the problem with a new model, called constrained maximum weighted bipartite matching(CMBM),i.e., the maximum matching problem on a weighted bipartite graph with constraints. For the reduced matching problem, we propose a novel BnB algorithm by introducing three new strategies, including the highest quality first, the least conflict first and the more edge first. We also establish an upper bound estimating function for pruning the search space of the algorithm. The experimental results show that our new algorithm can quickly find the optimal solution for the radio broadcast scheduling problem at small scales, and has higher scalability for the problems at large scales than the existing complete algorithm. 展开更多
关键词 RADIO broadcast scheduling BRANCH-AND-BOUND ALGORITHM CONSTRAINED MAXIMUM WEIGHTED bipartite matching Kuhn-Munkres ALGORITHM strategy combinations
Cloud Classification and Distribution of Cloud Types in Beijing Using Ka-Band Radar Data 预览
2
作者 Juan HUO Yongheng BI +1 位作者 Daren LU Shu DUAN 《大气科学进展:英文版》 SCIE CAS CSCD 2019年第8期793-803,共11页
A cloud clustering and classification algorithm is developed for a ground-based Ka-band radar system in the vertically pointing mode. Cloud profiles are grouped based on the combination of a time–height clustering me... A cloud clustering and classification algorithm is developed for a ground-based Ka-band radar system in the vertically pointing mode. Cloud profiles are grouped based on the combination of a time–height clustering method and the k-means clustering method. The cloud classification algorithm, developed using a fuzzy logic method, uses nine physical parameters to classify clouds into nine types: cirrostratus, cirrocumulus, altocumulus, altostratus, stratus, stratocumulus, nimbostratus,cumulus or cumulonimbus. The performance of the clustering and classification algorithm is presented by comparison with all-sky images taken from January to June 2014. Overall, 92% of the cloud profiles are clustered successfully and the agreement in classification between the radar system and the all-sky imager is 87%. The distribution of cloud types in Beijing from January 2014 to December 2017 is studied based on the clustering and classification algorithm. The statistics show that cirrostratus clouds have the highest occurrence frequency(24%) among the nine cloud types. High-level clouds have the maximum occurrence frequency and low-level clouds the minimum occurrence frequency. 展开更多
关键词 CLOUDS CLUSTERING ALGORITHM classification ALGORITHM RADAR CLOUD type
在线阅读 下载PDF
Target Tracking Algorithm Based on Meanshift and Kalman Filter 预览
3
作者 Hua Li Jia Zhu 《北京理工大学学报:英文版》 EI CAS 2019年第2期365-370,共6页
Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalma... Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference. 展开更多
关键词 TARGET TRACKING MEANSHIFT ALGORITHM KALMAN ALGORITHM
在线阅读 免费下载
Experimental investigation and optimization of weld bead characteristics during submerged arc welding of AISI 1023 steel 预览
4
作者 Ankush Choudhary Manoj Kumar Deepak Rajendra Unune 《Defence Technology(防务技术)》 CAS CSCD 2019年第1期72-82,共11页
Submerged arc welding(SAW),owing to its high deposition rate and high welding quality,is widely used in the fabrication of pressure vessel,marine vessel,pipelines and offshore structures.However,selection of an optimu... Submerged arc welding(SAW),owing to its high deposition rate and high welding quality,is widely used in the fabrication of pressure vessel,marine vessel,pipelines and offshore structures.However,selection of an optimum combination of welding parameters is critical in achieving high weld quality and productivity.In this work,initially,the SAWexperiments were performed using fractional factorial design to analyze the effect of direct and indirect input parameters,namely,welding voltage,wire feed rate,welding speed,nozzle to plate distance,flux condition,and plate thickness on weld bead geometrical responses viz.bead width,reinforcement,and penetration.The bead on plate technique was used to deposit weld metal on AISI 1023 steel plates.The effect of SAW input parameters on response variables were analyzed using main and interaction effects.The linear regression was used to develop the mathematical models for the response variable.Then,the multi-objective optimization of input parameters was carried out using desirability approach,genetic algorithm and Jaya algorithm.The Jaya algorithm offered better optimization results as compared to desirability approach,genetic algorithm. 展开更多
关键词 SUBMERGED ARC welding Optimization Regression GENETIC ALGORITHM Jaya ALGORITHM
在线阅读 免费下载
Application of Genetic Algorithm in Estimation of Gyro Drift Error Model
5
作者 LI Dongmei BAI Taixun +1 位作者 HE Xiaoxia ZHANG Rong 《中国航天:英文版》 2019年第1期3-8,共6页
Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The ... Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The grid optimization method is always used to find proper initial matrix for off-line estimation.However,the grid method has the draw back being time consuming hence,coarse grid followed by a fine grid method is adopted.To further improve efficiency without the loss of estimation accuracy,we propose a genetic algorithm for the coarse grid optimization in this paper.It is recognized that the crossover rate and mutation rate are the main influencing factors for the performance of the genetic algorithm,so sensitivity experiments for these two factors are carried out and a set of genetic algorithm parameters with good adaptability were selected by testing with several gyros’experimental data.Experimental results show that the proposed algorithm has higher efficiency and better estimation accuracy than the traversing grid algorithm. 展开更多
关键词 genetic ALGORITHM traversing GRID ALGORITHM coarse GRID optimization GYRO DRIFT error model CROSSOVER RATE and mutation RATE selecting
A-STC: auction-based spanning tree coverage algorithm for motion planning of cooperative robots
6
作者 Guan-qiang GAO Bin XIN 《信息与电子工程前沿:英文版》 SCIE EI CSCD 2019年第1期18-31,共14页
The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line alg... The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the 'auction-based spanning tree coverage(A-STC)' algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes’ relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces. 展开更多
关键词 COVERAGE motion planning MULTI-ROBOT system AUCTION ALGORITHM SPANNING tree COVERAGE ALGORITHM
算法在市场竞争中的应用与法律难题——从大数据杀熟谈起 预览
7
作者 沈亮亮 《太原学院学报:社会科学版》 2019年第3期26-31,共6页
随着算法在市场中的应用逐渐扩大与深入,算法导致的价格共谋、数据垄断、算法作恶等问题开始渐渐显露,在算法社会,如何解决这些问题、法律能发挥多大效用需要继续探讨。
关键词 算法 大数据杀熟 价格共谋 算法作恶
在线阅读 免费下载
Analysis of an improved trajectory correction scheme based on mass blocks 预览
8
作者 LEI Xiaoyun ZHANG Zhian DU Zhonghua 《系统工程与电子技术:英文版》 SCIE EI CSCD 2019年第1期180-190,共11页
In conventional technical trajectory correction schemes, continuous attitude adjusting mechanisms, such as canards, are inferior in terms of response time and efficiency of executing instructions. Discontinuous attitu... In conventional technical trajectory correction schemes, continuous attitude adjusting mechanisms, such as canards, are inferior in terms of response time and efficiency of executing instructions. Discontinuous attitude adjusting mechanisms, such as the lateral pulse jet, have complex impact on the airflow layer of the projectile surface caused by the thrust vector jet flow. An improved two-dimensional trajectory correction mechanism is designed based on the principle of firing mass blocks by a tailor-made propellant. The mechanical properties of the thrust force (namely the correction force) is analyzed. The trajectory correction model is established to analyze the effects of correction starting moment and correction phase angle of a thrust force on the projectile's trajectory. According to the trajectory correction scheme, an improved genetic algorithm is employed to this work. The scheme is tested in the simulation. The results show that the correction scheme is effective to reduce target dispersion and increase the precision of the impact point. 展开更多
关键词 TRAJECTORY CORRECTION MASS block CORRECTION force CORRECTION control ALGORITHM GENETIC algorithm.
在线阅读 下载PDF
An Improved DV-Hop Localization Algorithm Based on Hop Distances Correction 预览
9
作者 Guiqi Liu Zhihong Qian Xue Wang 《中国通信:英文版》 SCIE CSCD 2019年第6期200-214,共15页
DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown ... DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node.So an improved DV-Hop localization algorithm based on correctional average size of a hop,HDCDV-Hop algorithm,is proposed.The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information,and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error.Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms. 展开更多
关键词 WSN DV-HOP localization ALGORITHM HOP Distance CORRECTION IMPROVED Differential Evolution ALGORITHM
在线阅读 下载PDF
基于遗传算法的带有调纵倾尾板及拦截器的滑行艇水动力性能评估及优化 预览
10
作者 Abdollah Sakaki Hassan Ghassemi Shayan Keyvani 《船舶与海洋工程学报:英文版》 CSCD 2019年第2期131-141,共11页
Nowadays,several stern devices are attracting a great deal of attention.The control surface is an effective apparatus for improving the hydrodynamic performance of planing hulls and is considered an important element ... Nowadays,several stern devices are attracting a great deal of attention.The control surface is an effective apparatus for improving the hydrodynamic performance of planing hulls and is considered an important element in the design of planing hulls.Control surfaces produce forces and a pitching moment due to the pressure distribution that they cause,which can be used to change the running state of high-speed marine boats.This work elaborates a new study to evaluate the hydrodynamic performance of a planing boat with a trim tab and an interceptor,and optimizes them by using an optimization algorithm.The trim tab and the interceptor have been used to optimize the running trim and motion control of semi-planing and planing boats at various speeds and sea conditions for many years.In this paper,the usage of trim tab is mathematically verified and experimental equations are utilized to optimize the performance of a planing boat at a specificd trim angle by using an optimization algorithm.The genetic algorithm(GA)is one of the most useful optimizing methods and is used in this study.The planing boat equations were programmed according to Savitsky’s equations and then analyzed in the framework of the GA-based optimization for performance improvement of theplaning hull.The optimal design of trim tab and interceptor for planing boat can be considered a multiobjective problem.The input data of GA include different parameters,such as speed,longitudinal center of gravity,and deadrise angle.We can extract the best range of forecasting the planing boat longitudinal center of gravity,the angle of the trim,and the least drag force at the best trim angle of the boat. 展开更多
关键词 Trimtab INTERCEPTOR Drag force Genetic ALGORITHM Optimization ALGORITHM
在线阅读 下载PDF
Algorithms for Handoff Minimization in Wireless Networks
11
作者 Mansoor Davoodi Esmaeil Delfaraz +1 位作者 Sajjad Ghobadi Mahtab Masoori 《计算机科学技术学报:英文版》 SCIE EI CSCD 2019年第4期887-900,共14页
This study focuses on the problem of handoff minimization for a set of users moving in a wireless network.This problem is analyzed by considering two cases for the user's movement under access point capacity const... This study focuses on the problem of handoff minimization for a set of users moving in a wireless network.This problem is analyzed by considering two cases for the user's movement under access point capacity constraints:1)all users move together,and 2)each user can have their chosen path within the network.In the first case,we propose an optimal competitive ratio algorithm for the problem.However,in the second case,having the connectivity assumption,that is,"if a user is connected to an access point so long that the received signal strength of the access point is not less than a specified threshold,the user should continue his/her connection",we prove that no approach can reduce the number of unnecessary handoffs in an offline setting.However,without connectivity assumption,we present an optimal deterministic algorithm with the competitive ratio of n?for this problem under online setting,where n is the number of users and?is the maximum number of access points which cover any single point in the environment.Also,we prove that the randomized version of the algorithm achieves an expected competitive ratio of O(log△). 展开更多
关键词 COMPETITIVE ratio HANDOFF MINIMIZATION OFFLINE ALGORITHM online ALGORITHM wireless network
Study on Railway Marshalling Scheduling Model and Algorithm of Enterprise Station 预览
12
作者 Jiawei Wen Gang Lu Nanshan Xu 《现代电子技术(英文)》 2019年第1期20-26,共7页
Railway marshalling transportation is a crucial part of enterprise production supply chain, with the development of national economy;enterprises face more and more pressure on station railway marshalling operation. Re... Railway marshalling transportation is a crucial part of enterprise production supply chain, with the development of national economy;enterprises face more and more pressure on station railway marshalling operation. Realizing enterprise railway dispatching plan automatically by computer, which can improve the level of the station scheduling and transport efficiency, at the same time can reduce the scheduling cost. Based on the basic rules of marshalling and dispatching of railway freight trains at enterprise stations, this paper investigates the site of special railway line at enterprise stations and establishes the space of dispatching state and regulation base according to the actual situation. The information feedback model is designed according to the train information, carriage information and real-time information of the track of the station. Based on the analysis of the railway regulation and the demand of the station, establish the scheduling rule method library. Based on the state space and feedback model of the station, using the scheduling rule method library, this paper designs an enterprise railway automatic marshalling algorithm with a certain universality, and realizes automatic train marshalling and scheduling operation. Considering the economic benefit of the station and the efficiency of the marshalling model, this paper introduces the time cost function and applies the improved greedy algorithm to optimize the automatic marshalling model, realizing the optimal marshalling of railway station in a short time. 展开更多
关键词 STATION RAILWAY MARSHALLING ALGORITHM GREEDY ALGORITHM SCHEDULING rule method library
在线阅读 免费下载
Design of a Proportional-Integral-Derivative Controller for an Automatic Generation Control of Multi-area Power Thermal Systems Using Firefly Algorithm 预览
13
作者 K.Jagatheesan B.Anand +3 位作者 Sourav Samanta Nilanjan Dey Amira S.Ashour Valentina E.Balas 《自动化学报:英文版》 CSCD 2019年第2期503-515,共13页
Essentially, it is significant to supply the consumer with reliable and sufficient power. Since, power quality is measured by the consistency in frequency and power flow between control areas. Thus, in a power system ... Essentially, it is significant to supply the consumer with reliable and sufficient power. Since, power quality is measured by the consistency in frequency and power flow between control areas. Thus, in a power system operation and control,automatic generation control(AGC) plays a crucial role. In this paper, multi-area(Five areas: area 1, area 2, area 3, area 4 and area 5) reheat thermal power systems are considered with proportional-integral-derivative(PID) controller as a supplementary controller. Each area in the investigated power system is equipped with appropriate governor unit, turbine with reheater unit, generator and speed regulator unit. The PID controller parameters are optimized by considering nature bio-inspired firefly algorithm(FFA). The experimental results demonstrated the comparison of the proposed system performance(FFA-PID)with optimized PID controller based genetic algorithm(GAPID) and particle swarm optimization(PSO) technique(PSOPID) for the same investigated power system. The results proved the efficiency of employing the integral time absolute error(ITAE) cost function with one percent step load perturbation(1 % SLP) in area 1. The proposed system based FFA achieved the least settling time compared to using the GA or the PSO algorithms, while, it attained good results with respect to the peak overshoot/undershoot. In addition, the FFA performance is improved with the increased number of iterations which outperformed the other optimization algorithms based controller. 展开更多
关键词 Automatic generation control(AGC) FIREFLY ALGORITHM GENETIC algorithm(GA) PARTICLE SWARM optimization(PSO) proportional-integral-derivative(PID) CONTROLLER
在线阅读 下载PDF
A Novel Improved Bird Swarm Algorithm for Solving Bound Constrained Optimization Problems
14
作者 WANG Yuhe WAN Zhongping PENG Zhenhua 《武汉大学学报:自然科学英文版》 CAS CSCD 2019年第4期349-359,共11页
Bird swarm algorithm(BSA), a novel bio-inspired algorithm, has good performance in solving numerical optimization problems. In this paper, a new improved bird swarm algorithm is conducted to solve unconstrained optimi... Bird swarm algorithm(BSA), a novel bio-inspired algorithm, has good performance in solving numerical optimization problems. In this paper, a new improved bird swarm algorithm is conducted to solve unconstrained optimization problems. To enhance the performance of BSA, handling boundary constraints are applied to fix the candidate solutions that are out of boundary or on the boundary in iterations, which can boost the diversity of the swarm to avoid the premature problem. On the other hand, we accelerate the foraging behavior by adjusting the cognitive and social components the sin cosine coefficients. Simulation results and comparison based on sixty benchmark functions demonstrate that the improved BSA has superior performance over the BSA in terms of almost all functions. 展开更多
关键词 IMPROVED BIRD SWARM ALGORITHM handling boundary constraints FORAGING behavior HEURISTIC ALGORITHM
北京出租车GPS轨迹数据地图匹配算法研究 预览
15
作者 曾嘉郦 孙立双 王晓明 《北京测绘》 2019年第3期255-260,共6页
由于车辆位置数据匹配到电子地图时,会出现车辆轨迹偏离实际道路的情况,为了提高出租车GPS轨迹数据匹配到地图的准确率,提出一种出租车地图匹配算法:基于GPS定位精度的距离范围和车辆行驶方向与道路方向的夹角区间确定候选路段,依据车... 由于车辆位置数据匹配到电子地图时,会出现车辆轨迹偏离实际道路的情况,为了提高出租车GPS轨迹数据匹配到地图的准确率,提出一种出租车地图匹配算法:基于GPS定位精度的距离范围和车辆行驶方向与道路方向的夹角区间确定候选路段,依据车辆的速度确定方向权重,计算距离和方向的综合权重值进行轨迹点匹配,通过最短路径算法进行行驶轨迹的选择,并采用北京市西二环周围100辆出租车24860条GPS数据进行实验验证。实验表明该匹配算法的匹配正确率可达到96.72%。其具有地图匹配的准确性。 展开更多
关键词 全球定位系统轨迹数据 出租车 地图匹配 权重 算法
在线阅读 下载PDF
High Secure Sequence Design in Frequency Hopping Communications 预览
16
作者 Rui Chen Zan Li +2 位作者 Jia Shi Lei Guan Jiankang Zhang 《中国通信:英文版》 SCIE CSCD 2019年第4期139-150,共12页
Frequency-hopping(FH)technique is widely used in high-secure communications by exploiting its capabilities of mitigating interference and confidentiality.However,electronic attacks in wireless systems become more and ... Frequency-hopping(FH)technique is widely used in high-secure communications by exploiting its capabilities of mitigating interference and confidentiality.However,electronic attacks in wireless systems become more and more rigorous,which poses huge challenges to the use of the number theory based and chaos theory assisted sequences.The structure of the FH sequence directly affects the performance of FH communication systems.In this paper,the novel FH sequence generation scheme is proposed with the aid of the so-called Government Standard(GOST)algorithm,which achieves a promising balance between efficiency and security.Moreover,the security performance of the proposed algorithm is analyzed,which reveals that it is more resistant to impossible differential attacks than the widely-used Data Encryption Standard(DES)algorithm.The numerical results show that the FH sequences generated by the GOST algorithm significantly outperform the ones generated by the DES algorithm and chaotic theory in terms of the randomness and complexity. 展开更多
关键词 frequency-hopping SEQUENCE CRYPTOGRAPHIC algorithm SECURITY RANDOMNESS COMPLEXITY
在线阅读 下载PDF
Robust Neural Control of Discrete Time Uncertain Nonlinear Systems Using Sliding Mode Backpropagation Training Algorithm
17
作者 Imen Zaidi Mohamed Chtourou Mohamed Djemel 《国际自动化与计算杂志:英文版》 EI CSCD 2019年第2期213-225,共13页
This work deals with robust inverse neural control strategy for a class of single-input single-output (SISO) discrete-time nonlinear system affected by parametric uncertainties. According to the control scheme, in the... This work deals with robust inverse neural control strategy for a class of single-input single-output (SISO) discrete-time nonlinear system affected by parametric uncertainties. According to the control scheme, in the first step, a direct neural model (DNM) is used to learn the behavior of the system, then, an inverse neural model (INM) is synthesized using a specialized learning technique and cascaded to the uncertain system as a controller. In previous works, the neural models are trained classically by backpropagation (BP) algorithm. In this work, the sliding mode-backpropagation (SM-BP) algorithm, presenting some important properties such as robustness and speedy learning, is investigated. Moreover, four combinations using classical BP and SM-BP are tested to determine the best configuration for the robust control of uncertain nonlinear systems. Two simulation examples are treated to illustrate the effectiveness of the proposed control strategy. 展开更多
关键词 Discrete time UNCERTAIN nonlinear systems NEURAL modelling SLIDING mode backpropagation (BP) algorithm ROBUST NEURAL control
An Effective and Scalable VM Migration Strategy to Mitigate Cross-VM Side-Channel Attacks in Cloud 预览
18
作者 Chao Yang Yunfei Guo +2 位作者 Hongchao Hu Wenyan Liu Yawen Wang 《中国通信:英文版》 SCIE CSCD 2019年第4期151-171,共21页
Co-residency of virtual machines(VMs)of different tenants on the same physical platform would possibly lead to cross-VM side-channel attacks in the cloud.While most of current countermeasures fail for real or immediat... Co-residency of virtual machines(VMs)of different tenants on the same physical platform would possibly lead to cross-VM side-channel attacks in the cloud.While most of current countermeasures fail for real or immediate deployment due to their requirement for modification of virtualization structure,we adopt dynamic migration,an inherent mechanism of the cloud platform,as a general defense against this kind of threats.To this end,we first set up a unified practical information leakage model which shows the factors affecting side channels and describes the way they influence the damage due to side-channel attacks.Since migration is adopted to limit the time duration of co-residency,we envision this defense as an optimization problem by setting up an Integer Linear Programming(ILP)to calculate optimal migration strategy,which is intractable due to high computational complexity.Therefore,we approximate the ILP with a baseline genetic algorithm,which is further improved for its optimality and scalability.Experimental results show that our migration-based defense can not only provide excellent security guarantees and affordable performance cost in both theoretical simulation and practical cloud environment,but also achieve better optimality and scalability than previous countermeasures. 展开更多
关键词 side-channel ATTACKS information LEAKAGE virtual machine migration genetic algorithm
在线阅读 下载PDF
A novel iterative soft thresholding algorithm for L1 regularization based SAR image enhancement
19
作者 Hui BI Guoan BI 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第4期208-210,共3页
Dear editor,Synthetic aperture radar(SAR) is an active microwave device which transmits and receives electromagnetic waves to achieve high-resolution imaging of the surveillance region by using matched filtering(MF) b... Dear editor,Synthetic aperture radar(SAR) is an active microwave device which transmits and receives electromagnetic waves to achieve high-resolution imaging of the surveillance region by using matched filtering(MF) based methods [1, 2]. 展开更多
关键词 ITERATIVE soft THRESHOLDING ALGORITHM L1 REGULARIZATION SAR image ENHANCEMENT
危化品仓储堆垛安全距离监测系统设计 预览
20
作者 戴波 周泽彧 +2 位作者 张岩 林双双 刘学君 《化工学报》 EI CAS CSCD 北大核心 2019年第2期707-715,共9页
危化品堆垛安全距离有明确的限制,但是缺乏有效的监测与预警手段。设计一种基于室内定位技术的危化品仓储堆垛安全距离监测系统,通过获取每个堆垛上定位节点的数据来计算仓库中堆垛的安全距离,采用3D可视化技术还原危化品储存状态,建立... 危化品堆垛安全距离有明确的限制,但是缺乏有效的监测与预警手段。设计一种基于室内定位技术的危化品仓储堆垛安全距离监测系统,通过获取每个堆垛上定位节点的数据来计算仓库中堆垛的安全距离,采用3D可视化技术还原危化品储存状态,建立五距报警规则实现危化品仓储堆垛安全距离监测。实验结果表明系统可以有效地实现堆垛安全距离的监测与预警。 展开更多
关键词 安全 危化品仓储 堆垛 3D可视化 设计 算法
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部 意见反馈