ppxscal/embedding_network huggingface dataset:
Volterra filtering with spectral constraints
Authors: R. D. Nowak, B. D. Van Veen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

One of the major drawbacks of Volterra filters is the large number of parameters associated with such structures. In this paper, it is shown how the Volterra filter can be constrained to yield parsimonious filter structures that are adequately flexible for a large class of filtering problems. Frequency domain constraints on the Volterra kernel are one example. Constrained Volterra filters are also developed for filtering inputs with low rank covariance matrices. The performance of the constrained Volterra filter is studied theoretically and with simulation.
Effects of model errors on signal reconstruction using a sensor array
Authors: B. Friedlander, A. J. Weiss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Sensor arrays are frequently used to separate and reconstruct superimposed signals arriving from different directions. The authors study the effect of model errors, i.e., differences between the assumed and actual array response, on the quality of the reconstructed signals. Model errors are the limiting factor of array performance when the observation time is sufficiently long. A signal estimation technique is analyzed which is based on the multiple signal classification (MUSIC) algorithm. Formulas are derived for the signal-to-interference and signal-to-noise ratios as a function of the model errors.
An Embodied Conversational Agent for Intelligent Web Interaction on Pandemic Crisis Communication
Authors: Ong Sing Goh, Chun Che Fung, Kok Wai Wong, Arnold Depickere
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In times of crisis, an effective communication mechanism is paramount in providing accurate and timely information to the community. In this paper we study the use of an intelligent embodied conversational agent (ECA) as the front end interface with the public for a Crisis Communication Network Portal (CCNet). The proposed system, CCNet, is an integration of the intelligent conversation agent, AINI, and an Automated Knowledge Extraction Agent (AKEA). AKEA retrieves first hand information from relevant sources such as government departments and news channels. In this paper, we compare the interaction of AINI against two popular search engines, two question answering systems and two conversational systems.
Autonomic Virtualized Environments
Authors: Daniel A. Menasce, Mohamed N. Bennani
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Virtualization was invented more than thirty years ago to allow large expensive mainframes to be easily shared among different application environments. As hardware prices went down, the need for virtualization faded away. More recently, virtualization at all levels (system, storage, and network) became important again as a way to improve system security, reliability and availability, reduce costs, and provide greater flexibility. Virtualization is being used to support server consolidation efforts. In that case, many virtual machines running different application environments share the same hardware resources. This paper shows how autonomic computing techniques can be used to dynamically allocate processing resources to various virtual machines as the workload varies. The goal of the autonomic controller is to optimize a utility function for the virtualized environment. The paper considers dynamic CPU priority allocation and the allocation of CPU shares to the various virtual machines. Results obtained through simulation show that the autonomic controller is capable of achieving its goal.
What is your software worth?
Authors: Gio Wiederhold
Venue: Communications of the ACM (2006)

By applying well-known principlesof intellectual property valuation,sales expectations, growth of maintained software, discounting to present value, and the like, a method is presented for valuingsoftware based on the income that use of the softwareis expected to generate in the future.
Modeling force response to small boat attack against high value commercial ships
Authors: David J. Walton, Eugene P. Paulo, Christopher J. McCarthy, Ravi Vaidyanathan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This study examines ways to prevent the success of a small boat attack (SBA) against a larger high value commercial vessel, or high value unit (HVU), through the utilization of an agent-based simulation. The geographic area of concern is the Straits of Malacca. An essential element of the scenario is the limited time available to act against the attackers. Subsequently, the two alternatives considered are the deployment of patrol craft, as well as the placement of well-armed Sea Marshals on each high value ship.
Effects of handheld games on students learning in mathematics
Authors: Namsoo Shin, Cathleen Norris, Elliot Soloway
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The main purpose of this study was to investigate the effects of handheld gaming on student learning in mathematics. During the four-month instructional period, 50 2nd grade students from three classes used a handheld Skills Arena software program or paper-based flash cards under various conditions depending on their teacher's preference. Overall results proved that the handheld game activity in the classroom was beneficial to students in learning mathematics, especially for low-ability students, regardless of gender and ethnic background. In a non-experimental, correlational analysis, the results reveal that handheld game scores and attitude toward mathematics correlated significantly to students' scores on a mathematic test. In the results of a quasi-experimental control-group design with Repeated Measures, handheld gaming students outperformed students who did not use a handheld game on a mathematic test. Additionally, handheld low-level students outperformed those who did not use a handheld game on the same test.
Quadratic placement for 3d circuits using z-cell shifting, 3d iterative refinement and simulated annealing
Authors: Renato Hentschke, Guilherme Flach, Felipe Pinto, Ricardo Reis
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This paper presents a quadratic placement algorithm to be applied for 3D circuits. We formulate the 3D problem to control the area balance and the number of 3D-Vias between tiers. We introduce the z-Cell Shifting operation in order to control the area balance. We also define a new operation for the refinement of the solution called 3D Iterative Refinement, that has a control statement to avoid excessive number of 3D-Vias in order to keep the feasibility of our placement solution. After quadratic placement, we move to the placement legalization that is based on min-cost max flow and Simulated Annealing. For detailed placement refinement, we apply Simulated Annealing without cell migration between tiers. Experimental results show that our placement flow targeting one tier is comparable to academic tools such as FastPlace, Capo and Dragon in wire length and running time when targeting a single tier. On multiple tiers, we can reduce the average wire length from 7% (2 tiers) to 32% (5 tiers) and worst wire length by 26% (2 tiers) to 52% (5 tiers). The number of 3D-Vias obtained is feasible since the area overhead introduced is always below 10%.
Path Planning of Mobile Landmarks for Localization inWireless Sensor Networks
Authors: Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charlie Hu
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Many applications of wireless sensor networks require the sensor nodes to obtain their locations. The main idea in most localization methods has been that some nodes with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes to localize themselves. A promising method that significantly reduces the deployment cost is to replace the set of statically deployed GPS-enhanced sensors with one mobile landmark equipped with a GPS unit. In this case, a fundamental research issue is the planning of the path that the mobile landmark should travel along in order to minimize the localization error. In this paper we first study the localization error of three different trajectories for the mobile landmark, namely SCAN, DOUBLE SCAN, and HILBERT. We further study the tradeoffs between the trajectory resolution and the localization accuracy in the presence of 2-hop localization, in which sensors that have already obtained an estimate of their positions help to localize other sensors. Our trajectories are practical and can be easily implemented in mobile robot platforms.
A Conceptual Architecture of a Trusted Mobile Environment
Authors: Zheng Yan
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

Trust is crucial in mobile communications. How to establish a trusted mobile environment is becoming more and more important for mobile device venders, mobile service providers and mobile networking operators. This paper presents a conceptual architecture towards establishing a trusted mobile environment. The contribution of this paper is a) specifying the architecture of a trusted mobile environment; b) by developing the conceptual architecture, explaining key motivations behind the location of every element in the architecture; and c) evaluating the architecture by applying it into a mobile peer-to-peer system.
An integrated architecture for ad hoc grids
Authors: Armin R. Mikler
Venue:  (2006)

Extensive research has been conducted by the grid community to enable large-scale collaborations in pre-configured environments. Grid collaborations can vary in scale and motivation resulting in a coarse classification of grids: national grid, project grid, enterprise grid, and volunteer grid. Despite the differences in scope and scale, all the traditional grids in practice share some common assumptions. They support mutually collaborative communities, adopt a centralized control for membership, and assume a well-defined non-changing collaboration. To support grid applications that do not confirm to these assumptions, we propose the concept of ad hoc grids. In the context of this research, we propose a novel architecture for ad hoc grids that integrates a suite of component frameworks. Specifically, our architecture combines the community management framework, security framework, abstraction framework, quality of service framework, and reputation framework. The overarching objective of our integrated architecture is to support a variety of grid applications in a self-controlled fashion with the help of a self-organizing ad hoc community. We introduce mechanisms in our architecture that successfully isolates malicious elements from the community, inherently improving the quality of grid services and extracting deterministic quality assurances from the underlying infrastructure. We also emphasize on the technology-independence of our architecture, thereby offering the requisite platform for technology interoperability. The feasibility of the proposed architecture is verified with a high-quality ad hoc grid implementation. Additionally, we have analyzed the performance and behavior of ad hoc grids with respect to several control parameters.
On the number of rectangulations of a planar point set
Authors: Eyal Ackerman, Gill Barequet, Ron Y. Pinter
Venue: Journal of Combinatorial Theory Series A (2006)

We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (nonintersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable permutation, the number of rectangulations is exactly the (n + 1)st Baxter number. We also show that no matter what the order of the points is, the number of guillotine rectangulations is always the nth Schröder number, and the total number of rectangulations is O(20n/n4).
Support measures for graph data*
Authors: N. Vanetik, S. E. Shimony, E. Gudes
Venue: Data Mining and Knowledge Discovery (2006)

The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no greater than that of its subpatterns, a property called anti-monotonicity, or admissibility. This paper examines the requirements for admissibility of a support measure. Support measures for mining graphs are usually based on the notion of an instance graph---a graph representing all the instances of the pattern in a database and their intersection properties. Necessary and sufficient conditions for support measure admissibility, based on operations on instance graphs, are developed and proved. The sufficient conditions are used to prove admissibility of one support measure--the size of the independent set in the instance graph. Conversely, the necessary conditions are used to quickly show that some other support measures, such as weighted count of instances, are not admissible.
On-demand bounded broadcast scheduling with tight deadlines
Authors: Chung Keung Poon, Feifeng Zheng, Yinfeng Xu
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast.The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.
Evaluation of a haptic mixed reality system for interactions with a virtual control panel
Authors: Christoph W. Borst, Richard A. Volz
Venue: Presence: Teleoperators and Virtual Environments (2005)

We present a haptic feedback technique that combines feedback from a portable force-feedback glove with feedback from direct contact with rigid passive objects. This approach is a haptic analogue of visual mixed reality, since it can be used to haptically combine real and virtual elements in a single display. We discuss device limitations that motivated this combined approach and summarize technological challenges encountered. We present three experiments to evaluate the approach for interactions with buttons and sliders on a virtual control panel. In our first experiment, this approach resulted in better task performance and better subjective ratings than the use of only a force-feedback glove. In our second experiment, visual feedback was degraded and the combined approach resulted in better performance than the glove-only approach and in better ratings of slider interactions than both glove-only and passive-only approaches. A third experiment allowed subjective comparison of approaches and provided additional evidence that the combined approach provides the best experience.
A Cooperative Service Composition Language and Its Formal Semantics
Authors: Xiuguo Zhang, Weishi Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

This paper introduces a cooperative service composition language called CCML which aims to facilitate the description of services, their interfaces and their behavior, further to reduce the complexity required to compose services. Interaction rules among services rely on a cooperative computation model, i.e. KPN (Kahn Process Network), which adopts dataflow and channel based asynchronous communication pattern among process nodes. Formal model for behavioral semantics of CCML is based on CCS process algebra which presents a high expressive power, capable of capturing CCML behavioral semantics. We give an operational semantics to CCML in the form of a labeled transition system (LTS) and describe the events of a LTS associated to the main CCML constructs, which are sequence, condition, loop and parallel. Finally, we present an application case to show how to describe service composition using CCML.
Statistical selection of the best system
Authors: David Goldsman, Seong-Hee Kim, Barry L. Nelson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This tutorial discusses some statistical procedures for selecting the best of a number of competing systems. The term "best" may refer to that simulated system having, say, the largest expected value or the greatest likelihood of yielding a large observation. We describe various procedures for finding the best, some of which assume that the underlying observations arise from competing normal distributions, and some of which are essentially nonparametric in nature. In each case, we comment on how to apply the above procedures for use in simulations.
The Influence of Different Cost Functions in Global Optimization Techniques
Authors: Cleber Zanchettin, Teresa B. Ludermir
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

This work presents an evaluation of the effect of different cost functions in a methodology that integrates heuristic tabu search, simulated annealing, genetic algorithms and backpropagation. We investigated four cost function approaches: average method, weight-decay, multi-objective optimization, combined multi-objective and weight-decay. The weight-decay approach presented promising results in the simultaneous optimization of artificial neural network architecture and weights. The experiments were performed in four classifications and one prediction problem.
Distributed mechanism in detecting and defending against the low-rate TCP attack
Authors: Haibin Sun, John C. S. Lui, David K. Y. Yau
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

In this paper, we consider a distributed mechanism to detect and to defend against the low-rate TCP attack. The low-rate TCP attack is a recently discovered attack. In essence, it is a periodic short burst that exploits the homogeneity of the minimum retransmission timeout (RTO) of TCP flows and forces all affected TCP flows to backoff and enter the retransmission timeout state. When these affected TCP flows timeout and retransmit their packets, the low-rate attack will again send a short burst to force these affected TCP flows to enter RTO again. Therefore these affected TCP flows may be entitled to zero or very low transmission bandwidth. This sort of attack is difficult to identify due to a large family of attack patterns. We propose a distributed detection mechanism to identify the low-rate attack. In particular, we use the dynamic time warping approach to robustly and accurately identify the existence of the low-rate attack. Once the attack is detected, we use a fair resource allocation mechanism to schedule all packets so that (1) the number of affected TCP flows is minimized and, (2) provide sufficient resource protection to those affected TCP flows. Experiments are carried out to quantify the robustness and accuracy of the proposed distributed detection mechanism. In particular, one can achieve a very low false positive/negative when compare to legitimate Internet traffic. Our experiments also illustrate the the efficiency of the defense mechanism across different attack patterns and network topologies.
A Peer-to-Peer Approach to Large-Scale Content-Based Publish-Subscribe
Authors: Dongcai Shi, Jianwei Yin, Zhaohui Wu, Jinxiang Dong
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Publish-subscribe has become a prevalent paradigm for asynchronous communication in a distributed network. However, existing distributed content-based publish-subscribe systems still have limitations in scalability and adaptability. In this paper, we present a content-based publish-subscribe system over Distributed Hash Table (DHT) based P2P networks. To improve the efficiency of event publication, our approach maps subscriptions and events to rendezvous nodes in terms of a combination of the domain schema identifier and the numbers of attributes in the subscriptions or the events. To impose little overhead on routing substrate, our approach exploits the embedded multicast tree on DHT-based P2P networks for event delivery. The experimental results demonstrate that our system scales well with increasing number of peers and large numbers of subscribers and events.
The Living Systems Technology Suite: An Autonomous Middleware for Autonomic Computing
Authors: Giovanni Rimassa, Dominic Greenwood, Martin E. Kernland
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

This paper presents the Living Systems Technology Suite, LS/TS, a middleware based on autonomous software agents and autonomic computing principles. Specifically, the paper describes the autonomic principles built into LS/TS, and the features that follow from them. These features are described within the context of a general taxonomy of autonomic systems, elaborating on the relationship between middleware and application levels. Lastly, the paper addresses the problem of system self-representation, leveraging LS/TS support for ontology and semantic agent communication.
Improving Accuracy of Recommender System by Clustering Items Based on Stability of User Similarity
Authors: Truong Khanh Quan, Ishikawa Fuyuki, Honiden Shinichi
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Collaborative Filtering, one of the most widely used approach in Recommender System, predicts a user's rating towards an item by aggregating ratings given by users having similar preference to that user. In existing approaches, user similarity is often computed on the whole set of items. However, because the number of items is often very large, and so is the diversity among items, users who have similar preference in one category of items may have totally different judgement on items of another kind. In order to deal with this problem, we propose a method of clustering items, so that inside a cluster, similarity between users does not change significantly. After that, when predicting rating of a user towards an item, we only aggregate ratings of users who have high similarity degree with that user inside the cluster to which that item belongs. Experiments evaluating our approach are carried out on the real dataset taken from movies recommendation system of MovieLens web site. Preliminary results suggest that our approach can improve prediction accuracy compared to existing approaches.
A Network Processor-Based, Content-Aware Switch
Authors: Li Zhao, Yan Luo, Laxmi N. Bhuyan, Ravi Iyer
Venue: IEEE Micro (2006)

A content-aware switch can optimize cluster-based server architectures by examining requests and distributing them to servers on the basis of application-level information. A network-processor-based switch can reduce HTTP processing latency and improve packet throughput.