ppxscal/embedding_network huggingface dataset:
Core CSS
Authors: Keith Schengili-Roberts
Venue:  (2000)

The experienced developer's guide to CSS1 and CSS2! Comprehensive browser and platform compatibility Info In-depth examples throughout, plus an extensive CSS1/CSS2 reference sectionThe expert Web developer's guide to style sheets: CSS1 and CSS2!Core CSS is an example-rich guide that shows experienced Web developers exactly how to achieve great results with CSS1 and CSS2!In this example-rich book, Keith Schengili-Roberts shows experienced Web developers all they need to know to achieve great results with the latest style-sheet technologies. Schengili-Roberts provides in-depth coverage of both CSS1 and the recent CSS2 standard, taking care to explain the differences between the two. Understand key CSS2 families of properties, including aural (sound-based) style sheets, automatically generated content, user interface properties and much more.This book is the most comprehensive listing available on CSS compatibility across browsers and operating systems, so Web masters can finally know what CSS properties are "safe" to use.Detailed appendices provide full CSS1 and CSS2 property listings, color palette information, compatibility charts and more.Every Core Series book: DEMONSTRATES how to write commercial quality code FEATURES dozens of nontrivial programs and examples-no toy code! FOCUSES on the features and functions most important to real developers PROVIDES objective, unbiased coverage of cutting-edge technologies-no hype!Core CSS delivers: Practical techniques for integrating CSS into your Web site development Expert insight into choosing the best style sheet code Hundreds of professional-level code examplesCD-ROMThe accompanying CD-ROM includes all of the book's detailed code examples.
On the Dynamic Initialization of Parallel Computers
Authors: Stephan Olariu, Ivan Stojmenović, Albert Zomaya
Venue: The Journal of Supercomputing (2000)

The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to be contended with at power-up time. The problem is fundamental, for virtually all parallel algorithms known to the authors assume that the processors know their global coordinates within the newly created entity. We refer to this problem as the initialization problem. Rather surprisingly, the initialization problem has not received much attention in the literature. Our main contribution is to present parallel algorithms for the initialization problem on a number of network topologies, including complete binary trees, meshes of trees, pyramids, linear arrays, rings, meshes, tori, higher dimensional meshes and tori, hypercubes, butterflies, linear arrays with a global bus, rings with a global bus and meshes with multiple broadcasting, under various assumptions about edge labels, leader existence, and a priori knowledge of the number of nodes in the network. With two exceptions, the proposed algorithms are optimal.
Safe timestamps and large-scale modeling
Authors: David Nicol, Jason Liu, James Cowie
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

This paper visits issues that recur in consideration of simulation time-stamps, in the context of building very large simulation models from components developed by different groups, at different times. A key problem here is &ldquo;safety&rdquo;, loosely defined to mean that unintended model behavior does not occur due to unpredictable behavior of timestamp generation and comparisons. We revisit the problems of timestamp format and simultaneity, and then turn to the new problem of timestamp inter-operability. We describe how a C++ simulation kernel can support the concurrent evaluation of submodels that internally use heterogeneous timestamps, and evaluate the execution time costs of doing so. We find that use of a safe timestamp format that explicitly allows different time-scales costs less than 10% over a stock 64-bit integer format, whereas support for completely heterogeneous timestamps can costs as much as 50% in execution speed.
Energy minimization with guaranteed quality of service
Authors: Gang Qu, Miodrag Potkonjak
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Quality of service (QoS) is one of the key features for new Internet-based multimedia and other applications. meanwhile, energy remains as a big concern for systems that perform such applications. we address the isssue of combining system design concerns and QoS requirements to design systems that can deliver QoS quarantees. In this paper, we discuss how to satisfy QoS requirements and minimize the system's energy consumption. Specifically, we consider the following problem: Given a set of applications each specifying its required amount of computation and service time, how we allocate CPU time and determine the voltage profile on a variable voltage system, such that all the applications' requirements are satisfied and the system's total energy consumption is minimized. We optimally solve several basic cases and propse a dynamic programming procedure for the general case. Simulation shows that the new approach saves 38.75% energy over the system shut-down technique.
PPT: a COTS integration case study
Authors: L. David Balk, Ann Kedia
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

T. Rowe Price Investment Technologies built The Product and Project Tracking System (PPT) to reduce the human resources needed to track and forecast Information Technology projects. Instead of developing or purchasing a new system, the need was met by integrating Commercial-off-the-Shelf (COTS) products already used and licensed by the company. The conclusion can be made that this approach reduces development costs while providing more flexibility than a single vendor solution. This paper described the process used and issues encountered in building a system from software products generally intended for stand-alone applications. It discusses the rationale behind the system, the choice of products, the software engineering process used, the handling of changes, and modifications made in business practice. A discussion will be made of the initial Return on Investment and ongoing support requirements.
Computational geometry column 37
Authors: Erik D. Demaine, Joseph O'Rourke
Venue: ACM SIGACT News (1999)

Open problems from the 15th Annual ACM Symposium on Computational Geometry.
Improving the dependability of network management systems
Authors: Elias Procópio Duarte
Venue: International Journal of Network Management (1998)

As computer networks expand, there is a pressing need for management systems capable of handling errors. This article proposes an approach based on management proxies to improve the dependability of fault management systems. An effective MIB to implement the proxies is presented, which allows their deployment at virtually no cost. As an example, a case study of a WAN is carried out. &copy; 1998 John Wiley & Sons, Ltd.
Classroom Note: On Particular Solutions of Linear Difference Equations with Constant Coefficients
Authors: Ramesh C. Gupta
Venue: SIAM Review (1998)

This note contains a recursive alternative to the method of undetermined coefficients for a particular solution of a linear difference equation with constant coefficients. Versatility of the same has been illustrated by solving some equations.
Molecular diversity (abstract only): strategies and concerns
Authors: Yvonne C. Martin, Mark G. Bures
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

Automation has produced the opportunity to test hundreds of thousands of compounds in a biological test. The challenge of the computational chemist is to select, from the 10180 possible drug-like molecules, those that are most attractive for screening, those that could form the basis of a medicinal chemistry program. Early work focused on selecting diverse compounds, leading to the question of how similar compounds must be in order for them to have similar biological activity. The issue, of course, is how to quantitate the similarity&mdash;which molecular descriptors and which similarity calculation provide the best result. More recent work has emphasized the consideration of physical properties to eliminate compounds, with the challenge of finding accurate and comprehensive methods to calculate these properties.
Maximum Norm Error Estimators for Three-Dimensional Elliptic Problems
Authors: E. Dari, R. G. Durán, C. Padra
Venue: SIAM Journal on Numerical Analysis (1999)

In this paper we define an a posteriori error estimator for finite element approximations of 3-d elliptic problems. We prove that the estimator is equivalent, up to logarithmic factors of the meshsize, to the maximum norm of the error. The results are valid for an arbitrary polyhedral domain and rather general meshes. We also obtain analogous results for the nonconforming method of Crouzeix--Raviart. Finally, we present some numerical results comparing adaptive procedures based on controlling the error in different norms.
A Method for Designing a Deterministic Test Pattern Generator Based on Cellular Automata
Authors: María José López, Mar Martínez, Salvador Bracho
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents a new approach for designing a built-in test pattern generator based on cellular automata (CA). Given a set of precomputed test patterns, a test pattern generator is synthesized to apply the given test set in a minimal test time. The CA design is based on a novel matrix representation method that permits the use of the complete rule space and not only the additive rules. A synthesis tool has been developed to implement this design method. This synthesis tool provides a VHDL description of the resultant generator, which facilitates its integration into other VLSI design tools. This design technique has been applied to the combinational ISCAS benchmark circuits providing good results in terms of design time, performance and test time required by the generator.
An approach to the formal verification of the two-party cryptographic protocols
Authors: Yuqing Zhang, Jihong Li, Guozhen Xiao
Venue: ACM SIGOPS Operating Systems Review (1999)

A general method, which can be used to verify the two-party cryptographic protocols, is present in this paper. Our approach makes use of running modes of the two-party cryptographic protocols to analyze the protocols. Based on this method, the verification of the protocols becomes independent of model checking tools. Finally, this approach is illustrated with an example on the Needham-Schroeder public-key protocol.
√3-subdivision
Authors: Leif Kobbelt
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

A new stationary subdivision scheme is presented which performs slower topological refinement than the usual dyadic split operation. The number of triangles increases in every step by a factor of 3 instead of 4. Applying the subdivision operator twice causes a uniform refinement with tri-section of every original edge (hence the name &radic;3-subdivision) while two dyadic splits would quad-sect every original edge. Besides the finer gradation of the hierarchy levels, the new scheme has several important properties: The stencils for the subdivision rules have minimum size and maximum symmetry. The smoothness of the limit surface is C2 everywhere except for the extraordinary points where it is C1. The convergence analysis of the scheme is presented based on a new general technique which also applies to the analysis of other subdivision schemes. The new splitting operation enables locally adaptive refinement under built-in preservation of the mesh consistency without temporary crack-fixing between neighboring faces from different refinement levels. The size of the surrounding mesh area which is affected by selective refinement is smaller than for the dyadic split operation. We further present a simple extension of the new subdivision scheme which makes it applicable to meshes with boundary and allows us to generate sharp feature lines.
Cache-conscious structure definition
Authors: Trishul M. Chilimbi, Bob Davidson, James R. Larus
Venue: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation (1999)

A program's cache performance can be improved by changing the organization and layout of its data---even complex, pointer-based data structures. Previous techniques improved the cache performance of these structures by arranging distinct instances to increase reference locality. These techniques produced significant performance improvements, but worked best for small structures that could be packed into a cache block.This paper extends that work by concentrating on the internal organization of fields in a data structure. It describes two techniques---structure splitting and field reordering---that improve the cache behavior of structures larger than a cache block. For structures comparable in size to a cache block, structure splitting can increase the number of hot fields that can be placed in a cache block. In five Java programs, structure splitting reduced cache miss rates 10--27% and improved performance 6--18% beyond the benefits of previously described cache-conscious reorganization techniques.For large structures, which span many cache blocks, reordering fields, to place those with high temporal affinity in the same cache block can also improve cache utilization. This paper describes bbcache, a tool that recommends C structure field reorderings. Preliminary measurements indicate that reordering fields in 5 active structures improves the performance of Microsoft SQL Server 7.0 2--3%.
The question of finitely many steps in polynomial ideal theory
Authors: Grete Hermann
Venue: ACM SIGSAM Bulletin (1998)

Grete Hermann's 1926 paper Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, which appears below in English translation, is an intriguing example of ideas before their time. While computational aspects of mathematics were more fashionable before the abstractions of the twentieth century took hold, mathematicians of that time certainly knew nothing of computers nor of today's idea of what an algorithm is. The significance of the paper can be found on the first page, where we find (in translation):The claim that a computation can be found in finitely many steps will mean here that an upper bound for the number of necessary operations for the computation can be specified. Thus it is not enough, for example, to suggest a procedure, for which it can be proved theoretically that it can be executed in finitely many operations, if no upper bound for the number of operations is known.The fact that the author requires an upper bound suggests that there must exist an actual procedure or algorithm for doing computations. We see in this paper the first examples of procedures (with upper bounds given) for a variety of computations in multivariate polynomial ideals. Thus we have here a paper anticipating by 39 years the birth of computer algebra (generally marked by Buchberger's invention of Gr ouml;bner bases in his 1965 Ph.D. thesis). The computational procedures which are presented in this paper include multivariate polynomial factorization, polynomial system solving, least common multiples, greatest common divisors, ideal quotients, divisibility of one ideal by another, fundamental ideals, norms, elementary divisor forms, associated prime ideals, primary decomposition, and isolated components. The statements of the theorems frequently end with "can be computed in finitely many steps". The proofs then outline the methods and compute the bounds. One would not at all expect a 1926 paper to contain optimal algorithms, but the fact that procedures for these computations even existed in 1926 make this paper worthy to be remembered.
Path toward future CAD environments for MEMS (embedded tutorial) (abstract only)
Authors: Gary K. Fedder, Tamal Mukherjee
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

As MEMS technology is inserted into more and more embedded systems, the drive to lower cost will push integration of digital and analog electronics with micromechanical sensors and actuators. There is a related market push to deliver reliable MEMS from concept to product with design cycle times comparable to mixed-signal ICs. The unique requirement of MEMS to integrate electronics with mechanics, electrostatics and other physical processes translates into new challenges and opportunities for CAD. Application engineers from industry and emerging MEMS CAD vendors are beginning to successfully blend traditional electronics IC CAD concepts with new tools tailored to MEMS. MEMS design requires simultaneous evaluation of system architecture to describe functionality, of device topology to describe geometric interactions, and of process flow to determine material properties and other mechanical characteristics. A handful of foundries now provide access to fixed MEMS processes that are capable of fabricating an important variety of systems. The foundries eliminate the need for custom process design and have motivated formation of hierarchical design methodologies and supporting representations that apply to a majority of MEMS applications and processes. Such a structured approach will lead to design reuse and core-based design of complex mixed-domain systems on a chip. In this tutorial, we will introduce design techniques for microelectromechanical devices and systems that are compatible with VLSI design methodologies. We will describe micromechanical design tools implemented in existing frameworks having links between physical form and function. Examples of inertial sensors and micromechanical filters will be used to demonstrate a design flow consisting of mixed electrical and mechanical schematic design entry, behavioral simulation using analog HDL, micromechanical layout synthesis, extraction and verification. We will highlight design issues specific to MEMS that have drive tool development, including mixed-domain modeling, device geometry, layout position, design rules and manufacturing variations. Our goal is to overview MEMS application areas, and enable CAD engineers to understand the primary issues involved in integrating MEMS design with traditional electronics design flows.
Robust ultra-low power sub-threshold DTMOS logic
Authors: Hendrawan Soeleman, Kaushik Roy, Bipul Paul
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Digital sub-threshold logic circuits have recently been proposed for applications in the ultra-low power end of the design spectrum, where the performance is of secondary importance. To improve switching performance of the sub-threshold logic family with comparable energy/switching, we propose the use of sub-DTMOS (sub-threshold Dynamic Threshold MOS) transistors. The stability of sub-threshold DTMOS logic to temperature and process variations eliminates the need of additional stabilization scheme that may be required for regular sub-threshold MOS logic families to ensure proper operation in the sub-threshold region.
A generic model for on-line learning
Authors: John Rosbottom, Jonathan Crellin, Dave Fysh
Venue: ACM SIGCSE Bulletin (2000)

We describe a generic model for on-line learning which has been used to develop a course unit in Computer Science, and to evaluate a course unit in Economics.The model may be used to produce a template for on-line learning resources. Alternatively a template developed intuitively by an experienced teacher may be evaluated using the generic model. Using these approaches both the model and the template may be refined.We also study the use of the model and templates as ways of disseminating web-based on-line learning among colleagues in Economics and Computer Science departments.
First-class views: a key to user-centered computing
Authors: Arnon Rosenthal, Edward Sciore
Venue: ACM SIGMOD Record (1999)

Large database systems (e.g., federations, warehouses) are multi-layer &mdash; i.e., a combination of base databases and (virtual or physical) view databases1. Smaller systems use views for layers that hide detailed physical and conceptual structures. We argue that most databases would be more effective if they were more user-centered &mdash; i.e., if they allowed users, administrators, and application developers to work mostly within their native view. To do so, we need first class views &mdash; views that support most of the metadata and operations available on source tables. First class views could also make multi-tier object architectures (based on objects in multiple tiers of servers) easier to build and maintain. The views modularize code for data services (e.g., query, security) and for coordinating changes with neighboring tiers. When data in each tier is derived declaratively, one can generate some of these methods semi-automatically. Much of the functionality required to support first class views can be generated semi-automatically, if the derivations between layers are declarative (e.g., SQL, rather than Java). We present a framework where propagation rules can be defined, allowing the flexible and incremental specification of view semantics, even by non-programmers. Finally, we describe research areas opened up by this approach.
Recursive Cube of Rings: A New Topology for Interconnection Networks
Authors: Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

In this paper, we introduce a family of scalable interconnection network topologies, named Recursive Cube of Rings (RCR), which are recursively constructed by adding ring edges to a cube. RCRs possess many desirable topological properties in building scalable parallel machines, such as fixed degree, small diameter, wide bisection width, symmetry, fault tolerance, etc. We first examine the topological properties of RCRs. We then present and analyze a general deadlock-free routing algorithm for RCRs. Using a complete binary tree embedded into an RCR with expansion-cost approximating to one, an efficient broadcast routing algorithm on RCRs is proposed. The upper bound of the number of message passing steps in one broadcast operation on a general RCR is also derived.
Consumer Opinions with Ancillary Hospital Services: Improving Service Delivery in Turkish Hospitals
Authors: Dilaver Tengilimoglu, Adnan Kisa, Sophia F. Dziegielewski
Venue: Journal of Medical Systems (1999)

This article reports the results of 2,045 consumer interviews conducted after discharge from seven major public and private hospitals in the country of Turkey. The direct measurement of consumer-satisfaction and utilization of this information to improve service delivery is a relatively new phenomena for this country. Based on postdischarge consumer interviews information on satisfaction of several ancillary hospital service variables was identified and inclusion for achieving overall consumer satisfaction is emphasized. Two critical areas were examined: ancillary staff and consumer relations and overall impressions of the comfort of the facility. Relationships and percentages within and among these variables are reported. Overall, the majority of the complaints noted by consumers were not related to direct treatment rather they focused on interactions with the hospital's staff and other services provided by the facility (e.g., comfort, cleanliness, parking, etc.). When comparing the different hospitals across these variables significant differences were noted at the .05 level between the seven different hospitals examined. Findings and recommendations from this study are presented to assist in providing a basis for the development of improved consumer satisfaction.