ppxscal/embedding_network huggingface dataset:
Causally Ordered Delivery for a Hierarchical Group
Authors: Kojiro Taguchi, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Large number of peer processes are cooperating inpeer-to-peer systems. In this paper, we discuss a hierarchicalgroup protocol aiming at reducing communication andcomputation overheads for a scalable group of peer processes.A hierarchical group is composed of subgroupseach of which is furthermore composed of subgroups. Evenif messages are causally ordered in one subgroup, the messagesmay not be required to be causally ordered in a wholegroup. We discuss how to globally causally order messagesby ordering mechanisms in each subgroup.
A Novel Multiple-Valued Logic Design Using Ballistic Carbon Nanotube FETs
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper presents a novel method of multiple-valuedlogic design using carbon nanotube FETs (CNFETs).The geometry dependant threshold voltage of thesetransistors has been used to design a ternary logicfamily. We have developed a SPICE compatible modelof ballistic CNFETs. HSPICE has been used in allsimulations and transient as well as dc characteristicshave been studied.
The application of fractional factorial techniques: to the design of software experiments, or, confounding the issues
Authors: Bill Curtis, John Gannon, Shirley Gloss-Soler, Amrit Goel, Isao Miyamoto, David Panzl, Roger Warburton
Venue: ACM SIGSOFT Software Engineering Notes (1982)

We are interested in evaluating the effects of software tools and methods on cost and errors over the life-cycle of a software project. The adopted approach is to perform controlled experiments. The experiments are designed to be conducted for selected variables using standard experimental design strategies. We discuss the use of the fractional factorial approach to a specific design for a selected experiment. The Appendix contains the list of variables which were considered in the design of this experiment.
Implementations and Performance of Nonlinear CG Methods by TAO on Dawning2000
Authors: Jian Wang, Xuebin Chi, Tongxiang Gu
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Nonlinear conjugate gradient methods (CG) are typical unconstrained optimization methods. As the optimization problems to be solved become larger, the dependence on efficient and scalable software is severe. Toolkit for Advanced Optimization (TAO) is a parallel package that can currently solve several kinds of optimization problems. In this paper, we give the framework of several variants of CG: CG_FR, CG_PR, CG_PRP and their implementations in TAO1.5, which have been tested up to 64 processors on Dawning2000 to solve problems with up to 10¿ variables. The results show that the scalability of CG implementations in TAO1.5 is excellent.
Fault Tolerant Computation on Ensemble Quantum Computers
Authors: P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, Farrokh Vatan
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In ensemble (or bulk) quantum computation, all computationsare performed on an ensemble of computersrather than on a single computer.Measurements of qubitsin an individual computer cannot be performed; instead,only expectation values (over the complete ensemble ofcomputers) can be measured.As a result of this limitationon the model of computation, many algorithms cannotbe processed directly on such computers, and mustbe modified.We provide modification of the fault tolerantquantum computation protocols to enable processingon ensemble quantum computers.
Taxonomy of Bi-Temporal Events Data Semantics
Authors: Chiyaba Njovu, Mohammed T. Ibrahim
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper, we describe a taxonomy of bi-temporal events in order to show how bi-temporal databases based on a Bi-temporal Object State and Event (BOSE) model are able to copewith non-destructive updates and managing error corrections in bi-temporal databases. Our proposed scheme classifies bi-temporal event types according to their roles in maintaining bi-temporal database state histories. We classify these events into start, transitional and final bi-temporal event types. Transitional bi-temporal event types are further classified into corrective, amended and other user-defined types. We demonstrate how this taxonomy can be used in designing bi-temporal database systems based on our proposed Bi-temporal Object State and Event Modelling Approach (BOSEMA) and show a generalized internal representation of this taxonomy in a bi-temporal database schema.
Conditioning analysis of separate displacement preconditioners for some nonlinear elasticity systems
Authors: O. Axelsson, J. Karátson
Venue: Mathematics and Computers in Simulation (2004)

Separate displacement preconditioners are studied in the context of outer-inner iterations for a model in 3D nonlinear elasticity. Such a preconditioner, already known to be efficient for linear models, arises as the discretization of three independent Laplacian operators. In this paper the resulting condition number is investigated with focus on independence of parameters. Estimates are given which show that the condition number is uniformly bounded w.r.t. both the studied Newton iterate and the chosen discretization. Finally, it is sketched that ill-conditioning caused by nearly incompressible material parameters can be handled by a suitable mixed formulation.
Learning for Human-Agent Collaboration on the Semantic Web
Authors: Sachiyo Arai, Toru Ishida
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

Semantic Web is a challenging framework to make Webinformation machine readable or understandable, but itseems not enough to make humanýs requirements for collectingand utilizing information automatically. The Agenttechnology becomes hopeful approach to bridge the gap betweenhumans and machines. Agents may be autonomousand intelligent entities that may travel among agents andhuman. They get the requirements from human or otheragents, and offer an appropriate solution through consultingamong them.The main difference between agent and ordinary softwaredevelopment is the issue of coordination, cooperationand learning. This issue is very important for utilizingthe web information. In this paper, we attempt to give anoverview and research challenges with respect to the combinationof machine learning and agent technologies withSemantic Web from the perspective of interaction as well asinteroperability among agents and humans.
Mold Accessibility via Gauss Map Analysis
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In manufacturing processes like injection molding ordie casting, a 2-piece mold is required to be separable, thatis, having both pieces of the molds removed in oppositedirections while interfering neither with the mold nor witheach other.The fundamental problem is to find a viewing (i.e. separating)direction, from which a valid partition line (i.e.the contact curves of the two mold pieces) exists. Whileprevious research work on this problem exists for polyhedralmodels, verifying and finding such a partition line forgeneral freeform shapes, represented by NURBS surfaces,is still an open question.This paper shows that such a valid partition exists fora compact surface of genus g, , if and only if there is a viewingg + 1 non-singular disjoint loops. Hence, the 2-piece moldseparability problem is essentially reduced to the topologicalanalysis of silhouettes.It follows that the aspect graph, which gives all topologicallydistinct silhouettes, allows one to determine theexistence of a valid partition as well as to find such apartition when it exists. In this paper, we present an aspectgraph computation technique for compact free-formobjects represented as NURBS surfaces. All the visionevent curves (parabolic curves, flecnodal curves, and bitangencycurves) relevant to mold separability are computedby symbolic techniques based on the NURBS representation,combined with numerical processing. An imagedilation technique is then used for robust aspect graph celldecomposition on the sphere of viewing directions. Thus,an exact solution to the 2-piece mold separability problemis given for such models.
Spectral (finite) volume method for conservation laws on unstructured grids IV: extension to two-dimensional systems
Authors: Z. J. Wang, Laiping Zhang, Yen Liu
Venue: Journal of Computational Physics (2004)

In this paper, the fourth in a series, the spectral volume (SV) method is extended to multi-dimensional systems -- the 2D Euler equations. The focus of this paper is to study the performance of the SV method on multidimensional non-linear systems, and to verify that high order solution accuracy up to fourth-order can be achieved for the systems of conservation laws. Implementation details including total variation diminishing (TVD) and total variation bounded (TVB) limiters are presented. An accuracy study is performed first to numerically verify that the designed order of accuracy can be obtained for smooth flow solutions. Then, solutions with both smooth features and discontinuities are utilized to demonstrate the overall capability of the SV method.
Diverse algorithms to obtain prime numbers based on the prime function of Smarandache
Authors: Sebastián Martín Ruiz
Venue: Smarandache Notions Journal (2004)

In this article one gives seven formulas, six of the author S. M. Ruiz, and one of Azmy Ariff. One also gives their corresponding algorithms programmed in MATHEMATICA.
Hybrid tuned center-difference-WENO method for large eddy simulations in the presence of strong shocks
Authors: D. J. Hill, D. I. Pullin
Venue: Journal of Computational Physics (2004)

We develop a tuned center-difference (TCD) scheme optimized for large-eddy simulations (LES) using a method proposed by Ghosal. For LES of weakly compressible decaying turbulence, these optimized stencils are shown to provide superior performance when compared to higher-order centered schemes with the same stencil width. A hybrid method combining the TCD stencil with a weighted essentially non-oscillatory (WENO) method is then constructed for use in the LES of strongly compressible, shock-driven flows. The user-specified, optimum WENO weights are chosen to match those of the TCD scheme. It is expected that these weights will be achieved automatically in regions of smooth flow away from shocks, but in practice a switch is found to be necessary. The hybrid TCD-WENO scheme is shown to work well for unsteady gas-dynamic flows in one and two dimensions.
Class imbalances versus small disjuncts
Authors: Taeho Jo, Nathalie Japkowicz
Venue: ACM SIGKDD Explorations Newsletter (2004)

It is often assumed that class imbalances are responsible for significant losses of performance in standard classifiers. The purpose of this paper is to the question whether class imbalances are truly responsible for this degradation or whether it can be explained in some other way. Our experiments suggest that the problem is not directly caused by class imbalances, but rather, that class imbalances may yield small disjuncts which, in turn, will cause degradation. We argue that, in order to improve classifier performance, it may, then, be more useful to focus on the small disjuncts problem than it is to focus on the class imbalance problem. We experiment with a method that takes the small disjunct problem into consideration, and show that, indeed, it yields a performance superior to the performance obtained using standard or advanced solutions to the class imbalance problem.
Characterizing the Effects of Transient Faults on a High-Performance Processor Pipeline
Authors: Nicholas J. Wang, Justin Quek, Todd M. Rafacz, Sanjay J. patel
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The progression of implementation technologies into thesub-100 nanometer lithographies renew the importance ofunderstanding and protecting against single-event upsets indigital systems.In this work, the effects of transient faults onhigh performance microprocessors is explored.To perform athorough exploration, a highly detailed register transfer levelmodel of a deeply pipelined, out-of-order microprocessor wascreated.Using fault injection, we determined that fewer than15% of single bit corruptions in processor state result in softwarevisible errors.These failures were analyzed to identifythe most vulnerable portions of the processor, which werethen protected using simple low-overhead techniques.Thisresulted in a 75% reduction in failures.Building upon thefailure modes seen in the microarchitecture, fault injectionsinto software were performed to investigate the level of maskingthat the software layer provides.Together, the baselinemicroarchitectural substrate and software mask more than 9out of 10 transient faults from affecting correct program execution.
Dynamic Fault-Tolerance and Metrics for Battery Powered, Failure-Prone Systems
Authors: Phillip Stanley-Marbell, Diana Marculescu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Emerging VLSI technologies and platforms are giving rise tosystems with inherently high potential for runtime failure.Such failures range from intermittent electrical and mechanicalfailures at the system level, to device failures at the chip level.Techniques to provide reliable computation in the presence offailures must do so while maintaining high performance, withan eye toward energy efficiency. When possible, they shouldmaximize battery lifetime in the face of battery discharge non-linearities. This paper introduces the concept of adaptive fault-tolerance management for failure-prone systems, and a classification of local algorithms for achieving system-wide reliability.In order to judge the efficacy of the proposed algorithmsfor dynamic fault-tolerance management, a set of metrics, forcharacterizing system behavior in terms of energy efficiency,reliability, computation performance and battery lifetime, ispresented. For an example platform employed in a realistic evaluation scenario, it is shown that system configurations with the best performance and lifetime are not necessarilythose with the best combination of performance, reliability,battery lifetime and average power consumption.
On Small Sumsets in (&#x2124;/2&#x2124;)n
Authors: Jean-Marc Deshouillers, Fran&#x00e7;ois Hennecart, Alain Plagne
Venue: Combinatorica (2004)

It is proved that any subset $${\user1{A}}$$ of (&#x2124;/2&#x2124;)n, having k elements, such that $${\left| {{\user1{A}} + {\user1{A}}} \right|} = c{\left| {\user1{A}} \right|}$$ (with c<4), is contained in a subgroup of order at most u&#x2212;1k where u=u(c)>0 is an explicit function of c which does not depend on k nor on n. This improves by a radically different method the corresponding bounds deduced from a more general result of I. Z. Ruzsa.
In the realm of si piuh
Authors: Giovanni M. Bianco, Simonetta Tinazzi
Venue: ACM SIGCSE Bulletin (2004)

Teaching computer science to children is a big priority among the most of the EU Countries. Nevertheless, off-the-shelf Computer Science books are not particularly tailored to children, who rather need their own language, which is based on fantasy, self-identification, analogy, play, and diverse other features which characterize their bubbling world. These are the main motivations for the introduction of a novel and more children-oriented approach to Computer Science.The manual in use at the University of Verona illustrates the hardware components of a PC. It is composed of eight Chapters. Under the child's point of view, the PC is a Realm where diverse Subjects coexist together. The Realm is lead by His Majesty whose name is Si Piuh. The Mother and the servants are necessary for Si Piuh to complete the job. In this work we'll examine some features of the first chapter where the principal hardware components are presented.The hardware components can be imagined as people who live in a Realm. All the people of the Realm are Goblins, each one devoted to a particular role.With a bit of fantasy, in a Realm there are exactly the same relationships one can find in a PC: gates to the external world, artists who produce paintings and sounds, Masters who guide the whole process, libraries to store material, buses to transport material, ambassadors who know communication protocols, servants and as many other Subjects as one can imagine.The PC (i.e. the Realm) is lead by the CPU, i.e. His Majesty. The name of the king is Si Piuh, which stands for the Italian pronounce of CPU (fig. 1). Synchronizing all the activities inside the PC is a very hard work. By analogy, leading the Realm is not as easy as one can think.
The abc conjecture and correctly rounded reciprocal square roots
Authors: Ernie Croot, Ren-Cang Li, Hui June Zhu
Venue: Theoretical Computer Science (2004)

The reciprocal square root calculation α = 1/√ x is very common in scientific computations. Having a correctly rounded implementation of it is of great importance in producing numerically predictable code among today's heterogenous computing environment. Existing results suggest that to get the correctly rounded α in a floating point number system with p significant bits, we may have to compute up to 3p + 1 leading bits of α. However, numerical evidence indicates the actual number may be as small as 2p plus a few more bits. This paper attempts to bridge the gap by showing that this is indeed true, assuming the abc conjecture which is widely purported to hold. (But our results do not tell exactly how many more bits beyond the 2p bits, due to the fact that the constants involved in the conjecture are ineffective.) Along the way, rough bounds which are comparable to the existing ones are also proven. The technique used here is a combination of the classical Liouville's estimation and contemporary number theory.
Flash fusing in electrophotographic machines
Authors: Gerald W. Baumann
Venue: IBM Journal of Research and Development (1984)

A theoretical model of the flash fusing process for electrophotographic machines was developed using the joint solution of a nonlinear circuit equation and the one-dimensional thermal diffusion equation. Numerous experiments were run using different toners according to the size of toner particles and the pulse width in order to determine the minimum energy that was required for fusing. The experiments confirm that this model predicts reasonably well what was observed in the lab. The melt depth required for good fusing is slightly less than mean particle size. At that depth the temperature is somewhat greater than the temperature required in the nip of a hot roll fuser for the same toner. Under typical flash fusing, the top surface of the toner is subjected to considerably higher temperatures than the melt temperature of the toner. From the combined analytical and experimental results, the proper compromises can be made for efficiency and volatiles.
Some Remarks on the Simultaneous Chromatic Number
Authors: Andr&#x00e1;s Hajnal, P&#x00e9;ter Komj&#x00e1;th
Venue: Combinatorica (2003)

We present several partial results, variants, and consistency results concerning the following (as yet unsolved) conjecture. If X is a graph on the ground set V with $$Chr{\left( X \right)} = {\aleph }_{1}$$ then X has an edge coloring F with $${\aleph }_{1}$$ colors such that if V is decomposed into $${\aleph }_{0}$$ parts then there is one in which F assumes all values.
A Framework for Molecular Biology Database Integration Using Context Graph
Authors: Nawaz Khan, Shahedur Rahman, A. G. Stockman
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper proposes a framework based on the context of the web data for interactions withdifferent biological data resources so that a consolidated view of data can be achieved. A formal description of context of resources and their relationships have been described here using context graph. The context increases the interoperability by providing the description of the resources and the navigation plan for accessing the web based databases. A higher levelconstruct is developed to implement the context in RDF for web interactions. The interactionamong the resources is achieved by using a context based integration domain. The integration domain allows to navigate and execute the query plan within the resource databases.
Reduced state fair queuing for edge and core routers
Authors: Ramana Rao Kompella, George Varghese
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the state needs for even simple schedulers are still large for heavily channelized core routers and for edge routers. An earlier proposal, Stochastic Fair Queuing, reduces state but at the expense of added unfairness between certain flows. Another earlier scheme, Core Stateless Fair Queuing, requires header changes and does not address the state needs of edge routers. By contrast, our paper proposes a randomization technique that removes the need to store deficit counters per flow in Deficit Round Robin and its variants. Even without the counters, we show, using both analysis and simulation, that randomized technique preserves throughput fairness properties of DRR. This randomization technique introduced in this paper can be used to considerably reduce the state requirements of high speed schedulers in edge and core routers, making hardware designs feasible. The randomization idea in this paper can also be applied to other round robin schedulers as well as potentially in entirely different scenarios wherever deficits need to be tracked over time explicitly.
A Multi-Level Model for Web Service Composition
Authors: K. Vidyasankar, Gottfried Vossen
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Web services are rapidly becoming popular as a vehiclefor the design, integration, composition, and deploymentof distributed and heterogeneous software. However,while industry standards for the description, composition,and orchestration of Web services have been under discussion(and development) for quite some time already, theirconceptual underpinnings are still in their infancy. Indeed,conceptual models for service specification are rare so far,as are investigations based on them. This paper presents amulti-level service composition model that perceives servicespecification as going through several levels of abstraction,from transactional operations to the end user.Importantly, the model allows for specification of desirablecomposition properties at all levels. Different ways ofachieving these properties as well as implications of themodel are addressed.
A Linguistic and Statistical Approach for Extracting Knowledge from Documents
Authors: Wilfried Njomgue Sado, Dominique Fontaine, Philippe Fontaine
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This article presents and evaluates an innovating method of automatic indexing. It combines a linguistic analysis of the document to be indexed and a statistical analysis by the singular values decomposition of words in the document. The weighting of words combines advantages of their local and global context as well as their position compared to others terms _the co-occurrence. An application was developed in order to propose assignments topics of documents to a hierarchical referential. Finally, we will present experiments results and evaluation carried out on documents of Suez-Environment.