ppxscal/embedding_network huggingface dataset:
Efficient MLP Digital Implementation on FPGA
Authors: S. Vitabile, V. Conti, F. Gennaro, F. Sorbello
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The efficiency and the accuracy of a digital feedforward neural networks must be optimized to obtain both high classification rate and minimum area on chip. In this paper an efficient MLP digital implementation. The key features of the hardware implementation are the virtual neuron based architecture and the use of the sinusoidal activation function for the hidden layer. The effectiveness of the proposed solutions has been evaluated developing different FPGA based neural prototypes for the High Energy Physics domain and the automatic Road Sign Recognition domain. The use of the sinusoidal activation function decreases hardware resource employment of about 32% when compared with the standard sigmoid based neuron implementation. The virtual neuron implementation makes efficient the mapping of a neural network into hardware devices since it leads to a significant decreasing of concurrent memory access.
A Visual Analytics Agenda
Authors: James J. Thomas, Kristin A. Cook
Venue: IEEE Computer Graphics and Applications (2006)

In fields ranging from security to systems biology to business, the ability to collect data far outstrips the ability to analyze the data that have been collected.The science of visual analytics is meant to enable analysts of all types to overcome information overload so that they can detect the expected and discover the unexpected from massive, dynamic, conflicting, and incomplete information while rigorously adhering to privacy and security laws and policies. During the past year, a panel of research leaders from academia, industry government, the national laboratory system developed a five year research and development agenda for the field of visual analytics. This article presents a concise summary of that agenda.
Comparison of three major time: sharing financial modeling languages
Authors: Ken R. Adcock
Venue: ACM SIGSIM Simulation Digest (1976)

Most financial modeling languages have many common features. This paper is an attempt to put three such languages on common footing. No attempt is made to determine which one is superior as obviously different users have different requirements and, of course, the attributes of the time-sharing vendor must also be considered. To grade a vendor as to documentation, customer support, network availability, cost effectiveness, etc. is outside the scope of the paper.
On fairness in distributed job scheduling across multiple sites
Authors: G. Sabin, V. Sahasrabudhe, P. Sadayappan
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

Coordinated scheduling across multiple sites over the grid has become a possibility due to grid technologies such as Globus and the Silver meta-scheduler. This would allow user jobs to be transparently executed at remote sites across the grid, instead of a particular local cluster. Previous research has shown this type of job distribution to be beneficial in terms of average metrics such as loss of capacity and turnaround time. This research has sparked interest in implementing such schemes, for example on the Cluster Ohio system. However, an issue that has not been addressed is that of fairness - will jobs at less loaded sites be significantly adversely affected by the distributed scheduling schemes? Trace based simulations show that indeed, there can be considerable unfairness to the less loaded sites when previously proposed distributed scheduling schemes are used. We assess approaches to enhance fairness to jobs at local sites and show that they improve fairness while also providing very good overall performance.
Towards Ontology Generation from Tables
Authors: Yuri A. Tijerino, David W. Embley, Deryle W. Lonsdale, Yihong Ding, George Nagy
Venue: World Wide Web (2005)

At the heart of today's information-explosion problems are issues involving semantics, mutual understanding, concept matching, and interoperability. Ontologies and the Semantic Web are offered as a potential solution, but creating ontologies for real-world knowledge is nontrivial. If we could automate the process, we could significantly improve our chances of making the Semantic Web a reality. While understanding natural language is difficult, tables and other structured information make it easier to interpret new items and relations. In this paper we introduce an approach to generating ontologies based on table analysis. We thus call our approach TANGO (Table ANalysis for Generating Ontologies). Based on conceptual modeling extraction techniques, TANGO attempts to (i) understand a table's structure and conceptual content; (ii) discover the constraints that hold between concepts extracted from the table; (iii) match the recognized concepts with ones from a more general specification of related concepts; and (iv) merge the resulting structure with other similar knowledge representations. TANGO is thus a formalized method of processing the format and content of tables that can serve to incrementally build a relevant reusable conceptual ontology.
The design structure analysis system: a tool to analyze software architecture
Authors: Alan Maccormack
Venue:  (2005)

This thesis develops and validates a tool called the Design Structure Analysis System (DSAS) to analyze software architecture. DSAS extracts function call dependencies and uses Design Structure Matrix (DSM) techniques to display relationships among design elements and calculate measures of design structure for pre-existing designs. The specialized algorithms in DSAS allow the tool to process very large code bases, as compared to prior work which has adopted DSM techniques. The tool comprises four main modules. The architectural view module maps the design structure as the designer defined it. The bus detection module finds and marks system wide shared portions of functionality. The change cost module displays and measures the potential for a change to propagate through the system. Finally, the dependency clustering module heuristically arranges the software dependencies into an idealized form that has limited interactions among different modules. We validate the tool via three methods: (1) comparing the tool's output to existing literature that analyzes theoretical and practical examples of modularity, (2) analyzing code of familiar systems, and (3) analyzing longitudinal code re-designs where we are aware of the architect's intent. Subsequently, we use the tool to examine the hypothesis that distributed teams may produce more modular code than co-located teams. We find data to support this hypothesis by comparing open source systems (assumed to represent distributed teams) to proxies for closed source systems (assumed to represent co-located teams). We conclude by highlighting the contributions of this work, and pointing to future applications that may prove fruitful.
Mobility, route caching, and TCP performance in mobile ad hoc networks
Authors: David B. Johnson, Zvi M. Kedem
Venue:  (2005)

In a mobile ad hoc network, mobile nodes communicate with each other through wireless links. Mobility causes frequent topology changes. This thesis addresses the fundamental challenges mobility presents to on-demand routing protocols and to TCP. On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work used adaptive timeout mechanisms. However, heuristics cannot accurately estimate time outs because topology changes are unpredictable. I propose to proactively disseminate the broken link information to the nodes that have cached the link. I define a new cache structure called a cache table to maintain the information necessary for cache updates, and design a distributed cache update algorithm. This algorithm is the first work that proactively updates route caches in an adaptive manner. Simulation results show that proactive cache updating is more efficient than adaptive timeout mechanisms. I conclude that proactive cache updating is the key to the adaptation of on-demand routing protocols to mobility. TCP does not perform well in mobile ad hoc networks. Prior work provided link failure feedback to TCP so that it can avoid invoking congestion control mechanisms for packet losses caused by route failures. Simulation results show that my cache update algorithm significantly improves TCP throughput since it reduces the effect of mobility on TCP. TCP still suffers from frequent data and ACK losses. I propose to make routing protocols aware of lost TCP packets and help reduce TCP timeouts. I design two mechanisms that exploit cross-layer information awareness: early packet loss notification (EPLN) and best-effort ACK delivery (BEAD). EPLN notifies senders about lost data. BEAD retransmits ACKs at intermediate nodes or at receivers. Simulation results show that the two mechanisms significantly improve TCP throughput. I conclude that cross-layer information awareness is the key to making TCP efficient in the presence of mobility. I also study the impact of caching strategies on the scalability of on-demand routing protocols with mobility. I show that making route caches adapt quickly and efficiently to topology changes is the key to the scalability of on-demand routing protocols with mobility.
Believing is Seeing: Cultivating Radical Media Innovations
Authors: Christopher Stapleton, Charles E. Hughes
Venue: IEEE Computer Graphics and Applications (2006)

The infusion of artistic expression within scientific exploration of new media can be a process that defies some traditions and embraces a dangerous naïveté of the artists that appears to be an unpredictable alchemy of the mind, machine and magic. Like the alchemist, we don't need to see it to believe it; we see it because we believe it. Even though new science and technological capability spark every media revolution, its possibilities are proven by artistic imagination, the consequent effects inevitably changing life as we know it, and never in ways we expect. The emerging media of mixed reality¾the blending of real and synthetic environments and objects¾has melted the boundaries between physical and virtual realities, letting us interweave simulated characters and scenes into real-world experiences. So why do we treat mixed reality as we do more limiting media technology such as virtual reality, television, cinema, radio, or print media? A new vision might borrow from tradition, but by making creative leaps, we can find the magical power that lies within.
Using Augmented Reality to Treat Phobias
Authors: M. Carmen Juan, Mariano Alcaniz, Carlos Monserrat, Cristina Botella, Rosa M. Banos, Belen Guerrero
Venue: IEEE Computer Graphics and Applications (2005)

Exposure in vivo and VR therapies have proven to be effective in the treatment of different psychological disorders such as acrophobia, claustrophobia, or phobia to small animals; however until now augmented reality (AR) has not been used in these treatments. AR shares some advantages with VR with respect to in vivo treatments. Nevertheless, there are differences between AR and VR: the feeling of presence and reality judgment could be greater in AR. This article presents an AR system for the treatment of phobia to spiders and cockroaches. It was tested on nine patients, five of whom had a phobia to cockroaches and four of whom had a phobia to spiders. After a single 60-minute session using our AR system, the patients were able to approach a real spider/cockroach, interact with it, and kill it by themselves.
Modeling SPARK systems with UML
Authors: Xavier Sautejeau
Venue: ACM SIGAda Ada Letters (2005)

In this paper, we will consider two aspects of UML in order to assess how well suited it is for modeling SPARK systems. The first aspect is the ability to represent SPARK in UML from a theoretical perspective. The second aspect is more from a hands-on perspective and evaluates what makes a UML CASE-tool more suitable for modeling SPARK systems than another.
Preventing format-string attacks via automatic and efficient dynamic checking
Authors: Michael F. Ringenburg, Dan Grossman
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We propose preventing format-string attacks with a combination of static dataflow analysis and dynamic white-lists of safe address ranges. The dynamic nature of our white-lists provides the flexibility necessary to encode a very precise security policy---namely, that %n -specifiers in printf-style functions should modify a memory location x only if the programmer explicitly passes a pointer to x. Our static dataflow analysis and source transformations let us automatically maintain and check the white-list without any programmer effort---they merely need to change the Makefile. Our analysis also detects pointers passed to vprintf-style functions through (possibly multiple layers of) wrapper functions. Our results establish that our approach provides better protection than previous work and incurs little performance overhead.
Towards Semantic Service Request of Web Service Composition
Authors: Qainhui Althea Liang, Jen-Yao Chung, Steven Miller
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

When meeting the challenges in automatic and semi-automatic Web service composition, capturing the user's service demand and preferences is as important as knowing what the services can do. This paper discusses the idea of semantic service requests for composite services, and presents a way to model the elements of a composite service request as user preferences and constraints. The model is based on an interactive and iterative strategy meant to obtain the exact requirements from potential service consumers. The markup vocabularies and associated inference mechanism of OWL-S are used as a means to bring semantics to service requests. Language constructs are added to OWL-S as uniform representations of possible aspects of the requests. Using this model to represent the semantics of service requests enables the discovery agents to unambiguously understand the service need and precisely produce the desired composition. An application scenario is presented to illustrate how the proposed model can be applied to the real business world.
A SIP-Enabled Multimedia Service Framework for CERNET2
Authors: Qiu Chen, Jun Shen
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

China has carried out the world largest Next Generation Internet program CERNET2 (China Education and Research Network 2) based on IPv6. The success of CERNET2 will lie greatly on what new services we can get from it as compared with existing networks. In this paper we introduce a novel SIPenabled multimedia service framework aiming at providing campus users, who holding mobile or fixed end devices, with convenient, high-quality, rich and colorful real-time and non-real-time multimedia services. The framework is a three-layer model, which consists of transport network layer, session control layer, and application service layer. From the bottom up, we describe a SIP-enabled architecture with both wired and wireless access networks connecting to the backbone; explain the session controls of various multimedia services and define four basic SIP-based session types for the framework; introduce the management of various application services. Besides, policy-based end-to-end consistent QoS mechanism is applied to the framework. And we also address the seamless roaming support in SIP and consider the internetworking with commercial networks. A Wi-Fi phone service example presents itself frequently in this paper.
From Low-Level Features to High-Level Semantics: Are We Bridging the Gap?
Authors: Tsuhan Chen
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The performance of a content-based information retrieval (CBIR) system is very subjective and hence user-dependent. To the user, similarity between objects in the database is often highlevel and semantic. However, features extracted from objects directly in their digital representations are often low-level features. The gap between low-level features and high-level semantics has been the major obstacle to better retrieval performance. In this talk we will outline several approaches to bridging the gap between low-level features and high-level semantics, including hidden annotation and relevance feedback. We will present a few specific techniques: active learning, annotation propagation, feature space warping, and semantic metric linking, all aiming at propagating the semantics from some objects to the others.
A New Kind of Processor Interface for a System-on-Chip Processor with TIE Ports and TIE Queues of Xtensa LX
Authors: Tomonari Tohara
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Today, most System-on-a-Chip (SoC) ASIC chips integrate multiple processor cores as well as hard-wired RTL blocks to realize very complex applications. While computation performance of processors increases, data throughput becomes the bottleneck. Moreover, as processors and RTL blocks need to share data and control/status, inter processors/RTL communications become a serious issue. While various system interconnects have been introduced, processor interface architecture remains conceptually the same. To overcome the communication bottleneck, this paper presents a new type of embedded processor interface for SoC design. And, as the actual realization of such an interface, the TIE ports and TIE queues of XtensaLX processor from Tensilica, Inc. is introduced in this paper.
Cellular CDMA Capacity with Out-of-Band Multihop Relaying
Authors: Dongmei Zhao, Terence D. Todd
Venue: IEEE Transactions on Mobile Computing (2006)

In this paper, we consider the capacity of cellular code division multiple access (CDMA) when there is out-of-band ad hoc traffic relaying. The mobile stations (MSs) are dual-mode, having both ad hoc and cellular CDMA radios. An active MS is free to choose any available relay station (RS) within its ad hoc radio coverage area for dual-hop communication with the CDMA base station (BS). Communications between the RSs and the MSs use bandwidth which is available to the ad hoc radio and does not consume the CDMA capacity. Using this mechanism, CDMA interference can be reduced by dynamically selecting RSs which have more favorable CDMA link characteristics. Several relay station selection criteria are considered, namely, ad hoc relaying with low relative interference (ARRI), with best link gain (ARLG), and with shortest distance (ARSD). The relay station selection protocols are compatible with existing wireless local area network (WLAN) standards such as IEEE 802.11. An analytic model is used to compute the effects on uplink and downlink CDMA capacities when out-of-band relaying is added. The results show that very significant capacity improvements are possible by using these criteria compared with conventional CDMA with hard or soft handoff. Ad hoc relaying which dynamically tracks CDMA link quality can achieve greater capacity improvements than that using a distance-based relay station selection. Relaying, which considers both signal and interference conditions, achieves better capacity than that based on signal link quality alone.
Digital RF Processing Techniques for SoC Radios, invited
Authors: Robert Bogdan Staszewski, Khurram Muhammad, Dirk Leipold
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we describe key digital RF processing techniques behind the first single-chip Bluetooth and GSM/EDGE radios realized in 130-nm and 90-nm digital CMOS process technologies, respectively. The local oscillator, transmitter and receiver are architectured from the ground up to be compatible with digital deep-submicron CMOS processes and be readily integrated with a digital baseband and application processors. The conventional RF frequency synthesizer architecture, based on the voltage-controlled oscillator and the phase/frequency detector and charge-pump combination, has been replaced with a digitally-controlled oscillator and a time-to-digital converter, respectively. The transmitter employs a polar architecture with all-digital phase/frequency and amplitude modulation paths. The phase/frequency modulation is based on the direct wideband frequency modulation capability of an all-digital phase-locked loop. The amplitude modulation path directly is built on a digitally-controlled power amplifier. The receiver employs a discrete-time architecture in which the RF signal is directly sampled and processed using analog and digital signal processing techniques. The discrete-time filtering at each signal processing stage is followed by successive decimation, such that great selectivity is achieved right at the mixer level.
Operational Semantics for Real-Time Processes with Action Refinement
Authors: Xiuli Sun, Jinzhao Wu
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

In this paper we propose an event-based operational interleaving semantics for a real-time process algebra, for which action refinement and a denotational true concurrency semantics have been developed and defined in terms of timed event structures by the second author. We characterize the timed event traces that are generated by the operational semantics in a denotational way, and show that this operational semantics is consistent with the denotational semantics in the sense that they generate the same set of timed event traces, thereby eliminating the gap between the true concurrency and interleaving semantics.
Cloning-Based Checkpoint for Localized Recovery
Authors: Zunce Wei, Hon F. Li, Dhrubajyoti Goswami
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

This paper studies the use of process clones towards localizing recovery in large-scale distributed systems. A clone is a virtual recovery process with a limited life, and is useful for decoupling recovery dependencies among checkpoints. A generic Checkpoint Dependency Graph (CDG) model is used to capture the dependency relations among checkpoints. A Non-atomic Group Checkpoint (NGC) protocol is presented. It is proved that the protocol can result in localized recovery involving a single group when clones are employed. To limit recovery spread, the size of a group should be limited. This paper presents a few interesting results in this aspect: (i) there is no embedded protocol for atomic group formation with a bounded group-size (k-bounded protocol); (ii) a k-bounded atomic group checkpoint protocol requires at least m-1 explicit messages for checkpoint synchronization in a system consisting of m processes. Lastly, a simple k-bounded atomic group checkpoint protocol is presented and proved.