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

International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery

作者： Haitao Lin Xiaobin Yang Xiaopeng Yang School of Mathematics and Statistics Hanshan Normal University Office of Asset Management Hanshan Normal University

ISBN: (纸本)9781509040940

The system of max-product fuzzy relation inequalities (FRI) has been studied when it is consistent. In this paper, we study max-product FRI system when it is inconsistent. Based on some new concepts and theorems of approximate solutions, we provide an algorithm to solve its approximate solutions of the inconsistent FRI system. Also, we give an example to demonstrate the efficiency of the algorithm.

关键词： Inconsistent fuzzy relations algorithm efficiency Approximate inequalities Theorem Solutions algorithms

来源：评论

学校读者我要写书评

暂无评论

Tracking Feedback System of Golf Robotic Caddie Based on the Binocular Vision

Tracking Feedback System of Golf Robotic Caddie Based on the...

引用

World Congress on Intelligent Control and Automation

作者： Yuejuan Tang Jing Xu Ming Fang Changchun University of Science and Technology

ISBN: (纸本)9781467384155

In this paper, tracking feedback system of Golf Robotic Caddie based on the binocular stereo vision is proposed, and we use the improved particle filter algorithm to track specific dynamic golfer in real-time, then we keep the robot autonomous motion under control by the feedback system of control. The experiment results show that the improved algorithm used on 30 continuous images needs 1.1270s. It improves processing efficiency of the algorithm and robustness. Furthermore, using the tracking feedback system, the robot can follow target preliminarily.

关键词： Feedback Stereoviews Particle filtering algorithm Golf Binocular vision algorithm efficiency tracking

来源：评论

学校读者我要写书评

暂无评论

Energy-Saving algorithm for Pumping Systems Based on Fuzzy Decision Making

Energy-Saving Algorithm for Pumping Systems Based on Fuzzy D...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Wei Chang Jun-Wei Chang Hsu Yin Wen-June Wang Hsin-Yi Chung Ya-Ching Chang Hsiang-Chieh Chen Department of Electrical Engineering National Central University Industrial Technology Research Institute Taiwan

ISBN: (纸本)9781467317139

In this paper, an energy-saving algorithm to achieve minimum energy consumption and high efficiency for a pumping system is proposed. In the first step, the mathematical model of the pumping system is given. In the second step, one optimal operating condition of pump system is obtained by the proposed energy-saving algorithm. Moreover, a fuzzy decision making is used to make the optimal decision of pumping system operation. Finally, an experimental result is presented to prove the efficiency of the algorithm.

关键词： Pumping systems Curve fitting Fuzzy decision making Energy-saving algorithm Pumping systems energy saving minimum energy consumption algorithm efficiency algorithms Fuzzy Mathematical Model

来源：评论

学校读者我要写书评

暂无评论

Designing multi-objective multi-armed bandits algorithms: a study

Designing multi-objective multi-armed bandits algorithms: a ...

引用

International Joint Conference on Neural Networks

作者： Madalina M. Drugan Ann Nowe Computational Modeling lab Artificial Intelligence group of Computer Science Department Vrije Universiteit Brussels Pleinlaan 2 B-1050 Brussels Belgium

ISBN: (纸本)9781467361279

We propose an algorithmic framework for multi-objective multi-armed bandits with multiple rewards. Different partial order relationships from multi-objective optimization can be considered for a set of reward vectors, such as scalarization functions and Pareto search. A scalarization function transforms the multi-objective environment into a single objective environment and are a popular choice in multi-objective reinforcement learning. Scalarization techniques can be straightforwardly implemented into the current multi-armed bandit framework, but the efficiency of these algorithms depends very much on their type, linear or non-linear (e.g. Chebyshev), and their parameters. Using Pareto dominance order relationship allows to explore the multi-objective environment directly, however this can result in large sets of Pareto optimal solutions. In this paper we propose and evaluate the performance of multi-objective MABs using three regret metric criteria. The standard UCB1 is extended to scalarized multi-objective UCB1 and we propose a Pareto UCB1 algorithm. Both algorithms are proven to have a logarithmic upper bound for their expected regret. We also introduce a variant of the scalarized multi-objective UCB1 that removes online inefficient scalarizations in order to improve the algorithm's efficiency. These algorithms are experimentally compared on multi-objective Bernoulli distributions, Pareto UCB1 being the algorithm with the best empirical performance.

关键词： study multiple rewards reward vectors algorithms algorithm efficiency Regret optimal solution Reward Environments

来源：评论

学校读者我要写书评

暂无评论

Static Handwritten Signature Verification Using Convolution Neural Network

Static Handwritten Signature Verification Using Convolution ...

引用

International Conference on Innovative Computing (ICIC)

作者： Tanzeel Sultan Rana Hafiz Muhammad Usman Sheraz Naseer School of System and Technology University of Management and Technology Lahore Pakistan

ISBN: (纸本)9781728146836

Biometrics are very essential tools for the purpose of identification of the person may contain the basic identification like iris and gesture recognition whereas signature verification is also widely used for the purpose of identification. In this paper, we propose a method of offline signature verification in which convolution is applied to address the maximum accuracy and we present how the problem was being handled in the past few decades. The experimented result reveals the efficiency of algorithm. In this paper we have worked on multiple layers so that good accuracy may obtain in terms of originality of the input images.

关键词： Convolution neural network (CNN) Written dependent (WD) Written independent (WI) signature validation Convolution algorithm efficiency Gesture recognition Creativity Biometrics Neural network Persons

来源：评论

学校读者我要写书评

暂无评论

Decoupled estimation of 2D DOA for coherently distributed sources using 3D matrix pencil method

引用

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2008年第unknown期2008卷 417157-1-417157-7-0页

作者： Zhang Gaoyi Tang Bin Univ Elect Sci & Technol China Sch Elect Engn Chengdu 610054 Peoples R China

A new 2D DOA estimation method for coherently distributed (CD) source is proposed. CD sources model is constructed by using Taylor approximation to the generalized steering vector (GSV), whereas the angular and angular spread are separated from signal pattern. The angular information is in the phase part of the GSV, and the angular spread information is in the module part of the GSV, thus enabling to decouple the estimation of 2D DOA from that of the angular spread. The array received data is used to construct three-dimensional (3D) enhanced data matrix. The 2D DOA for coherently distributed sources could be estimated from the enhanced matrix by using 3D matrix pencil method. Computer simulation validated the efficiency of the algorithm. Copyright (C) 2008 Z. Gaoyi and T. Bin.

关键词： Distribute pencil DECOUPLING Angle algorithm efficiency United States Department of Agriculture angular spread angular information Three Dimensions

来源：评论

学校读者我要写书评

暂无评论

Improved H.264 Video Compression Based on Cubic Macro-blocks

Improved H.264 Video Compression Based on Cubic Macro-blocks

引用

2010 International Conference on Audio,Language and Image Processing(2010年音频、语言与图像处理国际会议 ICALIP 2010)

作者： Shengchu Wang Hongbing Ma Electrical engineering department Tsinghua University Beijing 100084 China

ISBN: (纸本)9781424458653

In the conventional H.264 standard, specified size of Macro-blocks (MBs) is cut from one single frame or field. For every frame, the encoded data are mainly composited with Motion vectors (MVs) and the residuals after Motion Compensation (MC)for all MBs in the frame. However, observing the fact that MVs may keep relatively constant in some videos containing slow changing scenes. This indicates that it is unnecessary to estimate the MVs for every frame, but using the same MVs for several adjacent frames. Consequently, the compression and computational efficiency will be improved significantly. Both concepts of "Virtual Frames" (VF) and Cubic Macro-Blocks (CMB) are introduced to achieve this goal. The residual generated after MC will be processed using 3D-DCT to achieve high compression. Through Matlab simulation, the efficiency of this algorithm is substantiated.

关键词： encode data Frame For each Video compression Multiple Virtual Storage crust-mantle boundary Cubic Videotapes Computational efficiency FRAMES algorithm efficiency general dimension Single frame macro commands motion vector

来源：评论

学校读者我要写书评

暂无评论

Finding all intersections between planar curves

Finding all intersections between planar curves

引用

Electronics, Computer, Telecommunications and Information Technology International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology

作者： Gun Srijuntongsiri School of Information Computer and Communication Technology Sirindhorn International Institute of Technology Thammasat University

ISBN: (纸本)9781424456062

This article proposes a new algorithm for finding all intersections between two planar curves within a given domain. The algorithm is a hybrid between subdivision and iterative methods. We use a test based on Kantorovich's theorem to detect the starting point where Newton's method converges quadratically and the subdivision scheme to exclude certain regions that do not contain any intersections. Our algorithm is guaranteed to detect all intersections in the domain for nondegenerate and non-ill-posed cases. We implement the algorithm in Matlab and run it on some test problems. The computed solutions and the efficiency of the algorithm are shown.

关键词： Newton method algorithms iterative methods Intersection test problem plane curve Planar Curves FINDINGS MATLAB algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning 16

More Supervision, Less Computation: Statistical-Computationa...

引用

Annual Conference on Neural Information Processing Systems

作者： Xinyang Yi Zhaoran Wang Zhuoran Yang Constantine Caramanis Han Liu The University of Texas at Austin Princeton University

ISBN: (纸本)9781510838819

We consider the weakly supervised binary classification problem where the labels are randomly flipped with probability 1 - α. Although there exist numerous algorithms for this problem, it remains theoretically unexplored how the statistical accuracies and computational efficiency of these algorithms depend on the degree of supervision, which is quantified by α. In this paper, we characterize the effect of α by establishing the information-theoretic and computational boundaries, namely, the minimax-optimal statistical accuracy that can be achieved by all algorithms, and polynomial-time algorithms under an oracle computational model. For small α, our result shows a gap between these two boundaries, which represents the computational price of achieving the information-theoretic boundary due to the lack of supervision. Interestingly, we also show that this gap narrows as a increases. In other words, having more supervision, i.e., more correct labels, not only improves the optimal statistical accuracy as expected, but also enhances the computational efficiency for achieving such accuracy.

关键词： Regulated industries Supervision Computational efficiency algorithms Semi-supervised Learning boundary layer tradeoffs algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Towards computationally efficient planning of dynamic multi-contact locomotion

Towards computationally efficient planning of dynamic multi-...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Gray C. Thomas Luis Sentis Department of Mechanical Engineering University of Texas at Austin 78712 USA

ISBN: (纸本)9781509037636

This paper considers the problem of numerically efficient planning for legged robot locomotion, aiming towards reactive multi-contact planning as a reliability feature. We propose to decompose the problem into two parts: an extremely low dimensional kinematic search, which only adjusts a geometric path through space;and a dynamic optimization, which we focus on in this paper. This dynamic optimization also includes the selection of foot steps and hand-holds-in the special case of instantaneous foot re-location. This case is interesting because (1) it is a limiting behavior for algorithms with a foot switching cost, (2) it may have merit as a heuristic to guide search, and (3) it could act as a building block towards algorithms which do consider foot transition cost. The algorithm bears similarity both to phase space locomotion planning techniques for bipedal walking and the minimum time trajectory scaling problem for robot arms. A fundamental aspect of the algorithm's efficiency is its use of linear programming with reuse of the active set of inequality constraints. Simulation results in a simplified setting are used to demonstrate the planning of agile locomotion behaviors.

关键词： algorithm efficiency multiple contact Locomotion Foot robotic arm algorithms Foot Foot British linear programming Heuristics reuse

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：