ppxscal/embedding_network huggingface dataset:
Graph based Metrics for Intrusion Response Measures in Computer Networks
Authors: Marko Jahnke, Christian Thul, Peter Martini
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This contribution presents a graph based approach for modelling the effects of both attacks against computer networks and response measures as reactions against the attacks. Certain properties of the model graphs are utilized to quantify different response metrics which are well-kown from the pragmatic view of network security officers. Using these metrics, it is possible to (1) quantify practically relevant properties of a response measure after its application, and (2) estimate these properties for all available response measures prior to their application. The latter case is the basis for the selection of an appropriate reaction to a given attack. Our graph-based model is similar to those used in software reliability analysis and was designed for a scalable granularity in representing properties of the network and its components to be protected. Different examples show the applicability of the model and the resulting metric values.
Adaptive data block scheduling for parallel TCP streams
Authors: T. J. Hacker, B. D. Noble, B. D. Athey
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. When applications use the obvious round robin scheduling algorithm for multiplexing data blocks, differences in transmission rate between individual TCP streams can lead to significant data block reordering. This forces the demultiplexing receiver to buffer out-of-order data blocks, consuming memory and potentially causing the receiving application to stall. This paper describes a new adaptive weighted scheduling approach for multiplexing data blocks over a set of parallel TCP streams. Our new scheduling approach, compared with the scheduling approached used by GridFTP, reduces reordering of data blocks between individual TCP streams, maintains the aggregate throughput gains of parallel TCP, consumes less receiver memory for buffering out-of-order packets, and delivers smoother application goodput. We demonstrate the improved characteristics of our new scheduling approach using data transmission experiments over real and emulated wide-area networks.
Hybrid Modulation for AM Broadcasting
Authors: Chen-hao Qi, Man Feng, Le-nan Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A hybrid modulation scheme for present Amplitude Modulation (AM) broadcasting system is proposed. Based on Double Sideband (DSB) Modulation, another method, Very Minimum Additive waveform Keying (VMAK) is brought forward in the paper so as to more sufficiently utilize the bandwidth of each broadcasting channel. Digital multimedia data can be transferred while broadcasting analog audio signal. Computer simulation demonstrates that good Bit Error Rate (BER) performance of both modulations can be obtained under some conditions.
SubXPCA and a generalized feature partitioning approach to principal component analysis
Authors: Kadappagari Vijaya Kumar, Atul Negi
Venue: Pattern Recognition (2008)

In this paper we propose a general feature partitioning framework to PCA computation and raise issues of cross-sub-pattern correlation, feature ordering dependence, selection of sub-pattern size, overlap of sub-patterns and selection of principal components. These issues are critical to the design and performance of feature partitioning approaches to PCA computation. We show several open issues and present a novel algorithm, SubXPCA which proposes a solution to the cross-sub-pattern correlation issue in the feature partitioning framework. SubXPCA is shown to be a general technique since we derive PCA and SubPCA as special cases of SubXPCA. We show SubXPCA has theoretically better time complexity as compared to PCA. Comprehensive experimentation on UCI repository data and face data sets (ORL, CMU, Yale) confirms the superiority of SubXPCA with better classification accuracy. SubXPCA not only has better time performance but is also superior in its summarization of variance as compared to SubPCA. SubXPCA is shown to be robust in its performance with respect to feature ordering and overlapped sub-patterns.
ASIC: Supervised Multi-class Classification using Adaptive Selection of Information Components
Authors: Zongxing Xie, Thiago Quirino, Mei-Ling Shyu, Shu-Ching Chen
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper, a supervised multi-class classification approach called Adaptive Selection of Information Components (ASIC) is presented. ASIC has the facilities to (i) handle both numerical and nominal features in a data set, (ii) pre-process the training data set to accentuate the spatial differences among the classes in the training data set to reduce further computational load requirements, and (iii) conduct supervised classification with the C-RSPM (Collateral Representative Subspace Projection Modeling) approach. Experimental results on a variety of data sets have shown that the proposed ASIC approach outperforms other well-known supervised classification methods such as C4.5, KNN, SVM, MLP, BN, RF, Logistic, and C-RSPM, with higher classification accuracy, lower training and classification times, and reduced memory storage and processing power requirements.
Performance Evaluation of Large Scale Disaster Information Network
Authors: Yoshitaka Shibata, Kazuo Takahata
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In the case of large scale disaster, such as earthquake, volcanic explosion, sea wave, more robust and flexible nation-wide disaster information network is required not only for governmental supporters but also residents and volunteers than business oriented network to communicate each other even though some parts of the network and information system are destroyed and disconnected. In this paper, we introduce a larger scale distributed disaster information network system based on Movile Adhoc network (MANET) and overlay network. MANET is used for the access network for residents and volunteers around the disaster area and evacuation places. The evacuated residents and volunteers can flexibly communicate with others though MANET using IP based terminals, wireless IP telephones and Mobile PCs. On the other hand, overlay network is applied for national wide government and local government network to provide robust and redundant large scale disaster information network. By combining with both MANET access network and overlay network, more robust and flexible, and large scale disaster information network system can be realized provide even some of network lines and nodes are damaged and destroyed when the disaster happened.
Biclique-Helly Graphs
Authors: Marina Groshaus, Jayme L. Szwarcfiter
Venue: Graphs and Combinatorics (2007)

A graph is biclique-Helly when its family of (maximal) bicliques is a Helly family. We describe characterizations for biclique-Helly graphs, leading to polynomial time recognition algorithms. In addition, we relate biclique-Helly graphs to the classes of clique-Helly, disk-Helly and neighborhood-Helly graphs.
The Oracle Problem for Testing against Quantified Properties
Authors: Patricia D. L. Machado, Wilkerson L. Andrade
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The oracle problem for testing from quantified proper- ties is discussed and illustrated by proposed solutions for first-order logic and computation tree logic (CTL) proper- ties. Unless constraints are placed, it is not always possible to generate feasible test suites from which accurate conclu- sions on their execution results can be reached regarding conformity with the intended property.
Performance of the Vickrey auction for digital goods under various bid distributions
Authors: M. Naldi, G. D'Acquisto
Venue: Performance Evaluation (2008)

The generalized Vickrey auction is analysed as a mechanism for setting prices of digital goods. A selection of models of the bidders' behaviour (embodied by the probability distribution of their bids' values) are employed to derive the optimal auctioneer's choice as to the number of items to sell. The satisfaction levels of both the auctioneer and the bidders are taken into account through the evaluation of the expected revenues, the percentage of winning bidders and their aggregated utilities under each of the probabilistic scenarios considered.
An Analysis Study on Zone-Based Anonymous Communication in Mobile Ad Hoc Networks
Authors: Xiaoxin Wu, Elisa Bertino
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

A zone-based anonymous positioning routing protocol for ad hoc networks, enabling anonymity of both source and destination, is proposed and analyzed. According to the proposed algorithm, a source sends data to an anonymity zone, where the destination node and a number of other nodes are located. The data is then flooded within the anonymity zone so that a tracer is not able to determine the actual destination node. Source anonymity is also enabled because the positioning routing algorithms do not require the source ID nor its position for the correct routing. We develop anonymity protocols for both routeless and route-based data delivery algorithms. To evaluate anonymity, we propose a "measure of anonymity" and we develop an analytical model to evaluate it. By using this model we perform an extensive analysis of the anonymity protocols to determine the parameters that most impact the anonymity level.
Analytic Modeling of Computer Systems
Authors: K. S. Trivedi
Venue: Computer (1978)

Deterministic and probabilistic models capable of representing more and more system parameters are being developed One of their primary ractions is low cost.
A New Mixed-Mode Biometrics Information Fusion Based-on Fingerprint, Hand-geometry and Palm-print
Authors: Fan Yang, Baofeng Ma
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Using multimodal biometric systems that consolidate evidence from multiple biometric sources can remove such as noisy sensor data, no-universality problems. In this paper, fingerprint, palm-print and hand-geometry are combined for person identity verification. Unlike other multimodal biometric systems, three biometrics can be taken from the same image. Wavelet transform to extract the features from fingerprint and palm-print is used and hand-geometry feature (such as width and length) is extracted after the pre-processing phase. We employ feature fusion and mach score fusion together to establish identity. The system was tested on a database of 98 persons. The test performance results indicate the possibility of the combination.
Free-knot spline approximation of stochastic processes
Authors: Jakob Creutzig, Thomas Müller-Gronbach, Klaus Ritter
Venue: Journal of Complexity (2007)

We study optimal approximation of stochastic processes by polynomial splines with free knots. The number of free knots is either a priori fixed or may depend on the particular trajectory. For the s-fold integrated Wiener process as well as for scalar diffusion processes we determine the asymptotic behavior of the average L"p-distance to the splines spaces, as the (expected) number of free knots tends to infinity.
An adaptive attitude bidding strategy for agents in continuous double auctions
Authors: Huiye Ma, Ho-Fung Leung
Venue: Electronic Commerce Research and Applications (2007)

A continuous double auction (CDA) is an efficient market institution for real-world trading of commodities and electronic marketplaces. In this paper, we present the design and analysis of a new bidding strategy for buyer and seller agents participating in agent-based CDAs. The strategy employs heuristic rules and a reasoning mechanism based on a two-level adaptive bid-determination method, including short-term and long-term attitudes. Agents adopting the strategy dynamically adjust their behaviors in response to the changes of the supply and demand relationships in the market. Experimental results show that agents adopting the strategy outperform agents using other strategies reported in the literature.
The Viability of Multimicroprocessor Systems
Authors: B. R. Borgerson
Venue: Computer (1976)

The advances made in integrated circuit technology to date have been dramatically greater than the uses which have been made of this technology. Initially, the only use of LSI was for the construction of various types of memories. This is an obvious first choice since memories offer both an orderly repetitive pattern, making implementation easy, and a high gate-to-pin ratio, making very large numbers of gates possible on a single chip. The success achieved with memories has caused the processor part of a computer's hardware cost to become increasingly more expensive relative to the memory. As long as the processors are constructed from SSI/MSI units, they will continue to become relatively more expensive as the state of the integrated circuit technology continues to advance. So, a major challenge facing computer designers is to create techniques for utilizing the considerable capability available in LSI technology in the construction of the processing portion of computing systems.
Multimedia platform to support knowledge processes anytime and anywhere
Authors: Maurizio Mesenzani, Thomas Schael, Sara Albolino
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

The paper contains a presentation of the work done in two ESPRIT Projects in the knowledge management area: Klee&Co (Knowledge and Learning Environments for European & Creative Organisations, started in 1998 and ended in 2000) and MILK (Multimedia Interaction for Learning and Knowing, started in early 2002 and expected to be closed by 2004). Klee&Co developed an approach and a web-based prototype allowing users to view knowledge in its context: the main feature of the Klee&Co system is the "view with context". MILK is going to develop a system supporting users in any working situation, even mobile and social situations. It means a strong effort in interface and system design in order to create different technological platforms for PC environment, social environment, mobile environment. To get the expected results, it is important to start from the observation of users' needs and from the definition of a clear knowledge management strategy. The main outputs from the first stage of the MILK project will be presented and discussed to show the relevance of the integration between users, technology developers and designers visions for a successful knowledge management solution.
Preservation of epistemic properties in security protocol implementations
Authors: Ron van der Meyden, Thomas Wilke
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security protocols. Our main theorem says that when a property expressed in our logic holds for an ideal protocol (where "ideal" means that the private channel hides everything), then it also holds when the private channel is implemented using an encryption scheme that guarantees perfect secrecy (in the sense of Shannon). Our class of protocols contains, for instance, an oblivious transfer protocol by Rivest and Chaum's solution to the dining cryptographers problem. In our logic we can express fundamental security properties of these protocols. The proof of the main theorem is based on a notion of refinement for probabilistic Kripke structures.
Introduction: Computer Arithmetic
Authors: D. P. Agrawal, T. R. N. Rao
Venue: IEEE Transactions on Computers (1983)

SINCE the inception of electronic computers, much effort has been directed towards the search of faster arithmetic techniques. For all scientific computations, the arithmetic units have always been considered as the heart of a digital computer. In the earlier approaches, emphasis on the arithmetic elements was limited to integer arithmetic with limited precision, as the cost of discrete components was the main driving factor. Circuit optimization with reduced components and techniques for high-speed arithmetic were crucial at that time. Later, software techniques were employed to include floating-point representation and to achieve desirable precision. The advances in LSI technology and the inception of microcomputers caused a-great deal of impact on the ways people used to think. Emphasis on circuit component reduction was shifted to iterative logic and minimization of chip types. This led to various uniformly structured and specialized units like cellular arrays, etc. Now, several high-speed multipliers and FFT processors are commercially available. The on-line processing requirement also enhanced acceptance of techniques like overlapping and pipelining. The error analysis has always been a lively topic of interest and so also the variable word-lengths. Parallel processing requirements led to the introduction of bit-slice ALU's. The current trend is to use high-speed arithmetic for various transforms and signal processing applications. This was clearly reflected from the papers submitted for the special issue.
Hidden problems of asynchronous proactive recovery
Authors: Paulo Sousa, Nuno Ferreira Neves, Paulo Verissimo
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

A node-exhaustion-safe intrusion-tolerant distributed system is a system that assuredly does not suffer more than the assumed number of node failures. In a recent work, we showed that it is not possible to build any type of node-exhaustion-safe distributed f intrusion-tolerant system under the asynchronous model. Some years ago, an intuition about this problem motivated the research around proactive recovery, which made possible the appearance of asynchronous systems that allegedly can tolerate any number of faults over the lifetime of the system. In this paper, each of these works is analyzed in detail and is explained why they fail to achieve their goal. Afterwards, we summarize the four problems that may affect systems employing proactive recovery.
Efficient virtual-backbone routing in mobile ad hoc networks
Authors: Jamal N. Al-Karaki, Ahmed E. Kamal
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Since the physical topology of mobile ad hoc networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone. A virtual backbone can play important roles related to routing and connectivity management. In this paper, the problem of providing such a virtual backbone with low overhead is investigated. In particular, we propose an approach, called virtual grid architecture (VGA), that can be applied to both homogeneous and heterogeneous MANETs. We study the performance tradeoffs between the VGA clustering approach and an optimal clustering based on an integer linear program (ILP) formulation. Many properties of the VGA clustering approach, e.g., VGA size, route length over VGA, and clustering overhead are also studied and quantified. Analytical as well as simulation results show that average route length over VGA and VGA cardinality tend to be close to optimal. The results also show that the overhead of creating and maintaining VGA is greatly reduced, and thus the routing performance is improved significantly. To illustrate, two hierarchical routing techniques that operate on top of VGA are presented and evaluated. Performance evaluation shows that VGA clustering approach, albeit simple, is able to provide more stable (long lifetime) routes, deliver more packets, and accept more calls.
A better estimate to the contribution rate of education on economic growth in China from 1999 to 2003
Authors: Kejun Zhu, Haixiang Guo, Fengqin Diao, Sixin Xu
Venue: Expert Systems with Applications: An International Journal (2008)

The traditional methods of estimating economic contribution rate of education (ECRE) are based on hard computing such as statistical methods, which ignore both the long-term effect of education and the lagged effect of education on economy growth. This paper proposes the fusion method of neural networks, fuzzy systems and genetic algorithms made in the realm of soft computing to estimate the ECRE. Firstly, a target system (a country or a region) is categorized softly according to the level of Science and Technology (S&T) progress. Secondly, potential human capital stock and actual human capital stock in the same cluster are calculated and set up the internal correlation between them (fuzzy mapping). Thirdly, we conceptualize actual human capital as one production factor, joined with the other two production factors, land and fixed asset, to set up the fuzzy mapping to economic growth. Finally, we obtain the ECRE through two marginal rates, namely marginal economic growth to actual human capital stock, and marginal actual human capital to potential human capital. This method greatly reduces the bias in the ECRE that results from the indirect and lagged effects of education. It therefore identifies the effect of education on economic growth more explicitly. Based on the level of S&T progress, 31 provinces in China could be classified into three clusters. The first cluster (developed S&T) has an ECRE of 11.60%, and contains two provinces; the second cluster (developing S&T) has an ECRE of 8.82%, and contains 11 provinces; the third cluster (underdeveloped S&T) has an ECRE of 1.49% and contains 18 provinces.
Context-Driven Constraint Multiset Grammars with Incremental Parsing for On-line Structured Document Interpretation
Authors: Sebastian Mace
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper deals with the incremental interpretation of on-line structured documents. We introduce Context- Driven Constraint Multiset Grammars (CDCMG) to model the analysis of strokes drawn in the context of document composition; they allow visual arrangement, constraint and stroke recognition system handling by coupling a global vision of the document with a local vision of the analyzed elements. The associated incremental parser interprets the hand-drawn strokes and allows immediate feedback to the user. Moreover, we extend CDCMG by exploiting fuzzy logic to take into account the imprecision of handwriting and explain the impact on ambiguity management. Thanks to this approach, pen-based interfaces have been designed; we present and evaluate more specifically a software for electric diagram drawing, both in terms of comparison with more usual button-based interfaces and recognition rates.
A Summary of Soviet Activities in the Design of Fault-Tolerant Digital Machines
Authors: R. A. Short
Venue: Computer (1971)

This paper is a summary of the principal conclusions that can be made from a rather extensive survey of the open Soviet literature in the technical areas relevant to the design of reliable digital computers. Particular emphasis in the survey was on the various techniques for the constructive application of redundancy in order to achieve the reliability necessary for the successful realization of machines of high computational power and high availability. In this summary overall conclusions are presented regarding the nature and significance of Soviet activities in these fields.1