ppxscal/embedding_network huggingface dataset:
Constructing a Large Scale Wireless Sensors Network and Resources Scheduling Among Multiple Personal Area Networks
Authors: Xiaoliang Cheng, Zhidong Deng
Venue: International Journal of Distributed Sensor Networks (2009)

Constructing a Large Scale Wireless Sensors NetworkA real challenge of wireless sensors network applications is how to expand it to a larger scale. We proposed the idea of “One Zone Multi-PAN (Personal Area Network)” to build a Large-Scale Wireless Sensors Network (LS-WSN). Its key points include: the elementary component of LS-WSN is PAN; different PANs work on different channels; different PANs use customized policies and execute different tasks; every PAN covers and surveillances the same area, but senses different circumstance information. Based on the idea, we proposed a two-level distributed LS-WSN model. The first level is the PAN-level, which works in a distributed mode. On this level, the up to 16 PANs bridged by a specially designed gateway coexist like a multi-layer sandwich. This gateway is a common children node of different PANs; therefore it can join in different PANs in a time-sharing mode. The second level is the inner-PAN-level, whose work mode is determined by the specific manufacturer. The size of this model can be expanded up to 16 times of the size of a single PAN. Furthermore, QoS of LS-WSN can be guaranteed, data fusion and data management can be simplified and improved. Using Zigbee stack, we set up a prototype system of LS-WSN, whose performances are validated by our experiments.Resources Scheduling among PANsFor executing resource reconfiguration in LS-WSN, we proposed an application framework of resources scheduling (RSAF). Its key principles include: radio channels, superframe time-slots, and energy resources are named as “Common Resources;” “the whole network is more important than a single PAN” in LS-WSN; keep the key PANs alive; the lifespan of a LS-WSN is determined by that of key PANs. RSAF can be comprehended as a collaboration mechanism at PAN level. It includes three components: superframe time-slots scheduling, radio channel scheduling, and energy scheduling. Their algorithms are different. Especially, a typical working cycle of energy scheduling contains four steps. First, the coordinators of different PANs gather different PANs' state information in a piggyback mode. Then the gateway periodically evaluates different PANs' states and makes the decisions of resources scheduling. After that, the specified coordinators send the control messages to certain nodes. Finally, the specified nodes will join and reinforce the key PAN in danger due to certain reasons (e.g., out of energy). Our experimental results validate the feasibility of RSAF in our prototype system.
Nearest Neighbour Classifiers for Streaming Data with Delayed Labelling
Authors: Ludmila I. Kuncheva, J. Salvador Sánchez
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We study streaming data where the true labels come with a delay. The question is whether the online nearest neighbour classifier (IB2 and IB3 here) should employ the unlabelled data. Three strategies are examined: do-nothing, replace and forget. Experiments with 28 data sets show that IB2 benefits from unlabelled data, while IB3 does not.
Band-filling effect on the light emission spectra of InGaN/GaN quantum wells with highly doped barriers
Authors: B. Arnaudov, D. S. Domanevskii, S. Evtimova, Ch. Ivanov, R. Kakanakov
Venue: Microelectronics Journal (2009)

We investigate spectra of InGaN/GaN quantum well (QW) light-emitting diode (LED) structures with heavily doped barriers at different excitation levels. We model the spectral shape and energy position in frames of dominating mechanism of free electron recombination accounting for the influence on the potential width of the QW of the random impurity potential penetrating from the doped barriers. The blue shift at high excitation is supposed to be due to the filling of the conduction band with degenerate 2D non-equilibrium electrons. A structure in the emission bands is observed and it is assumed to be a result from step-like 2D density of states in the QW. A good accordance is obtained between the calculated and experimental spectra assuming that the barriers are graded.
Streaming Live Media over BitTorrent
Authors: Qingchao Cai, Xiaolu Zhang, Xuejie Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In this paper, we present an effective approach for live media streaming based on BitTorrent mechanism. In the approach, several modiﬁcations have been incorporated into BitTorrent to support on-time content delivery. First, pieces are selected based on their scheduler play back deadline. Second, source behaves in a push-based way instead of pull-based way. Finally, each peer periodically examines its active neighbors to improve the bandwidth utilization. Our simulations indicate that our proposals improve the band-width utilization and accommodate high scalability and resilience, and a good streaming quality can be achieved.
Scaling Search with Pattern Databases
Authors: Stefan Edelkamp, Shahid Jabbar, Peter Kissmann
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

In this paper, we illustrate efforts to perform memory efficient large-scale search. We first generate sets of disjoint symbolic pattern databases on disk. These pattern databases are then used for heuristic guidance, while applying explicit-state external-memory heuristic search. Different options for parallelization to save time and memory are presented. The general techniques are mapped to the (n 2 ¿ 1)-puzzle as a large-scale case study.
Principles and performance analysis of SeCond: A system for epidemic peer-to-peer content distribution
Authors: Oznur Ozkasap, Mine Caglar, Ali Alagoz
Venue: Journal of Network and Computer Applications (2009)

We propose and design a peer-to-peer system, SeCond, addressing the distribution of large sized content to a large number of end systems in an efficient manner. In contrast to prior work, it employs a self-organizing epidemic dissemination scheme for state propagation of available blocks and initiation of block transmissions. In order to exploit heterogeneity of peers, enhance the utilization of system resources and for the ease of deployment, scalability, and adaptivity to dynamic peer arrivals/departures, we propose mechanisms for adjusting protocol parameters dynamically according to the bandwidth usages. We describe design and analysis details of our protocol SeCond. Comprehensive performance evaluations and comparison with the BitTorrent system model have been accomplished for a wide range of scenarios. Performance results include scalability analysis for different arrival/departure patterns, flash-crowd scenario, overhead analysis, and fairness ratio. The major metrics we study include the average file download time, load on the primary seed, uplink/downlink utilization, and communication overhead. We show that SeCond is a scalable and adaptive protocol which takes the heterogeneity of the peers into account. The protocol is as fair as BitTorrent although it has no explicit strategy addressing free-riding. We also illustrate the applicability of an analytical fluid model to the behavior of SeCond.
IO connection assignment and RDL routing for flip-chip designs
Authors: Jin-Tai Yan, Zhi-Wei Chen
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Given a set of IO buffers and bump balls with the capacity constraints between bump balls, an O(n2) IO assignment and RDL routing algorithm is proposed to assign all the IO connections and minimize the total wirelength with satisfying the capacity constraints and guarantee 100% routability if the capacity constraint is permitted, where n is the number of bump balls in a flip-chip design. Compared with the combination of the greedy IO assignment and our RDL routing, our IO assignment reduces the global wirelength by 7.6% after global routing and improves the routability by 8.8% after detailed routing on the average. Compared with the combination of our IO assignment, the single-layer BGA global router[8] and our detailed routing phase, our RDL routing reduces the global wirelength by 15.9% after global routing and improve the routability by 10.6% after detailed routing on the average for some tested circuits in reasonable CPU time.
Use of Neural Networks in Damage Detection of Strutures
Authors: Lin Niu, Liaoyuan Ye
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

An application of TNN on the damage detection of steel bridge structures is presented. The issues relating to the design of network and learning algorithm are addressed and network architectures have been developed with reference to trussed bridge structures. The training patterns are generated for multiple damaged zones in a structure. The results of simulation show that the algorithm is suitable for structural identification of bridges where the measured data are expected to be imprecise and often incomplete. The engineering importance of the method is demonstrated from the fact that measured input at only a few locations in the structure is needed in the identification process using the TNN.
Simulation optimization applied to injection molding
Authors: María G. Villarreal, Rachmat Mulyana, José M. Castro, Mauricio Cabrera-Ríos
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this work, a simulation optimization method developed by Villarreal and Cabrera-R&iacute;os (2007) is applied to injection molding. The method uses design of experiments and adaptive metamodeling techniques. The application of the method to several global optimization test functions as well as non linear polynomial and non polynomial functions point towards a quick convergence to highly attractive solutions with a low number of simulations. Here the method is used to select the best processing conditions for injection molding a simple rectangular plaque and a real automotive part using different performance criteria.
Web service clustering using text mining techniques
Authors: Wei Liu, Wilson Wong
Venue: International Journal of Agent-Oriented Software Engineering (2009)

The idea of a decentralised, self-organising service-oriented architecture seems to be more and more plausible than the traditional registry-based ones in view of the success of the web and the reluctance in taking up web service technologies. Automatically clustering Web Service Description Language (WSDL) files on the web into functionally similar homogeneous service groups can be seen as a bootstrapping step for creating a service search engine and, at the same time, reducing the search space for service discovery. This paper proposes techniques to automatically gather, discover and integrate features related to a set of WSDL files and cluster them into naturally occurring service groups. Despite the lack of a common platform for assessing the performance of web service cluster discovery, our initial experiments using real-world WSDL files demonstrated the great potential of the proposed techniques.
Testing volatility autocorrelation in the constant elasticity of variance stochastic volatility model
Authors: Gianna Figí-Talamanca
Venue: Computational Statistics Data Analysis (2009)

The sample autocovariance of the suitably scaled squared returns of a given stock is shown here to be a consistent and asymptotically normal estimator of the theoretical autocovariance of the mean variance, when the data is generated by the Constant Elasticity of Variance stochastic volatility (CEV SV) process. By computing explicitly the asymptotic variance of the estimator, confidence bands are obtained for the theoretical autocovariance. For each one of the stock indexes S&P500, CAC40, FTSE, DAX and SMI the estimated confidence bands are compared with the theoretical autocovariances computed for several values of the model parameters. The results suggest that the CEV SV model is able to capture the empirical autocovariance detected on the observed data. Analogous results are derived for the theoretical autocorrelation function.
Accelerating information delivery
Authors: Don S. Culbertson, Dennis Elchesen, Mary Ann Swanson, Frederick G. Kilgour, Russell Shank
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Purpose: To describe using three example institutions, the potential size and scope of the library market for computers, peripheral units and specially designed software. There are literally thousands of libraries in the U.S.; public school, special, college, medical and law. Until recently only the largest institutions with large computer facilities and foundation grants have been able to develop the custom made systems to tend to the library housekeeping, handle enormous inventories of books, index files of journal articles, notify users of items available as fast as they are published, and search the small segment of the world's knowledge which is in machine readable form.
Specification-based Synthesis of Tailor-made Grid Service Wrappers for Scientific Legacy Codes
Authors: Jurgen Hofer, Thomas Fahringer
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

The long lifecycles of many scientific applications tend to surpass multiple generations of Grid technologies opening an increasing gap developers need to bridge. Automatic adaptation and migration of software to newer environments remains therefore as interesting research question. Most existing state-of-the-art solutions are Grid middleware services that execute programs based on provided descriptions forcing clients to use a generic and non-problem- centric interface. This short paper outlines the Otho Toolkit for synthesis of Grid application wrapper services based on specifications of scientific legacy programs. The generated output are service source codes that are either automatically built and packaged into a ready-to-deploy services or taken by developers for manual refinement. The services are customised and tailor-made for a specific application, service hosting environment and computational infrastructure. To increase their benefit they can be enhanced with supplemental functionality such as security credential management or filestaging. We applied the Otho Toolkit recursively to itself to synthesise a sophisticated Factory service that creates application-specific Grid services on-demand.
Extending AOP with models
Authors: Vinay Kulkarni, Sreedhar Reddy
Venue: Proceedings of the 2nd India software engineering conference (2009)

Aspect-oriented programming is a promising approach to address separation of concerns. Aspect-oriented programming languages address the problems of scattering and entanglement by providing an abstraction for specifying cross-cutting concerns in a modular manner. The relevant aspects are then composed to derive the desired implementation. However, current aspect-oriented programming languages only allow this composition to be specified in terms of programming language constructs. This is restrictive and can only be used for simple compositions. Many situations in practice need a richer composition context that cannot be expressed using programming language constructs. Models, being at a higher level of abstraction and closer to the problem domain, can be used to capture this information. We propose an approach to extend aspect-oriented programming with a composition mechanism that can make use of the information captured in models. We also outline an implementation of the proposed approach. The proposed approach has been used to seamlessly integrate model-centric and code-centric development.
SVG-Based Spatial Information Representation and Analysis
Authors: Haosheng Huang, Yan Li, Georg Gartner
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

This paper tries to make some spatial extensions to W3C's Scalable Vector Graphics (SVG) Specification to support SVG-based spatial information representation and analysis in the Web environment. Based on spatial data modeling, this paper attempts to find a theoretical foundation for SVG-based spatial information representation. Then we propose an SVG-based spatial information representation model for spatial data publishing. Furthermore, this paper designs and implements some spatial operators, and integrates them into an SVG-based Spatial Extended SQL to support spatial analysis, which improves the functions of current WebGIS applications, most of which have been only employed for visualization. Finally, this paper designs some case studies. The results of the case studies prove that the suggested methods are feasible and operable for spatial information publishing and analysis via Web.
Computing and Investigations for Everyone
Authors: Eamon Doherty
Venue:  (2008)

This "Everyone" book attempts to the guide the reader through the more essential steps of understanding the basic principles or elements that constitute the daily work of investigators in fields relating to computing and electrical loss. The chapter's are meant to set a foundation for people who may want to enter the field of investigations, or are at the beginning of a career in the area, or are seasoned investigators looking to delve into more contemporary areas of investigations, or for persons that are just interested in reading about matters or topics that are currently revealed in differing forms of media, such as in the successful TV drama series "CSI." The book is formatted sequentially so that the reader can review important legal matters that are a part of most investigations and then go on to peruse the elements of basic electrical principles as they apply to certain types of fire and fault losses. These beginning chapters set a broad stage for the various areas of computing that follow. The book does not necessarily have to be read in the order that it was written. In a sense, the reader may choose to use the book as a reference book. The chapters were written, for the most part, to be able to stand alone, as monographs. There are many chapters that review a broad range of more common topics and there are chapters concerned with more esoteric areas of computing and electronics. Some of these chapters discuss the high-tech methods that are sometimes deployed by thieves, terrorists, pedophiles, stalkers, etc. All of the co-authors reflect their experience as individuals that work closely with the criminal justice and civil institutions.
Cycle-breaking acceleration of SVM training
Authors: Álvaro Barbero, Jorge López, José R. Dorronsoro
Venue: Neurocomputing (2009)

Fast SVM training is an important goal for which many proposals have been given in the literature. In this work we will study from a geometrical point of view the presence, in both the Mitchell-Demyanov-Malozemov (MDM) algorithm and Platt's Sequential Minimal Optimization, of training cycles, that is, the repeated selection of some concrete updating patterns. We shall see how to take advantage of these cycles by partially collapsing them in a single updating vector that gives better minimizing directions. We shall numerically illustrate the resulting procedure, showing that it can lead to substantial savings in the number of iterations and kernel operations for both algorithms.
JSLEE and SIP-Servlets Interoperability with Mobicents Communication Platform
Authors: Jean Deruelle
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

JSLEE is a more complex specification than SIP Servlets, and it has been know as heavyweight and with a steep learning curve. However JSLEE has standardized a high performing event driven execution environment with a good concurrency model and powerful protocol agnostic capabilities covering a variety of telecommunication protocols. SIP Servlets on the other hand is simpler and easier to get started with for developers with Java EE experience. Its focus is on extending the HTTP Servlets and Java EE hosting environments with SIP capabilities. Hence SIP Servlets is more of a SIP programming framework while JSLEE is a complete, self sufficient application environment, a platform. JSLEE and SIP Servlets target different audiences with different needs but they can be complementary in a number of real world cases. This paper will present a converged application built on the Open Source Mobicents Communication Platform. It will show how JSLEE and SIP Servlets can be used together to provide converged applications integrating with network elements via HTTP, SIP and other standard protocols.
Mechanism Design Theory: How to Implement Social Goals
Authors: Eric Maskin
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

The theory of mechanism design can be thought of as the engineering side of economic theory. One begins by identifying a social or economic goal. The theory then addresses the question of whether or not an appropriate institution or procedure (that is, a mechanism) could be designed to attain that goal. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Calculating the energy band structure using sampling and Green's function techniques
Authors: Milad Khoshnegar, Amir Hossein Hosseinia, Nima Arjmandi, Sina Khorasani
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

In this paper, a new method based on Green's function theory and Fourier transform analysis has been proposed for calculating band structure with high accuracy and low processing time. This method utilizes sampling of potential energy in some points of crystal's unit cell with Dirac delta functions, then through lattice Fourier transform gives us a simple and applicable formula for most of nanostructures. Sampling of potential in a crystal lattice of any kind contains accurate approximation of actual potential energy of atoms in the crystal. The step forward regarding the method concentrated on two novel ideas: Firstly, the potential was sampled and approximated by delta functions spread over the unit cell. Secondly, the principal equation of lattice is translated into reciprocal lattice and resulted in a huge reduction of calculations. By this method, it is possible to extract the band structure of any one-, two- or three-dimensional crystalline structure.
Optimising client accesses within Armada
Authors: Fabian Groffen, Martin Kersten, Stefan Manegold
Venue: Proceedings of the Third Workshop on Dependable Distributed Data Management (2009)

The Armada model describes how a distributed database system evolves, using multiple nodes that together form the database. In such system, posing a query involves continuously locating the right node until sufficient data to answer the query has been found. Locating a node involves making a connection to such node. Since making a connection is expensive in time, avoiding to do so where possible, pays off in the total query execution time. In this short paper, we give an extended summary of our work on cutting down the number of made connections per query in an Armada system.