ppxscal/embedding_network huggingface dataset:
PhotoStudy: Vocabulary Learning and Collaboration on Fixed and Mobile Devices
Authors: Sam Joseph, Kim Binsted, Dan Suthers
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

PhotoStudy is a system that supports vocabulary study on both wired and wireless devices. It is designed to make it simple to annotate content with multimedia such as images and audio recorded on these devices. This paper presents a prototype system that uses wireless markup languages and Java MIDlets. User evaluations have been conducted, and are being continued in our iterative design approach. We report the results from questionnaire evaluations, observational studies and interviews.
WCET Centric Data Allocation to Scratchpad Memory
Authors: Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, Ting Chen
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to predictable memory access latencies. Current scratchpad memory allocation techniques improve the average-case execution time of tasks. For hard real-time systems, on the other hand, worst case execution time (WCET) is a key metric. In this paper, we propose scratchpad allocation techniques for data memory that aim to minimize a task's WCET. We first develop an integer linear programming (ILP) based solution which constructs the optimal allocation assuming that all program paths are feasible. Next, we employ branch-and-bound search to more accurately construct the optimal allocation by exploiting infeasible path information. However, the branch-and-bound search is too time-consuming in practice. Therefore, we design fast heuristic searches that achieve near-optimal allocations for all our benchmarks.
Some problems in the design of combined languages
Authors: J. A. Barnden
Venue: ACM SIGSIM Simulation Digest (1980)

The purpose of this article is to air some problems and issues I have encountered on trying to derive principles for the design of combined continuous-discrete simulation languages for digital computers [1, 2, 3, 4, 5]. The presentation is intended to provoke discussion rather than to provide definitive analysis. I am especially conerned with: interaction between parallel' components; discontinutuity and the discrete/continuous dichotomy; and state-events.
Query processing with guarantees in query-centric networks
Authors: Hector Garcia-Molina
Venue:  (2005)

Massive-scale self-administered networks like peer-to-peer and sensor networks have data distributed across thousands of participant hosts. End-users derive benefit by querying data in these networks in various ways (e.g., keyword searches, aggregate queries, and select-project-joins). These networks are however highly dynamic with short-lived hosts being the norm rather than an exception. In the face of such dynamism, traditional query processing algorithms either abort the query or return best-effort results with ill-defined semantics. In this dissertation, we present motivation, methodology and performance results on designing efficient and scalable systems that ensure valid semantics for a variety of queries: (a) coverage and freshness for keyword queries on text corpus, (b) privacy for access-controlled content under keyword queries, (c) validity for aggregate queries on shared numerical attributes, and (d) atomicity, isolation and durability for queries and updates on mutable content.
Example-based color transformation for image and video
Authors: Youngha Chang, Suguru Saito, Masayuki Nakajima
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Color is very important in setting the mood of images and video sequences. For this reason, color transformation is one of the most important features in photo-editing or video post-production tools because even slight modifications of colors in an image can strongly increase its visual appeal. However, conventional color editing tools require user's manual operation for detailed color manipulation. Such manual operation becomes burden especially when editing video frame sequences. To avoid this problem, we previously suggested a method [Chang et al. 2004] that performs an example-based color stylization of images using perceptual color categories. In this paper, we extend this method to make the algorithm more robust and to stylize the colors of video frame sequences. The main extension is the following 5 points: applicable to images taken under a variety of light conditions; speeding up the color naming step; improving the mapping between source and reference colors when there is a disparity in size of the chromatic categories; separate handling of achromatic categories from chromatic categories; and extending the algorithm along the temporal axis to allow video processing. We present a variety of results, arguing that these images and videos convey a different, but coherent mood.
Tracking, Analysis, and Recognition of Human Gestures in Video
Authors: Stan Sclaroff, Margrit Betke, George Kollios, Jonathan Alon, Vassilis Athitsos, Rui Li, John Magee, Tai-peng Tian
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

An overview of research in automated gesture spotting, tracking and recognition by the Image and Video Computing Group at Boston University is given. Approaches for localization and tracking human hands in video, estimation of hand shape and upper body pose, tracking head and facial motion, as well as efficient spotting and recognition of specific gestures in video streams are summarized. Methods for efficient dimensionality reduction of gesture time series, boosting of classifiers for nearest neighbor search in pose space, and model-based pruning of gesture alignment hypotheses are described. Algorithms are demonstrated in three domains: American Sign Language, hand signals like those employed by flight-directors on airport runways, and gesture-based interfaces for severely disabled users. The methods described are general and can be applied in other domains that require efficient detection and analysis of patterns in time-series, images or video.
A comprehensive framework for auditory display: Comments on Barrass, ICAD 1994
Authors: Stephen Barrass
Venue: ACM Transactions on Applied Perception (TAP) (2005)

In &lsquo;A Perceptual Framework for the Auditory Display of Scientific Data&rsquo; I described the first perceptually scaled sound space designed specifically for sonification. I modeled this sound space, and its underlying theory, on the use of perceptual colour spaces in scientific visualization. As I went on to apply the sound space in mappings of satellite data I introduced methods of data characterization and user-centered task analysis into my design framework. In trials I realized that satellite images allow you to see global information across millions of data values, whereas it was impossible to play all the data at once as sounds. This lead me to explore perceptual streaming as a means for perceiving similarity and difference in masses of sounded data. In work on sonifications for virtual reality applications I recognized the need to consider the semiotic linkage of the sound with the application domain, and the need to also link the sound with the interaction metaphor.The work described in this paper laid the foundation for the ongoing development of a comprehensive framework for auditory display that takes into consideration the perceptual organization of the sounds, the characteristics of the data, the gamut of the display device, the user's tasks, the semiotic linkage to the application domain, and the affordances for interaction.
Efficient discriminative learning of Bayesian network classifier via boosted augmented naive Bayes
Authors: Yushi Jing, Vladimir Pavlović, James M. Rehg
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning method tends to be suboptimal due to the mismatch between its optimization criteria (data likelihood) and the actual goal for classification (label prediction). Recent approaches to optimizing the classification performance during parameter or structure learning show promise, but lack the favorable computational properties of maximum likelihood learning. In this paper we present the Boosted Augmented Naive Bayes (BAN) classifier. We show that a combination of discriminative data-weighting with generative training of intermediate models can yield a computationally efficient method for discriminative parameter learning and structure selection.
Scheduling protocols for media-on-demand systems
Authors: Tammy Vandegrift
Venue:  (2005)

Today's abundance of personal electronic devices and the growth of communications networks gives rise to a new set of applications. One such application allows clients to access high-bandwidth streaming media at times of their choosing. The focus of this dissertation is on the media-on-demand application for use in high-bandwidth communications networks. A media-on-demand server stores and distributes one or more media files to clients who wish to view/play them. Because server bandwidth can be quickly consumed when delivering the full media file to each client under high loads, protocols for delivering streaming media try to reduce the server bandwidth used to satisfy client requests. Our work focuses on the stream merging technique, where clients can receive two streams simultaneously and buffer data for future parts of the media file. When clients have the same data as other clients in the system, we merge the clients into a single group and eliminate unnecessary streams. This dissertation introduces, analyzes, and empirically compares algorithms for three media-on-demand models. The first model, which we call media-on-demand, assumes the media file requested is of finite length and clients always consume the media file from its beginning. The second model, media-on-demand with time-shifting, supports access to any portion of a live broadcasted stream. Our contributions include devising an algorithm for media-on-demand systems under high client loads, modeling media-on-demand with time-shifting as a rectilinear tree, finding the complexity class for the optimal offline solution to media-on-demand with time-shifting, and introducing an online algorithm for the time-shifting case. Finally, we introduce a network cost model where we try to optimize the network bandwidth instead of the server bandwidth. We describe an algorithm to compute the network cost given a stream merging schedule and introduce an online stream merging algorithm for the network cost model.
A conceptual framework for society-oriented decision support
Authors: Yingjie Yang, David Gillingwater, Chris Hinde
Venue: AI Society (2005)

Inspired by the operation of human social organisation, this paper presents a new architecture&#x2014;a pyramid-committee&#x2014;for developing society-oriented intelligence, whose structure imitates the organisation of human society in its decision making. The system takes a pyramid-like hierarchical structure with links in the pyramid forming a semi-lattice, which relate not only to nodes in the same layer, but also to others in different layers. The output of the system is a result of the negotiation and balancing of different interests. For such a system to function, the main difficulties concern the complicated relationships between different factors or agents. Focussing on the airport environment audit, we discuss the development of a model framework and the role of neural networks.
Analysis of A Leader Election Algorithm in uCRL
Authors: Taolue Chen, Tingting Han, Jian Lu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper investigates the applicability of formal methods for the specification and verification of distributed algorithms. The problem of election is an important class of distributed algorithms that are widely studied in the literatures. We prove the correctness of a representative leader election algorithm, that is, the LCR algorithm, developed by LeLann, Chang and Roberts. This algorithm is one of the early election algorithms and serves as a nice benchmark for verification exercises. The verification is based on the µCRL, which is a language for specifying distributed systems and algorithms in an algebraic style and combines the process algebra and (equational) data types. We bring the correctness of the algorithm to a completely formal level. It turns out that this relatively "small" and simple" algorithm requires a rather involved proof for guaranteeing that it behaves well in all possible circumstance. This paper demonstrates the possibility to deliver completely formal and mechanically verifiable correctness proofs of highly nondeterministic distributed algorithm, which is indispensable in the design and implementation of distributed algorithm and systems.
Source-Synchronous Testing of Multilane PCI Express and HyperTransport Buses
Authors: David C. Keezer, Dany Minier, Patrice Ducharme
Venue: IEEE Design Test (2006)

Editor's note: Source-synchronous I/O buses, such as PCI Express and HyperTransport, are difficult to test with synchronous ATE. This article describes source-synchronous driver and receiver test modules that are tailored for these buses and that have the additional advantage of supporting jitter injection. --Scott Davidson, Sun Microsystems
Analysis of the BSB Model Dynamics Using Control Theory
Authors: Patricia Pelle, Carlos D'Attellis
Venue: Neural Processing Letters (2005)

A novel method to analyze the dynamics of the BSB (Brain State in a Box) model is presented. The method is able to determine if a proposed interconnection matrix generated with the CMM rule can achieve the desired behavior, and what are the parameters that should be changed in case of obtaining an incorrect final rest point. By means of an application of the techniques used in control system theory it is possible to evaluate the evolution of each of the training points individually and also to establish what are the points of the training set that are competing between them. So, this kind of analysis can be useful not only as a medium to modify the learning rule to obtain a better performance, but also as a tool to understand the limitations that the initial learning rule has. As an example of the application of this tool some simulated experiments were carried out in order to show the effectiveness of the proposed method.
Automated evaluation of hypertext search strategies
Authors: Richard C. Bodner
Venue:  (2005)

This thesis investigates the potential of using search agents to analyze the performance of interactive information retrieval systems. An evaluation framework uses idealized and simulated individual differences in hypertext search strategies to simulate differences in human search performance and link selection behaviour. Five distinct search strategies were identified and implemented in software. The software simulator allowed the search agents to interact with an information retrieval system, which employed dynamic hypertext as its interactive search mechanism. Three studies investigated the performance and behaviour of the search agents. The first study compared three embedded hypertext link-ranking strategies (which used textual similarity assessment algorithms) with corresponding human link rankings. Although the three algorithms studied had low overall correlation with the human participants, the analysis revealed that the algorithms performed better (relative to human judgments) under specific conditions (e.g., short vs. long documents) and were more highly correlated with the participants under those conditions. The second study compared performance when using different combinations of settings for the parameters that were relevant to each agent. Based on the results of this study, the best performing internal parameters for each agent were chosen and then used in a third study. The third study compared the performance of the agents with two different experimental factors, one representing variations in query tail size (i.e., how much of the prior search history/link selections were reflected in the current automatically generated query), and in newness (i.e., the extent to which agents were permitted to return to previously viewed documents). Both query tail size and newness affected the performance of the agents (precision decreased when newness increased and precision increased when query tail increased). This dissertation describes a framework for evaluating the effect of different search strategies and a search agent simulator based on the framework. The results of the simulation studies demonstrated a difference in terms of performance and link selection behaviour between the search agents. Effects of query difficulty and novelty on agent performance/behaviour were also identified. The simulator developed in this research should provide a useful platform for future studies of idealized search behaviour in interactive information retrieval.
First-principle calculations on gate/dielectric interfaces: on the origin of work function shifts
Authors: G. Pourtois, A. Lauwers, J. Kittl, L. Pantisano, B. Sorée, S. De Gendt, W. Magnus, M. Heyns, K. Maex
Venue: Microelectronic Engineering (2005)

The impact of interfacial chemistry occurring at dielectric/gate interface of P-MOS and N-MOS devices is reviewed through a quick literature survey. A specific emphasis is put on the way the bond polarization that occurs between a dielectric and a metal substrate impacts on the gate work function. First-principle simulations are then used to study the work function changes induced by dopant aggregation in nickel monosilicide metal gates. It is shown that the changes are a natural consequence of the variation of the interface polarization.
Corporate simulation models: a survey
Authors: Thomas H. Naylor, Charles Jeffress
Venue: ACM SIGSIM Simulation Digest (1976)

Within a period of less than five years, computer-simulation techniques have penetrated corporations in the United States, Canada, and Europe at the highest possible level. This paper summarizes the results of a survey of 346 corporations, most of which are either using, developing, or planning to develop some form of corporate simulation model. Among the questions addressed by the survey for which empirical answers have been sought are: Who is actually using corporate simulation models? Why are they being used? What resources are required to develop them? What techniques are employed? How much do they cost? What are the benefits to be derived from their use?The paper concludes with a series of specific recommendations for improving the effectiveness of corporate simulation models. First, corporate models should be made more user-oriented. Second, more attention needs to be given to the production activities of firms. Third, the possibility of integrating optimization models into corporate models needs to be explored further. Fourth, financial, marketing, and production models should be linked together. Fifth, the use of models to simulate the global environment of corporations should be considered. Sixth, greater emphasis should be placed on the "politics" of corporate model building.
Taxonomy of XML schema languages using formal language theory
Authors: Makoto Murata, Dongwon Lee, Murali Mani, Kohsuke Kawaguchi
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
A Framework for Detecting Network-based Code Injection Attacks Targeting Windows and UNIX
Authors: Stig Andersson, Andrew Clark, George Mohay, Bradley Schatz, Jacob Zimmermann
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Code injection vulnerabilities continue to prevail. Attacks of this kind such as stack buffer overflows and heap buffer overflows account for roughly half of the vulnerabilities discovered in software every year. The research presented in this paper extends earlier work in the area of code injection attack detection in UNIX environments. It presents a framework for detecting new or previously unseen code injection attacks in a heterogeneous networking environment and compares code injection attack and detection strategies used in the UNIX and Windows environments. The approach presented is capable of detecting both obfuscated and clear text attacks, and is suitable for implementation in the Windows environment. A prototype intrusion detection system (IDS) capable of detecting code injection attacks, both clear text attacks and obfuscated attacks, which targets Windows systems is presented.
Teaching SRE in a Diverse Graduate Student Context
Authors: Carol Smidts
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Software reliability has progressively become critical issues due to the number and the nature of the fields invaded. Software development companies need to be provided with the capability to improve their software development process and decrease its related costs. The Software Reliability Engineering Curriculum and in particular a graduate level software reliability modeling course at the University of Maryland was created to respond to this need. In this paper, the contents of the course in the context of a particularly diverse environment are discussed.
Mining Evolving Streams with Resource Adaptive Computation
Authors: Philip S. Yu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The problem of streaming data has gained importance in recent years because of advances in hardware technology. The ubiquitous presence of data streams in a number of practical domains has generated a lot of research in this area. Example applications include surveillance for terrorist attack, network monitoring for intrusion detection, and others. Problems such as data mining which have been widely studied for traditional data sets cannot be easily solved for the data stream domain. This is because the large volume of data arriving in a stream renders most algorithms to inefficient as most mining algorithms require multiple scans of data which is unrealistic for stream data. More importantly, the characteristics of the data stream can change over time and the evolving pattern needs to be captured. Furthermore, we also need to consider the problem of resource allocation in mining data streams. Due to the large volume and the high speed of streaming data, mining algorithms must cope with the effects of system overload. Thus, how to achieve optimum results under various resource constraints becomes a challenging task. In this talk, I'll provide an overview, discuss the issues and focus on how to mine evolving data streams and perform resource adaptive computation.