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

IEEE International Symposium on Embedded Multicore/Many-core System-on-Chip

作者： Kenji Kanazawa Shaowei Cai Faculty of Engineering Information and Systems University of Tsukuba State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences

ISBN: (纸本)9781538666906

In this paper, we propose an FPGA solver for the maximum clique problems encoded into the partial maximum satisfiability (partial MaxSAT). Given a Boolean formula with hard constraints that required to be satisfied and soft constraints that are desired to be satisfied, the goal of partial MaxSAT is to find a truth assignment that satisfies all hard constraints and as many soft constraints as possible. The maximum clique problem involves finding a clique with the maximum possible number of vertices in a given graph, which can be formulated as partial MaxSAT in a natural way. The Dist algorithm is one of the best performing local search algorithms for solving partial MaxSAT. In this paper, we reconstruct the Dist algorithm to leverage its inherent parallelism while maintaining the accuracy of the algorithm for maximum clique problems and then describe the implementation of the algorithm on FPGA. Our FPGA solver can solve partial MaxSAT-encoded maximum clique problems up to 22 times faster than the Dist algorithm on CPU.

关键词： Field programmable gate arrays Partial searching algorithm algorithms central processing units Solve

来源：评论

学校读者我要写书评

暂无评论

The Research of searching algorithm in Amazons Game

The Research of Searching Algorithm in Amazons Game

引用

23rd Chinese Control and Decision Conference

作者： Guo, Qinqin Li, Shuqin Bao, Hua Beijing Informat Sci Technol Univ Beijing Peoples R China

ISBN: (纸本)9781424487363

In the area of computer game, Amazons game is a relatively new one whose rules stand between the game of Chess and Go. Its move rule is simple but apt to generate tremendous move branches. Based on the UCT searching algorithm, this paper presents an idea that the whole process of Amazons game can be divided into three phases, which are the Opening, Middle game and Endgame, then different strategies are applied to different phases according to their respective characteristics. Furthermore, a new Monte-Carlo simulation method applicable to Amazons game is proposed in this paper. The corresponding experiments are conducted to show the validation of the proposed algorithms.

关键词： Amazons game UCT Monte-Carlo simulation searching algorithm

来源：评论

学校读者我要写书评

暂无评论

Resonant Frequency Measurement of Quartz Crystal Based on DDS and Real-time Peak searching 6

Resonant Frequency Measurement of Quartz Crystal Based on DD...

引用

6th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Zhao, Lei Meng, Xiaofeng Liu, Furui Beihang Univ Sch Instrumentat Sci & Optoelect Engn Beijing 100191 Peoples R China

ISBN: (纸本)9781509011957

In order to solve the unstable problem of conventional methods for measuring resonant frequency of quartz crystal, a method based on DDS (Direct Digital Synthesis) and real-time peak searching is proposed to increase stability of measurement. By actively generating excitation signal using DDS, the response of quartz crystal can be obtained even under heavy load. Frequency response of impedance is studied to reveal the relationship between minimum impedance and resonant frequency. Electric circuit and real-time searching algorithm is designed to track resonant frequency of quartz crystal. Experimental results show when parameter of quartz crystal changes 392.0%, the resonant frequency could still be measured by the developed method.

关键词： quartz crystal resonant frequency DDS searching algorithm impedance

来源：评论

学校读者我要写书评

暂无评论

Special protection scheme against voltage collapse

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第2期10卷 341-351页

作者： Derafshian, Mehdi Amjady, Nima Dehghan, Shahab Semnan Univ Dept Elect & Comp Engn Semnan Iran Islamic Azad Univ Qazvin Branch Dept Elect Biomed & Mechatron Engn Qazvin Iran

The safe and continuous operation of power systems necessitates the implementation of special protection schemes (SPSs) against severe disturbances that may lead to a system breakdown. This study proposes a new SPS to mitigate voltage collapse against predetermined contingencies that can significantly lessen the voltage stability margin (VSM) of the system. The proposed SPS is based on an effective load shedding scheme that uses a multi-objective optimisation framework including the objectives of load cut, VSM and the integral of the deviation from nominal voltage. Moreover, a new diversely distributed multi-objective fuzzy-based theta gravitational search algorithm is proposed to solve the optimisation problem. Khorasan area of Iran's power system in 2014 peak load time is used as a test case for the suggested SPS. Effectiveness of the proposed approach is shown by comparing its simulation results with the results of the current SPS and other solution approaches.

关键词： Safes Voltage collapse Payload continuous operation vibrating sample magnetometers power systems searching algorithm CASING INSPECTION load duration Nominal Voltage

来源：评论

学校读者我要写书评

暂无评论

Two Kinds of Classifications Based on Improved Gravitational Search algorithm and Particle Swarm Optimization algorithm

引用

ADVANCES IN MATHEMATICAL PHYSICS 2017年第Pt.2期2017卷 2131862-1-2131862-7页

作者： Hu, Hongping Cui, Xiaxia Bai, Yanping North Univ China Sch Sci Taiyuan 030051 Shanxi Peoples R China

Gravitational Search algorithm (GSA) is a widely used metaheuristic algorithm. Although fewer parameters in GSA were adjusted, GSA has a slow convergence rate. In this paper, we change the constant acceleration coefficients to be the exponential function on the basis of combination of GSA and PSO (PSO-GSA) and propose an improved PSO-GSA algorithm (written as I-PSOGSA) for solving two kinds of classifications: surface water quality and the moving direction of robots. I-PSO-GSA is employed to optimize weights and biases of backpropagation (BP) neural network. The experimental results show that, being compared with combination of PSO and GSA (PSO-GSA), single PSO, and single GSA for optimizing the parameters of BP neural network, IPSO- GSA outperforms PSO-GSA, PSO, and GSA and has better classification accuracy for these two actual problems.

关键词： Two Kinds Classifications BP neural networks searching algorithm GSA particle swarm algorithm parametric subharmonic oscillator

来源：评论

学校读者我要写书评

暂无评论

A method based on the adaptive cuckoo search algorithm for endmember extraction from hyperspectral remote sensing images

引用

REMOTE SENSING LETTERS 2016年第3期7卷 289-297页

作者： Zhao, Huihui Jiang, Yangming Wang, Tuo Cui, Weihong Li, Xiaowen Univ Chinese Acad Sci Beijing Peoples R China Chinese Acad Sci Inst Remote Sensing & Digital Earth State Key Lab Remote Sensing Sci Beijing Peoples R China Chinese Acad Sci Inst Remote Sensing & Digital Earth Natl Engn Ctr Geoinformat Beijing Peoples R China

In this letter, an endmember extraction approach based on an adaptive cuckoo search (ACS) algorithm (ACSEE) is proposed for hyperspectral remote sensing imagery. In the proposed algorithm, the problem of endmember extraction is transformed into combinatorial optimization of the candidate endmembers. The effectiveness of the cuckoo search algorithm is demonstrated by its good balance between exploitation of Levy flights and random walk, which leads the algorithm to effectively explore the solution space and locate potential solutions to avoid falling into local optima. Furthermore, to improve the convergence characteristics of the original cuckoo search algorithm, a new strategy combined with historical information is proposed to accelerate the search process by adjusting the step size of the Levy flights. The results of experiments conducted using simulated data and well-known hyperspectral remote sensing data indicate that the proposed ACS algorithm can be used as an alternative tool to solve the problem of endmember extraction on account of its robust stability and guarantee of optimal performance.

关键词： ASTRONOMICAL PHOTOGRAPHY step size aerial images Cuculidae algorithms Search process searching algorithm Solution space hyperspectral remote sensing levy

来源：评论

学校读者我要写书评

暂无评论

Semi-real-time algorithm for fast pattern matching

引用

IET IMAGE PROCESSING 2016年第12期10卷 979-985页

作者： Dong, Jing Liu, Haibo Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha 410073 Hunan Peoples R China

A semi-real-time pattern-matching algorithm consisting of an offline and online stage is proposed. The approach of the proposed algorithm is to perform a significant amount of the calculation required by pattern matching in the offline stage. This necessitates only a small amount of calculation in the online process to reject a great number of mismatched positions. The proposed algorithm first uses triangle inequality and orthogonal decomposition to derive the lower bounds of the distances between the pattern and the candidate windows of the base image. Then, mismatched candidate windows are rejected if their lower bounds exceed an adaptive threshold. The proposed method accelerates the online processing effectively while yielding the identical result as a full search algorithm. The proposed algorithm was compared with other state-of-the-art algorithms and the result confirms that the proposed algorithm has a distinct speed advantage over the other algorithms for online processing.

关键词： Lower bound Pattern matching algorithms searching algorithm MISMATCH Triangle inequality OFF LINE candidate species

来源：评论

学校读者我要写书评

暂无评论

Self-triggered control for constrained systems: a contractive set-based approach

Self-triggered control for constrained systems: a contractiv...

引用

American Control Conference

作者： Kazumune Hashimoto Shuichi Adachi Dimos V. Dimarogonas Department of Applied Physics and Physico-Informatics Keio University Department of Electrical Engineering KTH Royal Institute of Technology

ISBN: (纸本)9781509045839

In this paper, a self-triggered control scheme for constrained discrete-time control systems is presented. The key idea of our approach is to construct a transition system or a graph structure from a collection of polyhedral sets, which are generated based on the notion of set-invariance theory. The inter-event time steps are then determined through a standard graph search algorithm to obtain the minimal total cost to a terminal state. The proposed strategy is illustrated through a numerical example.

关键词： searching algorithm Discrete time control systems numerical example standard graph Total Costs control systems Standing Orders

来源：评论

学校读者我要写书评

暂无评论

LP-Based Robust algorithms for Noisy Minor-Free and Bounded Treewidth Graphs 17

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded ...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Nikhil Bansal Daniel Reichman Seeun William Umboh Department of Mathematics and Computer Science Eindhoven University of Technology Electrical Engineering and Computer Science University of California at Berkeley

ISBN: (纸本)9781510836358

We give a general approach for solving optimization problems on noisy minor free and bounded treewidth graphs, where a fraction of edges are adversarially corrupted. The noisy setting was first considered by Magen and Moharrami and they gave a (1 + ε)-estimation algorithm for the independent set problem. Later, Chan and Har-Peled designed a local search algorithm that finds a (1 + ε)-approximate independent set. However, nothing was known regarding other problems in the noisy setting. Our main contribution is a general LP-based framework that yields (1 + ε)-approximation algorithms for noisy MAX-k-CSPs.

关键词： Noise searching algorithm Bounded algorithms solidification fractions Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Calibration of stochastic biochemical models against behavioral temporal logic specifications

Calibration of stochastic biochemical models against behavio...

引用

IEEE International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)

作者： Sumit Kumar Jha Arfeen Khalid Computer Science Department University of Central Florida Orlando FL USA

ISBN: (纸本)9781538625958

Calibrating stochastic biochemical models against experimental insights remains a critical challenge in biological design automation. Stochastic biochemical models incorporate the uncertainty inherent in the system being modeled, thus demanding meticulous calibration techniques. We present an approach for calibrating stochastic biochemical models such that the calibrated model satisfies a given behavioral temporal logic specification with a given probability. Model calibration is defined as an optimization problem that aims to minimize a cost function that computes either a qualitative or a quantitative measure of distance between the parameterized stochastic biochemical model and the expected behavioral specification. To minimize this distance, our approach combines various statistical hypothesis testing methods with automated runtime monitoring of high-level temporal logic specifications against time-series data obtained by simulating stochastic models. We apply sequential probability ratio test (SPRT) and Bayesian statistical model checking (BSMC) when the distance between the model and the behavioral specification is a qualitative value. Alternatively, when the distance is a quantitative value describing how well a specification is satisfied by the model, we use a hypothesis test to sequentially select between two distributions of the distance metric that has the larger mean. Such tests describe the stopping condition to reduce the number of samples required for discovering the correct parameter values. We demonstrate the potential of our approach on two examples using agent-based models implemented in SPARK and rule-based models implemented in BioNetGen modeling languages. The distance between a candidate biochemical model and an expected behavior encoded in temporal logic can be used to drive a local or global search technique during the model calibration process. Our approach follows Simulated Annealing as the global search algorithm that avoids local minima

关键词： Temporal logic Specifications searching algorithm Calibration Computer-Aided Design Stochastic sparks search technique distance metric algorithmic approach sprt time series data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：