ppxscal/embedding_network huggingface dataset:
Content based sub-image retrieval via hierarchical tree matching
Authors: Jie Luo, Mario A. Nascimento
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

This paper deals with the problem of finding images that contain a given query image, the so-called content-based sub-image retrieval. We propose an approach based on a hierarchical tree that encodes the color feature of image tiles which are in turn stored as an index sequence. The index sequences of both candidate images and the query sub-image are then compared in order to rank the database images suitability with respect to the query. In our experiments, using 10,000 images and disk-resident metadata, for 60Σ (80Σ) of the queries the relevant image, i.e., the one where the query sub-image was extracted from, was found among the first 10 (50) retrieved images in about 0.15 sec.
On the design of robust vector quantizers for sources and channels with memory
Authors: Mirek Pawlak
Venue:  (2002)

Recently, robust quantization has received considerable attention, particularly as a potential approach to joint source-channel coding. This dissertation investigates the practical design of channel optimized vector quantizers (COVQ). Specific problems considered here include COVQs with memory and COVQs operating over channels with memory . In this work, the emphasis is placed on soft-decoding at the receiver.Vector quantizers with memory are an effective means of quantizing correlated signals. However, when designed without regard to channel errors, these quantizers suffer from degradation of performance due to the propagation of channel errors at the receiver. We consider two important examples of such quantizers, namely, predictive vector quantizers (PVQ) and finite-state vector quantizers (FSVQ). In the case of PVQ, an iterative algorithm is developed for jointly optimizing the quantizer and the associated linear predictor to a given channel. According to the simulation results presented here, the proposed PVQ designs based on hard-decoding perform comparably to those obtained by a previously studied gradient-search optimization algorithm. Furthermore, it is demonstrated that PVQs with soft-decoding can provide a significant improvement over hard-decoding systems. In the case of FSVQ, a time-recursive decoding algorithm, which exhibits graceful degradation of performance with increasing channel noise, is introduced. Design of channel optimized FSVQ is also considered. Simulation results are presented, which demonstrate that proposed channel optimized FSVQs outperform the memoryless COVQs operating at the same rate.Finally, in the context of channels with memory, joint equalization and soft-decoding using a sliding-block decoder is investigated. This decoder is a non-linear time-invariant filter based on minimum mean square error criterion. As a practical implementation, multi-layer perceptron (MLP) is considered. Simulation results indicate that MLP-based soft-decoder outperforms a previously studied recursive soft-decoder, particularly under high channel noise. However, the complexity of the optimal sliding-block decoder function is found to increase with the encoder resolution, making the estimation task harder. In an encouraging development, it is shown that the optimal sliding-block decoder for the Gaussian channel approximates a linear function as the channel becomes noisier. Experimental results seem to support this theoretical result.
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
Authors: Donglin Liu, Xiaobo Sharon Hu, Michael D. Lemmon, Qiang Ling
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Many real-time systems have firm real-time requirementswhich allow occasional deadline violations but discard anytasks that are not finished by their deadlines. To measurethe goodness of such a system, a quality of service (QoS)metric is needed. Examples of often used QoS metrics forfirm real-time systems are average deadline miss rates and(m, k)-firm constraint. However, for certain applications,these metrics may not be adequate measures of system performance.This paper introduces a novel QoS constraint fornetworked feedback control systems. We show that this constraintcan be directly related to the control system's performance.We then present three different scheduling approacheswith respect to this QoS constraint. Experimentalresults are provided to compare these approaches.
Experiences in Integration and Reuse of CORBA-Interfaced Software with Directory Services and Web Services
Authors: M. Jandl, M. Alber, W. Radinger, K. M. Goeschka
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Distributed legacy systems often provide complex and extensive interfaces. Even if these interfaces consist of standardized CORBA (Common Object Request Broker Architecture) definitions, they still require too much in-depth knowledge for easy third party integration of small additional components, which could in principle be achieved with just a small subset of the interfaces' functionality. Therefore, we used XML (Extensible Markup Language) to tag particular parts of the middleware's interface for easy third party access with simple protocols, like the Lightweight Directory Access Protocol for Directory services, or the Simple Object Access Protocol for Web services. The respective requests are then dynamically mapped to suitable CORBA operation invocations. We provide the mapping schema and the software architecture for a real-life example. The XML tagging has proven to be a powerful means ofabstraction, which allows for robust and easy but flexible access to complex and even continuously changing distributed middleware. Therefore, XML will play a major role for heterogeneous interface descriptions, where middleware technologies and simple access services will coexist in the future.
Overlay multicast for video on demand on the Internet
Authors: Kien A. Hua, Duc A. Tran, Roy Villafane
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Patching is an attractive technique for building efficient video-on-demand systems. However, since Patching assumes the existence of IP Multicast, implementing Patching on the current Internet is a challenging task because the Internet is based on IP Unicast only. In this paper, we propose an overlay technique called Vcast for enabling multicast services on the application layer, as a way to support the implementation of Patching. Unlike earlier overlay multicast schemes, Vcast does not introduce any global topology for the overlay and therefore avoids control overhead to maintain it. Vcast can configure itself adaptively to the changing network traffic, and is tolerant to failures prone to happen frequently in dynamic environments such as the Internet. In addition, Vcast provides load balancing among network nodes by employing the Round-robin approach in selecting delivery paths for clients.
Probability, logic and the cognitive foundations of rational belief
Authors: John Fox
Venue: Journal of Applied Logic (2003)

Since Pascal introduced the idea of mathematical probability in the 17th century discussions of uncertainty and "rational" belief have been dogged by philosophical and technical disputes. Furthermore, the last quarter century has seen an explosion of new questions and ideas, stimulated by developments in the computer and cognitive sciences. Competing ideas about probability are often driven by different intuitions about the nature of belief that arise from the needs of different domains (e.g., economics, management theory, engineering, medicine, the life sciences etc). Taking medicine as our focus we develop three lines of argument (historical, practical and cognitive) that suggest that traditional views of probability cannot accommodate all the competing demands and diverse constraints that arise in complex real-world domains. A model of uncertain reasoning based on a form of logical argumentation appears to unify many diverse ideas. The model has precursors in informal discussions of argumentation due to Toulmin, and the notion of logical probability advocated by Keynes, but recent developments in artificial intelligence and cognitive science suggest ways of resolving epistemological and technical issues that they could not address.
Resource management in ASMA platform
Authors: Habib Bakour, Nadia Boukhatem
Venue: Network control and engineering for Qos, security and mobility II (2003)

The combination of virtual networks and active networking technology results in a new concept called virtual active network (VAN). Different interpretations are associated with the notion of VAN. We consider a VAN as a service abstraction offered by a provider to its customers. For the provider, the VAN represents the means to partition the network resources and isolate the customers from one another in virtual environments. For the customer, the VAN represents the environment in which it can install, configure and run its own services without further interaction with the provider. The partitioning of resources between customers is essential in such an architecture so that a customer does not monopolize resources, thus penalizing other customers. It can be implemented by performing a strict resource management.In this paper, we present our ASMA (Active Service Management Architecture) platform which on the one hand, enables the customer to request a VAN from the provider, and manage his own services within his VAN and, on the other hand, allows the provider to manage the VANs created in his domain. We particularly focus on the resource control model defined in ASMA platform. Experiments are also presented to illustrate the behavior of the VAN nodes during service execution and show the efficiency of the proposed resource control schemes, allowing running services not to exceed negotiated resource consumption.
Parameterized High Throughput Function Evaluation for FPGAs
Authors: Oskar Mencer, Wayne Luk
Venue: Journal of VLSI Signal Processing Systems (2004)

This paper presents parameterized module-generators for pipelined function evaluation using lookup tables, adders, shifters, multipliers, and dividers. We discuss trade-offs involved between (1) full-lookup tables, (2) bipartite (lookup-add) units, (3) lookup-multiply units, (4) shift-and-add based CORDIC units, and (5) rational approximation. Our treatment mainly focuses on explaining method (3), and briefly covers the background of the other methods. For lookup-multiply units, we provide equations for estimating approximation errors and rounding errors which are used to parameterize the hardware units. The resources and performance of the resulting design can be estimated given the input parameters. A selection of the compared methods are implemented as part of the current PAM-Blox module generation environment. An example shows that the lookup-multiply unit produces competitive designs with data widths up to 20 bits when compared with shift-and-add based CORDIC units. Additionally, the lookup-multiply method or rational approximation can produce efficient designs for larger data widths when evaluating functions not supported by CORDIC.
How to unwittingly sign non-repudiable documents with Java applications
Authors: D. Bruschi, D. Fabris, V. Glave, E. Rosti
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Digital signatures allow us to produce documents whoseintegrity and authenticity, as we generated them, is verifiableby anybody who has access to our public key. Furthermore,we cannot repudiate those documents as somethingwe never saw, let alone signed, since nobody else but uscould access our private key.In this paper we show how the previous statement canbe proved wrong when carefully crafted malicious softwareis installed on a machine running a Java digital signatureapplication. By using such a software, a user may unwittinglysign another document besides the one he/she intendsto digitally sign or sign a different document altogether.Our attack exploits a known vulnerability of the securityarchitecture of the Java run-time environment that allowsnon-Java malicious software to replace some Java systemclasses with malicious ones, which then alter the victimapplication behavior.
An approach to teaching Java using computers
Authors: Russel E. Bruhn, Philip J. Burton
Venue: ACM SIGCSE Bulletin (2003)

This paper describes how the use of computers in the classroom (using studio teaching) can help students to better understand Java programming concepts during classroom presentations. Students learn by three methods: auditory, visual, and kinetic. Studio teaching uses all three methods, but relies mostly on the kinetic method. Students actually practice the programming concepts in the classroom on the computer as the instructor presents them. The studio teaching method helps the average-to-poor scholastic achievers the most, while high-achieving students seemed to do just as well with the typical lecture-style format. The disadvantage of studio teaching is that it is expensive to equip labs with computers, and more time is needed to present the material to the students. Also, it takes time for students to practice programming concepts on the computer in class.
Group judgment processes and outcomes in video-conferencing versus face-to-face groups
Authors: Marcus Credé, Janet A. Sniezek
Venue: International Journal of Human-Computer Studies (2003)

Two hundred and eighty-two participants formed 94 groups of size three and completed an estimation task by interacting either face-to-face or via a video-conferencing system. Results showed significant differences across conditions with regard to the confidence attached by groups to their decisions, the degree to which groups were able to improve upon the best individually arrived at decision, and the self-reported enjoyment of group members. Compared to face-to-face groups, video-conferencing groups showed lower levels of confidence in their decisions, especially if they were instructed to discuss their beliefs and assumptions underlying their estimates and not the estimates themselves. However, this lower level of confidence was more appropriate than that of the face-to-face groups. Groups interacting face-to-face were more likely to improve upon the best individual solution, and, on average, improved to a greater degree. Further, video-conferencing groups reported modifying more of their beliefs during discussion. However, there were no significant differences between the two interaction media on the following outcome dimensions: accuracy; overconfidence; commitment to the group decision; size of credible intervals; improvement over average initial individual estimates; and the number of beliefs discussed or learned. Implications for the design and application of advanced systems for decision-making support and research are discussed.
A practical approach to re-engineering software
Authors: M. A. Waheed
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Software is being recognized as a critical constraint in the realization of industrial and commercial systems, but the cost of labor intensive activity of developing software is still high. This situation is encouraging organizations to investigate re-engineering existing software. Re-engineering existing software may help control the high cost of software maintenance and better the understanding of existing systems. Nonetheless current state of software engineering tools and technology make re-engineering software a complex and difficult process[6].A simple approach to re-engineering, especially when translating the code from a proprietary language to a commercial language, is to use programmable program transformation tools to partially translate the code to a standard commercial language. Such partially translated code can be used to extract design information and refined further, and the translation can be completed with the help of commercially available tools.
Georgia tech gesture toolkit: supporting experiments in gesture recognition
Authors: Tracy Westeyn, Helene Brashear, Amin Atrash, Thad Starner
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Gesture recognition is becoming a more common interaction tool in the fields of ubiquitous and wearable computing. Designing a system to perform gesture recognition, however, can be a cumbersome task. Hidden Markov models (HMMs), a pattern recognition technique commonly used in speech recognition, can be used for recognizing certain classes of gestures. Existing HMM toolkits for speech recognition can be adapted to perform gesture recognition, but doing so requires significant knowledge of the speech recognition literature and its relation to gesture recognition. This paper introduces the Georgia Tech Gesture Toolkit GT2k which leverages Cambridge University's speech recognition toolkit, HTK, to provide tools that support gesture recognition research. GT2k provides capabilities for training models and allows for both real--time and off-line recognition. This paper presents four ongoing projects that utilize the toolkit in a variety of domains.
An interval constraint system for lattice domains
Authors: Antonio J. Fernández, Patricia M. Hill
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2004)

We present a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. The approach is based on the use of a single form of constraint similar to that of an indexical used by CLP for finite domains and on a particular generic definition of an interval domain built from an arbitrary lattice. We provide the theoretical foundations for this framework and a schematic procedure for the operational semantics. Examples are provided that illustrate how new (compound) constraint solvers can be constructed from existing solvers using lattice combinators and how different solvers (possibly on distinct domains) can communicate and hence, cooperate in solving a problem. We describe the language clp(L), which is a prototype implementation of this framework and discuss ways in which this implementation may be improved.
Long-period fibre grating fabrication with femtosecond pulse radiation at different wavelengths
Authors: P. G. Kryukov, Yu. V. Larionov, A. A. Rybaltovskii, K. A. Zagorul'Ko, A. Dragomir, D. N. Nikogosyan, A. A. Ruth
Venue: Microelectronic Engineering (2003)

The fabrication of long-period fibre gratings (LPFGs) in optical fibres by femtosecond pulses at different wavelengths is reported. Several types of fibres were used and it was found that LPFGs with strong attenuation peaks (more than 20 dB) can be induced in hydrogen-loaded germanosilicate fibres using the second harmonic of a femtosecond Ti:sapphire laser without the use of an amplifier (400 nm, 70 fs and 2.5 nJ) and amplified, frequency-quadrupled pulses from a Nd:glass laser (264 nm, 220 fs and 0.4 mJ). Low 'out-of-band' losses and results of isochronal annealing for the fabricated gratings suggest that the photoinduced refractive index change is not accompanied by damage to irradiated fibres.
Developing an Information Systems Infrastructure with Open Source Software
Authors: Brian Fitzgerald, Tony Kenny
Venue: IEEE Software (2004)

Up to now, most open source software (OSS) deployments have been in invisible infrastructure applications running on back-office servers (GNU/Linux, Apache, and so on). Beaumont Hospital in Ireland recently started developing its overall information systems infrastructure by deploying more visible desktop and front-office OSS applications in addition to GNU/Linux and Apache. In a two-phase OSS implementation, Beaumont will save over 30 million euros over five years. These details are useful in that few studies have thus far quantified the savings from OSS deployment. Also, in many cases, the extra functionality available in OSS systems allows for a richer feature set. Much has been written about the motivation of individual OSS developers; in this case, the primary drivers behind an organization's decision to implement OSS solutions are principle and pragmatism. A company can contribute back to the OSS community in its own unique way, by distributing applications developed from its particular domain of expertise, rather than making contributions to the code base of Gnu/Linux. The former type of contribution can have a significant boot-strapping effect in that it creates OSS applications in many domains that otherwise would have been unlikely candidates.
TrickE-business: malcontents in the matrix
Authors: Paul A. Taylor
Venue: The economic and social impacts of e-commerce (2003)

This chapter explores the phenomenon of hacktivism in the context of globalization debates and the evolving nature of new social movements. It explores the historical trend by which capitalism has become increasingly more immaterial in its appearance but powerful in its effects. Using examples of specific hacktivist groups, hacktivism is shown to be an inventive response to this trend and represents an imaginative re-appropriation of the Web for spider-like anti-capitalist protest. The paper concludes with a summary of the hacktivist philosophy that seeks to reassert the origins of the marketplace as an agora for the people rather than just big business. Hacktivism is shown to represent a rationale diametrically opposed to e-commerce.
Stabilized hybrid finite element methods based on the combination of saddle point principles of elasticity problems
Authors: Tianxiao Zhou
Venue: Mathematics of Computation (2003)

How, in a discretized model, to utilize the duality and complementarity of two saddle point variational principles is considered in the paper. A homology family of optimality conditions, different from the conventional saddle point conditions of the domain-decomposed Hellinger-Reissner principle, is derived to enhance stability of hybrid finite element schemes. Based on this, a stabilized hybrid method is presented by associating element-interior displacement with an element-boundary one in a nonconforming manner. In addition, energy compatibility of strain-enriched displacements with respect to stress terms is introduced to circumvent Poisson-locking.
Information visualization and interactive querying for online documentation and electronic books
Authors: Mark H. Chignell, Gene Golovchinsky, Ferdie Poblete, Sarah Zuberec
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

In this paper we describe recent research that we have conducted on the use of information visualization [3] and a new style of query-based browsing [7] to enhance the exploration of online information. Our goal is to increase the performance and usability of online documentation, and of electronic information in general.Information visualization using three dimensional hierarchies provides a convenient way to overview information structure and select topics [3]. Interactive querying allows a highly interactive form of combined browsing and search using pen-based navigation [7].Early evaluations of the effectiveness of information visualization and interactive querying in information exploration tasks will be reported. Implications of these techniques for future online documentation systems and electronic books will also be discussed.