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

6th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2012

作者： Vega-Barbas, Mario Casado-Mansilla, Diego Valero, Miguel A. López-De-Ipiña, Diego Bravo, José Flórez, Francisco T SIC Research Group Dep. of Telematic Engineering and Architectures Polytechnic University of Madrid 28030 Madrid Spain Deusto Institute of Technology - DeustoTech University of Deusto Avda. Universidades 24 48007 - Bilbao Spain MAmI Research Lab. UCLM Spain Dept. of Computer Technology University of Alicante 03080 Alicante Spain

ISBN: (纸本)9780769546841

The presented work aims to contribute towards the standardization and the interoperability off the Future Internet through an open and scalable architecture design. We present S3OiA as a syntactic/semantic Service-Oriented Architecture that allows the integration of any type of object or device, not mattering their nature, on the Internet of Things. Moreover, the architecture makes possible the use of underlying heterogeneous resources as a substrate for the automatic composition of complex applications through a semantic Triple Space paradigm. Created applications are dynamic and adaptive since they are able to evolve dep.nding on the context where they are executed. The validation scenario of this architecture encompasses areas which are prone to involve human beings in order to promote personal autonomy, such as home-care automation environments and Ambient Assisted Living. © 2012 IEEE.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Eye detection based on skin color analysis with different poses under varying illumination environment

Eye detection based on skin color analysis with different po...

引用

5th International Conference on Genetic and Evolutionary Computing, ICGEC2011

作者： Huang, Deng-Yuan Lin, Ta-Wei Hu, Wu-Chih Chen, Mu-Song Dep. of Electrical Engineering Dayeh University Changhua Taiwan Dep. of Computer Science and Information Engineering National Penghu University of Science and Technology Penghu Taiwan

ISBN: (纸本)9780769544496

In this paper, we propose a method of eye detection based on skin color analysis under varying illumination. The proposed method consists of several phases, including color conversion, skin color segmentation and face mask calculation, facial feature extraction and eye candidate determination, and detection of human eyes. To eliminate the effect of lighting change on the performance of eye detection, color conversion is first performed. Face mask calculation based on skin color segmentation is then carried out to reduce the possible searching region of human eyes. Eye candidates detected using facial features are used to define the possible human eyes. Human eyes are thus detected by the geometric features of gravity and spatial centers for these eye candidates. Results show that the proposed method works well for faces with different poses and multiple faces under varying illumination. The eye detection time of 21.8 ms is achieved for an image of size 213×320 pixels, indicating computational efficiency of the proposed system. © 2011 IEEE.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficient processing power reservation approach to imporove real-time task schedulability and relaibaility

引用

International Journal of computer Science Issues 2012年第5 5-2期9卷 196-205页

作者： Youssef, Ahmed E. Hamdy, Abeer Ammar, Reda Faculty of Engineering-Helwan Helwan University Cairo Egypt Department of Information Systems King Saud University Riyadh 11543 Saudi Arabia Department of Computers and Systems Electronic Research Institute Faculty of informatics and Computer Science British University Egypt Dep. of Computer Science and Engineering University of Connecticut Storrs CT 06269-3155 United States

Efficient utilization of the computational resources is an urgent demand especially if real time constraints should be guaranteed. Moreover, an acceptable level of reliability should be provided due to the critical nature of some real time applications. This paper proposes a new approach for processing power reservations that efficiently utilizes all the available processing power to improve reliability and schedulability of indep.ndent real time tasks on a uniprocessor. The basic idea of the proposed approach is to use all of the available processing power in the time interval between the arrivals of two successive tasks or when an existing task dep.rts. The advantages of this mechanism are: 1) it reduces the execution time required for each task and hence increases its reliability. 2) At the arrival of a new task;the processing power requirements for the executing tasks to meet their deadlines are smaller, which gives the new arriving tasks higher chances to be accommodated with the existing ones. 3) Efficient processing power utilization may reduce the power consumption in processors with dynamic voltage scaling. An illustration example and simulation experiments showed that our approach provides a more reliable scheduling scheme with higher acceptance rate compared to the traditional approach based on Rialto operating system. © 2012 International Journal of computer Science Issues.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Measurement of the inclusive jet cross-section in proton-proton collisions at s = 7 TeV using 4.5 fb −1 of data with the ATLAS detector

引用

Journal of High Energy Physics 2015年第9期2015卷 1-39页

作者： G. Aad B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport J. Almond A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen 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 I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. 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 J. P. Araque A. T. H. Arce J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio G. Azuelos Y. Azuma M. A. Baak A. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura V. Bansal H. S. Bansil L. Barak S. P. Baranov E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos V. Bartsch A. Bassalat A. Basye R. L. Bates J. R. Batley M. Battaglia M. Battistin F. Bauer H CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States Institute of Physics Academia Sinica Taipei Taiwan LAL Université Paris-Sud and CNRS/IN2P3 Orsay France 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 United States Department of Physics and Astronomy Michigan State University East Lansing United States Department of Physics University of Toronto Toronto Canada 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 CERN Geneva Switzerland Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton United States Department of Physics Yale University New Haven United States 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 Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland Department of Physics Boston University Boston United States Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN

It was found that the non-perturbative corrections calculated using Pythia with the Perugia 2011 tune did not include the effect of the underlying event. The affected correction factors were recomputed using the Pythia 6.427 generator. These corrections are applied as baseline to the NLO pQCD calculations and thus the central values of the theoretical predictions have changed by a few percent with the new corrections. This has a minor impact on the agreement between the data and the theoretical predictions. Figures 2 and 6 to 13, and all the tables have been updated with the new values. A few sentences in the discussion in sections 5.2 and 9 were altered or removed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrated usability model for the multimedia mobile device development

Integrated usability model for the multimedia mobile device ...

引用

2nd International Conference on Multimedia technology, ICMT 2011

作者： Tsao, Yung-Chung Tsai, Yin-Te Hsu, Kevin Chihcheng Hsuen, Hsin-Kuang Dep. of Information Management National Central University Taiwan Dep. of Computer Science and Communication Engineering Providence University Taiwan

ISBN: (纸本)9781612847740

The mobile devices have grown rapidly with the progresses of information technology those years. The mobile devices, such as i-Phone, i-Pad, Tablet PC and smart-phone, have become personal and business tools. Those devices are specially developed for mobile users on the basis of the conceptual design of personal digital assistant (PDA) long time ago, but the scopes of the usages extend much more extensive through integrated multimedia needs. This paper proposes a model called integrated usability model (IUM), derived from the technology acceptance model (TAM), to transfer the design criteria into the design guidelines. By using IUM, the developers for multimedia mobile device can use the conceptual indicators like mobile, integration and convenience to reduce the large-scale design factors and evaluate the capability and acceptance for the users. It turns out that the developers can speed up the design processes and avoid the repeated and time-consuming reworks. A mobile multimedia device development for the integrated graphic hand-sketch tablet is presented in this paper. This development uses IUM to reduce the design criteria and then transfer the result criteria into design guidelines. This paper demonstrates the practices of the multi-demand product design as the case validation of IUM. © 2011 IEEE.

关键词： Conceptual design

来源：评论

学校读者我要写书评

暂无评论

Connecting two trees with optimal routing cost

Connecting two trees with optimal routing cost

引用

23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

作者： Kao, Mong-Jen Katz, Bastian Krug, Marcus Lee, D.T. Nöllenburg, Martin Rutter, Ignaz Wagner, Dorothea Dep. of Computer Science and Information Engineering National Taiwan University Taiwan Germany

We study the problem of finding the optimal connection between two disconnected vertex-weighted trees. We are given a distance function on the vertices and seek to minimize the routing cost of the tree resulting from adding one single edge between the two trees. The routing cost is defined as the sum of the weighted distances between all pairs of vertices in the induced tree-metric. The problem arises when augmenting and/or repairing communication networks or infrastructure networks. We present an asymptotically optimal quadratic-time algorithm for the general case and show that the problem can be solved more efficiently for the Euclidean metric, when vertices are mapped to points in the plane, as well as for compactly representable graph metrics.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

A new approach for solving Hybrid Flowshop scheduling problems through evolutionary algorithms

A new approach for solving Hybrid Flowshop scheduling proble...

引用

41st International Conference on computers and Industrial engineering 2011

作者： Cappadonna, Fulvio Antonio Celano, Giovanni Costa, Antonio Fichera, Sergio Dep. of Information Technology Electrical and Electronic Engineering University of Catania Italy Dep. of Industrial and Mechanical Engineering University of Catania Italy

ISBN: (纸本)9781627486835

This paper addresses a realistic variant of the Hybrid Flow Shop (HFS) problem, based on a real microelectronics manufacturing environment. Firstly, the formulation of a Mixed Integer Linear Programming (MILP) model for optimally solving the problem is provided. Then, two metaheuristic procedures are presented: the former is a genetic algorithm based on an encoding/decoding method well-known in literature, while the latter combines a genetic algorithm and a proper local search technique exploiting a different encoding/decoding procedure. According to a wide set of instances, the obtained numerical results highlight the effectiveness of the proposed two-phase metaheuristics in terms of both quality of solutions and computational efficiency.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

The density maximization problem in graphs

The density maximization problem in graphs

引用

Lecture Notes in computer Science

作者： Kao, Mong-Jen Katz, Bastian Krug, Marcus Lee, D.T. Rutter, Ignaz Wagner, Dorothea Germany Dep. of Computer Science and Information Engineering National Taiwan University Taiwan

ISBN: (纸本)9783642226847

We consider a framework for bi-objective network construction problems where one objective is to be maximized while the other is to be minimized. Given a host graph G = (V,E) with edge weights we ∈ and edge lengths e ∈ for e ∈ E we define the density of a pattern subgraph H = (V′,E′) ⊆ G as the ρ(H) = ∑eΕE′we/∑eΕE′ e ratio . We consider the problem of computing a maximum density pattern H with weight at least W and and length at most L in a host G. We consider this problem for different classes of hosts and patterns. We show that it is NP-hard even if the host has treewidth 2 and the pattern is a path. However, it can be solved in pseudo-polynomial linear time if the host has bounded treewidth and the pattern is a graph from a given minor-closed family of graphs. Finally, we present an FPTAS for a relaxation of the density maximization problem, in which we are allowed to violate the upper bound on the length at the cost of some penalty. © 2011 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Robust watermarking scheme based on RDWT-SVD: Embedding data in all subbands

Robust watermarking scheme based on RDWT-SVD: Embedding data...

引用

作者： Lagzian, Samira Soryani, Mohsen Fathy, Mahmood Dep. Computer Engineering Iran University of Science and Technology Tehran Iran

ISBN: (纸本)9781424498345

In this paper, a new method for non-blind image watermarking presented that is robust against affine transformation and ordinary image manipulation. The proposed method presents a watermarking scheme based on redundant discrete wavelet transform (RDWT) and Singular Value Decomposition (SVD). After applying RDWT to cover image, we apply SVD to each subband. Then we modify singular values of the cover image using singular values of the visual watermark. The advantage of the proposed technique is its robustness against most common attacks. Analysis and experimental results show higher performance of the proposed method in comparison to the DWT-SVD method. © 2011 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Search for Higgs Boson Pair Production in the γγbb¯ Final State Using pp Collision Data at s=8 TeV from the ATLAS Detector

引用

Physical Review Letters 2015年第8期114卷 081802-081802页

作者： G. Aad B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport J. Almond A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen 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 I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. 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 J. P. Araque A. T. H. Arce J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio G. Azuelos Y. Azuma M. A. Baak A. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura V. Bansal H. S. Bansil L. Barak S. P. Baranov E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos V. Bartsch A. Bassalat A. Basye R. L. Bates L. Batkova J. R. Batley M. Battaglia M. Battistin 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 Academia Sinica Taipei Taiwan LAL Université Paris-Sud and CNRS/IN2P3 Orsay France 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 Department of Physics Technion: Israel Institute of Technology Haifa Israel CERN Geneva Switzerland 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 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 Yale University New Haven Connecticut 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 Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland 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 Uni

Searches are performed for resonant and nonresonant Higgs boson pair production in the γγbb¯ final state using 20 fb−1 of proton-proton collisions at a center-of-mass energy of 8 TeV recorded with the ATLAS detector at the CERN Large Hadron Collider. A 95% confidence level upper limit on the cross section times branching ratio of nonresonant production is set at 2.2 pb, while the expected limit is 1.0 pb. The difference derives from a modest excess of events, corresponding to 2.4 standard deviations from the background-only hypothesis. The limit observed in the search for a narrow X→hh resonance ranges between 0.7 and 3.5 pb as a function of the resonance mass.

关键词： HIGGS bosons PAIR production HADRON colliders PROTON-proton interactions RESONANCE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：