ppxscal/embedding_network huggingface dataset:
CBR and Argument Schemes for Collaborative Decision Making
Authors: Pancho Tolchinsky, Sanjay Modgil, Ulises Cortés, Miquel Sànchez-Marrè
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

In this paper we present a novel approach for combining Case-Based Reasoning (CBR)Argumentation. This approach involves 1) the use of CBR for evaluating the arguments submitted by agents in collaborative decision making dialogs, and 2) the use of Argument Schemes and Critical Questions to organize the CBR memory space. The former involves use of past cases to resolve conflicts among newly submitted arguments by assigning them a strength, and possibly submitting additional arguments deemed relevant in similar past deliberations. The latter enables use of agents' submitted arguments instantiating Argument Schemes and Critical Questions, to assess the similarity among cases. This use of CBR and argumentation is formulated with the ProCLAIM model, which features a Mediator Agent that directs proponent agents in their deliberation and subsequently evaluates their submitted arguments so as to conclude whether a proposed decision is valid. To motivate and substantiate the practical value of this approach, we illustrate its application in the human organ transplantation field.
Group decompositions, jordan algebras, and algorithms for p-groups
Authors: James B. Wilson
Venue:  (2008)

Finite p-groups are studied using bilinear methods which lead to using nonassociative rings. There are three main results, two which apply only to p-groups and the third which applies to all groups. First, for finite p-groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P: the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of their centers. Unlike for direct product decompositions, Aut P is not always transitive on the set of fully refined central decompositions, and the number of orbits can in fact be any positive integer. The proofs use the standard semi-simple and radical structure of Jordan algebras. These algebras also produce useful criteria for a p-group to be centrally indecomposable. In the second result, an algorithm is given to find a fully refined central decomposition of a finite p-group of class 2. The number of algebraic operations used by the algorithm is bounded by a polynomial in the log of the size of the group. The algorithm uses a Las Vegas probabilistic algorithm to compute the structure of a finite ring and the Las Vegas MeatAxe is also used. However, when p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The final result is a polynomial time algorithm which, given a group of permutations, matrices, or a polycyclic presentation; returns a Remak decomposition of the group: a fully refined direct decomposition. The method uses group varieties to reduce to the case of p-groups of class 2. Bilinear and ring theory methods are employed there to complete the process. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Discovery of functional miRNA-mRNA regulatory modules with computational methods
Authors: Bing Liu, Jiuyong Li, Anna Tsykin
Venue: Journal of Biomedical Informatics (2009)

The identification of miRNAs and their target mRNAs and the construction of their regulatory networks may give new insights into biological procedures. This study proposes a computational method to discover the functional miRNA-mRNA regulatory modules (FMRMs), that is, groups of miRNAs and their target mRNAs that are believed to participate cooperatively in post-transcriptional gene regulation under specific conditions. The proposed method identifies negatively regulated patterns of miRNAs and mRNAs which associate with cancer and normal conditions, respectively, in a prostate cancer data set. GO and the literature also suggest that they may relate with prostate cancer. It can potentially identify the biologically relevant chains of 'miRNA->target gene -> condition'.
Morphisto --An Open Source Morphological Analyzer for German
Authors: Andrea Zielinski, Christian Simon
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

This paper presents the development of an open-source morphology tool for German integrated into a grid-based environment. Departing from the SFST-based SMOR tools (Schmid et al. [1]), we have implemented a minimal lexicon component that works in tandem with the morphological tool. Tests on a list of 30,000 high-frequency German words show that the recognition rate is comparable to other systems with even larger lexicons. Additional tools for the management of lexical data and services built on top of the finite-state transducer are also integrated as web services in the grid, so that all resources can be shared easily among lexicographers, linguists, and finite-state developers.
Defect rate profile in large software-systems
Authors: Elena-Ramona Modroiu, Ina Schieferdecker
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

Software reliability, an issue raised long time ago by software engineering researchers, is still a problem that must be faced nowadays. Our approach is to handle reliability of software products making use of a statistical distribution based model and historical data of similar projects. We analyze the software error metrics of large software projects developed in a multinational company in the last five years, searching for a Rayleigh pattern in the defect rate profile. If we can prove empirically such a pattern exists in certain environment, we have a rapid and powerful theoretical model to support project estimation decisions early in the development life cycle when historical data on similar projects is available.
A Common Framework for Board Games and Argumentation Games
Authors: Jenny Eriksson Lundström, Jørgen Fischer Nilsson, Andreas Hamfelt
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

In this paper we discuss models of formal argumentation games. We argue that the tactics and strategies of board-games like chess provide a useful analogy for adversarial argumentation games. The objective of this study is to elaborate on a common model for board games and argumentation dialogues. In particular we strive at making analogies between tactical and strategic chess game notions and notions in adversarial argumentation games.
Abstraction in model checking multi-agent systems
Authors: Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco Russo
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We present an abstraction technique for multi-agent systems preserving temporal-epistemic specifications. We abstract a multi-agent system, defined in the interpreted systems framework, by collapsing the local states and actions of each agent in the system. We show that the resulting abstract system simulates the concrete system, from which we obtain a preservation theorem: If a temporal-epistemic specification holds on the abstract system, the specification also holds on the concrete one. In principle this permits us to model check the abstract system rather than the concrete one, thereby saving time and space in the verification step. We illustrate the abstraction technique with two examples. The first example, a card game, illustrates the potential savings in the cost of model checking a typical MAS scenario. In the second example, the abstraction technique is used to verify a communication protocol with an arbitrarily large data domain.
New Challenges: Group Decision Systems by Means of Entropy Defined through Qualitative Reasoning Structures
Authors: Llorenç Roselló, Francesc Prats, Mónica Sánchez, Núria Agell
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

This paper introduces the concept of entropy on orders of magnitude qualitative spaces and, consequently, the opportunity to measure the gain or loss of information when working with qualitative descriptions. The results obtained are significant in terms of situations which arise naturally in many real applications when dealing with different levels of precision. A method that enables ambiguous values to be included in analysis and permits summarizing information can be defined. The entropy allows measuring the consensus of expert opinion by use of a distance.
Multi-Carrier Techniques For Broadband Wireless Communications: A Signal Processing Perspectives
Authors: Man-on Pun, Michele Morelli, C. C. Jay Kuo
Venue: Communications And Signal Processing (2007)

Multi-Carrier Techniques for Broadband Wireless Communications provides an accessible introduction to OFDM-based systems from a signal processing perspective. The first part presents a concise treatment of some fundamental concepts related to wireless communications and multicarrier systems, while the second offers a comprehensive survey of recent developments on a variety of critical design issues. These include synchronization techniques, channel estimation methods, adaptive resource allocation and practical schemes for reducing the peak-to-average power ratio of the transmitted waveform. Contents: Fundamentals of OFDM/OFDMA Systems; Time and Frequency Synchronization; Channel Estimation and Equalization; Joint Synchronization, Channel Estimation and Data Symbol Detection in OFDMA Uplink; Dynamic Resource Allocation; Peak-to-Average Power Ratio (PAPR) Reduction.
Summarizing key concepts using citation sentences
Authors: Ariel S. Schwartz, Marti Hearst
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

Citations have great potential to be a valuable resource in mining the bioscience literature (Nakov et al., 2004). The text around citations (or citances) tends to state biological facts with reference to the original papers that discovered them. The cited facts are typically stated in a more concise way in the citing papers than in the original. We hypothesize that in many cases, as time goes by, the citation sentences can more accurately indicate the most important contributions of a paper than its original abstract.
Building community-centric information exploration applications on social content sites
Authors: Sihem Amer-Yahia, Jian Huang, Cong Yu
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Social content sites [4], which integrate traditional content sites with social networking features, have recently emerged as an exciting new trend on the Web. Users on those sites share content and form various communities based on explicit friendship, shared interest and common user properties. Recently, we proposed SOCIALSCOPE, a three-layered architecture to address the information management challenges in social content sites. In this paper, we focus on the information discovery and the information presentation layers, and describe how our previously proposed language, Jelly [3], is supported in SOCIALSCOPE to build community-centric information exploration applications on social content sites.
Property based coverage criterion
Authors: Fadi Zaraket, Wes Masri
Venue: Proceedings of the 2nd International Workshop on Defects in Large Software Systems: Held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009) (2009)

Coverage metrics answer the question of whether we adequately checked a given software artifact. For example, statement coverage metrics measure how many and how often lines of code were executed. Path coverage metrics measure the frequency of execution of interleaving branches of code. In recent years, researchers have introduced several effective static analysis techniques for checking software artifacts. Consequently, more and more developers started embedding properties in code. Also, some techniques and tools emerged that automatically infer system properties where they do not explicitly exist. We hypothesize that it is often more effective to evaluate test suites based on their coverage of system properties than than of structural program elements. In this paper, we present a novel coverage criterion and metrics that evaluate test cases with respect to their coverage of properties, and measure the completeness of the properties themselves.
Spatio---Temporal Track---Before---Detect Algorithm for Interlaced and Progressive Scan Imaging Sensors
Authors: Przemysław Mazurek
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

This paper consider Spatio---Temporal Track---Before---Detect algorithm for tracking of moving objects using interlaced and progressive scan imaging sensors. Using the same image size and pixels' readout rate interlaced and progressive scan approaches are compared. Especially the most important case of dim and pixel size target is analyzed due to spatial sampling theory violation for interlaced sensors applications.
Efficient identity-based GQ multisignatures
Authors: Lein Harn, Jian Ren, Changlu Lin
Venue: International Journal of Information Security (2009)

ISO/IEC 14888 specifies a variety of digital signature mechanisms to sign messages of arbitrary length. These schemes can be applied to provide entity authentication, data origin authentication, non-repudiation, and data integrity verification. ISO/IEC 14888 consists of three parts under the general title Information technology&#x2014;Security techniques&#x2014;Digital signatures. Part II, or ISO/IEC 14888-2 specifies the general structure and the fundamental procedures for the generation and verification of an identity-based signature (IBS) mechanism for messages of arbitrary length. Particularly, the IBS scheme of Guillou and Quisquater (GQ) is described in Clauses 6&#x2013;8. In this paper, an efficient identity-based multisignature (IBMS) scheme is proposed for the GQ IBS scheme, which allows multiple users using the ISO/IEC 14888-2 standard GQ scheme to generate multisignatures. The scheme is efficient in the sense that both the length and the verification time of the multisignatures are fixed. The proposed ID-based multisignature scheme is also secure against forgeability under adaptive chosen-message attack and adaptive chosen-identity attack in random oracle model.
Beyond Electronic Patient's File: Assisting Conversations in a Healthcare Network
Authors: Valérie Benard, Myriam Lewkowicz, Manuel Zacklad
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

Healthcare networks have been created to meet new health requirements. This new mode of organization gives healthcare professionals with different competences overall patient coverage. The aim of this study was to define tools supporting cooperation between these professionals. An ethnographic study on a healthcare network carried out during a period of one year has helped to understand how these networks function and what their requirements are. In this paper, we present the network studied, and describe a theoretical framework which can be used to analyze its activities; we focus in particular on the transactions taking place during face-to-face meetings, and we conclude that in order to cooperate efficiently, professionals need a coordination tool which is more than just an electronic patient file. We end this paper by suggesting guidelines for computer-supported cooperative activities in the field of healthcare networks.
Generating Functional Implementations of Finite State Automata in C# 3.0
Authors: Mihály Biczó, Krisztián Pócza
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Finite state automata (FSA) implementations are widely used in IT due to their rich application possibilities, flexibility, and their direct relationship with common goals set by regular business applications. Workflow-based programming has opened up a new exciting application area: workflows governed by FSA. The field is gaining more and more attention, the .NET 3.0 platform contains an engine called Workflow Foundation dedicated to managing workflows. However, due to the advantageous properties of FSA, it is often desirable to build applications around FSA implementations in simpler cases as well. In this paper an automata generator framework will be presented that makes it possible to use automata whenever possible. What makes this framework highly applicable and very flexible is the fact that the generation process might rely on not only static, but also dynamic information, so it can be performed during runtime as well. From the technical point of view, the interesting part is that the generated implementation is based on lambda expressions, the new functional enhancements of the C# 3.0 language.
An academic kit for integrating mobile devices into the CS curriculum
Authors: Qusay H. Mahmoud, Thanh Ngo, Razieh Niazi, Pawel Popowicz, Robert Sydoryshyn, Matthew Wilks, Dave Dietz
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

In this paper we present our freely available academic kit to help universities in integrating mobile devices into the Computer Science (CS) curriculum. The kit was designed and developed at the Centre for Mobile Education and Research at the University of Guelph, and includes instructors' resources for introducing and teaching mobile application development. The first release of the kit includes the teaching material for a full introductory course on mobile application development, and concrete teaching modules for integrating mobile devices into courses on software engineering, game design and development, web services, information security, and operating systems.
Pervasive services: challenges in context
Authors: Stewart Fallis
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

The Horizon Hub for the new EPSRC Digital Economy programme is looking at how ubiquitous systems will play out in terms of the value chains in society. One area we are interested in is how commercial applications may be built in an ambient transport system- obviously everyone (google) has thought of location-based advertising, although the problems of avoiding privacy invasion are legion (c.f. Phorm). In this talk, I'll think out loud about some crazier ideas one might try out to see what society will tolerate in terms of pervasive and distributed, p2p ad hoc and delay tolerant applications, in terms of perceived or real threats to reliability, privacy and safety. To this end I'll look at two applications - one is a pay-per-vote idea to control traffic lights in ones favour as a driver (or bus passenger). The other is a disease symptom self-report and tracking application, where the problem is how to incentivize people to make the reports (for the benefit of society, but possibly to their own detriment).
A distributed knowledge management infrastructure based on a Topic Map grid
Authors: Axel Korthaus, Markus Aleksy, Stefan Henke
Venue: International Journal of High Performance Computing and Networking (2009)

Modern enterprise knowledge management systems typically require distributed approaches and the integration of numerous heterogeneous sources of information. A powerful foundation for these tasks can be Topic Maps, which not only provide a semantic net-like knowledge representation means and the possibility to use ontologies for modelling knowledge structures, but also offer concepts to link these knowledge structures with unstructured data stored in files, external documents etc. In this paper, we present the architecture and prototypical implementation of a Topic Map application infrastructure, the 'Topic Grid', which enables transparent, node-spanning access to different Topic Maps distributed in a network.
High speed 3D tomography on CPU, GPU, and FPGA
Authors: Nicolas Gac, StéPhane Mancini, Michel Desvignes, Dominique Houzet
Venue: EURASIP Journal on Embedded Systems (2008)

Back-projection (BP) is a costly computational step in tomography image reconstruction such as positron emission tomography (PET). To reduce the computation time, this paper presents a pipelined, prefetch, and parallelized architecture for PET BP (3PA-PET). The key feature of this architecture is its original memory access strategy, masking the high latency of the external memory. Indeed, the pattern of the memory references to the data acquired hinders the processing unit. The memory access bottleneck is overcome by an efficient use of the intrinsic temporal and spatial locality of the BP algorithm. A loop reordering allows an efficient use of general purpose processor's caches, for software implementation, as well as the 3D predictive and adaptive cache (3D-AP cache), when considering hardware implementations. Parallel hardware pipelines are also efficient thanks to a hierarchical 3D-AP cache: each pipeline performs a memory reference in about one clock cycle to reach a computational throughput close to 100%. The 3PA-PET architecture is prototyped on a system on programmable chip (SoPC) to validate the system and to measure its expected performances. Time performances are compared with a desktop PC, a workstation, and a graphic processor unit (GPU).