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

arXiv 2021年

作者： Hassanat, Ahmad B. Albustanji, Abeer Tarawneh, Ahmad S. Alrashidi, Malek Alharbi, Hani Alanazi, Mohammed Alghamdi, Mansoor Alkhazi, Ibrahim S. Prasath, V.B. Surya Faculty of Information Technology Mutah University Karak Jordan Ministry of environment Amman Jordan Department of Algorithm and Their Applications Eötvós Loránd University Budapest Hungary Computer Science Department Community College University of Tabuk Tabuk71491 Saudi Arabia Faculty of Computer and Information Systems Islamic University of Madinah Medina Saudi Arabia Centre for Computational Engineering Sciences Cranfield University United Kingdom College of Computers & Information Technology University of Tabuk Tabuk71491 Saudi Arabia Department of Electrical Engineering and Computer Science University of Cincinnati CincinnatiOH45267 United States

Biometric recognition based on the full face is an extensive research area. However, using only partially visible faces, such as in the case of veiled-persons, is a challenging task. Deep convolutional neural network (CNN) is used in this work to extract the features from veiled-person face images. We found that the sixth and the seventh fully connected layers, FC6 and FC7 respectively, in the structure of the VGG19 network provide robust features with each of these two layers containing 4096 features. The main objective of this work is to test the ability of deep learning based automated computer system to identify not only persons, but also to perform recognition of gender, age, and facial expressions such as eye smile. Our experimental results indicate that we obtain high accuracy for all the tasks. The best recorded accuracy values are up to 99.95% for identifying persons, 99.9% for gender recognition, 99.9% for age recognition and 80.9% for facial expression (eye smile) recognition. © 2021, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

White paper on broadband connectivity in 6G

arXiv

引用

arXiv 2020年

作者： Rajatheva, Nandana Atzeni, Italo Björnson, Emil Bourdoux, André Buzzi, Stefano Doré, Jean-Baptiste Erkucuk, Serhat Fuentes, Manuel Guan, Ke Hu, Yuzhou Huang, Xiaojing Hulkkonen, Jari Jornet, Josep Miquel Katz, Marcos Nilsson, Rickard Panayirci, Erdal Rabie, Khaled Rajapaksha, Nuwanthika Salehi, MohammadJavad Sarieddeen, Hadi Svensson, Tommy Tervo, Oskari Tölli, Antti Wu, Qingqing Xu, Wen Centre for Wireless Communications University of Oulu Finland Linköping University Sweden IMEC Belgium Department of Electrical and Information Engineering University of Cassino and Southern Latium Italy CEA-Leti France Department of Electrical and Electronics Engineering Kadir Has University Turkey Institute of Telecommunications and Multimedia Applications Universitat Politecnica de Valencia Spain State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing Engineering Research Center of High-speed Railway Broadband Mobile Communications China Algorithm Department ZTE Corporation China School of Electrical and Data Engineering Faculty of Engineering and Information Technology University of Technology Sydney Australia Nokia Bell Labs Finland Department of Electrical and Computer Engineering Institute for the Wireless Internet of Things Northeastern University United States Department of Computer Science Electrical and Space Engineering Luleå University of Technology Sweden Department of Engineering Manchester Metropolitan University United Kingdom Division of Computer Electrical and Mathematical Sciences and Engineering King Abdullah University of Science and Technology Saudi Arabia Department of Electrical Engineering Chalmers University of Technology Sweden Department of Electrical and Computer Engineering National University of Singapore Singapore Huawei Technologies Germany

This white paper explores the road to implementing broadband connectivity in future 6G wireless systems. Different categories of use cases are considered, from extreme capacity with peak data rates up to 1 Tbps, to raising the typical data rates by orders-of-magnitude, to support broadband connectivity at railway speeds up to 1000 km/h. To achieve these goals, not only the terrestrial networks will be evolved but they will also be integrated with satellite networks, all facilitating autonomous systems and various interconnected structures. We believe that several categories of enablers at the infrastructure, spectrum, and protocol/algorithmic levels are required to realize the intended broadband connectivity goals in 6G. At the infrastructure level, we consider ultra-massive MIMO technology (possibly implemented using holographic radio), intelligent reflecting surfaces, user-centric and scalable cell-free networking, integrated access and backhaul, and integrated space and terrestrial networks. At the spectrum level, the network must seamlessly utilize sub-6 GHz bands for coverage and spatial multiplexing of many devices, while higher bands will be used for pushing the peak rates of point-to-point links. The latter path will lead to THz communications complemented by visible light communications in specific scenarios. At the protocol/algorithmic level, the enablers include improved coding, modulation, and waveforms to achieve lower latencies, higher reliability, and reduced complexity. Different options will be needed to optimally support different use cases. The resource efficiency can be further improved by using various combinations of full-duplex radios, interference management based on rate-splitting, machine-learning-based optimization, coded caching, and broadcasting. Finally, the three levels of enablers must be utilized not only to deliver better broadband services in urban areas, but also to provide full-coverage broadband connectivity must be one of the k

关键词： Visible light communication

来源：评论

学校读者我要写书评

暂无评论

Motion generation of multi-legged robot in complex terrains by using estimation of distribution algorithm

Motion generation of multi-legged robot in complex terrains ...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Min Jiang Zhongqiang Huang Guiying Jiang Minghui Shi Xiangxiang Zeng Department of Cognitive Science and Fujian Key Laboratory of Brain-inspired Computing Technique and Applications (Xiamen University). an algorithm engineer of Sangfor Technologies Company. College of Foreign Languages of Xiamen University Department of Computer Science of Xiamen University

Motion generation is one of the most important and challenging problems in multi-legged robot research. Most of the existing methods show a good fulfillment of the requirements of robots in structured environments. However, it still faces many challenges to generate motions effectively and quickly for multi-legged robot works in complex environments. In this paper, we put forward a method which converts the motion generation problem into a Multi-objective Optimization Problem (MOP), which will make the robot not only run as fast as possible, but also save energy, and then use a distribution estimation algorithm, the trend prediction model method, to obtain motions for a six-legged robot. Experiments show that this method is effective.

关键词： Legged locomotion Optimization Mathematical model Estimation Robot kinematics Analytical models

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Surya Prasath, V.B. Abu Alfeilat, Haneen Arafat Lasassmeh, Omar Hassanat, Ahmad B.A. Tarawneh, Ahmad S. Division of Biomedical Informatics Cincinnati Children’s Hospital Medical Center OH45229 United States Department of Pediatrics University of Cincinnati College of Medicine CincinnatiOH United States Department of Biomedical Informatics College of Medicine University of Cincinnati OH45267 United States Department of Electrical Engineering and Computer Science University of Cincinnati OH45221 United States Department of Information Technology Mutah University Karak Jordan Department of Algorithm and Their Applications Etvs Lornd University Budapest Hungary

The K-nearest neighbor (KNN) classifier is one of the simplest and most common classifiers, yet its performance competes with the most complex classifiers in the literature. The core of this classifier depends mainly on measuring the distance or similarity between the tested examples and the training examples. This raises a major question about which distance measures to be used for the KNN classifier among a large number of distance and similarity measures available? This review attempts to answer this question through evaluating the performance (measured by accuracy, precision and recall) of the KNN using a large number of distance measures, tested on a number of real-world datasets, with and without adding different levels of noise. The experimental results show that the performance of KNN classifier depends significantly on the distance used, and the results showed large gaps between the performances of different distances. We found that a recently proposed non-convex distance performed the best when applied on most datasets comparing to the other tested distances. In addition, the performance of the KNN with this top performing distance degraded only about 20% while the noise level reaches 90%, this is true for most of the distances used as well. This means that the KNN classifier using any of the top 10 distances tolerate noise to a certain degree. Moreover, the results show that some distances are less affected by the added noise comparing to other distances. Copyright © 2017, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Multistart Hooke and Jeeves filter method for mixed variable optimization

引用

AIP Conference Proceedings 2013年第1期1558卷 614-617页

作者： Florbela P. Fernandes M. Fernanda P. Costa Edite M. G. P. Fernandes Ana Maria A. C. Rocha Department of Mathematics Polytechnic Institute of Braganca Portugal and CMAT-University of Minho Portugal Department of Mathematics and Applications Centre of Mathematics University of Minho 4710-057 Braga Portugal Algorithm R&D Centre University of Minho Portugal

In this study, we propose an extended version of the Hooke and Jeeves algorithm that uses a simple heuristic to handle integer and/or binary variables and a filter set methodology to handle constraints. This proposal is integrated into a multistart method as a local solver and it is repeatedly called in order to compute different optimal solutions. Then, the best of all stored optimal solutions is selected as the global optimum. The performance of the new method is tested on benchmark problems. Its effectiveness is emphasized by a comparison with other well-known stochastic solvers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria Pareto optimised planning method for distillation plants with non-sharp splits 21

Multi-criteria Pareto optimised planning method for distilla...

引用

21st International Conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems, ECOS 2008

作者： Kausch, Christoph Preuss, Mike Henrich, Frank Department of Technical Thermodynamics Aachen University Germany Department of Algorithm Engineering Technical University of Dortmund Germany Siemens AG Power Generation Industrial Applications Duisburg Germany

ISBN: (纸本)9788392238140

The investigation of diverse structural alternatives and modes of operation of a distillation plant results in highly complex search topologies including multi-modalities and non-convexities, making very flexible (e.g. evolutionary) optimisation algorithms necessary to maintain diversity in the Pareto sets, i.e. to assure that there are enough different solutions with clearly differing objective function values. On the other hand, virtually identical solution sets can be found which stem from utterly different configurations, hence it is possible to take into account additional decision factors besides the pair of objective functions already optimised. Thus even greater flexibility is possible in the design and planning phase. With the method described in the paper (multiple runs of a standard EMOA combined with a rigorous simulation) we analyse different combinations of conflicting objective functions and based on the respective sets of optimal solutions, different configurations and operation modes are discussed with respect to the variables of the separation task. In a further step we investigate a distillation with regard to key cost factors by means of scenarios and analyse the impact on the solution space and on the attained Pareto sets and discuss to what extent a Pareto set with a suitable choice of objective functions already contains information regarding the sensitivity to key cost factors. We thus show the potential of the described approach in the initial phase of such a project and underline the necessity for optimisation based decision aids for the planning engineer and specifically the benefit gained by the multi-criteria Pareto approach.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

An improved calculation method for fiber Raman amplifier equations with multi-wavelength pumping

引用

Chinese Optics Letters 2004年第8期2卷 441-444页

作者：常建华张明德孙小菡 Department of Electronic Engineering Southeast University Nanjing 210096 Department of Electronic Engineering Southeast University Nanjing 210096 novel numerical method for fiber Raman amplifier (FRA) from standard propagation equations is presented and derived based on the one-step method for ordinary differential equation (ODE). The proposed algorithm is effective in solving FRA equations including all the interactions among pumps signals and noises. Applications of the numerical analysis to practical FRA-based systems show a great reduction in computation time in comparison with the average power method and the fourth-order Runge-Kutta (RK) method under the same condition. Also the proposed method can decrease the computing time over three orders of magnitude with excellent accuracy promises in comparison with the direct integration method.

A novel numerical method for fiber Raman amplifier (FRA) from standard propagation equations is presented and derived based on the one-step method for ordinary differential equation (ODE). The proposed algorithm is effective in solving FRA equations including all the interactions among pumps, signals, and noises. applications of the numerical analysis to practical FRA-based systems show a great reduction in computation time in comparison with the average power method and the fourth-order Runge-Kutta (RK) method, under the same condition. Also the proposed method can decrease the computing time over three orders of magnitude with excellent accuracy promises in comparison with the direct integration method.

关键词： length FRA An improved calculation method for fiber Raman amplifier equations with multi-wavelength pumping

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR ALGEBRAIC ANALYSIS OF THE TLM algorithm

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1995年第1期8卷 61-71页

作者： WITWIT, ARM WILKINSON, AJ PULKO, SH Department of Electronic Engineering The University of Hull Hull HU6 7RX U.K. Abdul Mehdi Witwit was born in Babylon in 1965. He graduated in Electronic Engineering from the Univeristy of Hull in 1990. He has recently submitted his Ph.D. thesis on the topic of meshing in TLM diffusion problems. Anthony James Wilkinson graduated from the niversity of Hull with a B.Sc. in Electronic Engineering in 1982 and a Ph.D. in adaptive control in 1987. He is currently a lecturer in the Department of Electronic Engineering where his research interests include TLM algorithms and computer control of magnetostrictive actuation. Susan Pulko obtained a B.Sc. in physics together with an ARCS from Imperial College (London) in 1977. This was followed by a Ph.D. from the University of Nottingham in 1981. Her current research interests centre on the TLM algorithm and on its application to a range of physical processes especially as applied to manufacturing. Current work involves development of the algorithm itself and TLM applications in the glass and ceramic industries.

An analogy is described between the TLM algorithm and discrete state-space control theory. The analogy is used to derive the characteristic equations corresponding to parameterized model structures. Characteristic equations corresponding to several widely used node structures are derived by this means and found to be consistent with the observed behaviour of corresponding TLM models. An example is given of the use of the analogy in the predictive mode.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Coarse-grain parallel genetic algorithms: categorization and new approach

Coarse-grain parallel genetic algorithms: categorization and...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Shyh-Chang Lin W.F. Punch E.D. Goodman Genetic Algorithm Research and Applications Group Case Center and Department of Computer Science Michigan State University USA Dept. of Comput. Sci. Michigan State Univ. East Lansing MI USA

This paper describes a number of different coarse-grain GA's, including various migration strategies and connectivity schemes to address the premature convergence problem. These approaches are evaluated on a graph partitioning problem. Our experiments showed, first, that the sequential GA's used are not as effective as parallel GA's for this graph partition problem. Second, for coarse-grain GA's, the results indicate that using a large number of nodes and exchanging individuals asynchronously among them is very effective. Third, GA's that exchange solutions based on population similarity instead of a fixed connection topology get better results without any degradation in speed. Finally, we propose a new coarse-grained GA architecture, the Injection Island GA (iiGA). The preliminary results of iiGA's show them to be a promising new approach to coarse-grain GA's.< >

关键词： Genetic algorithms Convergence Genetic mutations Adaptive systems Circuit testing Application software Computer science Topology Optimization methods Image recognition

来源：评论

学校读者我要写书评

暂无评论

A computational study of wingtip vortex flowfield

A computational study of wingtip vortex flowfield

引用

AIAA 23rd Fluid Dynamics, Plasmadynamics, and Lasers Conference, 1993

作者： Dacles-Mariani, Jennifer Rogers, Stuart Kwak, Dochan Zilliac, Greg Chow, Jim Computational Algorithm and Applications Branch NASA Ames Research Center Moffett FieldCA United States Fluid Mechanics Laboratory NASA Ames Research Center Moffett FieldCA United States Mechanical Engineering Department Stanford University StanfordCA United States

The near-field behavior of a wingtip vortex flow is studied computationally using an incompressible flow solver for the Navier-Stokes equations based on the artificial compressibility method. Inaccuracies in current computational studies are addressed, especially, the role of numerical errors and transition/turbulence modeling. A subset problem is devised in order to make the study of vortex preservation more tractable. As part of the numerical checks, the flow is first run laminar while performing a systematic grid refinement study for the subset problem. Further studies on the numerical errors are conducted with the measured Reynolds stresses introduced into the momentum equations as source terms. As a preliminary study of turbulent flows, the one-equation Baldwin-Barth turbulence model is implemented as well as the approximation of the production term. The full-geometry case is computed using 1.1 million grid points. The results are compared with experiment © 1993 American Institute of Aeronautics and Aerodynamics, Inc. All rights reserved.

关键词： Turbulence models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：