ppxscal/embedding_network huggingface dataset:
SVM optimization: inverse dependence on training set size
Authors: Shai Shalev-Shwartz, Nathan Srebro
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple subgradient descent approach indeed displays such behavior, at least for linear kernels.
Randomized consensus in expected O(n log/sup 2/ n) operations per processor
Authors: J. Aspnes
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The paper presents a new randomized algorithm for achieving consensus among asynchronous processors that communicate by reading and writing shared registers. The fastest previously known algorithm requires a processor to perform an expected O(n/sup 2/ log n) read and write operations in the worst case. In the algorithm, each processor executes at most an expected O(n log/sup 2/ n) read and write operations, which is close to the trivial lower bound of Omega (n). All previously known polynomial-time consensus algorithms were structured around a shared coin protocol in which each processor repeatedly adds random +or-1 votes to a common pool. Consequently, in all of these protocols, the worst case expected bound on the number of read and write operations done by a single processor is asymptotically no better than the bound on the total number of read and write operations done by all of the processors together. The authors succeed in breaking this tradition by allowing the processors to cast votes of increasing weights. This grants the adversary greater control since he can choose from up to n different weights (one for each processor) when determining the w i ht of the next vote to be cast. They prove that the shared coin protocol is correct nevertheless using martingale arguments.
Learning classifier system ensemble and compact rule set
Authors: Yang Gao, Joshua Zhexue Huang, Lei Wu
Venue: Connection Science (2007)

This paper presents a learning classifier system ensemble for knowledge discovery from incremental data. The new ensemble was designed with a two-level architecture to improve the generalization ability. The new incoming cases are first bootstrapped to generate data as inputs to the first level classical learning classifier systems. The second level contains a plurality-vote module to determine the final classification by combining the classification results of the first level learning classifier systems. Each learning classifier system in the first level consists of two major modules, a genetic algorithm module for facilitating rule-discovery and a reinforcement learning module for adjusting the strength of the corresponding rules when rewards are received from the environment. We propose a revised Wilson's compact rule algorithm for generation of the compact rule set from the population set to improve the readability of the model. Two experiments were conducted. One was data mining of medical data and the other was steganalysis of images. The experimental results have shown that the new ensemble produced better performance on incremental data mining and better generalization than the single learning classifier system and other supervised learning methods. The results also showed that the compact rules were more interpretable.
User authentication and undeniable billing support for agent-based roaming service in WLAN/cellular integrated mobile networks
Authors: Minghui Shi, Xuemin (Sherman) Shen, Jon W. Mark, Dongmei Zhao, Yixin Jiang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper, a framework of authentication and undeniable billing support for an agent-based roaming service in WLAN/cellular networks interworking networks is proposed. This framework circumvents the requirement of peer-to-peer roaming agreements to provide seamless roaming service between WLAN hotspots and cellular networks operated by independent wireless network service providers. Within the framework, an adaptive authentication and an event-tracking scheme have been developed, which allow the application of undeniable billing service to cellular network even when it still uses a traditional authentication scheme. The proposed modified dual directional hash chain (MDDHC) based billing support mechanism features mutual non-repudiation. Security analysis and overhead evaluation demonstrate that the proposed framework is secure and efficient.
Integrating agile methods for mixed reality design space exploration
Authors: Volker Paelke, Karsten Nebe
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Mixed reality - the close coupling of real world objects with computer generated information and functionality - has high potential for the creation of usable user interfaces. The implementation of practical applications that exploit these benefits requires an exploratory design approach to handle the interaction of application content with newly developed interaction techniques and complex hardware. In this paper we describe how agile methods from software engineering can be integrated with usability engineering and mixed reality development techniques to enable effective design space exploration. The approach was employed in the development of the Augmented Paper Map (APM) project in which conventional paper maps are enhanced with mixed reality functionality. Experiences with the method and future enhancements and modifications of the approach are discussed.
Using service-based content adaptation platform to enhance mobile user experience
Authors: Nor Azhan Nordin, Wong Hui Shin, Khairil Imran Bin Ghauth, Mohd Izzuddin Bin Mohd Tamrin
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

The ability to retrieve device capabilities provides huge potential in enhancing contents to user. In this paper, we propose service-based content adaptation platform (SCAP) that adapts content for display on mobile devices. It serves the objectives to provide adaptive content to user without direct user input; to provide an enhanced user experience by offering value-added content and also to provide flexible and scalable service-based content delivery mechanism. This paper discusses the implementation modules which include service-based device information retrieval and content negotiation. Performance analysis, benchmarking comparison and caching for proposed platform are scheduled for the ongoing works.
Artificial Heart Rejects High Tech? Lessons Learned from Non-pulsatile VAD with Straight Impeller Vanes
Authors: Kun-xi Qian, Ying Ji
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Despite the progresses in pulsatile impeller pump and impeller total heart pump, as well as in application of streamlined impeller vane, the best result is achieved by non-pulsatile impeller assist heart pump with straight vane. This paper recalls some important achievements in R&D of artificial heart in past 25 years and shares the authors's experiences withe the readers.
Generalized semi-infinite programming: A tutorial
Authors: F. Guerra Vázquez, J. -J. Rückmann, O. Stein, G. Still
Venue: Journal of Computational and Applied Mathematics (2008)

This tutorial presents an introduction to generalized semi-infinite programming (GSIP) which in recent years became a vivid field of active research in mathematical programming. A GSIP problem is characterized by an infinite number of inequality constraints, and the corresponding index set depends additionally on the decision variables. There exist a wide range of applications which give rise to GSIP models; some of them are discussed in the present paper. Furthermore, geometric and topological properties of the feasible set and, in particular, the difference to the standard semi-infinite case are analyzed. By using first-order approximations of the feasible set corresponding constraint qualifications are developed. Then, necessary and sufficient first- and second-order optimality conditions are presented where directional differentiability properties of the optimal value function of the so-called lower level problem are used. Finally, an overview of numerical methods is given.
Middleware based user interface migration: implementation and evaluation
Authors: Timo Salminen, Simo Hosio, Jukka Riekki
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

User interface can be seen as one of the greatest challenges in mobile computing. One promising approach to make interaction with mobile devices more efficient and pleasant is utilizing UI devices in the user's environment, such as, public displays. However, it is not clear to what extent the user is able to benefit from using external UI devices. Clearly, it also depends on the user's current task. In this paper, we present a middleware based approach that enables migration of user interface from a mobile phone to a device with better UI capabilities, such as, to a desktop computer. We quantitatively and qualitatively evaluate the benefits of such an UI migration to the user with two use cases that are common to mobile phone users; SMS or e-mail writing and establishing a phone call. The evaluation bears evidence that the method greatly increases the performance, and especially the enjoyability, compared to the mobile device's own interface when typing messages. Users prefer our approach because it provides faster and more convenient way to e.g. write a long SMS message. On the other hand for simple tasks, such as selecting a receiver when establishing a phone call or typing a very simplified message, the UI migration was found to be highly undesirable.
Vulnerability assessment of groundwater resources: A modelling-based approach to the Mancha Occidental aquifer, Spain
Authors: Pedro Martínez-Santos, M. Ramón Llamas, Pedro E. Martínez-Alfaro
Venue: Environmental Modelling Software (2008)

The semiarid Mancha Occidental aquifer represents a paradigmatic case of intensive groundwater use for agriculture. Irrigation has proven a catalyst for welfare in the area over the last three decades, if at a significant environmental cost and while raising concerns as to its mid-term sustainability. This paper describes an interdisciplinary exercise of scenario design and modelling, providing a methodology to couple hard-science numerical modelling approaches with the involvement of key water actors. Given the long-standing conflicts in the area, modelling work largely focuses on carrying out a vulnerability assessment rather than on trying to find solutions. The system's most resilient aspects and its drivers for change are identified, while their potential implications for aquifer sustainability are assessed under the light of the mandatory objectives established by the European Union Water Framework Directive for all Member States. Whereas modelling results imply that such objectives are unlikely to be met, a vulnerability assessment suggests that even adverse scenario pumping patterns could be sustained in the mid- to long-term (two to four decades).
Neurodynamic programming: a case study of the traveling salesman problem
Authors: Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong Liu
Venue: Neural Computing and Applications (2008)

The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal difference learning and approximate Sarsa, are presented in detail. In essence, both of them try to learn an appropriate evaluation function on the basis of a finite amount of experience. To evaluate their performances, some computational experiments on both the Euclidean and asymmetric TSP instances are conducted. In contrast with the large size of the state space, only a few training sets have been used to obtain the initial results. Hence, the results are acceptable and encouraging in comparisons with some classical algorithms, and further study of this kind of methods, as well as applications in combinatorial optimization problems, is worth investigating.
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Authors: Marius Zimand
Venue: Computational Complexity (2008)

There exists a positive constant ¿ < 1 such that for any function T(n) ¿ n ¿ and for any problem L ¿ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2¿¿(T(n) logT(n)) fraction of inputs of length n.The proof uses a novel derandomization technique based on a new type of randomness extractors, called exposure-resilient extractors. An exposure-resilient extractor is an efficient procedure that, from a random variable with imperfect randomness, produces randomness that passes all statistical tests including those that have bounded access to the random variable, with adaptive queries that can depend on the string being tested. More precisely, EXT : {0, 1} n × {0, 1} d ¿ {0, 1} m is a (k, ¿)-exposure-resilient extractor resistant to q queries if, when the minentropy of the random variable x is at least k and the random variable y is uniformly distributed, EXT(x, y) looks ¿-random to all statistical tests modeled by oracle circuits of unbounded size that can query q bits of x. Besides the extractor that is needed for the proof of the main result (whose parameters are tailored for this application), we construct, for any ¿ < 1, a polynomial-time computable (k, ¿)-exposure-resilient extractor with query resistance n ¿, k = n ¿ n ¿(1), ¿ = n ¿¿(1), m = n ¿(1) and d = O(log n).
Distance decay in spectral space in analysing ecosystem β-diversity
Authors: D. Rocchini
Venue: International Journal of Remote Sensing (2007)

The use of spectral distance for explaining the phenomenon of distance decay in species similarity between two sites (based on the niche difference model) is presented here. Distance decay is based on the first law of geography: 'the similarity between two sites decays with increasing the distance between them'. From an ecological point of view, this could be expressed as: 'the β-diversity between two sites should increase with an increase in spatial distance'. Beta-diversity is defined as the amount of turnover in species composition from one site to another; and it plays a key role in biodiversity management and conservation, as it allows the detection of spatial gradients that act functionally in determining the spatial variation in species composition. This work demonstrates how the celebrated distance decay pattern achieved by means of spatial distance can be attained even with spectral distance, measured on Landsat near-infrared images. It is argued that spectral heterogeneity represents a good proxy of β-diversity of an area, becoming a valuable tool in biodiversity characterization at regional and global scales.
Cell Level Co-Operation for SLA Based Radio Resource Management
Authors: Muhammad Bilal Ali, Muhammad Kamran, H. Farooq Ahmad, Hiroki Suguri, Liaqat Ali
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The resource management in 3G systems with multi-nodes environment is a demanding task to provide flexible and higher bandwidth services. To cope multi-nodes environment heterogeneity, there is a need of intelligent RNC (Radio Network Controller) at BS (Base Station), which cooperates to adapt and retrieve information to manage the resources intelligently and reliably in a consistent manner. Knowledge sharing for radio resource management, at cell level is a novel approach presented in this paper. The proposed architecture has induced the global effect through local information sharing to make reliable and consistent decisions. It provides efficient solutions for symmetric scenarios at different locations without replication of knowledge base. Our inference engine adapts the closest information retrieved from the knowledge repository efficiently through distant indexed values technique. Consequently, an Autonomous and Sociable RNC accepts, rejects or buffers a connection request to mange resources to meet QoS requirement as defined in Service Level Agreement (SLA).
Relational distance-based collaborative filtering
Authors: Wei Zhang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we present a novel hybrid recommender system called RelationalCF, which integrate content and demographic information into a collaborative filtering framework by using relational distance computation approaches without the effort of form transformation and feature construction. Our experiments suggest that the effective combination of various kinds of information based on relational distance approaches provides improved accurate recommendations than other approaches.
TCP Flows in Stochastic Network Environment: Models and Characteristics
Authors: Vladimir Zaborovsky, Sergey Ygorov, Nikolay Fedorov
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In the paper we consider Internet properties which can be presented by dynamic ТСР model and stochastic character of observable fluctuations. Proposed approach is based on the analysis of experimental results, modeling, and analytical approximation of distribution function of stochastic intervals between fast recovery TCP phases.
A Channel Management Scheme for Reducing Interference in Ubiquitous Wireless LANs Environment
Authors: Kibaek Yoo, Chong-kwon Kim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

For the successful ubiquitous environment, the channel management scheme for reducing the interference in wireless LANs environment is very important. And as the IEEE 802.11 family becomes popular, performance decline due to interference of network happens to be a brand new issue. In this paper, we introduce a channel management scheme for reducing the interference and maximizing the performance by channel assignment and load balancing. We present a distributed algorithm and the decision making basis for activating channel assignment and load balancing process under the current circumstances, which assumes network is managed by multiple individual manager and collects the channel information with the methods from IEEE 802.11k draft. The proposed scheme reduces the overhead and improves the performance of the network by reducing the number of times of unnecessary channel assignment and load balancing processes. And we test our algorithms with NS simulation and show that the proposed scheme outperforms than the previous schemes.
Hidden Markov model-based ensemble methods for offline handwritten text line recognition
Authors: Roman Bertolami, Horst Bunke
Venue: Pattern Recognition (2008)

This paper investigates various ensemble methods for offline handwritten text line recognition. To obtain ensembles of recognisers, we implement bagging, random feature subspace, and language model variation methods. For the combination, the word sequences returned by the individual ensemble members are first aligned. Then a confidence-based voting strategy determines the final word sequence. A number of confidence measures based on normalised likelihoods and alternative candidates are evaluated. Experiments show that the proposed ensemble methods can improve the recognition accuracy over an optimised single reference recogniser.
Patterns for programming in parallel, pedagogically
Authors: Matthew C. Jadud, Jon Simpson, Christian L. Jacobsen
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Pipeline, Delta, and Black Hole are three simple patterns used in concurrent software design. We recently presented these and other patterns for parallelism at a nine-hour workshop for professional embedded systems developers. By grounding these patterns in the context of robotic control on the LEGO Mindstorms, we provided an engaging and enjoyable educational experience for our "students," and reaffirmed that small, powerful languages have a place in education for beginners and experts alike.
Analysis of Mechanical Parameters for SSP Rolling Process
Authors: Xianzhang Feng, Jinfeng Wang, Faxin Li, Huarui Tang, Cai Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Based no the study of rolling force variation rules of the different deformed areas during side pressing for slab, the finite element model of slab side pressing was established through finite element method(FEM) and the whole process of side pressing was simulated for slab detail, these rules of relation of rolling force and time were yielded. The calculated results indicated that the rolling force of slab head and middle were increasing with the side pressures amount increasing, the maximal rolling force appeared the part of middle slab, which have provided the reference values for the slab side pressing in engineering.
Using topes to validate and reformat data in end-user programming tools
Authors: Christopher Scaffidi, Allen Cypher, Sebastian Elbaum, Andhy Koesnandar, James Lin, Brad Myers, Mary Shaw
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

End-user programming tools offer no data types except "string" for many categories of data, such as person names and street addresses. Consequently, these tools cannot automatically validate or reformat these data. To address this problem, we have developed a user-extensible model for string-like data. Each "tope" in this model is a user-defined abstraction that guides the interpretation of strings as a particular kind of data. Specifically, each tope implementation contains software functions for recognizing and reformatting instances of that tope's kind of data. This makes it possible at runtime to distinguish between invalid data, valid data, and questionable data that could be valid or invalid. Once identified, questionable and/or invalid data can be double-checked and possibly corrected, thereby increasing the overall reliability of the data. Valid data can be automatically reformatted to any of the formats appropriate for that kind of data. To show the general applicability of topes, we describe new features that topes have enabled us to provide in four tools.
Flood decision support system on agent grid: method and implementation
Authors: J. Luo, L. Xu, J. -P. Jamont, L. Zeng, Z. Shi
Venue: Enterprise Information Systems (2007)

In this paper, we introduce the concept and architecture of agent grid. Agent grid is an intelligent platform that enables the independent operating entities (agents) to interact with one another to form dynamic services on the Grid. Under this view, we built an agent grid platform named AGrIP that includes four layers and several useful toolkits. With the platform support, we implemented the flood decision support system which combines the wireless sensor network for data acquisition and software agent technology for legacy system integration. Additionally, we developed a toolkit for programmers to visually develop software agents which makes the development process easier. Besides, the MWAC model proposed is for sensor network to save power which can transit the information for long distance. This system is now applied as a module in the city emergency interact project.