ppxscal/embedding_network huggingface dataset:
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Authors: Guru Venkataramani, Brandyn Roemer, Yan Solihin, Milos Prvulovic
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortunately, existing software and even hardware approaches for finding and identifying memory bugs have considerable performance overheads, target only a narrow class of bugs, are costly to implement, or use computational resources inefficiently. This paper describes MemTracker, a new hardware support mechanism that can be configured to perform different kinds of memory access monitoring tasks. MemTracker associates each word of data in memory with a few bits of state, and uses a programmable state transition table to react to different events that can affect this state. The number of state bits per word, the events to which MemTracker reacts, and the transition table are all fully programmable. MemTracker's rich set of states, events, and transitions can be used to implement different monitoring and debugging checkers with minimal performance overheads, even when frequent state updates are needed. To evaluate MemTracker, we map three different checkers onto it, as well as a checker that combines all three. For the most demanding (combined) checker, we observe performance overheads of only 2.7% on average and 4.8% worst-case on SPEC 2000 applications. Such low overheads allow continuous (always-on) use of MemTracker-enabled checkers even in production runs.
The Basic Fault-tolerant System
Authors: Ernst Schmitter, Peter Baues
Venue: IEEE Micro (1984)

Designed for network applications, this system achieves fault tolerance by exploiting redundancies inherent in standard components.
Selection between proportional and stratified hazards models based on expected log-likelihood
Authors: Benoit Liquet, Jérôme Saracco, Daniel Commenges
Venue: Computational Statistics (2007)

The problem of selecting between semi-parametric and proportional hazards models is considered. We propose to make this choice based on the expectation of the log-likelihood (ELL) which can be estimated by the likelihood cross-validation (LCV) criterion. The criterion is used to choose an estimator in families of semi-parametric estimators defined by the penalized likelihood. A simulation study shows that the ELL criterion performs nearly as well in this problem as the optimal Kullback---Leibler criterion in term of Kullback---Leibler distance and that LCV performs reasonably well. The approach is applied to a model of age-specific risk of dementia as a function of sex and educational level from the data of a large cohort study.
Design of Low Power MAC Operator with Dual Precision Mode
Authors: Young-Geun Lee, Joo-Yul Park, Ki-Seok Chung
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

MAC (multiply and accumulate) operations are heavily involved in many DSP applications. To improve the performance of MAC operations, it is very crucial to make multiplication fast. In this paper, we propose a set of novel MAC operator designs with constant coefficients. It is well-known that shifting can replace a constant multiplication if the constant is a power of 2. We extend this idea in such a way that by employing more than 2 barrel shifters and a supplementary multiplier we can design a very efficient constant multiplier for general constants. To enhance the applicability of our design for a wide range of constants, a support for variable precision computations has been implemented. Experimental results show that our designs achieve consistent enhancement in terms of power consumption when our design is compared with other existing optimized designs.
Design and Deployment of a Remote Robust Sensor Network: Experiences from an Outdoor Water Quality Monitoring Network
Authors: Tuan Le Dinh, Wen Hu, Pavan Sikka, Peter Corke, Leslie Overs, Stephen Brosnan
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper investigates a wireless sensor network deployment--monitoring water quality, e.g. salinity and the level of the underground water table -- in a remote tropical area of northern Australia. Our goal is to collect real time water quality measurements together with the amount of water being pumped out in the area, and investigate the impacts of current irrigation practice on the environments, in particular underground water salination. This is a challenging task featuring wide geographic area coverage (mean transmission range between nodes is more than 800 meters), highly variable radio propagations, high end-to-end packet delivery rate requirements, and hostile deployment environments. We have designed, implemented and deployed a sensor network system, which has been collecting water quality and flow measurements, e.g., water flow rate and water flow ticks for over one month. The preliminary results show that sensor networks are a promising solution to deploying a sustainable irrigation system, e.g., maximizing the amount of water pumped out from an area with minimum impact on water quality.
On Testing Multi-threaded Java Programs
Authors: Xufang Gong, Yanchen Wang, Ying Zhou, Bixin Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

It is in general more dificult to test a concurrent program than a sequential program, as different programming language provide different implementations of concurrency mechanism. For instance, Java language implements concurrency by using multithreads. Therefore, we should have corresponding way to test multithreaded Java programs. In this article, an approach of reachability testing based on extended synchronization sequence is proposed to test Java multithread programs: a kind of Java multi-thread flow diagram is constructed at first, all extended synchronization sequences are computed based on some prefixes secondly, and the deterministic testing is performed based on extended synchronization sequence finally. The validity of the approach is showed by some cases analysis.
Human Factors Experiments in Designing Interactive Systems
Authors: B. Shneiderman
Venue: Computer (1979)

Successful industrial design gracefully unites esthetics and function at minimum cost. However, designers face special problems when they apply their skills to interactive computer systems.
Even straight forward data warehouses are complicated
Authors: Jens Otto Sørensen
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

This panel paper will suggest some areas of research that I think people working in companies with data warehousing and business intelligence would like that the research community gave more attention.
An Algorithm for Learning Principal Curves with Principal Component Analysis and Back-Propagation Network
Authors: Y. H. Wang, Y. Guo, Y. C. Fu, Z. Y. Shen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

A new algorithm for learning principal curves with definite mathematical representations is proposed based on combining the principal component analysis (PCA) and back-propagation (BP) network. The algorithm successfully turns an unsupervised learning problem into a supervised one by projecting a data set to its first component line and identifying the relation between the data points and their corresponding projection indices with BP network. This algorithm has been proved distinctly superior to the HS algorithm. Keywords--Principal component analysis, Back- propagation algorithm, Principal curves
Max-consistency, complement-consistency and the core of fuzzy games
Authors: Yan-An Hwang, Yu-Hsien Liao
Venue: Fuzzy Sets and Systems (2008)

Recently, Hwang introduced two extensions of the max-reduced game to fuzzy games by reducing the number of the players. Based on these reduced games, he offered analogous axiomatizations of the core related to Serrano and Volij in the context of fuzzy games. Here, we continue and develop Hwang's work on similar topics. However, we turn to a different definition of the reduced game by simultaneously reducing both the number of the players and the participation levels. We propose such extensions of the complement-reduced game and of the max-reduced game to fuzzy games and define the related properties of consistency and converse consistency. Based on these properties, we offer several analogous characterizations of the core related to Peleg, Serrano and Volij and Tadenuma, respectively.
Rate-distortion optimized streaming of fine-grained scalable video sequences
Authors: Mohamed Hefeeda, Cheng-Hsin Hsu
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

We present optimal schemes for allocating bits of fine-grained scalable video sequences among multiple senders streaming to a single receiver. This allocation problem is critical in optimizing the perceived quality in peer-to-peer and distributed multi-server streaming environments. Senders in such environments are heterogeneous in their outgoing bandwidth and they hold different portions of the video stream. We first formulate and optimally solve the problem for individual frames, then we generalize to the multiple frame case. Specifically, we formulate the allocation problem as an optimization problem, which is nonlinear in general. We use rate-distortion models in the formulation to achieve the minimum distortion in the rendered video, constrained by the outgoing bandwidth of senders, availability of video data at senders, and incoming bandwidth of receiver. We show how the adopted rate-distortion models transform the nonlinear problem to an integer linear programming (ILP) problem. We then design a simple rounding scheme that transforms the ILP problem to a linear programming (LP) one, which can be solved efficiently using common optimization techniques such as the Simplex method. We prove that our rounding scheme always produces a feasible solution, and the solution is within a negligible margin from the optimal solution. We also propose a new algorithm (FGSAssign) for the single-frame allocation problem that runs in O(nlog n) steps, where n is the number of senders. We prove that FGSAssign is optimal. Furthermore, we propose a heuristic algorithm (mFGSAssign) that produces near-optimal solutions for the multiple-frame case, and runs an order of magnitude faster than the optimal one. Because of its short running time, mFGSAssign can be used in real time. Our experimental study validates our analytical analysis and shows the effectiveness of our allocation algorithms in improving the video quality.
Sequential circuits for program analysis
Authors: Fadi Zaraket, Adnan Aziz, Sarfraz Khurshid
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: loops and recursion are bounded, as is the size of the input instances. The SAT approach has been shown to find subtle bugs with reasonable resources. However, it does not scale well; in particular, it lacks the ability to handle larger bounds. We present SEBAC, which can handle the same class of programs as the SAT approach, and scales to bounds that are orders of magnitude higher. The key difference between SEBAC and SAT techniques is SEBAC's use of imperative Boolean sequential circuits, which are Boolean formulas with memory elements instead of the Boolean formulas which are stateless
A fast band-matching technique for interconnect inductance modeling
Authors: Hong Li, Jitesh Jain, Cheng-Kok Koh, Venkataramanan Balakrishnan
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Sparsification of the inverse of inductance matrix L has been widely used to facilitate the interconnect simulation. The band-matching proposed in [5] was proven to be stable and optimal. However, the technique in [5] exhibits a cubic computation complexity. In this paper, we reveal additional relationship between the entries in band-matching inductance matrices. We propose a fast technique that can calculate the entries in the band-matching approximation, in linear computational time. Experiments show accurate results for proposed method with orders of magnitude improvement in computational time.
3D geological modelling from boreholes, cross-sections and geological maps, application over former natural gas storages in coal mines
Authors: Olivier Kaufmann, Thierry Martin
Venue: Computers Geosciences (2008)

In a wide range of applications involving geological modelling, geological data available at low cost usually consist of documents such as cross-sections or geological maps and punctual data like borehole logs or outcrop descriptions. In order to build accurate 3D geological models based on this information, it is necessary to develop a methodology that takes into account the variety of available data. Such models, of the geometry of geological bodies, should also be easy to edit and update to integrate new data. This kind of model should produce a consistent representation of subsurface geology that may be a support for modelling other subsoil characteristics such as hydrogeologic or geothermic properties of the geological bodies. This paper presents a methodology developed to process geological information in this context. The aims of this methodology are comprehensive data description, effective data validation and easier model updates. Thus, special attention has been given to data structures and processing flows. The adopted methodology is implemented on a system architecture formed by a geographic information system, a geomodeler and a database communicating by file transfers. An application of this methodology, to build a 3D geological model of the subsoil over former coalmines used to store natural gas, is then presented. This model integrates the geological information available and is representative of the geological context. It is a support to the environmental follow-up needed after the end of gas-storage operations.
Description and Prediction of Slashdot Activity
Authors: Andreas Kaltenbrunner, Vicenc Gomez, Vicente Lopez
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

We perform a statistical analysis of user's reaction time to a new discussion thread in online debates on the popular news site Slashdot. First, we show with Kolmogorov- Smirnov tests that a mixture of two log-normal distributions combined with the circadian rhythm of the community is able to explain with surprising accuracy the reaction time of comments within a discussion thread. Second, this characterization allows to predict intermediate and long-term user behavior with acceptable precision. The prediction method is based on activity-prototypes, which consist of a mixture of two log-normal distributions, and represent the average activity in a particular region of the circadian cycle.
Comparing fail-safe microcontroller architectures in light of IEC 61508
Authors: Riccardo Mariani, Peter Fuhrmann
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

In this paper, an overview is given on the main architectures used in the automotive to implement fail-safe microcontrollers. The concept of a new HW-centric, distributed and optimized architecture is also presented. In light of the IEC 61508 norm for safety related electronic systems, a comparisons between these different architectures is done based on a reference design. The paper concludes discussing how the presented architectures can be extended to become fail-functional.
Techniques for Generating the Goal-Directed Motion of Articulated Structures
Authors: J. U. Korein
Venue: IEEE Computer Graphics and Applications (1982)

Analytic and numerical computations used in robotics research provide tools for automated computer animation of the human figure.
Fuzzy set methods for representing commonsense knowledge
Authors: Ronald R. Yager
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Knowledge representation plays a fundamental role in the construction of artificial intelligence for modeling commonsense reasoning. We emphasize the role fuzzy logic can play in extending some of the models of AI. Some basic ideas from the fuzzy set based theory of approximate reasoning are introduced. We then discuss two extensions of the theory of approximate reasoning, possibilistic logic and effectation logic.
Application of Signal Detection for Pipeline Flaw Based on Wavelet Neural Network
Authors: Runjing Zhou, Fei Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Aiming at denoising to detection signal of the flaw in the long transporting pipe, the way of denoising based on wavelet neural network is present, and signal processing of ultrasonic detection application in long Pipeline is described. Making use of self-learning characteristic of wavelet neural network, this way reduces wave loss. This method has the good effect and may acquire exact location and amplitude of the flaw. It is great significance for signal processing of ultrasonic detection.
Generalized solution concepts in games with possibly unaware players
Authors: Leandro C. Rêgo, Joseph Y. Halpern
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work [Halpern and R&ecirc;go 2006], we proposed a framework for representing and analyzing games with possibly unaware players, and suggested a generalization of Nash equilibrium appropriate for games with unaware players that we called generalized Nash equilibrium. Here, we use this framework to analyze other solution concepts, with a focus on sequential equilibrium. We also provide some insight into the notion of generalized Nash equilibrium by proving that it is closely related to the notion of rationalizability when we restrict the analysis to games in normal form and no unawareness is involved.
Managing Enterprise Security Risk with NIST Standards
Authors: Ron Ross
Venue: Computer (2007)

The NIST standards and guidelines were designed to allow for flexible FISMA compliance and implementation.
Migrating a HoneyDepot to Hardware
Authors: Vuka!sin Pejovic, Ivana Kova!cevic, Slobodan Bojanic, Corado Leita, Jelena Popovic, Octavio Nieto-Taladriz
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

A honeypot apparatus, as a perspective security technology has proven itself worth deploying by various malicious records made. The next step in deploying the technology can be an independent hardware device with the incorporated honeypot behaviour. Such a solution would bring an ease in deployment together with a high throughput it would be able to support to the area of network auditing and monitoring. Initial investigation and implementation steps have been conducted. A flexible base for a honeypot platform intended to be implemented on a modern Field Programmable Gate Array device, as a potential destination technology, has been developed. Correspondent results with a relevant set of details are being presented together with future perspectives and further investigation and deployment potential. No similar attempts have been documented.
The impact of perceived risk on the capital market's reaction to outsourcing announcements
Authors: Heiko Gewald, Tom Gellrich
Venue: Information Technology and Management (2007)

Outsourcing is a widely accepted option in strategic management, which, like every business venture, bears opportunities and risks. Supplementing the popular area of research on the merits of outsourcing, this paper examines how stockholders rate corporate sourcing decisions with regard to the risk they associate with this transaction. Using event study methodology and multivariate cross-sectional OLS-regression, we analyze a sample of 182 outsourcing transactions in the global financial services industry between 1998 and 2004 in order to investigate the risk-specific drivers of excess returns to shareholders. The analysis studies the impact of risk-specific independent variables, including transaction size, length, outsourced business functionality, and experience with outsourcing. Our findings indicate that risk-mitigating strategies have significant explanatory power, indicating that the capital market's reaction to an outsourcing announcement might at least partly be forecast. Results show a positive correlation between market reaction and business process outsourcing by financial services companies. We also find strong evidence indicating that capital markets react positively to relatively large transactions compared to the market capitalization of the outsourcing firm. For service providers our results show that traditional IT-related sourcing projects or the insourcing of administrative processes have a significant positive correlation with market reaction.
Energy efficient multicast routing in ad hoc wireless networks
Authors: Deying Li, Qin Liu, Xiaodong Hu, Xiaohua Jia
Venue: Computer Communications (2007)

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is minimized. We first prove this problem is NP-hard and it is unlikely to have an approximation algorithm with a constant performance ratio of the number of nodes in the network. We then propose an algorithm based on the directed Steiner tree method that has a theoretically guaranteed approximation performance ratio. We also propose two efficient heuristics, node-join-tree (NJT) and tree-join-tree (TJT) algorithms. The NJT algorithm can be easily implemented in a distributed fashion. Extensive simulations have been conducted to compare with other methods and the results have shown significant improvement on energy efficiency of the proposed algorithms.
Packet-switched network selection with the highest QoS in 4G networks
Authors: Dimitris Charilas, Ourania Markaki, Dimitris Nikitopoulos, Michael Theologou
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The evolution of telecommunications during the last decades has been enormous and as a result, nowadays, people find themselves before the challenge of 4G networks. Due to the fact that the latter constitute an environment of heterogeneous networks, their integration in terms of the Quality of Service (QoS) offered is of crucial importance. In general, the topic of this paper is to integrate the parameters that define QoS. Specifically, the main scope of this paper is the development of a process to evaluate three packet-switched networks (UMTS, WLAN and GPRS) in reference to the QoS offered and finally, the selection of the network that offers the highest standard for QoS. In order to achieve the above goal, there has been an attempt to distinguish the most important QoS indicators that characterize packet-switched networks and a few processes have been developed in order to either estimate the contribution of each parameter to the total QoS, or identify the weak points of a network. Apparently, each of these processes approaches the term of QoS in a different way and gives results of different usefulness.