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

International Joint Conference on Neural Networks

作者： Xiang Zhang Naiyang Guan Long Lan Dacheng Tao Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology

ISBN: (纸本)9781479914821

Projective non-negative matrix factorization (PNMF) projects a set of examples onto a subspace spanned by a non-negative basis whose transpose is regarded as the projection matrix. Since PNMF learns a natural parts-based representation, it has been successfully used in text mining and pattern recognition. However, it is non-trivial to analyze the convergence of the optimization algorithms for PNMF because its objective function is non-convex. In this paper, we propose a Box-constrained PNMF (BPNMF) method to overcome this deficiency of PNMF. In particular, BPNMF introduces an auxiliary variable, i.e., the coefficients of examples, and incorporates the following two types of constraints: 1) each entry of the basis is non-negative and upper-bounded, i.e., box-constrained, and 2) the coefficients equal to the projected points of the examples. The first box constraint makes the basis to be bound and the second equality constraint keeps its equivalence to PNMF. Similar to PNMF, BPNMF is difficult because the objective function is non-convex. To solve BPNMF, we developed an efficient algorithm in the frame of augmented Lagrangian multiplier (ALM) method and proved that the ALM-based algorithm converges to local minima. Experimental results on two face image datasets demonstrate the effectiveness of BPNMF compared with the representative methods.

关键词： Accuracy Linear programming Training Convergence Optimization Face Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Learning Automata-based Adaptive Web Services Composition

Learning Automata-based Adaptive Web Services Composition

引用

2014 IEEE 5th International Conference on Software engineering and Service science

作者： Guoqiang Li Dandan Song Lejian Liao Fuzhen Sun Jianguang Du Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology

Service-oriented computing is a widely adopted paradigm in real *** the continuous evolution of services,adaptive service composition has always been a major *** is a big challenge to adjust the composition to be optimal in *** this paper,a learning automata-based approach is proposed to attack this *** consists of two important components: random environment and a learning *** former can be mapped to the service’s execution *** latter is responsible for the adaptation achievement using reward and penalty functions,while we take the service composition structures into account to compute the usefulness value of all *** last,simulation study has shown that our approach is efficient to find the optimal（sub-optimal） composition.

关键词： web service learning automata self-adaptive web service composition

来源：评论

学校读者我要写书评

暂无评论

A security framework in G-Hadoop for big data computing across distributed Cloud data centres

A security framework in G-Hadoop for big data computing acro...

引用

作者： Zhao, Jiaqi Wang, Lizhe Tao, Jie Chen, Jinjun Sun, Weiye Ranjan, Rajiv Kolodziej, Joanna Streit, Achim Georgakopoulos, Dimitrios School of Basic Sciences Changchun University of Technology China Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences China Steinbuch Center for Computing Karlsruhe Institute of Technology Germany Australia Information Engineering Laboratory CSIRO ICT Centre Australia Institute of Computer Science Cracow University of Technology Poland

MapReduce is regarded as an adequate programming model for large-scale data-intensive applications. The Hadoop framework is a well-known MapReduce implementation that runs the MapReduce tasks on a cluster system. G-Hadoop is an extension of the Hadoop MapReduce framework with the functionality of allowing the MapReduce tasks to run on multiple clusters. However, G-Hadoop simply reuses the user authentication and job submission mechanism of Hadoop, which is designed for a single cluster. This work proposes a new security model for G-Hadoop. The security model is based on several security solutions such as public key cryptography and the SSL protocol, and is dedicatedly designed for distributed environments. This security framework simplifies the users authentication and job submission process of the current G-Hadoop implementation with a single-sign-on approach. In addition, the designed security framework provides a number of different security mechanisms to protect the G-Hadoop system from traditional attacks. © 2014 Elsevier Inc.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Evolution-In-Materio: Solving Bin Packing Problems Using Materials

Evolution-In-Materio: Solving Bin Packing Problems Using Mat...

引用

IEEE International Conference on Evolvable Systems

作者： Maktuba Mohid Julian F. Miller Simon L. Harding Gunnar Tufte Odd Rune Lykkebo Mark Kieran Massey Michael C. Petty Department of Electronics University of York Department of Computer and Information Science Norwegian University of Science and Technology School of Engineering and Computing Sciences and Centre for Molecular and Nanoscale Electronics Durham University

ISBN: (纸本)9781479944781

Evolution-in-materio (EIM) is a form of intrinsic evolution in which evolutionary algorithms are allowed to manipulate physical variables that are applied to materials. This method aims to configure materials so that they solve computational problems without requiring a detailed understanding of the properties of the materials. The concept gained attention through the work of Adrian Thompson who in 1996 showed that evolution could be used to design circuits in FPGAS that exploited the physical properties of the underlying silicon [21]. In this paper, we show that using a purpose-built hardware platform called Mecobo, we can solve computational problems by evolving voltages, signals and the way they are applied to a microelectrode array with a chamber containing single-walled carbon nanotubes and a polymer, Here we demonstrate for the first time that this methodology can be applied to the well-known computational problem of bin packing. Results on benchmark problems show that the technique can obtain results reasonably close to the known global optima. This suggests that EIM is a promising method for configuring materials to carry out useful computation.

关键词： Materials Electrodes Biological cells Hardware Arrays computers Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Evolution-In-Materio: A Frequency Classifier Using Materials

Evolution-In-Materio: A Frequency Classifier Using Materials

引用

IEEE International Conference on Evolvable Systems

ISBN: (纸本)9781479944781

Evolution-in-materio (EIM) is a method that uses artificial evolution to exploit properties of materials to solve computational problems without requiring a detailed understanding of such properties. In this paper, we describe experiments using a purpose-built EIM platform called Mecobo to classify whether an applied square wave signal is above or below a user-defined threshold. This is the first demonstration that electrical configurations of materials (carbon nanotubes and a polymer) can be evolved to act as frequency classifiers.

关键词： Materials Electrodes Hardware Time-frequency analysis Arrays Voltage measurement Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Implementation and test of human-operated and human-like adaptive impedance controls on Baxter robot

Implementation and test of human-operated and human-like ada...

引用

15th Annual Conference on Advances in Autonomous Robotics Systems, TAROS 2014

作者： Liang, Peidong Yang, Chenguang Wang, Ning Li, Zhijun Li, Ruifeng Burdet, Etienne Centre for Robotics and Neural Systems School of Computing and Mathematics Plymouth University United Kingdom MOE Key Lab. of Autonomous System and Network Control College of Automation Science and Engineering South China University of Technology China State Key Laboratory of Robotics and System Harbin Institute of Technology China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Department of Bioengineering Imperial College of Science Technology and Medicine London United Kingdom

ISBN: (纸本)9783319104003

This paper presents an improved method to teleoperate impedance of a robot based on surface electromyography (EMG) and test it experimentally. Based on a linear mapping between EMG amplitude and stiffness, an incremental stiffness extraction method is developed, which uses instantaneous amplitude identified from EMG in a high frequency band, compensating for non-linear residual error in the linear mapping and preventing muscle fatigue from affecting the control. Experiments on one joint of the Baxter robot are carried out to test the approach in a disturbance attenuation task, and to compare it with automatic human-like impedance adaptation. The experimental results demonstrate that the new human operated impedance method is successful at attenuating disturbance, and results similarly to as automatic disturbance attenuation, thus demonstrating its efficiency. © 2014 Springer International Publishing.

关键词： Stiffness

来源：评论

学校读者我要写书评

暂无评论

Distributed search engine architecture based on topic specific searches

引用

AIP Conference Proceedings 2015年第1期1660卷

作者： Yousra Abudaqqa Ahmed Patel aSchool of Computer Science Centre of Software Technology and Management (SOFTAM) Faculty of Information Science and Technology (FTSM) Universiti Kebangsaan Malaysia 43600 UKM Bangi Selangor Malaysia bSchool of Computer Science Centre of Software Technology and Management (SOFTAM) Faculty of Information Science and Technology (FTSM) Universiti Kebangsaan Malaysia 43600 UKM Bangi Selangor Malaysia cVisiting Professor School of Computing and Information Systems Faculty of Science Engineering and Computing Kingston University Kingston upon Thames KT1 2EE United Kingdom

Indisputably, search engines (SEs) abound. The monumental growth of users performing online searches on the Web is a contending issue in the contemporary world nowadays. For example, there are tens of billions of searches performed everyday, which typically offer the users many irrelevant results which are time consuming and costly to the user. Based on the afore-going problem it has become a herculean task for existing Web SEs to provide complete, relevant and up-to-date information response to users’ search queries. To overcome this problem, we developed the Distributed Search Engine Architecture (DSEA), which is a new means of smart information query and retrieval of the World Wide Web (WWW). In DSEAs, multiple autonomous search engines, owned by different organizations or individuals, cooperate and act as a single search engine. This paper includes the work reported in this research focusing on development of DSEA, based on topic-specific specialised search engines. In DSEA, the results to specific queries could be provided by any of the participating search engines, for which the user is unaware of. The important design goal of using topic-specific search engines in the research is to build systems that can effectively be used by larger number of users simultaneously. Efficient and effective usage with good response is important, because it involves leveraging the vast amount of searched data from the World Wide Web, by categorising it into condensed focused topic -specific results that meet the user’s queries. This design model and the development of the DSEA adopt a Service Directory (SD) to route queries towards topic-specific document hosting SEs. It displays the most acceptable performance which is consistent with the requirements of the users. The evaluation results of the model return a very high priority score which is associated with each frequency of a keyword.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Smooth Cutting Operation Strategy for High Finishing Machining

Smooth Cutting Operation Strategy for High Finishing Machini...

引用

The 2012 International Conference on Advanced Material and Manufacturing science (ICAMMS 2012)

作者： Xiaofei Bu Hu Lin Long Chen National Engineering Research Centre for High-end CNC Shenyang Institute of Computing Technology of Chinese Academy of Sciences(SICT) School of Computer Science and Technology University of Science and Technology of China(USTC)

High finishing machining tool path generation methods are usually adopted for five-axis computer numerically controlled machining of sculptured surface *** quality of the high finishing machining has an important effect on that of the *** this paper,a high finishing machining tool path generation method is introduced to generate an optimal tool *** initial tool path is firstly created based on the constant scallop height,then the derived tool paths are generated as a kind of the diagonal curve by the initial tool path,and at last,the tool path smoothing algorithm is applied to the generated tool *** path algorithm can ensure higher level of smooth of the surface been ***,the results of simulation and experiment of the machining process are given to verify the smooth and applicability of the proposed method.

关键词： CNC finishing machining tool path

来源：评论

学校读者我要写书评

暂无评论

Search for Heavy Higgs Bosons A/H Decaying to a Top Quark Pair in pp Collisions at s=8 TeV with the ATLAS Detector

引用

Physical Review Letters 2017年第19期119卷 191803-191803页

作者： M. Aaboud G. Aad B. Abbott O. Abdinov B. Abeloos S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adamczyk J. Adelman M. Adersberger T. Adye A. A. Affolder T. Agatonovic-Jovin C. Agheorghiesei J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli S. Akatsuka H. Akerstedt T. P. A. Åkesson E. Akilli A. V. Akimov G. L. Alberghi J. Albert P. Albicocco M. J. Alconada Verzini S. C. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali M. Aliev G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. I. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos S. Amoroso G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov D. J. Antrim F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque V. Araujo Ferraz A. T. H. Arce R. E. Ardell F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes M. Backhaus P. Bagnaia M. Bahmani H. Bahrasemani J. T. Baines M. Bajic O. K. Baker E. M. Baldin P. Balek F. Balli W. K. Balunas E. Banas A. Bandyopadhyay Sw. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S Barisits J. T. Barkeloo T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska-Blenessy A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Basalaev Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Ontario Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene Oregon USA Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Italy Dipartimento di Fisica Un

A search for heavy pseudoscalar (A) and scalar (H) Higgs bosons decaying into a top quark pair (tt¯) has been performed with 20.3 fb−1 of proton-proton collision data collected by the ATLAS experiment at the Large Hadron Collider at a center-of-mass energy s=8 TeV. Interference effects between the signal process and standard model tt¯ production, which are expected to distort the signal shape from a single peak to a peak-dip structure, are taken into account. No significant deviation from the standard model prediction is observed in the tt¯ invariant mass spectrum in final states with an electron or muon, large missing transverse momentum, and at least four jets. The results are interpreted within the context of a type-II two-Higgs-doublet model. Exclusion limits on the signal strength are derived as a function of the mass mA/H and the ratio of the vacuum expectation values of the two Higgs fields, tanβ, for mA/H>500 GeV.

关键词： Extensions of Higgs sector Hypothetical particle physics models Hypothetical scalars Top quark Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

Search for the Dimuon Decay of the Higgs Boson in pp Collisions at s=13 TeV with the ATLAS Detector

引用

Physical Review Letters 2017年第5期119卷 051802-051802页

作者： M. Aaboud G. Aad B. Abbott O. Abdinov B. Abeloos S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adamczyk J. Adelman M. Adersberger T. Adye A. A. Affolder T. Agatonovic-Jovin C. Agheorghiesei J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli S. Akatsuka H. Akerstedt T. P. A. Åkesson E. Akilli A. V. Akimov G. L. Alberghi J. Albert P. Albicocco M. J. Alconada Verzini S. C. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali M. Aliev G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov D. J. Antrim F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque V. Araujo Ferraz A. T. H. Arce R. E. Ardell F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes M. Backhaus P. Bagnaia M. Bahmani H. Bahrasemani J. T. Baines M. Bajic O. K. Baker E. M. Baldin P. Balek F. Balli W. K. Balunas E. Banas A. Bandyopadhyay Sw. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S Barisits J. T. Barkeloo T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska-Blenessy A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Ba Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Ontario Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene Oregon USA Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Italy Dipartimen

A search for the dimuon decay of the Higgs boson was performed using data corresponding to an integrated luminosity of 36.1 fb−1 collected with the ATLAS detector in pp collisions at s=13 TeV at the Large Hadron Collider. No significant excess is observed above the expected background. The observed (expected) upper limit on the cross section times branching ratio is 3.0 (3.1) times the Standard Model prediction at the 95% confidence level for a Higgs boson mass of 125 GeV. When combined with the pp collision data at s=7 TeV and s=8 TeV, the observed (expected) upper limit is 2.8 (2.9) times the Standard Model prediction.

关键词： Electroweak interaction Leptonic, semileptonic & radiative decays Higgs bosons Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：