ppxscal/embedding_network huggingface dataset:
Activity Counter: New Optimization for the dynamic scheduling of SIMD Control Flow
Authors: Ronun Keryell, Nicolas Paris
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

SIMD or vector computers and collection-oriented languages, like C*, are designed to perform the same computation on each data item or on just a subset of the data. Subsets of processors or data items implemented via an activiry bit and a stack of activity bits when subsets of subsets are supported. This method is also used in VLIWprocessors through if-conversion to implement paralalle1 control flow as in SIMD computers. Wt present a new method of dynamic scheduling of several SIMD control flow constructions which can be nested.
ScriptEase: A generative/adaptive programming paradigm for game scripting
Authors: Maria Cutumisu, Curtis Onuczko, Matthew McNaughton, Thomas Roy, Jonathan Schaeffer, Allan Schumacher, Jeff Siegel, Duane Szafron, Kevin Waugh, Mike Carbonaro, Harvey Duff, Stephanie Gillis
Venue: Science of Computer Programming (2007)

The traditional approach to implementing interactions between a player character (PC) and objects in computer games is to write scripts in a procedural scripting language. These scripts are usually so complex that they must be written by a computer programmer rather than by the author of the game story. This interruption in the game story authoring process has two distinct disadvantages: it increases the cost of game production and it introduces a disconnect between the author's intentions and the interactions produced from the programmer's written scripts. We introduce a mechanism to solve these problems. We show that game authors (non-programmers) can generate the necessary scripts for implementing meaningful interactions between the PC and game objects using a three-step process. In the first step, the author uses a generative pattern (concept) to create a high-level description of a commonly occurring game scenario. In the second step, the author uses a standard set of adaptation operations to customize the high-level description to the particular circumstances of the story that is being told. In the third step, the author presses a button that automatically generates scripting code from the adapted pattern. We describe the results of three studies in which a combined total of 56 game story authors used this three-step process to construct Neverwinter Nights game stories, using a tool called ScriptEase. We believe that this generative/adaptive process is the key to future game story scripting. More generally, this article advocates the development of adaptive programming as an alternative to current constructive programming techniques, as well as the application of adaptive programming in many domains.
Fuzzy Related Classification Approach Based on Semantic Measurement for Web Document
Authors: Hui Zhang, Han-Tao Song
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

A fuzzy related classification approach for Web document based on ontology concept semantic measurement is presented in this paper. The features of ontology in the semantic web are explored, and a method to compute the semantic similarity between concepts is put forward. Motivated by the semantic similarity and the fuzzy characteristics of the Web document, the fuzzy related technology combined with VSM in classifying Web documents into a predefined set of ontology categories is adopted. Finally some examples are presented to show that the results are satisfying.
From PIMs to PSMs
Authors: Peter H. Feiler, Dio de Niz, Chris Raistrick, Bruce A. Lewis
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

The development of embedded systems through models requires the creation of both a platform independent model (PIM) and a platform specific model (PSM). xUML is an extension to UML that adds precise execution semantics to models enabling a full description of platform independent models and the generation of code from them. However, to achieve different non-functional properties, a platform specific model is needed. Architecture Analysis and Design Language (AADL) enables the creation and exploration of PSMs and the analysis of its non-functional properties. In this work we present the integration of xUML and AADL in a development process. This includes the translation of the xUML concurrency model into AADL and the exploration of concurrency variations in AADL.
The Commons as New Economy and What This Means for Research
Authors: Richard P. Gabriel
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Suppose the entire social and commercial fabric supporting the creation of software is changing-changing by becoming completely a commons and thereby dropping dramatically in cost. How would the world change and how would we recognize the changes? Software would not be continually recreated by different organizations, so the global "efficiency" of software production would increase dramatically; therefore it would be possible to create value without waste, experimentation and risk-taking would become affordable and probably necessary because firms could not charge for their duplication of infrastructure, and the size and complexity of built systems would increase dramatically, perhaps beyond human comprehension. As important or more so, the activities of creating software would become the provenance of people, organizations, and disciplines who today are mostly considered consumers of software - there would, in a very real sense, be only a single software system in existence, continually growing; it would be an ecology husbanded along by economists, sociologists, governments, clubs, communities, and herds of disciplines. New business models would be developed, perhaps at an alarming rate. How should we design our research to observe and understand this change? There is some evidence the change is underway, as the result of the adoption of open source by companies who are not merely appreciative receivers of gifts from the evangelizers of open source, but who are clever thieves re-purposing the ideas and making up new ones of their own.
Fast neighbor join and link breakage detection for METX-based routing in wireless sensor networks
Authors: H. Wang, L. H. Ngoh, W. K. G. Seah, D. He
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

In this paper, we present fast neighbor join and fast link breakage detection schemes to enhance the minimal expected transmission (METX)-based routing scheme reported recently (Woo et al. (2003)). Current METX-based routing scheme uses a link estimator named window mean with exponential weighted moving average (WMEWMA) (Woo et al. (2003)), which is relatively slow in neighbor join and delete, thus affecting the way the network adapts to the dynamic of links. To solve this problem, we propose a fast neighbor join and a fast link breakage detection scheme. The fast join scheme can turn on the links with good quality rapidly while the fast link breakage detection scheme shortens the time to identify the broken link. Through extensive simulation we show that the two schemes work well together with the WMEWMA estimator and therefore improve the performance of routing in a dynamic environment.
A Hybrid Trust Model for Enhancing Security in Distributed Systems
Authors: Ching Lin, Vijay Varadharajan
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We propose a hybrid trust model for enhancing security in distributed applications by combining the "hard" and "soft" trust relationships. The motivation is to compensate for the drawbacks associated with individual hard trust and soft trust models. We develop a formal hybrid trust model for specifying the hybrid trust relationships and associated operations. The new model provides a flexible way for specifying the security relevant trust requirements which compensate the drawbacks of the individual trust models while preserving their advantages. We provide application guidelines on how the hybrid trust relationships can be applied to achieve mutual improvements between the individual models.
On the Minimum Order of Extremal Graphs to have a Prescribed Girth
Authors: C. Balbuena, P. Garci´a-Va´zquez
Venue: SIAM Journal on Discrete Mathematics (2007)

We show that any $n$-vertex extremal graph $G$ without cycles of length at most $k$ has girth exactly $k+1$ if $k\ge 6$ and $n>(2(k-2)^{k-2}+k-5)/(k-3)$. This result provides an improvement of the asymptotical known result by Lazebnik and Wang [J. Graph Theory, 26 (1997), pp. 147-153] who proved that the girth is exactly $k+1$ if $k\ge 12$ and $n\ge 2^{a^2+a+1}k^a$, where $a=k-3-\lfloor(k-2)/4\rfloor$. Moreover, we prove that the girth of $G$ is at most $k+2$ if $n>(2(t-2)^{k-2}+t-5)/(t-3)$, where $t=\lceil (k+1)/2\rceil\ge 4$. In general, for $k\ge 5$ we show that the girth of $G$ is at most $2k-4$ if $n\ge 2k-2$.
Data-flow transformations using Taylor expansion diagrams
Authors: M. Ciesielski, S. Askar, D. Gomez-Prado, J. Guillot, E. Boutillon
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical, word-level data structure, Taylor Expansion Diagram (TED), is used as a vehicle to effect this transformation. The problem is formulated as that of applying a sequence of decomposition cuts to a TED that transforms it into a DFG optimized for a particular objective. A systematic approach to arrive at such a decomposition is described. Experimental results show that such constructed DFG provides a better starting point for architectural synthesis than those extracted directly from HDL specifications.
Termination of abstract reduction systems
Authors: Jeremy E. Dawson, Rajeev Goré
Venue: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65 (2007)

We present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting proofs of termination for typed combinatory logic. Thus, our method can handle most path-orderings in the literature as well as the reducibility method typically used for typed combinators. Finally we show how our theorem can be used to prove termination for incrementally defined rewrite systems, including an incremental general path ordering. All proofs have been formally machine-checked in Isabelle/HOL.
Providing dynamic and customizable caching policies
Authors: J. Fritz Barnes, Raju Pandey
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Web caching has emerged as one solution for improving client latency on the web. Cache effectiveness depends on the policies used to route requests to other caches and servers, to maintain up-to-date web objects and to remove objects from the cache. Traditional caches apply one set of policies, which determines the efficiency as well as the effectiveness of the caches. This set of policies often does not exploit the diversity inherent in different web objects, caches and clients. Policies that do exploit this diversity result in convoluted caching policies that attempt to combine multiple policies and guess at the unknown characteristics of web objects, caches and clients. In this paper, we present an extensible caching infrastructure in which cache administrators, servers, and end users can customize how web objects are cached, replaced, and kept consistent. The infrastructure includes a domain-specific language, CacheL, for defining customizable caching policies that can be changed dynamically. Analysis of our prototype, PoliSquid, shows the benefits of the infrastructure for variable coherency policies, localized removal policies, and early removal of objects from servers.
Peer-to-peer checkpointing arrangement for mobile grid computing systems
Authors: Paul J. Darby,  III, Nian Feng Tzeng
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

This paper deals with a novel, distributed, QoS-aware, peer-to-peer checkpointing arrangement component for <u>Mo</u>bile <u>G</u>rid (MoG) computing systems middleware. Checkpointing is more crucial in MoG systems than in their wired counterparts due to node mobility and less reliable wireless links resulting in frequent and dynamic connections and disconnections. Having determined the globally optimal checkpoint arrangement to be NP-complete, we consider ReD, our Reliability Driven (ReD) protocol, employing QoS-aware heurisitcs, for constucting superior peer-to-peer checkpointing arrangements efficiently.
A system characterization/identification laboratory teaching tool for Internet
Authors: S. Chatfield
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes the design and implementation of a simple Internet-based "virtual systems laboratory" teaching tool. The tool is intended to provide a mechanism for assignment of system characterization/identification exercises in courses where students have access to Internet electronic mail, but not necessarily to a common computing environment or more sophisticated Internet resources such as Mosaic or Netscape. Specific exercises developed for use with this software in classes at Arizona State University are described.
Rapid speech recognizer adaptation to new speakers
Authors: V. Digalakis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper summarizes the work of the "Rapid Speech Recognizer Adaptation" team in the workshop held at Johns Hopkins University in the summer of 1998. The project addressed the modeling of dependencies between units of speech with the goal of making more effective use of small amounts of data for speaker adaptation. A variety of methods were investigated and their effectiveness in a rapid adaptation task defined on the Switchboard conversational speech corpus is reported.
Heuristic techniques for synthesis of hard real-time DSP application specific systems
Authors: M. Potkonjak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We introduce an approach for the design and optimization of ASIC implementations which realize multiple computational tasks under hard real-time constraints. The approach designs a multitask ASIC by combining techniques from hard real-time scheduling and behavioral synthesis. The key component of the methodology is the successive multiresolution synthesis technique. The technique starts from an incompletely specified preliminary solution and uses interchangeably operating systems and behavioral synthesis tools to derive increasingly more detailed and complete design solutions. The effectiveness of the optimization algorithms is demonstrated on several multiple task designs.
Interorganizational information sharing in the airline industry: An analysis of stock market responses to code-sharing agreements
Authors: Y. I. Song, W. Woo, H. R. Rao
Venue: Information Systems Frontiers (2007)

This paper addresses the issue of inter-organizational information sharing alliances and their impacts on firm values from the perspective of inter-organizational coordination between partners in the airline industry setting. We investigate the shareholder wealth effects of inter-organizational information-sharing alliance arrangements, using 131 code-sharing agreements in the airline industry during 1984---1997. Employing event study methodology we found that the information sharing alliances between similar partners did create positive value in terms of stock returns at the time of alliance announcements to major US airlines. However, alliances between dissimilar partners resulted in significant losses of shareholder value to the major airlines. These results strongly support our main hypotheses that information-sharing alliances are successful and the benefits of such alliances are realized only when the coordination difficulties can be effectively dealt with.
Analysis of the Impact of Demosaicking on JPEG Image Compression
Authors: Colin Doutre, Panos Nasiopoulos
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Most consumer digital cameras capture colour data using a single light sensor with a colour filter array (CFA). This results in a mosaic image where each pixel location contains either a red, green or blue sample, and the two missing colours must be interpolated from the surrounding samples in a process called demosaicking. After demosaicking the image is typically compressed with lossy methods. In this paper we examine the impact demosaicking has on subsequent JPEG compression of still images. Simulations indicate the demosaicking method chosen affects the amount of error introduced in the compression stage and that the amount of compression applied affects the benefit from using more advanced demosaicking methods.
Energy Driven Application SelfAdaptation
Authors: Jorgen Peddersen, Sri Parameswaran
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Until recently, there has been a lack of methods to trade-off energy use for quality of service at run-time in stand-alone embedded systems. Such systems are motivated by the need to increase the apparent available battery energy of portable devices, with minimal compromise in quality. The available systems either drew too much power or added considerable overheads due to task swapping. In this paper we demonstrate a feasible method to perform these trade-offs. This work has been enabled by a low-impact power/energy estimating processor which utilizes counters to estimate power and energy consumption at run-time. Techniques are shown that modify multimedia applications to differ the fidelity of their output to optimize the energy/quality trade-off. Two adaptation algorithms are applied to multimedia applications demonstrating the efficacy of the method. The method increases code size by 1% and execution time by 0.02%, yet is able to produce an output which is acceptable and processes up to double the number of frames.
A Multi-Carrier UHF Passive RFID System
Authors: Hsin-Chin Liu, Yung-Ting Chen, Wen-Shin Tzeng
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The "Gen2" specification for UHF passive RFID system released by EPCglobal has become an intense research interest. A Gen2 tag derives its power from the RF wave emitted by a Gen2 RFID reader and responds its modulated backscatter signals to the reader. Due to the large propagation loss, the accessible range of a Gen2 tag is hence limited. Moreover, the readability of a Gen2 tag is often influenced by the multipath fading problem. In this paper we propose a multi-carrier UHF passive RFID system that can effectively extend the accessible range of a Gen2 tag. In addition, we investigate the multiband backscatter property of Gen2 tags, which can be utilized to mitigate the multipath fading problems.
Making events less slippery with eel
Authors: Ryan Cunningham, Eddie Kohler
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Event-driven programming divides a program's logical control flow into a series of callback functions, making its behavior difficult to follow. However, current program analysis techniques can preserve the event model while making event-driven code easier to read, write, debug and maintain. We designed the Explicit Event Library (libeel) to be amenable to program analysis, and created tools to graphically expose control flow, verify resource safety properties, and simplify debugging. The result sustains the advantages of event-driven programming while adding the important advantage of programmability.
Selection criteria for hypothesis driven lexical adaptation
Authors: P. Geutner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Adapting the vocabulary of a speech recognizer to the utterance to be recognized has proven to be successful both in reducing high out-of-vocabulary as well as word error rates. This applies especially to languages that have a rapid vocabulary growth due to a large number of inflections and composita. This paper presents various adaptation methods within the hypothesis driven lexical adaptation (HDLA) framework which allow speech recognition on a virtually unlimited vocabulary. Selection criteria for the adaptation process are either based on morphological knowledge or distance measures at phoneme or grapheme level. Different methods are introduced for determining distances between phoneme pairs and for creating the large fallback lexicon the adapted vocabulary is chosen from. HDLA reduces the out-of-vocabulary-rate by 55% for Serbo-Croatian, 35% for German and 27% for Turkish. The reduced out-of-vocabulary rate also decreases the word error rate by an absolute 4.1% to 25.4% on Serbo-Croatian broadcast news data.
The IMAGETCL multimedia algorithm development system
Authors: Charles B. Owen
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

The IMAGETCL multimedia development system is a new Tcl/Tk-based development environment specifically targeting development of high-performance multimedia data analysis algorithms. Multimedia algorithm development is complicated by large volumes of data, complex file formats, compression and decompression, and temporal synchronization. Testing algorithms requires elaborate user interfaces which can display intermediate and result images, play audio, and adjust parameters. IMAGETCL uses the features of the Tcl/Tk environment as a base on which to build a system that significantly aids this process. This paper describes the IMAGETCL approach to algorithm development and describes several applications of IMAGETCL in the Dartmouth Experimental Visualization Laboratory (DEVLAB).
Securing electronic mail on the national research and academic network of Italy
Authors: Roberto Cecchini, Fulvia Costa, Alberto D'Ambrosio, Domenico Diacono, Giacomo Fazio, Antonio Forte, Matteo Genghini, Michele Michelotto, Ombretta Pinazza, Alfonso Sparano
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Sec-mail is a group of site administrators in the GARR (Gruppo Armonizzazione Reti della Ricerca - Research Networks Harmonisation Group) network dedicated to the security of E-mail services. GARR is the National Research and Academic Network of Italy. The main points covered are in: methodologies to improve the efficiency of spam detection (mainly tuning of SpamAssassin), definition of best practices in electronic mail administration, sender domain authentication, greylisting and spam monitoring.