ppxscal/embedding_network huggingface dataset:
Results on learnability and the Vapnik-Chervonenkis dimension
Authors: N. Linial
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The problem of learning a concept from examples in a distribution-free model is considered. The notion of dynamic sampling, wherein the number of examples examined can increase with the complexity of the target concept, is introduced. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis (VC) dimension. An important variation on the problem of learning from examples, called approximating from examples, is also discussed. The problem of computing the VC dimension of a finite concept set defined on a finite domain is considered.
Note: Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs
Authors: Zhendong Shao, David Zhang
Venue: Theoretical Computer Science (2008)

An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)-f(y)|>=2 if d(x,y)=1 and |f(x)-f(y)|>=1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-labeling number @l(G) of G is the smallest number k such that G has an L(2,1)-labeling with max{f(v):v@?V(G)}=k. Griggs and Yeh conjecture that @l(G)@?@D^2 for any simple graph with maximum degree @D>=2. This paper considers the graph formed by the skew product and the converse skew product of two graphs with a new approach on the analysis of adjacency matrices of the graphs as in [W.C. Shiu, Z. Shao, K.K. Poon, D. Zhang, A new approach to the L(2,1)-labeling of some products of graphs, IEEE Trans. Circuits Syst. II: Express Briefs (to appear)] and improves the previous upper bounds significantly.
Derivation of Fault Tolerance Measures of Self-Stabilizing Algorithms by Simulation
Authors: Nils Müllner, Abhishek Dhama, Oliver Theel
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Fault tolerance measures can be used to distinguish between different self-stabilizing solutions to the same problem. However, derivation of these measures via analysis suffers from limitations with respect to scalability of and applicability to a wide class of self-stabilizing distributed algorithms. We describe a simulation framework to derive fault tolerance measures for self-stabilizing algorithms which can deal with the complete class of self-stabilizing algorithms. We show the advantages of the simulation framework in contrast to the analytical approach not only by means of accuracy of results, range of applicable scenarios and performance, but also for investigation of the influence of schedulers on a meta level and the possibility to simulate large scale systems featuring dynamic fault probabilities.
High Resolution Read-Out Circuit for DNA Label-Free Detection System
Authors: Daniela De Venuto, Bruno Riccò
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents novel read-out electronic systems for a fast DNA label-less detection. The capacitive shift due to the hybridization effect is monitored by means of a charge sensitive amplifier and a differential stage. The systems provide an A/D conversion and an evaluation of the capacitive shift amount with a resolution of 11 bit. The read-out solutions demonstrate the ability to identify a 0.01% variation on the capacitive value of the sensor. The investigated techniques are suitable for monolithic systems or for a micro-fabricated array of sensors.
NEURAL NETWORKS AND OPTIMIZATION ALGORITHMS APPLIED FOR CONSTRUCTION OF LOW NOISE TREAD PROFILES
Authors: Matthias Becker, Helena Szczerbicka, Michael Thomas
Venue: Cybernetics and Systems (2007)

In this article we evaluate and compare diverse methodologies for designing low-noise tread profiles. Finding a low noise tread profile under given constraints can be described as a search in search space which is typically of the order of a 50-to 70-dimensional vector space. A complete search for the optimal tread profile is not possible even with today's computers. Thus in this work we compare the feasibility of three classes of algorithms for tread profile construction. First, we discuss approaches of speeding up the generation and analysis of tread profiles. Second we use two algorithms for iterative construction of large tread profiles out of several smaller tread profiles known to be of good quality. One of these algorithms is based on Neural Networks. Third, we evaluate heuristic optimization algorithms such as Genetic Algorithms and Simulated Annealing. Last we compare suitability and efficiency of our approaches.
Towards self-propagate mal-packets in sensor networks
Authors: Qijun Gu, Rizwan Noorani
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Since sensor applications are implemented in embedded computer systems, cyber attacks that compromise regular computer systems via exploiting memory related vulnerabilities present similar threats to sensor networks. However, the paper shows that memory fault attacks in sensors are not just the same as in regular computers due to sensor's hardware and software architecture. In contrast to worm attacks, mal-codes carried by exploiting packets cannot be executed in a sensor. Therefore, the paper proposes a range of attack approaches to illustrate that a mal-packet, which only carries specially crafted data, can exploit memory-related vulnerabilities and utilize existing application codes in a sensor to propagate itself without disrupting sensor's functionality. The paper shows that such a mal-packet can have as few as 17 bytes. A prototype of a 27-byte mal-packet has been implemented and tested in Mica2 sensors. Simulation shows that the propagation pattern of such a malpacket in a sensor network is very different from worm propagation. Malpackets can either quickly take over the whole network or hard to propagate under different traffic situations.
Towards spatial data quality information analysis tools for experts assessing the fitness for use of spatial data
Authors: R. Devillers, Y. Bédard, R. Jeansoulin, B. Moulin
Venue: International Journal of Geographical Information Science (2007)

Geospatial data users increasingly face the need to assess how datasets fit an intended use. However, information describing data quality is typically difficult to access and understand. Therefore, data quality is often neglected by users, leading to risks of misuse. Understanding data quality is a complex task that may involve thousands of partially related metadata. For complex cases where heterogeneous datasets have to be integrated, there is a need for tools supporting data quality analysis. This paper presents the design of such a tool that can manage heterogeneous data quality information and provide functions to support expert users in the assessment of the fitness for use of a given dataset. Combining concepts from GIS and Business Intelligence, this approach provides interactive, multi-granularity and context-sensitive spatial data quality indicators that help experts to build and justify their opinions. A prototype called the Multidimensional User Manual is presented to illustrate this approach.
Resource management aspects for sensor network software
Authors: Sean Walton, Eric Eide
Venue: Proceedings of the 4th workshop on Programming languages and operating systems (2007)

The software that runs on a typical wireless sensor network node must address a variety of constraints that are imposed by its purpose and implementation platform. Examples of such constraints include real-time behavior, highly limited RAM and ROM, and other scarce resources. These constraints lead to crosscutting concerns for the implementations of sensor network software: that is, all parts of the software must be carefully written to respect its resource constraints. Neither traditional languages (such as C) nor component-based languages (such as nesC) for implementing sensor network software allow programmers to deal with crosscutting resource constraints in a modular fashion. In this paper we describe Aspect nesC (ANesC), a language we are now implementing to help programmers modularize the implementations of crosscutting concerns within sensor network software. Aspect nesC extends nesC, a component-based dialect of C, with constructs for aspect-oriented programming. In addition to combining the ideas of components and aspects in a single language, ANesC will provide specific and novel constructs for resource-management concerns. For instance, pointcuts can identify program points at which the run-time stack is about to be exhausted or a real-time deadline has been missed. Corrective actions can be associated with these points via "advice." A primary task of the Aspect nesC compiler is to implement such resource-focused aspects in an efficient manner.
BUSINESS KNOWLEDGE FOR IT IN RETAIL BANKING (Bizle Professional)
Authors: ESSVALE CORPORATION LIMITED
Venue:  (2007)

Knowledge is power; business knowledge is even more so! Business savvy IT professionals to rule the world; it is a given. The future is bright for IT professionals with business knowledge of their chosen industry sector. Ladies and gentlemen in IT, it is our pleasure to introduce "Business Knowledge for IT in Retail Banking" designed to deliver the required business knowledge to discerning IT professionals in the Retail banking industry. The 12 chapters in this book cover the following topics: an overview of the Retail banking; recent trends in Retail banking; the business environment in Retail Banking; major players in the Retail banking industry; the common systems used in Retail banking; and, the future of IT and business in Retail banking.Latest innovations in business and IT in the Retail banking industry discussed in the book include SEPA, The Faster Payment Initiative , Business Process Automation, Islamic Banking, SWIFT for Corporates, Banking in the Virtual World , Customer Analytics and much more. The contributors to this book include: Misys, Blue Prism, Polarlake, Iflex Solutions, Chordiant , Voca, Temenos , Oracle Corporation, APAK Group and Infosys. "Business Knowledge for IT in Retail banking" is an invaluable handbook for professionals working in retail banking and crossovers. It is targeted at IT professionals such as: Project Managers; Application developers; Development Managers; Test Managers; Business Analysts; Data Analysts; Systems Analysts; Test Analysts; Support Analysts; Database Administrators; and HR staff responsible for IT recruitment
Plane geometry and convexity of polynomial stability regions
Authors: Didier Henrion, Michael Sebek
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

The set of controllers stabilizing a linear system is generally non-convex in the parameter space. In the case of two-parameter controller design (e.g. PI control or static output feedback with one input and two outputs), we observe however that quite often for benchmark problem instances, the set of stabilizing controllers seems to be convex. In this note we use elementary techniques from real algebraic geometry (resultants and Bezoutian matrices) to explain this phenomenon. As a byproduct, we derive a convex linear matrix inequality (LMI) formulation of two-parameter fixed-order controller design problem, when possible.
Comparative study of the spectral selection based on image compression methods
Authors: S. Soualmi, A. Boumezzough, A. Alfalou, H. Hamam
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Objectives: To investigate the image compression methods based on spectral selection and to carry out a comparative study. Methods: The technique consists of comparing pixel by pixel the spectra of the images being compressed. To identify the winner among the spectral pixels, we investigated three forms of information, namely the intensity of the pixel in question, its complex gradient and its phase gradient. To separate the images in the output plane, after applying a second Fourier transform, the retained pixel must integrate the carrier specific to the corresponding spectrum. In addition to these forms, we considered three options of selection, namely the selection of the pixel with the most important amount of information, the selection with respect to a fixed probability function and finally the selection based on a matched probability function. This leads to nine methods of compression. These methods were also compared to the method which consists in merely adding the spectra and inserting a carrier specific to each one. Results: the quality of image reconstitution are assessed by two metrics namely diffraction efficiency and root mean square error. We observed that for any form of information on the basis of which the selection is performed, the matched probability function yields a better result. The methods based on the gradients privilege contour information. Conclusions and perspectives: Whatever the retained method is, the number of images to be compressed is very limited. It depends on the bandwidths of the images. In perspective, we plan to integrate the bandwidth in the spectral selection. The binarization of the obtained spectrum will be also the subject of a future work.
Improved quasi-path restoration in mesh networks
Authors: Maulin Patel, R. Chandrasekaran, S. Venkatesan
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Restoration of disrupted traffic is critical in today's high-speed self-healing telecommunication networks. A restoration scheme dynamically discovers alternate paths bypassing the failed component. This paper presents an (online) improved quasi-path restoration (IQPR) scheme. IQPR is derived from the two-commodity max-flow algorithm. The running time complexity of IQPR is O(|V|3). Therefore, IQPR is computationally more efficient and more scalable than path restoration (PR). IQPR is faster (in restoration speed) and less complex than PR, and more economical (in spare capacity requirement) than link restoration (LR). Thus, it provides a good alternative to PR when quick restoration of disrupted traffic is desired. The (offline) spare capacity planning problem deals with the allocation of spare capacity to each link in the network, such that the spare capacity requirement is minimized, while guaranteeing the desired level of restoration in the event of a link failure. The spare capacity allocation problems for LR, original quasi-path restoration (OQPR), IQPR, link-disjoint path restoration (LDPR) and PR are formulated as integer linear programming problems. Numerical results illustrate that the restoration schemes studied can be sorted from the least efficient to the most efficient (in the spare capacity requirement) in the following order: LR, OQPR, IQPR, LDPR and PR. The experimental analysis shows that network topology and demand patterns have a significant impact on the spare capacity savings offered by one scheme over the other. Merits and demerits of these schemes are also discussed.
HGKM: A Group-Based Key Management Scheme for Sensor Networks Using Deployment Knowledge
Authors: Ngo Trong Canh, Young-Koo Lee, Sungyoung Lee
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of the strict constraints in power, processing and storage, designing an efficient key establishment protocol is not a trivial task. Compare with traditional public key cryptography, symmetric key cryptographic with key predistribution mechanism is more suitable for large-scale wireless sensor networks. Most of previous solutions have some issues on performance and security capabilities. In this paper, we propose a novel key predistribution model using pre-deployment knowledge to take advantage in terms of network connectivity, resilience against node compromised, memory requirement and energy for transmission.
Capricorn: an intelligent interface for mobile widgets
Authors: Fredrik Boström, Patrik Floréen, Tianyan Liu, Petteri Nurmi, Tiina-Kaisa Oikarinen, Akos Vetek, Péter Boda
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Widgets are embeddable objects that provide easy and ubiquitous access to dynamic information sources, for example weather, news or TV program information. Widgets are typically rather static - they provide the information regardless of whether the information is relevant to the user's current information needs. In this paper we introduce Capricorn, which is an intelligent interface for mobile widgets. The interface uses various adaptive web techniques for facilitating navigation. For example, we use collaborative filtering to recommend suitable widgets and we dim infrequently used widgets. The demonstration presents the Capricorn interface focusing on the adaptive parts of the interface. The user interface is web-based, and as such platform independent. However, our target environment is mobile phones, and thus the interface has been optimized for mobile phones.
Competitive k-server algorithms
Authors: A. Fiat, Y. Rabani, Y. Ravid
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Deterministic competitive k-server algorithms are given for all k and all metric spaces. This settles the k-server conjecture of M.S. Manasse et al. (1988) up to the competitive ratio. The best previous result for general metric spaces was a three-server randomized competitive algorithm and a nonconstructive proof that a deterministic three-server competitive algorithm exists. The competitive ratio the present authors can prove is exponential in the number of servers. Thus, the question of the minimal competitive ratio for arbitrary metric spaces is still open. The methods set forth here also give competitive algorithms for a natural generalization of the k-server problem, called the k-taxicab problem.
Distributed Exchange of Alerts for the Detection of Coordinated Attacks
Authors: J. Garcia-Alfaro, M. A. Jaeger, G. Mühl, I. Barrera, J. Borrell
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Attacks and intrusions to information systems cause large revenue losses. The prevention of these attacks is not always possible by just considering information from isolated sources of the network. A global view of the whole system is necessary to react against the different actions of such an attack. The design and deployment of a decentralized system targeted at detecting as well as reacting to information system attacks might benefit from the use of the publish/subscribe model. In this paper, we discuss the advantages and convenience in using this communication paradigm for a general decentralized attack prevention framework and overview the design and implementation of our approach by using a combination of two different publish/subscribe middleware products. Furthermore, we present a quantitative evaluation of our approach.
A framework of models for QoS-oriented adaptive deployment of multi-layer communication services in group cooperative activities
Authors: K. Guennoun, K. Drira, N. Van Wambeke, C. Chassot, F. Armando, E. Exposito
Venue: Computer Communications (2008)

This paper presents a framework of architecture-centric models to support the automated and adaptive deployment of communication services for QoS-enabled end-to-end group communication systems. The Transport level (TCP, UDP level) and the above messaging Middleware level are considered as the two communication levels targeted by the QoS-driven adaptation process. Application to crisis management systems (CMS) is considered as a case study from the more general domain to which our results apply: cooperative activity support systems. The adaptation rules rely on graph matching and graph rewriting. The adaptation enactment is based on the dynamic composition of micro-protocols at the Transport level and on the dynamic binding of software components and services at the Middleware level. The deployment model is used as a central feature of service provisioning. The influence of the cooperation and the communication contexts is expressed and maintained consistent by automated graph-based model refinement and transformation.
A relaxation scheme for increasing the parallelism in Jacobi-SVD
Authors: Sanguthevar Rajasekaran, Mingjun Song
Venue: Journal of Parallel and Distributed Computing (2008)

The Singular Value Decomposition (SVD) is a vital problem that finds a place in numerous application domains in science and engineering. As an example, SVDs are used in processing voluminous datasets. Many sequential and parallel algorithms have been proposed to compute SVDs. The best known sequential algorithms take cubic time. This amount of time may not be acceptable especially when the data size is large. Thus parallel algorithms are desirable. In this paper, we present a novel technique for the parallel computation of SVDs. This technique yields impressive speedups. We discuss implementation of our technique on parallel models of computing such as the mesh and the PRAM. We also present an experimental evaluation of our technique.
Ontology-Based Research on Wind Power Plant Information Interaction
Authors: Yong-li Zhu, Xin-ying Wang, Dong-ling Cheng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

At present, wind power industry has developed rapidly in our country, and has also promoted the step of wind power plant information construction. But in this process, it's impossible to set up a uniform wind power plant management information system using conventional technology and method, because the wind power plant's devices span a long time, have many categories and the information model and communication protocol are also diverse in different wind turbines. Thus, this paper imports knowledgesharing-based ontology semantic technology, builds the ontology on the basis of wind power plant information model and describes it using OWL. It achieves the wind power plant information sharing, interaction and procession at the semantic level, and provides a new method to build a uniform wind power plant management information system.
Developing a trust evaluation method between co-workers in virtual project team for enabling resource sharing and collaboration
Authors: Tsung-Yi Chen, Yuh-Min Chen, Hui-Chuan Chu
Venue: Computers in Industry (2008)

An increasing number of companies, especially those with knowledge-intensive R&D programs, have turned to virtual project teams (VPTs) in recent years to generate the greatest competitive advantage from limited labor and resources. Members of a VPT are not limited to an enterprise and usually have various core capabilities. Successful implementation of a VPT depends on collaboration among team members during a project; such collaboration relies on efficient management of distributed resources, safe and timely resource sharing, and reliable trust evaluation mechanisms that facilitate the greatest degree of information sharing and minimize information transfer delays. This study first identifies VPT characteristics and the particular requirements of effective resource management and sharing. A VPT model is then presented. By applying this model, this study presents a trust evaluation method that assists VPT members in determining whether resource holders have made appropriate decisions to share resources with other VPT members. The proposed evaluation method comprises a trust evaluation between two VPT workers and a reliability evaluation of worker. Each resource can have a threshold that is a benchmark for resource sharing. The trust evaluation method for the proposed VPT model enables secure resource sharing across team and enterprise boundaries, facilitates collaboration, and enhances information transparency among team members.