ppxscal/embedding_network huggingface dataset:
An Investigation of Sharing Seller Reputation among Buyers in Agent-Based Markets
Authors: Sandhya Beldona, Costas Tsatsoulis
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Our work investigates the effects of knowledge sharing among buyer agents in an electronic market, where the shared knowledge is the reputation of seller agents. Each buyer agent independently models a seller after having purchased goods from the seller and, upon request, shares this knowledge with friends. We investigated if having a larger number of friends enables buyers to find good quality low priced sellers in the market more rapidly and also if there is a point of diminishing returns, beyond which increasing the number of friends will not have any positive effects. Our results show that, by sharing information with friends, the buyers are able to identify good sellers earlier. However the marginal gain of having more friends decreases as the number of friends increases.
Robust Energy-Efficient Adder Topologies
Authors: Dinesh Patil, Omid Azizi, Mark Horowitz, Ron Ho, Rajesh Ananthraman
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

In this paper we explore the relationship between adder topology and energy efficiency. We compare the energy-delay tradeoff curves of selected 32-bit adder topologies, to determine how architectural features and design techniques affect energy efficiency. Optimizing different adders for the supply and threshold voltages, and transistor sizing, we show that topologies with the least number of logic stages having an average fanin of two per stage, and fewest wires are most energy efficient. While a design with fully custom sizes can be extremely tedious to layout, we show that custom sizing can be used as a guide to group different gates in the design, resulting in a manageable layout overhead without significant loss of energy efficiency.
Estimating functional coverage in bounded model checking
Authors: Daniel Große, Ulrich Kühne, Rolf Drechsler
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all specified properties can be verified, it is difficult to determine whether they cover the complete functional behavior of a design. We propose a pragmatic approach to estimate coverage in BMC. The approach can easily be integrated in a BMC tool with only minor changes. In our approach, a coverage property is generated for each important signal. If the considered properties do not describe the signal's entire behavior, the coverage property fails and a counter-example is generated. From the counter-example an uncovered scenario can be derived. In this way the approach also helps in design understanding. Our method is demonstrated on a RISC CPU. Based on the results we identified coverage gaps. We were able to close all of them and achieved 100% functional coverage.
Formal Z Specifications of Several Flat Role-Based Access Control Models
Authors: Ali E. Abdallah, Etienne J. Khayat
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Role-Based Access Control (RBAC) is a high level authorization mechanism in which access decisions are based on the roles that users hold within an organization. Because RBAC offers scalability, consistency and ease of maintenance, it is very useful, particularly for large organizations. RBAC has been used to describe authorization in a wide variety of applications ranging from operating systems and databases to complex information systems. Despite its widespread adoption, however, there doesn't seem to be a common agreement on the semantics of even key RBAC concepts. For examples, the definitions of fundamental terms such as subject, principal, role, task, and permission have been open to many different and sometimes inconsistent interpretations. This paper attempts to clarify and define essential RBAC concepts. Based on these definitions, a variety of state-based Flat Role Based Access Control models are developed. These models have increasing degrees of complexity and are formulated in the specification notation Z. The starting point is a core RBAC model which, in turn, is successively refined into a series of Flat RBAC models with increasing levels of details. The semantics of each model is captured by giving a precise formulation of its corresponding reference monitor which makes access control decisions.
Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments
Authors: Somesh Jha, Stefan Katzenbeisser, Helmut Veith
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

In the computer gaming industry, large-scale simulations of realistic physical environments over the Internet have at- tained increasing importance. Networked virtual environ- ments (NVES) are typically based on a client-server archi- tecture where part of the simulation workload is delegated to the clients. This architecture renders the simulation vul- nerable to attacks against the semantic integrity of the sim- ulation: malicious clients may attempt to compromise the physical and logical rules governing the simulation, or to alter the causality of events. This paper initiates the sys- tematic study of semantic integrity in NVES from a security point of view. We present a new provably secure semantic integrity protocol which enables the server system to audit the local computations of the clients on demand.
Value and Relation Display: Interactive Visual Exploration of Large Data Sets with Hundreds of Dimensions
Authors: Jing Yang Daniel Hubball Matthew O. Ward, Elke A. Rundensteiner, William Ribarsky
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Few existing visualization systems can handle large data sets with hundreds of dimensions, since high-dimensional data sets cause clutter on the display and large response time in interactive exploration. In this paper, we present a significantly improved multidimensional visualization approach named Value and Relation (VaR) display that allows users to effectively and efficiently explore large data sets with several hundred dimensions. In the VaR display, data values and dimension relationships are explicitly visualized in the same display by using dimension glyphs to explicitly represent values in dimensions and glyph layout to explicitly convey dimension relationships. In particular, pixel-oriented techniques and density-based scatterplots are used to create dimension glyphs to convey values. Multidimensional scaling, Jigsaw map hierarchy visualization techniques, and an animation metaphor named Rainfall are used to convey relationships among dimensions. A rich set of interaction tools has been provided to allow users to interactively detect patterns of interest in the VaR display. A prototype of the VaR display has been fully implemented. The case studies presented in this paper show how the prototype supports interactive exploration of data sets of several hundred dimensions. A user study evaluating the prototype is also reported in this paper.
Assertions for the Tcl language
Authors: Jonathan E. Cook
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Assertions, even as simple as the C assert macro, offer important self-checking properties to programs, and improve the robustness of software when they are used. This paper describes ASSER TCL, an assertion package for the Tcl programming language. Our assertions take the form of commands in the program text, and cover point assertions about the computation state, assertions about procedure input values and the return value, and assertions about the values that variables may take on over their whole lifetime. In addition, universal and existential quantifiers are provided for both lists and arrays, not only for individual elements, but for sequences of elements as well.
Video scouting: an architecture and system for the integration of multimedia information in personal TV applications
Authors: R. S. Jasinschi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Currently available personal video recorders find and store whole TV programs. Our system, Video Scouting, not only finds and stores programs; it automatically segments and indexes story segments from the programs according to viewers' profiles. The extracted descriptions serve the viewers' content information requests for program segment selection, e.g., play the three minute interview with Hillary Clinton. To achieve this, the system combines information from the audio, visual, and transcript domains in a probabilistic framework based on Bayesian networks. We describe the overall architecture, a system implementation, and discuss some experimental results.
Test quality for high level structural test
Authors: A. AI- Yamani, E. J. McCluskey
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Using complex (high-level) gates, such as multiplexers, full adders, etc., for automatic test pattern generation (ATPG) has several advantages. It makes A TPG faster and potentially reduces the size of the test set that needs to be applied. A variety of other techniques are used to reduce the size of test sets for digital chips. They typically rely on preserving the single-stuck-fault coverage of the test set. This paper presents data obtained from applying a variety of test sets on the ELF35 test chip and recording the test escapes. The data presented show the test quality effect of using complex gates as fault sites. The paper also shows the impact of test compaction and reduced fault coverage on the test quality.
Unified Static Scheduling on Various Models
Authors: Liang-Fang Chao, Edwin Hsing-Mean Sha
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Given a behavioral description of an algorithm represented by a data-flow graph, we show how to obtain a rote-optimal static schedule with the minimum unfolding factor under two timing models, integral grid model and fractional grid model, and two design styles for each model, pipelined design and non-piplined design. We present a simple and unified approach to deal with the four possible combinations. A unified polynomial-time scheduling algorithm is presented, which works on the original data-flow graphs without really unfolding. The values of the minimum rate-optimal unfolding factors for all the four combinations are also derived.
CASSIS - Computer-based Academy for Security and Safety in Information Systems
Authors: Gernot Goluch, Andreas Ekelhart, Stefan Fenz, Stefan Jakoubi, Bernhard Riedl, Simon Tjoa
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Information technologies and society are highly interwoven nowadays, but in both, the private and business sector, users are often not aware of security issues or lack proper security skills. The branch of information technology security is growing constantly but attacks against the vocational sector as well as the personal sector still cause great losses each day. Considering that the end-user is the weakest link of the security chain we aim to raise awareness, regarding IT security, and train and educate IT security skills by establishing a European-wide initiative and framework.
Value Driven Security Threat Modeling Based on Attack Path Analysis
Authors: Yue Chen, Barry Boehm, Luke Sheppard
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper presents a quantitative threat modeling method, the Threat Modeling method based on Attack Path Analysis (T-MAP), which quantifies security threats by calculating the total severity weights of relevant Attack Paths for Commercial Off The Shelf (COTS) systems. Compared to existing approaches, TMAP is sensitive to an organization's business value priorities and IT environment. It distills the technical details of thousands of relevant software vulnerabilities into management-friendly numbers at a high-level. T-MAP can help system designers evaluate the security performance of COTS systems and analyze the effectiveness of security practices. In the case study, we demonstrate the steps of using T-MAP to analyze the cost-effectiveness of how system patching and upgrades can improve security. In addition, we introduce a software tool that automates the T-MAP.
The assessment of emission-source contributions to air quality by using a coupled MM5-ARPS-CMAQ modeling system: A case study in the Beijing metropolitan region, China
Authors: Shuiyuan Cheng, Dongsheng Chen, Jianbing Li, Haiyan Wang, Xiurui Guo
Venue: Environmental Modelling Software (2007)

A coupled MM5-ARPS-CMAQ air quality modeling system was applied for investigating the contributions of various emission sources to the ambient concentrations of PM"1"0 in the Beijing metropolitan region of China. A three-level nested simulation domain was established for facilitating the modeling study, and a GIS-based atmospheric pollutant emission database was constructed to provide important emission information for the Models-3/CMAQ model. After verification, the coupled modeling system was implemented to predict the hourly contribution ratios of various PM"1"0 emission sources to Beijing's air quality during four representative months of January, April, August and October in the base year of 2002. It was found from the modeling results that three major sources (including fugitive industrial emissions, construction sites, and road dusts) presented a relatively high contribution to the PM"1"0 pollution in Beijing, with the contribution ratios of 28.67%, 42.88%, 42.46% and 35.67% for spring, summer, autumn and winter, respectively. In addition, the impacts of emissions from two major industrial zones within Beijing on its air quality were quantified. Moreover, the coupled modeling system was applied to explore possible future PM"1"0 concentration distributions in 2008 through two proposed emission sources reduction strategies. It was found that Beijing needs to take continual emission control efforts to comprehensively improve its air quality to the Class II level by 2008. The modeling results could provide sound decision making basis for developing effective air quality management strategies in the planning region.
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Authors: Song Guo, Oliver W. W. Yang
Venue: Computer Communications (2007)

WANET (wireless ad hoc network) is expected to be deployed in a wide range of civil and military applications. The communicating nodes in these networks might be distributed randomly and are assumed to have packet-forwarding capability in order to communicate with each other over a shared and limited radio channel. Building such networks usually poses a significant technical challenge because energy supplied by batteries is likely to be a scarce resource, and in some applications energy is entirely non-renewable. There are mainly two fundamental classes of energy-aware broadcast/multicast problem in recent research: the MEB/MEM (minimum energy broadcast/multicast) problem and the MLB/MLM (maximum lifetime broadcast/multicast) problem in wireless ad hoc networks with omni-directional and directional antennas. In order to provide a better understanding of the research challenges of the energy-aware multicast routing, this article presents a systematical investigation of current state-of-the-art algorithms for these two classes of optimization problems. Taxonomy, comparison, and open research issues for each problem are also discussed, with an objective to inspire new research interests in this field.
Effect of perceived effort saved on user perceptions in a computer-aided decision environment
Authors: Fred D. Davis
Venue:  (2006)

Acceptance of information technology is an important issue. While research has shown that the adoption of new technologies can improve productivity, many people are still reluctant to use new technologies. As technologies such as search engines, expert systems, decision support systems, and others become more pervasive; the importance of understanding which factors contribute to user acceptance becomes increasingly important. This dissertation attempts to introduce a new construct, perceived effort saved (PES), into the technology acceptance literature by examining its effect on three dominant technology acceptance research paradigms: the cost-benefit framework, the user satisfaction model, and the technology acceptance model. The research questions addressed are: (1) How does PES influence the cost-benefit framework? It is hypothesized that PES will increase the user's perception of the accuracy (PACC) of the decision tool. (2) What is the effect of PES on user perceptions of ease of use (EOU) and usefulness (USE)? It is expected that both EOU and USE will be positively influence by PES. (3) Does PES have an effect on perceived accuracy and user satisfaction (SAT)? It is expected that PES will have a direct positive effect on both PACC and SAT. (4) How does PES influence behavioral intention (BI) to adopt a new technology? It is expected that PES with influence BI indirectly through EOU, PACC, SAT, and USE. In order to better explain the role of PES on BI and integrated model is proposed and tested. To examine the above questions two experiments were conducted with student subjects. In the first experiment seventy-eight subjects participated and experiment two involved seventy-one subjects. Linear regression was used to analyze the dataset and results were supportive of the proposed models. For the integrated model the effect of PES on SAT and USE was fully mediated. The theoretical implication of this research is that future research into user satisfaction should incorporate, or control for, perceived effort saved. Practical implications include the need for practitioners to proactively design and implement decision aids to increase the user's perception of the effort they saved by using the tool.
Time series prediction with ensemble models applied to the CATS benchmark
Authors: Jörg D. Wichard, Maciej Ogorzałek
Venue: Neurocomputing (2007)

We describe the use of ensemble methods to build models for time series prediction. Our approach extends the classical ensemble methods for neural networks by using several different model architectures. We further suggest an iterated prediction procedure to select the final ensemble members.
TCP-friendly Congestion Control for HighSpeed Network
Authors: Tomoya Hatano, Hiroshi Shigeno, Ken-ichi Okada
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

The currently used TCP congestion control, TCP Reno, has two weaknesses. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Secondly, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many researches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. This paper proposes a new TCP congestion control algorithm, which is based on the generalized Additive Increase Multiplicative Decrease (AIMD) rules. Our algorithm (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of our proposal by computer simulations and compare it with existing TCP.
Divisibility of generalized Catalan numbers
Authors: Matjaž Konvalinka
Venue: Journal of Combinatorial Theory Series A (2007)

We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its power.
Finite Automata Inspired Model for Dominant Point Detection: A Non-Parametric Approach
Authors: R. Dinesh, D. S. Guru
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this paper a novel non-parametric method of detecting dominant points on a digital curve is proposed. The proposed method estimates the curvature at every point on the curve by computing the reciprocal of the angle made at that point due to the left and right arms of the point. The points that bear local maxima curvature are selected as true dominant points. A novel method for determining a region of support of a point useful for its curvature estimation is also presented. Unlike other methods, the proposed method determines a region of support which is not necessarily symmetric. A finite automaton is devised to determine an adaptive region of support of a point. An extensive experiment has been conducted to reveal the robustness of the proposed method on various shapes with different parameters and is shown to be superior to several other existing methods
On rank-based effectiveness measures and optimization
Authors: Stephen Robertson, Hugo Zaragoza
Venue: Information Retrieval (2007)

Many current retrieval models and scoring functions contain free parameters which need to be set--ideally, optimized. The process of optimization normally involves some training corpus of the usual document-query-relevance judgement type, and some choice of measure that is to be optimized. The paper proposes a way to think about the process of exploring the space of parameter values, and how moving around in this space might be expected to affect different measures. One result, concerning local optima, is demonstrated for a range of rank-based evaluation measures.
Development of on board, highly flexible, Galileo signal generator ASIC
Authors: Louis Baguena, Emmanuel Liégeon, Alexandra Bépoix, Jean-Marc Dusserre, Christophe Oustric, Philippe Bellocq, Vincent Heiries
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Alcatel Alenia Space is deeply involved in the Galileo program at many stages. In particular, Alcatel Alenia Space has successfully designed and delivered the very first navigation signal generator, based on a 0.35&mu;m Atmel ASIC technology, which has been launched in the satellite demonstrator GIOVE-A in December 2005. The Galileo project is now in a second phase including the development of four of the thirty satellites of the final constellation. The new navigation signal generator requires both high performance and high flexibility (various waveforms to cope with the different Galileo services: open, commercial, governmental...) for a very long life time system. Besides, the challenge is increased due to the specific space constraints such as mass, volume and power consumption. These requirements will be achieved through the implementation of a 3 million gates ASIC in a 0.18&mu;m European Radiation Tolerant Atmel technology. This paper will, after a brief description of Galileo system, present the constraints of space environment and technologies challenges. It will then present the ASIC and the development flow of this project, emphasizing the up to date tools that have been used (architectural synthesis, physical synthesis). A conclusion will then be drawn on the requirements on technology and tools for space domain.
Extending the theory of conflict equilibria
Authors: E. R. Smol'Yakov
Venue: Cybernetics and Systems Analysis (2007)

New symmetric coalition conflict equilibria are proposed. Together with already known equilibria, they allow one to find the strongest equilibrium in the majority of static and dynamic conflict problems.