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

Annual IEEE Symposium on Foundations of computer Science

作者： Ioannis Caragiannis Angelo Fanelli Nick Gravin Alexander Skopalik Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics University of Patras Rio Greece Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University Singapore

Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general PLS-complete. We present a surprisingly simple polynomial-time algorithm that computes O(1)-approximate Nash equilibria in these games. In particular, for congestion games with linear latency functions, our algorithm computes (2 +ε)-approximate pure Nash equilibria in time polynomial in the number of players, the number of resources and 1/ε. It also applies to games with polynomial latency functions with constant maximum degree d: there, the approximation guarantee is d o(d) . The algorithm essentially identifies a polynomially long sequence of best-response moves that lead to an approximate equilibrium; the existence of such short sequences is interesting in itself. These are the first positive algorithmic results for approximate equilibria in non-symmetric congestion games. We strengthen them further by proving that, for congestion games that deviate from our mild assumptions, computing ρ-approximate equilibria is PLS-complete for any polynomial-time computable ρ.

关键词： Games Polynomials Approximation algorithms Nash equilibrium Approximation methods Heuristic algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Real-Time Analysis of Servers for General Job Arrivals

Real-Time Analysis of Servers for General Job Arrivals

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Pratyush Kumar Jian-Jia Chen Lothar Thiele Andreas Schranzhofer Giorgio C. Buttazzo Computer Engineering and Networks Laboratory ETH Zurich Switzerland Department of Informatics Karlsruhe Institute of Technology (KIT) Germany Real-Time Systems Laboratory Italy

Several servers have been proposed to schedule streams of a periodic jobs in the presence of other periodic tasks. Standard schedulability analysis has been extended to consider such servers. However, not much attention has been laid on computing the worst-case delay suffered by a given stream of jobs when scheduled via a server. Such analysis is essential for using servers to schedule hard real-time tasks. We illustrate, with examples, that well established resource models, such as supply bound function and models from Real-Time Calculus, do not tightly characterize servers. In this work, we analyze the server algorithm of the Constant Bandwidth Server and compute a provably tight resource model of the server. The approach used enables us to differentiate between the soft and hard variants of the server. A similar approach can be used to characterize other servers, the final results for which are presented.

关键词： Servers Delay Bandwidth Real time systems Computational modeling Analytical models Schedules

来源：评论

学校读者我要写书评

暂无评论

Visualization of highly-dimensional data in 3D space

Visualization of highly-dimensional data in 3D space

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Dat T. Nguyen Witold Dzwinel Krzysztof J. Cios Computer science Department School of Engineering Virginia Commonwealth University Richmond VA USA Institute of Informatics AGH University of Science and Technology Krakow Poland Computer Science Department School of Engineering Virginia Commonwealth University Richmond VA USA

Molecular dynamics method is used for computing equilibrium in many physical systems as well as a powerful solver used for minimization of criterion functions such as the stress function in multidimensional scaling. We have designed a new tool for visualization of highly-dimensional data in 3D based on the method. We have shown on several data sets that the new method is fast and accurate.

关键词： Intelligent systems Decision support systems

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a Fuzzy-based Integrated CAC and Handover System for Cellular Networks

Performance Evaluation of a Fuzzy-based Integrated CAC and H...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Leonard Barolli Gjergji Mino Elis Kulla Akio Koyama Jiro Iwashige Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Computer Technology Solutions Salem NH USA Graduate School of Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Informatics Yamagata University Yonezawa Yamagata Japan

Several schemes have been proposed for CAC and handover in wireless cellular networks. However, during the complexity of CAC and handover in wireless environment, many simplified models and assumptions are made. Also, the CAC and handover algorithms operating in real time have to make decisions without the luxury of repeated uncorrelated measurements or the future signal strength information. It should be noted that some of CAC and handover criteria information can be inherently imprecise, or the precise information is difficult to obtain. For this reason, we propose a Fuzzy Logic (FL) based approach for CAC and handover for wireless cellular networks (called FICHS), which can operate with imprecision data and non-linear functions with arbitrary complexity. To evaluated the performance of FICHS we consider CAC with priority and enforced handover. We show that FICHS has a good behavior.

关键词： Bismuth Pragmatics Mobile communication Wireless networks Bandwidth Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Search for resonant top quark plus jet production in tt¯+jets events with the ATLAS detector in pp collisions at s=7 TeV

引用

Physical Review D 2012年第9期86卷 091103(R)-091103(R)页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek A. A. Abdelalim O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu E. Acerbi B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit P. Adragna T. Adye S. Aefsky J. A. Aguilar-Saavedra M. Agustoni M. Aharrouche S. P. Ahlen F. Ahles A. Ahmad M. Ahsan G. Aielli T. Akdogan T. P. A. Åkesson G. Akimoto A. V. Akimov M. S. Alam M. A. Alam J. Albert S. Albrand M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti J. Alison B. M. M. Allbrooke P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso B. Alvarez Gonzalez M. G. Alviggi K. Amako C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim 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 P. Anger A. Angerami F. Anghinolfi A. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki S. Aoun L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce S. Arfaoui J-F. Arguin E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal C. Arnault A. Artamonov G. Artoni D. Arutinov S. Asai R. Asfandiyarov S. Ask B. Åsman L. Asquith K. Assamagan A. Astbury M. Atkinson B. Aubert E. Auge K. Augsten M. Aurousseau G. Avolio R. Avramidou D. Axen G. Azuelos Y. Azuma M. A. Baak G. Baccaglioni C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus E. Badescu P. Bagnaia S. Bahinipati Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker M. D. Baker S. Baker E. Banas P. Banerjee Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov A. Barbaro Galtieri 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 P. Barrillon R. Bartoldus A. E. Barton V. Bartsch A. Basye R. L. Bates L. Batkova J. 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 Oklahoma USA Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona and ICREA Barcelona Spain LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Section de Physique Université de Genève Geneva Switzerland 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 DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat a l’Energie Atomique) Gif-sur-Yvette France INFN Sezione di Milano Italy Dipartimento di Fisica Università di Milano Milano Italy INFN Gruppo Collegato di 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 Hampton University Hampton Virginia USA Department of Physics Yale University New Haven Connecticut USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany School of Physics and Astronomy Queen Mary University of London London United Kingdom Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham Massachusetts USA Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for

This paper presents a search for a new heavy particle produced in association with a top or antitop quark. Two models in which the new heavy particle is a color singlet or a color triplet are considered, decaying, respectively, to t¯q or tq, leading to a resonance within the tt¯+jets signature. The full 2011 ATLAS pp collision data set from the LHC (4.7 fb−1) is used to search for tt¯ events produced in association with jets, in which one of the W bosons from the top quarks decays leptonically and the other decays hadronically. The data are consistent with the Standard Model expectation, and a new particle with mass below 430 Gev for both W′ boson and color triplet models is excluded at 95% confidence level, assuming unit right-handed coupling.

关键词： QUARKS JETS (Nuclear physics) NUCLEAR counters COLLISIONS (Nuclear physics) STANDARD model (Nuclear physics) raDIOACTIVE decay ATOMIC mass

来源：评论

学校读者我要写书评

暂无评论

SHREC 2011: Robust feature detection and description benchmark 4

SHREC 2011: Robust feature detection and description benchma...

引用

4th Eurographics Workshop on 3D Object Retrieval, 3DOR 2011

作者： Boyer, E. Bronstein, A.M. Bronstein, M.M. Bustos, B. Darom, T. Horaud, R. Hotz, I. Keller, Y. Keustermans, J. Kovnatsky, A. Litman, R. Reininghaus, J. Sipiran, I. Smeets, D. Suetens, P. Vandermeulen, D. Zaharescu, A. Zobel, V. INRIA Grenoble Rhône-Alpes France Department of Electrical Engineering Tel Aviv University Israel Institute of Computational Science Faculty of Informatics Università della Svizzera Italiana Lugano Switzerland Department of Computer Science University of Chile Chile School of Engineering Bar-Ilan University Ramat-Gan Israel Zuse Institut Berlin Germany Department of Electrical Engineering K.U. Leuven Belgium Department of Mathematics Technion - Israel Institute of Technology Haifa Israel Aimetis Corp. Waterloo Canada

ISBN: (纸本)9783905674316

Feature-based approaches have recently become very popular in computer vision and image analysis applications, and are becoming a promising direction in shape retrieval. SHREC'11 robust feature detection and description benchmark simulates the feature detection and description stages of feature-based shape retrieval algorithms. The benchmark tests the performance of shape feature detectors and descriptors under a wide variety of transformations. The benchmark allows evaluating how algorithms cope with certain classes of transformations and strength of the transformations that can be dealt with. The present paper is a report of the SHREC'11 robust feature detection and description benchmark results. © The Eurographics Association 2011.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

An Application of Markov Jump Process Model for Activity-Based Indoor Mobility Prediction in Wireless Networks

An Application of Markov Jump Process Model for Activity-Bas...

引用

Frontiers of Information technology (FIT)

作者： Joanna Kolodziej Samee Ullah Khan Lizhe Wang Nasro Min-Allah Sajjad A. Madani Nasir Ghani Hongxiang Li Department of Mathematics and Computer Science University of Bielsko-Biała Bielsko-Biala Poland Department of Electrical and Computer Engineering North Dakota State University Fargo ND USA School of Informatics and Computing Indiana University Bloomington IN USA Department of Computer Science COMSATS Institute of Information Technology Pakistan Department of Electrical and Computer Engineering University of New Mexico Albuquerque NM USA Department of Electrical and Computer Engineering University of Louisville Louisville KY USA

One of the most important objectives of a wireless network is to facilitate a prediction of users mobility regardless of their point of attachment to the network. In indoor environments the effective users motion prediction system and wireless localization technology play an important role in all aspects of peoples daily lives. In this paper we propose an activity-based continuous-time Markov model to define and predict the human movement patterns. This model is a simple extension of an Activity based Mobility Prediction algorithm using Markov modeling (AMPuMM) technique. Both models are experimentally evaluated in realistic small university campus scenario. The obtained results show us the high efficiency of the jump methodology in the prediction of the students activities in the indoor campus environment.

关键词： Markov processes Predictive models Educational institutions Vectors Wireless networks computer science Analytical models

来源：评论

学校读者我要写书评

暂无评论

All-optical 3-bit counter using two cascaded stages of SOA-MZI-based T-flip-flops

All-optical 3-bit counter using two cascaded stages of SOA-M...

引用

IEEE Photonics Conference (IPC)

作者： D. Fitsios T. Alexoudi K. Vyrsokinos P. Bakopoulos D. Apostolopoulos H. Avramopoulos A. Miliou N. Pleros Informatics and Telematics Institute Center for Research and Technology Hellas Greece Department of Informatics Aristotle University of Thessaloniki Greece School of Electrical Engineering and Computer Science National Technical University of Athens Athens Greece

We present a 3-bit all-optical counter comprising two cascaded stages of a novel optical T-Flip-Flop that employs one SOA-MZI and a feedback loop. Experimental verification is demonstrated at 8MHz using a fiber-based ... 详细信息

关键词： Optical pulses Optical interferometry Optical fibers Semiconductor optical amplifiers Optical feedback Optical device fabrication

来源：评论

学校读者我要写书评

暂无评论

Robust FFT Based Watermarking Scheme for Copyright Protection of Digital Audio Data

Robust FFT Based Watermarking Scheme for Copyright Protectio...

引用

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP)

作者： Pranab Kumar Dhar Isao Echizen Department of Computer Science and Engineering Chittagong University of Engineering and Technology Chittagong Bangladesh Digital Content and Media Sciences Research Division National Institute of Informatics (NII) Chiyoda Tokyo Japan

Digital watermarking has drawn extensive interest as a means of protecting digital contents from unauthorized copying. This paper proposes a robust audio watermarking scheme based on the Fast Fourier Transformation (FFT) for copyright protection of digital audio data. The watermarking scheme transforms the original audio into the frequency domain. The magnitude spectrum of the original audio is divided into an arbitrary number of segments and the energy of each segment is calculated. Watermarks are then embedded into most prominent peaks of the highest energy segment of the original audio. Watermarks are extracted by performing the inverse of the watermark embedding process. Simulation results indicate that our proposed watermarking scheme resists various attacks such as noise addition, cropping, re-sampling, re-quantization, and MP3 compression. Moreover, it outperforms Cox's method in terms of imperceptibility, while keeping comparable robustness with the Cox's method. Its SNR (signal-to-noise ratio) values range from 20 dB to 31 dB, in contrast to Cox's method whose SNRs range from only 11 dB to 23 dB.

关键词： Watermarking Robustness Signal to noise ratio Human voice Copyright protection Digital audio players

来源：评论

学校读者我要写书评

暂无评论

A Simulation System for Multi-mobile Sinks in Wireless Sensor Networks Considering TworayGround and Shadowing Propagation Models

A Simulation System for Multi-mobile Sinks in Wireless Senso...

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Tao Yang Gjergji Mino Leonard Barolli Arjan Durresi Fatos Xhafa Fukuoka Institute of Technology Fukuoka Japan Computer Technology Solution Salem NH USA Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Computer and Information Science Indiana University-Purdue University Indianapolis Indianapolis IN USA Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain

In this paper, we implement a simulation system for single and multi-mobile sinks in wireless sensor networks considering TworayGround and Shadowing propagation models, using DSR routing protocol. We investigate how the sensor network performs in these cases. We used the good put and consumed energy metrics for performance evaluation. From simulations, we have shown that the good put of multimobile sinks has the worst behavior for both Shadowing and TworayGround propagation models compared with single mobile sinks. Regarding the depletion, Shadowing model shows better performance than TworayGround model, especially in the case of multi-mobile sinks.

关键词： Mobile communication Wireless sensor networks Shadow mapping Receivers Topology Lattices Routing protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：