ppxscal/embedding_network huggingface dataset:
The Theory of Zero-Suppressed BDDs and the Number of Knight&lsquo;s Tours
Authors: Olaf Schröer, Ingo Wegener
Venue: Formal Methods in System Design (1998)

Zero-suppressed binary decision diagrams (ZBDDs) have been introduced by Minato [14&ndash;17] who presents applications for cube set representations, fault simulation, timing analysis and the n-queens problem. Here the structural properties of ZBDDs are worked out and a generic synthesis algorithm is presented and analyzed. It is proved that ZBDDs can be at most by a factor n + 1 smaller or larger than ordered BDDs (OBDDs) for the same function on n variables. Using ZBDDs the best known upper bound on the number of knight&lsquo;s tours on an 8 &times; 8 chessboard is improved significantly.
Optimal P/N width ratio selection for standard cell libraries
Authors: David S. Kung, Ruchir Puri
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

The effectiveness of logic synthesis to satisfy increasingly tight timing constraints in deep-submicron high-performance circuits heavily depends on the range and variety of logic gates available in the standard cell library. Primarily, research in the design of high-performance standard cell libraries has been focused on drive strength selection of various logic gates. Since CMOS logic circuit delays not only depend on the drive strength of each gate but also on its P/N width ratio, it is crucial to provide good P/N width ratios for cach cell. The main contribution of this paper is the development of a theoretical framework through which library designers can determine &ldquo;optimal&rdquo; P/N width ratio for each logic gate in their high-performance standard cell library. This theoretical framework utilizes new gate delay models that explicitly represent the dependence of delay on P/N width ratio and load. These delay models yield highly accurate delay for CMOS gates in a 0.12&mgr;m Leff deep-submicron technology.
Performance estimation for embedded systems with data and control dependencies
Authors: Paul Pop, Petru Els, Zebo Peng
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

In this paper we present an approach to performance estimation for hard real-time systems. We consider architectures consisting of multiple processors. The scheduling policy is based on a preemptive strategy with static priorities. Our model of the system captures both data and control dependencies, and the analysis is able to reduce the pessimism of the estimation by using the knowledge about these dependencies. Extensive experiments as well as a real life example demonstrate the efficiency of our approach.
Hierarchical Discriminant Analysis for Image Retrieval
Authors: Daniel L. Swets, Juyang Weng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

A self-organizing framework for object recognition is described. We describe a hierarchical database structure for image retrieval. The Self-Organizing Hierarchical Optimal Subspace Learning and Inference Framework (SHOSLIF) system uses the theories of optimal linear projection for automatic optimal feature derivation and a hierarchical structure to achieve a logarithmic retrieval complexity. A Space-Tessellation Tree is automatically generated using the Most Expressive Features (MEFs) and the Most Discriminating Features (MDFs) at each level of the tree. The major characteristics of the proposed hierarchical discriminant analysis include: 1) avoiding the limitation of global linear features (hyperplanes as separators) by deriving a recursively better-fitted set of features for each of the recursively subdivided sets of training samples; 2) generating a smaller tree whose cell boundaries separate the samples along the class boundaries better than the principal component analysis, thereby giving a better generalization capability (i.e., better recognition rate in a disjoint test); 3) accelerating the retrieval using a tree structure for data pruning, utilizing a different set of discriminant features at each level of the tree. We allow for perturbations in the size and position of objects in the images through learning. We demonstrate the technique on a large image database of widely varying real-world objects taken in natural settings, and show the applicability of the approach for variability in position, size, and 3D orientation. This paper concentrates on the hierarchical partitioning of the feature spaces.
Efficient incremental run-time specialization for free
Authors: Renaud Marlet, Charles Consel, Philippe Boinot
Venue: ACM SIGPLAN Notices (1999)

Availability of data in a program determines computation stages. Incremental partial evaluation exploit these stages for optimization: it allows further specialization to be performed as data become available at later stages. The fundamental advantage of incremental specialization is to factorize the specialization process. As a result, specializing a program at a given stage costs considerably less than specializing it once all the data are available.We present a realistic and flexible approach to achieve efficient incremental run-time specialization. Rather than developing specific techniques, as previously proposed, we are able to re-use existing technology by iterating a specialization process. Moreover, in doing so, we do not lose any specialization opportunities. This approach makes it possible to exploit nested quasi-invariants and to speed up the run-time specialization process.This approach has been implemented in Tempo, a specializer for C programs that is publicly available. A preliminary experiment confirm that incremental that incremental specialization can greatly speed up the specialization process.
Training e-commerce support personnel for enterprises through action learning
Authors: Kam Hou Vat
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

This paper describes an ongoing campus-based training experiment based on the Action Learning concept [24] to expose to undergraduate students majoring in Software Engineering, the increasing globalization of electronic commerce, so as to enable them to see through the quality required of today's Information and Communications Technologists (ICT). The experiment recruits students on a voluntary basis and covers training in the areas of WWW-based application development, and case studies of business models in electronic commerce. It is also expected that this experiment will lead to the development of special interest groups of students in the different technological and business aspects of the Internet-based organizations.
Workload characterization of a Web proxy in a cable modem environment
Authors: Martin Arlitt, Rich Friedrich, Tai Jin
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

This paper presents a detailed workload characterization study of a World-Wide Web proxy. Measurements from a proxy within an Internet Service Provider (ISP) environment were collected. This ISP allows clients to access the Web using high-speed cable modems rather than traditional dialup modems. By examining this site we are able to evaluate the effects that cable modems have on proxy workloads.This paper focuses on workload characteristics such as file type distribution, file size distribution, file referencing behaviour and turnover in the active set of files. We find that when presented with faster access speeds users are willing to download extremely large files. A widespread increase in the transfer of these large files would have a significant impact on the Web. This behaviour increases the importance of caching for ensuring the scalability of the Web.
Who wants to learn online?
Authors: Stuart Young, Ross Dewstow, Mae McSporran
Venue: ACM SIGCSE Bulletin (1999)

A study of how different demographic groups find the experience of flexible online learning. A first year course in Internet amp; Web Design is offered to a diverse range of students in traditional and online formats. We hope to draw conclusions about which groups find online learning works for them.
Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube
Authors: Josep Rifà
Venue: SIAM Journal on Discrete Mathematics (1999)

Binary 1-perfect codes which give rise to partitions of the n-cube are presented. The 1-perfect partitions are characterized as homomorphic images of simple algebraic structures on Fn and are constructed starting from a particular case of a structure defined in Fn .A special property (so-called well-ordering) of STS(n) is given in such a way that for this kind of STS it is possible to define the algebraic structure we need in Fn and to construct 1-perfect partitions of the n-cube.These 1-perfect partitions give us a kind of 1-perfect code for which it is easy to do the coding and decoding. Furthermore, there exists a syndrome which allows us to perform error correction. We present systematic codes of length n=15 and we give examples of how to do the coding, decoding, and error correction.
Critical Graphs for the Positive Definite Completion Problem
Authors: Wayne W. Barrett, Charles R. Johnson, Raphael Loewy
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Among various matrix completion problems that have been considered in recent years, the positive definite completion problem seems to have received the most attention. Indeed, in addition to being a problem of great interest, it is related to various applications as well as other completion problems. It may also be viewed as a fundamental problem in Euclidean geometry.A partial positive definite matrix A is "critical" if A has no positive definite completion, though every proper principal submatrix does. The graph G is called critical for the positive definite completion problem if there is a critical partial positive definite matrix A, the graph of whose specified entries is G. Complete analytical understanding of the general positive definite completion problem reduces to understanding the problem for critical graphs. Thus, it is important to try to characterize such graphs. The first, crucial step toward that understanding is taken here. A novel and restrictive topological graph theoretic condition necessary for criticality is identified. The condition, which may also be of interest on pure graph theoretic grounds, is also shown to be sufficient for criticality of graphs on fewer than 7 vertices, and the authors suspect it to be sufficient in general. In any event, the condition, which may be efficiently verified, dramatically narrows the class of graphs for which completability conditions on the specified data are needed. The concept of criticality and the graph theoretic condition extend to other completion problems, such as that for Euclidean distance matrices.
A novel codesign methodology for real-time embedded COTS multiprocessor-based signal processing systems
Authors: Randall S. Janka, Linda M. Wills
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

The process of designing large real-time embedded signal processing systems is plagued by a lack of coherent specification and design methodology (SDM). Powerful frameworks exist for each individual phase of this canonical design process, but no single methodology exists which enables these frameworks to work together coherently, i.e., allowing the output of a framework used in one phase to be consumed by a different framework used in the next phase. A specification and design methodology (SDM) known as &ldquo;Search-Explore-Refine&rdquo; (SER) was developed by Gajski, Vahid, et al. for an application and technology domain that is different from that of real-time embedded signal processing systems implemented with commercial-off-the-shelf multiprocessing hardware and software. However, due to similarities between the fundamental design objects of these two domains, a new SDM was developed and prototyped based on SER known as the MAGIC SDM. The &ldquo;tools and rules&rdquo; of the MAGIC SDM are presented. The MAGIC SDM achieves a high degree of model continuity based largely on its use of standards-based computation (VSIPL) and communication (MPI) middleware.
On the Computation of An
Authors: Saber N. Elaydi, William A. Harris,  Jr.
Venue: SIAM Review (1998)

Methods, which are based on the Cayley--Hamilton theorem, for the computation of An for nonsingular A are presented.
Real-time simulation of dust behavior generated by a fast traveling vehicle
Authors: Jim X. Chen, Xiadong Fu, J. Wegman
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1999)

Simulation of physically realistic complex dust behavior is very useful in training, education, art, advertising, and entertainment. There are no published models for real-time simulation of dust behavior generated by a traveling vehicle. In this paper, we use particle systems, computational fluid dynamics, and behavioral simulation techniques to simulate dust behavior in real time. First, we analyze the forces and factors that affect dust generation and the behavior after dust particles are generated. Then, we construct physically-based empirical models to generate dust particles and control the behavior accordingly. We further simplify the numerical calculations by dividing dust behavior into three stages, and establishing simplified particle system models for each stage. We employ motion blur, particle blending texture mapping, and other computer graphics techniques to achieve the final results. Our contributions include constructing physically-based empirical models to generate dust behavior and achieving simulation of the behavior in real time.
Backstepping Controller Design for Nonlinear Stochastic Systems Under a Risk-Sensitive Cost Criterion
Authors: Zigang Pan, Tamer Basar
Venue: SIAM Journal on Control and Optimization (1999)

This paper develops a methodology for recursive construction of optimal and near-optimal controllers for strict-feedback stochastic nonlinear systems under a risk-sensitive cost function criterion. The design procedure follows the integrator backstepping methodology, and the controllers obtained guarantee any desired achievable level of long-term average cost for a given risk-sensitivity parameter $\theta$. Furthermore, they lead to closed-loop system trajectories that are bounded in probability, and in some cases asymptotically stable in the large. These results also generalize to nonlinear systems with strongly stabilizable zero dynamics. A numerical example included in the paper illustrates the analytical results.
Business value of 3d virtual environments
Authors: Ludwin Fuchs, Steven Poltrock, Richard Wojcik
Venue: ACM SIGGROUP Bulletin (1998)

As a large geographically distributed company, Boeing needs integrated technologies that support, even encourage, working together across distances. As a foundation for working together, employees need to become acquainted with one another, form communities around shared interests, develop relationships, build trust, and communicate. Social networks are important within Boeing; people use these networks to find and fill openings in projects and programs. Project teams will more readily span geographic distances when social networks span distances.At Boeing Applied Research amp; Technology (AR amp;T) we have been investigating 3D virtual environments as support for geographically distributed teams, including support for social interactions. In this paper we outline potential business applications within large companies such as Boeing, and we describe our experiences with Boeing World, a corporate 3D environment based on the Active Worlds systems from Circle of Fire, Inc. (see http://www.activeworlds.com).
Analysis of Public Access Provisioning Requirements for Information Networks
Authors: Saad H. Bakry, Ibrahim A. al-Kadi
Venue: International Journal of Network Management (1996)

This article introduces mathematical analysis that interrelates the various factors associated with the problem of public demands on information networks and applies the developed analysis to a practical case study.
Robust Rotation Angle Estimator
Authors: Whoi-Yul Kim, Young-Sung Kim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

The conventional method of estimating the rotation angle of a pattern using the principal axes is not suitable for circular symmetric patterns since their eigenvalues are similar in both directions. In this paper, a new and robust method of estimating a rotation angle using the phase information of Zernike moments is presented. The experimental results show that the proposed method estimates the rotation angle of the circular symmetric patterns more accurately than the principal axes method, even in the presence of noise.
A framework for expressing and combining preferences
Authors: Rakesh Agrawal, Edward L. Wimmers
Venue: ACM SIGMOD Record (2000)

The advent of the World Wide Web has created an explosion in the available on-line information. As the range of potential choices expand, the time and effort required to sort through them also expands. We propose a formal framework for expressing and combining user preferences to address this problem. Preferences can be used to focus search queries and to order the search results. A preference is expressed by the user for an entity which is described by a set of named fields; each field can take on values from a certain type. The * symbol may be used to match any element of that type. A set of preferences can be combined using a generic combine operator which is instantiated with a value function, thus providing a great deal of flexibility. Same preferences can be combined in more than one way and a combination of preferences yields another preference thus providing the closure property. We demonstrate the power of our framework by illustrating how a currently popular personalization system and a real-life application can be realized as special cases of our framework. We also discuss implementation of the framework in a relational setting.
A Scale-Space Medialness Transform Based on Boundary Concordance Voting
Authors: Ming Xu, David Pycock
Venue: Journal of Mathematical Imaging and Vision (1999)

The Concordance-based Medial Axis Transform (CMAT) presented in this paper is a multiscale medial axis (MMA) algorithm that computes the medial response from grey-level boundary measures. This non-linear operator responds only to symmetric structures, overcoming the limitations of linear medial operators which create &ldquo;side-lobe&rdquo; responses for symmetric structures and respond to edge structures. In addition, the spatial localisation of the medial axis and the identification of object width is improved in the CMAT algorithm compared with linear algorithms. The robustness of linear medial operators to noise is preserved in our algorithm. The effectiveness of the CMAT is accredited to the concordance property described in this paper. We demonstrate the performance of this method with test figures used by other authors and medical images that are relatively complex in structure. In these complex images the benefit of the improved response of our non-linear operator is clearly visible.
Performance prediction of large parallel applications using parallel simulations
Authors: Rajive Bagrodia, Ewa Deeljman, Steven Docy, Thomas Phan
Venue: ACM SIGPLAN Notices (1999)

Accurate simulation of large parallel applications can be facilitated with the use of direct execution and parallel discrete event simulation. This paper describes the use of COMPASS, a direct execution-driven, parallel simulator for performance prediction of programs that include both communication and I/O intensive applications. The simulator has been used to predict the performance of such applications on both distributed memory machines like the IBM SP and shared-memory machines like the SGI Origin 2000. The paper illustrates the usefulness of COMPASS as a versatile performance prediction tool. We use both real-world applications and synthetic benchmarks to study application scalability, sensitivity to communication latency, and the interplay between factors like communication pattern and parallel file system caching on application performance. We also show that the simulator is accurate in its predictions and that it is also efficient in its ability to use parallel simulation to reduce its own execution time which, in some cases, has yielded a nearlinear speedup.
Secure internet access to SAP&rsquo;s R&ndash;3: keeping dragons out
Authors: Katherine Jones
Venue: International Journal of Network Management (1998)

The security of the networking environment is critical for today&rsquo;s corporations. Issues such as reliably identifying remote-access users, checking authorizations, data-transfer security and database security are of paramount importance. This article discusses a resolution of these problems for the R&sol;3 environment using CYBERSHIELD&dagger;. &copy; 1998 John Wiley & Sons, Ltd.
Nested Optimal \lambda-Packings and \lambda-Coveringsof Pairs with Triples
Authors: Nabil Shalaby, Jianxing Yin
Venue: Designs, Codes and Cryptography (1998)

We say that an optimal \la-packing ( \la-covering) of pairs with triples can be nested if it is possible to add one point to each block such that an optimal 2 \la-packing (2 \la-covering) of pairs with quadruples is obtained. A packing (covering) of order v can exist only if v \geq 4 and \lfloor v / 3 \lfloor \la(v - 1) / 2 \rfloor \rfloor = \lfloor v / 4 \lfloor 2\la(v - 1) / 3 \rfloor \rfloor ( \lceil v / 3 \lceil \la(v - 1) / 2\rceil \rceil = \lceil v / 4 \lceil 2\la (v - 1) / 3 \rceil \rceil ). It is shown in this paper that this condition is also sufficient, except possibly for v = 20.
Face and Contents Validity, and Feasibility of Healthometer: A Delphi Study
Authors: L. Spång, E. A. Thireos, C. Lionis, E. Trell
Venue: Journal of Medical Systems (1999)

Our recent descriptive report in this journal of &ldquo;Healthometer,&rdquo; an interactive instrument for self-mediated health counseling, was well received in the medical systems research and development community. Suitable for paper as well as electronic mediation and covering both screening, processing/storage, and advisory tasks in a positively reinforcing and confidential way, it has on the whole been considered to be an interesting model in the advancing &ldquo;information society technologies&rdquo; perspective&semi; however, a closer scientific and operative evaluation is warranted. Because the power of the instrument in addition to the hardware is critically dependent upon the wet- and software quality, the present study aims at examining in the same forefront forum some basic aspects of all these modalities, with emphasis on face and content validity, feasibility, and users' attitudes and opinions. It can be summarized, quite briefly, that all of them were satisfactory.