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

26th International Conference on Electrical Machines and Systems, ICEMS 2023

作者： Ma, Yue Niu, Shuangxia Fu, Weinong Fei, Jiaqi Huang, Jiahui The Hong Kong Polytechnic University Electrical and Electronics Engineering Hong Kong Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Computer Science and Control Engineering Shenzhen China Han's Robot Algorithm Team Han's Laser Smart Equipment Group Co Ltd Shenzhen China

ISBN: (纸本)9798350317589

The Dual permanent magnet machine (DPMM) possesses the characteristics of high torque and low speed which is suitable for direct-drive equipment. Because of the low magnetic reluctance of this motor, the torque is very sensitive to dimensional fluctuations. As a synchronous motor, it also suffers from noise and vibration caused by torque ripple. This research analyzes the torque ripple in several different scenarios under the same DPMM electromagnetic design and finds a predictable influence of mechanical tolerances on torque ripple. In order to reduce the torque ripples, this paper proposes a harmonic current injection (HCI) method. A DPMM with a split-tooth structure is simulated and tested in this paper to demonstrate the analysis of torque fluctuations and the effectiveness of HCI. © 2023 IEEE.

关键词： Torque

来源：评论

学校读者我要写书评

暂无评论

A real-time rear view camera based obstacle detection

A real-time rear view camera based obstacle detection

引用

2009 12th International IEEE Conference on Intelligent Transportation Systems, ITSC '09

作者： Ma, Guanglin Dwivedi, Manoj Li, Ran Sun, Chong Kummert, Anton Asia Pacific Advanced Product Development Delphi Electronics and Safety 200131 Shanghai China Algorithm Development Group - Safety and Forewarn Delphi Electronics and Safety 560066 Bangalore India Faculty of Electrical Information and Media Engineering University of Wuppertal D-42119 Wuppertal Germany

ISBN: (纸本)9781424455218

This paper presents a robust real-time rear-view camera based object detection algorithm for backup aid and parking assist applications. The system is capable of handling the challenges of stationary as well as moving objects in rear view of the host vehicle, utilizing a single car-mounted rear-view fish-eye camera. A motion-based and edge-based object detection algorithm was developed in order to detect near distance objects and distant objects respectively. Furthermore, a free-space detection algorithm was developed which is used to detect areas where no objects appeared in front of the vehicle path. A tracker-based fusion algorithm was used to track and fuse detection results of individual detection algorithms. Experiments have been carried out by applying the proposed algorithm on prerecorded sequences as well as within a test vehicle and thus in a closed loop environment. The experimental results indicate promising detection performance. © 2009 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Pancake flipping with two spatulas

引用

Electronic Notes in Discrete Mathematics 2010年第C期36卷 231-238页

作者： Sharmin, Mahfuza Yeasmin, Rukhsana Hasan, Masud Rahman, Atif Rahman, M. Sohel Department of Computer Science and Engineering Ahsanullah University of Science and Technology Dhaka-1208 Bangladesh Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka-1000 Bangladesh Department of Electrical Engineering and Computer Sciences University of California Berkeley CA 94720 United States Algorithm Design Group Department of Computer Science King's College London Strand London WC2R 2LS England United States

In this paper, we give approximation algorithms for several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding prefix transpositions, prefix transreversals etc. along with the prefix reversals. © 2010 Elsevier B.V.

关键词： Approximation algorithms Genome sorting Pancake flipping Sorting permutations

来源：评论

学校读者我要写书评

暂无评论

algorithms for two versions of LCS problem for indeterminate strings

Algorithms for two versions of LCS problem for indeterminate...

引用

作者： Iliopoulos, Costas Rahman, M. Sohel Rytter, Wojciech Algorithm Design Group Department of Computer Science King's College London Strand London WC2R 2LS United Kingdom Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka-1000 Bangladesh Institute of Informatics Warsaw University Warsaw Poland Department of Mathematics and Informatics Copernicus University Torun Poland

We study the complexity of the longest common subsequence (LCS) problem from a new perspective. By an indeterminate string (i-string, for short) we mean a sequence X = X[1]X[2]. X[n], where C Σ for each i, and Σ is a given alphabet of potentially large size. A subsequence of X is any usual string over Σ which is an element of the finite (but usually of exponential size) language X[i1]X[i2]. X[ip], where 1 ≤ i123. P ≤ n,p ≥ 0. Similarly, we define a supersequence of x. Our first version of the LCS. problem is Problem ILCS: for given i-strings X˜ and Ỹ, find their longest common subsequence. From the complexity point of view, new parameters of the input correspond to |Σ| and maximum size l of the subsets in X˜ and Ỹ. There is also a third parameter R, which gives a measure of similarity between X˜ and Ỹ. The smaller the R, the lesser is the time for solving Problem ILCS. Our second version of the LCS problem is Problem CILCS (constrained ILCS): for given i-strings X˜ and Ỹ and a plain string Z, find the longest common subsequence of X˜ and Ỹ which is, at the same time, a supersequence of Z. In this paper, we present several efficient algorithms to solve both ILCS and CILCS problems. The efficiency in our algorithms are obtained in particular by using an efficient data structure for special type of range maxima queries and fast multiplication of boolean matrices.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Learning the track and planning ahead in a car racing controller

Learning the track and planning ahead in a car racing contro...

引用

IEEE Symposium on Computational Intelligence and Games, CIG

作者： Jan Quadflieg Mike Preuss Oliver Kramer Günter Rudolph Algorithm Engineering Computational Intelligence Group Department of Computer Science Technische Universität Dortmund Germany Algorithms Group at the International Computer Science Institute University of California Berkeley CA USA

We propose a robust approach for learning car racing track models from sensory data for the car racing simulator TORCS. Our track recognition system is based on the combination of an advanced preprocessing step of the sensory data and a simple classifier that delivers six types of track shapes similar to the ones a human would recognize. Out of these, establishing a complete track model is straightforward. This model provides an information advantage to controller strategies, as it generally enables planning. We demonstrate how such a planning controller can be derived by a mixture of expert knowledge and a simple evolutionary learning approach and give experimental evidence that knowing not only the current conditions but also the big picture of the track is beneficial, as may be expected.

关键词： Radar tracking Planning Acceleration Data models Games Computational intelligence Humans

来源：评论

学校读者我要写书评

暂无评论

Anisotropy correction of medical image data employing patch similarity

Anisotropy correction of medical image data employing patch ...

引用

26th IEEE International Symposium on Computer-Based Medical Systems, CBMS 2013

作者： Keyhani, Mohammad H. Hakimi, Wissam El Wesarg, Stefan TU Darmstadt Algorithm Engineering Hochschulstrasse 10 64289 Darmstadt Germany TU Darmstadt Interact. Graph. Syst. Group Fraunhoferstr. 5 64283 Darmstadt Germany Fraunhofer IGD Cogn. Comp. and Med. Imaging Fraunhoferstr. 5 64283 Darmstadt Germany

ISBN: (纸本)9781479910533

CT or MR image data is typically anisotropic. But, it is desirable to base image processing as well as diagnosis on isotropic image data. In this work, we propose a novel method for correcting anisotropy of 3D image data sets by employing the recurrence of small 2D patches across different scales. We base our method on previous work dealing with super-resolution of single natural 2D images, show the applicability of that approach also to medical images, and extend it to a 3D solution for anisotropy correction. Our results show that the image quality can be significantly improved. For clinical CT and MRI data, we present feedback from the clinical end user. © 2013 IEEE.

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Anisotropy correction of medical image data employing patch similarity

Anisotropy correction of medical image data employing patch ...

引用

作者： Keyhani, Mohammad H. El Hakimi, Wissam Wesarg, Stefan TU Darmstadt Algorithm Engineering Hochschulstrasse 10 64289 Darmstadt Germany TU Darmstadt Interact. Graph. Syst. Group Fraunhoferstr. 5 64283 Darmstadt Germany Fraunhofer IGD Cogn. Comp. and Med. Imaging Fraunhoferstr. 5 64283 Darmstadt Germany

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

From hotelling to load balancing: Approximation and the principle of minimum differentiation

arXiv

引用

arXiv 2019年

作者： Feldotto, Matthias Lenzner, Pascal Molitor, Louise Skopalik, Alexander Heinz Nixdorf Institute Departement of Computer Science Paderborn University Paderborn Germany Algorithm Engineering Group Hasso Plattner Institute Potsdam Germany Faculty of Electrical Engineering Mathematic & Computer Science University of Twente Enschede Netherlands

Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotellings model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotellings model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotellings model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GENERATING ALL INVERTIBLE MATRICES BY ROW OPERATIONS

arXiv

引用

arXiv 2024年

作者： Gregor, Petr Hoang, Hung P. Merino, Arturo Mička, Ondřej Department of Theoretical Computer Science and Mathematical Logic Charles University Prague Czech Republic Algorithm and Complexity Group Faculty of Informatics TU Wien Austria Engineering Institute Universidad de O'Higgins Rancagua Chile

We show that all invertible n×n matrices over any finite field Fq can be generated in a Gray code fashion. More specifically, there exists a listing such that (1) each matrix appears exactly once, and (2) two consecutive matrices differ by adding or subtracting one row from a previous or subsequent row, or by multiplying or dividing a row by the generator of the multiplicative group of Fq. This even holds in the more general setting where the pairs of rows that can be added or subtracted are specified by an arbitrary transition tree that has to satisfy some mild constraints. Moreover, we can prescribe the first and the last matrix if n ≥ 3, or n = 2 and q > 2. In other words, the corresponding flip graph on all invertible n × n matrices over Fq is Hamilton connected if it is not a cycle. This solves yet another special case of Lovász conjecture on Hamiltonicity of vertex-transitive graphs. © 2024, CC BY-NC-ND.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Zeta Hull pursuits: learning nonconvex data hulls 14

Zeta Hull pursuits: learning nonconvex data hulls

引用

Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1

作者： Yuanjun Xiong Wei Liu Deli Zhao Xiaoou Tang Information Engineering Department The Chinese University of Hong Kong Hong Kong IBM T. J. Watson Research Center Yorktown Heights New York Advanced Algorithm Research Group HTC Beijing China

Selecting a small informative subset from a given dataset, also called column sampling, has drawn much attention in machine learning. For incorporating structured data information into column sampling, research efforts were devoted to the cases where data points are fitted with clusters, simplices, or general convex hulls. This paper aims to study nonconvex hull learning which has rarely been investigated in the literature. In order to learn data-adaptive nonconvex hulls, a novel approach is proposed based on a graph-theoretic measure that leverages graph cycles to characterize the structural complexities of input data points. Employing this measure, we present a greedy algorithmic framework, dubbed Zeta Hulls, to perform structured column sampling. The process of pursuing a Zeta hull involves the computation of matrix inverse. To accelerate the matrix inversion computation and reduce its space complexity as well, we exploit a low-rank approximation to the graph adjacency matrix by using an efficient anchor graph technique. Extensive experimental results show that data representation learned by Zeta Hulls can achieve state-of-the-art accuracy in text and image classification tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：