ppxscal/embedding_network huggingface dataset:
A Lightweight Sensor Network Management System Design
Authors: Fenghua Yuan, Wen-Zhan Song, Nina Peterson, Yang Peng, Lei Wang, Behrooz Shirazi, Richard LaHusen
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper, we propose a lightweight and transparent management framework for TinyOS sensor networks, called L-SNMS, which minimizes the overhead of management functions, including memory usage overhead, network trafficoverhead, and integration overhead. We accomplish this by making L-SNMS virtually transparent to other applications hence requiring minimal integration. The proposed L-SNMS framework has been successfully tested on various sensor node platforms, including TelosB, MICAz and IMote2.
Detecting spam email by radial basis function networks
Authors: Eric Jiang
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

Over the years, various spam email filtering technology and anti-spam software products have been developed and deployed. Some are designed to stop spam email at the server level, and others apply machine learning algorithms at the client level to identify spam email based on message content. In this paper, a new spam filtering model, RBF-SF, is proposed that detects and classifies email messages by a radial basis function (RBF) network. The model utilizes the valuable email discriminative information from training data and can incorporate additional background email in its learning process. The empirical results of RBF-SF on two benchmark spam testing corpora and a performance comparison with several other popular text classifiers have shown that the model is capable of filtering spam email effectively.
Global asymptotic stability of delay BAM neural networks with impulses via nonsmooth analysis
Authors: Zhen Wen, Jitao Sun
Venue: Neurocomputing (2008)

In this paper, we study global asymptotic stability of delay bi-directional associative memory (BAM) neural networks with impulses. We obtain a sufficient condition of ensuring existence and uniqueness of equilibrium point for delay BAM neural networks with impulses basing on nonsmooth analysis. And we give a criteria of global asymptotic stability of the unique equilibrium point for delay BAM neural networks with impulses using Lyapunov method. At last, we present examples to illustrate that our results are feasible.
SITUATED CELLULAR AGENTS APPROACH TO CROWD MODELING AND SIMULATION
Authors: Stefania Bandini, Mizar Luca Federici, Giuseppe Vizzari
Venue: Cybernetics and Systems (2007)

The article describes a multi-agent approach to crowd modeling and simulation. After a brief introduction of the Situated Cellular Agents model, the guidelines to the crowd modeling approach is introduced as a way to support the communication among the different actors that are part of the simulation project team. The approach is then applied to describe a complex scenario providing a blend of competitive and cooperative behavior for pedestrian agents: an underground station. A module supporting the effective 3D visualization of simulated crowd dynamics is finally introduced, as an instrument for the communication of simulation results to decision makers and nonexperts in crowd phenomena.
OWL/SWRL representation methodology for EXPRESS-driven product information model
Authors: W. Zhao, J. K. Liu
Venue: Computers in Industry (2008)

This paper presents an ontology-based approach to enable semantic interoperability and reasoning over the product information model. The web ontology language (OWL) and the semantic web rule language (SWRL) in the Semantic Web are employed to construct the product information model. The traditional modeling language called EXPRESS is discussed. The representation methodology for EXPRESS-driven product information model is then proposed. The key of the representation methodology is mapping from EXPRESS to OWL/SWRL. Some illustrated examples are presented.
Towards a Knowledge-Base for Building Complex, Proactive and Service-Oriented E-negotiation Systems
Authors: Giannis Koumoutsos, Kleanthis Thramboulidis
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Advances in information technology change the way e-negotiations, which constitute an important aspect of worldwide e-trading, can be structured and represented. In this paper an e-negotiation framework for building complex negotiation systems with emphasis on their automation is presented. A novel approach for dynamically adapted e-negotiations, that exploits ontologies, Semantic Web Services, software agent platforms, Service Oriented Architecture and Knowledge-Bases is described. The relationship between negotiation protocol, process and strategy specification is examined and a way of describing and representing them using a hybrid approach that integrates rules and workflow diagrams is introduced.
Dynamic load balancing for parallel mesh adaptation
Authors: Xiang Zhao, Milind Talpallikar, Sijun Zhang
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Computational fluid dynamics (CFD) flow simulations are extremely expensive in terms of CPU time and memory. In this study, parallel computing and grid adaptation techniques are employed to achieve high efficiency and accuracy in a hybrid unstructured flow solver. However, adaptive local grid refinement/coarsening causes the unequal distribution of workload among the processors at run time. A simple, effective repartition- and remapping-based dynamic load balancing scheme, named RARB, has been developed and integrated into the flow solver to solve the load imbalance problem. As first major component of RARB, a modified Recursive Coordinate Bisection (RCB) partition algorithm is exploited to repartition the computational domain due to its simplicity and efficiency once the load imbalance is detected. Two heuristic rules have been used to facilitate remapping the new partitioned sub-domains to the processors with less data communication cost. Task migration from overloaded processors to underloaded processors is the second major component of RARB and is handled in parallel by a multi-level granularity procedure. In addition, three metrics have been used as an indicator of the global view of system load. The Experiments conducted on a cluster of PCs show high efficiency and accuracy of the flow solver to accomplish complex flow computations, and the effectiveness of RARB to handle the load imbalance in grid adaptations.
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Authors: Jeremy T. Bradley, Stephen T. Gilmore, Jane Hillston
Venue: Journal of Computer and System Sciences (2008)

Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-based model of infection based solely on the underlying process description of the infection agent model. Thus, rather than craft a differential equation model directly, we derive this representation automatically from a high-level process model expressed in the PEPA process algebra. This extends existing population infection dynamics models of Internet worms by explicitly using frequency-based spread of infection. Three types of worm attack are analysed which are differentiated by the nature of recovery from infection and vulnerability to subsequent attacks. To perform this analysis we make use of continuous state-space approximation, a recent breakthrough in the analysis of massively parallel stochastic process algebra models. Previous explicit state-representation techniques can only analyse systems of order 10^9 states, whereas continuous state-space approximation can allow analysis of models of 10^1^0^0^0^0 states and beyond.
Detection of breaking news from online web search queries
Authors: Tsuyoshi Murata
Venue: New Generation Computing (2008)

Many people enter queries to Google or Yahoo! in order to search useful information from the Web. Queries given to search engines can be regarded as the resources for detecting people's information needs. It is often reported that many people perform search intensively after worldwide disasters or accidents. This paper describes a method for detecting such breaking news from search queries that are available online. In our method, real time search queries are obtained and filtered with news words extracted From a news site. Experimental results show that our method has abilities of detecting breaking news from more than 25 million search queries for six months.
EESM for IEEE 802.16e: WiMaX
Authors: Shahid Mumtaz, Atilio Gamerio, Jonathan Rodriguez
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

For Link Level interfacing packet switched simulation adopt the AVI (actual value interface) approach for mapping the computed SNR to the Block Error Rate (BLER) Statistics. However in OFDM based system the BLER is invariant within Radio transport channel due to fading channel and adjutant bit carriers mapping, rendering the AVI to be inaccurate. Due to large variability of the channel in frequency domain, two links with same average SNR can experience drastically different performance, thus making it difficult to accurately predict the instantaneous link performance such as Frame Error Rate (FER). To overcome this problem with AVI the EESM has been used as a low complexity approach. In this paper the feasibility of EESM as an abstraction method is investigated, and then calibrated and evaluated for Link Level Interface in WiMax System IEEE802.16e.This methods is then extended to handle more advanced link enhancement such as Alamouti encoding. The Exp-ESM method has better accuracy than the existing link error methods, and preferred link error predictor for system simulator.
Utilizing national public-key infrastructure in mobile payment systems
Authors: Marko Hassinen, Konstantin Hyppönen, Elena Trichina
Venue: Electronic Commerce Research and Applications (2008)

Payments are the locomotive behind any business domain. It has been predicted that mobile payments will become one of the most successful mobile services, and the security of payments is an important requirement. However, it is difficult to strongly authenticate mobile users remotely and provide an adequate level of non-repudiation of transactions. In this article, we argue that a nationwide public-key infrastructure supported by governmental bodies can be used in a mobile payment system. Not only does it provide strong security, but it also makes the system open to any mobile user, merchant, or financial service provider. Two payment protocols are described: one for virtual point-of-sale payments, and one for vending machine payments. We argue that such a system can be implemented using open development platforms, and its performance is adequate for enabling swift transactions. A prototype of a system which accepts virtual point-of-sale payments is implemented, and its performance and usability are evaluated.
A quasi-static Signorini contact problem for a thermoviscoelastic beam
Authors: M. I. M. Copetti
Venue: Numerische Mathematik (2008)

This paper is concerned with the existence, uniqueness and numerical solution of a system of equations modelling the evolution of a quasi-static thermoviscoelastic beam that may be in contact with two rigid obstacles. A finite element approximation is proposed and analysed and some numerical results are given.
Extracting Dynamics from Static Cancer Expression Data
Authors: Anupam Gupta, Ziv Bar-Joseph
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Static expression experiments analyze samples from many individuals. These samples are often snapshots of the progression of a certain disease such as cancer. This raises an intriguing question: Can we determine a temporal order for these samples? Such an ordering can lead to better understanding of the dynamics of the disease and to the identification of genes associated with its progression. In this paper we formally prove, for the first time, that under a model for the dynamics of the expression levels of a single gene, it is indeed possible to recover the correct ordering of the static expression datasets by solving an instance of the traveling salesman problem (TSP). In addition, we devise an algorithm that combines a TSP heuristic and probabilistic modeling for inferring the underlying temporal order of the microarray experiments. This algorithm constructs probabilistic continuous curves to represent expression profiles leading to accurate temporal reconstruction for human data. Applying our method to cancer expression data we show that the ordering derived agrees well with survival duration. A classifier that utilizes this ordering improves upon other classifiers suggested for this task. The set of genes displaying consistent behavior for the determined ordering are enriched for genes associated with cancer progression.
The future of television graphics
Authors: Samuel Edsall
Venue: ACM SIGGRAPH Computer Graphics (2008)

It is an exciting time to be in television. The advances in digital television, computers, and all the peripherals related to them open the creative gate for television graphic designers. Television is undergoing some growing pains and is about to transform into an entirely new format.
Optimizing resource allocation for multiple concurrent jobs in grid environment
Authors: Sarbani Roy, Madhulina Sarkar, Nandini Mukherjee
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

In a dynamic environment like Grid, it is difficult to manage resources at application or user level. In order to support application execution in the context of Grid, a Resource Broker is essential and the task of resource brokering in such a heterogeneous, fast changing, distributed environment is non-trivial. In this paper we present the design and implementation of resource brokering strategies within a multi-agent framework. These strategies help in finding out an optimal allocation of resources for executing multiple concurrent jobs in a Grid environment. We discuss the different stages in resource brokering and their implementation within the framework. The paper also presents results of a preliminary implementation and demonstrates the effectiveness of our strategies.
Resource Discovery Based on a Novel Distributed DNS Framework
Authors: Lican Huang
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

A resource discovery framework based on VIRGO P2P distributed DNS is described here. With the convention of resource name as the format-- functionscheme ":"global-hier-part"/"local-name , this framework supports flexible wildcards, and range queries by SQL-like query language.
Exact distribution of the max/min of two Gaussian random variables
Authors: Saralees Nadarajah, Samuel Kotz
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Maximum and minimum of correlated Gaussian random variables arise naturally with respect to statistical static time analysis. It appears, however, that only approximations have been used in the recent literature to study the distribution of the max/min of correlated Gaussian random variables. In this paper, we would like to point out that the statistics literature has long established simple expressions for the exact distribution of the max/min. We provide some of the known expressions for the following: the probability density function, moment generating function, and the moments. We also provide two simple programs for computing the probability density functions of the max/min and an illustration of the results to statistical static time analysis.
GPU-Based Simulation of Large-Scope Ocean Wave
Authors: Su-Jun Li, Ling-Da Wu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The realistic modeling and rendering of ocean surface is one of hotspot and difficult problems of computer graphic. Most of the recent ocean wave simulation is based on plane and is in a limited region. They didn’t consider the factor of earth curvature and the edge between ocean and land, can’t be used on digital earth flat. In this paper, a new method of GPU-based simulation of large-scope ocean wave is presented. It not only consider the factor of earth curvature, but also the edge between ocean and land, can be used on digital earth. First, ocean wave model considering sphere curvature is presented. The model not only reduces computation obviously, but also resolves the “compress phenomenon” at the high latitude. Then, the visible part of the ocean surface is sampled with screen-subdivision algorithm. Finally, the cost computation of vertexes and color of ocean wave are performed by the programmability of the modern GPU. Results show that the method is efficient and users can fly over ocean surface of digital globe in interactive rates on common PC graphics hardware.
Applying mass customization to the production of industrial steam turbines
Authors: Q. H. Yang, G. N. Qi, Y. J. Lu, X. J. Gu
Venue: International Journal of Computer Integrated Manufacturing (2007)

An industrial steam turbine is typically an engineered-to-order product, so the principle and methods of mass customization are widely applied in its production. We can re-engineer the development design process of this product into two phases - innovative development process and agile design process - and perform product family-oriented modularized development. The product's master structure model is used for configuration design, and its part/component models are used for variant design. Together, the configuration design and variant design constitute rapid product design. Furthermore, through standardization, modularization, serialization, process reengineering, rapid design and automated manufacturing, the customer order decoupling point of product and its parts/components are postponed. In the production process, some effective measures should be taken such as orders-merging production, unified materials ordering and unified parts/components manufacturing, in order to enhance the batch profit. Adopting product family-oriented ABC analysis, the rough product structure can be built. Thus, product cost and lead-time are estimated on the basis of practical cases, and hence, the possible production plan can be worked out. The successful application of mass customization will effectively shorten lead-time and remarkably reduce production cost of the steam turbine.
PZSPTF: Parallelism-aware and Zone-based Shortest Positioning TimeFirst Scheduling for MEMS-based Storage Devices
Authors: Yan Like, Shi Qingsong, Zhang Tiefei, Chen Tianzhou
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

MEMS-based storage device is a new candidate of storage device for pervasive applications which requires large volume of storage. Because of its attractive features such as high-bandwidth, low-power consumption, and low cost compared with hard disk, the storage performance could be significantly improved by adopting MEMS-based storage devices, especially when employing new request scheduling algorithm and data placement A new request scheduling algorithm is explored for MEMS-based storage devices in this paper, which is named Parallelism-aware and Zone-based Shortest Positioning Time First (PZSPTF). And a new data placement scheme is also introduced, with which the storage area is divided into 2 parts according to 2 file classes, and the files of same class will be stored in the same part. Experiments show that the new P_ZSPTF algorithm improves the performance of MEMS storage by 7.83% to 18.51% compared with the widely acknowledged request scheduling algorithm FCFS (First-come, first-served).
Exponential stability of numerical solutions to a stochastic age-structured population system with diffusion
Authors: Qimin Zhang
Venue: Journal of Computational and Applied Mathematics (2008)

The main aim of this paper is to investigate the exponential stability of the Euler method for a stochastic age-structured population system with diffusion. The definition of exponential mean square stability of numerical method is introduced. It is proved that the Euler scheme is exponentially stable in mean square sense. An example is given for illustration.
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
Authors: M. J. Grannell, T. S. Griggs
Venue: Journal of Combinatorial Theory Series B (2008)

We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic triangular embeddings of the complete graph K"n is at least n^a^n^^^2. A similar lower bound is also given, for an infinite set of values of n, on the number of nonisomorphic triangular embeddings of the complete regular tripartite graph K"n","n","n.
TCP-Based Dynamic Media Stream Adaptation in Ubiquitous Environment
Authors: Gergely Hományi, Gábor Paller
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

More and more media material is consumed in ubiquitous environment where the service can be experienced over different devices, network conditions, network bearers, etc. Unlike in traditional wireless environments where at least changes of the QoS parameters are controlled by the network, ubiquitous networks are characterized by abrupt changes. Transition from complete disconnectivity to low-cost, high-bandwidth connection can happen in a relatively short time span. Media consumption over such networks are influenced by two, contradictory user requirements. The first requirement is that the users would not like to see quality changes in the media stream. The second requirement is that the user would like to consume the media with the best available quality. This paper presents an adaptation algorithm that aims to reconcile these requirements. Architecture variants of the media adaptation problem and prototyping experiences are also presented.
Generating Quasi-Random Sequences From Slightly-Random Sources
Authors: M. Santha
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Several applications require truly random bit sequences, whereas physical sources of randomness are at best imperfect. We consider a general model for these slightly-random sources (e,g. zener diodes), and show how to convert their output into 'random looking ' sequences, which we call quasi -random. We show that quasi-random sequences are indistinguishable from truly random ones in a strong sense. This enables us to prove that quasi-random sequences can be used in place of truly random ones for applications such as seeds for pseudo-random number generators, randomizing algorithms, and stochastic simulation experiments.
The Development and Application of Chinese Intelligent Question Answering System Based on J2EE Technology
Authors: Shouning Qu, Bing Zhang, Xinsheng Yu, Qin Wang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The current status of Chinese question answering system was introduced in the paper firstly, some defects of it were pointed out, then a set of scheme about data warehouse design based on data mining was put forward. It applied the improved association rules algorithm to text clustering algorithm. At the same time in combination with the advantages of J2EE architecture in system development, this paper described how to apply J2EE platform to forming an exact and efficient intelligent question answering system by the technologies such as JSP, Servlets, EJB, JDBC and so on.