ppxscal/embedding_network huggingface dataset:
MM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice Space
Authors: Zheng Shao, Jiawei Han, Dong Xin
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

The data cube and iceberg cube computation problemhas been studied by many researchers. There are three majorapproaches developed in this direction: (1) top-downcomputation, represented by MultiWay array aggregation[An Array-Based Algorithm for Simultaneous Multidimensional Aggregates], which utilizes shared computation and performs wellon dense data sets; (2) bottom-up computation, representedby BUC [Bottom-up computation of sparse and iceberg cubes], which takes advantage of Apriori Pruning and performs well on sparse data sets; and (3) integratedtop-down and bottom-up computation, represented by Star-Cubing[Computing Iceberg Cubes by Top-Down and Bottom-Up Integration], which takes advantages of both and has high performance in most cases. However, the performance ofStar-Cubing degrades in very sparse data sets due to theadditional cost introduced by the tree structure. None of thethree approaches achieves uniformly high performance onall kinds of data sets.In this paper, we present a new approach that computeIceberg Cubes by factorizing the lattice space accordingto the frequency of values. This approach, different fromall the previous dimension-based approaches where the importanceof data distribution is not recognized, partitionsthe cube lattice into one dense subspace and several sparsesubspaces. With this approach, a new method called MM-Cubinghas been developed. MM-Cubing is highly adaptiveto dense, sparse or skewed data sets. Our performancestudy shows that MM-Cubing is efficient and achieves highperformance over all kinds of data distributions.
Efficient analysis of single event transients
Authors: M. Sonza Reorda, M. Violante
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

The effects of charged particles striking VLSI circuits and producing single event transients (SETs) are becoming an issue for designers who exploit deep sub-micron technologies; efficient and accurate techniques for assessing their impact on VLSI designs are thus needed. This paper presents a new approach for generating the list of faults to be addressed during fault injection experiments tackling SET effects, which resorts to static timing analysis. Moreover, it proposes a simplified SET fault model, which is suitable for being adopted within a zero-delay fault simulation tool. Experimental results are reported on both standard benchmarks and real-life circuits assessing the effectiveness of the proposed techniques.
Length-Matching Routing for High-Speed Printed Circuit Boards
Authors: Muhammet Mustafa Ozdal, Martin D. F. Wong
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

As the clock frequencies used in industrial applications increase,the timing requirements imposed on routing problems becometighter. So, it becomes important to route the nets within tight minimumand maximum length bounds. Although the problem of routingnets to satisfy maximum length constraints is a well-studiedproblem, there exists no sophisticated algorithm in the literaturethat ensures that minimum length constraints are also satisfied. Inthis paper, we propose a novel algorithm that effectively incorporatesthe min-max length constraints into the routing problem. Ourapproach is to use a Lagrangian relaxation framework to allocateextra routing resources around nets simultaneously during routingthem. We also propose a graph model that ensures that all theallocated routing resources can be used effectively for extendinglengths. Our routing algorithm automatically prioritizes resourceallocation for shorter nets, and length minimization for longer netsso that all nets can satisfy their min-max length constraints. Ourexperiments demonstrate that this algorithm is effective even in thecases where length constraints are tight, and the layout is dense.
Recent developments in deca-nanometer vertical MOSFETs
Authors: S. Hall, D. Donaghy, O. Buiu, E. Gili, T. Uchino, V. D. Kunz, C. H. de Groot, P. Ashburn
Venue: Microelectronic Engineering (2004)

We report simulations and experimental work relating to innovations in the area of ultra short channel vertical transistors. The use of dielectric pockets can mitigate short channel effects of charge sharing and bulk punch-through: thickened oxide regions can minimize parasitic overlap capacitance in source and drain: a narrow band gap, SiGe source can reduce considerably the gain of the parasitic bipolar transistor which is particularly severe in vertical MOSFETs. The work is put into the context of the ITRS roadmap and it is demonstrated that vertical transistors can provide high performance at relaxed lithographic constraints.
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture
Authors: Constantine Katsinis
Venue: Future Generation Computer Systems (2004)

Due to advances in fiber-optics and VLSI technology, interconnection networks which allow multiple simultaneous broadcasts are becoming feasible. This paper presents the multiprocessor architecture of the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus), and examines the performance of representative algorithms for matrix operations, merging and sorting, using the message-passing and distributed-shared-memory paradigms. It shows that simple enhancements to the network interface and the cache and directory controllers can result in communication time of O(1) for the matrix-vector multiplication algorithm using DSM. The SOME-Bus is a low-latency, high-bandwidth, fiber-optic interconnection network which directly links arbitrary pairs of processor nodes without contention, and can efficiently interconnect over 100 nodes. It contains a dedicated channel for the data output of each node, eliminating the need for global arbitration and providing bandwidth that scales directly with the number of nodes in the system. Each of P nodes has an array of receivers, with one receiver dedicated to each node output channel. No node is ever blocked from transmitting by another transmitter or due to contention for shared switching logic. The entire P receiver array can be integrated on a single chip at a comparatively minor cost resulting in O(P) complexity. The SOME-Bus has much more functionality than a crossbar by supporting multiple simultaneous broadcasts of messages, allowing cache consistency protocols to complete much faster.
A flexible system for scheduling drivers
Authors: Anthony Wren, Sarah Fores, Ann Kwan, Raymond Kwan, Margaret Parker, Les Proll
Venue: Journal of Scheduling (2003)

A substantial part of the operating costs of public transport is attributable to drivers, whose efficient use therefore is important. The compilation of optimal work packages is difficult, being NP-hard. In practice, algorithmic advances and enhanced computing power have led to significant progress in achieving better schedules. However, differences in labor practices among modes of transport and operating companies make production of a truly general system with acceptable performance a difficult proposition. TRACS II has overcome these difficulties, being used with success by a substantial number of bus and train operators. Many theoretical aspects of the system have been published previously. This paper shows for the first time how theory and practice have been brought together, explaining the many features which have been added to the algorithmic kernel to provide a user-friendly and adaptable system designed to provide maximum flexibility in practice. We discuss the extent to which users have been involved in system development, leading to many practical successes, and we summarize some recent achievements.
Stiffness Analysis and Design of a Compact Modified Delta Parallel Mechanism
Authors: Woo-Keun Yoon, Takashi Suehiro, Yuichi Tsumaki, Masaru Uchiyama
Venue: Robotica (2004)

In our previous work, we developed a compact 6-DOF haptic interface as a master device which achieved an effective manual teleoperation. The haptic interface contains a modified Delta parallel-link positioning mechanism. Parallel mechanisms are usually characterized by a high stiffness, which, however, is reduced by elastic deformations of both parts and bearings. Therefore, to design such a parallel mechanism, we should analyze its structural stiffness, including elastic deformations of both parts and bearings. Then we propose a simple method to analyze structural stiffness in a parallel mechanism using bearings. Our method is based on standard concepts such as static elastic deformations. However, the important aspect of our method is the manner in which we combine these concepts and how we obtain the value of the elasticity coefficient of a rotation axis in a bearing. Finally, we design a modified Delta mechanism, with a well-balanced stiffness, based on our method of stiffness analysis.
Program reversals for evolutions with non-uniform step costs
Authors: Andrea Walther
Venue: Acta Informatica (2004)

The reversal of a program execution can be helpful for several purposes. The reverse mode of automatic differentiation, parameter estimation, and debugging represent some of the tasks that may require the intermediate values of a calculation in reverse order. The recording of a complete execution log forms the simplest approach to providing the data required for the reversal. However, this &#x201c;store-everything&#x201d; method causes an enormous demand for memory. The generation of the execution log piece by piece offers the possibility to reduce the storage requirement. To that end the forward calculation is restarted from suitably placed checkpoints leading to a more or less complicated reversal schedule.This paper deals with the reversal of evaluation procedures that consist of a sequence of time steps with varying computational complexity. We present a new search algorithm for determining a reversal schedule that minimizes the runtime of the reversal process for a given number of checkpoints. By exploiting a certain monotonicity property, the search algorithm based on dynamic programming can be made to grow only quadratically with the number of time steps to be reverted. We report the runtime savings that can be achieved performing the reversal with an optimal, i.e. time-minimal, reversal schedule for a test problem based on Burgers&#x2019; equation.
Electronic Simulation for Virtual Reality: Virtual Prototyping
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper examines a virtual prototyping systemfor electronic devices which incorporatevisualisation using a novel integrated developmentenvironment that combines user interaction withphotorealistic 2D and 3D models. Full system levelhardware simulation is also supported within thisframework which offers electronic simulation in avirtual environment.This helps to link product development specialistswith a unified and coherent modelling environment.Virtual prototyping is a novel design methodologythat aims to decrease the time-to-market andincrease product reliability, quality and fulfilment ofuser requirements. This paper uses the example of aremotely controlled domestic cooking system toillustrate this process.
Daredevil
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

To produce a compelling, subjective point of view for the title character in "Daredevil," Rhythm & Hues developed Shadow World, a visualization of echoes which bounce off objects in the environment, creating ghost-like images that dissipate with vapor-like transience. Shadow World represents the development of an advanced, production tested set of volumetric tools, allowing a great deal of flexibility and control in the shape and appearance of three-dimensional density fields. Useful not only in generating soft-edged cloudy effects, these fields may also be used to derive isometric surfaces around volumes, and be highly effective in the representation of fluids. Copyright held by creator.
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
Authors: Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte
Venue: Parallel Computing (2004)

In the Dial-a-Ride problem (DARP) users specify transportation requests between origins and destinations to be served by vehicles. In the dynamic DARP, requests are received throughout the day and the primary objective is to accept as many requests as possible while satisfying operational constraints. This article describes and compares a number of parallel implementations of a Tabu search heuristic previously developed for the static DARP, i.e., the variant of the problem where all requests are known in advance. Computational results show that the proposed algorithms are able to satisfy a high percentage of user requests.
Some Smarandache-type sequences and problems concerning abundant and deficient numbers
Authors: Jason Earls
Venue: Smarandache Notions Journal (2004)

We define some new sequences involving Smarandache operations on the sets of deficient and abundant numbers. We give conjectures and ask questions about these sequences somewhat similar to certain problems posed in Smarandache's book Only problems, Not Solutions! [7].
String Join Using Precedence Count Matrix
Authors: Xia Cao, Anthony K. H. Tung, Beng Chin Ooi, Kian-Lee Tan, Shuai Cheng Li
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In this paper, we propose a filter-and-refine string joinalgorithm. While the filtering phase can rapidly pruneaway strings that are not joinable, the refinement phaseemploys a comprehensive algorithm to remove the remainingfalse alarms. The efficiency of the proposed schemelies in the use of the precedence count matrix (PCM) forcomputing the edit distance between two sequences. WithPCM, the complexity of sequence comparison is a constanttime. We also evaluated the proposed sequence join algorithm,and our study shows that it outperforms the knowntechniques.
A Framework for Dynamic Byzantine Storage
Authors: Jean-Philippe Martin, Lorenzo Alvisi
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We present a framework for transforming severalquorum-based protocols so that they can dynamicallyadapt their failure threshold and server count, allowingthem to be reconfigured in anticipation of possiblefailures or to replace servers as desired. We demonstratethis transformation on the dissemination quorumprotocol. The resulting system provides confirmablewait-free atomic semantics while tolerating Byzantinefailures from the clients or servers. The system cangrow without bound to tolerate as many failures as desired.Finally, the protocol is optimal and fast: only theminimal number of servers - 3f + 1- is needed to tolerateany f failures and, in the common case, reads requireonly one message round-trip.
A Theory of Dictionary Attacks and its Complexity
Authors: Stephanie Delaune, Florent Jacquemard
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

We consider the problem of automating proofs of cryptographicprotocols when some data, like poorly chosen passwords,can be guessed by dictionary attacks. First, we definea theory of these attacks: we introduce an inference systemmodeling the guessing capabilities of an intruder. Thissystem extends the classical Dolev-Yao rules. Using proofrewriting techniques, we show a locality lemma for our inferencesystem which yields the PTIME-completeness of thededuction problem.This result is lifted to the simultaneous solving of intruderdeduction constraints with variables. Constraintsolving is the basis of a NP algorithm for the protocol insecurityproblem in the presence of dictionary attacks, assuminga bounded number of sessions. This extends theclassical NP-completeness result for the Dolev-Yao model.We illustrate the procedure with examples of publishedprotocols. The model and decision algorithm have been validatedon some examples in a prototype implementation.
The Virtual Surgery Patient: Development of a digital, three-dimensional model of human anatomy designed for surgical
Authors: John Qualter, Marc M. Triola, Matthew J. Weiner, Mary Ann Hopkins, Miro Kirov, Martin S. Nachbar
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Teaching medical students about the anatomical principles of surgical procedures is achallenging task. In an effort to design a new tool that allows a third year medical student toexplore specific surgical problems, the New York University School of Medicine Department of Surgery and the New York University School of Medicine Advanced Educational Systems lab collaborated to develop a Virtual Surgery Patient (VSP). The VSP is a realistic set of three-dimensional models of human anatomy. Unlike previous applications, our objective was to create lightweight 3-D models with the inherent ability to deform smoothly upon animation,with an architecture that allowed for enhanced texturing as well as polygon reduction.We developed a technique for using reconstructed volume data from the Visible HumanProject to create surface models that were easy to manipulate, avoiding artifacts introducedwhen resurrecting volumes from cadaveric sliced stacks. Surface shading can be used to give the models the appearance of living tissue, as well as allow for enhancements sometimesnecessary to achieve an educational goal.
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Authors: Andrew Nealen, Marc Alexa
Venue: Proceedings of the Computer Graphics International (2004)

Patch-based texture synthesis has proven to produce highquality textures faster than pixel-based approaches. Previousalgorithms differ in how the regions of overlap betweenneighboring patches are treated. We present an approachthat produces higher quality overlap regions than simpleblending of patches or computing good boundaries, however,that is faster than re-synthesizing invalid pixels using aclassical per-pixel synthesis algorithm: we use a k-nearestneighbor (knn) data structure, obtained from the input texturein a precomputation step. Results from our implementationshow that the algorithm produces high-quality textures,where the time complexity of the synthesis stage islinear in the number of re-synthesized pixels and, therefore,scales well with the size of the input texture.
DecisionQoS: An Adaptive, Self-Evolving QoS Arbitration Module for Storage Systems
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

As a consequence of the current trend towards consolidatingcomputing, storage and networking infrastructuresinto large centralized data centers, applications competefor shared resources. Open enterprise systems are not designedto provide performance guarantees in the presenceof sharing; unregulated competition is very likely to resultin a free-for-all where some applications monopolize resourceswhile others starve. Rule-based solutions to the resourcearbitration problem suffer from excessive complexity,brittleness, and limitations in their expressive power.We present DECISIONQOS, a novel approach for arbitratingresources among multiple competing clients while enforcingQoS guarantees. DECISIONQOS requires systemadministrators to provide a minimal, declarative amount ofinformation about the system and the workloads runningon it. That initial input is continuously refined and augmentedat run time, by monitoring the system's performanceand its reaction to resource allocation decisions. Whenfaced with incomplete information, or with changes in theworkload requirements or system capabilities, DECISIONQOSadapts to them by applying machine learning techniques;the resulting scheme is highly resilient to unforeseenevents. Moreover, it overcomes significant shortcomings ofpre-existing, rule-based policy management systems.
REASON: an intelligent user assistant for interactive environments
Authors: J. M. Prager, D. M. Lamberti, D. L. Gardner, S. R. Balzac
Venue: IBM Systems Journal (1990)

The provision of intelligent user assistance has been an ongoing problem in designing computer interfaces. Interactive computing environments must support expert as well as novice users when providing advice for error correction and answers to questions directed to a system. To address these issues, we have investigated the application of fairly well-understood artificial intelligence techniques in novel ways to provide intelligent help. This paper describes the design methodology used to build REASON (Real-time Explanation And SuggestiON), an intelligent user-assistant prototype for a windowed, multitasking environment. REASON's central component is an inference engine that solves problems arising from a user's activity. When the user makes one of several different kinds of errors, the inference engine offers dynamically generated suggestions about what the user might have intended. The user can also query REASON using natural language. In addition to providing suggestions of corrected input or answers to questions, REASON can provide two complementary types of explanations of these responses, derived from the inferences that led to them.
Sporadic Communication Protocol between Clusters of Mobile Computers
Authors: Sayaka Harada, Hiroaki Higaki
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Recently, mobile computers such as laptop, handheldand parmtop PCs have become to communicate with eachother by using wireless LAN protocols, e.g., IEEE802.11and HIPERLAN.Conventional routing protocols supporta mobile network in which mobile computers changetheir location independently.In case that a mobile computerchanges the location with high speed, less messagesare exchanged between the mobile computers.In this paper,the authors propose a novel routing protocol for supportingmobile clustered networks in which mobile computersmove with almost the same velocity and communicatewith each other by multi-hop message transmissionform a cluster.Here, communication between clustersis available if at least one mobile computer in the clusteris within the message transmission range of a mobilecomputer in the other cluster.That is, a communicationprotocol is required to support sporadic communication.For achieving higher bandwidth even though the clustersmove with high speed, a set of gateway mobile computersare introduced in each cluster.We design protocols forswitching gateways and for updating routing tables in theclusters according to the movement.
Sylvester-resultants for bivariate polynomials with planar newton polygons
Authors: Amit Khetan, Ning Song, Ron Goldman
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We derive necessary and sufficient conditions which guarantee that a multiplying set of monomials generates exactly a Sylvester A-resultant for three bivariate polynomials with a given planar Newton polygon. We show that valid multiplying sets come in complementary pairs, and any two complementary pairs of multiplying sets can be used to index the rows and columns of a pure Bezoutian A-resultant for the same Newton polygon.The necessary and sufficient conditions include a set of Diophantine equations that can be solved to generate the multiplying sets and therefore the corresponding Sylvester $A$-resultants. Examples relevant to Geometric Modeling are provided, including a new family of hexagonal examples for which Sylvester formulas were not previously known. These examples not only flesh out the theory, but also demonstrate that none of the conditions are superfluous and that all the conditions are mutually independent. The proof of the main theorem makes use of tools from algebraic geometry, including sheaf cohomology on toric varieties and Weyman's resultant complex.