ppxscal/embedding_network huggingface dataset:
Defending against malicious rogue system threats
Authors: Aaron Striegel
Venue:  (2006)

With the expanse of the Internet and the increased reliance on computer networking technology for everyday business, the need to protect electronic data and communication from malicious attack has become increasingly critical. This dissertation addresses the rogue system problem, a significant threat in modern networks. A rogue system is a device installed within a network without the authorization or knowledge of network administrators, which is typically engaged in unauthorized activities. These systems pose a major threat to network data and resources, potentially resulting in the exposure of sensitive information or network performance degradation. This dissertation presents analysis and solutions for rogue system threats within a cooperative distributed network environment and within various types of wireless environments. In addition, a tool is presented which enables high speed network packet logging, for the purpose of rogue system detection, using inexpensive equipment in a scalable distributed storage infrastructure. The major contributions of this dissertation are as follows. The development of a secure communication protocol which protects a distributed network from potential rogue system attacks while enabling the implementation of bandwidth conservation techniques for efficiency. An important enhancement of a standard wireless communication protocol for the purpose of preventing both insider and outsider rogue eavesdropping attacks. A novel packet payload slicing technique for the purpose of detecting rogue wireless access points within a corporate network environment. An analysis of the potential of host-based rogue wireless man-in-the-middle attack detection. The development of a tool for high speed traffic analysis to aid in rogue system detection. Rogue system threats will continue to grow as networks become more complex and new attack techniques evolve to better evade detection. The future direction of this work includes applying these techniques to newly identified threats for the purpose of gauging the effectiveness of the proposed methods and to aid in discovering new means of defending against rogue system attacks. In addition, rogue threats in less traditional types of network environments, such as peer-to-peer and personal area networks, will be addressed in order to provide protection from all means of electronic rogue system attacks.
Efficient Receipt-Free Electronic Auction Protocol
Authors: Zheng Huang, Weidong Qiu, Haibin Guan, Kefei Chen
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Receipt-Freeness is a key feature of modern electronic auction protocol, which means that there is no information known to the coercer/buyer that could be used for the bidder to prove his bidding price. This paper proposes an efficient sealed-bid auction scheme with Receipt-Free property. Using binary searching algorithm carefully, the proposed scheme is free from the bid-rigging by the coercer/buyer. Compared with the existing Receipt-free Sealed-bid auction scheme in the literature, our scheme is more efficient when the bidding price range is very large.
A Model Checking Language for Concurrent Value-Passing Systems
Authors: Radu Mateescu, Damien Thivolle
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

Modal μ-calculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and error-prone. In this paper, we propose Mcl (Model Checking Language), an enhancement of modal μ-calculus with high-level operators aimed at improving expressiveness and conciseness of formulas. The main Mcl ingredients are parameterized fixed points, action patterns extracting data values from Lts actions, modalities on transition sequences described using extended regular expressions and programming language constructs, and an infinite looping operator specifying fairness. We also present a method for on-the-fly model checking of Mcl formulas on finite Ltss, based on the local resolution of boolean equation systems, which has a linear-time complexity for alternation-free and fairness formulas. Mcl is supported by the Evaluator 4.0 model checker developed within the Cadp verification toolbox.
Bits Security of the Elliptic Curve Diffie---Hellman Secret Keys
Authors: Dimitar Jetchev, Ramarathnam Venkatesan
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We show that the least significant bits (LSB) of the elliptic curve Diffie---Hellman secret keys are hardcore. More precisely, we prove that if one can efficiently predict the LSB with non-negligible advantage on a polynomial fraction of all the curves defined over a given finite field $\mathbb{F}_p$, then with polynomial factor overhead, one can compute the entire Diffie---Hellman secret on a polynomial fraction of all the curves over the same finite field. Our approach is based on random self-reducibility (assuming GRH) of the Diffie---Hellman problem among elliptic curves of the same order. As a part of the argument, we prove a refinement of H. W. Lenstra's lower bounds on the sizes of the isogeny classes of elliptic curves, which may be of independent interest.
A heuristic for solving the grade of services steiner minimum tree problem
Authors: Hossein Hosseini
Venue:  (2007)

The goal of this research is to devise a heuristic to solve the Grade of Services Steiner Minimum Tree (GOSST) problem. This problem seeks a network with a minimum construction cost that nterconnects all terminal points with additional non-terminal points. The problem can be applied to the design of communication networks offering graduated services. Because the GOSST problem is known to be NP-Complete, a reasonable heuristic is necessary for its practical application, despite some inherent limitations. Most research on GOSST has concentrated on geometric analyses and proposed approximation algorithms. However, since all published solutions for optimization problems require enormous computational power and memory space, they remain impractical. In this research, a feasible heuristic for the GOSST problem is proposed, implemented and analyzed. The proposed heuristic is built by integrating eight GOSST methods. Each method has its own individual merits in terms of certain user requests. Therefore, the proposed heuristic can save network construction costs, while satisfying other user requests such as determining the shortest total network length and the maximum total network capacity. The proposed heuristic reduces the network construction cost by 36.7% compared to the grade of service MST (G-MST), which is used as the experimental control. The proposed heuristic promises to provide a more economic network construction design while satisfying the goal of the GOSST problem and user requests. Additionally, a multiple security grade network system is presented as an example of an application of the proposed GOSST heuristic.
Efficient Two-Party Secure Computation on Committed Inputs
Authors: Stanisław Jarecki, Vitaly Shmatikov
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We present an efficient construction of Yao's "garbled circuits" protocol for securely computing any two-party circuit on committed inputs. The protocol is secure in a universally composable way in the presence of malicious adversaries under the decisional composite residuosity (DCR) and strong RSA assumptions, in the common reference string model. The protocol requires a constant number of rounds (four-five in the standard model, two-three in the random oracle model, depending on whether both parties receive the output), O(|C|) modular exponentiations per player, and a bandwidth of O(|C|) group elements, where |C| is the size of the computed circuit.Our technical tools are of independent interest. We propose a homomorphic, semantically secure variant of the Camenisch-Shoup verifiable cryptosystem, which uses shorter keys, is unambiguous (it is infeasible to generate two keys which successfully decrypt the same ciphertext), and allows efficient proofs that a committed plaintext is encrypted under a committed key.Our second tool is a practical four-round (two-round in ROM) protocol for committed oblivious transfer on strings (string-COT) secure against malicious participants. The string-COT protocol takes a few exponentiations per player, and is UC-secure under the DCR assumption in the common reference string model. Previous protocols of comparable efficiency achieved either committed OT on bits, or standard (non-committed) OT on strings.
A Cryptosystem Based on Multiple Chaotic Maps
Authors: Jin-mei Liu, Shui-sheng Qiu, Fei Xiang, Hui-juan Xiao
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

A cryptosystem based on multiple chaotic maps is proposed. It is composed of a function f(×), a 2D chaotic map and two cascaded chaotic subsystems. The iteration times of the cascaded subsystem constructed by simple chaotic maps are changed with the outputs of the 2D chaotic map. Plaintext and the outputs of the cascaded subsystems are handled by the function f(×) to generate ciphertext. Simulation tests and security analyses indicate that the proposed cryptosystem is featured by large key space, high sensitivity to key, and resistance to statistical attacks and differential attacks.
Flood Disaster Risk Analysis for Songhua River Basin Based on Theory of Information Diffusion
Authors: Chang Yi, Chongfu Huang, Yaozhong Pan
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Flood disaster risk analysis, the essential of which is to estimate the probability distribution of flood disaster loss, is an important nonstructural measure for flood control and disaster reduction. In the paper, a frequency analysis method of flood disaster loss based on fuzzy mathematics theory of information diffusion with short time series of flood disaster samples is suggested for flood disaster risk analysis. With the support of historic disaster data, the method has been applied to flood disaster risk analysis for Songhua River Basin and turned out to be effective and practical.
Experimental and Simulation Evaluation of OLSR Protocol for Mobile Ad-Hoc Networks
Authors: Makoto Ikeda, Leonard Barolli, Giuseppe Marco, Tao Yang, Arjan Durresi
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In this paper, we evaluate the performance of Optimized Link State Routing protocol by experimental and simulation results. The experiments are carried out by using our implemented testbed and the simulations by using ns-2 simulator. We also designed and implemented a new interface for the ad-hoc network testbed in order to make more easier the experiments. The comparison between experimental and simulation results shows that for the same parameters setting in the simulation we did not have packet loss but in the experiments we experienced packet loss because of the effects of the environment and the traffic interference.
Formally Testing Liveness by Means of Compression Rates
Authors: César Andrés, Ismael Rodríguez, Fernando Rubio
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

We present a formal method to determine whether there exist living creatures in a given computational environment. Our proposal is based on studying the evolution of the entropy of the studied system. In particular, we check whether there exist entities decreasing the entropy in some parts, while increasing it in the rest of the world, which fits into the well-known maximum entropy production principle. The entropy of a computational environment is measured in terms of its compression rate with respect to some compression strategy. Some life-related notions such as biodiversity are quantified as well. These ideas are presented by means of formal definitions. A toy example where a simple living structure is identified in a video stream is presented, and some results are reported.
FW2_5D: A MATLAB 2.5-D electrical resistivity modeling code
Authors: Adam Pidlisecky, Rosemary Knight
Venue: Computers Geosciences (2008)

We present a 2.5-D forward modeling algorithm for electrical resistivity data. The algorithm incorporates a boundary condition and source singularity correction that greatly reduces the need to pad the model space. In addition, the algorithm includes an optimization method for estimating the appropriate Fourier coefficients to achieve an accurate 2.5-D approximation. The optimization scheme uses a gradient-based search to find the optimal coefficients. We compare results from our algorithm to two analytical solutions. We are able to achieve errors on the order 1% when compared to these models. We have implemented the algorithm as an open source MATLAB-based forward modeling package. The MATLAB code is useful for exploring subsurface current flow. It has been coded so that it can be easily ported to work with inversion routines. The code is computationally efficient and suitable for solving 2-D problems with a large number of model parameters.
Adaptive Loop Tiling for a Multi-cluster CMP
Authors: Jisheng Zhao, Matthew Horsnell, Mikel Luján, Ian Rogers, Chris Kirkham, Ian Watson
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Loop tiling is a fundamental optimization for improving data locality. Selecting the right tile size combined with the parallelization of loops can provide additional performance increases in the modern of Chip MultiProcessor (CMP) architectures. This paper presents a runtime optimization system which automatically parallelizes loops and searches empirically for the best tile sizes on a scalable multi-cluster CMP. The system is built on top of a virtual machine and targets the runtime parallelization and optimization of Java programs. Experimental results show that runtime parallelization and tile size searching are capable of improving performance for two BLAS kernels and one Lattice-Boltzmann simulation, despite overheads.
Plenary lecture IV: obstacle avoidance for kinematically redundant manipulators based on an improved problem formulation and two recurrent neural networks
Authors: Jun Wang
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

With the wide deployment of kinematically redundant manipulators in industrial applications, obstacle avoidance emerges as an important issue to be addressed in robotic motion planning. In this talk, we show the formulation of the inverse kinematic control of redundant manipulators with obstacle avoidance task as a convex quadratic programming problem with both equality and inequality constraints. Compared with our previous formulation, the new problem formulation is more favorable with better solutions or bigger solution set to the problem. To solve this time-varying quadratic programming problem in real time, two recurrent neural networks are applied to compute inverse-kinematic solutions with obstacle avoidance capability in real time. The effectiveness of the proposed approach is demonstrated by using simulation results based on the Mitsubishi PA10-7C.
Summarizing Multiple Gene Trees Using Cluster Networks
Authors: Daniel H. Huson, Regula Rupp
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

The result of a multiple gene tree analysis is usually a number of different tree topologies that are each supported by a significant proportion of the genes. We introduce the concept of a cluster network that can be used to combine such trees into a single rooted network, which can be drawn either as a cladogram or phylogram. In contrast to split networks, which can grow exponentially in the size of the input, cluster networks grow only quadratically. A cluster network is easily computed using a modification of the tree-popping algorithm, which we call network-popping. The approach has been implemented as part of the Dendroscope tree-drawing program and its application is illustrated using data and results from three recent studies on large numbers of gene trees.
Multiple Region Range Face Recognition Based on Fuzzy Integral Using Curvature Feature
Authors: Yeunghak Lee, Taesun Kim
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

The surface curvatures extracted from the face contain the most important personal facial information. In particular, the face shape using depth information in the face represents personal features in detail. In this paper, we develop a method for recognizing range face images by combining the multiple face regions, using Fisherface method, and fuzzy integral. For the proposed approach, the first step uses face curvatures that helps extract facial features for range face images, after normalization using the SVD. As a result of this process, we obtain curvature feature for each region range face. The second step of approach concerns the application of PCA and Fisherface method to each component range face. The reason for adapted PCA and Fisherface method is these can maintain the surface attribute for face curvature, even though these can generate the reduced image dimension. In the last step, the aggregation of the individual classifiers using the fuzzy integral is explained for each component. The experimental results obtain that the approach presented in this paper have outstanding classification in comparison to the results obtained by other methods.
MAME: A Compression Function with Reduced Hardware Requirements
Authors: Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, Jun Kitahara, Hongjun Wu, Özgül Küçük, Bart Preneel
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications with reduced hardware requirements. MAME takes a 256-bit message block and a 256-bit chaining variable as input and produces a 256-bit output. In the light of recent attacks on MD5 and SHA-1, our design strategy is very conservative, and we show that our compression function is secure against various kinds of widely known attacks with very large security margins. The simple logical operations and the hardware efficient S-boxes are used to achieve a hardware implementation of MAME requiring only 8.1 Kgates on 0.18 μm technology.
Collaborative Information Filtering: A Review and an Educational Application
Authors: Andrew Walker, Mimi M. Recker, Kimberly Lawless, David Wiley
Venue: International Journal of Artificial Intelligence in Education (2004)

This paper reviews the literature surrounding an information filtering technique, collaborative information filtering, which supports the discovery of resources in a way that is sensitive to the context of users. Moreover, via statistical clustering techniques, the system supports automated, personalized filtering and recommendation of relevant resources and like-minded users for particular user communities. The paper also describes an educational implementation of this approach, called Altered Vista, and presents results from a 3-month trial use of the system, aimed at evaluating the educational effectiveness and usefulness of the approach.
A survey on software cost estimation in the chinese software industry
Authors: Da Yang, Qing Wang, Mingshu Li, Ye Yang, Kai Ye, Jing Du
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Although a lot of attention has been paid to software cost estimation since 1960, making accurate effort and schedule estimation is still a challenge. To collect evidence and identify potential areas of improvement in software cost estimation, it is important to investigate the estimation accuracy, the estimation method used, and the factors influencing the adoption of estimation methods in current industry. This paper analyzed 112 projects from the Chinese software project benchmarking dataset and conducted questionnaire survey on 116 organizations to investigate the above information. The paper presents the current situations related to software project estimation in China and provides evidence-based suggestions on how to improve software project estimation. Our survey results suggest, e.g., that large projects were more prone to cost and schedule overruns, that most computing managers and professionals were neither satisfied nor dissatisfied with the project estimation, that very few organizations (15%) used model-based methods, and that the high adoption cost and insignificant benefit after adoption were the main causes for low use of model-based methods.
Architecture, implementation and application of complex event processing in enterprise information systems based on RFID
Authors: Chuanzhen Zang, Yushun Fan, Renjing Liu
Venue: Information Systems Frontiers (2008)

Enterprises have to be increasingly agile and responsive to address the challenges posed by the fast moving market. With the software architecture evolving into service-oriented architecture, and the adoption of Radio Frequency Identification (RFID), event processing can fit well in enterprise information systems in terms of facilitation of event aggregation into high level actionable information, and event response to improve the responsiveness. To make it more applicable, the architecture of event processing in enterprise information systems is proposed; event meta model is put forth, and the rules are defined. To improve the detect efficiency, classification and partition of event instance is utilized. We have implemented the event processing mechanism in enterprise information systems based on RFID, including the data structures, optimization strategies and algorithm that is considered as one of the contributions. The performance evaluations show that the method is effective in terms of scalability and the capability of event processing. Complex event processing can improve operation efficiency and discover more actionable information, which is justified by the application.
Aggregating Algorithm for a Space of Analytic Functions
Authors: Mikhail Dashevskiy
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In this paper the problem of Prediction with Expert Advice is considered. We apply an existing algorithm, the Aggregating Algorithm, to a specific class of experts. This class of experts approximates (with respect to its parameter) the class of continuous functions and in this way it is close to a natural way of describing a possible dependence between two variables (continuous). We develop an explicit algorithm and prove an upper bound on the difference between the loss of our algorithm and the loss of the best expert, which has the order of the squared logarithm of the number of steps of the algorithm. This bound lies between existing bounds which have the form of the logarithm of the number of steps and the square root of the number of steps. Having more sets (algorithm, class of experts, upper bound) helps in choosing an appropriate way of solving the problem of Prediction with Expert Advice for a particular application.