ppxscal/embedding_network huggingface dataset:
Tinycasper: a privacy-preserving aggregate location monitoring system in wireless sensor networks
Authors: Chi-Yin Chow, Mohamed F. Mokbel, Tian He
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

This demo presents a privacy-preserving aggregate location monitoring system, namely, TinyCasper, in which we can monitor moving objects in wireless sensor networks while preserving their location privacy. TinyCasper consists of two main modules, in-network location anonymization and aggregate query processing over anonymized locations. In the first module, trusted wireless sensor nodes collaborate with each other to anonymize users' exact locations by a cloaked spatial region that satisfies a prespecified privacy requirement. On the other side, the aggregate query processing module collects and analyzes the cloaked spatial regions reported from the wireless sensor nodes to support aggregate and alarm queries over anonymized locations. The prototype of TinyCasper is implemented on a physical test-bed on the TinyOS/Mote platform with 39 MICAz motes.
Side-scan sonographs of steep slopes in the Wushieh Reservoir
Authors: G. -S. Song
Venue: International Journal of Remote Sensing (2007)

Operators tow side-scan sonar transducers at the optimum height from the bottom to produce better quality side-scan sonographs. This can be done only if the bottom is moderately flat. Sonographs with maximum tonal intensity are easily produced on steep slopes e.g. valley banks. Strong signatures are recorded over all ranges due to the poor geometry of sonographs produced without acoustic shadows. In order to create clear scanned images of a steep slope using a side-scan sonar, rotation of the towed fish or tilting the transducer face to the dipping slope surface is suggested. Cases conducted on the shore of the Wushieh Reservoir, Taiwan, in which the bank slopes varied from 10° to 45° are discussed in this work. In general, the angle of the scanned slope determines the degree of towed fish rotation angle. The rotation angle is set at a smaller angle than the slope, giving stronger returns from the lower slope. In contrast, if the rotation angle is set at a larger angle a null return outside the insonified area in the lower slope is produced. A sub-aqueous landslide was observed in the side-scan sonographs using this strategy. This study also gives results that affirm the value of a side-scan sonar as a powerful tool for underwater inspection.
Uncertain optimization of composite laminated plates using a nonlinear interval number programming method
Authors: C. Jiang, X. Han, G. P. Liu
Venue: Computers and Structures (2008)

An uncertain optimization method is suggested to optimize the ply orientations of a composite laminated plate with uncertain material property to obtain a maximum stiffness in the thickness direction. Interval numbers are employed to model the uncertainty of the material property by which only the bounds of the uncertain parameters are needed. An uncertain optimization problem is created based on the elastic waves which are computed by a hybrid numerical method efficiently. A nonlinear interval number programming method is suggested to deal with the uncertain optimization problem. In this method a new order relation of interval number is constructed to transform the uncertain objective function into a deterministic two-objective optimization problem, and a hybrid optimization algorithm is used to eliminate the optimization nesting of the simulation model and whereby improve the computation efficiency. Three numerical examples are investigated, and the optimization results demonstrate the effectiveness of the present method.
IBM POWER6 partition mobility: moving virtual servers seamlessly between physical systems
Authors: W. J. Armstrong, R. L. Arndt, T. R. Marchini, N. Nayar, W. M. Sauer
Venue: IBM Journal of Research and Development (2007)

This paper presents the IBM Power Architecture™ extension for enhanced virtualization that is first implemented in the POWER6™ processor. Virtual partition memory enables all of the memory of a virtual server running in a logical partition to be made virtual by the POWER Hypervisor™ firmware. The Processor Compatibility register allows backward compatibility by providing a mode in which a POWER6 processor behaves like a POWER5™ processor. Enhancements to the timebase facility enable updates to the virtual timebase of a logical partition while maintaining consistency with other partitions in the system. These fundamental enhancements are explained and their role in implementing the new partition mobility junction is described. Partition mobility allows the seamless migration of virtual servers from one physical POWER6 microprocessor-based system to another.
Formal Modelling of Dynamic Coalitions, with an Application in Chemical Engineering
Authors: Jeremy W. Bryans, John S. Fitzgerald, Cliff B. Jones, Igor Mozolevsky
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Dynamic coalitions are temporary alliances formed between agents in order to achieve specific business goals. Such coalitions can vary widely in architecture, scale, complexity and lifetime. Few techniques have so far emerged to assist in the analysis and design of coalitions. We apply formal model-oriented techniques to help structure the space of dynamic coalitions, with an emphasis on modelling information flow. A series of models is developed in VDM, each emphasising a different "dimension'' of the space. These are used to characterise a new dynamic coalition architecture under development for the chemical engineering industry. Tool-supported analysis of this formal model has identified potential improvements in the coalition architecture.
Using traceless genetic programming for solving multi-objective optimization problems
Authors: Mihai Oltean, Crina Grosan
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

Traceless genetic programming (TGP) is a genetic programming (GP) variant that is used in cases where the focus is on the output of the program rather than the program itself. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. Two genetic operators are used in conjunction with TGP: crossover and insertion. In this paper, we will focus on applying TGP to solving multi-objective optimization problems, which are quite unusual in GP. Each TGP individual stores the output of a computer program (tree), representing a point in the search space. Numerical experiments show that TGP is able to solve the considered test problems both rapidly and accurately.
Designing e-learning games for rural children in India: a format for balancing learning with fun
Authors: Matthew Kam, Aishvarya Agarwal, Anuj Kumar, Siddhartha Lal, Akhil Mathur, Anuj Tewari, John Canny
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Poor literacy remains a barrier to economic empowerment in the developing world. Of particular importance is fluency in a widely spoken "world language" such as English, which is typically a second language for these low-income learners. We make the case that mobile games on cellphones is an appropriate solution in the typical ecologies of developing regions. The challenge is to design e-learning games that are both educational and pleasurable for our target learners, who have limited familiarity with high technology. We propose the receptive-practice-activation cycle that could be used as the conceptual model for the designs. We then report how this format could be refined, based on our experiences in the field with three games that have collectively undergone nine rounds of iterations. In particular, it appears that maintaining a distinction between learning and fun to some extent is necessary for effective designs.
Modelling solitary waves of a fifth-order non-linear wave equation
Authors: Turabi Geyikli
Venue: International Journal of Computer Mathematics (2007)

A numerical solution of a fifth-order non-linear dispersive wave equation is set up using collocation of seventh-order B-spline interpolation functions over finite elements. A linear stability analysis shows that this numerical scheme, based on a Crank-Nicolson approximation in time, is unconditionally stable. The method is used to model the behaviour of solitary waves.
Collaborative-Inquiry Learning in the Environment. Design Experiment with Distributed Face-to-Face and Mobile Scaffolds
Authors: Jari Laru, Sanna Järvelä
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

In this study, learning with mobile technologies is grounded in theories of cognitive tools and distributed scaffolding, which were applied to scaffold collaborative-inquiry learning on a nature trail. The general aim of this study was to design, implement and evaluate the case for collaborative inquiry into learning in the environment. The group (n=22) of primary school pupils worked for two hours, in six triads and two dyads, observing traces of animate and inanimate objects in the wild. The results showed considerable differences in the nature of the discourse and inquiry learning. It can be concluded that minimally guided instruction where scaffolds are distributed among pupils is not enough to advance a collaborative inquiry learning.
A Paradigm for Self-Organisation: New Inspiration from Ant Foraging Trails
Authors: Duncan E. Jackson, Mesude Bicak, Mike Holcombe
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

Self-organised biological systems are robust, flexible and adaptive. They respond to changing conditions in a manner which is desirable in emerging computational systems. The problems solved by Pharaoh’s ants are analogous to those challenging modern computer science; specifically dynamic or continuous optimisation problems. Pharaoh’s ants utilise multiple chemical pheromones for communication (and memory) over divergent time scales. Furthermore, there is a division of labour between pathfinder scouts who persistently search for the optimal solution and generalised foragers who exploit the current best solution. This subtle balance means that multiple solutions can be maintained while an optimum is still sought, but alternative solutions are kept available. The remarkable sophistication of this self-organised ant foraging system clearly exhibits many desirable properties. The aim of our project is to take inspiration from these properties and deliver novel ant algorithms, which can apply to the problems of autonomic and autonomous systems.
Implementing Causal Analysis and Resolution in Software Development Projects: The MiniDMAIC Approach
Authors: Fca. Márcia G. S. Gonçalves, Carla Ilane Moreira Bezerra, Arnaldo Dias Belchior, Ciro Carneiro Coelho, Carlo Giovano S. Pires
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Handling problems and defects in software development projects is still a difficult matter in many organizations. The problems’ analyses, when performed, usually do not focus on the problems sources and root causes. As a result, bad decisions are taken and the problem is not solved or can even be aggravated by rework, dissatisfaction and increases cost due to lack of quality. These difficulties make it hard for organizations that adopt the CMMI model to implement the Causal Analysis and Resolution (CAR) process area in software projects, as projects usually have to deal with very limited resources. In this context, this work proposes an approach, called MiniDMAIC, for analyzing and resolving defect and problem causes in software development projects. The MiniDMAIC approach is based on Six Sigma’s DMAIC methodology and the Causal Analysis and Resolution process area from CMMI Level 5.
Games with a Purpose for the Semantic Web
Authors: Katharina Siorpaes, Martin Hepp
Venue: IEEE Intelligent Systems (2008)

Weaving the Semantic Web requires that humans contribute their labor and judgment for extending and updating formal knowledge structures. Key tasks in evolving the current Web to a Semantic Web include discovering and specifying semantic relationships between multiple ontologies and annotating textual or multimedia information. However, whereas the Web 2.0 movement is fueled by an unprecedented number of contributions from Web users, there's a substantial lack of user involvement in weaving the heavyweight Semantic Web. One cause of this lack of involvement is a lack of proper incentive structures. Hiding the tasks involved in weaving the Semantic Web behind online multiplayer games presents the tasks as fun and intellectually challenging entertainment. A series of OntoGame prototypes support the full life cycle of realizing the Semantic Web. These games adopt Luis von Ahn's "games with a purpose" concept—that is, presenting a task as an online game can motivate many people to work on this task, and for free. Preliminary results suggest that users are willing to spend substantial time playing the OntoGames. In addition, a setting in which users must propose a solution to a conceptual-modeling task such that it will most likely be consensual with an unknown game partner produces high-quality semantic data.
Decreasing the diameter of bounded degree graphs
Authors: Noga Alon, András Gyárfás, Miklós Ruszinkó
Venue: Journal of Graph Theory (2000)

Let fd&thinsp;(G) denote the minimum number of edges that have to be added to a graph G to transform it into a graph of diameter at most d. We prove that for any graph G with maximum degree D and n&thinsp;>&thinsp;n0 (D) vertices, f2(G)&thinsp;=&thinsp;n&thinsp;-&thinsp;D&thinsp;-&thinsp;1 and f3(G)&thinsp;&ge;&thinsp;n&thinsp;-&thinsp;O(D3). For d&thinsp;&ge;&thinsp;4, fd&thinsp;(G) depends strongly on the actual structure of G, not only on the maximum degree of G. We prove that the maximum of fd&thinsp;(G) over all connected graphs on n vertices is n-&lfloor;d-2&thinsp;&rfloor;&thinsp;-&thinsp;O(1). As a byproduct, we show that for the n-cycle Cn, fd&thinsp;(Cn)&thinsp;=&thinsp;n-(2&lfloor;d-2&thinsp;&rfloor;&thinsp;-&thinsp;1)&thinsp;-&thinsp;O(1) for every d and n, improving earlier estimates of Chung and Garey in certain ranges. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 161&ndash;172, 2000 1991 Mathematics Subject classification: 05C12.
Portable digital libraries on an ipod
Authors: David Bainbridge, Steve Jones, Sam McIntosh, Matt Jones, Ian H. Witten
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper describes the facilities we built to run a self-contained digital library on an iPod. The digital library software used was the open source package Greenstone, and the paper highlights the technical problems that were encountered and solved. It attempts to convey a feeling for the kind of issues that must be faced when adapting standard DL software for non-standard, leading-edge devices.
A field programmable gate array media player for realmedia files
Authors: Kuo-pao Yang, Theresa Beaubouef
Venue: Journal of Computing Sciences in Colleges (2008)

This paper discusses ongoing research into the design and development of custom configurable hardware for use with file formats that to date require special software for access, with the goal of improved system performance and flexibility. In particular, a field programmable gate array media player is introduced for use with RealMedia files. Preliminary results are promising, and the successful completion of this research will lead to the study and design of many more of these types of systems devices.
Architectural knowledge discovery with latent semantic analysis: Constructing a reading guide for software product audits
Authors: Remco C. de Boer, Hans van Vliet
Venue: Journal of Systems and Software (2008)

Architectural knowledge is reflected in various artifacts of a software product. In a software product audit this architectural knowledge needs to be uncovered and its effects assessed in order to evaluate the quality of the software product. A particular problem is to find and comprehend the architectural knowledge that resides in the software product documentation. In this article, we discuss how the use of a technique called Latent Semantic Analysis can guide auditors through the documentation to the architectural knowledge they need. We validate the use of Latent Semantic Analysis for discovering architectural knowledge by comparing the resulting vector-space model with the mental model of documentation that auditors possess.
An Approach to Graph and Netlist Compression
Authors: Jeehong Yang, Serap A. Savari, Oskar Mencer
Venue: Proceedings of the Data Compression Conference (2008)

We introduce an EDIF netlist graph-based compression algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains. The algorithm builds on the graph mining tool SUBDUE. Our algorithm, CEDIF (Compressed EDIF), compresses the EDIF file to a size about 39% of the size of the compressed file resulting from the state-of-the-art PAQ text compression algorithm and to about 85% of the size of a GRAPHITOUR-like graph compression algorithm.
Annotating UI architecture with actual use
Authors: Neil Ramsay, Stuart Marshall, Alex Potanin
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

Developing an appropriate user interface architecture for supporting a system's tasks is critical to the system's overall usability. While there are principles to guide architectural design, confirming that the correct decisions are made can involve the collection and analysis of lots of test data. We are developing a testing environment that will automatically compare and contrast the actual user interaction data against the existing user interface architectural models. This can help a designer more clearly understand how the actual tasks performed relate to the proposed architecture, and enhances feedback between different design artifacts.
Growth of the flickr social network
Authors: Alan Mislove, Hema Swetha Koppula, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee
Venue: Proceedings of the first workshop on Online social networks (2008)

Online social networking sites like MySpace, Orkut, and Flickr are among the most popular sites on the Web and continue to experience dramatic growth in their user population. The popularity of these sites offers a unique opportunity to study the dynamics of social networks at scale. Having a proper understanding of how online social networks grow can provide insights into the network structure, allow predictions of future growth, and enable simulation of systems on networks of arbitrary size. However, to date, most empirical studies have focused on static network snapshots rather than growth dynamics. In this paper, we collect and examine detailed growth data from the Flickr online social network, focusing on the ways in which new links are formed. Our study makes two contributions. First, we collect detailed data covering three months of growth, encompassing 950,143 new users and over 9.7 million new links, and we make this data available to the research community. Second, we use a first-principles approach to investigate the link formation process. In short, we find that links tend to be created by users who already have many links, that users tend to respond to incoming links by creating links back to the source, and that users link to other users who are already close in the network.
Low cost scan test by test correlation utilization
Authors: Ozgur Sinanoglu
Venue: Journal of Computer Science and Technology (2007)

Scan-based testing methodologies remedy the testability problem of sequential circuits; yet they suffer from prolonged test time and excessive test power due to numerous shift operations. The correlation among test data along with the high density of the unspecified bits in test data enables the utilization of the existing test data in the scan chain for the generation of the subsequent test stimulus, thus reducing both test time and test data volume. We propose a pair of scan approaches in this paper; in the first approach, a test stimulus partially consists of the preceding stimulus, while in the second approach, a test stimulus partially consists of the preceding test response bits. Both proposed scan-based test schemes access only a subset of scan cells for loading the subsequent test stimulus while freezing the remaining scan cells with the preceding test data, thus decreasing scan chain transitions during shift operations. The proposed scan architecture is coupled with test data manipulation techniques which include test stimuli ordering and partitioning algorithms, boosting test time reductions. The experimental results confirm that test time reductions exceeding 97%, and test power reductions exceeding 99% can be achieved by the proposed scan-based testing methodologies on larger ISCAS89 benchmark circuits.
Fairness issues in software virtual routers
Authors: Norbert Egi, Adam Greenhalgh, Mark Handley, Mickael Hoerdt, Felipe Huici, Laurent Mathy
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

In this paper we investigate the building of a virtual router platform that ensures isolation and fairness between concurrent virtual routers. Recent developments in commodity x86 hardware enable us to take advantage of the flexibility and wealth of resources available to a software router in order to build a virtual router platform. Using commodity x86 hardware we show that it is viable to run highly experimental and untrusted router systems along side a production router on the same hardware platform without sacrificing performance. We investigate the extent to which we can isolate a virtual router running experimental code from other virtual routers.
Behavioral Interface Conformance Checking for WS-BPEL Processes
Authors: Aziz Salah, Guy Tremblay, Aida Chami
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Web services can be described at various levels and using various notations, e.g., operations (WSDL), orchestration (WS-BPEL), multi-partners collaborations (WS-CDL). The first two provide descriptions similar to those found in typical programming languages, namely, syntactical description of service interface and operational description of service behavior. In this paper, we show how Web services descriptions can be extended with simple declarative behavior specification, using a form of regular expressions. We explain the relationships between such specifications and WS-BPEL abstract processes. We also describe how a concrete, thus executable, WS-BPEL process can be shown to satisfy its associated abstract specification, using the Spin model-checker.