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

作者： Lager, Ioan E. De Hoop, Adrianus T. Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Department of Microwave Technology and Systems for Radar Mekelweg 4 2628 CD Delft Netherlands Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Laboratory of Electromagnetic Research Mekelweg 4 2628 CD Delft Netherlands

ISBN: (纸本)9788882020743

The time-domain receiving properties of a multi-mode cylindrical waveguide antenna are investigated. The configurational properties of the antenna are characterized by the time-domain scattering matrix that interrelates the time-domain amplitudes of the axial modal constituents traveling towards and away from the radiating aperture of the waveguide, which is taken as their reference plane. The excitation of the system by an incident field is expressed as an excitation integral over the aperture that results from the application of the pertaining time-domain Lorentz reciprocity relation of the time-convolution type. Numerical results illustrate the complexity of the changes in pulse shape (with the associated loss of signal integrity) that occur upon the coupling of the incident wave to the different modal constituents. © 2011 EurAAP.

关键词： Circular waveguides

来源：评论

学校读者我要写书评

暂无评论

Improved servomechanism control design - Nonswitching case

Improved servomechanism control design - Nonswitching case

引用

作者： Salton, Aurélio T. Chen, Zhiyong Fu, Minyue School of Electrical Engineering and Computer Science University of Newcastle Australia Pontifícia Universidade Católica Do Rio Grande Do sul Brazil State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology China Department of Control Science and Engineering Zhejiang University China

ISBN: (纸本)9783902661937

This paper attempts to achieve time-optimal performance for servomechanisms via a practical feedback control law. An improvement over the traditional Proximate Time Optimal Servomechanism (PTOS) is proposed in order to eliminate the conservatism present in the controller. The original PTOS switches from the nonlinear approximation of Time Optimal Control (TOC) to a linear controller as the system approaches the reference point. This switching results in a compromise in performance inasmuch as the linear controller is not sufficiently aggressive to settle the system output with acceptable levels of overshoot. The proposed controller eliminates the necessity of the switching function by making use of an elaborate nonlinear control law. Simulations and experimental results show that the proposed design achieves levels of performance comparable to that of the theoretical TOC. © 2011 IFAC.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Some Advanced Techniques in Reducing Time for Path Planning Based on Visibility Graph

Some Advanced Techniques in Reducing Time for Path Planning ...

引用

International Conference on Knowledge and systems engineering (KSE)

作者： Tran Thi Nhu Nguyet Tran Van Hoai Nguyen Anh Thi Faculty of Computer Science and Engineering Ho Chi Minh City University of Technology Ho Chi Minh Vietnam Key Laboratory on Digital Control and System Engineering (DCSE) VNU-HCM Ho Chi Minh Vietnam

This paper describes some techniques based on polygon aggregation in reducing time for visibility graph in case of many obstacles. In path planning, the approaches are commonly used such as search-based, sampling-based or combinatorial planning. And visibility graph is one of the roadmaps of combinatorial planning. Building a visibility graph is a main phase in the whole process and theoretically it takes θ(nlogn). However, with some practical applications, for example one which has a large number of obstacles, this phase is very time-consuming. With the techniques proposed, the experiment result shows that the computing time gets a reduction factor of one-third approximately when the aggregation are used in preprocessing of building visibility graph.

关键词： Path planning Planning Clustering algorithms Complexity theory Educational institutions Robots Merging

来源：评论

学校读者我要写书评

暂无评论

Modified Banker's algorithm for scheduling in multi-AGV systems

Modified Banker's algorithm for scheduling in multi-AGV syst...

引用

IEEE International Conference on Automation Science and engineering (CASE)

作者： Luka Kalinovcic Tamara Petrovic Stjepan Bogdan Vedran Bobanac Laboratory for Robotics and Intelligent Control Systems Department of Control and Computer Engineering Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia Laboratory for Renewable Energy Sources Department of Control and Computer Engineering Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia

In today's highly complex multi-AGV systems key research objective is finding a scheduling and routing policy that avoids deadlock while assuring that vehicle utilization is as high as possible. It is well known that finding such an optimal policy is a NP-hard task in general case. Therefore, big part of the research is oriented towards finding various suboptimal policies that can be applied to real world plants. In this paper we propose modified Banker's algorithm for scheduling in multi-AGV systems. A predetermined mission's path is executed in a way that some non-safe states are allowed in order to achieve better utilization of vehicles. A graph-based method of polynomial complexity for verification of these states is given. Algorithm is tested on a layout of a real plant for packing and warehousing palettes. Results shown at the end of the paper demonstrate advantages of the proposed method compared with other methods based on Banker's algorithm.

关键词： Vehicles system recovery Layout Resource management Job shop scheduling Workstations

来源：评论

学校读者我要写书评

暂无评论

Search for tt¯ resonances in the lepton plus jets final state with ATLAS using 4.7 fb−1 of pp collisions at s=7 TeV

引用

Physical Review D 2013年第1期88卷 012004-012004页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek A. A. Abdelalim O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit P. Adragna T. Adye S. Aefsky J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen F. Ahles A. Ahmad M. Ahsan G. Aielli T. P. A. Åkesson G. Akimoto A. V. Akimov M. A. Alam J. Albert S. Albrand M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga S. Angelidakis P. Anger A. Angerami F. Anghinolfi A. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce S. Arfaoui J-F. Arguin S. Argyropoulos E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal A. Artamonov G. Artoni D. Arutinov S. Asai S. Ask B. Åsman L. Asquith K. Assamagan R. Astalos A. Astbury M. Atkinson B. Auerbach E. Auge K. Augsten M. Aurousseau G. Avolio D. Axen G. Azuelos Y. Azuma M. A. Baak G. Baccaglioni C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagnaia Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker P. Balek F. Balli E. Banas P. Banerjee Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov T. Barber E. L. Barberio D. Barberis M. Barbero D. Y. Bardin T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton V. Bartsch A. Basye R. L. Bates L. Batkova J. R. Batley A. Battaglia M Fakultät für Mathematik und Physik Albert-Ludwigs-Universität Freiburg Germany Physikalisches Institut University of Bonn Bonn Germany Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona and ICREA Barcelona Spain LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Section de Physique Université de Genève Geneva Switzerland Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater Oklahoma USA Department of Physics and Astronomy Michigan State University East Lansing Michigan USA Department of Physics University of Toronto Toronto Ontario Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat à l’Energie Atomique et aux Energies Alternatives) Gif-sur-Yvette France Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Italy ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton New York USA Department of Physics Hampton University Hampton Virginia USA Department of Physics Yale University New Haven Connecticut USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany School of Physics and Astronomy Queen Mary University of London London United Kingdom Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham Massachusetts USA Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada

A search for new particles that decay into top quark pairs (tt¯) is performed with the ATLAS experiment at the LHC using an integrated luminosity of 4.7 fb−1 of proton–proton (pp) collision data collected at a center-of-mass energy s=7 TeV. In the tt¯→WbWb decay, the lepton plus jets final state is used, where one W boson decays leptonically and the other hadronically. The tt¯ system is reconstructed using both small-radius and large-radius jets, the latter being supplemented by a jet substructure analysis. A search for local excesses in the number of data events compared to the Standard Model expectation in the tt¯ invariant mass spectrum is performed. No evidence for a tt¯ resonance is found and 95% credibility-level limits on the production rate are determined for massive states predicted in two benchmark models. The upper limits on the cross section times branching ratio of a narrow Z′ resonance range from 5.1 pb for a boson mass of 0.5 TeV to 0.03 pb for a mass of 3 TeV. A narrow leptophobic topcolor Z′ resonance with a mass below 1.74 TeV is excluded. Limits are also derived for a broad color-octet resonance with Γ/m=15.3%. A Kaluza–Klein excitation of the gluon in a Randall–Sundrum model is excluded for masses below 2.07 TeV.

关键词： LEPTONS (Nuclear physics) PROTON-proton interactions MASS spectrometry STANDARD model (Nuclear physics) RESONANCE KALUZA-Klein excitations

来源：评论

学校读者我要写书评

暂无评论

A novel type of trigonometric neural network trained by Extended Kalman Filter

A novel type of trigonometric neural network trained by Exte...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： M. Norouzi M. Mansouri M. Teshnehlab M. Aliyari Shoorehdeli Faculty of Engineering Department of Computer Engineering Science and Research Branch Islamic Azad University Iran Intelligent System Laboratory (ISLAB) Faculty of Electrical Engineering Control Department K.N. Toosi University of Technology Tehran Iran Faculty of Electrical Engineering Department of Mechatronics Engineering Advanced Process Automation &Control Laboratory (APAC) K.N. Toosi University of Technology Tehran Iran

In this study, a new type of trigonometric neural network is presented by adding frequency and phase to trigonometric activation functions. The proposed trigonometric neural network has more flexibility in comparison with conventional trigonometric neural networks and even other types of neural networks. Due to the low convergence rate and high posibility of trapping in a local minimum of backpropagation algorithm, Extended Kalman Filter algorithm is used to train the neural network's parameters which they appear in a nonlinear form. The Simulation of the suggested neural network based on the prediction of Mackey-Glass time series and identification of a nonlinear dynamic ystem reveals the efficiency of the proposed network. To show the efficiency of this method, the results are compared with the results of the others.

关键词： Biological neural networks Kalman filters Equations Neurons Vectors Covariance matrix Mathematical model

来源：评论

学校读者我要写书评

暂无评论

An agent methodology for processes, the environment, and services

An agent methodology for processes, the environment, and ser...

引用

International Conference on Intelligent Transportation

作者： Lúcio S. Passos Rosaldo J. F. Rossetti Joaquim Gabriel Department of Informatics Engineering and the Artificial Intelligence and Computer Science Laboratory (LIACC) Faculty of Engineering University of Porto Portugal Associated Laboratory in Energy Transportation and Aeronautics (LAETA) Faculty of Engineering University of Porto Portugal

Implementing and deploying a complete multi-agent system in whatever domain, especially those that are inherently complex and dynamic, is undoubtedly a very hard and time-consuming task. This paper analyzes the adequacy of traditional approaches in the field of Agent-Oriented Software engineering to create adequate multi-agent systems applicable to the transportation domain. Our findings suggested that, albeit some approaches are intended to be generic enough to represent a wide range of different domains, intelligent transportation systems and more specifically the whole complexity of future urban transport are not totally supported. We propose a novel methodology where the concept of services is considered as peer of agents, ambient and processes. Also services rise as prominent elements in the modeling phase. The approach, illustrated as a typical scenario in the transport domain, is instantiated, which serves to clarify the whole process and main concepts in our modeling methodology.

关键词： Unified modeling language Analytical models Transportation Protocols Organizations Databases

来源：评论

学校读者我要写书评

暂无评论

Automated modeling of custom processors for DCT algorithm

Automated modeling of custom processors for DCT algorithm

引用

Proceedings of the International Convention MIPRO

作者： D. Ivošević V. Sruk Faculty of Electrical Engineering and Computing Department of Electronic Microelectronics Computer and Intelligent System University of Zagreb Croatia

The needs for automated digital system design rise with constant technology improvements and time-to-market shortening. High-level synthesis tools cope with this problem by raising the design specification to a higher level. We have implemented the methodology of custom processor automated modeling for DCT algorithm. This algorithm is often used in signal and image processing applications. At front end, the methodology assumes C code input specification as it is the case of many high-level synthesis tools. C programming language popularity offers the applicability for a broader spectrum of users. At back end, logic synthesis tools produce the FPGA implementation of the algorithm. The results are evaluated in terms of execution cycles required for completing the algorithm and processor's datapath components allocations, and compared to previous work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Image watermark retrieval based on majority voting from different color spaces

Image watermark retrieval based on majority voting from diff...

引用

International Conference on Electrical engineering/Electronics, computer, Telecommunications and Information Technology, ECTI-CON

作者： Thitiporn Pramoun Narong Mettripun Thumrongrat Amornraksa Multimedia Communications Laboratory Computer Engineering Department Faculty of Engineering King Mongkut's University of Technology Thonburi Bangkok Thailand

In this paper, a new watermark retrieval method is proposed to be used in the digital watermarking based on the modification of image pixels in order to improve the accuracy of the retrieval watermark and simultaneously enhance the robustness of the embedded watermark. Conceptually, different color spaces usually display different discriminating energy. The watermark embedded in blue component of RGB color space can thus be retrieved from other components in different color spaces i.e. YCbCr and YIQ. Since the quality of watermark in blue components is sometimes better and worse than the one dispersed to the components in different color spaces, majority voting from three different color spaces is used to decide the true value of retrieved watermark bit. The experimental results on a set of standard testing images show the improved accuracy of the retrieved watermark compared to the watermarking scheme with the existing retrieval method. The enhanced robustness of the embedded watermark against various attacks is also evaluated and compared.

关键词： Image color analysis Watermarking Robustness PSNR computers Pixel

来源：评论

学校读者我要写书评

暂无评论

Reducing prediction error in watermark retrieval process by multiple non-linear filtering

Reducing prediction error in watermark retrieval process by ...

引用

International Conference on Electrical engineering/Electronics, computer, Telecommunications and Information Technology, ECTI-CON

作者： Narong Mettripun Nwe Ni Hlaing Thitiporn Pramoun Thumrongrat Amornraksa Multimedia Communication Laboratory Computer Engineering Department Faculty of Engineering King Mongkut's University of Technology Thonburi Bangkok Thailand

This paper presents an improving method used in the watermark retrieval process of digital watermarking for color image based on the modification of image pixels. Based on the prior knowledge of the embedded watermark pattern, some errors from the watermark bit prediction process can be reduced simply by changing the predicted bit value in accordance with all predicted bits value within the prediction area. To achieve this, we simply implement a non-linear filter with different characteristics to the predicted watermark bits, and output the result as the retrieved watermark. With the proposed method, the performance in both accuracy of the retrieved watermark and robustness of the embedded watermark can be improved. The experimental results show the improvements in term of NC at the equivalent PSNR after implementing our retrieval method with the existing watermarking scheme, compared to the previous methods. The improved robustness of the embedded watermark against common image processing based attacks and geometrical attacks are also evaluated and compared.

关键词： PSNR Watermarking Brightness computers Pixel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：