Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- CAT Game (3)
- Electronic Market (3)
- Mechanism Design (3)
- Aspect-oriented programming (2)
- Quantum computation (2)
-
- Quantum computing (2)
- Quantum information (2)
- Algorithm (1)
- Arabetics; Arabetic Typography; Arabic Typography (1)
- Arabic Script; Arabic Computing; Arabic Type Design; Arabic Fonts; Simplified Arabic; Arabic Calligraphy; Islamic Calligraphy (1)
- Aspect-Oriented programming (1)
- Aspect-oriented software (1)
- AspectJ (1)
- Crosscutting concern (1)
- Decision tree (1)
- Eclipse IDE-based tool (1)
- Formal specification (1)
- Historical bibliography (1)
- Inference algorithms (1)
- Inferencing (1)
- JCAT (1)
- Joining processes (1)
- Lower topology (1)
- Object-oriented programming (1)
- Online resources (1)
- Pointcut expression recovery (1)
- Pointcut maintenance (1)
- Programming profession (1)
- Reasoning (1)
- Refactoring (1)
Articles 1 - 27 of 27
Full-Text Articles in Physical Sciences and Mathematics
An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Peter Mcburney, Simon Parsons
An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Peter Mcburney, Simon Parsons
Publications and Research
This paper presents an analysis of entries in the first TAC Market Design Competition final that compares the entries across several scenarios. The analysis complements previous work analyzing the 2007 competition, demonstrating some vulnerabilities of entries that placed highly in the competition. The paper also suggests a simple strategy that would have performed well.
On The Assessment Of Pointcut Design In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid
On The Assessment Of Pointcut Design In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid
Publications and Research
No abstract provided.
Rejuvenate Pointcut: A Tool For Pointcut Expression Recovery In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Awais Rashid
Rejuvenate Pointcut: A Tool For Pointcut Expression Recovery In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Awais Rashid
Publications and Research
Aspect-oriented programming (AOP) strives to localize the scattered and tangled implementations of crosscutting concerns (CCCs) by allowing developers to declare that certain actions (advice) should be taken at specific points (join points) during the execution of software where a CCC (an aspect) is applicable. However, it is non-trivial to construct optimal pointcut expressions (a collection of join points) that capture the true intentions of the programmer and, upon evolution, maintain these intentions. We demonstrate an AspectJ source-level inferencing tool called rejuvenate pointcut which helps developers maintain pointcut expressions over the lifetime of a software product. A key insight into the …
Keeping Abreast Of Quantum News: Quantum Computing On The Web And In The Literature, Jill Cirasella
Keeping Abreast Of Quantum News: Quantum Computing On The Web And In The Literature, Jill Cirasella
Publications and Research
This appendix describes tools that can help you track developments in quantum computing.
Historical Bibliography Of Quantum Computing, Jill Cirasella
Historical Bibliography Of Quantum Computing, Jill Cirasella
Publications and Research
This bibliographic essay reviews seminal papers in quantum computing. Although quantum computing is a young science, its researchers have already published thousands of noteworthy articles, far too many to list here. Therefore, this appendix is not a comprehensive chronicle of the emergence and evolution of the field but rather a guided tour of some of the papers that spurred, formalized, and furthered its study.
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Publications and Research
Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. In this paper, we present an automated approach which limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. To illustrate that the motivation behind our proposal is well-founded, we first …
Characterizing Effective Auction Mechanisms: Insights From The 2007 Tac Mechanism Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney
Characterizing Effective Auction Mechanisms: Insights From The 2007 Tac Mechanism Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney
Publications and Research
This paper analyzes the entrants to the 2007 TAC Market Design competition. It presents a classification of the entries to the competition, and uses this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.
Jcat: A Platform For The Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney, Thierry Moyaux, Steve Phelps, David Shield
Jcat: A Platform For The Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney, Thierry Moyaux, Steve Phelps, David Shield
Publications and Research
No abstract provided.
Enforcing Behavioral Constraints In Evolving Aspect-Oriented Programs, Raffi T. Khatchadourian, Johan Dovland, Neelam Soundarajan
Enforcing Behavioral Constraints In Evolving Aspect-Oriented Programs, Raffi T. Khatchadourian, Johan Dovland, Neelam Soundarajan
Publications and Research
Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, removed, interchanged, or presently unavailable at unpredictable frequencies. Consequently, modular reasoning of such programs is highly attractive as it enables tractable evolution, otherwise necessitating that the entire program be reexamined each time a component is changed. It is well known, however, that modular reasoning about AO programs is difficult. In this paper, we present our ongoing work in constructing a rely-guarantee style reasoning system for the Aspect-Oriented Programming (AOP) paradigm, adopting a trace-based …
Tr-2008001: Public And Private Communication Are Different: Results On Relative Expressivity, Bryan Renne
Tr-2008001: Public And Private Communication Are Different: Results On Relative Expressivity, Bryan Renne
Computer Science Technical Reports
No abstract provided.
Tr-2008004: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Tr-2008004: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2008006: Additive Preconditioning, Eigenspaces, And The Inverse Iteration, Victor Y. Pan, Xiaodong Yan
Tr-2008006: Additive Preconditioning, Eigenspaces, And The Inverse Iteration, Victor Y. Pan, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2008012: Product-Free Lambek Calculus Is Np-Complete, Yury Savateev
Tr-2008012: Product-Free Lambek Calculus Is Np-Complete, Yury Savateev
Computer Science Technical Reports
No abstract provided.
Tr-2008010: The Logic Of Justification, Sergei Artemov
Tr-2008010: The Logic Of Justification, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2008011: Contrast Transfer Function Correction In Electron Microscopy, Joanna Klukowska
Tr-2008011: Contrast Transfer Function Correction In Electron Microscopy, Joanna Klukowska
Computer Science Technical Reports
No abstract provided.
Tr-2008013: Content-Based 3d Mosaics For Large-Scale Dynamic Urban Scenes, Hao Tang, Zhigang Zhu
Tr-2008013: Content-Based 3d Mosaics For Large-Scale Dynamic Urban Scenes, Hao Tang, Zhigang Zhu
Computer Science Technical Reports
No abstract provided.
Tr-2008014: Why Do We Need Justification Logic?, Sergei Artemov
Tr-2008014: Why Do We Need Justification Logic?, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2008015: An Efficient Heuristic For The Tree Alignment Problem, Andrés Varón, Ward Wheeler, Amotz Bar-Noy
Tr-2008015: An Efficient Heuristic For The Tree Alignment Problem, Andrés Varón, Ward Wheeler, Amotz Bar-Noy
Computer Science Technical Reports
No abstract provided.
Anatomy Of An Arabetic Type Design, Saad D. Abulhab
Anatomy Of An Arabetic Type Design, Saad D. Abulhab
Publications and Research
Arabetic type design, like type design in general, should not be limited by rigid rules, other than those advocating open choice and user options. But as with all design fields, highlighting certain principles and guidelines is crucial to realizing a successful project. In an Arabetic font design environment, such guidelines and principles should reveal deeper understanding of various scripts visual and behavioral defining characteristics rather than mere traditional calligraphic and handwriting norms. A main goal of this study is to emphasize that designing Arabetic fonts is much easier than it is portrayed, and designers of all backgrounds should be more …
Tr-2008002: On Image Reconstruction From A Small Number Of Projections, G. T. Herman, R. Davidi
Tr-2008002: On Image Reconstruction From A Small Number Of Projections, G. T. Herman, R. Davidi
Computer Science Technical Reports
No abstract provided.
Tr-2008003: Unified Nearly Optimal Algorithms For Structured Integer Matrices And Polynomials, Victor Y. Pan, Brian Murphy, Rhys E. Rosholt
Tr-2008003: Unified Nearly Optimal Algorithms For Structured Integer Matrices And Polynomials, Victor Y. Pan, Brian Murphy, Rhys E. Rosholt
Computer Science Technical Reports
No abstract provided.
Tr-2008005: Weakly Random Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Tr-2008005: Weakly Random Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan
Computer Science Technical Reports
No abstract provided.
Tr-2008007: Degeneration Of Structured Integer Matrices Modulo An Integer, Victor Y. Pan, Xinmao Wang
Tr-2008007: Degeneration Of Structured Integer Matrices Modulo An Integer, Victor Y. Pan, Xinmao Wang
Computer Science Technical Reports
No abstract provided.
Tr-2008008: Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, D. Grady, B. Murphy, G. Qian, R. E. Rosholt, A. D. Ruslanov
Tr-2008008: Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, D. Grady, B. Murphy, G. Qian, R. E. Rosholt, A. D. Ruslanov
Computer Science Technical Reports
No abstract provided.
Tr-2008009: Solving Homogeneous Linear Systems With Weakly Randomized Additive Preprocessing, Victor Y. Pan, Guoliang Qian
Tr-2008009: Solving Homogeneous Linear Systems With Weakly Randomized Additive Preprocessing, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Tr-2008016: An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney
Tr-2008016: An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney
Computer Science Technical Reports
No abstract provided.
Topological And Categorical Properties Of Binary Trees, Homeira Pajoohesh
Topological And Categorical Properties Of Binary Trees, Homeira Pajoohesh
Publications and Research
Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements. For two given algorithms A and B where the decision tree of A is more balanced than that of B, it is known that the average and worst case times of A will be better than those of B, i.e., ₸A(n) ≤₸B(n) and TWA (n)≤TWB (n). Thus the most balanced and the most imbalanced binary trees play a main role. Here we consider them as semilattices …