ppxscal/embedding_network huggingface dataset:
Computers for Twenty-First Century Educators, 6 edition
Authors: James Lockard, Peter Abrams
Venue:  (2003)

:This book is for any pre- or in-service educator who needs to become a competent user of computer technologies to support effective learning and provide technological leadership. This text provides a comprehensive discussion of electronic tools and related issues in educational technology. Its emphasis on practical application makes it easy for students to understand how to use the information in the classroom. New margin correlations to ISTE standards identify how the content relates to professional standards for educational technology. A new emphasis on web page creation reflects one of the most popular and useful technological pursuits for teachers.New to this EditionNEW! Completely revised chapter organization groups topics together for easy use.Revised Chapter 5 discusses desktop publishing with word processing to reflect the close relationship between the two tools.Updated and increased coverage of current issues such as the Internet, WWW, and related topics such as search engines and web browsers are integrated into Chapter 3.NEW! Margin icons identify clear connections to the ISTE student and teacher standards.Important new developments in technology such as digital audio and video editing and web page design have been integrated.Eliminated individual chapters on programming and languages, computer-managed instruction, artificial intelligence and integrated most important content into other chapters for better fit.
Service and connection management architecture for distributed multimedia applications
Authors: Choong Seon Hong, H. Abe, D. Kashiwa, Y. Matsushita
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper addresses a novel networking architecture model on DPE for various multimedia services suitable to high speed networks and for the flexible and rapid introduction of services. In this model, applications are assembled from software "building blocks" which cope with information service and network providers. Each building block provides a layered view, enabling the effective management of multimedia network resources and services according to the concept of TMN and TINA. In this paper, we also propose the use of a directory system and its naming structure for the management of user profiles and session profiles, and a control model of effective multimedia logical device objects that uses a stream process approach. Our model is implemented on a DPE platform that provides various transparencies. For the purpose of flexible service provision to users, this architecture presents ad hoc service building blocks such as a video on demand building block and a CSCW building block
Roll-forward error recovery in embedded real-time systems
Authors: Jie Xu, B. Randell
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Roll-forward checkpointing schemes are developed in order to avoid rollback in the presence of independent faults and to increase the possibility that a task completes within a tight deadline. However, despite of the adoption of roll-forward recovery, these schemes are not necessarily appropriate for time-critical applications because interactions with the external environment and communications between processes must be deferred during checkpoint validation steps (typically, two checkpoint intervals) until the fault-free processors are identified. The deadlines on providing services may thus be violated. In this paper we present and discuss two alternative roll-forward recovery schemes, especially for time-critical and interaction-intensive applications, that deliver correct, timely results even when checkpoint validation is required.
Loop optimization for aggregate array computations
Authors: Yanhong A. Liu, Scott D. Stoller
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations of loops, resulting in significant redundancy in the overall computation. This paper presents a method and algorithms that eliminate such overlapping aggregate array redundancies and shows both analytical and experimental performance improvements. The method is based on incrementalization, \ie, updating the values of aggregate array computations from iteration to iteration rather than computing them from scratch in each iteration. This involves maintaining additional information not maintained in the original program. We reduce various analysis problems to solving inequality constraints on loop variables and array subscripts, and we apply results from work on array data dependence analysis. Incrementalizing aggregate array computations produces drastic program speedup compared to previous optimizations. Previous methods for loop optimizations of arrays do not perform incrementalization, and previous techniques for loop incrementalization do not handle arrays.
Optimal overlap representations
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

In this paper, we investigate the problem of computing minimal interval and circular arc overlap representations, and give several optimal algorithms. We show that, among other things, given an s/spl times/t interval or circular arc overlap representation matrix: a minimal interval overlap representation can be obtained with O(log(st)) time with O(st/log(st)) EREW PRAM processors, or in O(log t/log log t) time with O(st log log t/log t) common CRCW PRAM processors, or in O(1) time with O(st) BSR processors; a minimal circular arc overlap representation can be obtained in O(st) time.
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming
Authors: Pascal Van Hentenryck, Yves Deville
Venue:  (1990)

This paper is an attempt to increase the (operational) expressiveness and efficiency of constraint logic programming (CLP). We propose a programming abstraction, the cardinality operator, that gives CLP users a new way of combining (primitive) constraints to build non-primitive ones. Declaratively, the cardinality operator is a new logical connective. Operationally, it implements a principle well-known in artificial intelligence and operations research, {\em ``Infer simple constraints from difficult ones'''',} and is based on constraint-solving, constraint-entailment, and simple arithmetic reasoning. The cardinality operator is independent of the computation model, subsumes a number of control mechanisms and constraints that were sometimes introduced in a rather ad-hoc manner, and can be seen as a new relational combinator in the {\em ask \& tell} framework. Programming examples and computation results are given that show the versatility and efficiency of the operator.
Cost-effective maintenance tools for proprietary languages
Authors: M. Jonge, R. Monajemi
Venue:  (2001)

Maintenance of proprietary languages and corresponding tooling is expensive. Postponing maintenance to reduce these costs is an often applied, short-term solution which eventually may lead to an unoperational toolset. This paper describes a case study carried out in cooperation with Lucent Technologies where maintenance cost is decreased by simplifying the development process of languages and tools. The development process is simplified by using a language-centered software engineering approach which increases software reuse and language dependent code generation. The case study was concerned with Lucent''s proprietary {\sc sdl} dialect and involved the re-engineering of an {\sc sdl} grammar and the construction of an {\sc sdl} documentation generator.
A Unified Framework for Constraint-Based Modeling
Authors: Devendra Kalra
Venue:  (1990)

Constraint-based modeling techniques are emerging as an effective computer graphics approach for modeling and designing objects and their behaviors. In this thesis, computer graphics constraint techniques are unified into a single conceptual framework. The central themes of the thesis are methods to partition an arbitrary constraint problem in different domains and at different levels, and to provide a language and computational environment for modeling with constraints. Using partitioning and composition schemes, complex simulations can be built hierarchically from simpler simulations by "plugging" together separate modules. Fundamental and basic structures are designed and implemented to provide an "Assembly Language" for simulation systems. These structures are put together through a collection of interfaces, much like multiple languages that use the same assembler on a computer. We use strategies called refinement and partitioning to integrate seemingly disparate constraint techniques. We present Temporal Sequencing as an approach to design complex time behaviors of simulation systems. Refinement is a top-down approach of transforming high level representations of a constraint modeling problem into representations that are closer to the basic solution mechanisms available in the constraint environment, such as numerical solution methods. Partitioning is the decomposition of one constraint problem into multiple simpler constraint problems that are then studied separately. Temporal Sequencing is a methodology to design the time behavior of a simulation system by composing time behaviors of the system over subintervals of time. Using the above partitioning schemes for the solution and specification of a general constraint problem, we create a unified constraint environment with the capability to both solve constraint problem instances and to create specialized constraint systems. New methods of constraint specification and solution can be added into the same constraint framework as new methods are developed. Based on the above approach, a modeling system called "Our Constraint Environment" (OCE) has been implemented. A programming language as an extension to C++ has been designed to provide an interface to OCE. The language provides the constructs for the partitioning schemes discussed above. Simulations created using OCE have shown the efficacy of our design approach. Constraint-based modeling techniques are emerging as an effective computer graphics approach for modeling and designing objects and their behaviors. In this thesis, computer graphics constraint techniques are unified into a single conceptual framework. The central themes of the thesis are methods to partition an arbitrary constraint problem in different domains and at different levels, and to provide a language and computational environment for modeling with constraints. Using partitioning and composition schemes, complex simulations can be built hierarchically from simpler simula
On deriving and validating comparative statics of a symmetric model of advertising competition
Authors: Hani I. Mesak
Venue: Computers and Operations Research (2003)

In this article, a market share attraction model is estimated using a data set of six manufacturers related to the ready-to-eat cereal industry in the US. For each year of the studied period, the market share of each firm is less than 50%, and these market shares are further apart from one another. In the reported application it is demonstrated, for the first time in the literature, that if model parameters change, all rivals in the industry should adjust their advertising spending in a manner consistent with the symmetric competitive structure for which all market shares are equal. Implications of this important finding are discussed.
Broadcasting Multiple Messages in Hypercubes (preliminary version)
Authors: A. Liestman, T. Shermer, M. Suderman
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

We investigate T, (Qd), the time required to broadcastm\geq 1 messages in a d-dimensional hypercube under thetelephone model. We give exact values for Tm(Qd) form \leq 2d-1 and for m \geq 2d + 1. For 2d-1- + 1\leq m \leq 2d,we produce an upper bound which is 1 larger than the lowerbound. One consequence of our results is to disprove alower bound due to Farley [3].
A Structured Neural Network Approach to Robust Parsing
Authors: Eugene Santos,  Jr.
Venue:  (1991)

Practical natural language interfaces must exhibit a robustness in dealing with ungrammatical data. Existing approaches considered ungrammaticality as some form of ``noisy'''' data. Extensions were then made to existing language systems to handle some particular type or class of ungrammaticality. Most of the original systems were built from traditional symbolic approaches that are poorly suited for handling noise. The resulting augmented language systems were generally inefficient and cumbersome. Connectionism offers an alternative approach to this problem with its natural ability to handle noise. However, very few successful connectionist systems have been built that can adequately model complex tasks such as parsing. In this paper, we present a robust parser built from the precepts of structured neural networks that combines the desirable properties of traditional symbolic approaches and the connectionist approaches. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Effects of Replication on the Duration of Failure in Distributed Databases
Authors: Donald B. Johnson, Larry Raab
Venue:  (1991)

Replicating data objects has been suggested as a means of increasing the performance of a distributed database system in a network subject to link and site failures. Since a network may partition as a consequence of such failures, a data object may become unavailable from a given site for some period of time. In this paper we study duration failure, which we define as the length of time, once the object becomes unavailable from a particular site, that the object remains unavailable. We show that, for networks composed of highly-reliable components, replication does not substantially reduce the duration of failure. We model a network as a collection of sites and links, each failing and recovering independently according to a Poisson process. Using this model, we demonstrate via simulation that the duration of failure incurred using a non-replicated data object is nearly as short as that incurred using a replicated object and a replication control protocol, including an unrealizable protocol which is optimal with respect to availability. We then examine analytically a simplified system in which the sites but not the links are subject to failure. We prove that if each site operates with probability p, then the optimal replication protocol, Available Copies [5,26], reduces the duration of failure by at most a factor of 1-p/1+p. Lastly, we present bounds for general systems, those in which both the sites and the communications between the sites may fail. We prove, for example, that if sites are 95% reliable and a communications failure is sufficiently short (either infallible or satisfying a function specified in the paper) then replication can improve the duration of failure by at most 2.7% of that experienced using a single copy. These results show that replication has only a small effect of the duration of failure in present-day partitionable networks comprised of realistically reliable components.
An On-Line Signature Verification System Using Hidden Markov Model in Polar Space
Authors: H. S. Yoon, J. Y. Lee, H. S. Yang
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper, we propose a method of on-line signature verification system using HMM models in polar coordinate system. In the previous works, the signature verification was performed in terms of a standard x-y coordinate system. This coordinate system need to normalization ofsignature stroke size and angle variance always. To reduce normalization error and computing time, we proposed the polar coordinate system. Under the polar coordinate system, the feature sets are robust and independent of size and angle variation according to the user characteristics. The use of HMMs instead of a traditional Euclidian distance metric for the determination of the degree of match between a test signature and a reference signaturemodel brings about a significant improvement in performance as it permits the incorporation of heuristics. The experiments shows that the proposed method gives lower equal error rate 2.2% from 50,000 testing case.
Localization of corresponding points in fingerprints by complex filtering
Authors: Kenneth Nilsson, Josef Bigun
Venue: Pattern Recognition Letters (2003)

For the alignment of two fingerprints certain landmark points are needed. These should be automaticaly extracted with low misidentification rate. As landmarks we suggest the prominent symmetry points (singular points, SPs) in the fingerprints. We identify an SP by its symmetry properties. SPs are extracted from the complex orientation field estimated from the global structure of the fingerprint, i.e. the overall pattern of the ridges and valleys. Complex filters, applied to the orientation field in multiple resolution scales, are used to detect the symmetry and the type of symmetry. Experimental results are reported.
A method to represent multiple-output switching functions by using multi-valued decision diagrams
Authors: T. Sasao, J. T. Butler
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Multiple-output switching functions can be simulated by multiple-valued decision diagrams (MDDs) at a significant reduction in computation time. analyze the following approaches to the representation problem: shared multiple-valued decision diagrams (SMDDs), multi-terminal multiple-valued decision diagrams (MTMDDs), and shared multi-terminal multiple-valued decision diagrams(SMTMDDs). For example, we show that SMDDs fend to be compact, while SMTMDDs tend to be fast. We present an algorithm for grouping input variables and output functions in the MDDs.
Public telephone network vulnerabilities
Authors: G. Lorenz, J. Keller, G. Manes, J. Hale, S. Shenoi
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

The convergence of public telephone networks (PTNs), wireless networks and the Internet makes it possible to disrupt vital information and communications systems from afar with software. PTN vulnerabilities are also growing due to system complexity, deregulation, increasing numbers of highly-skilled attackers, and the automation of attacks. This paper analyzes PTNs vulnerabilities, and presents an attack taxonomy. The taxonomy considers security threats posed by in-band attacks, out-of-band attacks, wireless attacks and Internet attacks.
A new shortest path routing algorithm and embedding cycles of crossed cube
Authors: Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

An n-dimensional crossed cube, CQ/sub n/, is a variation of hypercubes. In this paper, we give a new shortest path routing algorithm based on a new distance measure defined herein. In comparison with Efe's algorithm which generates one shortest path in O(n/sup 2/) time, our algorithm can generate more shortest paths in O(n) time. Furthermore, we show that CQ/sub n/ is a pancyclic network and we construct various types of cycles of an arbitrary length at least four.
Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm
Authors: Dipen Moitra
Venue:  (1988)

Given a black and white image, represented by an array of $\surd n x \surd n$ binary valued pixels, we wish to cover the black pixels with a minimal set of (possibly overlapping) maximal squares. It was recently shown that obtaining a minimum cover with squares for a polygonal binary image having holes is NP-hard. We derive an optimal parallel algorithm for the minimal square cover problem, which for any desired computation time T in [log n, n] runs on an EREW-PRAM with (n/T) processors. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A validation test of an adaptation of the DeLone and McLean's model in the Spanish EIS field
Authors: José L. Roldán, Antonio Leal
Venue: Critical reflections on information systems: a systemic approach (2003)

This chapter offers a reflection about systems thinking, models and validation tests. In this way, starting from the recognized model of information systems success created by DeLone and McLean, the authors develop an adaptation in the executive information systems (EIS) area. Their research aim is to carry out a validation test of the adapted model applying the Partial Least Squares approach. The study is based on a survey involving 100 managers in 55 Spanish organizations. The results show this model has an adequate predictive power for most implied variables, demonstrating the existence of significant links among information systems success dimensions. The model helps to understand the influence of EIS on both individual and organizational impacts. Finally, as a consequence of the validation process, new ideas for the redesigning of the model are proposed.
A Process Standard for System Security Engineering: Development Experiences and Pilot Results
Authors: R. Hefner
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

The Systems Security Engineering Capability Maturity Model/sup SM/ (SSE-CMM/sup SM/) describes the essential characteristics of an organization's security engineering process. The standard was developed by a unique government-industry consortium of leading security providers and acquirers. This paper summarizes the model and presents lessons learned in the model's development and from pilot appraisals.
Efficient Minimization of Multiple-valued Decision Diagrams for Incompletely Specified Functions
Authors: Denis V. Popel, Rolf Drechsler
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper addresses the problem of finding a smallsize Multiple-Valued Decision Diagram (MDD)representation of an incompletely specified multiple-valued function. Optimal MDD representationimproves performance and flexibility of manyapplications in logic design and multiple-valuedcircuit synthesis.We introduce an algorithm which incorporates anew operation on incompletely specified MDDs, calledfusion. The diagram is optimized by dynamic variableordering, graph compaction and minimization. Duringthe optimization the structure of the underlying MDDis modified in a way that only specified values arerepresented while don't cares are ignored. The resultson multiple-valued as wel as binary benchmarks withdon't cares are given to demonstrate the efficiency androbustness of the algorithm.