ppxscal/embedding_network huggingface dataset:
Stabilization of linear autonomous systems of differential equations with distributed delay
Authors: Yu. F. Dolgii
Venue: Automation and Remote Control (2007)

Consideration is given to the problem of optimal stabilization of differential equation systems with distributed delay. The optimal stabilizing control is formed according to the principle of feedback. The formulation of the problem in the functional space of states is used. It was shown that coefficients of the optimal stabilizing control are defined by algebraic and functional-differential Riccati equations. To find solutions to Riccati equations, the method of successive approximations is used. The problem for this control law and performance criterion is to find coefficients of a differential equation system with distributed delay, for which the chosen control is a control of optimal stabilization. A class of control laws for which the posed problem admits an analytic solution is described.
Stochastic consistency, and scalable pull-based caching for erratic data stream sources
Authors: Shanzhong Zhu, Chinya V. Ravishankar
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We introduce the notion of stochastic consistency, and propose a novel approach to achieving it for caches of highly erratic data. Erratic data sources, such as stock prices, sensor data, are common and important in practice. However, their erratic patterns of change make caching hard. Stochastic consistency guarantees that errors in cached values of erratic data remain within a user-specified bound, with a user-specified probability. We use a Brownian motion model to capture the behavior of data changes, and use its underlying theory to predict when caches should initiate pulls to refresh cached copies to maintain stochastic consistency. Our approach allows servers to remain totally stateless, thus achieving excellent scalability and reliability. We also discuss a new real-time scheduling approach for servicing pull requests at the server. Our scheduler delivers prompt response whenever possible, and minimizes the aggregate cache-source deviation due to delays during server overload. We conduct extensive experiments to validate our model on real-life datasets, and show that our scheme outperforms current schemes.
High-Performance Reduction Circuits Using Deeply Pipelined Operators on FPGAs
Authors: Ling Zhuo, Gerald R. Morris, Viktor K. Prasanna
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Field programmable gate arrays (FPGAs) have become an attractive option for accelerating scientific applications. Many scientific operations such as matrix-vector multiplication and dot product involve the reduction of a sequentially produced stream of values. Unfortunately, because of the pipelining in FPGA-based floating-point units, data hazards may occur during these sequential reduction operations. Improperly designed reduction circuits can adversely impact the performance, impose unrealistic buffer requirements, and consume a significant portion of the FPGA. In this paper, we identify two basic methods for designing serial reduction circuits, the tree-traversal method and the striding method. Using accumulation as an example, we analyze the design tradeoffs between the number of adders, buffer size and latency, and propose high-performance and area-efficient designs using each method. The proposed designs reduce multiple sets of sequentially delivered floating-point values without stalling the pipeline or imposing unrealistic buffer requirements. Using a Xilinx Virtex-II Pro FPGA as the target device, we implemented our designs and present performance and area results.
Implementation of a 3-Dimensional Game for developing balanced Brainwave
Authors: Beom-Soo Shim, Sung-Wook Lee, Jeong-Hoon Shin
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In a ubiquitous condition, HCI(Human Computer Interaction) is popularly used to meet users' needs for high quality service. In a condition with HCI, there are a lot of interfaces that are used to satisfy the needs of the users. As a result of these changes, various types of effective human computer interface methods have been developed. In many studies, researchers have focused on using brain-wave interface, BCI(Brain-wave computer interaction). BCI is one of the research areas in HCI. Nowadays, studies which are related to BCI are under way to find effective methods of controlling and collecting brain-wave. Most researches related to BCI are not centralized and not systematic. BCI research uses brain wave which is gathered from the subjects' scalp. The brain wave is affected easily in an experimental condition. Moreover, subjects do not control their brain well when they attend the research. These problems bring about ineffective results research. In most research to related in HCI and BCI, that is to say -- pattern recognition, the most important foundation of the research is to set a standard about subjects' mindset and attitude in research. For this factor, in this paper, we propose the Implementation of a 3-dimensional game for developing balanced brain wave. Apart from other kinds of pattern recognition, In BCI, it is difficult to gather the specific brain wave researchers want. Researchers do not know effective methods for gathering the brain wave they want. Subjects also do not know how to release the brain wave researchers expect. To solve these kinds of problems, we propose a novel game for developing balanced brain wave. The game works by balancing the power of the brainwave values from the left cerebral hemisphere and right cerebral hemisphere. Subjects look at a computer screen. On the screen, there is a game which is made by our proposed algorithm. In real time, subjects are able to observe gathered brain wave data and therefore teach themselves to produce the appropriate brain wave. To verify the effectiveness of our proposed system, we analyzed the difference of brain wave gathered form the left and right cerebral hemisphere. On the basis of the balanced left and right cerebral hemisphere analysis, we propose the Implementation of a 3-Dimensional game for stably developing balanced brain-wave.
The Csaw C Mutation Tool: Initial Results
Authors: Michael Ellims, Darrel Ince, Marian Petre
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

There is a perceived lack of mutation tools for the C language and information about the tools that are available was not widely disseminated until recently. This has lead to the development of a small set of programs to support the use of mutation on C language programs as part of a research effort into the use of automatically generated test sets. This paper describes a lightweight C language mutation tool and some initial results from its application to sorting algorithms. The paper describes how kill rates could be improved using a different encoding for Boolean values and details how the use of CPU time can be used as an additional means of detecting mutants.
A Preliminary Formal Specification of Virtual Organization Creation with RAISE Specification Language
Authors: Mohammad Reza Nami, Mohsen Sharifi, Abbas Malekpour
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, several flavors of Formal Methods (FMs) have been gaining industrial acceptance and production quality software tools have begun emerging. Domain Engineering (DE) has been introduced as one of outstanding ideas in software development. It serves form al methods that provide a rigorous, mathematical based framework (domain model) for specifying, defining, and verifying systems in the software development. The increasing demands for extended products and services along with advances in IT industry have motivated researchers to create Virtual Organizations (VOs) in order to better respond to business opportunities and produce qualitative services and products. The purpose of this paper is to describe Virtual Organization and Domain engineering with introducing formal methods especially RAISE as a formal method that has been used successfully on diverse applications. Then, a primary formal model is presented using RAISE method and its language (RSL) formula for the improvement of VO creation process. Formal model presented in this paper is provable to implement. It improves reusability and reliability in such environments.
Image Fusion Based on Wavelet Transform
Authors: Muwei Jian, Junyu Dong, Yang Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Image fusion is the process of combing multiple images of the same scene into a single fused image with the aim of preserving the full content information and retaining the important features from each of the original images. In this paper, we propose a novel scheme to measure every wavelet decomposition coefficient's saliency of the original images. The saliency value reflects the visually meaningful content of the wavelet decomposition coefficients and is consistent with human visual perception. The novel scheme aims to preserve the full content value and retain the visually meaningful information with human visual perception more exactly than the traditional method. In addition, the proposed novel method can be combined with any sophisticated fusion rules and fusion operators that are based on wavelet decomposition. Experimental results show the effectiveness of the proposed scheme, which can retain perceptually important image information.
Rough Set Incremental Reduction Algorithm and Its Application in Dynamic Choosing Input Variable of Short Term Load Forecasting Model
Authors: Jia Lv
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper a reduction algorithm based on rough set theory is presented due to too much factors that influence accuracy in the power load forecasting. The reduction algorithm introduced to mine more correlative attributes in the pending forecasting components, ensures not only the rationality of input parameters of forecasting model but also the selection of input parameters of ANN model. An RAPHF (Reduction Algorithm through Prior Heuristic Function) algorithm based on attributes-prior algorithm is introduced because reduction Algorithm based on dipartite matrix reduction algorithm is a NP-hard problem. On the basis of RAPHF, a rough set incremental algorithm with dynamic mining ability, namely, RAPHF-I is proposed when considering the updating samples. The efficiency and advantage of our method is proved by prediction results of short-term load based on the RAPFF and RAPHF-I.
Optimal lower bounds for rank and select indexes
Authors: Alexander Golynski
Venue: Theoretical Computer Science (2007)

We develop a new lower bound technique for data structures. We show an optimal @W(nlglgn/lgn) space lower bounds for storing an index that allows to implement rank and select queries on a bit vector B provided that B is stored explicitly. These results improve upon [Peter Bro Miltersen, Lower bounds on the size of selection and rank indexes, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 11-12]. We show @W((m/t)lgt) lower bounds for storing rank/select index in the case where B has m 1-bits in it and the algorithm is allowed to probe t bits of B. We also present an improved data structure that implements both rank and select queries with an index of size (1+o(1))(nlglgn/lgn)+O(n/lgn), that is, compared to existing results we give an explicit constant for storage in the RAM model with word size lgn. An advantage of this data structure is that both rank and select indexes share the most space consuming part of order @Q(nlglgn/lgn) making it more practical for implementation.
Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy
Authors: Xiang-Yang Li, Yanwei Wu, WeiZhao Wang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

The security problem in multihop wireless networks is more severe than that in wired networks since its transmission media is the unprotected air. In this paper, we show how to increase the effective throughput via carefully choosing the multi-path routing for given source and destination nodes, where we call the total packets from the mesh routers to the gateway nodes that are not attacked by an attacker as effective throughput. We assume that the attacker has limited resources for attacking while attacking a node or a link will incur some certain cost. We show that it is NP-hard to find an optimum routing policy even if the attacking strategy is given. We model the problem as a two-player game between the routing policy designer and the attacker and propose a multi-path routing protocol for several possible attacks. We propose several routing protocols that can approximately maximize the total throughput achieved by the gateway nodes. Moreover, we theoretically prove that our routing protocols can achieve an effective network throughput (with packets which are not attacked) within a constant factor of the optimum in the worst case. Our theoretic results are confirmed by extensive simulations studies.
Theorems and unawareness
Authors: Spyros Galanis
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

This paper provides a set-theoretic model of knowledge and unawareness, in which reasoning through theorems is employed. A new property called Awareness Leads to Knowledge shows that unawareness of theorems not only constrains an agent's knowledge, but also, can impair his reasoning about what other agents know. For example, in contrast to Li (2006), Heifetz, Meier, and Schipper (2006) and the standard model of knowledge, it is possible that two agents disagree on whether another agent knows a particular event.
A Graphical Notation for Modeling Complex Events in Business Processes
Authors: Gero Decker, Alexander Grosskopf, Alistair Barros
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Using complex event rules for capturing dependencies between business processes is an emerging trend in enter- prise information systems. In previous work we have iden- tified a set of requirements for event extensions for busi- ness process modeling languages. This paper introduces a graphical language for modeling composite events in busi- ness processes, namely BEMN, that fulfills all these require- ments. These include event conjunction, disjunction and in- hibition as well as cardinality of events whose graphical expression can be factored into flow-oriented process mod- eling and event rule modeling. Formal semantics for the language are provided.
Semantic Web Services: An Unfulfilled Promise
Authors: Xuan Shi
Venue: IT Professional (2007)

To date, work on realizing semantic Web services has not taken a holistic perspective. To regain the proper focus, architecture designers must reverse-engineer service requirements and adjust the infrastructure accordingly.
Mixed-Reality Simulation of Minimally Invasive Surgeries
Authors: Gerard Lacey, Donncha Ryan, Derek Cassidy, Derek Young
Venue: IEEE MultiMedia (2007)

Our mixed-reality platform helps train surgeons in minimally invasive surgery and objectively assesses their performance. The platform uses multicamera stereo inside a patient manikin to measure the 3D positions of unmodified surgical instruments. It uses this information to drive a mixed-reality, computer-mediated learning system and provide objective measures of surgical skill.
A Clustering Method for Mixed Feature-Type Symbolic Data using Adaptive Squared Euclidean Distances
Authors: Renata M. C. R. de Souza, Francisco A. T. de Carvalho
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This work presents a clustering method for mixed feature-type symbolic data. The presented method needs a previous pre-processing step to transform mixed symbolic data into modal symbolic data. The dynamic clustering algorithm with adaptive distances has then as input a set of vectors of modal symbolic data (weight distributions) and furnishes a partition and a prototype to each class by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives based on adaptive squared Euclidean distances. Examples with synthetic symbolic data sets and an application with a real symbolic data sets show the usefulness of this method.
Behavioral Shaping for Geometric Concepts
Authors: Manu Chhabra, Robert A. Jacobs, Daniel Štefankovič
Venue: The Journal of Machine Learning Research (2007)

In a search problem, an agent uses the membership oracle of a target concept to find a positive example of the concept. In a shaped search problem the agent is aided by a sequence of increasingly restrictive concepts leading to the target concept (analogous to behavioral shaping). The concepts are given by membership oracles, and the agent has to find a positive example of the target concept while minimizing the total number of oracle queries. We show that for the concept class of intervals on the real line an agent using a bounded number of queries per oracle exists. In contrast, for the concept class of unions of two intervals on the real line no agent with a bounded number of queries per oracle exists. We then investigate the (amortized) number of queries per oracle needed for the shaped search problem over other concept classes. We explore the following methods to obtain efficient agents. For axis-parallel rectangles we use a bootstrapping technique to obtain gradually better approximations of the target concept. We show that given rectangles R ⊆ A ⊆ ℝd one can obtain a rectangle A' ⊇ R with vol(A') / vol(R) ≤ 2, using only O(d ⋅ vol(A) / vol(R)) random samples from A. For ellipsoids of bounded eccentricity in ℝd we analyze a deterministic ray-shooting process which uses a sequence of rays to get close to the centroid. Finally, we use algorithms for generating random points in convex bodies (Dyer et al., 1991; Kannan et al., 1997) to give a randomized agent for the concept class of convex bodies. In the final section, we explore connections between our bootstrapping method and active learning. Specifically, we use the bootstrapping technique for axis-parallel rectangles to active learn axis-parallel rectangles under the uniform distribution in O(d ln(1/ε)) labeled samples.
An Round Delay Algorithm in Sensor Networks
Authors: Kwang-mo Jung, Young-choong Park, Seong-dong Kim, Joong-jin Kook, Sang-won Min
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The present study was conducted with a focus on methods of maximizing the life time of entire networks in ubiquitous sensor networks (USN). To maximize life time, the present study concentrates on energy consumption algorithms, which are applied to USN with cluster tree topology. In general, the operation of sensor networks with a cluster tree topology can largely be classified into two stages: the initialization stage, where clusters are constructed, and the operation stage, where, after initialization, the data collected are transmitted. In sensor networks with a cluster tree topology, the initialization and operation stages continue repeatedly. As for energy consumption in sensor nodes, it occurs at both the initialization and operation stages. The present study focuses on algorithms that minimize the energy consumed at the operation stage. The process from the construction of clusters in cluster tree-based routing to the selection of cluster heads, exchange of routing tables among clusters, and transmission of messages to sink nodes requires the transmission of packets, which are very important components that affect not only the batteries of individual sensor nodes but also the life time of entire networks. The selection of which nodes in clusters play the roles of cluster heads can be an important factor affecting the life time of entire clusters, because nodes that play the roles of cluster heads consume more energy than do other nodes in the clusters. Consequently, it is possible to extend the life time of entire networks simply by selecting appropriate cluster heads. The present study proposes routing algorithms that, in selecting cluster heads, delay the head replacement period when a certain level of energy remains after the amounts of residual energy in various nodes have been compared.
The computer users group: the evolution of an effective management tool
Authors: Quentin Ludgin
Venue: ACM SIGCPR Computer Personnel (1980)

The Computer Users Group has been officially sanctioned by the Bureau of the Census as a forum for the interchange of information among the working-level programmers at the Bureau. At the biweekly meetings, programmers from over thirty different divisions meet in a relaxed atmosphere with responsible officials from the "provider" divisions in the EDP area. Since 1977, I have served as Chairman of this group. In this paper, I propose to examine the path by which it has reached its current status as an effective tool for both the programmers and the "providers."
Judging you by the company you keep: dating on social networking sites
Authors: Adeline Y. Lee, Amy S. Bruckman
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This study examines dating strategies in Social Networking Sites (SNS) and the features that help participants achieve their dating goals. Qualitative data suggests the SNS feature, the friends list, plays a prominent role in finding potential dates, verifying credibility, and validating ongoing relationship commitment levels. Observations of how study participants use the friends list may provide design implications for social networking sites interested in facilitating romantic connection among their users. More broadly, this research shows how subtle user-interface design choices in social computing software can have a profound effect on non-trivial activities like finding a life partner.
Feature Evalution with Measures of Probabilistic Dependence
Authors: T. R. Vilmansen
Venue: IEEE Transactions on Computers (1973)

In this paper, measures of probabilistic dependence are derived from distance measures and are applied to feature evaluation in pattern recognition. The main properties of the measures are derived and are discussed in their application to feature-class dependency. Relations between the measures and error probability are derived. Experiments using feature subsets extracted from Munson's hand-printed data are performed to compare the feature-evaluating capabilities of the measures both relative to each other and relative to error probability.
Double Unmanned Aerial Vehicle's Path Planning for Scout via Cross-Entropy Method
Authors: Jinquan Wang, Xiaoguang Gao, Jianguo Shi, Zhengsheng Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Cross-Entropy has been recently applied to combinatorial optimization problems with satisfying results. This paper introduce the cross-entropy method theory, the way of model making, real time and robust, and the application. in military scout , Unmanned Aerial Vehicle(UAV) is a special tool, with so many advantage in real time and global space. A new method, based on cross-entropy method, was used for the optimal way of double UAV's path planning.