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

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Ioannis Caragiannis Research Academic Computer Technology Institute & Department of Computer Engineering and Informatics University of Patras

We present three new coordination mechanisms for scheduling n selfish jobs on m unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of jobs on the efficiency of schedules by defining a local scheduling policy on each machine. The scheduling policies induce a game among the jobs and each job prefers to be scheduled on a machine so that its completion time is minimum given the assignments of the other jobs. We consider the maximum completion time among all jobs as the measure of the efficiency of schedules. The approximation ratio of a coordination mechanism quantifies the efficiency of pure Nash equilibria (price of anarchy) of the induced game. Our mechanisms are deterministic, local, and preemptive in the sense that the scheduling policy does not necessarily process the jobs in an uninterrupted way and may introduce some idle time. Our first coordination mechanism has approximation ratio O(logm) and always guarantees that the induced game has pure Nash equilibria to which the system con- verges in at most n rounds. This result improves a recent bound of O(log^2 m) due to Azar, Jain, and Mirrokni and, similarly to their mechanism, our mechanism uses a global ordering of the jobs according to their distinct IDs. Next we study the intriguing scenario where jobs are anonymous, i.e., they have no IDs. In this case, coordination mechanisms can only distinguish between jobs that have different load characteristics. Our second mechanism handles anonymous jobs and has approximation ratio O (logm/log logm) although the game induced is not a potential game and, hence, the existence of pure Nash equilibria is not guaranteed by potential function arguments. However, it provides evidence that the known lower bounds for non-preemptive coordination mechanisms could be beaten using preemptive scheduling policies. Our third coordination mechanism also handles anonymous jobs and has a nice "cost-revealing" potential function. Besides in proving the

关键词： jobs Game theory Game animals machine scheduling potential function Hunting Completion time Anarchy scheduling policy Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Measurement of the inclusive isolated prompt photon cross section in pp collisions at s=7 TeV with the ATLAS detector

引用

Physical Review D 2011年第5期83卷 052005-052005页

作者： G. Aad B. Abbott J. Abdallah A. A. Abdelalim A. Abdesselam O. Abdinov B. Abi M. Abolins H. Abramowicz H. Abreu E. Acerbi B. S. Acharya M. Ackers D. L. Adams T. N. Addy J. Adelman M. Aderholz S. Adomeit P. Adragna T. Adye S. Aefsky J. A. Aguilar-Saavedra 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 S. Albrand M. Aleksa I. N. Aleksandrov M. Aleppo F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti J. Alison M. Aliyev P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso J. Alonso M. G. Alviggi K. Amako P. Amaral C. Amelung V. V. Ammosov A. Amorim G. Amorós N. Amram C. Anastopoulos N. Andari T. Andeen C. F. Anders K. J. Anderson A. Andreazza V. Andrei M-L. Andrieux X. S. Anduaga A. Angerami F. Anghinolfi N. Anjos A. Annovi A. Antonaki M. Antonelli S. Antonelli J. Antos F. Anulli S. Aoun L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce J. P. Archambault S. Arfaoui J-F. Arguin E. Arik M. Arik A. J. Armbruster K. E. Arms S. R. Armstrong O. Arnaez C. Arnault A. Artamonov G. Artoni D. Arutinov S. Asai R. Asfandiyarov S. Ask B. Åsman L. Asquith K. Assamagan A. Astbury A. Astvatsatourov G. Atoian B. Aubert B. Auerbach E. Auge K. Augsten M. Aurousseau N. Austin R. Avramidou D. Axen C. Ay G. Azuelos Y. Azuma M. A. Baak G. Baccaglioni C. Bacci A. M. Bach H. Bachacou K. Bachas G. Bachy M. Backes E. Badescu P. Bagnaia S. Bahinipati Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker F. Baltasar Dos Santos Pedrosa E. Banas P. Banerjee Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov A. Barashkou 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 A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa P. Barrillon R. Bartoldus A. E. Barton D. Bartsch R. L. Bates L. Batkova J. R. Batley A. Battaglia Albert-Ludwigs-Universität Fakultät für Mathematik und Physik Hermann-Herder Str. 3 D - 79104 Freiburg i.Br. Germany University of Oklahoma Homer L. Dodge Department of Physics and Astronomy 440 West Brooks Room 100 Norman Oklahoma 73019-0225 USA Institut de Física d’Altes Energies IFAE Edifici Cn Universitat Autònoma de Barcelona ES - 08193 Bellaterra (Barcelona) Spain Université de Genève Section de Physique 24 rue Ernest Ansermet CH - 1211 Geneve 4 Switzerland Oxford University Department of Physics Denys Wilkinson Building Keble Road Oxford OX1 3RH United Kingdom Institute of Physics Azerbaijan Academy of Sciences H. Javid Avenue 33 AZ 143 Baku Azerbaijan Oklahoma State University Department of Physics 145 Physical Sciences Building Stillwater Oklahoma 74078-3072 USA Michigan State University Department of Physics and Astronomy High Energy Physics Group East Lansing Michigan 48824-2320 USA Tel Aviv University Raymond and Beverly Sackler School of Physics and Astronomy Ramat Aviv IL - Tel Aviv 69978 Israel LAL Univ. Paris-Sud IN2P3/CNRS Orsay France INFN Sezione di Milano via Celoria 16 IT - 20133 Milano Italy Università di Milano Dipartimento di Fisica via Celoria 16 IT - 20133 Milano Italy INFN Gruppo Collegato di Udine Strada Costiera 11 IT-34014 Trieste Italy ICTP Strada Costiera 11 IT-34014 Trieste Italy University of Bonn Physikalisches Institut Nussallee 12 D - 53115 Bonn Germany Brookhaven National Laboratory Physics Department Building 510A Upton New York 11973 USA Hampton University Department of Physics Hampton Virginia 23668 USA Yale University Department of Physics PO Box 208121 New Haven Connecticut 06520-8121 USA Max-Planck-Institut für Physik (Werner-Heisenberg-Institut) Föhringer Ring 6 80805 München Germany Ludwig-Maximilians-Universität München Fakultät für Physik Am Coulombwall 1 DE - 85748 Garching Germany Queen Mary University of London Department of Physics Mile End Road London E1 4NS United Kingdo

A measurement of the cross section for the inclusive production of isolated prompt photons in pp collisions at a center-of-mass energy s=7 TeV is presented. The measurement covers the pseudorapidity ranges |ηγ|<1.37 and 1.52≤|ηγ|<1.81 in the transverse energy range 15≤ETγ<100 GeV. The results are based on an integrated luminosity of 880 nb−1, collected with the ATLAS detector at the Large Hadron Collider. Photon candidates are identified by combining information from the calorimeters and from the inner tracker. Residual background in the selected sample is estimated from data based on the observed distribution of the transverse isolation energy in a narrow cone around the photon candidate. The results are compared to predictions from next-to-leading-order perturbative QCD calculations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Iterative Method for the Output-Feedback Mixed H2/H∞Control Problem

引用

SICE Journal of Control, Measurement, and System Integration 2009年第1期2卷 36-42页

作者： Yasushi Kami Eitaku Nobuyama Department of Electrical and Computer Engineering Akashi National College of Technology Department of Systems Design and Informatics Kyushu Institute of Technology

This paper is concerned with the mixed H2/H∞ control problem with output-feedback. To propose a new iterative method for the problem we firstly construct a controller sequence which converges to the unconstrained globally optimal H2 controller. After then, using this sequence, we propose an iterative method for the mixed H2/H∞ control problem. The advantage of our method is to guarantee that the obtained solution is either the globally optimal solution or a feasible solution in the neighborhood of the boundary of the H∞ norm constraint. A numerical example shows the efficiency of our method.

关键词： output-feedback mixed H2/H&infin control iterative method observer-based controller non-common Lyapunov variables

来源：评论

学校读者我要写书评

暂无评论

Coloring Random Graphs: A Short Survey

Coloring Random Graphs: A Short Survey

引用

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Lefteris Kirousis RA Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Patras Greece

We shortly present some recent results concerning the chromatic number of random graphs. The setting is as follows: we consider a probability space with graphs of a given average degree d and n vertices (the term "average" here refers to the ratio of the sum of the degrees of all vertices to n). In the first case (the Erd¿s-Renyi graphs), the probability space comprises all graphs with average degree d and n vertices. In the second case (regular graphs), the probability space comprises only graphs where all n vertices have degree exactly d. In both cases the probability measure is uniform. In both cases the chromatic number exhibits interesting threshold behavior: for a given average degree (given constant degree, for the regular case, respectively), the chromatic number of almost all graphs (asymptotically with n) lies within a common, small window of 1-3 integers. However as the degree increases, at specific values this window undergoes abrupt changes.

关键词： Space technology Moment methods Scientific computing Paper technology informatics Chebyshev approximation Physics computer simulation Mathematics Graph theory

来源：评论

学校读者我要写书评

暂无评论

Algorithms for two versions of LCS problem for indeterminate strings

Algorithms for two versions of LCS problem for indeterminate...

引用

作者： Iliopoulos, Costas Rahman, M. Sohel Rytter, Wojciech Algorithm Design Group Department of Computer Science King's College London Strand London WC2R 2LS United Kingdom Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka-1000 Bangladesh Institute of Informatics Warsaw University Warsaw Poland Department of Mathematics and Informatics Copernicus University Torun Poland

We study the complexity of the longest common subsequence (LCS) problem from a new perspective. By an indeterminate string (i-string, for short) we mean a sequence X = X[1]X[2]. X[n], where C Σ for each i, and Σ is a given alphabet of potentially large size. A subsequence of X is any usual string over Σ which is an element of the finite (but usually of exponential size) language X[i1]X[i2]. X[ip], where 1 ≤ i123. P ≤ n,p ≥ 0. Similarly, we define a supersequence of x. Our first version of the LCS. problem is Problem ILCS: for given i-strings X˜ and Ỹ, find their longest common subsequence. From the complexity point of view, new parameters of the input correspond to |Σ| and maximum size l of the subsets in X˜ and Ỹ. There is also a third parameter R, which gives a measure of similarity between X˜ and Ỹ. The smaller the R, the lesser is the time for solving Problem ILCS. Our second version of the LCS problem is Problem CILCS (constrained ILCS): for given i-strings X˜ and Ỹ and a plain string Z, find the longest common subsequence of X˜ and Ỹ which is, at the same time, a supersequence of Z. In this paper, we present several efficient algorithms to solve both ILCS and CILCS problems. The efficiency in our algorithms are obtained in particular by using an efficient data structure for special type of range maxima queries and fast multiplication of boolean matrices.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of Duplicate Insensitive Counting Algorithms

Experimental Evaluation of Duplicate Insensitive Counting Al...

引用

Panhellenic Conference on informatics (PCI)

作者： Michael Resvanis Ioannis Chatzigiannakis Department of Computer Engineering and Informatics University of Patras Patras Greece Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics University of Patras Patras Greece

Online and realtime counting and estimating the cardinality of sets is highly desirable for a large variety of applications, representing a foundational block for the efficient deployment and access of emerging Internet scale information systems. In this work we implement three well known duplicate insensitive counting algorithms and evaluate their performance in a testbed of resource-limited commercial off-the-shelf hardware devices. We focus on devices that can be used in wireless mobile and sensor applications and evaluate the memory complexity, time complexity and absolute error of the algorithms under different realistic scenario. Our findings indicate the suitability of each algorithm depending on the application characteristics.

关键词： informatics Frequency estimation Hardware Peer to peer computing Sensor systems Aggregates Statistics Application software Internet Information systems

来源：评论

学校读者我要写书评

暂无评论

3D Internet for cognitive info-communication

3D Internet for cognitive info-communication

引用

10th International Symposium of Hungarian Researchers on Computational Intelligence and informatics, CINTI 2009

作者： Baranyi, Péter Solvang, Bjørn Hashimoto, Hideki Korondi, Péter Computer and Automation Research Institute Hungary Department of Industrial Engineering Narvik University College Norway Institute of Industrial Science University of Tokyo Japan Department of Mechatronics Budapest University of Technology and Economics Optics and Applied Informatics Hungary

The paper presents new research directions both for 3D internet and cognitive info-communication. It reviews basic concepts and definitions and gives some "historical" view that helps to understand current i... 详细信息

关键词： 3D internet Cognitive info-communication Robot control

来源：评论

学校读者我要写书评

暂无评论

EOrBAC - Based active directory management

EOrBAC - Based active directory management

引用

作者： Hassan, Ahmad A. Bahgat, Waleed M. Department of Computer Science and Informatics Taibah University Al Medina Al Munawara Saudi Arabia Department of Communications Misr Higher Institute for Engineering and Technology Al Mansoura Egypt

ISBN: (纸本)9780791802977

A corporate network consists of many individual network security components. Firewall, active directory, and IDS are some examples of these components. Each network security component has its own high level security policy which is translated into low level security mechanisms. There is a wide gap between high level and low level representation of security policy making enforcement of high level security policy faces some essential difficulties. Consistency, verification, and maintenance are the major ones of these difficulties. One approach to overcome these difficulties is to present security policy in an intermediate level and then automate the translation of the intermediate level security policy into low level security mechanisms. Extended Organization Based Access control (EOrBAC) model is valuable step towards introducing this intermediate level. One of the major advantages of EOrBAC is its ability to model most network security components. This paper extends the work of EOrBAC by applying its concept on active directory network security component. Also, an EOrBAC based network security management toolkit is developed to realize this approach.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Optimal MBMS Power Allocation Exploiting MIMO in LTE Networks

Optimal MBMS Power Allocation Exploiting MIMO in LTE Network...

引用

IEEE Conference on Vehicular technology (VTC)

作者： Antonios Alexiou Christos Bouras Vasileios Kokkinos Evangelos Rekkas Computer Engineering and Informatics Department Research Academic Computer Technology Institute University of Patras Patras Greece

In the frame of the Long Term Evolution (LTE) of mobile networks, the provision of rich multimedia services, such as Mobile TV, is considered of key importance for the LTE proliferation in mobile market. To this end, Multimedia Broadcast/Multicast Service (MBMS) is envisaged to play an instrumental role during LTE standardization process. MBMS was introduced in the Release 6 of Universal Mobile Telecommunication System (UMTS) in order to deliver multimedia data from a single source entity to multiple destinations. However, downlink capacity in such networks is limited by base station transmission power. As an aftermath, in MBMS efficient power allocation techniques should be implemented so as to ensure the mass provision of multimedia applications to mobile users. In this paper we propose a power control scheme for efficient selection of MBMS bearers. The proposed mechanism on the one hand manages to economically utilize power resources during MBMS transmissions, while on the other hand exploits the performance enhancements emerged from Multiple Input Multiple Output (MIMO) antennas used in LTE networks. Simulation results indicate that the proposed scheme results to significant power and capacity improvements.

关键词： MIMO Long Term Evolution Mobile TV Digital multimedia broadcasting Multimedia communication TV broadcasting Instruments Standardization 3G mobile communication Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Video transmission over TFRC using cross-layer power management

Video transmission over TFRC using cross-layer power managem...

引用

International Conference on Software, Telecommunications and computer Networks (SoftCOM)

作者： Christos Bouras Apostolos Gkamas Vaggelis Kapoulas Vassilis Papapanagiotou Kostas Stamos Giannis Zaoudis Computer Engineering and Informatics Department University of Patras Greece Research Academic Computer Technology Institute Greece

ISBN: (纸本)9781424449736

This paper presents the issues related to efficient transmission of encoded video (such as H.264) over wireless links using the TFRC protocol. It proposes a novel mechanism that utilizes cross-layer approaches for adaptation of the power transmission level of the sender and feedback information regarding the wireless connection status from the receiver for improved transmission statistics and therefore user experience without unnecessary power consumption. The mechanism is tested through simulations using ns2. Compared to the operation of the video transmission without the mechanism, we observe that it has benefits in terms of video quality.

关键词： Energy management Wireless networks Energy consumption Throughput Wireless application protocol Power engineering computing Propagation losses Signal to noise ratio Fading Interference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：