ppxscal/embedding_network huggingface dataset:
A hybrid algorithm of the BP-ANN/GA for classification of urban terrain surfaces with fused data of Landsat ETM and ERS-2 SAR
Authors: Guangzhen Cao, Ya Qiu Jin
Venue: International Journal of Remote Sensing (2007)

A hybrid algorithm of the back propagation artificial neural network and genetic algorithm (BP-ANN/GA) was developed to optimize initial weights and to enable fast convergence of the BP-ANN. This algorithm was applied to the classification of urban terrain surfaces with fused data of Landsat ETM+ and ERS-2 SAR. An example of the Shanghai Pudong area using both Landsat ETM+ and ERS-2 SAR image data demonstrates well the classification when applying our fusion algorithm.
Delighting Chinese users: the Google China experience
Authors: Kai-Fu Lee
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Google entered China market as a late-comer in late-2005, with no local employees, an inadequate product line, and small market share. This talk will discuss Google China's efforts to build up a team, learn about local user needs, apply its global innovation model, and won over users in the past 2.5 years. This talk will cover the results of our user studies, and our key findings about Chinese users for searching and using the Internet. It will also discuss how these findings were applied to our products, and how these products gained traction in the market place. It will also discuss Google's progress in Chinese search relevance, search user experience, and key technology areas where we innovated. This talk will also discuss the process of internationalization - how Google hired locally, and applied its global 20% project approach to encourage truly relevant local innovations. It will discuss several examples of these innovations - from product innovations like the weather map, the input method editor, SMS greetings search, to research innovations like parallel SVM/SVD. Google China's progress dispelled the myth that multinational Internet companies cannot succeed in China. The key ingredients, like in any other success story, are: focus on the customer, embrace the corporate culture, empower local flexibility, and of course, innovate, innovate, innovate.
Stepping-stone detection algorithm based on order preserving mapping
Authors: Ying-Wei Kuo, Shou-Hsuan Stephen Huang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Intruders often do not attack victim hosts directly from their own hosts so as not to reveal their identity. Instead, intruders perform their attacks through a sequence of intermediary hosts before attacking the target. This type of attack is known as a &#x201C;stepping-stone attack&#x201D;. Stepping-stone detection is to determine if a host machine is being used as a stepping-stone by attackers. In this paper, we propose an algorithm for stepping-stone detection using a pervious mapping-based detection method. The technique reduces the detection problem to finding a mapping between two streams of packets. If our algorithm cannot find the mapping, then no such mapping exists. But if there is a mapping, then the proposed algorithm is guaranteed to find one and the solution will always be the one with minimum indexed. We provide the proof of the correctness of the algorithms. Furthermore, the algorithm has a low time complexity. The paper also discusses the effect of chaff packets on the ability to detect stepping-stones.
Check bit prediction using dong's code for logic functions
Authors: A. H. Maamar, G. Russell
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

Check bit prediction is one of the schemes used to perform concurrent error detection in arithmetic and Logic functions. It has been considered for Parity codes, Bose's code, etc., and has been incorporated into some self checking processors. From literature survey to date, however, the only prediction method designed for Dong's code is for Arithmetic functions [12]. In this paper the mathematical equations for the check bit prediction of the Logical functions using Dong's code, are outlined and the check bit prediction hardware described.
XPath evaluation in linear time
Authors: Mikolaj Bojańczyk, Pawel Parys
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

We consider a fragment of XPath where attribute values can only be tested for equality. We show that for any fixed unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size.
Synthesizing Byzantine Fault-Tolerant Grid Application Wrapper Services
Authors: Jürgen Hofer, Thomas Fahringer
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The Grid is inherently unreliable due to its geographical dispersion, heterogeneity and the involvement of multiple administrative domains. The most general case of failures are so-called Byzantine failures where no assumptions about the behavior of faulty components can be made. In this paper a novel system is described that allows to diagnose and tolerate byzantine faults based on service replication. We suggest, briefly describe and compare two fail-stop and two byzantine fault tolerance algorithms. Given that many scientific larger-scale Grid applications have complex outputs the comparison of replica results as needed to implement byzantine fault tolerance becomes a non-trivial task. Therefore we include an automation mechanism based on a generic description language and code generation for this particualar problem. Our approach has been implemented as extension to the Otho Toolkit, a system that synthesizes tailor-made wrapper services for a given application, Grid environment and resource. An analysis of performance and overheads for three real-world applications completes our work.
Jini++: A Framework for Developing Pervasive and Wireless Distributed Applications
Authors: Zhi Quan Lee, Yuan Qin Zhu, Ian Warren
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Applications that run on mobile devices and which communicate over wireless networks are becoming increasingly ubiquitous. Conventional technologies developed for use over wired networks are however unsuitable for wireless environments. In particular, wireless links are relatively unreliable, bandwidth-constrained and can be expensive to use. Furthermore, established technologies do not address the needs of more dynamic pervasive computing environments that are well suited to mobile devices. In this paper, we present an overview of Jini++, a framework that supports development of mobile applications and addresses challenges posed by wireless and pervasive environments. Applications built using Jini++ are context aware in that they intelligently adapt to changes in network conditions and service availability. In addition, Jini++ employs measures to conserve bandwidth and offers support for developing crash-resilient applications. Using Jini++, application developers are free to focus on application logic, thus being relieved of the complexity associated with remote communication. Based on evaluation, we have found Jini++'s simple programming model to reduce development time, and at run-time Jini++ to make more efficient and effective use of the network than current mainstream technologies.
Algebraic decision trees and Euler characteristics
Authors: A. Chi-Chih Yao
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

For any set S contained in R/sup n/, let chi (S) denote its Euler characteristic. The author shows that any algebraic computation tree or fixed-degree algebraic decision tree must have height Omega (log mod chi (S) mod )for deciding the membership question of a compact semi-algebraic set S. This extends a result by A. Bjorner, L. Lovasz and A. Yao where it was shown that any linear decision tree for deciding the membership question of a closed polyhedron S must have height greater than or equal to log/sub 3/ mod chi (S) mod .
Design and Implementation of a Reference Model for Context Management in Mobile Ad-Hoc Networks
Authors: Dominique Dudkowski, Harald Weinschrott, Pedro Jose Marron
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The fundamental paradigm of context-aware computing has lead to a diversity of conceivable context-based applications. In order to support these applications, efficient and scalable context management platforms have become utterly important. In this paper we propose a layered reference model that encapsulates suitable abstractions to tackle the complexity of context management in mobile ad-hoc networks. For each layer, we outline strategies and mechanisms we have developed to manage context information efficiently so that it can readily be used by context-based services and applications in these networks. In addition, we discuss refinements of the current model that we currently investigate, which are related to data semantics such as context quality and expressive location models, performance enhancement by adaptation, and aspects regarding the integration of ad-hoc context management with infrastructure-based systems leading to a hybrid system structure.
A DSP based frequency domain approach for classification of transmission line faults
Authors: M. Jayabharata Reddy, D. K. Mohanta
Venue: Digital Signal Processing (2008)

This paper employs a digital signal processing (DSP) based frequency domain approach using wavelet multi-resolution analysis (MRA) to overcome difficulties such as fault inception angle, fault impedance and fault distance associated with conventional time domain approach employing voltage and current based measurements for fault classification in case of digital relaying of transmission line. The frequency domain approach for fault classification algorithm uses wavelet MRA technique to extract the features of the current signals based on harmonics generated at the instant of occurrence of fault due to abrupt change of currents in a three phase transmission line. Since choice of particular wavelet plays a vital role for extracting features of generated harmonics, therefore an attempt has been made in this proposed research to extensively investigate using 16 wavelets to establish the superiority of Db4 wavelet over other standard wavelets for accurate fault classification.
Posets and planar graphs
Authors: Stefan Felsner, William T. Trotter
Venue: Journal of Graph Theory (2005)

Usually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t - 1 ↕ t], thought to be between t - 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3]. This characterization of outerplanar graphs is closely related to the celebrated result of W. Schnyder [16] who proved that a graph is planar if and only if its dimension is at most 3. (b) The largest n for which the dimension of the complete graph Kn is at most [t - 1 ↕ t] is the number of antichains in the lattice of all subsets of a set of size t - 2. Accordingly, the refined dimension problem for complete graphs is equivalent to the classical combinatorial problem known as Dedekind's problem. This result extends work of Hosten and Morris [14]. The main results are enriched by background material, which links to a line of research in extremal graph theory, which was stimulated by a problem posed by G. Agnarsson: Find the maximum number of edges in a graph on n nodes with dimension at most t. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 273284, 2005
An Analytical Study of Wireless Error Models for Bluetooth Networks
Authors: Hao-Hsiang Hung, Ling-Jyh Chen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Data transmission over wireless networks is challenging due to the occurrence of burst errors, and packet loss caused by such errors seriously limits the maximum achievable throughput of wireless networks. To tailor efficient transmission schemes, it is essential to develop a wireless error model that can provide insight into the behavior of wireless transmissions. In this study, we investigate the wireless error model of Bluetooth networks. We study the FHSS feature of Bluetooth using both ordinary hopping kernels and Adaptive Frequency Hopping (AFH) kernels, and design analytical error models accordingly to capture the channel behavior of Bluetooth networks. We evaluate the proposed models by comparing the analytical results to the simulation results obtained by Markov Chain Monte Carlo (MCMC) algorithms. The results show that our analytical models can represent the channel behavior of Bluetooth networks in all test cases.
The FOSSology project
Authors: Robert Gobeille
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

By its nature, the availability of FOSS has given computer scientists a large body of software and software projects to analyze. By having available source, version control system metadata, and open project communities, much can be learned about a software project, software development and collaborative project development. The goal of the FOSSology project is to create a public, open source software repository, together with tools to facilitate analysis, storage, and sharing of open source software and its metadata. FOSSology does license detection today.
SIMPA: A SIP-Based Mobile Payment Architecture
Authors: Ge Zhang, Feng Cheng, Christoph Meinel
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In recent years, many Mobile Payment (MP) schemes have been proposed and used in practise. However, a prerequisite for extended acceptance and adoption of MP technologies is to deploy an effective MP system. So far, there is no such a standardised and scalable MP platform. Most current MP schemes are circumscribed by its mobile network infrastructures. Fortunately, the fast advancement of 3G technology equips next generation mobile phone network more benefits. Following this direction, we propose SIMPA --- A SIP-based Mobile Payment Architecture for next generation mobile network, which not only supports P2P payment communications between customers and merchants using Session Initiation Protocol (SIP), but also supports several traditional internet security protocols, to enhance privacy, confidentiality and integrity during the transaction. This paper depicts detailed protocol and system architecture of SIMPA. Some application examples from customers’ view are shown to demonstrate its function and feature.
Formal topological characterizations of various continuous domains
Authors: Luoshan Xu, Xuxin Mao
Venue: Computers Mathematics with Applications (2008)

In this paper, some new concepts such as (super-compact) quasi-bases and the consistently (locally) coherent property of super-compact quasi-bases, are introduced. With these concepts, various continuous domains including bc-domains and (s)L-domains, are successfully characterized in formal topological ways. Furthermore, to deal with algebraic domains, the concept of quasi-formal points, a generalization of formal points, is introduced. Formal topological characterizations of various algebraic domains via quasi-formal points are obtained.
Probability and suboptimal distance based lifetime prolong algorithms for wireless sensor networks
Authors: Jinfeng Dou, Zhongwen Guo, Jiabao Cao, Guangxu Zhang, Guangyue Li
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

In the wireless sensor networks, prolonging network lifetime is an important aim. Unbalanced energy consumption influences the network lifetime greatly. First this study proposes probability based energy balancing algorithms. A hybrid transmission mechanism is introduced. The sensor node forwards data either by one-hop direct transmission or by multiple small hops with the probability. This study focuses on a novel transmission probabilities finding algorithm, in which the transmission probabilities for each slice are obtained to even out the energy consumption efficiently. Then, a sub-optimal distance based energy optimization algorithm is proposed to optimize energy consumption. It optimizes the slice width and selects relays by sub-optimal distance near the optimum radio range, saves more energy and improves the network lifetime efficiently. Our claims are well supported by comparative simulations.
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
Authors: Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura
Venue: Discrete Applied Mathematics (2008)

We propose an iterated local search algorithm for the vehicle routing problem with time window constraints. We treat the time window constraint for each customer as a penalty function, and assume that it is convex and piecewise linear. Given an order of customers each vehicle to visit, dynamic programming (DP) is used to determine the optimal start time to serve the customers so that the total time penalty is minimized. This DP algorithm is then incorporated in the iterated local search algorithm to efficiently evaluate solutions in various neighborhoods. The amortized time complexity of evaluating a solution in the neighborhoods is a logarithmic order of the input size (i.e., the total number of linear pieces that define the penalty functions). Computational comparisons on benchmark instances with up to 1000 customers show that the proposed method is quite effective, especially for large instances.
Simultaneous usage of NEMO and MANET for vehicular communication
Authors: Manabu Tsukada, Olivier Mehani, Thierry Ernst
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Mobile Ad-hoc Network (MANET) routing protocols and NEMO Basic Support are considered key technologies for vehicle networks. Cooperation between MANET and NEMO (MANEMO) brings several benefits especially for route optimization and multihoming. We made a real field vehicle communication environment with NEMO and MANET. By switching from NEMO to MANET, routes between vehicles are optimized and network performances improved in terms of latency and bandwidth. Experiment results show that network performances are further improved with simultaneous usage of NEMO and MANET. Network performances were shown on a web site in real time and mapped at locations using GPS information.
Does decorrelation really improve color image compression?
Authors: Evgeny Gershikov, Moshe Porat
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The theory behind compression systems is well established, and it is a common assumption that image compression systems such as DCT (Discrete Cosine Transform) perform better in a decorrelated space than with the highly correlated RGB (Red, Green, Blue) components. YUV is therefore the main choice for compression systems instead of the original RGB domain. As a result, several questions arise: (1) Is a DCT-based compression algorithm optimal in a color space with zero correlations between its components? (2) Is inter-color correlation the only criterion for the performance of a compression system? In this paper we present a new approach to system performance and find a useful transform that provides better compression results than the standard YUV at the same compression rate for high inter-color correlation images.
Design space of networked exertion games demonstrated by a three-way physical game based on Table Tennis
Authors: Florian (“Floyd”) Mueller, Martin Gibbs, Frank Vetere, Stefan Agamanolis
Venue: Computers in Entertainment (CIE) (2008)

Physical leisure games can be beneficial to physical as well as mental health and offer a means to connect with others socially. However, players have to be in the same physical location to play. Recent trends in the gaming industry and research labs have started to embrace exertion games: physical games that are expected to be exhausting because they require intense physical effort. However, there is still a lack of a design space that can guide in evaluating such exertion games, help designers in creating future games by maximizing their potential, and inspire new directions in this domain. We present such a design space for exertion games, based on the characteristics of traditional physical games but extended to support distributed interactions. Our motivation is based on the belief that the physicality found in traditional leisure games contributes to facilitating social bonds. We used this design space to develop a networked table tennis-like game called &ldquo;Table Tennis for Three.&rdquo; It is played with a real paddle and ball and augmented with a large-scale video-conference. Our prototype shows how the application of the design space can leverage the potential for novel exertion gaming experiences such as supporting three players in three geographically distant locations. An evaluation with 41 participants indicated a successful application of some of the ingredients of the networked exertion games &ldquo;cocktail&rdquo;; however, some participants did not enjoy the game, and we present informed interpretations to explain their reactions. With this work we aim to provide other researchers and designers with a practical design space of the main components that can create a networked exertion game, and hence inspire and guide them in designing and evaluating future networked exertion games.
Reverse intergenerational learning: a missed opportunity?
Authors: Carol Baily
Venue: AI Society (2008)

Traditional teaching pedagogy has the young learning from the old. To improve learning in a business environment, generational differences have been identified as being potential barriers between people. There is a growing realisation that technology can be used to bridge the gap between young and old using reverse mentoring. Moving beyond the confines of using reverse intergenerational learning as a tool for only learning new IT has not yet gained general acceptance in the wider business environment. Surely this represents a missed opportunity.
ATA: adaptive transmission algorithms for prolonging lifetime in underwater sensor networks
Authors: Zhongwen Guo, Jinfeng Dou, Wei Han, Guangxu Zhang, Zhengang Ha
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

The severe energy constraints of sensors and the unique characteristics of underwater sensor networks (UWSNs) present major challenges for the long-term monitoring applications. This paper proposes two novel adaptive transmission algorithms for UWSNs to prolong lifetime. When a message becomes available for propagation at a node, the node will propagate data by multi-hop or one-hop to the master node according to the hybrid of its residual energy and a threshold. The threshold is predetermined by the master node and is not changed midway. This study applies the approaches to star topology for various combinations of internode distance, frequency and the number of nodes in a prototype hallow UWSNs. Simulation experiments show that the schemes can prolong the lifetime comparing with the existing schemes of UWSNs.