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

2011 International Conference on Advanced computer science and Information Systems, ICACSIS 2011

作者： Budianto, E. Alvissalim, M.S. Hafidh, A. Wibowo, A. Jatmiko, W. Hardian, B. Mursanto, P. Muis, A. Faculty of Computer Science Universitas Indonesia Indonesia Dept. of Informatics Faculty of Mathematics and Natural Science Diponegoro University Indonesia Faculty of Engineering Universitas Indonesia Indonesia

ISBN: (纸本)9789791421119

Communication network expansion technology using autonomous robot covers three research fields which includes network expansion, network routing, and localization. On this research, we implement an efficient robot formation and network expansion algorithm on a simulator based on Open Dynamics Engine (ODE) library. We extended the robot formation algorithm to handle multiple sources implementation to keep communication linkage between communication towers. We also developed a network routing algorithm and implement the robot formation algorithm on real autonomous robots hardware. The result of simulation shows that our proposed communication network expansion technology is visible to be implemented. Therefore, we designed an autonomous robot meeting the requirement set in the simulation. © 2011 Universitas Indonesia.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Autonomous telecommunication networks coverage area expansion in disaster area using mobile robots

Autonomous telecommunication networks coverage area expansio...

引用

22nd Annual Symp. on Micro-Nano Mechatronics and Human science, MHS 2011, Held Jointly with the Symp. on COE for Education and Research of Micro-Nano Mechatronics, Micro-Nano GCOE 2011, Symp. on Hyper Bio Assembler for 3D Cellular System Innovation

作者： Budianto, E. Hafidh, A. Al Afif, F. Wibowo, A. Jatmiko, W. Hardian, B. Mursanto, P. Muis, A. Faculty of Computer Science Universitas Indonesia Indonesia Dept. of Informatics Faculty of Mathematics and Natural Science Diponegoro University Indonesia Faculty of Engineering Universitas Indonesia Indonesia

ISBN: (纸本)9781457713613

Communication network expansion technology using autonomous robot introduces three research fields which is network expansion, network routing, and localization. On this research, we tried to develop an efficient robot formation and network expansion that is implemented using Open Dynamics Engine (ODE) library and network routing algorithm. This paper also shows some modifications that have been done to improve the performance of robot formation and network routing process. In robot formation and network expansion process, step that has been done is multiple source implementations to keep communication linkage between communication towers. Besides that, we developed new routing protocol based on cluster based routing concept. The result of simulation shows that our proposed communication network expansion technology is visible to be implemented. © 2011 IEEE.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Beyond connectivity-new metrics to evaluate robustness of networks

Beyond connectivity-new metrics to evaluate robustness of ne...

引用

International Conference on High Performance Switching and Routing

作者： Banerjee, Sujogya Shirazipourazad, Shahrzad Ghosh, Pavel Sen, Arunabha Computer Science and Engineering Program School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ 85281 United States

ISBN: (纸本)9781424484560

Robustness or fault-tolerance capability of a network is an important design parameter in both wired and wireless networks. Connectivity of a network is traditionally considered to be the primary metric for evaluation of its fault-tolerance capability. However, connectivity (G) (for random faults) or region-based connectivity R(G) (for spatially correlated or region-based faults, where the faults are confined to a region R) of a network G, does not provide any information about the network state, (i.e., whether the network is connected or not) once the number of faults exceeds (G) or R(G). If the number of faults exceeds (G) or R(G), one would like to know, (i) the number of connected components into which G decomposes, (ii) the size of the largest connected component, (iii) the size of the smallest connected component. In this paper, we introduce a set of new metrics that computes these values. We focus on one particular metric called region-based component decomposition number (RBCDN), that measures the number of connected components in which the network decomposes once all the nodes of a region fail. We study the computational complexity of finding RBCDN of a network. In addition, we study the problem of least cost design of a network with a target value of RBCDN. We show that the optimal design problem is NP-complete and present an approximation algorithm with a performance bound of O(log K + 4log n), where n denotes the number of nodes in the graph and K denotes a target value of RBCDN. We evaluate the performance of our algorithm by comparing it with the performance of the optimal solution. Experimental results demonstrate that our algorithm produces near optimal solution in a fraction of time needed to find an optimal solution. © 2011 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed real-equipment testing for the mobile communications services

Distributed real-equipment testing for the mobile communicat...

引用

2011 10th RoEduNet International Conference on Networking in Education and Research, RoEduNet 2011

作者： Cazacu, Virgil Iuga, Laura Balan, Titus Sandu, Florin Siemens Program and System Engineering Brasov Romania Faculty of Electrical Engineering and Computer Science Transilvania University Brasov Romania

ISBN: (纸本)9781457712333

The test activities performed during the life cycle of the telecommunication service development ensure the service quality and stability so necessary to achieve the maximum availability and reliability. The paper presents authors' contribution to remote and distributed testing for mobile communications services based on cloud computing assets and paradigms. The access solutions to the test methods were implemented for the GSM and GSM-R (Global System for Mobile - Railways) related Intelligent Networks services. The scalability and flexibility of the architecture allows to the proposed solution to be used, for both the production and the educational environments, to access the resources located on the different sites for the tests purpose. The concept of the remote test solution and the practical examples based on the remote tests with real equipments are presented in this paper. © 2011 IEEE.

关键词： Equipment testing

来源：评论

学校读者我要写书评

暂无评论

Mobile IP-based protocol for wireless personal area networks in critical environments

Mobile IP-based protocol for wireless personal area networks...

引用

作者： Jara, Antonio J. Silva, Ricardo M. Silva, Jorge S. Zamora, Miguel A. Skarmeta, Antonio F. G. Department of Information and Communications Engineering Computer Science Faculty University of Murcia Murcia Spain Department of Informatics Engineering Faculty of Sciences and Technology University of Coimbra Coimbra Portugal

Low-power Wireless Personal Area Networks (LoWPANs) are still in their early stage of development, but the range of conceivable usage scenarios and applications is tremendous. That range is extended by its inclusion in Internet with IPv6 Low-Power Personal Area Networks (6LoWPANs). This makes it obvious that multi-technology topologies, security and mobility support will be prevalent in 6LoWPAN. Mobility based communication increases the connectivity, and allows extending and adapting LoWPANs to changes in their location and environment infrastructure. However, the required mobility is heavily dependent on the individual service scenario and the LoWPAN architecture. In this context, an optimized solution is proposed for critical applications, such as military, fire rescue or healthcare, where people need to frequently change their position. Our scenario is health monitoring in an oil refinery where many obstacles have been found to the effective use of LoWPANs in these scenarios, mainly due to transmission medium features i.e. high losses, high latency and low reliability. Therefore, it is very difficult to provide continuous health monitoring with such stringent requirements on mobility. In this paper, a paradigm is proposed for mobility over 6LoWPAN for critical environments. On the one hand the intra-mobility is supported by GinMAC, which is an extension of IEEE 802.15.4 to support a topology control algorithm, which offers intra-mobility transparently, and Movement Direction Determination (MDD) of the Mobile Node (MN). On the other hand, the inter-mobility is based on pre-set-up of the network parameters in the visited networks, such as Care of Address and channel, to reach a fast and smooth handoff. Pre-set-up is reached since MDD allows discovering the next 6LoWPAN network towards which MN is moving. The proposed approach has been simulated, prototyped, evaluated, and is being studied in a scenario of wearable physiological monitoring in hazardous industrial a

关键词： Personal communication systems

来源：评论

学校读者我要写书评

暂无评论

Developing a denoising filter for electron microscopy and tomography data in the cloud

引用

Biophysical Reviews 2012年第3期4卷 223-229页

作者： Starosolski, Zbigniew Szczepanski, Marek Wahle, Manuel Rusu, Mirabela Wriggers, Willy Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology 44-100 Gliwice Akademicka 16 Poland School of Biomedical Informatics University of Texas Health Science Center Houston TX 77030 7000 Fannin St. UCT 600 United States Department of Pediatric Radiology Texas Children's Hospital Houston TX 77030 6621 Fannin St. United States Department of Biomedical Engineering Rutgers The State University of New Jersey Piscataway NJ 08854 599 Taylor Road United States Department of Physiology and Biophysics and Institute for Computational Biomedicine Weill Medical College of Cornell University NY NY 10065 1300 York Ave. United States D. E. Shaw Research NY NY 10036 120 West 45th Street United States

The low radiation conditions and the predominantly phase-object image formation of cryo-electron microscopy (cryo-EM) result in extremely high noise levels and low contrast in the recorded micrographs. The process of single particle or tomographic 3D reconstruction does not completely eliminate this noise and is even capable of introducing new sources of noise during alignment or when correcting for instrument parameters. The recently developed Digital Paths Supervised Variance (DPSV) denoising filter uses local variance information to control regional noise in a robust and adaptive manner. The performance of the DPSV filter was evaluated in this review qualitatively and quantitatively using simulated and experimental data from cryo-EM and tomography in two and three dimensions. We also assessed the benefit of filtering experimental reconstructions for visualization purposes and for enhancing the accuracy of feature detection. The DPSV filter eliminates high-frequency noise artifacts (density gaps), which would normally preclude the accurate segmentation of tomography reconstructions or the detection of alpha-helices in single-particle reconstructions. This collaborative software development project was carried out entirely by virtual interactions among the authors using publicly available development and file sharing tools. © 2012 International Union for Pure and Applied Biophysics (IUPAB) and Springer.

关键词： cryo-EM Digital paths Filtering Helix detection Remote collaboration Supervised classification

来源：评论

学校读者我要写书评

暂无评论

Erratum: Search for new phenomena in final states with large jet multiplicities and missing transverse momentum at = 8 TeV proton-proton collisions using the ATLAS experiment

引用

Journal of High Energy Physics 2014年第1期2014卷 1-18页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek 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 T. Adye S. Aefsky T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen A. Ahmad M. Ahsan G. Aielli T. P. A. Åkesson G. Akimoto A. V. Akimov M. A. Alam J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti L. Alio 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 Y. Amaral Coutinho 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. 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 A. T. H. Arce S. Arfaoui J.-F. Arguin S. Argyropoulos E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal O. Arslan A. Artamonov G. Artoni D. Arutinov S. Asai N. Asbah S. Ask B. Åsman L. Asquith K. Assamagan R. Astalos A. Astbury M. Atkinson N. B. Atlay B. Auerbach E. Auge K. Augsten M. Aurousseau G. Avolio D. Axen G. Azuelos Y. Azuma M. A. Baak C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker P. Balek F. Balli E. Banas 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. B 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 United States of America Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona Barcelona Spain 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 of America Department of Physics and Astronomy Michigan State University East Lansing United States of America Department of Physics University of Toronto Toronto 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 Stockholm Sweden INFN Gruppo Collegato di Udine Udine 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 of America Department of Physics Hampton University Hampton United States of America Department of Physics Yale University New Haven United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham United States of America Vinca Institute of Nuclear Sciences University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portug

来源：评论

学校读者我要写书评

暂无评论

Porantim-opt: Optimizing the combined selection of model-based testing techniques

Porantim-opt: Optimizing the combined selection of model-bas...

引用

Workshop on Requirements and Validation, Verification, and Testing

作者： Neto, Arilo Claudio Dias De Freitas Rodrigues, Rosiane Travassos, Guilherme Horta Post-graduation Program In Informatics Computer Science Department Federal University of Amazonas Manaus AM Brazil Systems Engineering and Computer Science Program COPPE Federal University of Rio De Janeiro Rio De Janeiro RJ Brazil

ISBN: (纸本)9780769543451

The combination of testing techniques is considered an effective strategy to evaluate a software product. However, the selection of which techniques to combine in a software project has been an interesting challenge in the Software engineering field. This paper presents a proposal extending an approach developed to support the combined selection of model-based testing (MBT) techniques, named Porantim, applying Multiobjective Combinatorial Optimization strategy by determining the smallest dominating set in a bipartite and weighted graph. Thus, a local search strategy algorithm is proposed generating solutions aiming at maximizing the coverage of software project characteristics and skills required by the testing team to use the techniques and minimizing the eventual effort to construct models used for test cases generation. A preliminary evaluation analyzes this new approach when compared to the Porantim's original version, and the results indicate improvements in the MBT techniques selection. © 2011 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Minimum maximum-degree publish-subscribe overlay network design

Minimum maximum-degree publish-subscribe overlay network des...

引用

作者： Onus, Melih Richa, Andréa W. Department of Computer Engineering Bilkent University Ankara 06560 Turkey Computer Science and Engineering Program School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85281 United States

Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph that has least possible maximum degree in such a way that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial-time logarithmic approximation algorithm for this problem and prove an almost tight lower bound on the approximation ratio. Our experimental results show that our algorithm drastically improves the maximum degree of publish/subscribe overlay systems. We also propose a variation of the problem by enforcing that each topic-connected overlay network be of constant diameter while keeping the average degree low. We present three heuristics for this problem that guarantee that each topic-connected overlay network will be of diameter 2 and that aim at keeping the overall average node degree low. Our experimental results validate our algorithms, showing that our algorithms are able to achieve very low diameter without increasing the average degree by much. © 2011 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

The L∞ Hausdorff Voronoi diagram revisited

The L∞ Hausdorff Voronoi diagram revisited

引用

2011 8th International Symposium on Voronoi Diagrams in science and engineering, ISVD 2011

作者： Papadopoulou, Evanthia Xu, Jinhui Faculty of Informatics University of Lugano Switzerland Department of Computer Science and Engineering State University of New York Buffalo NY United States

ISBN: (纸本)9780769544830

We revisit the L∞ Hausdorff Voronoi diagram of clusters of points, equivalently, the ∞ Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the ∞ Hausdorff Voronoi diagram is Θ(n+m), where n is the number of given clusters and m is the number of essential pairs of crossing clusters. The algorithm runs in O((n+M)log n) time and O(n+M) space where M is the number of potentially essential crossings;m, M are O(n 2), m ≤ M, but m = M, in the worst case. In practice m, M n2, as the total number of crossings in the motivating application is typically small. For non-crossing clusters, the algorithm is optimal running in O(n log n)-time and O(n)-space. The L∞ Hausdorff Voronoi diagram finds applications, among others, in the geometric min-cut problem, VLSI critical area analysis for via-blocks and open faults. © 2011 IEEE.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：