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

3rd International Conference on Emerging Intelligent Data and Web Technologies, EIDWT 2012

作者： Stankovski, Vlado Južna, Jernej Petcu, Dana Department of Construction Informatics Faculty of Civil and Geodetic Engineering University of Ljubljana Ljubljana Slovenia Computer Science Department West University of Timişoara Timişoara Romania

ISBN: (纸本)9780769547343

Currently, in many engineering areas, including civil engineering, there are increasing demands for various modelling and simulation services that would be accessible over the Web. The basis for such solutions could be existing legacy applications with proven properties, such as numerical stability of the used algorithms. When using traditional infrastructures, such as super computers, clusters or grids, it is necessary to make significant changes in the existing code or even complete re-writing to be able to run such legacy applications on a designated infrastructure. Cloud computing in general, and emerging sky computing technologies, such as mosaic API and platform in particular, make it possible to develop, deploy and monitor Cloud computing applications by re-using existing legacy codes. The mosaic platform can also be used to dynamically provision computational, storage and communication resources, which are needed for such applications, thus reducing operational costs. This paper analyses the possibilities for development of engineering applications by using the mosaic programming model. In the provided case study, an existing Math Works' MATLAB application used for analysis of structures under static loading is used on the Cloud and various benefits, such as elasticity and improved quality are discussed. © 2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Computing the burrows-wheeler transform of a string and its reverse

Computing the burrows-wheeler transform of a string and its ...

引用

23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012

作者： Ohlebusch, Enno Beller, Timo Abouelhoda, Mohamed I. Institute of Theoretical Computer Science University of Ulm 89069 Ulm Germany Center for Informatics Sciences Nile University Giza Egypt Faculty of Engineering Cairo University Giza Egypt

ISBN: (纸本)9783642312649

The contribution of this paper is twofold. First, we provide new theoretical insights into the relationship between a string and its reverse: If the Burrows-Wheeler transform (BWT) of a string has been computed by sorting its suffixes, then the BWT and the longest common prefix array of the reverse string can be derived from it without suffix sorting. Furthermore, we show that the longest common prefix arrays of a string and its reverse are permutations of each other. Second, we provide a parallel algorithm that, given the BWT of a string, computes the BWT of its reverse much faster than all known (parallel) suffix sorting algorithms. Some bioinformatics applications will benefit from this. © 2012 Springer-Verlag.

关键词： Backward wave tubes

来源：评论

学校读者我要写书评

暂无评论

Automatic simulation model generation supported by data stored in low level controllers

Automatic simulation model generation supported by data stor...

引用

14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12

作者： Popovics, G. Kardos, Cs. Pfeiffer, A. Kádár, B. Vén, Z. Monostori, L. Fraunhofer Project Center on Production Management and Informatics Computer and Automation Research Institute Hungarian Academy of Sciences Hungary Faculty of Mechanical Engineering Budapest University of Technology and Economics Hungary

ISBN: (纸本)9783902661982

One of the most widespread techniques to evaluate various aspects of a manufacturing system is discrete-event simulation (DES). However, building a simulation model of a manufacturing system is a difficult task and needs great resource expenditures. Automated data collection and model buildup can drastically reduce the time of the design phase as well as support model reusability. Since most of the manufacturing systems are controlled by low level controllers (e.g., PLCs, CNCs) they store structure and control logic of the system to be modeled by a DES system. The paper introduces an ongoing research of PLC program processing method for automatic simulation model generation of a conveyor system of a leading automotive factory. Results of the validation process and simulation experiments are also described through a case study. © 2012 IFAC.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Search for magnetic monopoles and stable particles with high electric charges in 8 TeV pp collisions with the ATLAS detector

引用

Physical Review D 2016年第5期93卷 052009-052009页

作者： G. Aad B. Abbott J. Abdallah O. Abdinov R. Aben 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 A. A. Affolder T. Agatonovic-Jovin J. Agricola J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison S. P. Alkire B. M. M. Allbrooke P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio 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 J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque A. T. H. Arce F. A. Arduh 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 K. Augsten M. Aurousseau G. Avolio B. Axen M. K. Ayoub G. Azuelos M. A. Baak A. E. Baas M. J. Baca C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker E. M. Baldin P. Balek T. Balestri F. Balli W. K. Balunas E. Banas Sw. Banerjee A. A. E. Bannoura H. S. Bansil L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow S. L. Barnes 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 A. Basalaev A. Bassalat A. Basye R. L. Bates S. J. Batista J. R. Batley M. Battaglia M. Bauce F. Bauer H. S. Ba 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 Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics and Astronomy Michigan State University East Lansing Michigan USA Department of Physics University of Toronto Toronto ON 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 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 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 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 Oliver Lodge Laboratory University of Liverpool Liverpool United Kingdom Institute of Physics University of Belgrade Belgrade Serbia II Physikalisches Institut Georg-August-Universität Göttingen Germany 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 (Spain) 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 Università di Roma Tor Vergata Roma Italy Fysiska

A search for highly ionizing particles produced in proton-proton collisions at 8 TeV center-of-mass energy is performed by the ATLAS Collaboration at the CERN Large Hadron Collider. The data set used corresponds to an integrated luminosity of 7.0 fb−1. A customized trigger significantly increases the sensitivity, permitting a search for such particles with charges and energies beyond what was previously accessible. No events were found in the signal region, leading to production cross section upper limits in the mass range 200–2500 GeV for magnetic monopoles with magnetic charge in the range 0.5gD<|g|<2.0gD, where gD is the Dirac charge, and for stable particles with electric charge in the range 10<|z|<60. Model-dependent limits are presented in given pair-production scenarios, and model-independent limits are presented in fiducial regions of particle energy and pseudorapidity.

关键词： Particle production Hypothetical particles Magnetic monopoles Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

Solving conflict on collaborative knowledge via social networking using consensus choice

Solving conflict on collaborative knowledge via social netwo...

引用

4th International Conference on Computational Collective Intelligence, ICCCI 2012

作者： Nguyen, Quoc Uy Duong, Trong Hai Kang, Sanggil University of Information Technology VNU-HCM Viet Nam Faculty of Mathematics and Informatics Quangbinh University Viet Nam Department of Computer and Information Engineering Inha University Korea Republic of

ISBN: (纸本)9783642346293

While knowledge exchange among users is rapidly increased in social networking environment, collaborative knowledge in social networking is being become more and more essential for knowledge management systems. In this work, a method for solving conflict on collaborative knowledge via social networking using consensus choice is presented. A knowledge base can be considered as a pair KB = (O, I) where O is an ontology and I is a set of instances of concepts belonging to the ontology O. The main issue presented here is how to organize a collaboration process and to resolve conflicts in collaborative knowledge creation via social *** this work, ontology is considered as sharing mechanism for social collaboration. The structure of a collaborative group is distinguished by three types including centralized-, decentralized-, and distributed group. For each group type, we propose a corresponding algorithm for conflict resolution using consensus choice. © 2012 Springer-Verlag.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Electronic archive information system

Electronic archive information system

引用

Materials of Doctoral Consortium of the 10th International Baltic Conference on Databases and Information Systems, Baltic DB and IS 2012

作者： Ragaisis, Saulius Birstunas, Adomas Mitasiunas, Antanas Stockus, Arunas Software Engineering Department Faculty of Mathematics and Informatics Vilnius University Naugarduko Str. 24 LT-03225 Vilnius Lithuania Computer Science Department Vilnius University Lithuania

ISBN: (纸本)9789986342748

Development of Electronic Archive Information System was the final step in completing Lithuania's preparation for signed electronic documents. The system is unique not only in Lithuania, but also in Europe. It allows to submit to the state archives the official electronic documents signed by qualified e-signature, assuring their integrity, authenticity, non-repudiation and possibility to use and store them for a long or unlimited time. To resolve the interoperability problems the universal model, sufficient for complex electronic documents during whole of their life cycle has been created and described in two specifications: ADOC - for human readable electronic documents and MDOC - for machine readable electronic documents. The public free software tools for preparation, signing, preview and verification of official electronic documents have played an important role in promoting the usage of electronic documents. The paper presents practical fundamental solutions applied in Lithuania.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Current distortions compensation method for frequency converters

Current distortions compensation method for frequency conver...

引用

2012 IEEE 18th International Symposium for Design and Technology of Electronics Packages, SIITME 2012

作者： Orha, I. Oniga, S. Electric Electronic and Computer Engineering Technical University of Cluj-Napoca North University Center Baia Mare Baia Mare Romania Faculty of Informatics University of Debrecen Debrecen Hungary

ISBN: (纸本)9781467347594

This paper present a study of the effects of frequency converters to the power grid and a possible solution for current distortions compensation. Experimental measurements made, at different points of the grid, with the device Fluke 434 to a converter which supplies a 110 kW asynchronous motor, reveal the distortions of current. Harmonics content of current for the three phases and THD distortion factor emphasize the existence of strong distortions of current. Current compensation method, proposed and simulated, consists in collecting a sample of non-sinusoidal current from the inverter input resistance or using a current transformer, which will be decreased from a sinusoidal reference signal. This difference is amplified and synchronized, so that it can be injected back into the grid. Simulations above described method are made in Matlab-Simulink Power Systems. © 2012 IEEE.

关键词： Frequency converters

来源：评论

学校读者我要写书评

暂无评论

Usage of asymmetric encryption algorithms to enhance the security of sensitive data in secure communication

Usage of asymmetric encryption algorithms to enhance the sec...

引用

International Symposium on Applied Machine Intelligence and informatics (SAMI)

作者： P. Fanfara E. Danková M. Dufala Department of Computer and Informatics Faculty of Electrical Engineering and Informatics Technical University of Košice Slovakia

Communication security is one of many informatics parts which have huge progress. Sensitive data are increasingly used in communication and that's the reason why is security requirement more timely and important. The risk of obtaining data through an attack increases with enhancing the power of today's computers. Paper attention is mainly devoted to sender authentication based on using digital signature and asymmetric encryption via one-way hash function to calculate public and private keys.

关键词： Encryption Digital signatures Generators Elliptic curve cryptography

来源：评论

学校读者我要写书评

暂无评论

Efficient counting of square substrings in a tree

Efficient counting of square substrings in a tree

引用

23rd International Symposium on Algorithms and Computation, ISAAC 2012

作者： Kociumaka, Tomasz Pachocki, Jakub Radoszewski, Jakub Rytter, Wojciech Waleń, Tomasz Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw Poland Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń Poland Laboratory of Bioinformatics and Protein Engineering International Institute of Molecular and Cell Biology Warsaw Poland

ISBN: (纸本)9783642352607

We give an algorithm which in O(n log2 n) time counts all distinct squares in labeled trees. There are two main obstacles to overcome. Crochemore et al. showed in 2012 that the number of such squares is bounded by Θ(n4/3). This is substantialy different from the case of classical strings, which admit only a linear number of distinct squares. We deal with this difficulty by introducing a compact representation of all squares (based on maximal cyclic shifts) that requires only O(n log n) space. The second obstacle is lack of adequate algorithmic tools for labeled trees. Consequently we develop several novel techniques, which form the most complex part of the paper. In particular we extend Imre Simon's implementation of the failure function in pattern matching machines. © Springer-Verlag 2012.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A linear time algorithm for seeds computation

A linear time algorithm for seeds computation

引用

23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012

作者： Kociumaka, Tomasz Kubica, Marcin Radoszewski, Jakub Rytter, Wojciech Waleń, Tomasz Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw Poland Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń Poland Laboratory of Bioinformatics and Protein Engineering International Institute of Molecular and Cell Biology Warsaw Poland

ISBN: (纸本)9781611972108

A seed in a word is a relaxed version of a period. We show a linear time algorithm computing a compact representation of all the seeds of a word, in particular, the shortest seed. Thus, we solve an open problem stated in the survey by Smyth (2000) and improve upon a previous over 15-year old O(n log n) algorithm by Iliopoulos, Moore and Park (1996). Our approach is based on combinatorial relations between seeds and a variant of the LZ-factorization (used here for the first time in context of seeds). Copyright © SIAM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：