ppxscal/embedding_network huggingface dataset:
Dealing with Stable Environmental Conditions in XACML Systems
Authors: Romain Laborde, Thierry Desprats
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

XACML (eXtensible Access Control Markup Language) is an XML-based language for access control that has been standardized in OASIS. In this language, any entities involved in access control (i.e. users, resources, actions and environment) are specified by a set of attributes. This specification also includes the description of an architecture that explains how the policy decision point (PDP) retrieves the needed attributes values when it evaluates the policy to take its authorization decision. In this paper, we show this approach for getting the attributes values is a bottleneck to the performance of the authorization decision-making-process for attributes whose process for retrieving the value is long and the changing of its value doesn't impact the policy frequently. Thus, we propose an improvement of the XACML architecture in order to accelerate the decision-making-process when PDP has to treat such kind of attributes.
A Multimicrocomputer-based Structure for Computer Networking
Authors: Alberto Faro, Orazio Mirabella, Lorenzo Vita
Venue: IEEE Micro (1985)

This multiboard, Z80-based, X.25 DTE device achieves high data communications performance through a well-integrated hardware/software architecture.
Combo
Authors: Reinhard Engels, Tamara Yu, Chris Burge, Jill P. Mesirov, David DeCaprio, James E. Galagan
Venue: Bioinformatics (2006)

Summary: Combo is a comparative genome browser that provides a dynamic view of whole genome alignments along with their associated annotations. Combo provides two different visualization perspectives. The perpendicular (dot plot) view provides a dot plot of genome alignments synchronized with a display of genome annotations along each axis. The parallel view displays two genome annotations horizontally, synchronized through a panel displaying local alignments as trapezoids. Users can zoom to any resolution, from whole chromosomes to individual bases. They can select, highlight and view detailed information from specific alignments and annotations. Combo is an organism agnostic and can import data from a variety of file formats. Availability: Combo is integrated as part of the Argo Genome Browser which also provides single-genome browsing and editing capabilities. Argo is written in Java, runs on multiple platforms and is freely available for download at. Contact: reinhard@broad.mit.edu
Understanding dependable computing concepts
Authors: Goutam Kumar Saha
Venue: Ubiquity (2007)

This work aims to visually describe the important concepts of a dependable computing system and the relationships between the concepts. The concept map here for dependable computing system concepts would help us for easier and meaningful understanding of this emerging important research topic of computer science and engineering. Readers here won't feel tired of reading long text horizontally lines after lines for conceptualizing this much research and interesting topic.
Eigentransport for efficient and accurate all-frequency relighting
Authors: Derek Nowrouzezahrai, Patricio Simari, Evangelos Kalogerakis, Eugene Fiume
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present a method for creating a geometry-dependent basis for diffuse precomputed radiance transfer. Unlike previous PRT bases, ours is derived from Principal Component Analysis of the sampled transport functions at each vertex, without relying on pre-projections to secondary bases, such as the Spherical Harmonics or Haar wavelets. It allows for efficient evaluation of shading, has low memory requirements and produces accurate results with few coefficients. We are able to capture all-frequency effects from both distant and near-field dynamic lighting in real-time and present a simple and efficient rotation scheme. Reconstruction of the final shading becomes a low-order dot product and is performed on the GPU.
A quadratic modeling-based framework for accurate statistical timing analysis considering correlations
Authors: Vishal Khandelwal, Ankur Srivastava
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The impact of parameter variations on timing due to process variations has become significant in recent years. In this paper, we present a statistical timing analysis (STA) framework with quadratic gate delay models that also captures spatial correlations. Our technique does not make any assumption about the distribution of the parameter variations, gate delays, and arrival times. We propose a Taylor-series expansion-based quadratic representation of gate delays and arrival times which are able to effectively capture the nonlinear dependencies that arise due to increasing parameter variations. In order to reduce the computational complexity introduced due to quadratic modeling during STA, we also propose an efficient linear modeling driven quadratic STA scheme. We ran two sets of experiments assuming the global parameters to have uniform and Gaussian distributions, respectively. On an average, the quadratic STA scheme had 20.5 × speedup in runtime as compared to Monte Carlo simulations with an rms error of 0.00135 units between the two timing cummulative density functions (CDFs). The linear modeling driven quadratic STA scheme had 51.5 × speedup in runtime as compared to Monte Carlo simulations with an rms error of 0.0015 units between the two CDFs. Our proposed technique is generic and can be applied to arbitrary variations in the underlying parameters under any spatial correlation model.
Time Series Prediction Based on Linear Regression and SVR
Authors: Kunhui Lin, Qiang Lin, Changle Zhou, Junfeng Yao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The application of SVR in the time series prediction is increasingly popular. Because some time series prediction based on SVR wasn't very nice in the efficiency of the forecast, this article presents a new regression based on linear regression and SVR. The new regression separates time series into linear part and nonlinear part, then predicts the two parts respectively, and finally integrates the two parts to forecast. Experiments show that the new regression advances the precision of the forecasting compared to the common SVR.
Tamper detection in audit logs
Authors: Richard T. Snodgrass, Shilong Stanley Yao, Christian Collberg
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Audit logs are considered good practice for business systems, and are required by federal regulations for secure systems, drug approval data, medical information disclosure, financial records, and electronic voting. Given the central role of audit logs, it is critical that they are correct and inalterable. It is not sufficient to say, "our data is correct, because we store all interactions in a separate audit log." The integrity of the audit log itself must also be guaranteed. This paper proposes mechanisms within a database management system (DBMS), based on cryptographically strong one-way hash functions, that prevent an intruder, including an auditor or an employee or even an unknown bug within the DBMS itself, from silently corrupting the audit log. We propose that the DBMS store additional information in the database to enable a separate audit log validator to examine the database along with this extra information and state conclusively whether the audit log has been compromised. We show with an implementation on a high-performance storage engine that the overhead for auditing is low and that the validator can efficiently and correctly determine if the audit log has been compromised.
Experiments with a Density Router for PC Cards
Authors: P. Agrawal
Venue: IEEE Transactions on Computers (1979)

In this correspondence a new routing cost function is defined which is a function of local blockage density in addition to path length. A parameter a specifies the degree to which density is to influence the cost. The use of such a cost function results in what we refer to as a density router. The classical Lee router is a special case of the density router with a equal to 0. We present four performance measures (two of which are based on the density of blockages) for comparing the performance of the classical Lee router with that of the density router. It is experimentally determined that a value of a of about 1.25 optimizes our cost function for the density router when evaluated according to each of the four performance measures and for the board model assumed.
Call routing management in enterprise VoIP networks
Authors: Kunwadee Sripanidkulchai, Zon-Yin Shae, Debanjan Saha
Venue: Proceedings of the 2007 SIGCOMM workshop on Internet network management (2007)

Voice over IP (VoIP) usage is growing at an astronomical rate, resulting in large infrastructures that are becoming increasingly challenging to manage. In this paper, we focus on the management of call routing which determines how calls are routed inside a VoIP infrastructure, particularly for large multi-site infrastructures such as enterprise networks. Call routing can be complex because of several contributing factors. First, each site may independently manage and implement their own call routing policies. Second, a wide range of policies such as minimal cost or maximum performance may be in use. Existing call routing tools help with configuring or installing the policies but do not provide a means to understand or verify the policies that have been configured. In this paper, we present an analysis and visualization tool to manage call routing policies by providing a consolidated view that facilitates reasoning about the routing policies that are in use in the system.
Model checking concurrent linux device drivers
Authors: Thomas Witkowski, Nicolas Blanc, Daniel Kroening, Georg Weissenbacher
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

The S<scp>lam</scp> toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device drivers. Our predicate abstraction-based tool DDV<scp>erify</scp>enables the automated verification of Linux device drivers and provides an accurate model of the relevant parts of the kernel. We report on benchmarks based on Linux device drivers, confirming the results that S<scp>lam</scp> established for the Windows world. Furthermore, we take predicate abstraction one step further and introduce a technique to verify concurrent software with shared memory
Enhancing design robustness with reliability-aware resynthesis and logic simulation
Authors: Smita Krishnaswamy, Stephen M. Plaza, Igor L. Markov, John P. Hayes
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

While circuit density and power efficiency increase with each major advance in IC technology, reliability with respect to soft errors tends to decrease. Current solutions to this problem such as TMR require high area and power overhead. In this work, soft-error reliability is improved with minimal area overhead by careful, localized circuit restructuring. The key idea is to increase logic masking of errors by taking advantage of conditions already present in the circuit, such as observability don't-cares. We describe two circuit modification techniques to improve reliability: don't-care-based resynthesis and local rewriting. A key feature of these techniques is fast, on-the-fly estimation of soft error rate (SER) using our reliability evaluator AnSER. This tool is compared against prior SER evaluators and found to run orders of magnitude faster. We show empirically that our reliability-driven synthesis methods can reduce SER by 29--40% with only 5--13% area overhead.
QoS-based dissemination of content in Grids
Authors: Agostino Forestiero, Carlo Mastroianni, Giandomenico Spezzano
Venue: Future Generation Computer Systems (2008)

This paper proposes a bio-inspired approach tailored to the construction of a Grid information system in which content, specifically metadata descriptors that specify the characteristics of Grid resources, is disseminated and logically reorganized on the Grid. Content management is achieved through the collective activity of a large number of ant-like agents, which perform simple operations at the local level, but together engender an advanced form of ''swarm intelligence'' at the global level. Agents travel the Grid through P2P interconnections and use probability functions to (i) replicate resource descriptors and (ii) collect similar descriptors in nearby Grid hosts. Simulation analysis shows that the proposed ARMAP protocol (Ant-based Replication and MApping Protocol) is capable of reducing the entropy of the system and efficiently propagating content. Furthermore, ARMAP allows to enforce the dissemination of descriptors related to high Quality of Service (QoS) resources. The Grid information system built with the proposed protocol enables the use of a semi-informed discovery algorithm which drives query messages towards ''representative peers'' that maintain information about high QoS resources having the required characteristics.
Hardware-Based Multicast with Global Load Balance on k-ary n-trees
Authors: Quanbao Sun, Minxuan Zhang, Liquan Xiao
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The multicast operation is used commonly in parallel applications and can be used to support several other collective communication operations. A significant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose two parent selecting strategies which use global information to reduce the conflict among different multicast operations on k-ary n-trees. We first define an equivalence relation to divide the switches at each stage into several equivalence classes. Then we prove that the switches, which are at the same stage and are passed through by the same multicast tree, belong to the same equivalence class. Based on the study, two least loaded parent selecting strategies are developed. The proposed strategies are evaluated through simulation experiments. The results indicate that the proposed strategies lower the multicast latency and increase the multicast throughput significantly.
Preemption Control for Energy-Efficient Task Scheduling in Systems with a DVS Processor and Non-DVS Devices
Authors: Chuan-Yue Yang, Jian-Jia Chen, Tei-Wei Kuo
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In reality, peripheral devices often make a significant contribution to the power consumption of the entire system. An effective energy-efficient scheduling algorithm should consider not only the energy consumption of the processor but also the usages of devices. In this paper, we explore energyefficient scheduling of periodic real-time tasks in a system with a dynamic-voltage-scaling (DVS) processor and multiple non- DVS system devices. We consider systems that any device used by a task remains operating while the task is active. We propose scheduling algorithms in the management of task preemption to reduce the energy consumption of devices. Simulation results show that our proposed algorithms could not only reduce the number of task preemption significantly but also minimize the energy consumption, compared to earliest-deadlinefirst scheduling.
On continuous strategies of deviation from a nonconvex set under uncertainty conditions
Authors: S. A. Brykalov, Ya. A. Latushkin
Venue: Automation and Remote Control (2007)

Studies are made of continuous methods of the deviation in one differential game on the plane with a nonconvex terminal set. The game is nondegenerate in the sense that the programmed controls give no way of affording the deviation and there exists a (discontinuous) method of feedback control that guarantees the deviation. The problem under study can serve as an example of the nondegenerate differential game with a nonconvex terminal set, in which the attempt fails to assure the deviation with the aid of feedback control methods described by continuous mappings. Strategies are investigated that satisfy the Caratheodory conditions and contain the argument deviation. Despite the nonconvexity of the terminal set, by which the circumference serves, it is possible to perform the proof of the unsolvability with the aid of a rather simple mathematical technique on the basis of the Schauder theorem for the fixed point.
Just Try It
Authors: J. B. Rainsberger
Venue: IEEE Software (2007)

Software development teams need to make decisions effectively as a team, but most groups spend more time in meetings and discussions than they need. Sometimes, to evaluate an idea, we have to try it for a while. If you see your team bogged down in meetings, it's time to run an experiment and replace opinions with facts.
A Standard for Software Quality Assurance Plans
Authors: F. Buckley
Venue: Computer (1979)

The increasing criticality of software mandates a standard for software quality assurance plans. Such a standard, developed by the Computer Society's Software Engineering Standards Subcommittee, appears here.
Plaggie: GNU-licensed source code plagiarism detection engine for Java exercises
Authors: Aleksi Ahtiainen, Sami Surakka, Mikko Rahikainen
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

A source code plagiarism detection engine Plaggie is presented. It is a stand-alone Java application that can be used to check Java programming exercises. Plaggie's functionality is similar with previously published JPlag web service but unlike JPlag, Plaggie must be installed locally and its source code is open. Apparently, Plaggie is the only open-source plagiarism detection engine for Java exercises.
On estimating the size and confidence of a statistical audit
Authors: Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

We consider the problem of statistical sampling for auditing elections, and we develop a remarkably simple and easily-calculated upper bound for the sample size necessary for determining with probability at least c if a given set of n objects contains fewer than b "bad" objects. While the size of the optimal sample drawn without replacement can be determined with a computer program, our goal is to derive a highly accurate and simple formula that can be used by election officials equipped with only a hand-held calculator. We actually develop several formulae, but the one we recommend for use in practice is: U3(n, b, c) = ⌈(n - (b - 1)/2) ċ (1 - (1 - c)1/b)⌉ = ⌈(n - (b - 1)/2) ċ (1 - exp(ln(1 - c)/b))⌉ As a practical matter, this formula is essentially exact: we prove that it is never too small, and empirical testing for many representative values of n ≤ 10,000, and b ≤ n/2, and c ≤ 0.99 never finds it more than one too large. Theoretically, we show that for all n and b this formula never exceeds the optimal sample size by more than 3 for c ≤ 0.9975, and by more than (-ln(1 - c))/2 for general c.
An Introduction to Switch-Level Modeling
Authors: John Hayes
Venue: IEEE Design Test (1987)

Switch-level modeling is a recently developed design and analysis methodology for MOS VLSI circuits. At the switch level,important features of MOS circuits can be directly modeled using a moderate number of discrete parameters, including switchstates, resistance, capacitance, and bidirectional signals. Switch-level models, provide more accurate behavioral and structuralinformation than gate-level logical models, while avoiding the high computational cost associated with analog electrical models.
Iterative learning from positive data and negative counterexamples
Authors: Sanjay Jain, Efim Kinber
Venue: Information and Computation (2007)

A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher (oracle) if it is a subset of the target language (and if it is not, then it receives a negative counterexample), and uses only limited long-term memory (incorporated in conjectures). Three variants of this model are compared: when a learner receives least negative counterexamples, the ones whose size is bounded by the maximum size of input seen so far, and arbitrary ones. A surprising result is that sometimes absence of bounded counterexamples can help an iterative learner whereas arbitrary counterexamples are useless. We also compare our learnability model with other relevant models of learnability in the limit, study how our model works for indexed classes of recursive languages, and show that learners in our model can work in non-U-shaped way-never abandoning the first right conjecture.
Implementing identity provider on mobile phone
Authors: Tsuyoshi Abe, Hiroki Itoh, Kenji Takahashi
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

We have implemented an identity provider (IdP), which is defined by the Liberty Alliance on a mobile phone. We propose an authentication method, which uses this personal IdP as a security token to prevent password leakage. In our method, the personal IdP on a mobile phone issues a security assertion signed by a private key on a Universal Subscriber Identifier Module (USIM). There are some authentication solutions that require special hardware tokens to prevent password leakage incidents, but their disadvantage is a higher distribution cost. In our method, there is no need for distribution of special hardware tokens because mobile phones are widespread personal devices. There are other authentication methods that use mobile phone terminals, but our method has the advantage that there is no need for installation of special software on PCs. In addition, users are able to carry out single sign-on (SSO) with our method by using the Liberty Alliance architecture. Compared with ordinary SSO where the IdP is a server computer, our method has a unique feature that the initial authentication is performed on a user's mobile phone with the key pad as an input device and LCD as an output device. Therefore, the credential for initial authentication is not transmitted from the mobile phone, and we can avoid the risk of password theft. If the mobile phone has its own security feature like fingerprint authentication, the feature can be used for SSO too. In this paper, we also discuss implementation issues on a mobile phone network and security issues regarding the man-in-the-middle attack. Results of the performance test of a prototype system are also described.
A framework for data quality and feedback in participatory sensing
Authors: Sasank Reddy, Jeff Burke, Deborah Estrin, Mark Hansen, Mani Srivastava
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

The rapid adoption of mobile phones by society over the last decade and the increasing ability to capture, classifying, and transmit a wide variety of data (image, audio, and location) have enabled a new sensing paradigm - where humans carrying mobile phones can act as sensor systems. Human-in-the-loop sensor systems raise many new challenges in areas of sensor data quality assessment, mobility and sampling coordination, and user interaction procedures.