ppxscal/embedding_network huggingface dataset:
ASSEC: An Asynchronous Self-Checking RISC-based Processor
Authors: P. D. Hyde, G. Russell
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The use of deep sub-micron technology raises a number of concerns about reliability in VLSI circuits. Shrinking geometries and reduced power supplies leave the circuits vulnerable to 'soft' and transient errors.The combination of high clock speed and large circuit area result in high power consumption and skew in clock distribution.This paper investigates the use of Concurrent Error Detection (CED) and asynchronous design to overcome these problems.Four pipelined processor designs are compared - two synchronous, two asynchronous with one of each type using CED.Initial results indicate an area overhead of 12% in return for a fault coverage of 98.54% of all unidirectional errors. Additionally, the asynchronous CED processor has an area overhead of only 4% when compared to the synchronous non-CED design.
Estimating design effort for GE hydro projects
Authors: Hamdi A. Bashir, Vince Thomson
Venue: Computers and Industrial Engineering (2004)

Effort estimation is an essential process in determining the final cost, as well as the duration of, a future design project. This paper discusses the construction of a parametric model done in collaboration with General Electric (GE) Hydro (GE Hydro is a world leader in the design and construction of generators and turbines for hydro-electric power generation), the purpose being to estimate the effort needed to create designs for hydro-electric generators. An analysis of the data showed that the developed model resulted in a mean relative error of 13% compared to original estimation errors by GE Hydro staff, which averaged 27%. GE has been using the estimation model for its projects since the beginning of the year 2000.
A Buyers Integration Support System in Group Buying
Authors: Tokuro Matsuo, Takayuki Ito, Toramatsu Shintani
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In electronic marketplaces, group buyings are seen as an effective form of electronic commerce and a promising field for applying agent technologies. We study decision support systems for buyers in group buying. In group buying, when buyers cooperate with each other, a seller can discount the price of a good. In many existing group buying sites, some sellers deal in the same sort goods or their imitations. Buyers form coalitions for each item on sale. Buyers cannot always purchase goods at a lower price, because buyersý sub-groups are distributed. Buyers need to search hard to find the goods they can purchase. In this paper, we propose a group buying marketplace on the Internet. In our marketplace, buyers can purchase goods at a lower price by forming coalitions. Our system can provide a service that buyers are integrated based on buyersý multi-attribute preferences (utilities). Our system supports buyersý decision making by using the Analytic Hierarchy Process. We propose three methods for group integration. First, buyers trades on simple group buying. Second, all buyers are integrated. Third, some buyers are integrated. Advantages of our market can be described that buyersý multi-attribute utilities are reflected effectively in group integration and buyers can purchase goods at a lower price. Buyersý payments are decided based on their degree of compromise. A successful seller can sell goods in their stock.
A Prototype Colon Straightening System for Polyp Detection
Authors: Zhan Zhang, Michael J. Ackerman, Jixing Li
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Early detection and removal of polyps can reduce mortality due to colon cancers. The "fly-through" method in CT colonography has drawbacks. We are developing a prototype colon straightening system so as to provide a paradigm to inspect the colon wall in a "cut-open" fashion. The core component of the system is the straightening module, which models the colon straightening as a solid elastic deformation process with specially designated constraints and boundary conditions. It is demonstrated that the prototype system can retain consistency of surface points' spatial relationship and handle geometry with large-degree bendings. Future work is discussed.
(Almost) tight bounds and existence theorems for confluent flows
Authors: Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we consider the problem of determining a confluent flow that routes every node demand to some sink such that the maximum congestion at a sink is minimized. Confluent flows arise in a variety of application areas, most notably in networking; in fact, most flows in the Internet are confluent since Internet routing is destination based.We present near-tight approximation algorithms, hardness results, and existence theorems for confluent flows. The main result of this paper is a polynomial-time algorithm for determining a confluent flow with congestion at most 1 + ln(k) in G, if G admits a splittable flow with congestion at most 1. We complement this result in two directions. First, we present a graph G that admits a splittable flow with congestion at most 1, yet no confluent flow with congestion smaller than Hk, thus establishing tight upper and lower bounds to within an additive constant less than 1. Second, we show that it is NP-hard to approximate the congestion of an optimal confluent flow to within a factor of (lg k)/2, thus resolving the polynomial-time approximability to within a multiplicative constant. We also consider a demand maximization version of the problem. We show that if G admits a splittable flow of congestion at most 1, then a variant of the congestion minimization algorithm yields a confluent flow in G with congestion at most 1 that satisfies 1/3 fraction of total demand.We show that the gap between confluent flows and splittable flows is much smaller, if the underlying graph were k connected. In particular, we prove that k-connected graphs with k sinks admit confluent flows of congestion less than C + dmax, where C is the congestion of the best splittable flow, and dmax is the maximum demand of any node in G. The proof of this existence theorem is non-constructive and relies on topological techniques introduced in [16].
Vectorless Analysis of Supply Noise Induced Delay Variation
Authors: Sanjay Pant, David Blaauw, Vladimir Zolotov, Savithri Sundareswaran, Rajendran Panda
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The impact of power supply integrity on a design has become acritical issue, not only for functional verification, but also for performanceverification. Traditional analysis has typically applied a worstcase voltage drop at all points along a circuit path which leads to avery conservative analysis. We also show that in certain cases, thetraditional analysis can be optimistic, since it ignores the possibilityof voltage shifts between driver and receiver gates. In this paper, wepropose a new analysis approach for computing the maximum pathdelay under power supply fluctuations. Our analysis is based on theuse of superposition, both spatially across different circuit blocks,and temporally in time. We first present an accurate model of pathdelay variations under supply drops, considering both the effect oflocal supply reduction at individual gates and voltage shifts betweendriver/receiver pairs. We then formulate the path delay maximizationproblem as a constrained linear optimization problem, consideringthe effect of both IR drop and LdI/dt drops. We show how correlationsbetween currents of different circuit blocks can be incorporatedin this formulation using linear constraints. The proposed methodswere implemented and tested on benchmark circuits, including anindustrial power supply grid and we demonstrate a significantimprovement in the worst-case path delay increase.
Proxy-based acceleration of dynamically generated content on the world wide web: An approach and implementation
Authors: Anindya Datta, Kaushik Dutta, Helen Thomas, Debra Vandermeer, Krithi Ramamritham
Venue: ACM Transactions on Database Systems (TODS) (2004)

As Internet traffic continues to grow and websites become increasingly complex, performance and scalability are major issues for websites. Websites are increasingly relying on dynamic content generation applications to provide website visitors with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost---each request requires computation as well as communication across multiple components.To address these issues, various dynamic content caching approaches have been proposed. Proxy-based caching approaches store content at various locations outside the site infrastructure and can improve website performance by reducing content generation delays, firewall processing delays, and bandwidth requirements. However, existing proxy-based caching approaches either (a) cache at the page level, which does not guarantee that correct pages are served and provides very limited reusability, or (b) cache at the fragment level, which is associated with several design-level and runtime scalability issues. To address these issues, several back-end caching approaches have been proposed, including query result caching and fragment level caching. While back-end approaches guarantee the correctness of results and offer the advantages of fine-grained caching, they neither address firewall delays nor reduce bandwidth requirements.In this article, we present an approach and an implementation of a dynamic proxy caching technique which combines the benefits of both proxy-based and back-end caching approaches, yet does not suffer from their above-mentioned limitations. Our dynamic proxy caching technique allows granular, proxy-based caching in highly dynamic scenarios, accessible outside the site infrastructure. We present two possible configurations for our dynamic proxy caching technique: (1) a reverse proxy configuration, and (2) a forward proxy configuration. Analysis of the performance of our approach indicates that it is capable of providing significant reductions in bandwidth. We have deployed our proposed dynamic proxy caching technique at a major financial institution. The results of this implementation indicate that our technique is capable of providing up to 3x reductions in bandwidth and response times in real-world dynamic Web applications when compared to existing caching solutions.
SMIS - A Real-Time Stereoscopic Medical Imaging System
Authors: Shuangbao Wang, Jim X. Chen, Zegang Dong, Robert S. Ledley
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this paper, we present an x-ray radiography system which can provide intra-operativestereo imaging of the patient's operational area during a spinal surgery. We use two horizontally separated x-ray tubes and a flat-panel x-ray detector mounted on two ends of a C-arm. microcontroller synchronizes the image acquisition, and the left and right images aregrabbed into the system alternately. Surgeons can have a 3D perception of the spine's x-rayimage in real-time.We further developed a whole image processing language called PPL. PPL takes images asoperands instead of dealing with complex pixel operation. To speed up the rendering speed in a network environment, we proposed a Level of Detail (LOD) with revere prediction method that can fast transmit images over Internet in real-time.
A unifying semantics for time and events
Authors: Brandon Bennett, Antony P. Galton
Venue: Artificial Intelligence (2004)

We give a formal semantics for a highly expressive language for representing temporal relationships and events. This language, which we call Versatile Event Logic (VEL), provides a general temporal ontology and semantics encompassing many other representations. The system incorporates a number of features that have not been widely employed in AI formalisms. It has the ability to describe alternative histories using a modal operator. It provides a semantics for individuals that explicitly models their identity through time and across alternative possible histories; and enables one to distinguish between necessary and extensional identity of individuals. In virtue of its treatment of individuals and count nouns, the formalism offers a solution to certain puzzles of identity, which arise when individuals are described in different ways. We propose that VEL can be used as a foundational interlingua for comparing and interfacing different AI languages and illustrate this by considering how Situation Calculus and Event Calculus can be represented within VEL.
Secure and private sequence comparisons
Authors: Mikhail J. Atallah, Florian Kerschbaum, Wenliang Du
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other than what can be inferred from the edit distance between their two sequences - which is unavoidable because computing that distance is the purpose of the protocol). The amount of communication done by our protocol is proportional to the time complexity of the best-known algorithm for performing the sequence comparison.The problem of determining the similarity between two sequences arises in a large number of applications, in particular in bioinformatics. In these application areas, the edit distance is one of the most widely used notions of sequence similarity: It is the least-cost set of insertions, deletions, and substitutions required to transform one string into the other. The generalizations of edit distance that are solved by the same kind of dynamic programming recurrence relation as the one for edit distance, cover an even wider domain of applications.
A Theory of Non-Deterministic Networks
Authors: Alan Mishchenko, Robert K. Brayton
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Both non-determinism and multi-level networks compactlycharacterize the flexibility allowed in implementing a circuit.A theory for representing and manipulating non-deterministic(ND) multi-level networks is developed. The theory supports allthe network manipulations commonly applied to deterministicbinary networks, such as node minimization, elimination, anddecomposition. It is shown that an ND network's behavior can beinterpreted in three ways, all of which coincide when the networkis deterministic. Operations performed on an ND network areanalyzed under each interpretation for changes in a network'sbehavior. Modifications of a few operations are given which mustbe used to guarantee that a network's behavior does not violateits external specification. These modifications depend on whichbehavior is being used and the location of related non-determinism.This theory has been implemented in a system,MVSIS. We provide comparisons among the uses of the various behaviors.
Toward a Systems Biology Software Toolkit
Authors: Donald J. Johann, Michael D. McGuigan, Stanmire Tomov, Eric Blum, Gordon R. Whiteley, Emanuel F. Petricoin, Lance A. Liotta
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Insight to complex problems may be revealed when domain data sets are viewed or structuredin new and innovative ways. Systems approaches to biomedical problems fundamentallyinvolve forecasting, and a deliberate integration of diverse data sources. Adding a clinicalproteomic dimension to these developing efforts affirms the ultimate aims of enhanceddiagnostic prediction, maximizing the possibility for a rational therapy individualized to apatient's pathologic process, and thus, improving patient outcomes. Consistent with theseevolving goals, computer-aided diagnostic systems are rapidly approaching a new paradigminvolving the integration of medical imaging with high throughput molecular medicine tests. Asmedical imaging systems become more sensitive in finding anatomic anomalies, their lack ofspecificity becomes much more of a clinical dilemma. Proteomic tests may be used to helpresolve the lack of specificity of imaging findings. A synergistic test composed of a targetedimaging study correlated with a genomic or proteomic test(s), offers the potential of atremendous medical advancement. Bioinformatic software toolkits are crucial components ofthese systems. Open source software provides a mechanism for leveraging existing toolkits,sharing expertise, accelerating development, and furthering biomedical, software, and systemssciences in new and complex multi-disciplinary fields. Our evolving toolkit utilizes componentsfrom several existing open source projects. It will initially be customized for serum proteomicpattern diagnostics, which will be used in the upcoming NCI/CCR Clinical Trial involving themonitoring for ovarian cancer recurrence.
(An almost) pedagogical pattern for pattern-based problem-solving instruction
Authors: Orna Muller, Bruria Haberman, Haim Averbuch
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Importing design patterns from software engineering to the computer science education (CSE) field was followed by defining patterns and pattern languages suitable for CS courses. The main goal of incorporating patterns in CSE was to enhance students' programming abilities, as well as their design and problem-solving skills. Accordingly, various instructional materials were suggested for using patterns in classroom learning activities, such as collections of patterns and related programming assignments. However, the existing pattern-based materials seem to be insufficient for implementation in the classroom, especially when teaching introductory courses that emphasize syntax and programming language features. Therefore, alternative methods using applicative models for pattern-based instruction, which emphasize problem solving and program design issues rather than specific language features and syntax, should be developed and assimilated within the CS teaching community. We believe that successful implementation of such models should be accompanied by appropriate teacher-training.In this paper we describe an initial effort to expose CS teachers to the notions of pedagogical patterns and pattern-based instruction, aimed at motivating them to meaningfully adopt and adapt patterns to their concrete pedagogical needs.
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
Authors: Uwe Naumann
Venue: Mathematical Programming: Series A and B (2004)

The accumulation of the Jacobian matrix F&#x2019; of a vector function *** equation here *** can be regarded as a transformation of its linearized computational graph into a subgraph of the directed complete bipartite graph Kn,m. This transformation can be performed by applying different elimination techniques that may lead to varying costs for computing F&#x2019;. This paper introduces face elimination as the basic technique for accumulating Jacobian matrices by using a minimal number of arithmetic operations. Its superiority over both edge and vertex elimination methods is shown. The intention is to establish the conceptual basis for the ongoing development of algorithms for optimizing the computation of Jacobian matrices.
A limit characterization for the number of spanning trees of graphs
Authors: S. D. Nikolopoulos, C. Nomikos, P. Rondogiannis
Venue: Information Processing Letters (2004)

In this paper we propose a limit characterization of the behaviour of classes of graphs with respect to their number of spanning trees. Let {Gn} be a sequence of graphs G0, G1, G2.... that belong to a particular class. We consider graphs of the form Kn - Gn that result from the complete graph Kn after removing a set of edges that span Gn. We study the spanning tree behaviour of the sequence {Kn - Gn} when n → ∞ and the number of edges of Gn scales according to n. More specifically, we define the spanning tree indicator α({Gn}), a quantity that characterizes the spanning tree behaviour of {Kn - Gn}. We derive closed formulas for the spanning tree indicators for certain well-known classes of graphs. Finally, we demonstrate that the indicator can be used to compare the spanning tree behaviour of different classes of graphs (even when their members never happen to have the same number of edges).
Multi-Grain Remote Access Cache in NUMA System
Authors: Jong Wook Kwak, Cheol Hong Kim, Seong Tae Jhang, Chu Shik Jhon
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

In this paper, we suggest the use of the Multi-Grain Remote Access Cache(RAC) to adaptively control the RAC line size for each application behavior. We simulate NUMA systems with multi-grain RAC using MINT, event-driven memory hierarchy simulator, and analyze the performance results. Firstly, with a profile-based determination method, we verify the optimal RAC line size for each application and, then, we compare and analyze the performance differences among NUMA systems with normal RAC, with optimal line size RAC, and with multi-grain RAC. The simulation shows that the worst case can be always avoided and in addition, the results are very close to the optimal case with any combination of application and RAC format.
Multiple Opinions for Medical Decision Support
Authors: Mitja Lenic, Petra Povalej, Milan Zorman, Peter Kokol
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Experts can make highly accurate decisions, because they have accumulated a lot of(background) knowledge about the problem with theirs past experience. Because experienceis very subjective different experts propose different diagnosis and decision based on thesame facts gathered with observation of a patient. Machine learning methods also posesbackground knowledge encoded in theirs induction algorithms. In this paper we present amethod for modifying this background knowledge and can therefore produce differenthypothesis on same observation that therefore exposes different aspects e.g. opinions ofexperts. We also present a method for combining these hypotheses in combined, hopefullyhighly accurate, hypothesis by using boosting and multimethod approach.
Computers and qualitative research: adoption, use, and representation
Authors: Wilma C. Mangabeira, Raymond M. Lee, Nigel G. Fielding
Venue: Social Science Computer Review (2004)

Drawing on a range of sources, this article examines patterns in the adoption, appropriation, and use of qualitative analysis software (or CAQDAS--Computer-Assisted Qualitative Data Analysis Software) in the United Kingdom. It is argued that the take-up and use of CAQDAS, representations of computer-assisted as opposed to manual analysis, and certainty about the utility of CAQDAS, are related to user generation. The changing composition of the user base for CAQDAS programs is also discussed.