ppxscal/embedding_network huggingface dataset:
A Novel Intrusion Detection Architecture Based on Adaptive Selection Event Triggering for Mobile Ad-hoc Networks
Authors: Chuan-xiang Ma, Ze-ming Fang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Due to resource limitation, it is an optimum solution for intrusion detection in mobile Ad-hoc networks (MANETs) that all nodes investigate system and user activities while a subset of network nodes are selected as monitoring nodes to monitor and detect network packets. In this paper, a novel intrusion detection architecture for energy-constrained mobile Ad-hoc networks is proposed, in which the network detection module is optional. Monitoring nodes are selected by activating the network detection model to work. A selection scheme of monitoring nodes called Event Triggering Based Adaptive Selection (ETBAS) is also proposed, which introduces the mechanism of monitoring states and the method of event triggering. Triggering events, for example, a node has been voted to be a monitoring node by its neighbors, the battery power of a monitoring node has consumed to a threshold, or the networks topology has changed, can activate a non-monitoring node, or make a monitoring node fall asleep. High connectivity and energy resource are balanced in ETBAS for adaptive selection scheme, which is adaptable to dynamically changing networks and enhances the network lifetime.
Design and Implementation of GeoBrain Online Analysis System (GeOnAS)
Authors: Weiguo Han, Liping Di, Peisheng Zhao, Yaxing Wei, Xiaoyan Li
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

GeOnAS is an extensible, scalable and powerful online geospatial analysis system based on Service Oriented Architecture (SOA), and is designed and implemented with the complementary technologies, Asynchronous JavaScript and XML (Ajax) and Web services, which greatly increase the interactive capabilities of graphical user interfaces and improve the user experience. It provides a highly interoperable way of accessing Open Geospatial Consortium (OGC) compliant web services for geospatial data discovery, retrieval, visualization and analysis, and leverages web service standards to enable service discovery, selection, negotiation and invocation for making more informed decisions.
Time Distribution of Game Players and Economic Gross Replacement: The Replacement of GDP by Virtual Economic Activity
Authors: Hui Peng, Lei Zhang, Hong Wu
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

On-line virtual games and community have becoming a new way of entertainment and networking. As people exhibit different activities in the virtual world as the real world, obsession in virtual world enjoyment might seems to reduce people’s time on real life consumption, job, which seems to jeopardize their job performance and curtail the revenue generated from the real world. This article tried to analyze the effect of virtual activities on the macro-economy. We find that virtual activities, which include in-world activities and inter-world activity, do generate economic value and make contribution to the GDP for the whole country. We also develop a method on how to measure the net replacement effect of the virtual economic activity on real GDP, and the net effect on Mega-GDP. Data from Second Life demonstrates that the virtual game and online community has positive effect on the Mega-GDP and is beneficial to the economy.
A Study of the Grid Technology
Authors: Xu Bing
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This article gives a detailed introduction to the basic concept of Grid technology, the definition, features, and calculation of Grid. Meantime, this paper makes a creative study on the current popular agreement-centered sand filter model in Grid system structure and the service-centered OGSA. With the application of Grid technology, Grid users are provided with integrated calculating environment of efficiency and information service. The realization of Grid also lays a firm foundation for the comprehensive integrated technology to solve complex system problems.
Pulling strings from a tangle: visualizing a personal music listening history
Authors: Dominikus Baur, Andreas Butz
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

The history of songs, to which a person has listened, is a very personal piece of information. It is a rich data set that comes as a byproduct of the use of digital music players and can be obtained without interfering with the user. In this paper, we present three visualizations for this data set and a mechanism for generating new playlists from the user's own listening history, based on a navigation metaphor. First, temporal proximity is interpreted as a simple similarity measure to lay out the entire history on a two-dimensional plane. Closed listening sessions are then used to make chronological relations visible. The generated playlists mimic the user's previous listening behavior, and the visualizations make the automatic choices understandable, as they share visual properties with the history. In this sense, our visualizations provide a visual vocabulary for listening behaviors and bring scrutability to automatic playlist generation.
Data compression procedures utilizing the similarity of data
Authors: Yahiko Kambayashi, Narao Nakatsu, Shuzo Yajima
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

In large database systems, we usually encounter the situation when a set of similar data is to be stored. This paper discusses efficient data compression procedures utilizing similarity of data. These procedures are suitable for compressing versions of programs, a series of data produced in an office etc. The procedure to compress one string utilizing regularity of data is as follows: 1. Calculate all maximum repeated substrings in the given string. 2. Since each repeated substring is required to be stored only once, replace the second and later occurrence of the same substring by the code which shows the position of the first occurrence of the substring. The procedure to compress two strings w1 and w2 utilizing data similarity is as follows: 1. Calculate all maximum common substrings of w1 and w2. 2. Find a minimum cover for w2 using the maximum common substrings contained in w1. 3. Encode w2 by codes, each of which shows a substring of w1. These procedures are shown to require time only proportional to the total length of data and thus they are efficient. Combinations and variations of these two procedures are also discussed in the paper.
Can users react toward an on-screen agent as if they are reacting toward a robotic agent?
Authors: Takanori Komatsu, Nozomi Kuki
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Our former study showed that users tended not to react to an on-screen agent's invitation of a Shiritori game (a last and first game), but did to a robotic agent. Thus, the purpose of this study was to investigate the contributing factors that could make the users react toward an on-screen agent as if they were reacting toward a robotic agent. The results showed that the participants who first accepted the invitation of a robotic agent that was assigned an attractive character reacted toward the on-screen agents as if they were reacting to the robotic one.
Analysis of Human Actions for Video Indexing
Authors: Zhuoyuan Chen, Peng Cui, Lifeng Sun, Shiqiang Yang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Automatically understanding human actions is crutial for efficiently indexing many types of videos, such as sports videos, home videos, movies etc. However, it is challenging due to their variances caused by different actors, different scales, and different views. In order to incorporate these variances, most methods in literature have to sacrifice the discriminability of action models. In this paper, we address the tradeoff between invariability and discriminability. We firstly propose a novel set of pixel-wise features which are invariant to actor appearances, scales, and motion directions. Then, multi-prototype action models are constructed to realize view invariance. By leaving the most challenging invariance from feature level to model level, we successfully maintain the discriminability of action models. The extensive experiments demonstrated the good performance of the proposed method.
Foreign Ownership Restrictions: A Numerical Approach
Authors: Bilgehan Karabay, Gernot Pulverer, Ewa Weinmüller
Venue: Computational Economics (2009)

In this paper, we analyze the reason behind the use of foreign ownership restrictions on inward Foreign Direct Investment (FDI). We extend the results developed in Karabay (2005) by changing the condition on share distribution in the model. Due to this change, we are able to analyze the political economy aspect of this restrictive policy, i.e., we can study the effect of the host government's welfare preference on the optimal foreign ownership restriction. Since the analytical solution to the optimal share restriction policy cannot be specified in general, we use a numerical approach based on collocation to approximate the solution to the problem. Within this framework, under certain conditions, it turns out that the rent extraction-efficiency trade-off is sharper the less the host government favors the local firm. We show that not only economic factors but also political factors play an important role in the determination of the foreign ownership restrictions.
AVMEM - availability-aware overlays for management operations in non-cooperative distributed systems
Authors: Ramsés Morales, Brian Cho, Indranil Gupta
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Monitoring and management operations that query nodes based on their availability can be extremely useful in a variety of large-scale distributed systems containing hundreds to thousands of hosts, e.g., p2p systems, Grids, and PlanetLab. This paper presents decentralized and scalable solutions to a subset of such availability-based management tasks. Specifically, we propose AVMEM, which is the first availability-aware overlay to date. AVMEM is intended for generic non-cooperative scenarios where nodes may be selfish and may wish to route messages to a large set of other nodes, especially if the selfish node has low availability. Under this setting, our concrete contributions are the following: (1) AVMEM allows arbitrary classes of application-specified predicates to create the membership relationships in the overlay. In order to avoid selfish nodes from exploiting the system, we focus on predicates that are random and consistent. In other words, whether a given node y is a neighbor of a given node x is decided based on a consistent and probabilistic predicate, dependent solely on the identifiers and availabilities of these two nodes, but without using any external inputs. (2) AVMEM protocols discover and maintain the overlay spanned by the application-specified AVMEM predicate in a scalable and fast manner. (3) We use AVMEM to execute important availability-based management operations, focusing on range-anycast, range-multicast, threshold-anycast, and threshold-multicast. AVMEM works well in the presence of selfish nodes, scales to thousands of nodes, and executes each of the targeted operations quickly and reliably. Our evaluation is driven by real-life churn traces from the Overnet p2p system, and shows that AVMEM works well in practical settings.
Research on Instrumental Error Compensation of Strap-down Inertial Navigation System
Authors: Jichao Jia, Suilao Li, Changshan Zhao, Rui Long
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Error of inertial instruments is a very important factor which influences the accuracy of SINS. The error models of the inertial instruments are established, and then error compensation algorithms are deduced which can simultaneously compensate the installation error, error of accelerometers, dynamic error and static error of gyroscope integrated. Experimental verification of algorithms shows the algorithms are feasible.
Error-Diffused Image Security Improving Using Overall Minimal-Error Searching
Authors: Jing-Ming Guo, Yun-Fu Liu
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This study presents a high capacity data hiding method for generating high quality watermarked halftone images. The embedded watermarks can be distributed into single or multiple halftone images with the proposed Overall Minimal-Error Searching (OMES). The proposed method modifies the halftone values at same position of all host images with the trained Substitution Table (S-Table). The S-Table makes the original combination of these halftone values as another meaningful combination for embedded watermark, which is the key part in determining the image quality. Hence, an optimization procedure is proposed to achieve the optimized S-Table. As demonstrated in the experimental results, the proposed approach provides good image quality and is able to guard against some frequent happened attacks in printing applications.
A neural networks approach to minority game
Authors: Luca Grilli, Angelo Sfrecola
Venue: Neural Computing and Applications (2009)

The minority game (MG) comes from the so-called &#x201c;El Farol bar&#x201d; problem by W.B. Arthur. The underlying idea is competition for limited resources and it can be applied to different fields such as: stock markets, alternative roads between two locations and in general problems in which the players in the &#x201c;minority&#x201d; win. Players in this game use a window of the global history for making their decisions, we propose a neural networks approach with learning algorithms in order to determine players strategies. We use three different algorithms to generate the sequence of minority decisions and consider the prediction power of a neural network that uses the Hebbian algorithm. The case of sequences randomly generated is also studied.
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data-Part 2
Authors: Florent Sourbier, Stéphane Operto, Jean Virieux, Patrick Amestoy, Jean-Yves L'Excellent
Venue: Computers Geosciences (2009)

This is the second paper in a two-part series that describes a massively parallel code that performs 2D full-waveform inversion of wide-aperture seismic data for imaging complex structures. We present several numerical validation of the full-waveform inversion code with both canonical and realistic synthetic examples. We illustrate how different multiscale strategies can be applied by either successive mono-frequency inversions or simultaneous multifrequency inversions and their impact on the convergence and the robustness of the inversion. We present a scalability analysis using a real marine data set recorded by a dense array of ocean bottom seismometers to image the crustal structure of a subduction zone. We obtained a speedup of 20 when using 50 processes on a PC cluster which allowed us to iteratively invert 13 frequencies of the full data set in less than 2 days. This computational performance will allow in the future more extensive analysis of full-waveform tomography methods when applied to representative case studies or when considering 3D geometries.
Object Tracking and Motion Capturing in Hardware-Accelerated Multi-camera System
Authors: Sirisak Leephokhanon, Theerayod Wiangtong
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This paper presents a multi-camera system where reconfigurable hardware and video codec are used to assist real-time video processing. Video inputs from all analog cameras are decoded and processed by FPGA to accelerate overall processing time. Two applications including multiple-object tracking and motion capturing are implemented in this system to verify real-time capability. In multiple-object tracking, video images are rearranged and combined into a single image that profits the tracking algorithm called multiple-CAMshift running in software. In motion capturing, every frame from all cameras, located in different angles, is processed to find the coordinates of 11 reference color-objects. Results are sent to a computer for constructing 3-D image in real-time.
Adaptive context mediation in dynamic and large scale vehicular networks using relevance backpropagation
Authors: Ansar-Ul-Haque Yasar, Davy Preuveneers, Yolande Berbers
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Adaptive context mediation in large scale vehicle networks leads towards telematics which refers to the concept of vehicles equipped with context-aware embedded smart computing devices with communication capabilities over certain networks. With the use of telematics we can make use of wide range of smart inter-vehicle communication applications like emergency message transmission, collision avoidance, congestion monitoring and intelligent parking space locator. In this paper we present certain requirements for adaptive context-aware information mediation in large scale vehicle networks. We make use of quality attributes for context information and network properties of large scale vehicle networks and experiment with real time data collected using a car simulator. We simulate flooding and other dissemination based communication techniques with relevance backpropagation for large scale vehicle networks using OMNET++ to analyze the flow of context information. Our simulation results show that our context-aware and adaptive directed diffusion of information using relevance backpropagation increases the performance of the nodes in a large scale vehicle network with less communication overhead.
Improving Cluster-Based Peer-to-Peer Systems
Authors: Yadong Gong, Xiaola Lin
Venue: International Journal of Distributed Sensor Networks (2009)

To make P2P (Peer-to-Peer) logical overlay network match the physical topology, cluster-based P2P systems have been proposed. In such systems, nodes maintain two types of links: local link and remote link. Node uses local links to cluster nodes with short network distance and the remote link to build connections with some remote nodes according to certain rules. When a query is generated, it is first processed in local cluster (intra-cluster query) based on local links, and if it fails, it will be selectively relayed to other clusters (inter-cluster query) based on remote links. Because the number of nodes and the distance between nodes in local clusters are small compared to the entire P2P network, intra-cluster query processes can get high efficiency just using some simple search methods such as Flooding or Random Walk. Nevertheless, the dynamic character of nodes and decentralized distribution of resources in the systems make the nodes in one cluster difficult to maintain up-to-date resource distribution information in other clusters. Thus, the efficiency of inter-cluster query is limited. In P2P systems, stable nodes have much longer online time, so they have a longer time to let other nodes download resources from them. Also, maintaining resource distribution of stable nodes can cause much less traffic, incurred by the dynamic nature of nodes, than dynamic nodes. Based on the above analysis, we propose the Differentiated Publishing (DiffPublishing) architecture by letting resources of stable nodes serve queries in large areas and having resources of dynamic nodes answer queries in local clusters. In the proposed system, the resources of the stable nodes are indexed by a decentralized topology: service provider overlay. When a query is generated, it is first processed in the local cluster, and if it fails, it will be forwarded to the service provider overlay. Because most resources in P2P systems are provided by a small portion of super nodes that tend to be stable, a high query success rate can be achieved in the service provider overlay. Also, maintaining resource indices of stable nodes can save much traffic caused by the dynamic nature of nodes, so the maintenance cost in service provider overlay is not expensive. Search traffic in the proposed system is dramatically reduced due to the shrunken search scope. More importantly, the proposed DiffPublishing architecture can be easily deployed in existing cluster-based P2P systems to improve their inter-cluster query processes.
Lower bounds for processing data with few random accesses to external memory
Authors: Martin Grohe, André Hernich, Nicole Schweikardt
Venue: Journal of the ACM (JACM) (2009)

We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situation are the size of the main memory and the number of random accesses to external memory. We note that sequentially streaming data from external memory through main memory is much less prohibitive. We propose an abstract model of this scenario in which we restrict the size of the main memory and the number of random accesses to external memory, but admit arbitrary sequential access. A distinguishing feature of our model is that it allows the usage of unlimited external memory for storing intermediate results, such as several hard disks that can be accessed in parallel. In this model, we prove lower bounds for the problem of sorting a sequence of strings (or numbers), the problem of deciding whether two given sets of strings are equal, and two closely related decision problems. Intuitively, our results say that there is no algorithm for the problems that uses internal memory space bounded by N1&minus;&epsiv; and at most o(log N) random accesses to external memory, but unlimited &ldquo;streaming access&rdquo;, both for writing to and reading from external memory. (Here, N denotes the size of the input and &epsiv; is an arbitrary constant greater than 0.) We even permit randomized algorithms with one-sided bounded error. We also consider the problem of evaluating database queries and prove similar lower bounds for evaluating relational algebra queries against relational databases and XQuery and XPath queries against XML-databases.
Interface, environmental behavior, and the city
Authors: Jordan Geiger
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper describes the design of an urban, ubiquitous computing-assisted, month-long game, in which place-based teams use the infrastructure and protocols of toll plazas to create momentary competitive events in the streets. These events expose and engage problems of data privacy, cultural identity and freedom of movement in the city; and generate revenue for the remediation of automotive air pollution. The game's byproduct, or prize, is the initiation of a fund for projects to remediate air pollution that is a result of automotive commuter traffic. The project was created for an exhibition on ubiquitous computing and its consequences for urban design. Its development followed a period of research that uncovered relationships between interfaces embedded in the infrastructure of cities today, and a range of opportunities that they open for reconciling environmental damage resulting from the era of industrialization.