ppxscal/embedding_network huggingface dataset:
Implementing lexical and creative intentionality in synthetic personality
Authors: Jan Canon-Bowers
Venue:  (2005)

Creating engaging, interactive, and immersive synthetic characters is a difficult task and evaluating the success of a synthetic character is often even more difficult. The later problem is solved by extending Turing's Imitation Game thusly: computational construct should be evaluated based on the criteria of how well the character can mimic a human. In order to accomplish a successful evaluation of the proposed metric, synthetic characters must be consistently believable and capable of role-appropriate emotional expression. The author believes traditional synthetic characters must be improved to meet this goal. For a synthetic character to be believable, human users must be able to perceive a link between the mental state of the character and its behaviors. That is to say, synthetic characters must possess intentionality. In addition to intentionality, the mental state of the character must be human-like in order to provide an adequate frame of reference for the human users' internal simulations, to wit, the character's mental state must be comprised of a synthetic model of personality, of personality dynamics, and of cognition, each of which must be psychologically valid and of sufficient fidelity for the type of character represented. The author proposes that synthetic characters possessing these three models are more accurately described as synthetic personalities. The author proposes and implements computational models of personality, personality dynamics, and cognition in order to evaluate the psychological veracity of these models and computational equivalence between the models and the implementation as a first step in the process of creating believable synthetic personalities.
Web-oriented Warfare Command Decision Support System Based on Agent and Data Warehouse
Authors: Xiaofei Wang, Yunqiu Chen
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The warfare command decision support system is more and more important in war. Firstly, this paper discusses the weakness of existed DSS (Decision Support System). Secondly, the architecture of Weboriented Warfare Command DSS based on Agent and Data Warehouse (WOWC-DSS) is proposed. Thirdly, agent and data warehouse involved in such a system is discussed in detail. Fourthly, the Interface Agent based on MVC is introduced. Furthermore, this paper extends Struts framework by establishing a new description file of Struts framework to implement the Interface Agent, which makes the client web browse interface more friendly and easy to configure. Finally, B/S three-tire architecture based on J2EE is constructed, which improves the ability to cooperate with others.
Emerging Technologies for Next-generation GRID
Authors: Angelo Corsaro, Antonella Di Stefano, Giuseppe Pappalardo, Corrado Santoro, Emiliano Tramontana
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The second international workshop on Emerging Technologies for Next-generation GRID (ETNGRID) gathered many researchers working on emerging aspects of Grid computing. Submitted papers focused on challenging open problems, proposing solutions based on approaches borrowed from the world of distributed systems, as well as new and promising techniques. We provide here a brief overview of the papers, showing the contribution given and the advances introduced in the field of Grid computing.
Naming data items
Authors: Douglas E. James
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

Naming data items is the art of converting well-defining descriptions of data items into meaningful names. The data name is made meaningful by including essential elements of the description in the data name and by a consistent ordering of those elements. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Cooperative resource sharing by integrating cellular and mobile ad hoc networks
Authors: Matt W. Mutka
Venue:  (2005)

Mobile users are demanding for &ldquo;anywhere, anytime, always-on and high-speed&rdquo; wireless services. However, this requirement can not be meet by current wireless technologies. The popular WLANs and WWANs are limited in either coverage range or transmission data rates. On the other hand, the wireless resources are not fully utilized by the mobile users. In this document, a novel Cooperative Integrated Wireless Network Architecture (CI-WNA) is proposed to take the advantages of both the high-speed WLANs and the cellular data networks for a better utilization of the costly cellular resource. The mobile devices cooperate and share their idle cellular links to the WWANs via a mobile ad hoc network (MANET) formed from WLAN technologies. Some of the peers may act as servers or proxies, providing different kinds of services for the other members in the same MANET. The WLAN and WWAN technologies are combined to leverage their advantages and share the resources of mobile devices without any changes to the underlying network infrastructure. The performance improvement in the cellular data networks comes from the efficient peer-to-peer sharing of the idle resources among the mobile users. Four different applications are proposed aiming to reduce the power consumption of the cellular interfaces, to improve the QoS of the cellular links, and to reduce the download latency of large files from Internet servers. A new set of network protocols are developed for CIWNA to address on the network formation, group management, proxy rotation, message routing, service discovery, failure recovery, and security and privacy. A distributed trust model and a mechanism for using credits are presented to promote the incentive of cooperation among a group of strangers in CIWNA. Peers benefit cooperatively when they follow the scheme. Malicious peers are excluded from the system. Game theoretical analysis is provided to justify the proposed trust model and the credit system.
Instruction Based Testbench Architecture, invited
Authors: Ho-seok Choi, Seung-beom Lee, Sin-chong Park
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents the synthesizable test-bench architecture based on the defined instruction for standalone mode verification. The proposed test-bench performs fast emulation with low resource and increases flexibility and reusability with variable description of instructions. To prove the performance of our testbench, we verified IEEE 802.11a PHY baseband system and compare with co-sim mode and modified co-sim mode emulation.
GridPML: A Process Modeling Language and History Capture System for Grid Service Composition
Authors: Hua Ma, Susan D. Urban, Yang Xiao, Suzanne W. Dietrich
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper presents a process modeling language known as the GridPML for the composition of Grid Services. The GridPML is an XML-based language that supports basic control flow constructs adopted from Web Service composition languages with features for invoking Grid Services. The GridPML defines an approach to Grid Service lifecycle management that creates service instances as needed at run time. The GridPML also supports the use of process parameters, complex type variable assignment from different Grid Services, and collection type indexing. A process execution history containing the execution context is created and maintained by the GridPML execution engine, forming the basis of future research for analyzing the semantic correctness of concurrent process execution. In addition to presenting the design and implementation of the GridPML language, this paper also outlines future directions for exception handling and recovery features for the GridPML language and execution environment.
Who Are You?
Authors: Bruce Roberts
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The internet has become central to commerce, international and domestic, and multimedia technology is at the core of this explosive growth. The future is virtually unlimited with but one significant and growing concernprotection - of the privacy of the individuals employing the internet (or identified in the many repositories of businesses that record information on their customers to better serve them), the intellectual property or confidential business practices of the businesses employing the internet and the safety and security of the public.
16-Bit Segmented Type Current Steering DAC for Video Applications
Authors: Gaurav Raja, Basabi Bhaumik
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, 16-bit, 50 MHz Current Steering DAC is designed. This DAC is implemented using TSMC 0.35 µm technology. An optimum segmentation is done of 16-bits into binary and thermometric bits. The integral nonlinearity (INL) and differential non-linearity (DNL) is less than 0.3 LSB and 0.1 LSB respectively. It occupies only 0.06 mm2 area. The average total power consumption is 165 mW. A novel technique has been applied to reduce the glitch energy. The design is implemented with the matching requirements, required for current sources.
Compact approximations to Bayesian predictive distributions
Authors: Edward Snelson, Zoubin Ghahramani
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing the KL divergence between the true predictive density and a suitable compact approximation. We consider various methods for doing this, both sampling based approximations, and deterministic approximations such as expectation propagation. These methods are tested on a mixture of Gaussians model for density estimation and on binary linear classification, with both synthetic data sets for visualization and several real data sets. Our results show significant reductions in prediction time and memory footprint.
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
Authors: Anders Gidenstam, Marina Papatriantafilou, Hakan Sundell, Philippas Tsigas
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

We present an efficient and practical lock-free implementation of a memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the memory prevented for reuse. To the best of our knowledge, this is the first lock-free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-free algorithms of dynamic data structures that require strong garbage collection support.
Addressing cheating in distributed MMOGs
Authors: Patric Kabus, Wesley W. Terpstra, Mariano Cilia, Alejandro P. Buchmann
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

Massively Multiplayer Online Games (MMOGs) are a risky business: while they offer potential profits beyond those of conventional computer games, they also require costly investment in the necessary hardware infrastructure. In nearly every MMOG today, these costs come from the use of a Client/Server architecture where the load of possibly hundred thousands of players must be handled at the provider's backend. By using distributed Peer-to-Peer techniques, the load could be shifted completely or partially to the players' machines. But with the load, the control over the game may also fall into the hands of clients. While using a P2P architecture, this paper presents a spectrum of options which reduce running costs and simultaneously attempt to retain the provider's control over the game, in particular to control cheating.
A Locating Method for WLAN based Location Service
Authors: Victor Lang, Cynthia Gu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

General Wireless Local Area Network (WLAN) based location systems use the Received Signal Strength (RSS) as location fingerprint without any additional changes to the WLAN infrastructure. However, in real environment RSS are impacted by many factors, such as multiple path transmission (Multi-Path), temperature, body, etc, which harm the accuracy of location. This paper presents a method which uses both the angle of arrival (AOA) and RSS as location fingerprints based on AP scanning. Compared to other WLAN based location systems, this method takes advantages of fewer AP, less suffering from the influence of signal and higher accuracy. Furthermore, in some "clean" outdoor/indoor environments, the method can even used to locate WLAN clients without the radio map which is the basic infrastructure of general WLAN based location systems. Finally, this paper analyzes the characteristics of the AP scanning based location systems, and makes a further discussion on client-side location system using the same method.
Large sum-free sets in ternary spaces
Authors: Vsevolod F. Lev
Venue: Journal of Combinatorial Theory Series A (2005)

We show that any sum-free subset A ⊆ F3r (with an integer r ≥ 3), satisfying |A| > 5 ċ 3r-3, is contained in a hyperplane. This bound is best possible: there exist sum-free subsets of cardinality |A| = 5 ċ 3r-3 not contained in a hyperplane.Conjecturally, if A ⊆ F3r is maximal sum-free and aperiodic (not a union of cosets of a non-zero subgroup), then |A| ≤ (3r-1 + 1)/2. If true, this is best possible and allows one for any fixed ε > 0 to establish the structure of all sum-free subsets A ⊆ F3r such that |A| > (1/6 + ε) ċ 3r.
Socially Acceptable Behavior
Authors: Charlene O'Hanlon
Venue: Queue (2005)

While perusing the &ldquo;popular&rdquo; section of the social bookmarking site del.icio.us recently, I was struck by the myriad off-the-wall sites that users are bookmarking. Indeed, one of the most popular sites (311 bookmarks!) was titled, &ldquo;Vanishing Point: How to disappear in America without a trace.&rdquo;
Exploiting Vector Parallelism in Software Pipelined Loops
Authors: Samuel Larsen, Rodric Rabbah, Saman Amarasinghe
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

An emerging trend in processor design is the addition of short vector instructions to general-purpose and embedded ISAs. Frequently, these extensions are employed using traditional vectorization technology first developed for supercomputers. In contrast, scalar hardware is typically targeted using ILP techniques such as software pipelining. This paper presents a novel approach for exploiting vector parallelism in software pipelined loops. The proposed methodology. Our approach results in better resource utilization and allows for software pipelining with shorter initiation intervals. The proposed optimization is applied in the compiler backend, where vectorization decisions are more amenable to cost analysis. This is unique in that traditional vectorization optimizations are usually carried out at the statement level. Although our technique most naturally complements statically scheduled machines, we believe it is applicable to any architecture that tightly integrates support for instruction and data level parallelism. We evaluate our methodology using nine SPEC FP benchmarks. In comparison to software pipelining, our approach achieves a maximum speedup of 1.38x, with average of 1.11x
Evolution, Generality and Robustness of Emerged Surrounding Behavior in Continuous Predators-Prey Pursuit Problem
Authors: Ivan Tanev, Michael Brzozowski, Katsunori Shimohara
Venue: Genetic Programming and Evolvable Machines (2005)

We present the result of our work on the use of strongly typed genetic programming with exception handling capabilities for the evolution of surrounding behavior of agents situated in an inherently cooperative environment. The predators-prey pursuit problem is used to verify our hypothesis that relatively complex surrounding behavior may emerge from simple, implicit, locally defined, and therefore--scalable interactions between the predator agents. Proposing two different communication mechanisms ((i) simple, basic mechanism of implicit interaction, and (ii) explicit communications among the predator agents) we present a comparative analysis of the implications of these communication mechanisms on evolution, generality and robustness of the emerged surrounding behavior. We demonstrate that relatively complex-surrounding behavior emerges even from implicit, proximity-defined interactions among the agents. Although the basic model offers the benefits of simplicity and scalability, compared to the enhanced model of explicit communications among the agents, it features increased computational effort and inferior generality and robustness of agents' emergent surrounding behavior when the team of predator agents is evolved in noiseless environment and then tested in noisy and uncertain environment. Evolution in noisy environment virtually equalizes the robustness and generality characteristics of both models. For both models however the increase of noise levels during the evolution is associated with evolving solutions, which are more robust to noise but less general to new, unknown initial situations.
Coupling effect between the front and back interfaces in thin SOI MOSFETs
Authors: A. Ohata, S. Cristoloveanu, A. Vandooren, M. Cassé, F. Daugé
Venue: Microelectronic Engineering (2005)

The coupling effect between the front and back channels in thin SOI MOSFETs is investigated. Comparing the results in long channel and short channel, it was found that, in the short channel, series resistance affects the transconductance curve, impacts the coupling effect and complicates the distinction between the front and back channels. This fact was also confirmed by the device simulation. Furthermore, the difficulty to separate the two channels, on the electrical characteristic of multiple-gate structures, is discussed.
Evaluating the "friendliness" of a timesharing system
Authors: Lorraine Borman, Rosemary Karr
Venue: ACM SIGSOC Bulletin (1980)

The decade of the Sixties served to introduce most university campuses to the computer; the Seventies brought the computer, via a terminal, into every facet of university life. Computing in the Eighties will cause every university and college to evaluate and reconsider its exploitation of modern computing equipment for education and research.
Distinguishing Mathematics Notation from English Text using Computational Geometry
Authors: Derek M. Drake, Henry S. Baird
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A trainable method for distinguishing between mathematics notation and natural language (here, English) in images of textlines, using computational geometry methods only with no assistance from symbol recognition, is described. The input to our method is a "neighbor graph" extracted from a bilevel image of an isolated textline by the method of Kise [8]: this is a pruned form of Delaunay triangulation of the set of locations of black connected components. Our method first attempts to classify each vertex and, separately, each edge of the neighbor graph as belonging to math or English; then these results are combined to yield a classification of the entire textline. All three classifiers are automatically trainable. Features for the vertex and edge classifiers were selected semi-manually from a large number in a process driven by training data: this stage is potentially fully automatable. In experiments on images scanned from books and images generated synthetically, this methodology converged in three iterations to a textline classifier with an error rate of less than one percent.
Nano-RK: An Energy-Aware Resource-Centric RTOS for Sensor Networks
Authors: Anand Eswaran, Anthony Rowe, Raj Rajkumar
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Many sensor networking applications such as surveillance and environmental monitoring are time-sensitive in nature. To support such applications, we design and implement Nano-RK, a reservation-based real-time operating system (RTOS) with multi-hop networking support for use in wireless sensor networks. We support fixed-priority preemptive multitasking for guaranteeing that task deadlines are met, along with support for CPU and network bandwidth reservations. Tasks can specify their resource demands and the operating system provides timely, guaranteed and controlled access to CPU cycles and network packets in resource-constrained embedded sensor environments. We also introduce the concept of virtual energy reservations that allows the OS to enforce energy budgets associated with a sensing task by controlling resource accesses. A lightweight wireless networking stack supports packet forwarding, routing and TDMA-based network scheduling. Nano-RK has been implemented on the Atmel ATMEGA128 processor with the Chipcon CC2420 802.15.4 transceiver chip. Our results show that a light-weight embedded resource kernel with rich functionality and timing support is practical and constitutes a simple and alternative paradigm for supporting distributed sensing tasks.
Utilizing Layered Multicast for Web Caching
Authors: Josef Schmidbauer, Hilmar Linder
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Wireless broadcast networks are currently widely deployed to connect users to their Internet providers, but only point-to-point services are typically used over these networks. Multicast Web Caching is a readily-available technique embracing the broadcast capabilities of wireless links and benefing from them. However, certain trade-offs of full multicast web caching must be taken into consideration, such as an increased amount of data traffic, which must be processed by each client node. This paper analyzes the efficiency of different variations of multicast web caching and compares them with common HierarchicalWeb Caching. Furthermore, we present a new layered multicast web caching scheme that allows for significant reductions of the required processing and storage capacity, while introducing only a small inefficiency compared to full multicast web caching. The overall efficiency of this new approach is validated using trace-based simulation.