ppxscal/embedding_network huggingface dataset:
Protecting Digital Content within the Home
Authors: C. Brendan S. Traw
Venue: Computer (2001)

Home users increasingly use digital media to access, store, and display music, movies, and other entertainment content. This trend represents both new business opportunities and risks for content creators and distributors. These risks are magnified for digital content compared with its analog predecessors because of digital reproduction's lossless nature. Further, the widespread availability of digital copying devices and the Internet gives rise to widespread, unauthorized distribution of content using applications and services such as Napster.Licensing and technological mechanisms provide a potent combination for preventing circumvention of content-protection systems while still accommodating consumer practices.Technical protection mechanisms are effective for preventing unsophisticated attempts to circumvent a particular content-protection technology that individuals typically perform. Conversely, licensing and other legal mechanisms work much better for protecting content against misuse by business entities with assets, employees, and distribution channels.A combination of technology and licensing can build a chain of solutions that effectively protect content as users transfer, store, and consume it on entertainment devices within the home.
Vanishing Point Detection by Line Clustering
Authors: G. f. McLean, D. Kotturi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents a new method for the detection of vanishing points based on sub-pixel line descriptions which recognizes the existence of errors in feature detection and which does not rely on supervision or the arbitrary specification of thresholds. Image processing and image analysis are integrated into a coherent scheme which extracts straight line structure from images, develops a measure of line quality for each line, estimates the number of vanishing points and their approximate orientations, and then computes optimal vanishing point estimates through combined clustering and numerical optimization. Both qualitative and quantitative evaluation of the algorithms performance is included in the presentation.
Association schemes generated by a non-symmetric relation of valency 2
Authors: M. Hirasaka, M. Muzychuk
Venue: Discrete Mathematics (2002)

We give some observations on association schemes with a relation of valency 2 from the representation theory of Bose-Mesner algebras and the basic structure theory. One of the applications of these observations is the classification of the association schemes with a nonsymmetric relation of valency 2 if the cardinality of the point set is a product of two primes, and another is the proof of Li's conjecture that any finite simple group is a connected 2-DCI-group.
Microsoft Office 97: Introductory Concepts and Techniques, 10th edition
Authors: Shelly Cashman Vermaat, Thomas J. Cashman, Misty E. Vermaat
Venue:  (1998)

:Part of the highly successful Shelly Cashman Series, this brief text offers a screen-by-screen, step-by-step approach to learning basic Microsoft Office 97 skills.
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
Authors: M. S. Chen, K. G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages byway of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.
An Efficient Signature Computation Method
Authors: Kewal K. Saluja, Chin-Foo See
Venue: IEEE Design Test (1992)

A signature generation algorithm for linear-feedback shift register (LFSR)-based compactors used in fault simulation of built-in self-test digital circuits is presented. The algorithm uses small- to medium-size lookup tables to generate signatures for internal as well as external exclusive-OR LFSRs of any length. The basic concept can be extended to general linear compactors. Algorithms that convert signatures from one form of LFSR to the other are also presented.
PICO: Automatically Designing Custom Computers
Authors: Vinod Kathail, Shail Aditya, Robert Schreiber, B. Ramakrishna Rau, Darren C. Cronquist, Mukund Sivaraman
Venue: Computer (2002)

The PICO (program in, chip out) project is a long-range HP Labs research effort that aims to automate the design of optimized, application-specific computing systemsýthus enabling the rapid and cost-effective design of custom chips when no adequately specialized, off-the-shelf design is available. PICO research takes a systematic approach to the hierarchical design of complex systems and advances technologies for automatically designing custom nonprogrammable accelerators and VLIW processors. While skeptics often assume that automated design must emulate human designers who invent newsolutions to problems, PICO's approach is to automatically pick the most suitable designs from a well-engineered space of designs. Such automation of embedded computer design promises an era of yetmore growth in the number and variety of innovative smart products by lowering the barriers of design time, designer availability, and design cost.
Methods for Solving Systems of Nonlinear Equations
Authors: Werner C. Rheinboldt
Venue:  (1974)

:This second edition provides much-needed updates to the original volume. Like the first edition, it emphasizes the ideas behind the algorithms as well as their theoretical foundations and properties, rather than focusing strictly on computational details; at the same time, this new version is now largely self-contained and includes essential proofs. Applied scientists will find this new edition most useful.
Performance of B±Trees with Partial Expansions
Authors: R. A. Baeza-Yates, P. -A. Larson
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors mathematically analyze the behavior of B/sup trees with partial expansions file structure under random insertions, focusing on the expected storage utilization and the expected cost of insertions. The model can be used for studying both the asymptotic and dynamic behavior. The accuracy of the model is confirmed by simulation. Disk space management is found to be more difficult than for standard B/sup trees. Two simple space-management schemes specifically designed for handling buckets of two different sizes are investigated. It is found that an overall storage utilization of 81% can be achieved in practice.
A tabu-search based algorithm for the multicast-streams distribution problem
Authors: Wen-Lin Yang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2002)

Consider a video library system on campus, there are usually many classes demanding on the same and/or different educational video programs provided by the video server at the beginning of a session. A near video on demand system with multicast communication technology would be a proper implementation for this video library system. As a multicast stream carries one video program, more than one multicast streams may flow on the network simultaneously. At the network resource reservation step, however, it is possible that the link bandwidths are not large enough to accommodate all the multicast streams if we allocate link bandwidths to each multicast stream one at a time. As a result, some clients cannot be served because of the lack of link bandwidths. Hence, it is important to learn how to utilize these limited bandwidths more efficiently by taking all the multicast streams into consideration altogether, such that the number of clients is served as large as possible. In the past, a branch-and-bound based heuristic algorithm has been proposed. However, this algorithm is not stable and only efficient for a small-scale video library system.In this study, we propose a tabu-search based algorithm to solve this multicast-streams distribution problem. For the acyclic digraphs and general digraphs with simple cycles, the experimental results show that the approximation solutions found by our method are very close to the exact solutions obtained by the branch-and-bound based algorithm. As for the executing performance, our approach is shown to be much more stable and efficient than the branch-and-bound based algorithm. Hence, the procedure proposed in this paper is a practical and highly effective procedure for the problem.
Evaluating Training Data Suitability for Decision Tree Induction
Authors: Kati Viikki, Martti Juhola, Ilmar Pyykkö, Pekka Honkavaara
Venue: Journal of Medical Systems (2001)

Dcision tree induction, as well as other inductive learning methods, requires training data of high quality to be able to generate accurate and reliable classification models. Example cases should form a representative sample from the application area, and the attributes used to describe example cases should be relevant and adequate for the classification task to be solved. In this paper, measures of the strength of association and an entropy-based approach have been used to assess the quality of the training data. Studied classification tasks related to three otological data sets: a conscript data set, a vertigo data set, and a postoperative nausea and vomiting data set. The pape suggests that the studied approaches give some guidelines about the quality of the training data, but other approaches are also needed to guide training data building.
Modeling Concurrent Software
Authors: Bo I. Sanden
Venue: IEEE Software (1997)

The author proposes a disciplined multitasking method, entity-life modeling, which may provide a more direct and efficient approach to concurrent computing. He then shows how this method could apply to an automated control system.
Web Development: Estimating Quick-to-Market Software
Authors: Donald J. Reifer
Venue: IEEE Software (2000)

Developers can use a new sizing metric called Web Objects and an adaptation of the Cocomo II model called WebMo to more accurately estimate Web-based software development effort and duration.
On Dependability Evaluation of Mesh-Connected Processors
Authors: Chita R. Das, Prasant Mohapatra
Venue: IEEE Transactions on Computers (1995)

Analytical techniques for reliability and availability prediction of mesh-connected systems are proposed in this paper. The models are based on the submesh requirements. First, a reliability model is proposed assuming that a submesh can be always recognized if it exits. Analysis of the linear consecutive n-out-of-N system is extended using an expanding row/column technique to evaluate the submesh reliability. An alternative approach called row folding is also discussed. Due to the high complexity involved in computing the exact reliability, both of these techniques use approximation to estimate lower bounds. Next, the submesh reliability is computed based on two different allocation policies, known as the two-dimensional buddy system (TDBS), and the frame sliding (FS). The model with the TDBS is further extended to estimate the reliability of multiple working submeshes, which is useful in a multiuser environment. Availability analysis for a submesh of the required size is conducted using a Markov chain (MC). State truncation is used to reduce the computation time, and the MC is solved using a software package called HARP. Validation of the analytical models is done through extensive simulation. Issues, such as reliability comparison based on allocation policies, and methods for improving system reliability are addressed using the analytical models.
Understand Quicksort with DDD
Authors: Adam Monsen
Venue: Linux Journal (2003)

Improve your mind with an elegant, historic algorithm and your productivity with a powerful GUI debugging tool.
Allaire Spectra E-Business Construction Kit with Cdrom
Authors: Ben Forta, Raymond Camden, Gerry Libertelli
Venue:  (2000)

:Allaire Spectra E-Business Construction Kit teaches Allaire Spectra development from the ground up, primarily from the viewpoint of developers and administrators. This book is divided into multiple sections, starting with high-level concepts and moving on to planning and building an application. Throughout the book, you are presented with not just technical information but also the best practices and business methodologies and how to implement them. Learn more than feature and language uselearn how to use Spectra's power to build real-world secure, scalable, and flexible business Web applications built atop innovative world-class technologies.
A New Direction for Computer Architecture Research
Authors: Christoforos E. Kozyrakis, David A. Patterson
Venue: Computer (1998)

In the past few years, two important trends have evolved that could change the shape of computing: multimedia applications and portable electronics. Together, these trends will lead to a personal mobile-computing environment, a small device carried all the time that incorporates the functions of the pager, cellular phone, laptop computer, PDA, digital camera, and video game. The microprocessor needed for these devices is actually a merged general-purpose processor and digital-signal processor, with the power budget of the latter. Yet for almost two decades, architecture research has focused on desktop or server machines. We are designing processors of the future with a heavy bias toward the past. To design successful processor architectures for the future, we first need to explore future applications and match their requirements in a scalable, cost-effective way. The authors describe Vector IRAM, an initial approach in this direction, and challenge others in the very successful computer architecture community to investigate architectures with a heavy bias for the future.
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes
Authors: M. Y. Chan, F. Chin
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors parallelize the embedding strategy for mapping any two-dimensional grid into its optimal hypercube with minimal dilation. The parallelization allows each hypercube node to independently determine, in constant time, which grid node it will simulate and the communication paths it will take to reach the hypercube nodes that simulate its grid-neighbors. The paths between grid-neighbors are chosen in such a way as to curb the congestion at each hypercube node and across each hypercube edge. Explicity, the node congestion for the embedding is at most 6, one above optimal, while the edge congestion is at most 5.
Parallel Computing in the Undergraduate Curriculum
Authors: Christopher H. Nevison
Venue: Computer (1995)

The author describes how parallel computing can be integrated into courses throughout the computer science undergraduate curriculum. First, he explains why parallel computing is important, observing that many large, computationally intensive problems are solved with parallel programs. He reasons that as the related areas of symmetric multiprocessing and distributed computing also become more important, practitioners will need to fully understand parallel computing. Next, he describes the current situation at most colleges and universities, noting that parallel computing is offered only as an upper-level elective. The author then describes how parallel computing can be integrated into each course. He begins with the introductory courses and continues with those on computer organization and computer architecture, operating systems, programming languages, theory of computation, standard algorithms, discrete event simulation, and numerical analysis. Finally, the author explains the requirements for successfully implementing this integrated approach.
The Status of Parallel Processing Education
Authors: Russ Miller
Venue: Computer (1994)

The IEEE Technical Committee on Parallel Processing (TCPP) was formed in 1992 to provide a forum for scientists and engineers throughout the world to exchange ideas on parallel processing. As part of its mission, the TCPP is concerned with establishing guidelines for parallel processing education. This report concentrates on developing the basis for such an undertaking by examining the status of parallelism in the post-secondary education process.
Tracking Highly Mobile Endpoints
Authors: Fabrice Tchakountio, Ram Ramanathan
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

We consider the problem of routing to endpoints with very high "effective" mobility, i.e., when the period between changes in an endpoint's location is comparable to the time it takes for the location tracking mechanism to converge. This could happen due to increased endpoint speed, decreased cell size, or increased control message latency. When this happens, conventional location tracking approaches fail -- by the time such mechanisms converge, the endpoint has already moved to a new location.We characterize the performance degradation of a location tracking mechanism with increasing effective mobility. Specifically, we show that a typical mobile network has three operating states -- reactable, late-reactable, and unreactable, and identify theoretically and experimentally, the endpoint speeds at which the system transitions from one state to another. We then describe "spray routing" -- a new routing mechanism that uses controlled multicasting to the vicinity of the endpoint's last-known location. We show experimentally that the throughput is dramatically increased to acceptable levels even for highly mobile endpoints while maintaining reasonable end-to-end delay.
Software Development on Internet Time
Authors: Michael A. Cusumano, David B. Yoffie
Venue: Computer (1999)

There is probably little debate that Internet software companies must use more flexible development techniques and introduce new products faster than companies with more stable technology, established customer needs, and longer product cycles. Internet and PC software firms favor a more flexible style. The basic idea is to give programmers the autonomy to evolve designs iteratively but to force team members to synchronize their work frequently and then periodically stabilize their design changes or feature innovations. Studying two companies, the authors found that Netscape was using a version of the Microsoft-style synchronize and stabilize process for PC software, but adapting it to build Internet browser and server products. They also found that Microsoft's Internet groups were modifying their standard process to increase development speed and flexibility. The goal was to balance flexibility and speed with professional engineering discipline.
A RISC Processor for Embedded Applications Within an ASIC
Authors: Charles E. Roberts
Venue: IEEE Micro (1991)

The VL86C010 processor, which is well suited to RISC applications because of its small die size, low power dissipation, and low pin count, is presented. This RISC processor family was designed for maximum system performance at minimum cost, rather than maximum CPU performance at any cost. The components of the system CPU, memory controller, IO controller, and video controller were partitioned to take advantage of less-expensive plastic IC packages and, more importantly, less-expensive dynamic RAM devices (DRAMs) by using their page mode of operation. These components are described, and the processor performance is examined.
Scalability versus execution time in scalable systems
Authors: Xian-He Sun
Venue: Journal of Parallel and Distributed Computing (2002)

Parallel programming is elusive. The relative performance of different parallel implementations varies with machine architecture, system and problem size. How to compare different implementations over a wide range of machine architectures and problem sizes has not been well addressed due to its difficulty. Scalability has been proposed in recent years to reveal scaling properties of parallel algorithms and machines. In this paper, the relation between scalability and execution time is carefully studied. The concepts of crossing point analysis and range comparison are introduced. Crossing point analysis finds slow/fast performance crossing points of parallel algorithms and machines. Range comparison compares performance over a wide range of ensemble and problem size via scalability and crossing point analysis. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP2 parallel computer. Experimental and theoretical results show how the combination of scalability, crossing point analysis, and range comparison provides a practical solution for scalable performance evaluation and prediction. While our testings are conducted on homogeneous parallel computers, the proposed methodology applies to heterogeneous and network computing as well.
Multiround Unconditionally Secure Authentication
Authors: Christian Gehrmann
Venue: Designs, Codes and Cryptography (1998)

Authentication codes are used to protect communication against a malicious adversary. In this paper we investigate unconditionally secure multiround authentication schemes. In a multiround scheme a message is authenticated by passing back and forth several codewords between the sender and receiver. We define a multiround authentication model and show how to calculate the probability of a successful attack for this model. We prove the security for a 3-round scheme and give a construction for the 3-round scheme based on Reed-Solomom codes. This construction has a very small key size for even extremely large messages. Furthermore, a secure scheme for an arbitrary number of rounds is given. We give a new upper bound for the keys size of an n-round scheme.
Load Distributing for Locally Distributed Systems
Authors: Niranjan G. Shivaratri, Phillip Krueger, Mukesh Singhal
Venue: Computer (1992)

The problem of judiciously and transparently redistributing the load of the system among its nodes so that overall performance is maximized is discussed. Several key issues in load distributing for general-purpose systems, including the motivations and design trade-offs for load-distributing algorithms, are reviewed. In addition, several load-distributing algorithms are described and their performances are compared. These algorithms are sender-initiated algorithms, receiver-initiated algorithms, symmetrically initiated algorithms, and adaptive algorithms. Load-distributing policies used in existing systems are examined, and conclusions about which algorithm might help in realizing the most benefits of load distributing are drawn.
Silicides for the 100-nm node and beyond: Co-silicide, Co(Ni)-silicide and Ni-silicide
Authors: A. Lauwers, M. de Potter, O. Chamirian, R. Lindsay, C. Demeurisse, C. Vrancken, K. Maex
Venue: Microelectronic Engineering (2002)

As scaling progresses, conventional Co/Ti silicidation is facing difficulties related to the nucleation of the low resistive Co-disilicide phase during the second RTP step of silicidation. When linewidths, junction depths and silicide thicknesses are being reduced, the RTP2 thermal process window narrows down rapidly. It is expected that the process window can be widened by alloying the Co film with Ni, because the presence of Ni lowers the nucleation barrier for the Co-disilicide phase. Replacing Co-disilicide by Ni-monosilicide is a promising alternative because the same silicide sheet resistance can be obtained with 35% less silicon consumption.