ppxscal/embedding_network huggingface dataset:
The NTP experimental platform for heterogeneous wireless sensor networks
Authors: Sheng-Po Kuo, Chun-yu Lin, Yueh-Feng Lee, Hua-Wei Fang, Y.-W. Peter Hong, Hwa-Chun Lin, Yu-Chee Tseng, Chung-Ta King, Chin-Liang Wang
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

This paper presents the NTP experimental platform for heterogeneous wireless sensor networks (WSN), which is built on the campus of National Tsing Hua University under the support of the National Science and Technology Program for Telecommunications (NTP) in Taiwan. The unique purpose of this testbed is to provide an open platform for research communities to test and to showcase their WSN systems and applications. The heterogeneous testbed is composed of three different sensor platforms: the III Zigbee Advanced Platform, the ITRI Sensor Platform and the Moteiv Tmote Platform. A middleware architecture is developed to support contextaware services (CASs) and location-based services (LBSs) across different sensor platforms. Specifically, a SENSORINFO gateway is implemented to hide the discrepancy of different sensor platforms from application developers, which allows application developers to deploy their CASs and/or LBSs while being oblivious to the underlying sensor hardware or system architecture. Moreover, to facilitate the experiments, an over-the-air (OTA) remote update function is available on the platform to enable reprogramming of sensors from a remote location. To demonstrate the unique features of this platform, we present two sample applications: the People Tracking System and the Green Building Monitoring System, which are examples of the LBS and the CAS, respectively.
Bounds on lifetime of cluster-based ultra-wide band wireless sensor network
Authors: Juan Xu, Yong-Fa Hong, Chang-Jun Jiang
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

The asymptotic lower and upper bounds on the lifetime of cluster-based Time-Hopping Impulse Radio Ultra-Wide Band (TH-IR UWB) wireless sensor networks with n static sensor nodes randomly located on a square of area S are considered. We derive the lower and upper bounds on the lifetime of cluster-based TH-IR UWB sensor networks. The results indicate that the lifetime of cluster-based network is &Theta;((n/S log n)&alpha;), which is at least (n1/2/(log n)&alpha;-1/2) times longer than that of non-cluster-based TH-IR UWB network; thus clustering can significantly improve the network lifetime. The bounds also reveal that the network lifetime increases with node density n/S, thus the large-scale dense cluster-based TH IR UWB wireless sensor network is more practical.
Fly Me to the Moon: An Insider's Guide to the New Science of Space Travel
Authors: Edward Belbruno
Venue:  (2007)

When a leaf falls on a windy day, it drifts and tumbles, tossed every which way on the breeze. This is chaos in action. In Fly Me to the Moon, Edward Belbruno shows how to harness the same principle for low-fuel space travel--or, as he puts it, "surfing the gravitational field."Belbruno devised one of the most exciting concepts now being used in space flight, that of swinging through the cosmos on the subtle fluctuations of the planets' gravitational pulls. His idea was met with skepticism until 1991, when he used it to get a stray Japanese satellite back on course to the Moon. The successful rescue represented the first application of chaos to space travel and ushered in an emerging new field.Part memoir, part scientific adventure story, Fly Me to the Moon gives a gripping insider's account of that mission and of Belbruno's personal struggles with the science establishment. Along the way, Belbruno introduces readers to recent breathtaking advances in American space exploration. He discusses ways to capture and redirect asteroids; presents new research on the origin of the Moon; weighs in on discoveries like 2003 UB313 (now named Eris), a dwarf planet detected in the far outer reaches of our solar system--and much more.Grounded in Belbruno's own rigorous theoretical research but written for a general audience, Fly Me to the Moon is for anybody who has ever felt moved by the spirit of discovery.
Maintaining Diversity in EDAs for Real-Valued Optimisation Problems
Authors: David Wallin, Conor Ryan
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

A recent extension applicable to a wide range of discrete EDA algorithms, called Sampling-Mutation, has shown promise on a non-stationary problem, as well as on a hierarchical deceptive problem. In this paper we further the empirical exploration on Ackley, Rosenbrock and Schwefel, three well-known real-valued variable optimisation problems. The EDA on which we perform our experiments is based on learning and simulation of a Bayesian classifier. The population is at each generation divided into classes based on fitness. The benefit that such classes can have on the diversity of the population and also on the performance of the algorithm, will be evaluated and compared to Sampling-Mutation. We will show that Sampling-Mutation can significantly increase the performance of a discrete EDA on said problems by maintaining a higher level of useful population diversity. We also show that an EDA with the use of Sampling-Mutation can be competitive against a generational Genetic Algorithm on this type of problem.
Impact of online resources on informal learners: Parents' perception of their parenting skills
Authors: Jin-Cheon Na, Shee Wai Chia
Venue: Computers Education (2008)

The Internet and Web technology development have opened up new ways for people to communicate, gain new information and increase their knowledge. One particular area of interest is that of using online resources to empower informal learners to increase their knowledge at their own time and space. One could look at an online resource as a public library being brought to the homes of such informal learners. The goal of the study described in this paper was to present evidence of the impact of online resources on such informal learners. In this study, the informal learners were a group of parents with young children aged between 0 and 6, and the knowledge being learned informally was that of their knowledge of and attitudes to their parenting skills. This study used an online parenting portal, KidzGrow Online, to identify if and how an online resource could impact on the group of parents with regard to the time they spent with their children, their own perceived level of knowledge of their children's development, and the level of their self-confidence in their parenting role. The study showed that after a period of three months, significant differences could be observed between the responses from parents who had access to the online resource and those from parents who did not.
Kalman filter and quantization
Authors: A. I. Ovseevich
Venue: Problems of Information Transmission (2008)

We give an interpretation of the problem of filtering of diffusion processes as a quantization problem. Based on this, we show that the classical Kalman-Bucy linear filter describes a flow of automorphisms of the Heisenberg algebra. We obtain new formulas for the unnormalized conditional density in the linear case, a new interpretation of the Mehler formula for the fundamental solution of the Schrödinger operator for a harmonic oscillator, and formulas for a regularized determinant of a Sturm-Liouville operator.
Prediction of cavitating flow noise by direct numerical simulation
Authors: Jung H. Seo, Young J. Moon, Byeong Rog Shin
Venue: Journal of Computational Physics (2008)

In this study, a direct numerical simulation procedure for the cavitating flow noise is presented. The compressible Navier-Stokes equations are written for the two-phase fluid, employing a density-based homogeneous equilibrium model with a linearly-combined equation of state. To resolve the linear and non-linear waves in the cavitating flow, a sixth-order compact central scheme is utilized with the selective spatial filtering technique. The present cavitation model and numerical methods are validated for two benchmark problems: linear wave convection and acoustic saturation in a bubbly flow. The cavitating flow noise is then computed for a 2D circular cylinder flow at Reynolds number based on a cylinder diameter, 200 and cavitation numbers, @s=0.7-2. It is observed that, at cavitation numbers @s=1 and 0.7, the cavitating flow and noise characteristics are significantly changed by the shock waves due to the coherent collapse of the cloud cavitation in the wake. To verify the present direct simulation and further analyze the sources of cavitation noise, an acoustic analogy based on a classical theory of Fitzpatrik and Strasberg is derived. The far-field noise predicted by direct simulation is well compared with that of acoustic analogy, and it also confirms the f^-^2 decaying rate in the spectrum, as predicted by the model of Fitzpatrik and Strasberg with the Rayleigh-Plesset equation.
Research on Architecture of Tacit Knowledge Transfer Based on Ontology
Authors: Can Chen, Zhanhong Xin
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Tacit knowledge transfer has been the core of knowledge management all long. On the basis of reviewing on the existing literatures about knowledge transfer, this paper, stating from ontology, proposes an ontology-based architecture of tacit knowledge transfer which enable efficient reuse and sharing of tacit knowledge. The architecture is composed by the acquisition module, the delivery module, and the inference module. Then we give respective explanation of the primary function of each module. This paper also proposes an example of the mobile telephone fault diagnosis and repair implementing the architecture
A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster
Authors: Nedialko B. Dimitrov, Indrajit Roy
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

In this paper we study the following Cluster Profit Problem. Highly parallelizable requests are present on some network nodes. Each request is associated with a tuple (g, r). The requester is willing to pay kg if k machines execute the request in parallel. If some machines work on a request, the machines must pay the request processing cost, r, as well as connection costs to the request. The problem is to find a profit maximizing assignment of machines to requests, such that each machine works on at most one request. The Cluster Profit Problem can be viewed as a profit maximizing variant of the Facility Location Problem. We provide and analyze an algorithm under resource augmentation for the Cluster Profit Problem. Resource augmentation is a technique made famous by the LRU caching analysis. We compare our algorithm with the optimal algorithm operating on a network graph that has a constant factor longer distances. We prove our algorithm is a constant approximation under this resource augmentation. We also show that our algorithm is resilient to group deviations if deviating increases communication costs by a constant factor.
An approach to creating development environments for a wide class of programming languages
Authors: S. V. Gomanyuk
Venue: Programming and Computing Software (2008)

Creating an integrated development environment for a new programming language is a nontrivial and laborious task. Such universal integration platforms as Eclipse, NetBeans, MS Visual Studio, and others partly facilitate it. The paper gives a comparative analysis of the approaches to creating a development environment on the basis a universal integration platform and proposes a new approach that eliminates the disadvantages while retaining the advantages of the existing approaches.
Introduction to the special issue on logic programming and the web
Authors: Massimo Marchiori
Venue: Theory and Practice of Logic Programming (2008)

The World Wide Web is nowadays the most famous and widespread information system. Its success is witnessed by its enormous size and rate of growth: however, the same success of the Web has brought to a situation where more sophisticated techniques are urgently needed to properly handle this mass of information. In this sense, the more ambitious plan for an evolution of a Web is the so called Semantic Web, envisioned by the inventor of the Web itself, Tim Berners-Lee. In this architectural vision, there is the need for further layers of semantics, properly enriching the data that now overflow the classic Web: ontologies, rules, logic, proofs, trust are all ingredients of this ambitious picture. Given these premises, it should not come as a surprise the fact that this evolution is bringing the Web closer and closer to another field, that since quite some time has been facing similar problems of logical organization of knowledge: logic programming. Early examples, like the Metalog system in the World Wide Web Consortium (W3C), had shown that connecting logic programming and the Semantic Web was quite a natural and fruitful step: and in fact, the burst of research in Semantic Web developments has eventually started to touch, connect and reinterprete many topics that were and are mainstream of the logic programming area. We feel this is a necessary progression, as the Semantic Web, and more generally the Web of the future, has a lot to learn from research in the logic programming area. And, conversely, in these new scenarios there are lot of new applied problems that can be challenging and rewarding from a logic programming perspective. This calls for a tighter interaction between the Web and logic programming, which was the reason to motivate this special issue as well: gathering together a selection of the best contributions that could showcase the potential of the cross-breeding.
Detection of stock price movements using chance discovery and genetic programming
Authors: Alma Lilia Garcia-Almanza, Edward P. K. Tsang
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

The aim of this work is to detect important movements in financial stock prices that may indicate future opportunities or risks. The occurrence of such movements is scarce, thus this problem falls into the domain of Chance Discovery, a new research area whose objective is to identify rare events that may represent potential opportunities and risks. In this work we propose to capture patterns of the rare instances in different ways in order to increase the probability of identifying similar cases in the future. To generate more variety of solutions we evolve a genetic program, which is an evolutionary technique that is able to create multiple solutions for a single problem. The idea is to mine the knowledge acquired by the evolutionary process to extract and collect different rules that model the positive cases in several and novel ways. Once an important movement in financial markets has been discovered, human interaction is needed to analyze the markets conditions and determine if that movement could be a good opportunity to invest or could be the principle of a bubble or another critical event that represents a risk. Standard decision trees methods capture patterns from training data sets. However, when the chances are scare, some of the patters captured by the best rules may not repeat themselves in unseen cases. In this work we propose Repository Method which comprises multiple rules to form a more reliable classifier in rare cases. To illustrate our approach, it was applied to discover important movements in stock prices. From experimental results we showed that our approach can consistently detect rare cases in extreme imbalanced data sets.
Establishing a Trusted Architecture on Pervasive Terminals for Securing Context Processing
Authors: Chen Li, Ye Zhang, Lijuan Duan
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

To deal with security challenges in context-aware model, we propose a pervasive computing terminal equipment architecture in which trusted computing technology is introduced. First, we give out a context-aware processing model for pervasive computing. Second, security requirements and challenges on terminal contextual processing are analyzed. To solve these security challenges, we apply trusted measure, trusted I/O, trusted storage and trusted report to achieve authenticity, confidentiality, privacy and integrity. Compared with traditional methods, the terminal architecture embedded with trust provides a better solution in dynamic and open pervasive computing environment.
Thread Allocation in Chip Multiprocessor Based Multithreaded Network Processors
Authors: Yi-Neng Lin, Ying-Dar Lin, Yuan-Cheng Lai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

This work tries to derive ideas for thread allocation in Chip Multiprocessor (CMP)-based network processors performing general applications by Continuous-Time Markov Chain modeling and Petri net simulations. The concept of P-M ratio, where P and M indicate the computational and memory access overhead when processing a packet, is introduced and the relation to thread allocation is explored. Results indicate that the demand of threads in a processor diminishes rapidly as P-M ratio increases to 0.066, and decreases slowly afterwards. Observations from a certain P-M ratio can be applied to various software-hardware combinations having the same ratio.
The EOQ repair and waste disposal model with switching costs
Authors: Ahmed M. A. El Saadany, Mohamad Y. Jaber
Venue: Computers and Industrial Engineering (2008)

This paper addresses the problem of determining the optimal batch sizes for production and recovery in an EOQ (economic order/production quantity) repair and waste disposal model context. This paper assumes that a first shop is manufacturing new products as well as repairing products used by a second shop. The used products can either be stored in the second shop and then be brought back to the first shop in an approach used to reduce inventory costs, or be disposed outside the system. The works available in the literature assumed a general time interval and ignored the very first time interval where no repair runs are performed. This assumption resulted in an over estimation of the average inventory level and subsequently the holding cost. These works also have not accounted for switching costs when alternating between production and recovery runs, which are common when switching among products or jobs in a manufacturing facility. This paper addresses these two limitations. Mathematical models are developed with numerical examples presented and results discussed.
A client-side CardSpace-Liberty integration architecture
Authors: Waleed A. Alrodhan, Chris J. Mitchell
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

Over the last few years, many identity management schemes, frameworks and system specifications have been proposed; however these various schemes and frameworks are typically not interoperable. In this paper we propose an approach to enable interoperation between two of the most prominent identity management schemes, namely the Liberty Alliance Project scheme (specifically the ID-FF LEC Profile) and the Microsoft CardSpace (formerly known as InfoCard) scheme. This integration should enhance interoperability by enabling users to make use of identity management systems even if the system participants are using different schemes. The main advantages and disadvantages of the proposed integration model are also investigated.
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
Authors: John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We present a practical FPGA-based accelerator for solving Boolean Satisfiability problems (SAT). Unlike previous efforts for hardware accelerated SAT solving, our design focuses on accelerating the most time consuming part of the SAT solver --- Boolean Constraint Propagation (BCP), leaving the choices of heuristics such as branching order, restarting policy, and learning and backtracking to software. Our novel approach uses an application-specific architecture instead of an instance-specific one to avoid time-consuming FPGA synthesis for each SAT instance. By avoiding global signal wires and carefully pipelining the design, our BCP accelerator is able to achieve much higher clock frequency than that of previous work. In addition, it can load SAT instances in milliseconds, can handle SAT instances with tens of thousands of variables and clauses using a single FPGA, and can easily scale to handle more clauses by using multiple FPGAs. Our evaluation on a cycle-accurate simulator shows that the FPGA co-processor can achieve 3.7--38.6x speedup on BCP compared to state-of-the-art software SAT solvers.
Eukaryotic transcription factor binding sites—modeling and integrative search methods
Authors: Sridhar Hannenhalli
Venue: Bioinformatics (2008)

A comprehensive knowledge of transcription factor binding sites (TFBS) is important for a mechanistic understanding of transcriptional regulation as well as for inferring gene regulatory networks. Because the DNA motif recognized by a transcription factor is typically short and degenerate, computational approaches for identifying binding sites based only on the sequence motif inevitably suffer from high error rates. Current state-of-the-art techniques for improving computational identification of binding sites can be broadly categorized into two classes: (1) approaches that aim to improve binding motif models by extracting maximal sequence information from experimentally determined binding sites and (2) approaches that supplement binding motif models with additional genomic or other attributes (such as evolutionary conservation). In this review we will discuss recent attempts to improve computational identification of TFBS through these two types of approaches and conclude with thoughts on future development. Contact: sridharh@pcbi.upenn.edu
A TAXONOMY OF STRATEGIES FOR MULTIMODAL PERSUASIVE MESSAGE GENERATION
Authors: Marco Guerini, Oliviero Stock, Massimo Zancanaro
Venue: Applied Artificial Intelligence (2007)

Future intelligent systems will have contextual goals to pursue. As opposed to more traditional scenarios of human computer interaction, intelligent persuasive systems may also aim to induce the user or, in general, the audience, to perform some actions in the real world. Some scenarios of application are dynamic advertisement, preventive medicine, social action, and edutainment. As a step in this direction, a prototype called Promoter was developed for the production of persuasive messages. In modeling persuasion, the cognitive state of the participants (beliefs, desires, and intentions) is taken into account, as well as their social relations, their emotions, and the context of interaction. In this article, a taxonomy of persuasive strategies and the meta-reasoning model that works on this taxonomy is described. The taxonomy is built by taking into consideration studies coming both from social psychology and philosophy, and from the area of natural argumentation. The taxonomy is not domain specific and it helps to bridge persuasion strategies and rhetorical relations, a fundamental element in text planning. The use of this taxonomy also permits reasoning on the basis of emotion expression in accordance with persuasion strategies for multimodal message generation.