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

A new SAT Encoding Scheme for Exactly-one Constraints

Journal of Physics: Conference Series 2019年第1期1288卷

作者： Jiatong Cai Yating Su Xixi Yang Jionghao Min Yong Lai College of Software Jilin University Changchun P.R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China

Exactly-one constraints have comprehensive applications for the fields of artificial intelligence and operations research. For many encoded SAT problems generated by the existing encoding schemes of exactly-one constraints, the state-of-the-art knowledge compilers cannot complete compilation. In this paper, we propose a new encoding scheme of exactly-one constraints. We introduce two-dimensional auxiliary variables (represented as a matrix) to denote the constraint that exactly one of some variables can be assigned as true. The clauses generated by our scheme is significantly less than those generated by three other existing encoding schemes. The experimental results on the exact cover problems show that the encoded CNF formulas generated by our scheme requires less compilation time, compared with the other three coding schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Equivalent Representation of the Breadth-One D-Invariant Polynomial Subspace and Its Discretization

引用

Journal of Systems Science & Complexity 2016年第5期29卷 1436-1445页

作者： JIANG Xue ZHANG Shugong Institute of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University

This paper demonstrates the equivalence of two classes of D-invariant polynomial subspaces, i.e., these two classes of subspaces are different representations of the breadth-one D-invariant subspace. Moreover, the authors solve the discrete approximation problem in ideal interpolation for the breadth-one D-invariant subspace. Namely, the authors find the points, such that the limiting space of the evaluation functionals at these points is the functional space induced by the given D-invariant subspace, as the evaluation points all coalesce at one point.

关键词： Breadth-one D-invariant polynomial subspace discrete approximation problem idealinterpolation.

来源：评论

学校读者我要写书评

暂无评论

Research on DDoS Attack Detection in Software Defined Network

Research on DDoS Attack Detection in Software Defined Networ...

引用

2018 International Conference on Cloud Computing, Big Data and Blockchain, ICCBB 2018

作者： Zhao-Hui, Ma Gan-Sen, Zhao Wei-Wen, Li Ze-Feng, Mo Xin-Ming, Wang Bing-Chuan, Chen Cheng-Chuang, Lin School of Computer Science South China Normal University Guangzhou510631 China School of Information Science and Technology Guangdong University of Foreign Studies Guangzhou510006 China School of Mathematical Sciences South China Normal University Guangzhou510631 China School of Statistics and Mathematics Guangdong University of Finance and Economics Guangzhou510320 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9781538622803

Software Defined Network (SDN) is a new network construction. But due to its construction, SDN is vulnerable to be attacked by Distributed Denial of Service (DDoS) attack. So it is important to detect DDoS attack in SDN network. This paper presents a DDoS detection scheme based on k-means algorithm in SDN environment. The establishment of this scheme is based on the two hypotheses that the daily network works normally most of the time, and there is a significant difference between the data characteristics of normal situation and abnormal situation. At the same time, these two hypotheses are also true to the daily network condition. After demonstrating the validity of k-means clustering algorithm, the paper proposes 5 flow table features that can be used to detect DDoS attacks. Finally, the DDoS detection scheme was tested by simulation experiment. The test results showed that the method proposed by the author could effectively detect DDoS, with an average success rate of 97.78%. © 2018 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

A novel Bayesian network-based fault prognostic method for semiconductor manufacturing process

A novel Bayesian network-based fault prognostic method for s...

引用

2017 IEEE International Conference on Industrial Technology, ICIT 2017

作者： Wang, Guodong Hasani, Ramin M. Zhu, Yungang Grosu, Radu Institute of Computer Engineering Vienna University of Technology Austria College of Computer Science and Technology Jilin University China State Key Laboratory of Applied Optics Chinese Academy of Sciences China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

ISBN: (纸本)9781509053209

Fault prognostic in various levels of production of semiconductor chips is considered to be a great challenge. To reduce yield loss during the manufacturing process, tool abnormalities should be detected as early as possible during process monitoring. In this paper, we propose a novel fault prognostic method based on Bayesian networks. The network is designed such that it can process both discrete and continuous variables, to represent the correlations between critical deviations and to process quality control data based on divide-and-conquer strategy. Such a network enables us to perform high-precision multi-step prognostic on the status of the fabrication process given the current state of the sensory info. Additionally, we introduce a layer-wise approach for efficient learning of the Bayesian-network parameters. We evaluate the accuracy of our prognostic model on a wafer fabrication dataset where our model performs precise next-step fault prognostic by using the control sensory data. © 2017 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization for distributed collaborative beamforming in mobile wireless sensor networks

Multi-objective optimization for distributed collaborative b...

引用

IEEE Symposium on Computers and Communications

作者： Geng Sun Yanheng Liu Guojun Shen Aimin Wang Ying Zhang Victor C. M. Leung School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

Mobile wireless sensor networks (MWSN) are resource constrained, and have limited energy and transmission range. Distributed collaborative beamforming (DCB) in MWSN based on a virtual node antenna array (VNAA) can increase the transmission distance and enhance energy efficiency of a single sensor node. To achieve a lower maximum sidelobe level (SLL), sensor nodes can move to optimal locations with optimal excitation currents for DCB. However, this leads to an extra motion energy consumption. In this paper, we construct a multi-objective optimization framework to jointly optimize the maximum SLL, the transmission power and the motion energy consumption of the DCB nodes in MWSN. Moreover, an improved non-dorminated sorting genetic algorithm-II (INSGA-II) is proposed for solving the optimization problem. Simulation results show that the maximum SLL, the transmission power and the motion energy consumption of the VNAA can be effectively optimized by the proposed algorithms.

关键词： Mobile wireless sensor networks Collaborative beamforming Antenna arrays Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Sparse synthesis of concentric circular antenna array via multi-objective evolutionary computation

Sparse synthesis of concentric circular antenna array via mu...

引用

IEEE Vehicular Technology Conference

作者： Geng Sun Yanheng Liu Zhaoyu Chen Shuang Liang Qianao Ju Ying Zhang Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China Jilin University College of Computer Science and Technology Changchun China Department of Information Technology Changchun Vocational Institute of Technology Changchun China Georgia Institute of Technology School of Electrical and Computer Engineering Atlanta GA USA

ISBN: (纸本)9781538663592;9781538663585

The sparse synthesis of the concentric circular antenna array (CCAA) is a very important technology because it is able to reduce the cost of the antenna array. In this paper, we first formulate a multi-objective optimization problem to jointly reduce the maximum sidelobe level (SLL) and the number of the switched-on elements of the CCAA. Then, we propose a novel enhanced non-dominated sorting genetic algorithm-II (ENSGA-II) to solve this problem. ENSGA-II introduces a hierarchy mechanism to improve the population utilization of the conventional non-dominated sorting genetic algorithm, thereby enhancing the accuracy and the convergence rate of the algorithm. Simulation results show that ENSGA-II obtains a lower maximum SLL with the similar number the switched-off elements compared with other algorithms. Moreover, ENSGA-II has a faster convergence rate.

关键词： antenna arrays genetic algorithms Antenna arrays Genetic Algorithm (GA) Loop antennas side lobe level Elements Concentric Small B-Cell Lymphocytic Lymphoma evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

An unmanned aerial vehicle pose estimation system based on SLAM

引用

IOP Conference Series: Materials Science and engineering 2019年第4期569卷

作者： Xinglei Dou Yuzhou Huo Yongchang Liu Xin Wang College of Software Engineering Jilin University Changchun Jilin 130012 China College of Computer Science and Technology Jilin University Changchun Jilin 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun Jilin 130012 China

This paper presents an unmanned aerial vehicle (UAV) pose estimation system based on monocular simultaneous localization and mapping (SLAM) guided by the desired shot. The system enables UAV to automatically adjust the pose to achieve a shot close to the desired shot provided by the user. The SLAM module in the system includes ORB feature-based visual odometry and Levenberg-Marquardt method-based optimizer. To ensure the reliability of the camera pose estimation result, the bag of words model is used to select an image which has enough good matches with the desired shot. The experimental results prove that the system is valid and effective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using improved particle swarm optimization to tune PID controllers in cooperative collision avoidance systems

引用

Frontiers of Information Technology & Electronic engineering 2017年第9期18卷 1385-1395页

作者： Xing-chen WU Gui-he QIN Ming-hui SUN He YU Qian-yi XU College of Computer Science and Technology Jilin University Changchun 130012 China MOE Key Laboratory of Symbol Computation and Knowledge Engineering Changchun 130012 China Department of Measurement and Controlling Engineering Changchun University Changchun 130012 China

The introduction ofproportional-integral-dorivative （PID） controllers into cooperative collision avoidance systems （CCASs） has been hindered by difficulties in their optimization and by a lack of study of their effects on vehicle driving stability, comfort, and fuel economy. In this paper, we propose a method to optimize PID controllers using an improved particle swarm optimization （PSO） algorithm, and to bettor manipulate cooperative collision avoidance with other vehicles. First, we use PRESCAN and MATLAB/Simulink to conduct a united simulation, which constructs a CCAS composed of a PID controller, maneuver strategy judging modules, and a path planning module. Then we apply the improved PSO algorithm to optimize the PID controller based on the dynamic vehicle data obtained. Finally, we perform a simulation test of performance before and after the optimization of the PID controller, in which vehicles equipped with a CCAS undertake deceleration driving and steering under the two states of low speed （≤50 km/h） and high speed （≥100 km/h） cruising. The results show that the PID controller optimized using the proposed method can achieve not only the basic functions of a CCAS, but also improvements in vehicle dynamic stability, riding comfort, and fuel economy.

关键词： Cooperative collision avoidance system （CCAS） Improved particle swarm optimization （PSO） PID controller Vehicle comfort Fuel economy

来源：评论

学校读者我要写书评

暂无评论

Tuning the Learning Rate for Stochastic Variational Inference

引用

Journal of Computer Science & Technology 2016年第2期31卷 428-436页

作者： Xi-Ming Li Ji-Hong Ouyang College of Computer Science and Technology Jilin University Changchun 130000 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130000 China

Stochastic variational inference （SVI） can learn topic models with very big corpora. It optimizes the variational objective by using the stochastic natural gradient algorithm with a decreasing learning rate. This rate is crucial for SVI; however, it is often tuned by hand in real applications. To address this, we develop a novel algorithm, which tunes the learning rate of each iteration adaptively. The proposed algorithm uses the Kullback-Leibler （KL） divergence to measure the similarity between the variational distribution with noisy update and that with batch update, and then optimizes the learning rates by minimizing the KL divergence. We apply our algorithm to two representative topic models： latent Dirichlet allocation and hierarchical Dirichlet process. Experimental results indicate that our algorithm performs better and converges faster than commonly used learning rates.

关键词： stochastic variational inference online learning adaptive learning rate topic model

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for the Discretization of an Ideal Projector

引用

Journal of Systems Science & Complexity 2016年第5期29卷 1400-1410页

作者： JIANG Xue ZHANG Shugong LI Zhe Institute of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University Department of Applied Mathematics School of Science Changchun University of Science and Technology

Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekhtman Boris shows that, for more than two variables,there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider: Given an ideal interpolant, how to find a sequence of Lagrange interpolants(if any) that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns "True", the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.

关键词： Discretization ideal interpolation Lagrange interpolation.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：