ppxscal/embedding_network huggingface dataset:
High-bandwidth Address Generation Unit
Authors: Carlo Galuzzi, Chunyang Gou, Humberto Calderón, Georgi N. Gaydadjiev, Stamatis Vassiliadis
Venue: Journal of Signal Processing Systems (2009)

In this paper we present an efficient data fetch circuitry to retrieve several operands from a n-way parallel memory system in a single machine cycle. The proposed address generation unit operates with an improved version of the low-order parallel memory access approach. Our design supports data structures of arbitrary lengths and different odd strides. The experimental results show that our address generation unit is capable of generating eight 32¿¿¿bit addresses every 6 ns for different strides when implemented on a VIRTEX-II PRO xc2vp30-7ff1696 FPGA device using only trivial hardware resources.
Accelarated Publication: Analytical model for the high-temperature behaviour of the subthreshold slope in MuGFETs
Authors: Chi-Woo Lee, Dimitri Lederer, Aryan Afzalian, Ran Yan, Nima Dehdashti Akhavan, Jean-Pierre Colinge
Venue: Microelectronic Engineering (2009)

As MuGFETs are promising contenders for the end of the silicon Roadmap, their high-temperature behaviour needs to be addressed. In this work we investigate the variations of the subthreshold slope (SS) of double-gate devices and MuGFETs with intrinsic doping as a function of the temperature and fin width. Focus is placed on the superlinear behaviour of SS occurring above a certain temperature threshold. Numerical simulations are performed using Comsol Multiphysics^(TM) and a 1D analytical model is developed. The model, which includes the effect of film and gate oxide thickness, is shown to accurately fit the numerical data. A new definition for the subthreshold slope under high-temperature operation is proposed. The high-temperature subthreshold slope degradation is shown to increase with fin width.
Array P Systems and t.Communication
Authors: K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern
Venue: Fundamenta Informaticae (2009)

The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication mode called t-mode of cooperating distributed grammar systems. On the other hand cooperating array grammar systems [5] and array P systems [1] have been developed in the context of two-dimensional picture description. In this paper, motivated by the study of [4], these two systems are studied by linking them through the t-communication mode, thus bringing out the picture description power of these systems.
Designing an expert system for fraud detection in private telecommunications networks
Authors: Constantinos S. Hilas
Venue: Expert Systems with Applications: An International Journal (2009)

Telecommunications fraud not only burdens telecom provider's accountings but burdens individual users as well. The latter are particularly affected in the case of superimposed fraud where the fraudster uses a legitimate user's account in parallel with the user. These cases are usually identified after user complaints for excess billing. However, inside the network of a large firm or organization, superimposed fraud may go undetected for some time. The present paper deals with the detection of fraudulent telecom activity inside large organizations' premises. Focus is given on superimposed fraud detection. The problem is attacked via the construction of an expert system which incorporates both the network administrator's expert knowledge and knowledge derived from the application of data mining techniques on real world data.
An induction principle for nested datatypes in intensional type theory
Authors: Ralph Matthes
Venue: Journal of Functional Programming (2009)

Nested datatypes are families of datatypes that are indexed over all types such that the constructors may relate different family members (unlike the homogeneous lists). Moreover, the argument types of the constructors refer to indices given by expressions in which the family name may occur. Especially in this case of true nesting, termination of functions that traverse these data structures is far from being obvious. A joint paper with A. Abel and T. Uustalu (Theor. Comput. Sci., 333 (1–2), 2005, pp. 3–66) proposed iteration schemes that guarantee termination not by structural requirements but just by polymorphic typing. They are generic in the sense that no specific syntactic form of the underlying datatype “functor” is required. However, there was no induction principle for the verification of the programs thus obtained, although they are well known in the usual model of initial algebras on endofunctor categories. The new contribution is a representation of nested datatypes in intensional type theory (more specifically, in the calculus of inductive constructions) that is still generic and covers true nesting, guarantees termination of all expressible programs, and has an induction principle that allows to prove functoriality of monotonicity witnesses (maps for nested datatypes) and naturality properties of iteratively defined polymorphic functions.
Theoretical and Computational Properties of Preference-based Argumentation
Authors: Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of incorporating preferences or priorities in argumentation. However, relatively little is known about the theoretical and computational implications of preferences in argumentation. In this paper we introduce and study an abstract preference-based argumentation framework that extends Dung's formalism by imposing a preference relation over the arguments. Under some reasonable assumptions about the preference relation, we show that the new framework enjoys desirable properties, such as coherence. We also present theoretical results that shed some light on the role that preferences play in argumentation. Moreover, we show that although some reasoning problems are intractable in the new framework, it appears that the preference relation has a positive impact on the complexity of reasoning.
Encyclopedia of Internet Technologies and Applications
Authors: Mario Freire, Mario Freire, Manuela Pereira
Venue:  (2007)

The Encyclopedia of Internet Technologies and Applications discusses the extraordinary importance of Internet technologies, with a particular focus on the Web. Discussing the architecture and service technologies of the World Wide Web, the Encyclopedia of Internet Technologies and Applications includes comprehensive research on Web services, Semantic Web, and Web-based e-activities, among others. This reference tool is the single source for information on the world s greatest network, and provides a wealth of information for the average Internet consumer, as well as for an expert in the field of networking and Internet technologies. This comprehensive reference provides libraries with the most thorough examination of Internet technologies and applications an essential resource in supporting the information needs of researchers in a variety of related fields.
Formal analysis of firewall policies
Authors: Robert Mathias Marmorstein
Venue:  (2008)

This dissertation describes a technique for formally analyzing a firewall security policy using a quasi-reduced multiway decision diagram model. The analysis allows a system administrator to detect and repair errors in the configuration of the firewall without a tedious manual inspection of the firewall rules. We present four major contributions. First, we describe a set of algorithms for representing a firewall rule set as a multi-way decision diagram and for solving logical queries against that model. We demonstrate the application of these techniques in a tool for analyzing iptables firewalls. Second, we present an extension of our work that enables analysis of systems of connected firewalls and firewalls that use network address translation and other packet mangling rules. Third, we demonstrate a technique for decomposing a network into classes of equivalent hosts. These classes can be used to detect errors in a firewall policy without apriori knowledge of potential vulnerabilities. They can also be used with other firewall testing techniques to ensure comprehensive coverage of the test space. Fourth, we discuss a strategy for partially automating repair of the firewall policy through the use of counterexamples and rule history. Using these techniques, a system administrator can detect and repair common firewall errors, such as typos, out-of-order rules, and shadowed rules. She can also develop a specification of the behaviors of the firewall and validate the firewall policy against that specification.
Agent Strategy Generation by Rule Induction in Predator-Prey Problem
Authors: Bartłomiej Śnieżyński
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

This paper contains a proposal of application of rule induction for generating agent strategy. This method of learning is tested on a predator-prey domain, in which predator agents learn how to capture preys. We assume that proposed learning mechanism will be beneficial in all domains, in which agents can determine direct results of their actions. Experimental results show that the learning process is fast. Multi-agent communication aspect is also taken into account. We can show that in specific conditions transferring learned rules gives profits to the learning agents.
Contributing vertices-based Minkowski sum computation of convex polyhedra
Authors: Hichem Barki, Florence Denis, Florent Dupont
Venue: Computer-Aided Design (2009)

Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Vertices-based Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of the Minkowski sum polyhedron only by examining the contributing vertices-a concept we introduce in this work, for each input facet. We exploit the concept of contributing vertices to propose the Enhanced and Simplified Slope Diagram-based Minkowski Sum (ESSDMS) algorithm, a slope diagram-based Minkowski sum algorithm sharing some common points with the approach proposed by Wu et al. [Wu Y, Shah J, Davidson J. Improvements to algorithms for computing the Minkowski sum of 3-polytopes. Comput Aided Des. 2003; 35(13): 1181-92]. The ESSDMS algorithm does not embed input polyhedra on the unit sphere and does not need to perform stereographic projections. Moreover, the use of contributing vertices brings up more simplifications and improves the overall performance. The implementations for the mentioned algorithms are straightforward, use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library. More examples and results of the CVMS algorithm for several convex polyhedra can be found at http://liris.cnrs.fr/hichem.barki/mksum/CVMS-convex.
Automated norm synthesis in an agent-based planning environment
Authors: George Christelis, Michael Rovatsos
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Norms and social laws are one of the key mechanisms used to facilitate coordination in multiagent systems. In existing approaches the process of designing useful norms has to either be performed by a human expert, or requires a full enumeration of the state space which is bound to cause tractability problems in non-trivial domains. In this paper we propose a novel automated synthesis procedure for prohibitive norms in planning-based domains that disallow access to a set of predefined undesirable states. Our method performs local search around declarative specifications of states using AI planning methods. Using this approach, norms can be synthesised in a generalised way over incomplete state specifications to improve the efficiency of the process in many practical cases, while producing concise, generalised, social norms that are applicable to entire sets of system states. We present an algorithm that utilises traditional planning techniques to ensure continued accessibility under the prohibitions introduced by norms. An analysis of the computational properties of our algorithm is presented together with a discussion of possible heuristic improvements.
Design of experiments as a means of lean value delivery to the flight test enterprise
Authors: Aaron A. Tucker, Cihan H. Dagli
Venue: Systems Engineering (2009)

Modern flight test tends to be a complex, expensive undertaking, so any increases in efficiency would result in considerable savings. Lean thinking is an effective method to identify value and eliminate waste and is particularly effective when applied to the entire flight test enterprise. Design of experiments is a statistical methodology that results in highly efficient flight test where only the samples needed are collected and analyzed. The application of design of experiments to flight test's value stream can result in a significant increase in lean value to the stakeholders and a reduction of waste. Design of experiments uses objective, verifiable statistical analysis to plan, execute, and analyze test. With lean stakeholder input, design of experiment's planning process ensures that the variables of interest are measured to provide a specified confidence in the analysis. Statistical confidence provides critical information on both the magnitude and significance of system performance. Further, design of experiments provides a statistical power that tells the stakeholders what magnitude of the effect could have been detected. Another benefit is that system response models are continually generated as test matrices are executed. These models enable the stakeholders to understand and evaluate system performance. This increases test safety and flexibility, which also creates value and eliminates waste in a resource-limited experiment. A conceptual model is developed which shows how the design of experiments aligns the flight test process along the lean value delivery stream and identifies the stakeholders at each step. &copy; 2009 Wiley Periodicals Inc. Syst Eng This is a US Government work and, as such, is in the public domain in the United States of America.
A Study on the Effects of Online Brand Community Identity on the Characteristics of Community Activity and Behavioral Responses
Authors: Hyung-Shik Jung, Youngshim Kim, Yu-Rim Kook
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

The present study investigated the effects of online brand community identity on the characteristics of community activity and behavioral responses. Based on empirical research using questionnaires with 117 consumers who were participating in an online brand community, the study found the following results: First, online brand community identity affected normative community pressure and community bond, and the normative community pressure had a negative effect on the user's intention to maintain participation in the community. Second, online brand community bond did not have a statically significant effect on normative community pressure. Lastly, online brand community bond affected community commitment, which, in turn, affected the user's intention to maintain participation, collaborative brand production, and brand word-of-mouth activities. The results of the study shed light on the importance of exerting efforts to manage consumer relationships through online brand community, particularly for the industry where online brand community leads to brand purchasing behavioral responses of their consumer.
Mood Recognition during Online Self-Assessment Tests
Authors: Christos N. Moridis, Anastasios A. Economides
Venue: IEEE Transactions on Learning Technologies (2009)

Individual emotions play a crucial role during any learning interaction. Identifying a student&#x2019;s emotional state and providing personalized feedback, based on integrated pedagogical models, has been considered to be one of the main limits of traditional tools of e-learning. This paper presents an empirical study that illustrates how learner mood may be predicted during online self-assessment tests. Here a previous method of determining student mood has been refined based on the assumption that the influence on learner mood of questions already answered declines in relation to their distance from the current question. Moreover, this paper sets out to indicate that &#x201C;exponential logic&#x201D; may help produce more efficient models, if integrated adequately with affective modelling. The results show that these assumptions may prove useful to future research.
KidCam: Toward an Effective Technology for the Capture of Children's Moments of Interest
Authors: Julie A. Kientz, Gregory D. Abowd
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

Mobile applications of automated capture present many interesting design challenges, balancing the desire for rich media against ease of use and availability. In particular, capturing rich media of young children has many potential benefits, but remains a difficult challenge due to the many unique constraints of recording children. Motivated by the aim of supporting a parent's need to record the life events of a young child, we have designed KidCam, a prototype rich media capture device. This paper presents the design, implementation, and evaluation of KidCam and its goal of addressing some of the challenges of recording young children. Results from a three-month study with four families show that KidCam addresses some of the challenges of recording rich media of children, but there are still remaining hurdles. We discuss these remaining challenges, potential ideas for how they could be addressed, and emergent uses for KidCam beyond the initial domain for the creation of family memories.
C-K design theory for information systems research
Authors: Jan Ondrus, Yves Pigneur
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

Design science is slowly but surely establishing itself as a recognized paradigm for conducting research in information systems. Researchers in the IS field have tried to study different aspects of design science. So far, it seems that the design activity, or "design reasoning" has not received much attention from the IS community. In this paper, we propose to use a theory developed in engineering fields in order to solve this issue. The C-K theory, or Concept-Knowledge theory, is considered to be a good candidate to deal with the design reasoning.
An architecture for Grid-enabled distributed simulation
Authors: Ming Jiang, Georgios Theodoropoulos, Rachid Anane
Venue: International Journal of High Performance Computing and Networking (2009)

The application of distributed simulation techniques to ever more complex problems calls for more computational power. The emergence of the Grid provides an opportunity to address this challenge and thus make advances in the modelling and analysis of large-scale systems by harnessing the power of many computers. These requirements are met by the design and development of frameworks that support the integration of appropriate Distributed Simulation Kernels (DSK) and Grid middleware. This paper presents a framework and a prototype implementation for specifying and executing distributed simulations over the Grid. The framework incorporates a well established DSK with the Globus middleware.
Effective bidding and deal identification for negotiations in highly nonlinear scenarios
Authors: Ivan Marsa-Maestre, Miguel A. Lopez-Carmona, Juan R. Velasco, Enrique de la Hoz
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Most real-world negotiation scenarios involve multiple, inter-dependent issues. These scenarios are specially challenging because the agents' utility functions are nonlinear, which makes traditional negotiation mechanisms not applicable. Even mechanisms designed and proven useful for nonlinear utility spaces may fail if the utility space is highly nonlinear. For example, simulated annealing has been used successfully in bidding based negotiations with constraint-based utility spaces to identify high utility regions in the contract space, and to send these regions as bids to a mediator. In this paper, we will show that the performance of this approach decreases drastically in highly nonlinear scenarios, and propose alternative mechanisms for the bidding process which take advantage of the constraint-based preference model. Also, we propose a probabilistic search method for the mediator to improve the scalability of the deal identification process, and an iterative, expressive negotiation protocol to give feed-back to the agents in case no deals have been found with the initial bids. The experiments show that the proposed mechanisms yield better results than the previous approach in highly nonlinear negotiation scenarios.
Policy control framework for IP Multimedia Subsystem
Authors: Nidal Nasser, Ming Shang
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

In this paper, we propose a subscription-based policy control framework that implements a subscription-centered approach for policy control for IP Multimedia Subsystem (IMS), defined by 3rd Generation Partnership Project (3GPP), Release 7. The framework also enables flexible policy definitions based on the subscriber's profile at the application level. In addition, the framework provides functionalities of organizing the subscription data, identifying the policy, stipulating the policy control process, interpreting, managing and enforcing the corresponding policies. The main objective of this framework is to qualify the subscribers and thus, enhance the network customization reflected by the capabilities of defining various flexible policies based on different subscriber policy control requirements.
A Pattern for Modeling Rework in Software Development Processes
Authors: Aaron G. Cass, Leon J. Osterweil, Alexander Wise
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

It is usual for work completed at one point in a software development process to be revisited, or reworked, at a later point. Such rework is informally understood, but if we hope to support reasoning about, and partial automation of, software development processes, rework be more formally understood. In our experience in designing formalized processes in software development and other domains, we have noticed a recurring process pattern that can be used to model rework quite successfully. This paper presents that pattern, which models rework as procedure invocation in a context that is carefully constructed and managed. We present some scenarios drawn from software engineering in which rework occurs. The paper presents rigorously defined models of these scenarios, and demonstrates the applicability of the pattern in constructing these models.
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Authors: María Cristina Riff, Xavier Bonnaire, Bertrand Neveu
Venue: Engineering Applications of Artificial Intelligence (2009)

In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area.