ppxscal/embedding_network huggingface dataset:
Performance Evaluation of Hybrid Coding of Images Using Wavelet Transform and Predictive Coding
Authors: S. R. Subramanya, Chaman Sabharwal
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Image compression techniques are necessary for the storage of huge amounts of digital images using reasonable amounts of space and for their transmission with limited bandwidth.Several techniques such as predictive coding transform coding, subb and coding wavelet coding and vector quantization have been used in image coding.While each technique has some advantages, most practical systems use hybrid techniques which incorporate more than one scheme.They combine the advantages of the individual schemes and enhance the coding effectiveness.This paper proposes and evaluates a hybrid coding scheme for images using wavelet transforms and predictive coding.The performance evaluation is done using a variety of different parameters such as kinds of wavelets decomposition levels types of quantizers, predictor coefficients and quantization levels.The results of evaluation are presented.
Case Study of Feature Location Using Dependence Graph
Authors: Kunrong Chen, Václav Rajlich
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Software change requests are often formulated as requests to modify or to add a specific feature or concept. To implement these changes, the features or concepts must be located in the code. In this paper, we describe the scenarios of the feature and concept location. The scenarios utilize a computer-assisted search of software dependence graph. Scenarios are demonstrated by a case study of NCSA Mosaic source code.
A Modified CMOS Balanced Output Transconductor with Extended Linearity
Authors: Mohamed A. Youssef, Ahmed M. Soliman
Venue: Analog Integrated Circuits and Signal Processing (2003)

A new CMOS balanced output transconductor is presented. The circuit is based on applying the dynamic biasing technique on the floating current source to extend its linearity range. The difference in the biasing currents is compensated to maintain the two output currents balanced by subtracting it at the output nodes. The proposed transconductor is suitable for high frequency applications requiring a wide dynamic range. Rail-to-rail operation is achieved with THD of &minus;33.64 dB. The bandwidth achieved by the transconductor is 240 MHz, and the supply voltage used is &plusmn;1.5 V.
Scheduling and Packing in the Constraint Language cc(FD)
Authors: Pascal Van Hentenryck
Venue:  (1992)

Constraint logic programming (CLP), and its generalization in the cc framework, define a class of declarative constraint languages combining nondeterministic goal-directed programming with constraint techniques over an arbitrary domain. CLP languages are particularly attractive for combinatorial search problems as they offer a short development time and a reasonable efficiency. In this paper, we present the application of cc(FD), a CLP language using consistency techniques over finite domains, to two applications: the perfect square problem and a digital signal processing (DSP) problem. The perfect square problem amounts to placing squares of different sizes in a master square in an exact manner (i.e. no empty space remains). We show a natural and very short cc(FD) program solving the problem for 21 and 24 squares in a couple of seconds. The DSP application amounts to scheduling tasks on a multiprocessor in presence of precedence, capacity, and delay constraints. The complexity of the problem is exacerbated by the non-uniform communication delays coming from the architecture, which combines pipeline and master-slave processing. We present a short cc(FD) program which compares very well with a special-purpose branch and bound algorithm. Both applications show the versatility of languages such as cc(FD) for the solving of discrete combinatorial search problems.
Solving Unconstrained Discrete-time Optimal Control Problems Using Trust Region Method
Authors: Aiping Liao
Venue:  (1995)

Trust region method for a class of large-scale minimization problems, the unconstrained discrete-time optimal control (DTOC) problems, is considered. Although the trust region algorithms developed in [4] and [13] are very economical they lack the ability to handle the so-called hard case. In In this paper, we show that the trust region subproblem can be solved within an acceptable accuracy without forming the Hessian explicitly. The new approach is based on the inverse power method for eigenvalue problem and possesses the ability to handle the hard case. Our proposed approach leads to more efficient algorithms for DTOC problems. KEYWORDS: discrete-time optimal control, stagewise Newton''s method, trust region method, inverse power method.
Applying NAILS to blackboard
Authors: Andrew Solomon
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This paper is a desultory litany of complaints written by a first-time user of the enterprise education software Blackboard. It will make you laugh, it will make you cry ... and it will make you mistrust any button that looks like a useful feature.
&#x00B5;-recursion and infinite limits
Authors: Jerzy Mycka
Venue: Theoretical Computer Science (2003)

The set of real functions generated from - 1, 0, 1 by operations of superposition, differential recursion and infinite limits (lim sup, lim inf) is considered. The equivalence of infinite limits and zero-finding operator µ is proved.
A feature database for multimedia objects
Authors: Martin L. Kersten, Niels Nes, Menzo A. Windhouwer
Venue:  (1998)

The Acoi project provides a large-scale experimentation platform to facilitate studies in the area of indexing multimedia objects and their subsequent retrieval. The index model is based on assembling the results of feature detection algorithms into hierarchical structures to classify the objects. This paper provides an overview of the Acoi architecture and the Feature Detector Engine (FDE) model. Central to its design is a grammatical description of the feature relations to classify the multimedia objects and to steer their detection and storage. Its role is informally introduced.
Type-Safe Trading Proxies Using TORBA
Authors: Raphael Marvie, Philippe Merle, Jean-Marc Geib, Sylvain Leblanc
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Nowadays, Autonomous Distributed Systems, such as large-scaled telecom and manufacturing applications, rely on the use of middleware. In order to find back resources and to interconnect applications, the middleware has to provide a trading function. Unfortunately, standard traders such as the ODP/OMG CosTrading service, are error-prone due to the lack of type checking at compilation time, but only performed at runtime. In order to address this problem, we have defined the Trader Oriented Request Broker Architecture (TORBA) to provide a trading framework and its associated tools, which tend to offer type-safe trading operations that are simple to use from applications and checked at compilation time. Based on the concept of Trading Contracts, a resource is described using the TORBA Definition Language, and then compiled to generate trading proxies offering simple interfaces to applications. The example used in this paper clearly states the benefits brought by the TDL trading contracts: type checking at compilation time, simple to use, and providing a powerful and reliable framework for CORBA object trading.
A New Approach to Teaching Mathematics
Authors: David Gries, Fred B. Schneider
Venue:  (1994)

We propose a new approach to teaching discrete math: First, teach logic as a powerful and versatile tool for discovering and communicating truths; then use this tool in all other topics of the course. We spend 6 weeks teaching an equational style of propositional and predicate calculus, thereby ensuring that students gain a fluency in logical notation and some skill in its use. We teach basic heuristics for developing proofs, and we relate such proofs to more common informal proofs in mathematics. Then, we use logic extensively and rigorously in teaching topics like set theory, relations and functions, a theory of integers, induction, combinatorics, and solving recurrence relations. Success in teaching logic as a tool means that students lose their fear of mathematics and formalism, gain a positive view of rigorous proofs, learn to appreciate the use of syntactic manipulation, and begin using logic in other areas of study. Our experiences in teaching discrete math at Cornell shows that such success is possible.
Eyeglass-Based Systems For Wearable Computing
Authors: M. B. Spitzer, N. M. Rensing, R. McClelland, P. Aquilino
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

This paper reports on progress in the area of hardware for wearable computing. Our specific interest is in reducing conventional head-mounted display systems to eyeglass scale. We report here the successful demonstration of an ergonomic eyeglasses-based display. We present some of the general considerations in the design of such eyeglasses and briefly review our approach and initial findings.
MCSA/MCSE Self-Paced Training Kit: Managing and Troubleshooting a Microsoft Windows .NET Server Network Infrastructure (Exam 70-276), 1 edition
Authors: Microsoft Corporation, Microsoft Press, J. C. Mackin
Venue:  (2003)

:This official MCSE Self-Paced Training Kit teaches IT professionals how to install, configure, administer, and troubleshoot Windows .NET Server network services-as they prepare for MCP Exam 70-276, a core requirement on the MCSE track. Students learn through an integrated system of skill-building tutorials, hands-on exercises, and self-assessment tools. Topics map directly to MCP exam objectives. An economical alternative to classroom instruction, this kit enables students to set their own pace and learn by doing!
Designing for Ubiquity: The Perception of Privacy
Authors: Richard Beckwith
Venue: IEEE Pervasive Computing (2003)

Ubicomp systems aim to be distraction-free, but as a result, users often forget the technology exists or fail to seriously question the role it plays in their lives. For monitoring systems, the issues are complicated because individual devices can collect data for different purposes, and combining data from various devices can reveal unanticipated information. The author was part of a team that investigated these issues in a sensor-rich eldercare facility. The team interviewed the facility's management, staff, and residents, as well as residents' family members, to understand how they viewed the technology and its effect on their privacy. Although our interviewees did see embedded technology as a central factor in their environment, few understood the technology, the data it gathered, or how it was used. These results have implications for other ubicomp environments, as well as ubicomp system design.
Digital Watermarking using Inter-Block Correlation: Extension to JPEG Coded Domain
Authors: Y. Choi, K. Aizawa
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Digital watermarking schemes have been discussed to solve the problem associated with copyright enforcement. As a digital watermarking, we proposed a method using inter-block correlation of DCT coefficients. It has the features that the embedded watermark can be extracted without the original image nor the parameters used in embedding process and that the amount of modification, the strength of embedded watermark, depends on the local feature of an image. This feature makes it difficult for pirate to predict the position in which the watermark signal is embedded. In this paper, we propose a method which can embed/extract watermark with high speed by utilizing this watermarking method for JPEG file format.
Redesigning the Web: From Passive Pages to Coordinated Agents in PageSpaces
Authors: Paolo Ciancarini, Robert Tolksdorf, Fabio Vitali, Davide Rossi, Andreas Knoche
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Currently, Web does not support distributed applications well. Existing approaches are oriented towards centralized applications at servers, or local programs within clients. To overcome this deficit, the PageSpace platform was designed for distributed, coordinated agents in the Web. We take a specific approach to coordinate agents in PageSpace applications, namely variants of coordination language Linda that support rules and services to guide their cooperation. This technology is integrated with the standard Web technology and the language Java. Several kinds of agents life in the PageSpace: User interface agents, personal homeagents, the agents that implement applications, and the kernel agents of the platform. Within the architecture it is possible to support fault-tolerance and mobile agents as well.
Superpolynomial Lower Bounds for Monotone Span Programs
Authors: Laszlo Babai, Anna Gal, Avi Wigderson
Venue:  (1996)

In this paper we obtain the first superpolynomial lower bounds for {\it monotone span programs} computing explicit functions. The best previous lower bound was $\Omega(n^{5/2})$ by Beimel, G\''al, Paterson \cite{BGP}; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil''s character sum estimates. We prove an $n^{\Omega ( \log n / \log\log n)}$ lower bound for an explicit family of monotone Boolean functions in $n$ variables, which implies the same lower bound for the size of monotone span programs for the clique problem. Our results give the first superpolynomial lower bounds for linear secret sharing schemes. We demonstrate the surprising power of monotone span programs by exhibiting a function computable in this model in linear size while requiring superpolynomial size monotone circuits and exponential size monotone formulae. We also show that the perfect matching function can be computed by polynomial size (non-monotone) span programs over arbitrary fields.
Sams Teach Yourself CSS in 24 Hours
Authors: Kynn Bartlett
Venue:  (2002)

:Learning to apply CSS is the HTML Web publisher's next developmental step toward a professional and stable Web design. A prerequisite to learning higher-level languages like Javascript, Java, and Flash, CSS is gaining increasing support among major browsers, including Netscape, Internet Explorer (together 94% market share) and newcomers Opera, Mozilla and NeoPlanet, and backwards-compatibility with older browser versions and specialized browsers. The key to successful CSS implementation is in understanding how different browsers use and interpret CSS. This tutorial takes the unique position of teaching the reader how to make smart decisions about how and when to apply CSS, based on browser support and intended effects. In 24 straightforward, hourly lessons, the reader learns by accomplishing hands-on tasks that can be applied to his own site in every hour. 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
BIST-Based Delay-Fault Testing in FPGAs
Authors: Miron Abramovici, Charles Stroud
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We present the first delay-fault testing approach for FPGAs, applicable both for manufacturing and for on-line testing. Our approach is based on BIST, is comprehensive, and does not require expensive ATE. We have successfully implemented this BIST approach on the ORCA2C series FPGA.
A Machinery Control System using Mobile Agents
Authors: H. Wada, Y. Sakuraba, M. Negishi, T. Yamakawa, K. Kubo, Y. Kashiyama
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Flexibility is one of the key features for future manufacturing systems. To satisfy this requirement, we propose a basic concept that information of a product, for example a procedure to make the product or processed data of the product, is attached to the target work and moving around with the work. We introduced mobile agents which are called Product Agents to realize this concept. The information of the target product is mapped on the Product Agents. Each Product Agent knows the procedure to make a target product, and moves on processing machines or controllers according to the procedure. This system has autonomous decentralized feature. To verify our concept, we developed a prototype system using the proposed architecture. The prototype system was for the Shape Deposition Manufacturing Laboratory of Robotics Institute at Carnegie Mellon University.In this paper, we describe our basic concept and software architecture of our proposed system by explaining the prototype system. Then we will show you some evaluations and discussions of our proposed and developed system.
Numerical studies on the ultimate behaviour of steel cold-formed purlins
Authors: A. Joó, L. Dunai
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents the numerical modelling and analysis of steel cold-formed purlins with the aim to introduce an advanced design method. The complex behaviour is raised from the coupling local and global stability phenomenon and from the purlin-cladding interaction. In the existing design methods these features are handled with significant simplifications. In the ongoing research an advanced finite element model is introduced which can follow the behaviour of purlin - sheeting system. The models are built and verified in parallel with experimental tests on Z-purlins with a special cladding. For application an automatic procedure is under development what can prepare the model, control the analysis and evaluate the results. In the paper the procedure is illustrated by the results of numerical studies.
Adaptable Binary Programs
Authors: Robert Wahbe, Steven Lucco, Susan L. Graham
Venue:  (1994)

To accurately and comprehensively monitor a program''s behavior, many performance measurement tools must transform the program''s executable representation or binary. By instrumenting binary programs to monitor program events, tools can precisely analyze compiler optimization effectiveness, memory system performance, pipeline interlocking, and other dynamic program characteristics that are fully exposed only at this level. Binary transformation has also been used to support software-enforced fault isolation, debugging, machine re-targeting and machine-dependent optimization. At present, binary transformation applications face a difficult trade-off. Previous approaches to implementing robust transformations incur significant disk space and run-time overhead. To improve efficiency, some current systems sacrifice robustness, relying on heuristic assumptions about the program and recognition of complex, compiler-dependent code generation idioms. In this paper we present adaptable binaries, a technique for implementing robust, efficient, and compiler-independent binary transformations. We evaluated a prototype implementation of adaptable binaries under the Ultrix 4.2 operating system and the MIPS processor architecture. Using the C SPEC92 benchmarks, we assessed adaptable binaries in three ways. First, we demonstrated that the information necessary to build adaptable binaries can be compactly recorded, increasing space overhead by only 9% for the SPEC92 benchmarks. Second, we measured the run-time overhead of previous approaches to implementing robust binary transformations, and showed that adaptable binaries significantly reduce this overhead. Finally, we measured the run-time transformation overhead of two user applications, pixie and MemSpy. For our benchmark programs, using adaptable binaries eliminates pixie''s 110% average transformation overhead and reduces MemSpy''s average overhead from 1296% to 33%.
Doubly nonlinear evolution equations with memory
Authors: Sergiu Aizicovici, Pierluigi Colli, Maurizio Grasselli
Venue:  (1999)

A nonlinear abstract integrodifferential evolution equation of Volterra type is considered. This equation contains two main nonlinearities, expressed by a maximal monotone operator and a subdifferential of a suitable convex and lower semicontinuous function, respectively. By means of a semi-implicit time discretization procedure, the existence of solutions to the Cauchy problem associated with the evolution equation is proved. Then, the abstract result is applied to initial and boundary value problems for a nonlinear system with memory subject to nonlinear boundary conditions, and for a Stefan problem with a nonlinear heat flux law with memory. TEL:: + 39 0382 505654 EMAIL:: pier@dragon.ian.pv.cnr.it
Evaluating the Performance Limitations of MPMD Communication
Authors: Chi Chang, Grzegorz Czajkowski, Thorsten von Eicken, Carl Kesselman
Venue:  (1997)

The MPMD approach for parallel computing is attractive for programmers who seek fast development cycles, high code re-use, and modular programming, or whose applications exhibit irregular computation loads and communication patterns. Remote method invocation is widely adopted as the communication abstraction for crossing address space boundaries. However, the communication overheads of existing RMI-based systems are usually an order of magnitude higher than those found in highly tuned SPMD systems. This problem has thus far limited the appeal of high-level programming languages based on MPMD models in the parallel computing community. This paper investigates the fundamental limitations of MPMD communication using a case study of two parallel programming languages, Compositional C++ (CC++) and Split-C, that provide support for a global name space. To establish a common comparison basis, a new implementation of CC++ was developed to use Active Messages and a native threads package. A series of micro-benchmarks compares the communication performance of this new CC++ implementation with Split-C on an IBM SP multi-computer. The impact of these costs on three applications is also evaluated and suggests that MPMD communication can be used effectively in many high-performance parallel applications.
Phase tracking and prediction
Authors: Timothy Sherwood, Suleyman Sair, Brad Calder
Venue: ACM SIGARCH Computer Architecture News (2003)

In a single second a modern processor can execute billions of instructions. Obtaining a bird's eye view of the behavior of a program at these speeds can be a difficult task when all that is available is cycle by cycle examination. In many programs, behavior is anything but steady state, and understanding the patterns of behavior, at run-time, can unlock a multitude of optimization opportunities.In this paper, we present a unified profiling architecture that can efficiently capture, classify, and predict phase-based program behavior on the largest of time scales. By examining the proportion of instructions that were executed from different sections of code, we can find generic phases that correspond to changes in behavior across many metrics. By classifying phases generically, we avoid the need to identify phases for each optimization, and enable a unified prediction scheme that can forecast future behavior. Our analysis shows that our design can capture phases that account for over 80% of execution using less that 500 bytes of on-chip memory.