ppxscal/embedding_network huggingface dataset:
CprFS: a user-level file system to support consistent file states for checkpoint and restart
Authors: Ruini Xue, Wenguang Chen, Weimin Zheng
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Checkpoint and Restart (CPR) is becoming critical to large scale parallel computers, whose Mean Time Between Failures (MTBF) may be much shorter than the execution times of the applications. The CPR mechanism should be able to store and recover the states of virtual memory, communication and files for the applications in a consistent way. However, many CPR tools ignore file states, which may cause errors for applications with file operations on recovery. Some CPR tools adopt library-based approaches or kernel-level file systems to deal with file states, but they only support limited types of file operations which are not sufficient for some applications. Moreover, many library-based approaches are not transparent to user applications because they wrap file APIs. Kernel-level file systems are difficult to deploy in production systems due to unnecessary overhead they may introduce to applications that do not need CPR. In this paper we propose a user-level file system, CprFS, to address these problems. As a file system, CprFS can guarantee transparency to user applications, and is convenient to support arbitrary file operations. It can be deployed on applications' demand to avoid intervention with other applications. Experimental results on micro-benchmarks and real-world applications show that CprFS introduces acceptable overhead and has little impact on checkpointing systems.
Matchings of cycles and paths in directed graphs
Authors: Gyula Pap, L&#x00e1;szl&#x00f3; Szeg&#x0151;
Venue: Combinatorica (2007)

In this paper we present a Berge-Tutte-type theorem for a matching problem in directed graphs. This extends the maximum matching problem in undirected graphs, the maximum even factor problem in weakly symmetric directed graphs proposed by W. H. Cunningham and J. F. Geelen in [6], and a packing problem for cycles and edges in undirected graphs. We show an Edmonds-Gallai-type structural description of a canonical set attaining the minimum in the formula. We also give a generalization of the matching matroid to this concept.
TCP/IP Networking Interview Questions, Answers, and Explanations: TCP/IP Network Certification Review
Authors: Terry,  Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Learning Guide for the Internet Professional! In depth and current overview of common challenges with TCP/IP! Fluency with the internet protocol suite and communications protocols is essential for the networking professional, however, a user-friendly and thorough resource can be difficult to locate. From helping you to assess your current skill level to preparing for an interview, this guide will tell you the details of what you really need to know. Set yourself apart from other candidates and show that you have what it takes to land the job. More than just a rehash of the basics, more than just documentation and sales presentations, each section is based on project knowledge and experience! Key topics include: . Transmission Control Protocol and Internet Protocol layers and functions . OSI model and TCP/IP differences and similarities . The DoD model for the IP suite . The application layer for network communication: encapsulation and transport . Security and data management
An Activity-Oriented Design Framework for Mobile Learning Experience
Authors: Huanglingzi Liu, Ronghuai Huang, Jyri Salomaa, Ding Ma
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This paper proposes a conceptual design framework for mobile learning (mLearning) mainly based on the reflection and action research results of Nokia Mobiledu project, which was recently launched in China and is targeted especially for learning English. The framework involves five stages: mLearning activity design, requirement and constraint analysis, mLearning scenario design, mLearning technology environment design and mobile learner support services design, in which mLearning activity design plays a key role in a systematic design procedure for mLearning experience.
On the crossing number of cm &times; cn
Authors: Gelasio Salazar
Venue: Journal of Graph Theory (1998)

We show that the M-crossing number crM(Cm &times; Cn) of Cm &times; Cn behaves asymptotically according to limn&rarr;&infin; {crM(Cm &times; Cn)-((m - 2)n)} = 1, for each m &ge; 3. This result reinforces the conjecture cr(Cm &times; Cn) = (m - 2)n if 3 &le; m d n, which has been proved only for m &le; 6. &copy; 1998 John Wiley Sons, Inc. J. Graph Theory 28: 163170, 1998
A Hybrid Framework for ECG Interpretation by Computer and its Evaluation Platform
Authors: Jianwei Dong, Shi Zhang, Yapeng Wan
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this article, firstly we present a new approach for detecting QRS complex which integrates the multi-scale idea of watershed into differentiation and template matching technologies. In order to make this algorithm accurate and robust, simultaneous multi-channel detection and fusion techniques are also adopted. Then, several features such as RR intervals and QRS durations of a certain ECG segment are extracted. Finally, we developed a branch-logic tree to automatically give interpretive statements for this ECG segment. The test data includes digitized paper-based clinical conventional ECG segments, MIT-BIH Arrhythmia Database, ECG from a Multiparameter Patient Simulator and some real data measured by our own Portable Intelligent ECG Monitor (PIEM) from several patients. The experiment results show that this novel method is efficient, robust and accurate in cardiopathy diagnoses.
Strategies for mainstream usage of formal verification
Authors: Raj S. Mitra
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Formal verification technology has advanced significantly in recent years, yet it seems to have no noticeable acceptance as a mainstream verification methodology within the industry. This paper discusses the issues involved with deploying formal verification on a production mode, and the strategies that may need to be adopted to make this deployment successful. It analyses the real benefits and risks of using formal verification in the overall verification process, and how to integrate this new technology with traditional technologies like simulation. The lessons described in this paper have been learnt from several years of experience with using commercial formal verification tools in industrial projects.
Secure roaming with identity metasystems
Authors: Long Nguyen Hoang, Pekka Laitinen, N. Asokan
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

The notion of identity metasystem has been introduced as the means to ensure inter-operability among different identity systems while providing a consistent user experience. Current identity metasystems provide limited support for secure roaming: by "roaming" we refer to the ability of a user to use the same set of identities and credentials across different terminals. We argue that in order to support different types of roaming, the identity metasystem client should be structured as a set of distributable components. We describe such distributed client-side software architecture and how that architecture is implemented by adapting Novell's Bandit project. We use our implementation to demonstrate how credentials are stored in a trusted device in the form of a mobile phone but can be used on less trusted terminals in the form of PCs.
Drawing planar graphs using the lmc-ordering
Authors: G. Kant
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The author introduces a method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. With this method linear time and space algorithms can be designed for many graph drawing problems. He shows that every triconnected planar graph G can be drawn convexly with straight lines on an (2n-4)*(n-2) grid. If G has maximum degree four (three), then G can be drawn orthogonal with at most (/sup 3n///sub 2/)+3 (at most (/sup n///sub 2/)+1) bends on an n*n grid ((/sup n///sub 2/)*(/sup n///sub 2/) grid, respectively). If G has maximum degree d, then G can be drawn planar on an (2n-6)*(3n-6) grid with minimum angle larger than /sup 1///sub d-2/ radians and at most 5n-15 bends. These results give in some cases considerable improvements over previous results, and give new bounds in other cases. Several other results, e.g. concerning visibility representations, are included.
A two-stage approach for improving the convergence of least-mean-square adaptive decision-feedback equalizers in the presence of severe narrowband interference
Authors: Arun Batra, James R. Zeidler, A. A. Beex
Venue: EURASIP Journal on Advances in Signal Processing (2008)

It has previously been shown that a least-mean-square (LMS) decision-feedback filter can mitigate the effect of narrowband interference (L.-M. Li and L. Milstein, 1983). An adaptive implementation of the filter was shown to converge relatively quickly for mild interference. It is shown here, however, that in the case of severe narrowband interference, the LMS decision-feedback equalizer (DFE) requires a very large number of training symbols for convergence, making it unsuitable for some types of communication systems. This paper investigates the introduction of an LMS prediction-error filter (PEF) as a prefilter to the equalizer and demonstrates that it reduces the convergence time of the two-stage system by asmuch as two orders of magnitude. It is also shown that the steady-state bit-error rate (BER) performance of the proposed system is still approximately equal to that attained in steady-state by the LMS DFE-only. Finally, it is shown that the two-stage system can be implemented without the use of training symbols. This two-stage structure lowers the complexity of the overall systemby reducing the number of filter taps that need to be adapted, while incurring a slight loss in the steady-state BER.
A Scalable Proof Methodology for RISC Processor Designs: A Functional Approach
Authors: Salah Merniz, Mohamed Benmohammed
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Most proof approaches verified a Pipelined Micro-Architectural implementation against an ISA specification, and consequently, it was impossible to find a meaningful point where the implementation state and the specification state can be compared easily. An alternative solution to such problem is to verify a PMA implementation against a sequential multi-cycle implementation. Because both models are formalised in terms of clock cycles, all synchronous intermediate states represent interesting points where the comparison could be achieved easily. Furthermore, by decomposing the state, the overall proof decomposes systematically into a set of verification conditions more simple to reason about and to verify. A major advantage of this elegant choice is the ability to carry out the proof by induction within the same specification language rather than by symbolic simulation through a proof tool which remains very tedious. Also, because both models relate to the MA level, there is no need for a data abstraction function (which remains very difficult to define for most approaches), only a time abstraction function is needed to map between the times used by the two models. The potential features of the proposed proof methodology are demonstrated over the pipelined MIPS RISC processor within Haskell framework
An Augmenting Path Algorithm For The Parity Problem On Linear Matroids
Authors: M. Stallmann
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

The matroid parity problem is a generalization of matroid intersection and general graph matching (and hence network flow, degree-constrained subgraphs, etc.). A polynomial algorithm for linear matroids was presented by Lovasz. This paper presents an algorithm that uses time 0(mn/sup 3/), where m is the number of elements and n is the rank; for the spanning tree parity problem the time 0(mn/sup 2/). The algorithm is based on the method of augmenting paths used in the algorithms for all subcases of the problem.
A Bayesian Approach for on-Line Max Auditing
Authors: Gerardo Canfora, Bice Cavallo
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper we consider the on-line max query auditing problem: given a private association between fields in a data set, a sequence of max queries that have already been posed about the data, their corresponding answers and a new query, deny the answer if a private information is inferred or give the true answer otherwise. We give a probabilistic definition of privacy and demonstrate that max queries can be audited in a simulatable paradigm by means of a Bayesian network. Moreover, we show how our auditing approach is able to manage user prior-knowledge.
A Comparative Study to Extract the Diaphragmatic Electromyogram Signal
Authors: Yaosheng Lu, Ying Xian, Jiongfeng Chen, Zeguang Zheng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Extracting the diaphragmatic electromyogram (EMG) signal is the key to manufacture the breathing machine in synchrony with patient. However, the diaphragmatic EMG signal is immerged in the electrocardiogram (ECG) signal. The mixed signals composed of EMG signal and ECG signal are obtained from the platform of EMG signal acquisition. Hence, extracting the diaphragmatic EMG signal perfectly is a difficult work. This paper employs three filters which are matched filter, adaptive filter, and mathematical morphology filter to extract the EMG signal respectively. Furthermore, we compare and analyze the performances of them in extracting the EMG signal and then discuss the advantages and disadvantages, which is convenient for us to choose the best one in application.
Bouligand Derivatives and Robustness of Support Vector Machines for Regression
Authors: Andreas Christmann, Arnout Van Messem
Venue: The Journal of Machine Learning Research (2008)

We investigate robustness properties for a broad class of support vector machines with non-smooth loss functions. These kernel methods are inspired by convex risk minimization in infinite dimensional Hilbert spaces. Leading examples are the support vector machine based on the <u>ε</u>-insensitive loss function, and kernel based quantile regression based on the pinball loss function. Firstly, we propose with the Bouligand influence function (BIF) a modification of F.R. Hampel's influence function. The BIF has the advantage of being positive homogeneous which is in general not true for Hampel's influence function. Secondly, we show that many support vector machines based on a Lipschitz continuous loss function and a bounded kernel have a bounded BIF and are thus robust in the sense of robust statistics based on influence functions.
Numerical Methods for Evolutionary Differential Equations
Authors: Uri M. Ascher
Venue:  (2008)

Methods for the numerical simulation of dynamic mathematical models have been the focus of intensive research for well over 60 years, and the demand for better and more efficient methods has grown as the range of applications has increased. Mathematical models involving evolutionary partial differential equations (PDEs) as well as ordinary differential equations (ODEs) arise in diverse applications such as uid ow, image processing and computer vision, physics-based animation, mechanical systems, relativity, earth sciences, and mathematical nance. This textbook develops, analyzes, and applies numerical methods for evolutionary, or time-dependent, differential problems. Both PDEs and ODEs are discussed from a unified viewpoint. The author emphasizes finite difference and finite volume methods, specifically their principled derivation, stability, accuracy, efficient implementation, and practical performance in various fields of science and engineering. Smooth and nonsmooth solutions for hyperbolic PDEs, parabolic-type PDEs, and initial value ODEs are treated, and a practical introduction to geometric integration methods is included as well. The author bridges theory and practice by developing algorithms, concepts, and analysis from basic principles while discussing efficiency and performance issues and demonstrating methods through examples and case studies from numerous application areas. Audience: This textbook is suitable for researchers and graduate students from a variety of fields including computer science, applied mathematics, physics, earth and ocean sciences, and various engineering disciplines. Gradute students at the beginning or advanced level (depending on the discipline) and researchers in a variety of fields in science and engineering will find this book useful. Researchers who simulate processes that are modeled by evolutionary differential equations will find material on the principles underlying the appropriate method to use and the pitfalls that accompany each method. Contents: Preface; 1 Introduction; 2 Methods and Concepts for ODEs; 3 Finite Difference and Finite Volume Methods; 4 Stability for Constant Coefficient Problems; 5 Variable Coefficient and Nonlinear Problems; 6 Hamiltonian Systems and Long Time Integration; 7 Dispersion and Dissipation; 8 More on Handling Boundary Conditions; 9 Several Space Variables and Splitting Methods; 10 Discontinuities and Almost Discontinuities; 11 Additional Topics; Bibliography; Index.
Approximation properties of bivariate generalization of Bleimann, Butzer and Hahn operators based on the q-integers
Authors: Sibel Ersan
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In this presentation, bivariate case of BBH operators based on the q- integers is constructed. Then Korovkin type approximation properties of this generalization are obtained with the help of Volkov's Theorem. Lastly, we obtain rates of convergence of these operators by means of bivariate modulus of continuity and Lipschitz type maximal functions.
Using Domain Specific Question Answering Technique for Automatic Railways Inquiry on Mobile Phone
Authors: Avinash J. Agrawal
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Today in the world of mobile revolution it is very important to provide information access at anywhere anytime. Accessing information using internet on mobile phones is limited in use due to many restrictions of small devices. Short message service which is easier, faster, reliable and available in all networks can be combined with a powerful method of artificial intelligence: Question Answering to facilitate information access on mobile phone. This paper discusses issues in development of an application which access information from remote sources on mobile using SMS. It also presents a model design for domain specific Question Answering on Mobile which access information from sample database for automatic railway inquiry
Dimple-flexure contact stiffness effect on operational hard disk drive shock tolerance
Authors: Mengjun Liu, Fook Fah Yap, Hendri Harmoko
Venue: Microsystem Technologies (2008)

A coupled model for simulating the shock response of operational hard disk drives (HDD) is developed. In this model, flexible multi-body dynamics formulation is used to simulate the structure dynamics of the operating HDD while the finite volume method is used to simulate the air bearing dynamics simultaneously. Nonlinearities and discontinuities between the dimple and flexure are considered. Effect of the contact stiffness between the dimple and the flexure on HDD&#x2019;s shock tolerance is investigated. Results show that the contact stiffness is of critical importance to the shock tolerance of the HDD.
Risk assessment modelling of microbiology-related solids separation problems in activated sludge systems
Authors: J. Comas, I. Rodríguez-Roda, K. V. Gernaey, C. Rosen, U. Jeppsson, M. Poch
Venue: Environmental Modelling Software (2008)

This paper proposes a risk assessment model for settling problems of microbiological origin in activated sludge systems (filamentous bulking, foaming and rising sludge). The aim of the model is not to diagnose microbiology-related solids separation problems with absolute certainty but to quantify in dynamic scenarios whether simulated operational procedures and control strategies lead to favourable conditions for them to arise or not. The rationale behind the model (which integrates the mechanisms of standard activated sludge models with empirical knowledge), its implementation in a fuzzy rule-based system and the details of its operation are illustrated in the different sections of the paper. The performance of the risk assessment model is illustrated by evaluating a number of control strategies facing different short-term influent conditions as well as long-term variability using the IWA/COST simulation benchmark. The results demonstrate that some control strategies, although performing better regarding operating costs and effluent quality, induce a higher risk for solids separation problems. In view of these results, it is suggested to integrate empirical knowledge into mechanistic models to increase reliability and to allow assessment of potential side-effects when simulating complex processes.
Monitoring multi-tier clustered systems with invariant metric relationships
Authors: Mohammad Ahmad Munawar, Michael Jiang, Paul A. S. Ward
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

To ensure high availability, self-managing systems require self-monitoring and a system model against which to analyze monitoring data. Characterizing relationships between system metrics has been shown to model simple multi-tier transaction systems effectively, enabling failure detection and fault diagnosis. In this paper we show how to extend this invariant metric-relationships approach to clustered multi-tier systems. We show through analysis and experimentation that naive application of the approach increases cost dramatically while reducing diagnosis accuracy. We demonstrate that randomization at the load balancer during the invariant-identification phase will improve diagnosis accuracy, though it neither completely eliminates the problem nor reduces the cost; indeed, it may increase the cost, as this approach will require a long learning phase to remove all accidental correlations. Finally, we argue that knowing the system structure is necessary to effectively apply invariants to the clustered environment.
Reconfigurable Intelligent Agents
Authors: Michal Radecký, Petr Gajdo
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The development process of Multi-Agent Systems has similar features to standard information systems. However, there are special requests that have to be taken into account, e.g. general MAS architecture, internal architecture of particular agents, their autonomy and communication. This paper describes a new development tool (AgentStudio) that covers main phases of agent development and simulation. Our approaches support the creation of intelligent agents and reconfiguration of their behaviours.