ppxscal/embedding_network huggingface dataset:
Sams Teach Yourself Game Programming in 24 Hours
Authors: Michael Morrison
Venue:  (2002)

:Sams Teach Yourself Game Programming in 24 Hours demystifies game programming by providing clear, practical lessons using C/C++, the industry standard in game programming. The book focuses on the Windows API to construct games for the Windows platform and discusses game theory, including double-buffered graphics, sprite animation, and digitized sound effects and music. A fully functional game engine provides readers with the ability to create their own future games.Author Biography: Michael Morrison is a writer and developer with extensive experience in game development. He authored the first book on game programming for Windows, a Java Internet programming game book, and other topics ranging from Java to MFC programming. Currently, Michael develops PocketPC games for his new company, Stalefish Labs. Some of his other titles include: Sams Teach Yourself XML in 24 Hours, Second Edition, 0-672-32213-7, Sams Publishing, $24.99, December 2001. Sams Teach Yourself Wireless Java Programming with J2ME, 0-672-32142-4, Sams Publishing, $39.99, June 2001.
How VSIA Answers the SOC Dilemma
Authors: Mark Birnbaum, Howard Sachs
Venue: Computer (1999)

System on chip opens the way for a multitude of electronics products not economically feasible before. SOC technology holds the key to increasingly complex applications by enabling high-performance, embedded processing solutions at a low, single-chip cost.Over the past two years, the Virtual Socket Interface Alliance development working groups have made great progress in defining the interface challenges, identifying the required functions, and recommending specific data formats and guidelines. As new developments take place in the SOC revolution, VSIA continues to play a critical role in fostering various pilot projects and adoption activities that encourage industry to try out and gradually adopt specifications for interoperable virtual components. These efforts are laying the groundwork to speed the development of emerging standards that will unleash the SOC potential, eventually benefiting the entire industry.
On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems
Authors: Sha Guo, Wei Sun, Mark A. Weiss
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Satisfiability, equivalence, and implication problems involving conjunctive queries are important and widely encountered problems in database management systems. These problems need to be efficiently and effectively solved. In this paper, we consider queries which are conjunctions of the inequalities of the form (XopC), (XopY), and/or (XopY + C), where X and Y are two attributes, C is a constant, and op¿ {, ¿}. These types of inequalities are widely used in database systems, since the first type is a selection, the second type is a ¿-join, and the third type is a very popular clause in a deductive database system. The satisfiability, equivalence, and implication problems in the integer domain (for attributes and constants) have been shown to be NP-hard [20], [24]. However, we show that these problems can be solved efficiently in the real domain. The incorporation of the real domain is significant, because the real domain is practically and widely used in a database. Necessary and sufficient conditions and algorithms are presented. A novel concept of the "modulo closure" and a set of sound and complete axioms with respect to the "modulo closure" are also proposed to infer all correct and necessary inequalities from a given query. The proposed axioms generalize Ullman's axioms [27] where queries only consist of ¿-joins.
Optimal regular volume sampling
Authors: Thomas Theußl, Torsten Möller, Meister Eduard Gröller
Venue: Proceedings of the conference on Visualization '01 (2001)

The classification of volumetric data sets as well as their rendering algorithms are typically based on the representation of the underlying grid. Grid structures based on a Cartesian lattice are the de-facto standard for regular representations of volumetric data. In this paper we introduce a more general concept of regular grids for the representation of volumetric data. We demonstrate that a specific type of regular lattice --- the so-called body-centered cubic --- is able to represent the same data set as a Cartesian grid to the same accuracy but with 29.3% fewer samples. This speeds up traditional volume rendering algorithms by the same ratio, which we demonstrate by adopting a splatting implementation for these new lattices. We investigate different filtering methods required for computing the normals on this lattice. The lattice representation results also in lossless compression ratios that are better than previously reported. Although other regular grid structures achieve the same sample efficiency, the body-centered cubic is particularly easy to use. The only assumption necessary is that the underlying volume is isotropic and band-limited - an assumption that is valid for most practical data sets.
Alternative Correctness Criteria for Concurrent Execution of Transactions in Multilevel Secure Databases
Authors: Vijayalakshmi Atluri, Sushil Jajodia, Elisa Bertino
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

This paper investigates issues related to transaction concurrency control in multilevel secure databases. It demonstrates how the conflicts between the correctness requirements and the secrecy requirements can be reconciled by proposing two different solutions. This paper, first, explores the correctness criteria that are weaker than one-copy serializability. Each of these weaker criteria, though not as strict as one-copy serializability, is required to preserve database consistency in some meaningful way, and moreover, its implementation does not require the scheduler to be trusted. It proposes three different, increasingly stricter notions of serializability¿level-wise serializability, one-item read serializability and pair-wise serializability¿that can serve as substitutes for one-copy serializability. This paper, then, investigates secure concurrency control protocols that generate one-copy serializable histories and presents a multiversion timestamping protocol that has several very desirable properties: It is secure, produces multiversion histories that are equivalent to serial one-copy histories in which transactions are placed in a timestamp order, eliminates starvation, and can be implemented using single-level untrusted schedulers.
Letter graphs and well-quasi-order by induced subgraphs
Authors: Marko Petkovsek
Venue: Discrete Mathematics (2002)

Given a word w over a finite alphabet and a set of ordered pairs of letters which define adjacencies, we construct a graph which we call the letter graph of w. The lettericity of a graph G is the least size of the alphabet permitting to obtain G as a letter graph. The set of 2-letter graphs consists of threshold graphs, unbounded-interval graphs, and their complements. We determine the lettericity of cycles and bound the lettericity of paths to an interval of length one. We show that the class of k-letter graphs is well-quasi-ordered by the induced subgraph relation, and that it has a finite set of minimal forbidden induced subgraphs. As a consequence, k-letter graphs can be recognized in polynomial time for any fixed k.
Using Card Sorts to Elicit Web Page Quality Attributes
Authors: Linda Upchurch, Gordon Rugg, Barbara Kitchenham
Venue: IEEE Software (2001)

The Internet's rapid expansion has given rise to a new set of problems that require new ways to measure and evaluate Web pages. Although numerous guidelines for Web site design have been published, no recognized standards have been set for assessing Web page quality. Card sorts are a good way to obtain quality attributes and measures from respondents without measurement expertise.
Incremental Implementation Model for Relational Databases with Transaction Time
Authors: C. S. Jensen, L. Mark, N. Roussopoulos
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

An implementation model for the standard relational data model extended with transaction time is presented. The implementation model integrates techniques of view materialization, differential computation, and deferred update into a coherent whole. It is capable of storing any view (reflecting past or present states) and subsequently using stored views as outsets for incremental and decremental computations of requested views, making it more flexible than previously proposed partitioned storage models. The working and the expressiveness of the model are demonstrated by sample queries that show how historical data are retrieved.
Locating Objects in Mobile Computing
Authors: Evaggelia Pitoura, George Samaras
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In current distributed systems, the notion of mobility is emerging in many forms and applications. Mobility arises naturally in wireless computing since the location of users changes as they move. Besides mobility in wireless computing, software mobile agents are another popular form of moving objects. Locating objects, i.e., identifying their current location, is central to mobile computing. In this paper, we present a comprehensive survey of the various approaches to the problem of storing, querying, and updating the location of objects in mobile computing. The fundamental techniques underlying the proposed approaches are identified, analyzed, and classified along various dimensions.
Walk-Time Techniques: Catalyst for Architectural Change
Authors: Joseph A. Fisher
Venue: Computer (1997)

A quantum leap in a compiler's ability to automatically extract parallelism from code would have enormous ramifications for future architectures, although the issue of compatibility with legacy software also hinders architectural innovation. The author describes walk-time techniques-translation techniques that change code after it is distributed. He contends that these techniques will lead to families of very different, yet surprisingly compatible, CPUs that are customized to specific application areas.
Detour: Informed Internet Routing and Transport
Authors: Stefan Savage, Thomas Anderson, Amit Aggarwal, David Becker, Neal Cardwell, Andy Collins, Eric Hoffman, John Snell, Amin Vahdat, Geoff Voelker, John Zahorjan
Venue: IEEE Micro (1999)

Despite its obvious success, robustness, and scalability, the Internet suffers from a number of end-to-end performance and availability problems. In this paper, we attempt to quantify the Internet's inefficiencies and then we argue that Internet behavior can be improved by spreading intelligent routers at key access and interchange points to actively manage traffic. Our Detour prototype aims to demonstrate practical benefits to end users, without penalizing non-Detour users, by aggregating traffic information across connections and using more efficient routes to improve Internet performance.
A Value System for Switch-Level Modeling
Authors: Steven P. Smith, Ramon D. Acosta
Venue: IEEE Design Test (1990)

An approach to switch modeling that provides an excellent compromise between accuracy and performance and requires only minor modifications to basic gate-level simulators is described. The evaluation technique is fully compatible with the VHDL (VHSIC hardware description language) specification. Switch and node models are implemented as primitive elements to achieve maximum performance, but models could also be implemented entirely in VHDL source code. MCC has successfully run the VHDL system based on this approach on a variety of test circuits, and it is now in general release. The model and its integration with a VHDL simulator are discussed, a design example is presented, and some refinements to the switch model are described.
Co-Minkowski spaces, their reflection structure and K-loops
Authors: L. Giuzzi, H. Karzel
Venue: Discrete Mathematics (2002)

In this work an infinite family of K-loops is constructed from the reflection structure of co-Minkowski planes and their properties are analysed.
A Trusted Subject Architecture for Multilevel Secure Object-Oriented Databases
Authors: Roshan K. Thomas, Ravi S. Sandhu
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this paper, we address security in object-oriented database systems for multilevel secure environments. Such an environment consists of users cleared to various security levels, accessing information labeled with varying classifications. Our purpose is three-fold. First, we show how security can be naturally incorporated into the object model of computing so as to form a foundation for building multilevel secure object-oriented database management systems. Next, we show how such an abstract security model can be realized under a cost-effective, viable, and popular security architecture. Finally, we give security arguments based on trusted subjects and a formal proof to demonstrate the confidentiality of our architecture and approach.A notable feature of our solution is the support for secure synchronous write-up operations. This is useful when low level users want to send information to higher level users. In the object-oriented context, this is naturally modeled and efficiently accomplished through write-up messages sent by low level subjects. However, such write-up messages can pose confidentiality leaks (through timing and signaling channels) if the timing of the receipt and processing of the messages is observable to lower level senders. Such covert channels are a formidable obstacle in building high-assurance secure systems. Further, solutions to problems such as these have been known to involve various tradeoffs between confidentiality, integrity, and performance. We present a concurrent computation model that closes such channels while preserving the conflicting goals of confidentiality, integrity, and performance. Finally, we give a confidentiality proof for a trusted subject architecture and implementation and demonstrate that the trusted subject (process) cannot leak information in violation of multilevel security.
Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors
Authors: M. K. Yang, C. R. Das
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We propose and evaluate a parallel "decomposite best-first" search branch-and-boundalgorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilisticmodel to estimate the number of evaluated nodes for a serial best-first searchbranch-and-bound algorithm. This analysis is used in predicting the parallel algorithmspeed-up. The proposed algorithm initially decomposes a problem into N subproblems,where N is the number of processors available in a multiprocessor. Afterwards, eachprocessor executes the serial best-first search to find a local feasible solution. Localsolutions are broadcasted through the network to compute the final solution. Aconflict-free mapping scheme, known as the step-by-step spread, is used for subproblemdistribution on the MIN. A speedup expression for the parallel algorithm is then derivedusing the serial best-first search node evaluation model. Our analysis considers bothcomputation and communication overheads for providing realistic speed-up.Communication modeling is also extended for the parallel global best-first searchtechnique. All the analytical results are validated via simulation. For large systems, whencommunication overhead is taken into consideration, it is observed that the paralleldecomposite best-first search algorithm provides better speed-up compared to otherreported schemes.
A Group-Theoretic Construction with Spatiotemporal Wavelets for the Analysis of Rotational Motion
Authors: Jean-Pierre Leduc
Venue: Journal of Mathematical Imaging and Vision (2002)

This paper presents a group-theoretic approach for the analysis of rotational motion in image sequences. This method relies on Lie algebras, Lie groups and Lie group representations to provide not only the continuous wavelets but also the related tools of harmonic analysis. This approach can be referred to research works presented in J.S. Byrnes et al. (Wavelets and their Applications, Kluwer Academic Publishers, 1994) who strongly influenced this topic. For the purpose of modeling motion transformations, this paper introduces the concepts of Lie algebras and Lie groups as the actual mathematical foundations of all the observable kinematics embedded in spatio-temporal signals. Rotational motion analysis focuses on the estimation of angular velocity and angular accelerations embedded in image sequences. Rotational motion is usually carried on a trajectory, the complete problem at hand consists in estimating not only the angular velocity and its temporal derivatives but also the position, the translational velocity and its temporal derivatives along the carrier trajectory. The paper starts with the usual affine and Galilei groups and proceeds by successive extensions and sections to the rotational group. The theory of group representations is central to provide families of continuous wavelets, special functions, PDE's, ODE's and integral transforms as new mathematical tools of motion analysis in image sequence to perform optimal and selective detection, estimations, tracking, and reconstructions. This paper defines rotational wavelets and proposes a structured approach to perform estimation and tracking in image sequences which fits to Kalman filters. Simulations on real digital image sequences are also presented with tracking and estimation.
Nonexistence of Riemann solutions for a quadratic model deriving from petroleum engineering
Authors: Suncica Canić
Venue: Nonlinear Analysis: Real World Applications (2002)

The study presented in this work shows that the viscous profile entropy criterion is too selective in reducing the number of solutions to guarantee existence of stable weak self-similar Riemann solutions to conservation laws. This result is shown on a particular quadratic model derived from the three-phase flow equations used in petroleum engineering. The viscosity matrix considered in this work derives from capillary pressures. The Riemann initial data are hyperbolic and correspond to a Lax 1-shock that does not admit a viscous profile. The nonexistence of a profile in this example is due to the presence of a limit cycle in the vector field associated with the viscous profile entropy criterion.To establish the main result of this work, a complete list of possibilities that could lead to a solution, is examined. This list includes solutions that consist of only classical waves and the solutions that contain at least one nonclassical (shock) wave. The construction of solutions breaks down because either the shock waves do not satisfy the viscous entropy criterion or the speeds of the waves that comprise a solution are decreasing. To the author's knowledge, this is the first result on nonexistence of stable solutions for models that allow nonclassical (transitional) shock waves.The results presented in this paper are a combination of analytical and numerical work. The theoretical ideas and techniques derive from the bifurcation theory of vector fields and the theory of weak solutions of conservation laws. These are combined with numerical results when no theory is available.
Maximum entropy-based optimal threshold selection using deterministic reinforcement learning with controlled randomization
Authors: Peng-Yeng Yin
Venue: Signal Processing (2002)

Traditional maximum entropy-based thresholding methods are very popular and efficient in the case of bilevel thresholding. But they are very computationally expensive when extended to multilevel thresholding since the inevitable exhaustive search of optimal thresholds needed to maximize the posterior entropy. In this paper, a reinforcement learning (RL) approach is proposed for the maximum entropy thresholding. We show that finding the optimal thresholds using the maximum entropy criterion is equivalent to learning an optimal policy of the RL problem. Therefore, the powerful Q-learning algorithm, which is widely used in RL, can be employed to eradicate the computation burden of the maximum entropy-based thresholding methods. The experimental results show that the proposed method is suitable in the case of multilevel thresholding and the performance is better than that of the genetic algorithm-based entropy thresholding method.
Computoons: The Evolving Image of Computers in Cartoons
Authors: Fritz H. Grupe
Venue: Computer (1996)

Are computers displacing people? Are they more capable than us? . . . more efficient? These questions have discomfited many people since the emergence of ENIAC in the 1940s. Cartoonists, with their long tradition of poking fun at our foibles, soon pounced on this new phenomenon, lampooning and satirizing our responses to "intelligent machines." The "computoon" was born. An examination of computoons published from 1940 to the present reveals several continuing themes: computer pretensions, a concern for computer accuracy, and the evolving nature of robots. Cartoonists have used many situations to ponder the question of whether computers--and especially robots--are similar enough to humans that we should view them as competitors for what we see as our exalted position in the scheme of things. And machines as pretenders to the throne can be portrayed whimsically or with varying degrees of paranoia. Of course, computoon themes have numerous subthemes. Around 1970, these subthemes began to change, with some fading and others becoming dominant. As more people--cartoonists included--started interacting with computers, the concerns in computoons became more specific, and technical jargon made its way into the mainstream. Gradually, the computer became part of the landscape, a common fixture in cartoons and not necessarily essential to the joke. Although intelligent machines have now become indispensable partners in many facets of our lives, for many people the relationship is uneasy. As long as technology continues to run ahead of our ability to adapt, cartoonists will find humor, absurdity, and pathos in our efforts to keep pace.
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
Authors: O. Günther, J. Bilmes
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Experiences with the implementation of the cell tree dynamic access method for spatial databases are reported, and the results of an experimental performance comparison with the R-tree of A. Guttman (1984) and with the R-tree of T. Sellis et al. (1987) are given. Cell tree design and implementation are discussed. Although the cell tree often requires more storage space and more CPU time to answer a search query, it usually obtains the results with a lower number of disk accesses than the two rival structures.
Leaving Kansas
Authors: Grady Booch
Venue: IEEE Software (1998)

Ed is absolutely right: these are the best of times and the worst of times for the software industry. Indeed, if you are part of any one of the many new software companies that have sprung up of late and are madly burning through Other People's Money without a worry of posting a profit anytime this millennium, all the while unfettered by any silly requirements for backward compatibility to existing operations, then the future looks quite pleasant. However, for software developers at established organizations, caught in the cross-fire of the language wars, the operating system wars, the platform wars, the middle-ware wars, and the browser wars, laboring to push yet another release out the door under compressed schedules, weighed down by the millstone of legacy code, and torn asunder by the ravages of ill-conceived and ever-changing requirements, then the future looks grim-to put it mildly. Modesty prevents me from using the adjectives most commonly applied by developers toiling under such circumstances. Being among those inside the tornado, as was Dorothy, I prefer to think of these times as, well, "interesting."