Works Published in 2013
Displaying works 41 - 60 of 225 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2013 conference paper
Cataloging and Comparing Logging Mechanism Specifications for Electronic Health Record Systems
Proceedings of the 2013 USENIX Conference on Safety, Security, Privacy and Interoperability of Health Information Technologies, 4–4. http://dl.acm.org/citation.cfm?id=2696523.2696527
Event: at Berkeley, CA, USA
Source: ORCID
Added: March 17, 2021
2013 journal article
Guest editorial for the Special Section on BEST PAPERS from the 2011 conference on Predictive Models in Software Engineering (PROMISE)
Information and Software Technology, 55(8), 1477–1478.
Sources: Crossref, NC State University Libraries
Added: January 21, 2021
2013 chapter
Agent Communication
In G. Weiss (Ed.), Multiagent Systems (2nd ed., pp. 101–141). Cambridge, Massachusetts: MIT Press.
Ed(s): G. Weiss
Source: NC State University Libraries
Added: January 17, 2021
2013 chapter
The Uses of Norms
In G. Andrighetto, G. Governatori, P. Noriega, & L. W. N. Torre (Eds.), Normative Multi-Agent Systems (Vol. 4, pp. 191–229).
Ed(s): G. Andrighetto, G. Governatori, P. Noriega & L. Torre
TL;DR:
This chapter presents a variety of applications of norms in sociotechnical systems, data licensing and data collection, understanding software development teams, requirements engineering, assurance, natural resource allocation, wireless grids, autonomous vehicles, serious games, and virtual worlds.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: January 17, 2021
2013 chapter
Regulated MAS: Social Perspective
In G. Andrighetto, G. Governatori, P. Noriega, & L. W. N. Torre (Eds.), Normative Multi-Agent Systems (Vol. 4, pp. 93–133).
Ed(s): G. Andrighetto, G. Governatori, P. Noriega & L. Torre
TL;DR:
This work aims to demonstrate the efforts towards in-situ applicability of EMMARM, which aims to provide real-time information about concrete mechanical properties of E-modulus and its properties as well as suggest ways to improve the quality and quantity of these properties.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
17. Partnerships for the Goals
(OpenAlex)
Sources: NC State University Libraries, NC State University Libraries
Added: January 17, 2021
2013 conference paper
Positron: Composing Commitment Protocols
Proceedings of the 1st International Workshop on Engineering Multiagent Systems (EMAS). Presented at the International Workshop on Engineering Multiagent Systems, St. Paul, MN.
Event: International Workshop on Engineering Multiagent Systems at St. Paul, MN on May 6-7, 2013
Source: NC State University Libraries
Added: January 17, 2021
2013 conference paper
Towards an Argumentation-Based Model of Social Interaction
Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems (ArgMAS). Presented at the International Workshop on Argumentation in Multi-Agent Systems, St. Paul, MN.
Event: International Workshop on Argumentation in Multi-Agent Systems at St. Paul, MN
Source: NC State University Libraries
Added: January 17, 2021
2013 conference paper
Trustworthy Decision Making via Commitments
Proceedings of the 15th AAMAS Workshop on Trust in Agent Societies (Trust), 24–35.
Event: International Joint Conference on Autonomous Agents and Multiagent Systems at St. Paul, MN
Source: NC State University Libraries
Added: January 17, 2021
2013 journal article
Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU
ACM SIGPLAN Notices, 48(8), 57.
author keywords: Performance; Experimentation; GPGPU; Memory coalescing; Computational complexity; Thread-data remapping; Runtime optimizations; Data transformation
Sources: Crossref, NC State University Libraries
Added: December 7, 2020
2013 book
Agents and Data Mining Interaction
Ed(s): L. Cao, Y. Zeng, A. Symeonidis, V. Gorodetsky, P. Yu & M. Singh
Event: 8th International Workshop, ADMI 2012 at Valencia, Spain on June 4-5, 2012
TL;DR:
This lecture discusses the results of research into the idea of organization control as a low overhead way of coordinating the learning of large agent collectives and its relationship to issues in distributed data mining.
(via Semantic Scholar)
Sources: Crossref, ORCID
Added: December 7, 2020
2013 conference paper
Geometric Separators and the Parabolic Lift
CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Waterloo, Ontario.
Event: Canadian Conference in Computational Geometry at Waterloo, Ontario on August 8-10, 2013
Source: NC State University Libraries
Added: November 15, 2020
2013 chapter
Knowledge-Assisted Ontology-Based Requirements Evolution
In W. Maalej & A. K. Thurimella (Eds.), Managing Requirements Knowledge (MaRK) (pp. 143–167). https://research-information.bris.ac.uk/en/publications/9d328913-4eb3-4403-bf6f-bbf20ed08017
Ed(s): W. Maalej & A. Thurimella
Event: at Germany
Source: ORCID
Added: October 31, 2020
2013 conference paper
Argumentation, Evidence, and Schemes: Abstract
Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems, 37. https://research-information.bris.ac.uk/en/publications/3b00f0ba-3768-4e45-94f5-93d1a4661f2b
Event: International Workshop on Argumentation in Multi-Agent Systems at St. Paul, MN on May 6-10, 2013
Sources: NC State University Libraries, ORCID
Added: October 31, 2020
2013 chapter
Fine-Grained Treatment to Synchronizations in GPU-to-CPU Translation
In Languages and Compilers for Parallel Computing (pp. 171–184).
TL;DR:
It is shown that careful dependence analysis may allow a fine-grained treatment to synchronizations and reveal redundant computation at the instruction-instance level and compared to existing translations, the new approach can yield speedup of a factor of integers.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020
2013 chapter
Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors
In Job Scheduling Strategies for Parallel Processing (pp. 114–133).
citeseerx.ist.psu.edu (repository)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020
2013 journal article
HPar
ACM Transactions on Architecture and Code Optimization, 10(4), 1–25.
TL;DR:
This work develops, to the best of the authors' knowledge, the first pipelining and data-level parallel HTML parsers and demonstrates the feasibility of efficient, parallel HTML parsing for the first time and offers a set of novel insights for parallel HTML parse.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2013 chapter
Simple Profile Rectifications Go a Long Way
In ECOOP 2013 – Object-Oriented Programming (pp. 654–678).
TL;DR:
Experiments show that the simple approach enhances the effectiveness of sampled profile-based FDO dramatically, increasing the average FDO speedup from 1.16X to 1.3X, around 92% of what full profiles can yield.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020
2013 chapter
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
In Advances in Cryptology - ASIACRYPT 2013 (pp. 100–119).
TL;DR:
A constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme into an extractable and equivocal commitment scheme, therefore yielding to UC-security is presented.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2013 chapter
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
In Advances in Cryptology – EUROCRYPT 2013 (pp. 702–718).
TL;DR:
A major step towards understanding and securely using PUFs was recently taken in [Crypto 2011] where Brzuska, Fischlin, Schroder and Katzenbeisser model PUFs in the Universal Composition (UC) framework of Canetti.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
2013 chapter
Revisiting Lower and Upper Bounds for Selective Decommitments
In Theory of Cryptography (pp. 559–578).
TL;DR:
This work points out various issues in the claims of [23] that actually re-open several of the questions left open in [2,13] and provides new lower bounds and concrete constructions that produce a very different state-of-the-art compared to the one claimed in [23].
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
