paper_id string | canonical_paper_id string | paper_version string | pdf_path string | title string | abstract string | authors string | categories string | license string | update_date string | version_count int64 | metadata_found bool | text string | text_source string | text_is_partial bool | text_char_count int64 | text_line_count int64 | token_count int64 | page_count int64 | token_types list | token_type_counts_json string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1001.0115 | 1001.0115 | /arxiv/pdfs/1001/1001.0115.pdf | Developing Artificial Herders Using Jason | This paper gives an overview of a proposed strategy for the "Cows and
Herders" scenario given in the Multi-Agent Programming Contest 2009. The
strategy is to be implemented using the Jason platform, based on the
agent-oriented programming language Agent-Speak. The paper describes the
agents, their goals and the strateg... | Niklas Skamriis Boss, Andreas Schmidt Jensen, J{\o}rgen Villadsen | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-01-05 | 1 | true | Developing Artificial Herders Using Jason
Niklas Skamriis Boss, Andreas Schmidt Jensen, and Jørgen Villadsen?
Department of Informatics and Mathematical Modelling
Technical University of Denmark
Richard Petersens Plads, Building 321, DK-2800 Kongens Lyngby, Denmark
arXiv:1001.0115v1 [cs.MA] 31 Dec 2009
Abstract. Thi... | raw_pdf_preferred | false | 12,321 | 186 | 186 | 6 | [
"raw_text_pdf"
] | {"raw_text_pdf":186} | |
1001.5047 | 1001.5047 | /arxiv/pdfs/1001/1001.5047.pdf | Toward a Compositional Theory of Leftist Grammars and Transformations | Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems
where symbols can only insert or erase to their left. We develop a theory of
leftist grammars seen as word transformers as a tool toward rigorous analyses
of their computational power. Our main contributions in this first paper are
(1) construct... | Pierre Chambart and Philippe Schnoebelen | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2012-03-19 | 1 | true | Toward a Compositional Theory of Leftist Grammars
and Transformations⋆
P. Chambart and Ph. Schnoebelen
LSV, ENS Cachan, CNRS
61, av. Pdt. Wilson, F-94230 Cachan, France
arXiv:1001.5047v1 [cs.FL] 27 Jan 2010
Abstract. Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue
systems where symbols can only in... | raw_pdf_preferred | false | 62,063 | 1,087 | 1,087 | 27 | [
"raw_text_pdf"
] | {"raw_text_pdf":1087} | |
1001.5275 | 1001.5275 | /arxiv/pdfs/1001/1001.5275.pdf | An Agent-Based Modeling for Pandemic Influenza in Egypt | Pandemic influenza has great potential to cause large and rapid increases in
deaths and serious illness. The objective of this paper is to develop an
agent-based model to simulate the spread of pandemic influenza (novel H1N1) in
Egypt. The proposed multi-agent model is based on the modeling of individuals'
interactions... | Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M.
Salem | cs.MA cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-02-01 | 1 | true | An Agent-Based Modeling for Pandemic Influenza in Egypt
Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M. Salem
Faculty of Computer and Information Science Ain shams University Cairo, Egypt
kmkmohamed@gmail.com, mhaziz67@gmail.com, ntaymoor@yahoo.com,
absalem@asunet.shams.edu.eg
Abstract In the absen... | raw_pdf_preferred | false | 30,663 | 424 | 424 | 10 | [
"raw_text_pdf"
] | {"raw_text_pdf":424} | |
1002.4110 | 1002.4110 | /arxiv/pdfs/1002/1002.4110.pdf | Domain wall dynamics driven by a localized injection of a spin-polarized
current | This paper introduces an oscillator scheme based on the oscillations of
magnetic domain walls due to spin-polarized currents, where the current is
injected perpendicular to the sample plane in a localized part of a nanowire.
Depending on the geometrical and physical characteristic of the system, we
identify two differe... | G. Finocchio, N. Maugeri, L. Torres, B. Azzerboni | cond-mat.mes-hall cond-mat.other | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-18 | 1 | true | 1
Domain wall dynamics driven by a localized injection of a spin-
polarized current
G. Finocchio1, N. Maugeri2, L. Torres3, B. Azzerboni1
1
Department of Fisica della Materia e Ingegneria Elettronica, University of Messina, 98166 Messina, Italy.
2
Department of Ingegneria Civile, University of Messina, 98166 Messina, ... | raw_pdf_preferred | false | 19,568 | 239 | 239 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":239} | |
1003.0590 | 1003.0590 | /arxiv/pdfs/1003/1003.0590.pdf | A new model for solution of complex distributed constrained problems | In this paper we describe an original computational model for solving
different types of Distributed Constraint Satisfaction Problems (DCSP). The
proposed model is called Controller-Agents for Constraints Solving (CACS). This
model is intended to be used which is an emerged field from the integration
between two paradi... | Sami Al-Maqtari (LITIS), Habib Abdulrab (LITIS), Eduard Babkin (LITIS) | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-03-03 | 1 | true | Application of CACS approach for distributed logistic
systems
Sami AL-MAQTARI1, Habib ABDULRAB1, Eduard BABKIN1 2
Abstract. The article offers original approach which is called pursue the goal to offer a new mechanism of emergent multi-
Controller Agent for Constraints Satisfaction (CACS). That agent behaviour for col... | raw_pdf_preferred | false | 55,441 | 742 | 742 | 12 | [
"raw_text_pdf"
] | {"raw_text_pdf":742} | |
1003.1582 | 1003.1582 | /arxiv/pdfs/1003/1003.1582.pdf | Realization of the farad from the dc quantum Hall effect with
digitally-assisted impedance bridges | A new traceability chain for the derivation of the farad from dc quantum Hall
effect has been implemented at INRIM. Main components of the chain are two new
coaxial transformer bridges: a resistance ratio bridge, and a quadrature
bridge, both operating at 1541 Hz. The bridges are energized and controlled
with a polypha... | Luca Callegaro, Vincenzo D'Elia, Bruno Trinchera | physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-18 | 1 | true | Realization of the farad from the dc quantum Hall
effect with digitally-assisted impedance bridges
arXiv:1003.1582v1 [physics.ins-det] 8 Mar 2010
Luca Callegaro† §, Vincenzo D’Elia†, and Bruno Trinchera†
† Istituto Nazionale di Ricerca Metrologica (INRIM), Str. delle Cacce 91, 10135
Torino, Italy
Abstract.
A new trac... | raw_pdf_preferred | false | 32,297 | 637 | 637 | 17 | [
"raw_text_pdf"
] | {"raw_text_pdf":637} | |
1003.1792 | 1003.1792 | /arxiv/pdfs/1003/1003.1792.pdf | A Hybrid System based on Multi-Agent System in the Data Preprocessing
Stage | We describe the usage of the Multi-agent system in the data preprocessing
stage of an on-going project, called e-Wedding. The aim of this project is to
utilize MAS and various approaches, like Web services, Ontology, and Data
mining techniques, in e-Business that want to improve responsiveness and
efficiency of systems... | Kobkul Kularbphettong, Gareth Clayton, Phayung Meesad | cs.MA | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2010-03-10 | 1 | true | (IJCSIS) International Journal of Computer Science and Information Security,
Vol. 7, No. 2, 2010
A Hybrid System based on Multi-Agent System in the
Data Preprocessing Stage
Kobkul Kularbphettong, Gareth Clayton and Phayung Meesad
The Information Technology Faculty,
King Mongkut’s University of Technology
North Bangkok... | raw_pdf_preferred | false | 18,101 | 234 | 234 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":234} | |
1003.1810 | 1003.1810 | /arxiv/pdfs/1003/1003.1810.pdf | Reconfigurable Parallel Data Flow Architecture | This paper presents a reconfigurable parallel data flow architecture. This
architecture uses the concepts of multi-agent paradigm in reconfigurable
hardware systems. The utilization of this new paradigm has the potential to
greatly increase the flexibility, efficiency, expandability of data flow
systems and to provide ... | Hamid Reza Naji | cs.MA | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2010-03-11 | 1 | true | (IJCSIS) International Journal of Computer Science and Information Security,
Vol. 7, No. 2, February 2010
Reconfigurable Parallel Data Flow Architecture
Hamid Reza Naji
International Center for Science and High Technology & Environmental Sciences
Abstract- This paper presents a reconfigurable parallel implementing ha... | raw_pdf_preferred | false | 30,949 | 478 | 478 | 9 | [
"raw_text_pdf"
] | {"raw_text_pdf":478} | |
1003.3708 | 1003.3708 | /arxiv/pdfs/1003/1003.3708.pdf | Perceiving the Social: A Multi-Agent System to Support Human Navigation
in Foreign Communities | This paper describes a system developed to help people explore local
communities by providing navigation services in social spaces created by the
community members via communication and knowledge sharing. The proposed system
utilizes data of a community's social network to reconstruct the social space,
which is otherwi... | Victor V. Kryssanov, Shizuka Kumokawa, Igor Goncharenko, and Hitoshi
Ogawa | cs.CY cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-03-22 | 1 | true | Perceiving the Social: A Multi-Agent System to Support
Human Navigation in Foreign Communities
Victor V. Kryssanov, Ritsumeikan University, Japan
Shizuka Kumokawa, Ritsumeikan University, Japan
Igor Goncharenko, 3D Incorporated, Japan
Hitoshi Ogawa, Ritsumeikan University, Japan
Abstract. This paper describes a sy... | raw_pdf_preferred | false | 41,303 | 625 | 625 | 17 | [
"raw_text_pdf"
] | {"raw_text_pdf":625} | |
1003.3766 | 1003.3766 | /arxiv/pdfs/1003/1003.3766.pdf | Modelling and simulating retail management practices: a first approach | Multi-agent systems offer a new and exciting way of understanding the world
of work. We apply agent-based modeling and simulation to investigate a set of
problems in a retail context. Specifically, we are working to understand the
relationship between people management practices on the shop-floor and retail
performance... | Peer-Olaf Siebers, Uwe Aickelin, Helen Celia, Chris Clegg | cs.AI cs.CE cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2013-05-30 | 1 | true | MODELING AND SIMULATING RETAIL MANAGEMENT PRACTICES:
A FIRST APPROACH
ABSTRACT
Multi-agent systems offer a new and exciting way of understanding the world of
work. We apply agent-based modeling and simulation to investigate a set of problems
in a retail context. Specifically, we are working to understand the relation... | raw_pdf_preferred | false | 88,781 | 1,325 | 1,325 | 34 | [
"raw_text_pdf"
] | {"raw_text_pdf":1325} | |
1003.3767 | 1003.3767 | /arxiv/pdfs/1003/1003.3767.pdf | Multi-Agent Simulation and Management Practices | Intelligent agents offer a new and exciting way of understanding the world of
work. Agent-Based Simulation (ABS), one way of using intelligent agents,
carries great potential for progressing our understanding of management
practices and how they link to retail performance. We have developed simulation
models based on r... | Peer-Olaf Siebers, Uwe Aickelin, Helen Celia, Chris Clegg | cs.AI cs.CE cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-07-05 | 1 | true | Keyword for classification: Agent-Based Modelling and Simulation, Retail Productivity,
Management Practices, Shopping Behavior.
File name: 052Siebers
MULTI-AGENT SIMULATION AND MANAGEMENT PRACTICES
Peer-Olaf Siebers* and Uwe Aickelin
School of Computer Science & IT (ASAP)
University of Nottingham
Nottingham, NG8... | raw_pdf_preferred | false | 26,786 | 344 | 344 | 20 | [
"raw_text_pdf"
] | {"raw_text_pdf":344} | |
1003.3993 | 1003.3993 | /arxiv/pdfs/1003/1003.3993.pdf | An improved design of an inductive fault current limiter based on a
superconducting cylinder | The paper deals with basic designs of a fault current limiter of the
transformer type which differ each other by the mutual location of a primary
winding and a superconducting short-circuited cylinder. Theoretical study of
the main parameters of the different designs is performed in the framework of
the critical state ... | Vladimir Sokolovsky, Victor Meerovich, Lidia I. Chubraeva, Istvan
Vajda | cond-mat.supr-con | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-18 | 1 | true | An improved design of an inductive fault current limiter
based on a superconducting cylinder
V. Sokolovsky1, V. Meerovich1, L. I. Chubraeva2, I.
Vajda3
1
Physics Department, Ben-Gurion University, Beer-
Sheva 84105, Israel
2
Department of Control Systems and Nano-
technologies, Saint-Petersburg University of Aerospace
... | raw_pdf_preferred | false | 34,373 | 640 | 640 | 18 | [
"raw_text_pdf"
] | {"raw_text_pdf":640} | |
1003.4606 | 1003.4606 | /arxiv/pdfs/1003/1003.4606.pdf | Nonlocal vs local vortex dynamics in the transversal flux transformer
effect | In this follow-up to our recent Letter [F. Otto et al., Phys. Rev. Lett. 104,
027005 (2010)], we present a more detailed account of the superconducting
transversal flux transformer effect (TFTE) in amorphous (a-)NbGe nanostructures
in the regime of strong nonequilibrium in local vortex motion. Emphasis is put
on the re... | Florian Otto, Ante Bilusic, Dinko Babic, Denis Yu. Vodolazov,
Christoph Suergers, Christoph Strunk | cond-mat.supr-con cond-mat.mes-hall | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-18 | 1 | true | Nonlocal vs local vortex dynamics in the transversal flux transformer effect
Florian Otto,1, ∗ Ante Bilušić,1, 2 Dinko Babić,3 Denis Yu. Vodolazov,4 Christoph Sürgers,5 and Christoph Strunk1
1
Institute for Experimental and Applied Physics,
University of Regensburg, D-93025 Regensburg, Germany
2
Faculty of Natural ... | raw_pdf_preferred | false | 56,490 | 1,045 | 1,045 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":1045} | |
1003.5993 | 1003.5993 | /arxiv/pdfs/1003/1003.5993.pdf | A Triple-Error-Correcting Cyclic Code from the Gold and Kasami-Welch APN
Power Functions | Based on a sufficient condition proposed by Hollmann and Xiang for
constructing triple-error-correcting codes, the minimum distance of a binary
cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and
$\alpha^{13}$ of length $2^m-1$ and the weight divisibility of its dual code
are studied, where $m... | Xiangyong Zeng and Jinyong Shan and Lei Hu | cs.DM cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-04-01 | 1 | true | A Triple-Error-Correcting Cyclic Code from the
Gold and Kasami-Welch APN Power Functions
arXiv:1003.5993v1 [cs.DM] 31 Mar 2010
Xiangyong Zeng, Jinyong Shan, Lei Hu ∗†
October 17, 2018
Abstract: Based on a sufficient condition proposed by Hollmann and Xiang for
constructing triple-error-correcting codes, the minimum ... | raw_pdf_preferred | false | 54,788 | 1,401 | 1,401 | 30 | [
"raw_text_pdf"
] | {"raw_text_pdf":1401} | |
1004.0591 | 1004.0591 | /arxiv/pdfs/1004/1004.0591.pdf | A new key establishment scheme for wireless sensor networks | Traditional key management techniques, such as public key cryptography or key
distribution center (e.g., Kerberos), are often not effective for wireless
sensor networks for the serious limitations in terms of computational power,
energy supply, network bandwidth. In order to balance the security and
efficiency, we prop... | Eric Ke Wang, Lucas C.K.Hui and S.M.Yiu, (The University of Hong Kong,
Hong Kong) | cs.CR cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2010-07-15 | 1 | true | International Journal of Network Security & Its Applications (IJNSA), Vol 1, No 2, July 2009
A NEW KEY ESTABLISHMENT
SCHEME FOR WIRELESS SENSOR NETWORKS
Eric Ke Wang, Lucas C.K.Hui and S.M.Yiu
Department of Computer Science, the University of Hong Kong, Hong Kong
{kwang2,hui,smyiu}@cs.hku.hk
ABSTRACT
Traditional key ... | raw_pdf_preferred | false | 31,052 | 441 | 441 | 12 | [
"raw_text_pdf"
] | {"raw_text_pdf":441} | |
1004.2342 | 1004.2342 | /arxiv/pdfs/1004/1004.2342.pdf | Mean field for Markov Decision Processes: from Discrete to Continuous
Optimization | We study the convergence of Markov Decision Processes made of a large number
of objects to optimization problems on ordinary differential equations (ODE).
We show that the optimal reward of such a Markov Decision Process, satisfying a
Bellman equation, converges to the solution of a continuous
Hamilton-Jacobi-Bellman (... | Nicolas Gast (INRIA Grenoble Rh\^one-Alpes / LIG laboratoire
d'Informatique de Grenoble, EPFL), Bruno Gaujal (INRIA Grenoble Rh\^one-Alpes
/ LIG laboratoire d'Informatique de Grenoble), Jean-Yves Le Boudec (EPFL) | cs.AI cs.PF cs.SY math.OC math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-05-20 | 3 | true | INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
Mean field for Markov Decision Processes: from
Discrete to Continuous Optimization
arXiv:1004.2342v3 [cs.AI] 19 May 2011
Nicolas Gast — Bruno Gaujal — Jean-Yves Le Boudec
N° 7239 — version 3
initial version Avril 2010 — revised version May 2011
Thème ... | raw_pdf_preferred | false | 71,261 | 1,389 | 1,389 | 29 | [
"raw_text_pdf"
] | {"raw_text_pdf":1389} | |
1004.2880 | 1004.2880 | /arxiv/pdfs/1004/1004.2880.pdf | GRASP for the Coalition Structure Formation Problem | The coalition structure formation problem represents an active research area
in multi-agent systems. A coalition structure is defined as a partition of the
agents involved in a system into disjoint coalitions. The problem of finding
the optimal coalition structure is NP-complete. In order to find the optimal
solution i... | Nicola Di Mauro, Teresa M.A. Basile, Stefano Ferilli and Floriana
Esposito | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-04-19 | 1 | true | GRASP for the Coalition Structure Formation Problem
Nicola Di Mauro, Teresa M.A. Basile, Stefano Ferilli, and Floriana Esposito
University of Bari, Italy,
{ndm,basile,ferilli,esposito}@di.uniba.it
arXiv:1004.2880v1 [cs.AI] 16 Apr 2010
Abstract. The coalition structure formation problem represents an active re-
searc... | raw_pdf_preferred | false | 29,863 | 480 | 480 | 14 | [
"raw_text_pdf"
] | {"raw_text_pdf":480} | |
1004.3809 | 1004.3809 | /arxiv/pdfs/1004/1004.3809.pdf | Artificial Immune Systems Metaphor for Agent Based Modeling of Crisis
Response Operations | Crisis response requires information intensive efforts utilized for reducing
uncertainty, calculating and comparing costs and benefits, and managing
resources in a fashion beyond those regularly available to handle routine
problems. This paper presents an Artificial Immune Systems (AIS) metaphor for
agent based modelin... | Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M.
Salem | cs.MA cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-04-23 | 1 | true | Artificial Immune Systems Metaphor for Agent Based
Modeling of Crisis Response Operations
Khaled M. Khalil1, M. Abdel-Aziz1, Taymour T. Nazmy1,
Abdel-Badeeh M. Salem1
1
Faculty of Computer and Information Science Ain shams University Cairo, Egypt
kmkmohamed@gmail.com, mhaziz67@gmail.com, ntaymoor@yahoo.com,
absalem@as... | raw_pdf_preferred | false | 29,075 | 418 | 418 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":418} | |
1004.4450 | 1004.4450 | /arxiv/pdfs/1004/1004.4450.pdf | Improving Supply Chain Coordination by Linking Dynamic Procurement
Decision to Multi-Agent System | The Internet has changed the way business is conducted in many ways. For
example, in the field of procurement, the possibility to directly interact with
a trading partner has given rise to new mechanisms in the supply chain
management. One such interactive dynamic procurement, which lets both buyer and
seller software ... | Yee Ming Chen | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-04-27 | 1 | true | JOURNAL OF COMPUTING, VOLUME 2, ISSUE 4, APRIL 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ 42
Improving Supply Chain Coordination
by Linking Dynamic Procurement
Decision to Multi-Agent System
Yee Ming Chen
Abstract—The Internet has changed the way business is conducted in many ways. For exa... | raw_pdf_preferred | false | 19,543 | 278 | 278 | 7 | [
"raw_text_pdf"
] | {"raw_text_pdf":278} | |
1004.4559 | 1004.4559 | /arxiv/pdfs/1004/1004.4559.pdf | The Accuracy of Tree-based Counting in Dynamic Networks | Tree-based protocols are ubiquitous in distributed systems. They are
flexible, they perform generally well, and, in static conditions, their
analysis is mostly simple. Under churn, however, node joins and failures can
have complex global effects on the tree overlays, making analysis surprisingly
subtle. To our knowledg... | Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf
Stadler, Fetahi Wuhib | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-04-27 | 1 | true | The Accuracy of Tree-based Counting in Dynamic Networks
Supriya Krishnamurthy1,2 , John Ardelius1 , Erik Aurell2,3 , Mads Dam2 , Rolf Stadler2 , and
Fetahi Wuhib2
arXiv:1004.4559v1 [cs.DC] 26 Apr 2010
1
SICS Center for Networked Systems (CNS), Stockholm, Sweden
2
ACCESS Linnaeus Center, KTH - Royal Institute of Techn... | raw_pdf_preferred | false | 37,624 | 706 | 706 | 17 | [
"raw_text_pdf"
] | {"raw_text_pdf":706} | |
1005.0043 | 1005.0043 | /arxiv/pdfs/1005/1005.0043.pdf | A Framework For Fully-Simulatable $h$-Out-Of-$n$ Oblivious Transfer | We present a framework for fully-simulatable $h$-out-of-$n$ oblivious
transfer ($OT^{n}_{h}$) with security against non-adaptive malicious
adversaries. The framework costs six communication rounds and costs at most
$40n$ public-key operations in computational overhead. Compared with the known
protocols for fully-simula... | Bing Zeng and Xueming Tang and Chingfang Hsu | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-04-04 | 3 | true | 1
A Framework For Fully-Simulatable h-Out-Of-n
Oblivious Transfer
Zeng Bing, Tang Xueming, and Chingfang Hsu
✦
arXiv:1005.0043v3 [cs.CR] 1 Apr 2011
Abstract—We present a framework for fully-simulatable h-out-of-n where i1 < i2 < . . . < ih ⩽ n. The receiver expects to
oblivious transfer (OThn ) with security against... | raw_pdf_preferred | false | 129,451 | 2,026 | 2,026 | 27 | [
"raw_text_pdf"
] | {"raw_text_pdf":2026} | |
1005.0125 | 1005.0125 | /arxiv/pdfs/1005/1005.0125.pdf | Adaptive Bases for Reinforcement Learning | We consider the problem of reinforcement learning using function
approximation, where the approximating basis can change dynamically while
interacting with the environment. A motivation for such an approach is
maximizing the value function fitness to the problem faced. Three errors are
considered: approximation square ... | Dotan Di Castro and Shie Mannor | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-05-04 | 1 | true | Adaptive Bases for Reinforcement Learning
Dotan Di Castro and Shie Mannor
Department of Electrical Engineering
Technion - Israel Institute of Technology
{dot,shie}@{tx,ee}.technion.ac.il
arXiv:1005.0125v1 [cs.LG] 2 May 2010
Abstract. We consider the problem of reinforcement learning using
function approximation, whe... | raw_pdf_preferred | false | 39,339 | 792 | 792 | 18 | [
"raw_text_pdf"
] | {"raw_text_pdf":792} | |
1005.0484 | 1005.0484 | /arxiv/pdfs/1005/1005.0484.pdf | Explicit Evidence Systems with Common Knowledge | Justification logics are epistemic logics that explicitly include
justifications for the agents' knowledge. We develop a multi-agent
justification logic with evidence terms for individual agents as well as for
common knowledge. We define a Kripke-style semantics that is similar to
Fitting's semantics for the Logic of P... | Samuel Bucheli, Roman Kuznets, Thomas Studer | cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2023-08-01 | 1 | true | Explicit Evidence Systems
with Common Knowledge
Samuel Bucheli, Roman Kuznets,? and Thomas Studer
Institut für Informatik und angewandte Mathematik, Universität Bern
Bern, Switzerland
{ bucheli, kuznets, tstuder }@iam.unibe.ch
Abstract. Justification logics are epistemic logics that explicitly include
arXiv:1005.0... | raw_pdf_preferred | false | 50,161 | 838 | 838 | 21 | [
"raw_text_pdf"
] | {"raw_text_pdf":838} | |
1005.1758 | 1005.1758 | /arxiv/pdfs/1005/1005.1758.pdf | Cross-Layer Resource Allocation Scheme Under Heterogeneous Constraints
for Next Generation High Rate WPAN | In the next generation wireless networks, the growing demand for new wireless
applications is accompanied with high expectations for better quality of
service (QoS) fulfillment especially for multimedia applications. Furthermore,
the coexistence of future unlicensed users with existing licensed users is
becoming a chal... | Ayman Khalil, Matthieu Crussiere and Jean-Francois Helard, (Institute
of Electronics and Telecommunications of Rennes, France) | cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2010-07-15 | 1 | true | !
Ayman Khalil, Matthieu Crussière and Jean-François Hélard
INSA, 20 avenue des Buttes de Coësmes, 35708 Rennes, France
Institute of Electronics and Telecommunications of Rennes (IETR)
ayman.khalil@insa-rennes.fr
ABSTRACT
In the next generation wireless networks, the growing demand for new wireless applications is
ac... | raw_pdf_preferred | false | 46,532 | 834 | 834 | 18 | [
"raw_text_pdf"
] | {"raw_text_pdf":834} | |
1005.2027 | 1005.2027 | /arxiv/pdfs/1005/1005.2027.pdf | A Multi-agent Framework for Performance Tuning in Distributed
Environment | This paper presents the overall design of a multi-agent framework for tuning
the performance of an application executing in a distributed environment. The
multi-agent framework provides services like resource brokering, analyzing
performance monitoring data, local tuning and also rescheduling in case of any
performance... | Sarbani Roy, Saikat Halder and Nandini Mukherjee | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-05-13 | 1 | true | A Multi-agent Framework for Performance Tuning in Distributed
Environment
Sarbani Roy, Saikat Halder and Nandini Mukherjee
Department of Computer Science and Engineering,
Jadavpur University, Kolkata 700 032, India
Email nmukherjee@cse.jdvu.ac.in
ABSTRACT: This paper presents the overall design of a multi-agent framew... | raw_pdf_preferred | false | 17,905 | 213 | 213 | 7 | [
"raw_text_pdf"
] | {"raw_text_pdf":213} | |
1005.2092 | 1005.2092 | /arxiv/pdfs/1005/1005.2092.pdf | Effects of high pressure on the physical properties of MgB2 | The synthesis of MgB2-based materials under high pressure gave the
possibility to suppress the evaporation of magnesium and to obtain near
theoretically dense nanograined structures with high superconducting, thermal
conducting, and mechanical characteristics: critical current densities of
1.8-1.0 \cdot 106 A/cm2 in th... | T. Prikhna, W. Gawalek, Ya. Savchuk, A. Soldatov, V. Sokolovsky, M.
Eisterer, H.W. Weber, J. Noudem, M. Serga, V. Turkevich, M. Tompsic, V.
Tkach, N. Danilenko, W. Goldacker, F. Karau, I. Fesenko, M. Rindfleisch, J.
Dellith, M. Wendt, S. You, V. Meerovich, S. Dub, V. Moshchil, N. Sergienko,
A. Kozyrev, T. Habis... | cond-mat.supr-con | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-05-13 | 1 | true | Effects of high pressure on the physical properties of MgB2.
T. Prikhna1, W. Gawalek2, Ya. Savchuk1, A. Soldatov3, V. Sokolovsky4, M. Eisterer5, ,
H.W. Weber5, J. Noudem6, M. Serga1, V. Turkevich1, M. Tompsic7, V. Tkach1, N. Danilenko8,
W. Goldacker9, F. Karau10, I. Fesenko1, M. Rindfleisch7, J. Dellith 2, M. Wendt2, S... | raw_pdf_preferred | false | 52,065 | 667 | 667 | 39 | [
"raw_text_pdf"
] | {"raw_text_pdf":667} | |
1005.4774 | 1005.4774 | /arxiv/pdfs/1005/1005.4774.pdf | Fairness in Combinatorial Auctions | The market economy deals with many interacting agents such as buyers and
sellers who are autonomous intelligent agents pursuing their own interests. One
such multi-agent system (MAS) that plays an important role in auctions is the
combinatorial auctioning system (CAS). We use this framework to define our
concept of fai... | Sumanth Sudeendra and Megha Saini and Shrisha Rao | cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-05-30 | 1 | true | Fairness in Combinatorial Auctions
Sumanth Sudeendra sumanth.s@iiitb.net
International Institute of Information Technology - Bangalore,
Bangalore, India.
arXiv:1005.4774v1 [cs.GT] 26 May 2010
Megha Saini msaini1@iit.edu
Illinois Institute of Technology,
Chicago, USA.
Shrisha Rao srao@iiitb.ac.in
International Instit... | raw_pdf_preferred | false | 57,876 | 841 | 841 | 23 | [
"raw_text_pdf"
] | {"raw_text_pdf":841} | |
1005.4815 | 1005.4815 | /arxiv/pdfs/1005/1005.4815.pdf | A Formal Specification of Dynamic Protocols for Open Agent Systems | Multi-agent systems where the agents are developed by parties with competing
interests, and where there is no access to an agent's internal state, are often
classified as `open'. The member agents of such systems may inadvertently fail
to, or even deliberately choose not to, conform to the system specification.
Consequ... | Alexander Artikis | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-05-27 | 1 | true | Noname manuscript No.
(will be inserted by the editor)
A Formal Specification of Dynamic Protocols for Open
Agent Systems
Alexander Artikis
arXiv:1005.4815v1 [cs.MA] 26 May 2010
Abstract Multi-agent systems where the agents are developed by parties with com-
peting interests, and where there is no access to an agent... | raw_pdf_preferred | false | 103,531 | 1,482 | 1,482 | 35 | [
"raw_text_pdf"
] | {"raw_text_pdf":1482} | |
1005.4844 | 1005.4844 | /arxiv/pdfs/1005/1005.4844.pdf | Automatic Modular Abstractions for Template Numerical Constraints | We propose a method for automatically generating abstract transformers for
static analysis by abstract interpretation. The method focuses on linear
constraints on programs operating on rational, real or floating-point variables
and containing linear assignments and tests. Given the specification of an
abstract domain, ... | David Monniaux | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2019-03-14 | 1 | true | AUTOMATIC MODULAR ABSTRACTIONS FOR TEMPLATE
NUMERICAL CONSTRAINTS
arXiv:1005.4844v1 [cs.LO] 26 May 2010
DAVID MONNIAUX
CNRS / VERIMAG, Centre Équation, 2, avenue de Vignate, 38610 Gières cedex, France
e-mail address: David.Monniaux@imag.fr
Abstract. We propose a method for automatically generating abstract transfo... | raw_pdf_preferred | false | 156,936 | 2,214 | 2,214 | 51 | [
"raw_text_pdf"
] | {"raw_text_pdf":2214} | |
1006.1450 | 1006.1450 | /arxiv/pdfs/1006/1006.1450.pdf | Separating Agent-Functioning and Inter-Agent Coordination by Activated
Modules: The DECOMAS Architecture | The embedding of self-organizing inter-agent processes in distributed
software applications enables the decentralized coordination system elements,
solely based on concerted, localized interactions. The separation and
encapsulation of the activities that are conceptually related to the
coordination, is a crucial concer... | Jan Sudeikat (HAW), Wolfgang Renz (HAW) | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-06-09 | 1 | true | Separating Agent-Functioning and Inter-Agent Coordination
by Activated Modules: The DECOMAS Architecture
Jan Sudeikat∗and Wolfgang Renz
Multimedia Systems Laboratory (MMLab),
Faculty of Engineering and Computer Science, Hamburg University of Applied Sciences,
Berliner Tor 7, 20099 Hamburg, Germany
{jan.sudeikat|wolfga... | raw_pdf_preferred | false | 51,422 | 616 | 616 | 16 | [
"raw_text_pdf"
] | {"raw_text_pdf":616} | |
1006.2743 | 1006.2743 | /arxiv/pdfs/1006/1006.2743.pdf | Global Optimization for Value Function Approximation | Existing value function approximation methods have been successfully used in
many applications, but they often lack useful a priori error bounds. We propose
a new approximate bilinear programming formulation of value function
approximation, which employs global optimization. The formulation provides
strong a priori gua... | Marek Petrik and Shlomo Zilberstein | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-06-15 | 1 | true | Global Optimization for Value Function Approximation
Global Optimization for Value Function Approximation
Marek Petrik petrik@cs.umass.edu
Department of Computer Science
University of Massachusetts
Amherst, MA 01003, USA
Shlomo Zilberstein shlomo@cs.umass.edu
Department of Computer Science
University of Massachusetts... | raw_pdf_preferred | false | 86,439 | 1,697 | 1,697 | 42 | [
"raw_text_pdf"
] | {"raw_text_pdf":1697} | |
1006.2751 | 1006.2751 | /arxiv/pdfs/1006/1006.2751.pdf | A high sensitivity ultra-low temperature RF conductance and noise
measurement setup | We report on the realization of a high sensitivity RF noise measurement
scheme to study small current fluctuations of mesoscopic systems at milliKelvin
temperatures. The setup relies on the combination of an interferometric ampli-
fication scheme and a quarter-wave impedance transformer, allowing the mea-
surement of n... | Fran\c{c}ois D. Parmentier, Adrien Mah\'e, Anne Denis, Jean-Marc
Berroir, D. Christian Glattli, Bernard Pla\c{c}ais, Gwendal F\`eve | cond-mat.mes-hall physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-07 | 2 | true | A high sensitivity ultra-low temperature
RF conductance and noise measurement
setup
arXiv:1006.2751v2 [cond-mat.mes-hall] 30 Sep 2010
F. D. Parmentier1,‡ , A. Mahé1 , A. Denis1 , J.-M. Berroir1 , D.C. Glattli1,† , B. Plaçais1 , G.
Fève11
1
Laboratoire Pierre Aigrain, Ecole Normale Supérieure, CNRS (UMR 8551),
Univ... | raw_pdf_preferred | false | 35,306 | 544 | 544 | 21 | [
"raw_text_pdf"
] | {"raw_text_pdf":544} | |
1006.4444 | 1006.4444 | /arxiv/pdfs/1006/1006.4444.pdf | Analysis of Microprocessor Based Protective Re-lay's (MBPR) Differential
Equation Algorithms | This paper analyses and explains from the systems point of view,
microprocessor based protective relay (MBPR) systems with emphasis on
differential equation algorithms. Presently, the application of protective
relaying in power systems, using MBPR systems, based on the differential
equation algorithm is valued more tha... | Bruno Osorno | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-06-24 | 1 | true | JOURNAL OF COMPUTING, VOLUME 2, ISSUE 6, JUNE 2010, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 21
Analysis of Microprocessor Based Protective Re-
lay’s (MBPR) Differential Equation Algorithms
Bruno Osorno
Abstract— This paper analyses and explains from the systems poi... | raw_pdf_preferred | false | 19,700 | 332 | 332 | 6 | [
"raw_text_pdf"
] | {"raw_text_pdf":332} | |
1006.5102 | 1006.5102 | /arxiv/pdfs/1006/1006.5102.pdf | An expectation transformer approach to predicate abstraction and data
independence for probabilistic programs | In this paper we revisit the well-known technique of predicate abstraction to
characterise performance attributes of system models incorporating probability.
We recast the theory using expectation transformers, and identify transformer
properties which correspond to abstractions that yield nevertheless exact bound
on t... | Ukachukwu Ndukwu (Deptartment of Computing, Macquarie University,
Australia.), Annabelle McIver (Deptartment of Computing, Macquarie
University, Australia.) | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-06-29 | 1 | true | An expectation transformer approach to predicate
abstraction and data independence
for probabilistic programs∗
Ukachukwu Ndukwu and AK McIver
Deptartment of Computing, Macquarie University, NSW 2109 Australia.
{ukndukwu,anabel}@science.mq.edu.au
In this paper we revisit the well-known technique of predicate abstracti... | raw_pdf_preferred | false | 46,653 | 605 | 605 | 16 | [
"raw_text_pdf"
] | {"raw_text_pdf":605} | |
1006.5754 | 1006.5754 | /arxiv/pdfs/1006/1006.5754.pdf | Gravitatomagnetic Analogs of Electric Transformers | Linearized general relativity admits a formulation in terms of
gravitoelectric and gravitomagnetic fields that closely parallels the
description of the electromagnetic field by Maxwell's equations. For steady
mass currents, this formalism has been used to understand gravitomagnetic
effects like the Lense-Thirring dragg... | John Swain | gr-qc | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-07-01 | 1 | true | Gravitatomagnetic Analogs of Electric Transformers
John Swain
Department of Physics, Northeastern University, Boston, MA 02115, USA∗
(Dated: June 29, 2010)
Abstract
Linearized general relativity admits a formulation in terms of gravitoelectric and gravitomagnetic
arXiv:1006.5754v1 [gr-qc] 30 Jun 2010
fields that clo... | raw_pdf_preferred | false | 16,193 | 251 | 251 | 9 | [
"raw_text_pdf"
] | {"raw_text_pdf":251} | |
1007.0087 | 1007.0087 | /arxiv/pdfs/1007/1007.0087.pdf | A Novel Approach towards Cost Effective Region-Based Group Key Agreement
Protocol for Secure Group Communication | This paper addresses an interesting security problem in wireless ad hoc
networks: the Dynamic Group Key Agreement key establishment. For secure group
communication in an Ad hoc network, a group key shared by all group members is
required. This group key should be updated when there are membership changes
(when the new ... | Krishnan Kumar, Nafeesa Begum J and V. Sumathy | cs.CR | http://creativecommons.org/licenses/by/3.0/ | 2010-07-02 | 1 | true | (IJCSIS) International Journal of Computer Science and Information Security,
Vol. 8, No. 2, 2010
A Novel Approach towards Cost Effective Region-
Based Group Key Agreement Protocol for Secure
Group Communication
K. Kumar J. Nafeesa Begum Dr.V. Sumathy
Research Scholar & Research Scholar & Asst .Professor in ECE
Lecture... | raw_pdf_preferred | false | 37,531 | 563 | 563 | 11 | [
"raw_text_pdf"
] | {"raw_text_pdf":563} | |
1007.0571 | 1007.0571 | /arxiv/pdfs/1007/1007.0571.pdf | Quickest Detection with Social Learning: Interaction of local and global
decision makers | We consider how local and global decision policies interact in stopping time
problems such as quickest time change detection. Individual agents make myopic
local decisions via social learning, that is, each agent records a private
observation of a noisy underlying state process, selfishly optimizes its local
utility an... | Vikram Krishnamurthy | cs.GT cs.IT math.IT stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2012-03-05 | 3 | true | 1
Quickest Detection with Social Learning:
Interaction of local and global decision makers
Vikram Krishnamurthy Fellow, IEEE
arXiv:1007.0571v3 [cs.GT] 2 Mar 2012
Abstract
We consider how local and global decision policies interact in stopping time problems such as
quickest time change detection. Individual agents ma... | raw_pdf_preferred | false | 128,669 | 2,075 | 2,075 | 59 | [
"raw_text_pdf"
] | {"raw_text_pdf":2075} | |
1007.0803 | 1007.0803 | /arxiv/pdfs/1007/1007.0803.pdf | Soft Control on Collective Behavior of a Group of Autonomous Agents by a
Shill Agent | This paper asks a new question: how can we control the collective behavior of
self-organized multi-agent systems? We try to answer the question by proposing
a new notion called 'Soft Control', which keeps the local rule of the existing
agents in the system. We show the feasibility of soft control by a case study.
Consi... | Jing Han, Ming Li and Lei Guo | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-07-07 | 1 | true | PUBLISHED IN JOURNAL OF SYSTEMS SCIENCE AND COMPLEXITY, 2006(19):54-62 1
Soft Control on Collective Behavior of a
Group of Autonomous Agents by a Shill Agent
Jing Han, Ming Li and Lei Guo
arXiv:1007.0803v1 [cs.MA] 6 Jul 2010
Abstract
This paper asks a new question: how can we control the collective behavior of self-... | raw_pdf_preferred | false | 30,157 | 382 | 382 | 14 | [
"raw_text_pdf"
] | {"raw_text_pdf":382} | |
1007.3700 | 1007.3700 | /arxiv/pdfs/1007/1007.3700.pdf | Logic Programming for Finding Models in the Logics of Knowledge and its
Applications: A Case Study | The logics of knowledge are modal logics that have been shown to be effective
in representing and reasoning about knowledge in multi-agent domains.
Relatively few computational frameworks for dealing with computation of models
and useful transformations in logics of knowledge (e.g., to support multi-agent
planning with... | Chitta Baral, Gregory Gelfond, Enrico Pontelli, Tran Cao Son | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-07-22 | 1 | true | Under consideration for publication in Theory and Practice of Logic Programming 1
Logic Programming for Finding Models in the
Logics of Knowledge and its Applications: A
Case Study
arXiv:1007.3700v1 [cs.AI] 21 Jul 2010
C. Baral, G. Gelfond E. Pontelli, T. Son
Dept. Computer Science Dept. Computer Science
Arizona Stat... | raw_pdf_preferred | false | 45,127 | 707 | 707 | 17 | [
"raw_text_pdf"
] | {"raw_text_pdf":707} | |
1007.5165 | 1007.5165 | /arxiv/pdfs/1007/1007.5165.pdf | Security Enhancement With Optimal QOS Using EAP-AKA In Hybrid Coupled
3G-WLAN Convergence Network | The third generation partnership project (3GPP) has addressed the feasibility
of interworking and specified the interworking architecture and security
architecture for third generation (3G)-wireless local area network (WLAN), it
is developing, system architecture evolution (SAE)/ long term evolution (LTE)
architecture,... | R. Shankar (1), Timothy Rajkumar.K (2) and P.Dananjayan (2) ((1) Sri
Manakula Vinayagar Engineering College and (2) Pondicherry Engineering
College, India) | cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2010-07-30 | 1 | true | International Journal Of UbiComp (IJU), Vol.1, No.3, July 2010
SECURITY ENHANCEMENT WITH OPTIMAL QOS
USING EAP-AKA IN HYBRID COUPLED 3G-WLAN
CONVERGENCE NETWORK
R. Shankar1, Timothy Rajkumar K2 and P. Dananjayan3
1
Department of ECE, Sri Manakula Vinayagar Engineering College, Pondicherry, India
pdananjayan@pec.edu
2... | raw_pdf_preferred | false | 36,565 | 470 | 470 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":470} | |
1008.0541 | 1008.0541 | /arxiv/pdfs/1008/1008.0541.pdf | Determinant Sums for Undirected Hamiltonicity | We present a Monte Carlo algorithm for Hamiltonicity detection in an
$n$-vertex undirected graph running in $O^*(1.657^{n})$ time. To the best of
our knowledge, this is the first superpolynomial improvement on the worst case
runtime for the problem since the $O^*(2^n)$ bound established for TSP almost
fifty years ago (... | Andreas Bj\"orklund | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-08-04 | 1 | true | Determinant Sums for Undirected Hamiltonicity
Andreas Björklund
Abstract
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undi-
arXiv:1008.0541v1 [cs.DS] 3 Aug 2010
rected graph running in O∗ (1.657n ) time. To the best of our knowledge, this is the first
superpolynomial improvement on t... | raw_pdf_preferred | false | 48,378 | 821 | 821 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":821} | |
1008.3306 | 1008.3306 | /arxiv/pdfs/1008/1008.3306.pdf | Modelling of Multi-Agent Systems: Experiences with Membrane Computing
and Future Challenges | Formal modelling of Multi-Agent Systems (MAS) is a challenging task due to
high complexity, interaction, parallelism and continuous change of roles and
organisation between agents. In this paper we record our research experience on
formal modelling of MAS. We review our research throughout the last decade, by
describin... | Petros Kefalas (CITY College), Ioanna Stamatopoulou (CITY College) | cs.MA cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-08-20 | 1 | true | Modelling of Multi-Agent Systems: Experiences with
Membrane Computing and Future Challenges
Petros Kefalas and Ioanna Stamatopoulou
Dept. of Computer Science CITY College, Thessaloniki, Greece
International Faculty of the University of Sheffield
{kefalas, istamatopoulou}@city.academic.gr
Formal modelling of Multi-Age... | raw_pdf_preferred | false | 35,143 | 450 | 450 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":450} | |
1008.3977 | 1008.3977 | /arxiv/pdfs/1008/1008.3977.pdf | Collaborative Structuring of Knowledge by Experts and the Public | There is much debate on how public participation and expertise can be brought
together in collaborative knowledge environments. One of the experiments
addressing the issue directly is Citizendium. In seeking to harvest the
strengths (and avoiding the major pitfalls) of both user-generated wiki
projects and traditional ... | Tom Morris and Daniel Mietchen | cs.DL cs.SI | http://creativecommons.org/licenses/by/3.0/ | 2010-08-25 | 1 | true | Collaborative Structuring of Knowledge
by Experts and the Public
Tom Morris1 and Daniel Mietchen2
1
http://www.citizendium.org/User:Tom_Morris
2
http://www.citizendium.org/User:Daniel_Mietchen
Correspondence: Daniel.Mietchen (at) uni-jena (dot) de
Abstract. There is much debate on how public participation and exper-
... | raw_pdf_preferred | false | 30,664 | 442 | 442 | 14 | [
"raw_text_pdf"
] | {"raw_text_pdf":442} | |
1008.4212 | 1008.4212 | /arxiv/pdfs/1008/1008.4212.pdf | A superconducting qubit as a quantum transformer routing entanglement
between a microscopic quantum memory and a macroscopic resonator | We demonstrate experimentally the creation and measurement of an entangled
state between a microscopic two level system and a macroscopic superconducting
resonator where their indirect interaction is mediated by an artificial atom, a
superconducting persistent current qubit (PCQB). We show that the microscopic
two leve... | Alexander Kemp, Shiro Saito, William J. Munro, Kae Nemoto, Kouichi
Semba | cond-mat.supr-con quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-19 | 1 | true | A superconducting qubit as a quantum transformer routing entanglement between a
microscopic quantum memory and a macroscopic resonator
Alexander Kemp,1, ∗ Shiro Saito,1 William J. Munro,1, 2 Kae Nemoto,2 and Kouichi Semba1, †
1
NTT Basic Research Laboratories, NTT Corporation,
3-1 Morinosato Wakamiya Atsugi-shi, Kanag... | raw_pdf_preferred | false | 20,424 | 244 | 244 | 7 | [
"raw_text_pdf"
] | {"raw_text_pdf":244} | |
1008.4990 | 1008.4990 | /arxiv/pdfs/1008/1008.4990.pdf | Multi-Agent Deployment for Visibility Coverage in Polygonal Environments
with Holes | This article presents a distributed algorithm for a group of robotic agents
with omnidirectional vision to deploy into nonconvex polygonal environments
with holes. Agents begin deployment from a common point, possess no prior
knowledge of the environment, and operate only under line-of-sight sensing and
communication. ... | Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo | cs.RO cs.DC cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-12-03 | 4 | true | 1
Multi-Agent Deployment for Visibility Coverage in
Polygonal Environments with Holes
Karl J. Obermeyer Anurag Ganguli Francesco Bullo
arXiv:1008.4990v4 [cs.RO] 2 Dec 2010
Abstract
This article presents a distributed algorithm for a group of robotic agents with omnidirectional vision to deploy
into nonconvex polygon... | raw_pdf_preferred | false | 87,643 | 1,224 | 1,224 | 35 | [
"raw_text_pdf"
] | {"raw_text_pdf":1224} | |
1009.2041 | 1009.2041 | /arxiv/pdfs/1009/1009.2041.pdf | Multi-Agent Only-Knowing Revisited | Levesque introduced the notion of only-knowing to precisely capture the
beliefs of a knowledge base. He also showed how only-knowing can be used to
formalize non-monotonic behavior within a monotonic logic. Despite its appeal,
all attempts to extend only-knowing to the many agent case have undesirable
properties. A bel... | Vaishak Belle and Gerhard Lakemeyer | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-01 | 1 | true | Multi-Agent Only-Knowing Revisited
Vaishak Belle and Gerhard Lakemeyer
Dept. of Computer Science,
RWTH Aachen,
52056 Aachen, Germany
arXiv:1009.2041v1 [cs.AI] 10 Sep 2010
{belle,gerhard}@cs.rwth-aachen.de
Abstract
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge
base. He ... | raw_pdf_preferred | false | 63,066 | 936 | 936 | 22 | [
"raw_text_pdf"
] | {"raw_text_pdf":936} | |
1009.2443 | 1009.2443 | /arxiv/pdfs/1009/1009.2443.pdf | Delay-Optimal User Scheduling and Inter-Cell Interference Management in
Cellular Network via Distributive Stochastic Learning | In this paper, we propose a distributive queueaware intra-cell user
scheduling and inter-cell interference (ICI) management control design for a
delay-optimal celluar downlink system with M base stations (BSs), and K users
in each cell. Each BS has K downlink queues for K users respectively with
heterogeneous arrivals ... | Huang Huang and Vincent K. N. Lau | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-09-14 | 1 | true | TO BE APPEARED IN IEEE TRANS. WIRELESS COMMUN. 1
Delay-Optimal User Scheduling and Inter-Cell
Interference Management in Cellular Network via
Distributive Stochastic Learning
Huang Huang Student Member, IEEE, Vincent K. N. Lau, Senior Member, IEEE
Abstract—In this paper, we propose a distributive queue- approach in d... | raw_pdf_preferred | false | 58,697 | 1,000 | 1,000 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":1000} | |
1009.6050 | 1009.6050 | /arxiv/pdfs/1009/1009.6050.pdf | Comments on "Consensus and Cooperation in Networked Multi-Agent Systems" | This note corrects a pretty serious mistake and some inaccuracies in
"Consensus and cooperation in networked multi-agent systems" by R.
Olfati-Saber, J.A. Fax, and R.M. Murray, published in Vol. 95 of the
Proceedings of the IEEE (2007, No. 1, P. 215-233). It also mentions several
stronger results applicable to the clas... | Pavel Chebotarev | cs.MA cs.NI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-01 | 1 | true | Comments on “Consensus and Cooperation in Networked Multi-Agent Systems” 1
PAVEL CHEBOTAREV,2 Member IEEE
Key words: consensus algorithms, cooperative control, flocking, graph Laplacian, networked multi-agent systems
The objective of this note is to give several comments regarding the paper [1] published in the Proce... | raw_pdf_preferred | false | 7,858 | 97 | 97 | 4 | [
"raw_text_pdf"
] | {"raw_text_pdf":97} | |
1010.0145 | 1010.0145 | /arxiv/pdfs/1010/1010.0145.pdf | Multi-Agent Programming Contest 2010 - The Jason-DTU Team | We provide a brief description of the Jason-DTU system, including the
methodology, the tools and the team strategy that we plan to use in the agent
contest. | J{\o}rgen Villadsen, Niklas Skamriis Boss, Andreas Schmidt Jensen, and
Steen Vester | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-04 | 1 | true | Multi-Agent Programming Contest 2010
—
The Jason-DTU Team
Jørgen Villadsen, Niklas Skamriis Boss, Andreas Schmidt Jensen, and
arXiv:1010.0145v1 [cs.MA] 1 Oct 2010
Steen Vester
Department of Informatics and Mathematical Modelling
Technical University of Denmark
Richard Petersens Plads, Building 321, DK-2800 Kongens L... | raw_pdf_preferred | false | 8,339 | 138 | 138 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":138} | |
1010.0150 | 1010.0150 | /arxiv/pdfs/1010/1010.0150.pdf | Implementing Lego Agents Using Jason | Since many of the currently available multi-agent frameworks are generally
mostly intended for research, it can be difficult to built multi-agent systems
using physical robots. In this report I describe a way to combine the
multi-agent framework Jason, an extended version of the agent-oriented
programming language Agen... | Andreas Schmidt Jensen | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-04 | 1 | true | Implementing Lego Agents Using Jason
Andreas Schmidt Jensen
arXiv:1010.0150v1 [cs.MA] 1 Oct 2010
1 October 2010
Abstract
Since many of the currently available multi-agent frameworks are
generally mostly intended for research, it can be difficult to built multi-
agent systems using physical robots. In this report I de... | raw_pdf_preferred | false | 38,363 | 733 | 733 | 25 | [
"raw_text_pdf"
] | {"raw_text_pdf":733} | |
1010.0155 | 1010.0155 | /arxiv/pdfs/1010/1010.0155.pdf | An Investigation of the Advantages of Organization-Centered Multi-Agent
Systems | Whereas classical multi-agent systems have the agent in center, there have
recently been a development towards focusing more on the organization of the
system. This allows the designer to focus on what the system goals are, without
considering how the goals should be fulfilled. This paper investigates whether
taking th... | Andreas Schmidt Jensen | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-04 | 1 | true | An Investigation of the Advantages of
Organization-Centered Multi-Agent Systems
Andreas Schmidt Jensen
Department of Informatics and Mathematical Modelling
Technical University of Denmark
Richard Petersens Plads, Building 321, DK-2800 Kongens Lyngby, Denmark
arXiv:1010.0155v1 [cs.MA] 1 Oct 2010
Abstract. Whereas cla... | raw_pdf_preferred | false | 37,224 | 606 | 606 | 16 | [
"raw_text_pdf"
] | {"raw_text_pdf":606} | |
1010.0287 | 1010.0287 | /arxiv/pdfs/1010/1010.0287.pdf | Queue-Aware Distributive Resource Control for Delay-Sensitive Two-Hop
MIMO Cooperative Systems | In this paper, we consider a queue-aware distributive resource control
algorithm for two-hop MIMO cooperative systems. We shall illustrate that relay
buffering is an effective way to reduce the intrinsic half-duplex penalty in
cooperative systems. The complex interactions of the queues at the source node
and the relays... | Rui Wang, Vincent K. N. Lau and Ying Cui | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-20 | 1 | true | 1
Queue-Aware Distributive Resource Control for
Delay-Sensitive Two-Hop MIMO Cooperative Systems
Rui Wang, Vincent K. N. Lau and Ying Cui
Department of ECE, The Hong Kong University of Science and Technology
Email: wray@ust.hk, eeknlau@ust.hk, cuiying@ust.hk
arXiv:1010.0287v1 [cs.LG] 2 Oct 2010
Abstract
In this pape... | raw_pdf_preferred | false | 69,142 | 1,295 | 1,295 | 31 | [
"raw_text_pdf"
] | {"raw_text_pdf":1295} | |
1010.4786 | 1010.4786 | /arxiv/pdfs/1010/1010.4786.pdf | Blocking Underhand Attacks by Hidden Coalitions (Extended Version) | Similar to what happens between humans in the real world, in open multi-agent
systems distributed over the Internet, such as online social networks or wiki
technologies, agents often form coalitions by agreeing to act as a whole in
order to achieve certain common goals. However, agent coalitions are not always
a desira... | Matteo Cristani and Erisa Karafili and Luca Vigan\`o | cs.CR cs.LO cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-10-27 | 2 | true | BLOCKING UNDERHAND ATTACKS BY HIDDEN COALITIONS
(EXTENDED VERSION)
Matteo Cristani, Erisa Karafili, Luca Viganò
Dipartimento di Informatica, Università degli Studi di Verona, Italy
{matteo.cristani,erisa.karafili,luca.vigano}@univr.it
arXiv:1010.4786v2 [cs.CR] 26 Oct 2010
Keywords: Multi-agent systems, coalitions, ... | raw_pdf_preferred | false | 58,144 | 768 | 768 | 14 | [
"raw_text_pdf"
] | {"raw_text_pdf":768} | |
1010.6234 | 1010.6234 | /arxiv/pdfs/1010/1010.6234.pdf | Analysing the behaviour of robot teams through relational sequential
pattern mining | This report outlines the use of a relational representation in a Multi-Agent
domain to model the behaviour of the whole system. A desired property in this
systems is the ability of the team members to work together to achieve a common
goal in a cooperative manner. The aim is to define a systematic method to
verify the ... | Grazia Bombini, Raquel Ros, Stefano Ferilli, Ramon Lopez de Mantaras | cs.AI cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-11-01 | 1 | true | Analysing the behaviour of robot teams through
relational sequential pattern mining
Grazia Bombini1 , Raquel Ros2 , Stefano Ferilli1 , Ramon Lopez de Mantaras3
1
University of Bari “Aldo Moro”, Department of Computer Science, 70125 Bari, Italy
{gbombini, ferilli}@di.uniba.it
2
Department of Electrical and Electronic E... | raw_pdf_preferred | false | 61,547 | 932 | 932 | 26 | [
"raw_text_pdf"
] | {"raw_text_pdf":932} | |
1011.0041 | 1011.0041 | /arxiv/pdfs/1011/1011.0041.pdf | Predictive State Temporal Difference Learning | We propose a new approach to value function approximation which combines
linear temporal difference reinforcement learning with subspace identification.
In practical applications, reinforcement learning (RL) is complicated by the
fact that state is either high-dimensional or partially observable. Therefore,
RL methods ... | Byron Boots and Geoffrey J. Gordon | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 2 | true | Predictive State Temporal Difference Learning
Byron Boots Geoffrey J. Gordon
Machine Learning Department Machine Learning Department
Carnegie Mellon University Carnegie Mellon University
Pittsburgh, PA 15213 Pittsburgh, PA 15213
beb@cs.cmu.edu ggordon@cs.cmu.edu
arXiv:1011.0041v2 [cs.LG] 18 Jan 2011
Abstract
We prop... | raw_pdf_preferred | false | 62,325 | 1,064 | 1,064 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":1064} | |
1011.0219 | 1011.0219 | /arxiv/pdfs/1011/1011.0219.pdf | On Zone-Based Analysis of Duration Probabilistic Automata | We propose an extension of the zone-based algorithmics for analyzing timed
automata to handle systems where timing uncertainty is considered as
probabilistic rather than set-theoretic. We study duration probabilistic
automata (DPA), expressing multiple parallel processes admitting memoryfull
continuously-distributed du... | Oded Maler (CNRS-VERIMAG, University of Grenoble, France), Kim G.
Larsen (CISS and CS Aalborg University, Denmark), Bruce H. Krogh (Department
of EC Carnegie Mellon University, USA) | cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-11-02 | 1 | true | On Zone-Based Analysis of Duration Probabilistic Automata
Oded Maler Kim G. Larsen Bruce H. Krogh
CNRS - VERIMAG CISS and CS Department of EC
University of Grenoble Aalborg University Carnegie Mellon University
France Denmark USA
Oded.Maler@imag.fr kgl@cs.aau.dk krogh@ece.cmu.edu
We propose an extension of the zone-b... | raw_pdf_preferred | false | 46,595 | 582 | 582 | 15 | [
"raw_text_pdf"
] | {"raw_text_pdf":582} | |
1011.0527 | 1011.0527 | /arxiv/pdfs/1011/1011.0527.pdf | Ciphertext Policy Attribute based Encryption with anonymous access
policy | In Ciphertext Policy Attribute based Encryption scheme, the encryptor can fix
the policy, who can decrypt the encrypted message. The policy can be formed
with the help of attributes. In CP-ABE, access policy is sent along with the
ciphertext. We propose a method in which the access policy need not be sent
along with th... | A. Balu, and K. Kuppusamy | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-11-03 | 1 | true | Ciphertext policy Attribute based
Encryption with anonymous access policy
A.Balu 1, K.Kuppusamy2
1
Research Associate, 2 Associate Professor
Department of Computer Science & Engg.,Alagappa University, Karaikudi,
Tamil Nadu, India.
balusuriya@yahoo.co.in, kkdiksamy@yahoo.com
Abstract
In Ciphertext Policy Attribute bas... | raw_pdf_preferred | false | 18,600 | 322 | 322 | 10 | [
"raw_text_pdf"
] | {"raw_text_pdf":322} | |
1011.4098 | 1011.4098 | /arxiv/pdfs/1011/1011.4098.pdf | Understanding Cascading Failures in Power Grids | In the past, we have observed several large blackouts, i.e. loss of power to
large areas. It has been noted by several researchers that these large
blackouts are a result of a cascade of failures of various components. As a
power grid is made up of several thousands or even millions of components
(relays, breakers, tra... | Sachin Kadloor and Nandakishore Santhi | cs.SI math.PR stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-11-19 | 1 | true | Understanding Cascading Failures in Power Grids
Sachin Kadloor and Nandakishore Santhi
Draft of March 2, 2022
Abstract
In the past, we have observed several large blackouts, i.e. loss of power to large areas. It has been noted by
several researchers that these large blackouts are a result of a cascade of failures of ... | raw_pdf_preferred | false | 35,294 | 564 | 564 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":564} | |
1011.4362 | 1011.4362 | /arxiv/pdfs/1011/1011.4362.pdf | Should one compute the Temporal Difference fix point or minimize the
Bellman Residual? The unified oblique projection view | We investigate projection methods, for evaluating a linear approximation of
the value function of a policy in a Markov Decision Process context. We
consider two popular approaches, the one-step Temporal Difference fix-point
computation (TD(0)) and the Bellman Residual (BR) minimization. We describe
examples, where each... | Bruno Scherrer (INRIA Lorraine - LORIA) | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-11-22 | 1 | true | Should one compute the Temporal Difference fix point or minimize
the Bellman Residual ? The unified oblique projection view
Bruno Scherrer scherrer@loria.fr
LORIA - INRIA Lorraine - Campus Scientifique - BP 239
54506 Vandœuvre-lès-Nancy CEDEX
FRANCE
arXiv:1011.4362v1 [cs.AI] 19 Nov 2010
Abstract Equation, and the mi... | raw_pdf_preferred | false | 35,935 | 749 | 749 | 14 | [
"raw_text_pdf"
] | {"raw_text_pdf":749} | |
1011.5298 | 1011.5298 | /arxiv/pdfs/1011/1011.5298.pdf | Bayesian Sequential Detection with Phase-Distributed Change Time and
Nonlinear Penalty -- A POMDP Approach | We show that the optimal decision policy for several types of Bayesian
sequential detection problems has a threshold switching curve structure on the
space of posterior distributions. This is established by using lattice
programming and stochastic orders in a partially observed Markov decision
process (POMDP) framework... | Vikram Krishnamurthy | cs.IT math.IT stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 4 | true | 1
Bayesian Sequential Detection with
Phase-Distributed Change Time and Nonlinear
Penalty – A POMDP Approach
Vikram Krishnamurthy Fellow, IEEE
arXiv:1011.5298v4 [cs.IT] 13 Jun 2011
Abstract
We show that the optimal decision policy for several types of Bayesian sequential detection problems
has a threshold switching c... | raw_pdf_preferred | false | 144,478 | 2,344 | 2,344 | 65 | [
"raw_text_pdf"
] | {"raw_text_pdf":2344} | |
1012.0058 | 1012.0058 | /arxiv/pdfs/1012/1012.0058.pdf | Modelling dynamic programming problems by generalized d-graphs | In this paper we introduce the concept of generalized d-graph (admitting
cycles) as special dependency-graphs for modelling dynamic programming (DP)
problems. We describe the d-graph versions of three famous single-source
shortest algorithms (The algorithm based on the topological order of the
vertices, Dijkstra algori... | Zolt\'an K\'atai | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2010-12-07 | 1 | true | Acta Univ. Sapientiae, Informatica, 2, 2 (2010) 210–230
Modelling dynamic programming problems
arXiv:1012.0058v1 [cs.DS] 30 Nov 2010
by generalized d-graphs
Zoltán Kátai
Sapientia Hungarian University of Transylvania
Department of Mathematics and Informatics,
Tg. Mureş, Romania
email: katai zoltan@ms.sapientia.ro... | raw_pdf_preferred | false | 36,335 | 608 | 608 | 22 | [
"raw_text_pdf"
] | {"raw_text_pdf":608} | |
1012.3877 | 1012.3877 | /arxiv/pdfs/1012/1012.3877.pdf | Queue-Aware Dynamic Clustering and Power Allocation for Network MIMO
Systems via Distributive Stochastic Learning | In this paper, we propose a two-timescale delay-optimal dynamic clustering
and power allocation design for downlink network MIMO systems. The dynamic
clustering control is adaptive to the global queue state information (GQSI)
only and computed at the base station controller (BSC) over a longer time
scale. On the other ... | Ying Cui, Qingqing Huang, Vincent K.N.Lau | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2017-04-26 | 1 | true | 1
Queue-Aware Dynamic Clustering and Power
Allocation for Network MIMO Systems via
Distributive Stochastic Learning
Ying Cui, Qingqing Huang, Vincent K. N. Lau, Senior Member, IEEE
arXiv:1012.3877v1 [cs.LG] 17 Dec 2010
ECE Department, Hong Kong University of Science and Technology, Hong Kong
Email: cuiying@ust.hk, tm... | raw_pdf_preferred | false | 74,453 | 1,332 | 1,332 | 32 | [
"raw_text_pdf"
] | {"raw_text_pdf":1332} | |
1101.0777 | 1101.0777 | /arxiv/pdfs/1101/1101.0777.pdf | On a linear programming approach to the discrete Willmore boundary value
problem and generalizations | We consider the problem of finding (possibly non connected) discrete surfaces
spanning a finite set of discrete boundary curves in the three-dimensional
space and minimizing (globally) a discrete energy involving mean curvature.
Although we consider a fairly general class of energies, our main focus is on
the Willmore ... | Thomas Schoenemann, Simon Masnou, Daniel Cremers | cs.CG cs.NA math.NA math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-01-05 | 1 | true | On a linear programming approach to the
discrete Willmore boundary value problem and
generalizations
Thomas Schoenemann1 , Simon Masnou2 , and Daniel Cremers3
1
Department of Mathematical Sciences, Lund University, Sweden
2
Institut Camille Jordan, Université Claude-Bernard Lyon 1, CNRS, France
3
Department of Comput... | raw_pdf_preferred | false | 40,975 | 726 | 726 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":726} | |
1101.2002 | 1101.2002 | /arxiv/pdfs/1101/1101.2002.pdf | Cooperative Tasking for Deterministic Specification Automata | In our previous work [1], a divide-and-conquer approach was proposed for
cooperative tasking among multi-agent systems. The basic idea is to decompose a
requested global specification into subtasks for individual agents such that
the fulfillment of these subtasks by each individual agent leads to the
satisfaction of th... | Mohammad Karimadini and Hai Lin | cs.SY cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 3 | true | Technical Report: NUS-ACT-12-001-Ver.3:
Cooperative Tasking for Deterministic
Specification Automata
arXiv:1101.2002v3 [cs.SY] 17 Aug 2012
Preprint, Submitted for publication
Mohammad Karimadini, and Hai Lin,
Abstract
In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking
among ... | raw_pdf_preferred | false | 62,500 | 1,212 | 1,212 | 26 | [
"raw_text_pdf"
] | {"raw_text_pdf":1212} | |
1101.2003 | 1101.2003 | /arxiv/pdfs/1101/1101.2003.pdf | Fault-tolerant Cooperative Tasking for Multi-agent Systems | A natural way for cooperative tasking in multi-agent systems is through a
top-down design by decomposing a global task into sub-tasks for each individual
agent such that the accomplishments of these sub-tasks will guarantee the
achievement of the global task. In our previous works [1], [2] we presented
necessary and su... | Mohammad Karimadini and Hai Lin | cs.SY cs.MA math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 2 | true | Technical Report: NUS-ACT-11-001-Ver.2:
Fault-tolerant Cooperative Tasking for
Multi-agent Systems
Preprint, Submitted for publication
arXiv:1101.2003v2 [cs.SY] 17 Apr 2011
Mohammad Karimadini, and Hai Lin,
Abstract
A natural way for cooperative tasking in multi-agent systems is through a top-down design by
decompos... | raw_pdf_preferred | false | 72,271 | 1,297 | 1,297 | 31 | [
"raw_text_pdf"
] | {"raw_text_pdf":1297} | |
1101.2788 | 1101.2788 | /arxiv/pdfs/1101/1101.2788.pdf | An ultra-thin waveguide twist constructed using fish-scale metallic
wires | This study theoretically and experimentally investigates the transmission
properties of a metamaterial slab comprised of two layers of metallic
fish-scale structure arrays and a sandwiched dielectric layer. Calculations
show that the asymmetric transmission can be tuned by varying the slab
thickness, due to evanescent ... | Jin Han, Hongqiang Li, Yuancheng Fan, Zeyong Wei, Chao Wu, Yang Cao,
Xing Yu, Fang Li, Zhanshan Wang | physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-01 | 2 | true | An ultra-thin waveguide twist constructed using fish-scale metallic wires
Jin Han,1, 2 Hongqiang Li,1, 2, a) Yuancheng Fan,1, 2 Zeyong Wei,1, 2 Chao Wu,1, 2 Yang Cao,1, 2 Xing Yu,1, 2 Fang
Li,1, 2 and Zhanshan Wang1, 2
1)
Department of Physics, Tongji University, Shanghai 200092, People’s Republic of China
2)
Shanghai ... | raw_pdf_preferred | false | 13,310 | 183 | 183 | 4 | [
"raw_text_pdf"
] | {"raw_text_pdf":183} | |
1101.3085 | 1101.3085 | /arxiv/pdfs/1101/1101.3085.pdf | Simulating Opinion Dynamics in Heterogeneous Communication | Since the information available is fundamental for our perceptions and
opinions, we are interested in understanding the conditions allowing for a good
information to be disseminated. This paper explores opinion dynamics by means
of multi-agent based simulations when agents get informed by different sources
of informati... | Walter Quattrociocchi, Rosaria Conte, Elena Lodi | cs.SI cs.MA physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 1 | true | Simulating Opinion Dynamics in Heterogeneous
Communication Environments
Walter Quattrociocchi12 , Rosaria Conte2 , and Elena Lodi1
1
University of Siena - Department of Mathematics and Computer Science
“R.Magari” - Siena, Italy
2
Laboratory of Agent Based Social Simulation - Institute of Cognitive Sciences and
Technol... | raw_pdf_preferred | false | 36,379 | 551 | 551 | 16 | [
"raw_text_pdf"
] | {"raw_text_pdf":551} | |
1101.3836 | 1101.3836 | /arxiv/pdfs/1101/1101.3836.pdf | U-Learning Within A Context-Aware Multiagent Environment | New technological developments have made it possible to interact with
computer systems and applications anywhere and anytime. It is vital that these
applications are able to adapt to the user, as a person, and to its current
situation, whatever that is. Therefore, the premises for evolution towards a
learning society a... | Monica Vladoiu and Zoran Constantinescu | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-01-21 | 1 | true | International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.1, January 2011
U-LEARNING WITHIN A CONTEXT-AWARE
MULTIAGENT ENVIRONMENT
Monica Vladoiu1 and Zoran Constantinescu2
1
Department of Informatics, PG University of Ploiesti, Ploiesti, Romania
monica@unde.ro
2
Department of Research and Develop... | raw_pdf_preferred | false | 51,218 | 698 | 698 | 16 | [
"raw_text_pdf"
] | {"raw_text_pdf":698} | |
1101.4431 | 1101.4431 | /arxiv/pdfs/1101/1101.4431.pdf | Parameter Optimization of Multi-Agent Formations based on LQR Design | In this paper we study the optimal formation control of multiple agents whose
interaction parameters are adjusted upon a cost function consisting of both the
control energy and the geometrical performance. By optimizing the interaction
parameters and by the linear quadratic regulation(LQR) controllers, the upper
bound ... | Huang Huang and Changbin Yu | cs.SY cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-17 | 1 | true | PARAMETER OPTIMIZATION OF MULTI-AGENT FORMATIONS
BASED ON LQR DESIGN∗
HUANG HUANG† AND CHANGBIN YU‡
Abstract. In this paper we study the optimal formation control of multiple agents whose
interaction parameters are adjusted upon a cost function consisting of both the control energy and
the geometrical performance. By ... | raw_pdf_preferred | false | 49,619 | 1,161 | 1,161 | 27 | [
"raw_text_pdf"
] | {"raw_text_pdf":1161} | |
1101.5428 | 1101.5428 | /arxiv/pdfs/1101/1101.5428.pdf | The Computing of Digital Ecosystems | A primary motivation for our research in digital ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. However, the computing technologies that contribute
to these p... | Gerard Briscoe and Philippe De Wilde | cs.DC cs.MA cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-01-31 | 1 | true | The Computing of Digital Ecosystems
Gerard Briscoe Philippe De Wilde
Media and Communications Department of Computer Science
London School of Economics and Political Science Heriot Watt University
United Kingdom United Kingdom
Abstract
A primary motivation for our research in digital ecosystems is the desire to exploi... | raw_pdf_preferred | false | 49,499 | 720 | 720 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":720} | |
1101.6045 | 1101.6045 | /arxiv/pdfs/1101/1101.6045.pdf | Probing the pseudogap phase of cuprates by a Giaever transformer | We develop a theory of the rectification effect in a double-layer system
where both layers are superconductors, or one of the layers is a normal metal.
The Coulomb interaction is assumed to provide the dominant coupling between the
layers. We find that superconducting fluctuations strongly enhance the drag
conductivity... | Alex Levchenko, M. R. Norman | cond-mat.supr-con | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-16 | 1 | true | Probing the pseudogap phase of cuprates by a Giaever transformer
Alex Levchenko and M. R. Norman
Materials Science Division, Argonne National Laboratory, Argonne, Illinois 60439, USA
(Dated: January 31, 2011)
We develop a theory of the rectification effect in a double-layer system where both layers are
superconductors... | raw_pdf_preferred | false | 19,038 | 314 | 314 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":314} | |
1102.0033 | 1102.0033 | /arxiv/pdfs/1102/1102.0033.pdf | Control of Multi-Agent Formations with Only Shape Constraints | This paper considers a novel problem of how to choose an appropriate geometry
for a group of agents with only shape constraints but with a flexible scale.
Instead of assigning the formation system with a specific geometry, here the
only requirement on the desired geometry is a shape without any location,
rotation and, ... | Huang Huang and Changbin Yu and Qinghe Wu | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-18 | 1 | true | INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
Int. J. Robust. Nonlinear Control 2010; 00:1–25
Published online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/rnc
Control of Multi-Agent Formations with Only Shape Constraints †
H. Huang‡ , C. Yu∗ and Q. Wu‡
arXiv:1102.0033v1 [cs.SY] 31 Jan 201... | raw_pdf_preferred | false | 77,400 | 1,430 | 1,430 | 26 | [
"raw_text_pdf"
] | {"raw_text_pdf":1430} | |
1102.2323 | 1102.2323 | /arxiv/pdfs/1102/1102.2323.pdf | Conditional Phase Shift for Quantum CCNOT Operation | We suggest the improvement of description methods for quantum phase gate
implementation in the cavity of QED configuration. Qubits are encoded into two
lowest Fock state. Three qubit phase transformation is resulted from the
interaction between Rydberg atom and three modes of cavity electromagnetic
field. Evolution of ... | Alexander Ig. Trifanov, George P. Miroshnichenko | quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-02-14 | 1 | true | Conditional Phase Shift for Quantum CCNOT Operation
1
Miroshnichenko G.P., 2Trifanov A.I.
Saint-Petersburg State University of Information Technologies, Mechanics and Optics
197101, Kronverksky 49, Saint-Petersburg, Russia
1
gpmirosh@gmail.com,
2
alextrifanov@gmail.com.
Abstract
We suggest the improvement of descript... | raw_pdf_preferred | false | 23,102 | 479 | 479 | 11 | [
"raw_text_pdf"
] | {"raw_text_pdf":479} | |
1102.3285 | 1102.3285 | /arxiv/pdfs/1102/1102.3285.pdf | B\"uchi Automata can have Smaller Quotients | We study novel simulation-like preorders for quotienting nondeterministic
B\"uchi automata. We define fixed-word delayed simulation, a new preorder
coarser than delayed simulation. We argue that fixed-word simulation is the
coarsest forward simulation-like preorder which can be used for quotienting
B\"uchi automata, th... | Lorenzo Clemente | cs.FL | http://creativecommons.org/licenses/by/3.0/ | 2011-04-27 | 2 | true | Büchi Automata can have Smaller Quotients
Lorenzo Clemente
LFCS. School of Informatics. University of Edinburgh. UK
Abstract. We study novel simulation-like preorders for quotienting nondeter-
arXiv:1102.3285v2 [cs.FL] 26 Apr 2011
ministic Büchi automata. We define fixed-word delayed simulation, a new pre-
order c... | raw_pdf_preferred | false | 75,268 | 1,177 | 1,177 | 27 | [
"raw_text_pdf"
] | {"raw_text_pdf":1177} | |
1102.5400 | 1102.5400 | /arxiv/pdfs/1102/1102.5400.pdf | Power Allocation for Cognitive Wireless Mesh Networks by Applying
Multi-agent Q-learning Approach | As the scarce spectrum resource is becoming over-crowded, cognitive radios
(CRs) indicate great flexibility to improve the spectrum efficiency by
opportunistically accessing the authorized frequency bands. One of the critical
challenges for operating such radios in a network is how to efficiently
allocate transmission ... | Xianfu Chen, Zhifeng Zhao, and Honggang Zhang | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | 2011-03-01 | 1 | true | 1
Power Allocation for Cognitive Wireless Mesh
Networks by Applying Multi-agent Q-learning
Approach
Xianfu Chen†‡ , Zhifeng Zhao†‡ , and Honggang Zhang†‡
arXiv:1102.5400v1 [cs.IT] 26 Feb 2011
†
York-Zhejiang Lab for Cognitive Radio and Green Communications
‡
Department of Information Science and Electronic Engineerin... | raw_pdf_preferred | false | 49,881 | 945 | 945 | 26 | [
"raw_text_pdf"
] | {"raw_text_pdf":945} | |
1102.5599 | 1102.5599 | /arxiv/pdfs/1102/1102.5599.pdf | Consensus of Discrete-Time Linear Multi-Agent Systems with Observer-Type
Protocols | This paper concerns the consensus of discrete-time multi-agent systems with
linear or linearized dynamics. An observer-type protocol based on the relative
outputs of neighboring agents is proposed. The consensus of such a multi-agent
system with a directed communication topology can be cast into the stability of
a set ... | Zhongkui Li, Zhisheng Duan, Guanrong Chen | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-09-20 | 2 | true | Manuscript submitted to Website: http://AIMsciences.org
AIMS’ Journals
Volume X, Number 0X, XX 200X pp. X–XX
CONSENSUS OF DISCRETE-TIME LINEAR MULTI-AGENT
SYSTEMS WITH OBSERVER-TYPE PROTOCOLS
arXiv:1102.5599v2 [cs.SY] 6 Mar 2011
Zhongkui Li
School of Automation, Beijing Institute of Technology
Beijing 100081, P. R. C... | raw_pdf_preferred | false | 46,822 | 891 | 891 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":891} | |
1103.1069 | 1103.1069 | /arxiv/pdfs/1103/1103.1069.pdf | Physics and measurements of magnetic materials | Magnetic materials, both hard and soft, are used extensively in several
components of particle accelerators. Magnetically soft iron-nickel alloys are
used as shields for the vacuum chambers of accelerator injection and extraction
septa; Fe-based material is widely employed for cores of accelerator and
experiment magnet... | S. Sgobba (CERN) | physics.acc-ph cond-mat.mtrl-sci | http://creativecommons.org/licenses/by/3.0/ | 2011-03-08 | 1 | true | Physics and measurements of magnetic materials
S. Sgobba
CERN, Geneva, Switzerland
Abstract
Magnetic materials, both hard and soft, are used extensively in several
components of particle accelerators. Magnetically soft iron–nickel alloys are
used as shields for the vacuum chambers of accelerator injection and
extract... | raw_pdf_preferred | false | 54,350 | 670 | 670 | 26 | [
"raw_text_pdf"
] | {"raw_text_pdf":670} | |
1103.2091 | 1103.2091 | /arxiv/pdfs/1103/1103.2091.pdf | An Artificial Immune System Model for Multi-Agents Resource Sharing in
Distributed Environments | Natural Immune system plays a vital role in the survival of the all living
being. It provides a mechanism to defend itself from external predates making
it consistent systems, capable of adapting itself for survival incase of
changes. The human immune system has motivated scientists and engineers for
finding powerful i... | Tejbanta Singh Chingtham, G. Sahoo and M.K. Ghose | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-11 | 1 | true | Tejbanta Singh Chingtham et. al. / (IJCSE) International Journal on Computer Science and Engineering
Vol. 02, No. 05, 2010, 1813-1818
An Artificial Immune System Model for Multi
Agents Resource Sharing in Distributed
Environments
Tejbanta Singh Chingtham G. Sahoo M.K. Ghose
Dept. of Computer Sc. & Engineering Dept. of... | raw_pdf_preferred | false | 18,174 | 257 | 257 | 7 | [
"raw_text_pdf"
] | {"raw_text_pdf":257} | |
1103.3931 | 1103.3931 | /arxiv/pdfs/1103/1103.3931.pdf | Realization of the D'B' boundary condition | In this paper we find a realization for the D'B'-boundary conditions, which
imposes vanishing normal derivatives of the normal components of the D and B
fields. The implementation of the DB boundary, requiring vanishing normal
components of D and B, is known. It is shown that the realization of the D'B'
boundary can be... | I.V. Lindell, A. Sihvola, L. bergamin, A. Favaro | physics.class-ph math-ph math.MP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-22 | 1 | true | arXiv:1103.3931v1 [physics.class-ph] 21 Mar 2011
Realization of the D’B’ Boundary Condition
I.V. Lindell1, A. Sihvola1, L. Bergamin2, A. Favaro3
1
Aalto University, Espoo, Finland
2
KB&P GmbH, Bern, Switzerland,
3
Imperial College London, United Kingdom
November 23, 2018
Abstract
In this paper we find a realization f... | raw_pdf_preferred | false | 16,435 | 343 | 343 | 12 | [
"raw_text_pdf"
] | {"raw_text_pdf":343} | |
1103.4093 | 1103.4093 | /arxiv/pdfs/1103/1103.4093.pdf | Aspects of Nonabelian Group Based Cryptography: A Survey and Open
Problems | Most common public key cryptosystems and public key exchange protocols
presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve
methods are number theory based and hence depend on the structure of abelian
groups. The strength of computing machinery has made these techniques
theoretically suscepti... | Benjamin Fine, Maggie Habeeb, Delaram Kahrobaei, Gerhard Rosenberger | cs.CR math.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-23 | 2 | true | Aspects of Nonabelian Group Based Cryptography:
A Survey and Open Problems
arXiv:1103.4093v2 [cs.CR] 22 Mar 2011
Benjamin Fine
Department of Mathematics
Fairfield University
Fairfield, Connecticut 06430, United States
fine@mail.fairfield.edu
Maggie Habeeb
Department of Mathematics
City University of New York
New York,... | raw_pdf_preferred | false | 84,106 | 1,182 | 1,182 | 32 | [
"raw_text_pdf"
] | {"raw_text_pdf":1182} | |
1103.4854 | 1103.4854 | /arxiv/pdfs/1103/1103.4854.pdf | When is social computation better than the sum of its parts? | Social computation, whether in the form of searches performed by swarms of
agents or collective predictions of markets, often supplies remarkably good
solutions to complex problems. In many examples, individuals trying to solve a
problem locally can aggregate their information and work together to arrive at
a superior ... | Vadas Gintautas, Aric Hagberg, Luis M. A. Bettencourt | cs.IT cs.AI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-03-25 | 1 | true | When is social computation better than the sum of its parts?
Vadas Gintautas,∗ Aric Hagberg,† and Luı́s M. A. Bettencourt‡
Center for Nonlinear Studies, and Applied Mathematics and Plasma Physics,
Theoretical Division, Los Alamos National Laboratory, Los Alamos NM 87545
(Dated: November 20, 2018)
Social computation, w... | raw_pdf_preferred | false | 23,146 | 299 | 299 | 6 | [
"raw_text_pdf"
] | {"raw_text_pdf":299} | |
1103.5254 | 1103.5254 | /arxiv/pdfs/1103/1103.5254.pdf | Computational Rationalization: The Inverse Equilibrium Problem | Modeling the purposeful behavior of imperfect agents from a small number of
observations is a challenging task. When restricted to the single-agent
decision-theoretic setting, inverse optimal control techniques assume that
observed behavior is an approximately optimal solution to an unknown decision
problem. These tech... | Kevin Waugh and Brian D. Ziebart and J. Andrew Bagnell | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-19 | 3 | true | Computational Rationalization: The Inverse Equilibrium Problem
Kevin Waugh waugh@cs.cmu.edu
Brian D. Ziebart bziebart@cs.cmu.edu
J. Andrew Bagnell dbagnell@ri.cmu.edu
Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA, USA 15213
arXiv:1103.5254v3 [cs.GT] 6 May 2011
Abstract often ill-suited for predicting th... | raw_pdf_preferred | false | 39,022 | 713 | 713 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":713} | |
1104.0780 | 1104.0780 | /arxiv/pdfs/1104/1104.0780.pdf | A distributed Approach for Access and Visibility Task with a Manikin and
a Robot in a Virtual Reality Environment | This paper presents a new method, based on a multi-agent system and on a
digital mock-up technology, to assess an efficient path planner for a manikin
or a robot for access and visibility task taking into account ergonomic
constraints or joint and mechanical limits. In order to solve this problem, the
human operator is... | Patrick Chedmail (IRCCyN), Damien Chablat (IRCCyN), Christophe Le Roy
(Airbus) | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-04-06 | 1 | true | To appear in Journal on Industrial, Electronics P. Chedmail, D. Chablat, C. Le Roy
A distributed Approach for Access and Visibility
Task with a Manikin and a Robot in a Virtual
Reality Environment
P. Chedmail, D. Chablat, and Ch. Le Roy
Abstract— This paper presents a new method, based on a multi-agent system an... | raw_pdf_preferred | false | 28,253 | 397 | 397 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":397} | |
1104.2773 | 1104.2773 | /arxiv/pdfs/1104/1104.2773.pdf | Distributed Stochastic Approximation for Constrained and Unconstrained
Optimization | In this paper, we analyze the convergence of a distributed Robbins-Monro
algorithm for both constrained and unconstrained optimization in multi-agent
systems. The algorithm searches for local minima of a (nonconvex) objective
function which is supposed to coincide with a sum of local utility functions of
the agents. Th... | Pascal Bianchi and J\'er\'emie Jakubowicz | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-04-20 | 2 | true | Distributed Stochastic Approximation
∗
for Constrained and Unconstrained Optimization
Pascal Bianchi Jérémie Jakubowicz
Telecom ParisTech / CNRS-LTCI
46, rue Barrault - 75634 Paris Cedex - France
{bianchi,jakubowi}@telecom-paristech.fr
arXiv:1104.2773v2 [cs.IT] 19 Apr 2011
ABSTRACT control, robotics, computer technol... | raw_pdf_preferred | false | 35,513 | 524 | 524 | 8 | [
"raw_text_pdf"
] | {"raw_text_pdf":524} | |
1104.3495 | 1104.3495 | /arxiv/pdfs/1104/1104.3495.pdf | Realization of a spherical boundary by a layer of wave-guiding medium | In this paper the concept of wave-guiding medium, previously introduced for
planar structures, is defined for the spherically symmetric case. It is shown
that a quarter-wavelength layer of such a medium serves as a transformer of
boundary conditions between two spherical interfaces. As an application, the
D'B'-boundary... | I.V. Lindell, J. Markkanen, A. Sihvola and P. Yl\"a-Oijala | physics.class-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-05-27 | 1 | true | arXiv:1104.3495v1 [physics.class-ph] 18 Apr 2011
Realization of a Spherical Boundary by a Layer of
Wave-Guiding Medium
Ismo V. Lindell, Johannes Markkanen,
Ari Sihvola, and Pasi Ylä-Oijala
Aalto University School of Electrical Engineering
Department of Radio Science and Engineering
Box 13000, FI–00076 AALTO, Finland
... | raw_pdf_preferred | false | 18,936 | 442 | 442 | 13 | [
"raw_text_pdf"
] | {"raw_text_pdf":442} | |
1104.5384 | 1104.5384 | /arxiv/pdfs/1104/1104.5384.pdf | Chance-constrained Model Predictive Control for Multi-Agent Systems | We consider stochastic model predictive control of a multi-agent systems with
constraints on the probabilities of inter-agent collisions. We first study a
sample-based approximation of the collision probabilities and use this
approximation to formulate constraints for the stochastic control problem. This
approximation ... | Daniel Lyons, Jan-P. Calliess, Uwe D. Hanebeck | cs.SY cs.MA math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-08-17 | 3 | true | Chance-constrained Model Predictive
Control for Multi-Agent Systems
Daniel Lyons∗, Jan-P. Calliess†, and Uwe D. Hanebeck‡
September 1, 2021
arXiv:1104.5384v3 [cs.SY] 16 Aug 2011
We consider stochastic model predictive control of a multi-agent systems
with constraints on the probabilities of inter-agent collisions. We ... | raw_pdf_preferred | false | 82,465 | 1,441 | 1,441 | 34 | [
"raw_text_pdf"
] | {"raw_text_pdf":1441} | |
1105.0707 | 1105.0707 | /arxiv/pdfs/1105/1105.0707.pdf | Parameterized Complexity of Problems in Coalitional Resource Games | Coalition formation is a key topic in multi-agent systems. Coalitions enable
agents to achieve goals that they may not have been able to achieve on their
own. Previous work has shown problems in coalitional games to be
computationally hard. Wooldridge and Dunne (Artificial Intelligence 2006)
studied the classical compu... | Rajesh Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat | cs.AI cs.CC cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-05-05 | 1 | true | Parameterized Complexity of Problems in Coalitional Resource
Games∗
Rajesh Chitnis† MohammadTaghi Hajiaghayi‡ Vahid Liaghat§
September 3, 2018
arXiv:1105.0707v1 [cs.AI] 3 May 2011
Abstract
Coalition formation is a key topic in multi-agent systems. Coalitions enable agents to achieve goals
that they may not have been ... | raw_pdf_preferred | false | 48,468 | 659 | 659 | 19 | [
"raw_text_pdf"
] | {"raw_text_pdf":659} | |
1105.1071 | 1105.1071 | /arxiv/pdfs/1105/1105.1071.pdf | A New Family of Practical Non-Malleable Diffie-Hellman Protocols | Cryptography algorithm standards play a key role both to the practice of
information security and to cryptography theory research. Among them, the MQV
and HMQV protocols ((H)MQV, in short) are a family of (implicitly
authenticated) Diffie-Hellman key-exchange (DHKE) protocols that are widely
standardized and deployed. ... | Andrew C. Yao, Yunlei Zhao | cs.CR cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-12-20 | 5 | true | A New Family of Practical Non-Malleable Diffie-Hellman Protocols
Andrew C. Yao ∗ Yunlei Zhao†
Abstract
Cryptography algorithm standards play a key role both to the practice of information security
and to cryptography theory research. Among them, the MQV and HMQV protocols ((H)MQV, in
short) are a family of (implicitly ... | raw_pdf_preferred | false | 200,365 | 2,291 | 2,291 | 49 | [
"raw_text_pdf"
] | {"raw_text_pdf":2291} | |
1105.1086 | 1105.1086 | /arxiv/pdfs/1105/1105.1086.pdf | Public Key Protocol Based on Amalgamated Free Product | In the spirit of Diffie Hellman the concept of a protocol algebra is
introduced using certain amalgamated free product of Braid group B and Thompson
group T together with a nilpotent subgroup H of index 2. | Sumit Kumar Upadhyay, Shiv Datt Kumar and Ramji Lal | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-19 | 1 | true | PUBLIC KEY PROTOCOL BASED ON AMALGAMATED
FREE PRODUCT∗
SUMIT KUMAR UPADHYAY1 , SHIV DATT KUMAR2
RAMJI LAL3
1,2
MATHEMATICS DEPARTMENT,
MOTILAL NEHRU NATIONAL INSTITUTE OF TECHNOLOGY
ALLAHABAD, U.P. (INDIA)
3
MATHEMATICS DEPARTMENT,
arXiv:1105.1086v1 [cs.CR] 16 Apr 2011
UNIVERSITY OF ALLAHABAD, ALLAHABAD, (INDIA)
A... | raw_pdf_preferred | false | 9,098 | 152 | 152 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":152} | |
1105.2301 | 1105.2301 | /arxiv/pdfs/1105/1105.2301.pdf | Parallel and Distributed Simulation from Many Cores to the Public Cloud
(Extended Version) | In this tutorial paper, we will firstly review some basic simulation concepts
and then introduce the parallel and distributed simulation techniques in view
of some new challenges of today and tomorrow. More in particular, in the last
years there has been a wide diffusion of many cores architectures and we can
expect th... | Gabriele D'Angelo | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2015-03-19 | 4 | true | 1
Parallel and Distributed Simulation
from Many Cores to the Public Cloud
(Extended Version)
Gabriele D’Angelo
Department of Computer Science
University of Bologna
Bologna, Italy
g.dangelo@unibo.it,
arXiv:1105.2301v4 [cs.DC] 29 Jul 2014
http://www.cs.unibo.it/gdangelo
Abstract—In this tutorial paper, we will firstly... | raw_pdf_preferred | false | 51,931 | 587 | 587 | 10 | [
"raw_text_pdf"
] | {"raw_text_pdf":587} | |
1105.5282 | 1105.5282 | /arxiv/pdfs/1105/1105.5282.pdf | State Space Reduction in the Maude-NRL Protocol Analyzer | The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system
for reasoning about the security of cryptographic protocols in which the
cryptosystems satisfy different equational properties. It both extends and
provides a formal framework for the original NRL Protocol Analyzer, which
supported equational re... | Santiago Escobar and Catherine Meadows and Jose Meseguer | cs.CR cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-05-30 | 1 | true | State Space Reduction in
the Maude-NRL Protocol Analyzer
Santiago Escobara , Catherine Meadowsb , José Meseguerc
a DSIC-ELP, Universidad Politécnica de Valencia, Valencia, Spain
b Naval Research Laboratory, Washington, DC, USA
arXiv:1105.5282v1 [cs.CR] 26 May 2011
c University of Illinois at Urbana-Champaign, Urban... | raw_pdf_preferred | false | 99,750 | 1,634 | 1,634 | 38 | [
"raw_text_pdf"
] | {"raw_text_pdf":1634} | |
1106.0223 | 1106.0223 | /arxiv/pdfs/1106/1106.0223.pdf | Decentralized Markets versus Central Control: A Comparative Study | Multi-Agent Systems (MAS) promise to offer solutions to problems where
established, older paradigms fall short. In order to validate such claims that
are repeatedly made in software agent publications, empirical in-depth studies
of advantages and weaknesses of multi-agent solutions versus conventional ones
in practical... | H. Akkermans, F. Ygge | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-02 | 1 | true | Journal of Artificial Intelligence Research 11 (1999) 301-333 Submitted 3/99; published 10/99
Decentralized Markets versus Central Control:
A Comparative Study
Fredrik Ygge ygge@enersearch.se
EnerSearch AB and Uppsala University
Chalmers Science Park
S-412 88 Gothenburg, Sweden
www.enersearch.se/ygge
Hans Akkermans ... | raw_pdf_preferred | false | 85,282 | 1,477 | 1,477 | 34 | [
"raw_text_pdf"
] | {"raw_text_pdf":1477} | |
1106.0229 | 1106.0229 | /arxiv/pdfs/1106/1106.0229.pdf | OBDD-based Universal Planning for Synchronized Agents in
Non-Deterministic Domains | Recently model checking representation and search techniques were shown to be
efficiently applicable to planning, in particular to non-deterministic
planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDs)
to encode a planning domain as a non-deterministic finite automaton and then
apply fast alg... | R. M. Jensen, M. M. Veloso | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-02 | 1 | true | Journal of Arti cial Intelligence Research 13 (2000) 189-226 Submitted 6/99; published 10/00
OBDD-based Universal Planning for Synchronized Agents
in Non-Deterministic Domains
Rune M. Jensen runej@cs.cmu.edu
Manuela M. Veloso mmv@cs.cmu.edu
Computer Science Department, Carnegie Mellon University
Pittsburgh, PA 15213-3... | raw_pdf_preferred | false | 95,857 | 1,537 | 1,537 | 39 | [
"raw_text_pdf"
] | {"raw_text_pdf":1537} | |
1106.0235 | 1106.0235 | /arxiv/pdfs/1106/1106.0235.pdf | Robust Agent Teams via Socially-Attentive Monitoring | Agents in dynamic multi-agent environments must monitor their peers to
execute individual and group plans. A key open question is how much monitoring
of other agents' states is required to be effective: The Monitoring Selectivity
Problem. We investigate this question in the context of detecting failures in
teams of coo... | G. A. Kaminka, M. Tambe | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-02 | 1 | true | Journal of Arti
ial Intelligen e Resear h 12 (2000) 105-147 Submitted 10/99; published 3/00
Robust Agent Teams via So ially-Attentive Monitoring
Gal A. Kaminka galkisi.edu
Milind Tambe tambeisi.edu
Information S ien es Institute and Computer S ien e Department
University of Southern California
4676 Admiralty Way
... | raw_pdf_preferred | false | 128,733 | 1,965 | 1,965 | 44 | [
"raw_text_pdf"
] | {"raw_text_pdf":1965} | |
1106.1816 | 1106.1816 | /arxiv/pdfs/1106/1106.1816.pdf | Monitoring Teams by Overhearing: A Multi-Agent Plan-Recognition Approach | Recent years are seeing an increasing need for on-line monitoring of teams of
cooperating agents, e.g., for visualization, or performance tracking. However,
in monitoring deployed teams, we often cannot rely on the agents to always
communicate their state to the monitoring system. This paper presents a
non-intrusive ap... | G. A. Kaminka, D. V. Pynadath, M. Tambe | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-10 | 1 | true | Journal of Arti
ial Intelligen e Resear h 17 (2002) 83135 Submitted 10/01; published 08/02
Monitoring Teams by Overhearing:
A Multi-Agent Plan-Re ognition Approa h
Gal A. Kaminka galk s.biu.a .il
Computer S ien e Department
Bar Ilan University
Ramat Gan 52900, Israel
David V. Pynadath pynadathisi.edu
Milind Tambe... | raw_pdf_preferred | false | 164,244 | 2,591 | 2,591 | 54 | [
"raw_text_pdf"
] | {"raw_text_pdf":2591} | |
1106.1821 | 1106.1821 | /arxiv/pdfs/1106/1106.1821.pdf | Collective Intelligence, Data Routing and Braess' Paradox | We consider the problem of designing the the utility functions of the
utility-maximizing agents in a multi-agent system so that they work
synergistically to maximize a global utility. The particular problem domain we
explore is the control of network routing by placing agents on all the routers
in the network. Conventi... | K. Tumer, D. H. Wolpert | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-10 | 1 | true | Journal of Arti ial Intelligen e Resear h 16 (2002) 359-387 Submitted 12/01; published 6/02
Colle tive Intelligen e, Data Routing and Braess' Paradox
David H. Wolpert dhwptolemy.ar .nasa.gov
NASA Ames Resear h Center, Mailstop 269-2
Mo ett Field, CA 94035
Kagan Tumer kaganptolemy.ar .nasa.gov
NASA Ames Resear h Cen... | raw_pdf_preferred | false | 83,502 | 1,403 | 1,403 | 30 | [
"raw_text_pdf"
] | {"raw_text_pdf":1403} | |
1106.2357 | 1106.2357 | /arxiv/pdfs/1106/1106.2357.pdf | Comparing Haar-Hilbert and Log-Gabor Based Iris Encoders on Bath Iris
Image Database | This papers introduces a new family of iris encoders which use 2-dimensional
Haar Wavelet Transform for noise attenuation, and Hilbert Transform to encode
the iris texture. In order to prove the usefulness of the newly proposed iris
encoding approach, the recognition results obtained by using these new encoders
are com... | Nicolaie Popescu-Bodorin, Valentina E. Balas | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-14 | 1 | true | Comparing Haar-Hilbert and Log-Gabor Based Iris
Encoders on Bath Iris Image Database
N. Popescu-Bodorin, Member, IEEE V.E. Balas, Senior Member, IEEE
Dept. of Math. & Computer Science, ‘Spiru Haret’ University Faculty of Engineering, ‘Aurel Vlaicu’ University
Bucharest, România Arad, România
bodorin@ieee.org balas@drba... | raw_pdf_preferred | false | 31,180 | 478 | 478 | 7 | [
"raw_text_pdf"
] | {"raw_text_pdf":478} | |
1106.3134 | 1106.3134 | /arxiv/pdfs/1106/1106.3134.pdf | Communicate only when necessary: Cooperative tasking for multi-agent
systems | New advances in large scale distributed systems have amazingly offered
complex functionalities through parallelism of simple and rudimentary
components. The key issue in cooperative control of multi-agent systems is the
synthesis of local control and interaction rules among the agents such that the
entire controlled sy... | Mohammad Karimadini and Hai Lin | cs.MA cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-17 | 1 | true | Technical Report: NUS-ACT-11-003-Ver.1:
Communicate only when necessary:
Cooperative tasking for multi-agent systems
arXiv:1106.3134v1 [cs.MA] 16 Jun 2011
Mohammad Karimadini, and Hai Lin
Abstract
New advances in large scale distributed systems have amazingly offered complex functionalities
through parallelism of si... | raw_pdf_preferred | false | 86,055 | 1,335 | 1,335 | 37 | [
"raw_text_pdf"
] | {"raw_text_pdf":1335} | |
1106.3684 | 1106.3684 | /arxiv/pdfs/1106/1106.3684.pdf | Exploratory simulation of an Intelligent Iris Verifier Distributed
System | This paper discusses some topics related to the latest trends in the field of
evolutionary approaches to iris recognition. It presents the results of an
exploratory experimental simulation whose goal was to analyze the possibility
of establishing an Interchange Protocol for Digital Identities evolved in
different geogr... | Nicolaie Popescu-Bodorin, Valentina E. Balas | cs.CV cs.ET cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-21 | 1 | true | Exploratory Simulation of an Intelligent Iris
Verifier Distributed System
N. Popescu-Bodorin*, Member IEEE and V.E. Balas**, Senior Member IEEE
* Artificial Intelligence & Computational Logic Laboratory, Spiru Haret University, Bucharest, România
** Faculty of Engineering, Aurel Vlaicu University, Arad, România
bodori... | raw_pdf_preferred | false | 22,870 | 260 | 260 | 5 | [
"raw_text_pdf"
] | {"raw_text_pdf":260} | |
1106.4570 | 1106.4570 | /arxiv/pdfs/1106/1106.4570.pdf | Competitive Safety Analysis: Robust Decision-Making in Multi-Agent
Systems | Much work in AI deals with the selection of proper actions in a given (known
or unknown) environment. However, the way to select a proper action when facing
other agents is quite unclear. Most work in AI adopts classical game-theoretic
equilibrium analysis to predict agent behavior in such settings. This approach
howev... | M. Tennenholtz | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 2011-06-24 | 1 | true | Journal of Artificial Intelligence Research 17 (2002) 363–378 Submitted 5/02; published 11/02
Competitive Safety Analysis: Robust Decision-Making in
Multi-Agent Systems
Moshe Tennenholtz moshet@ie.technion.ac.il
Faculty of Industrial Engineering and Management
Technion – Israel Institute of Technology
Haifa 32000, Is... | raw_pdf_preferred | false | 44,686 | 727 | 727 | 17 | [
"raw_text_pdf"
] | {"raw_text_pdf":727} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.