ppxscal/embedding_network huggingface dataset:
The insider threat in scalable distributed systems: algorithms, metrics and gaps
Authors: Yair Amirs
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

However well we protect our systems, there is always a chancethey will be compromised. Constructing practical survivable distributed systems that achieve their goals even after being penetrated is a challenge. The problem manifests itself in algorithms maintaining consistency among servers, in routing protocols, and in the interface between clients (or sensors) and the system. We discuss our recent work on intrusion-tolerant algorithms that scale to wide-area networks. We demonstrate limitations in traditional correctness criteria and in common metrics that, while relevant to small systems, are less meaningful in large and complex environments. We propose new metrics that may better capture the challenge posed by such environments. We also point to gaps where no adequate solutions currently exist.
Personal Computing Spawns Diverse Magazines, Viewpoints
Authors: M. Potes
Venue: Computer (1978)

Editors representing nine personal computing magazines joined Dennis Allison, Microsystems editor of Computer, to form the Wednesday evening panel, "Editors of Your Favorite Computing Magazine," at COMPCON Spring '78. Participants were Carl Warren of Interface Age, Burcheval Green of Creative Computing, Carl Helmers of Byte, Don Inman of Calculators/Computers, Lee Felsenstein of ROM, Nels Winkless of Personal Computing, Phyllis Cole of People's Computers, Jim Warren of Dr. Dobb's Journal, and John Craig of Kilobaud. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Configurable Proof Obligations in the Frog Toolkit
Authors: Simon Fraser, Richard Banach
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

In model based formal methods, incompatible tools for different techniques is the norm. However, greater applicability to industrial scale systems increasingly requires combining the strengths of different techniques, in line with the Verification Grand Challenge. The Frog tool embodies a construct-based specification syntax, and its meta-language Frog-CCL allows the generic configuration of both a construct's syntax and its proof obligations. For a specific system, Frog generates the system's verification conditions mechanically from the generic ones. Relationships between systems such as refinement and retrenchment can be configured. An example retrenchment between two simple systems illustrates the technique.
Building Trustworthy Intrusion Detection through VM Introspection
Authors: Fabrizio Baiardi, Daniele Sgandurra
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Psyco-Virt is a high assurance intrusion detection tool that merges host and network intrusion detection technologies with virtual machine introspection. Psyco-Virt architecture includes a cluster of virtual machines, the monitored VMs, which run the OS and applications of interest, and a further VM, the introspection one. Several agents distributed across the monitored VMs execute network and host IDS tools to discover attempted intrusions/attacks on the monitored VMs. The introspection VM makes the detection tools trustworthy by running an introspector and a director to discover any attempt to maliciously modify the kernel, the agents and the IDSes hosted on a monitored VM. On each monitored VM a collector gathers the alerts generated by the agents and forwards them to the director through a control network dedicated to data exchange among the agents and the introspection VM. The director on the introspection VMfilters all the alerts and delegates the execution of a proper action to a notifier whenever an intrusion or an attempt to modify the IDSes is detected. In such cases, a monitored VM can either be stopped or frozen and its current state saved in a file for a later, deeper inspection. After describing Psyco-Virt, we discuss some examples of agents and functions using introspection and present preliminary results and performance figures of a first prototype.
A clustering method to identify representative financial ratios
Authors: Yu-Jie Wang, Hsuan-Shih Lee
Venue: Information Sciences: an International Journal (2008)

When companies evaluate their performance, it is impractical to take all of their financial ratios into consideration. To evaluate the financial performance of a company, only a fraction of the available financial ratios are considered and selected as evaluation criteria. In general, financial ratios presented as sequences (or called financial ratio sequences), are first clustered and then a representative indicator is chosen from each cluster to serve as an evaluation criterion. To cluster financial ratios, we propose a clustering method in which the financial ratios of different companies with similar variations are partitioned into the same cluster. In other words, a fuzzy relation is proposed to represent the similarity between the financial ratios, and a cluster validation index is also provided to determine the number of clusters. Once the financial ratios are clustered, the representative indicator for each cluster will be identified.
A Yellow Page Information Retrieval System Based on Sorted Duality Interrelevant Successive Tree and Industry Ontology
Authors: Chuanyao Yang, Yuqin Li, Zhenghua Wang, Chenghong Zhang, Yunfa Hu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper analyses the theory of information retrieval relativity and proposes establishing a content-based industry information retrieval system based on ontology. The system can accomplish the mapping between retrieval results and pragmatics relativity in some degree and bring more convenience to users when querying, which embodies the user-oriented principle. This retrieval system uses a novel retrieval model called sorted duality inter-relevant successive tree to index the contents of yellow page data to improve the retrieval efficiency. The experiment shows that this system is successful and has a better precision and recall of retrieval.
Numerical Simulation of a Difference Scheme Applied in Image Processing Based on Four-Order PDEs
Authors: Lijie Zhang, Hui Liu, Yan Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A difference scheme for noise removal based on four-order partial differential equations is suggested. It can approximate actual image while preserving edges and avoiding blocky effects in image processing. Numerical results are demonstrated its efficiency and the better choice of parameters.
An experimental analysis of a population based approach for global optimization
Authors: Andrea Grosso, Marco Locatelli, Fabio Schoen
Venue: Computational Optimization and Applications (2007)

In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see http://www.optimization-online.org/DB_HTML/2005/02/1056.html ). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging problems.
A Technique for Estimating Performance of Fault-Tolerant Programs
Authors: R. D. Schlichting
Venue: IEEE Transactions on Software Engineering (1985)

A technique is presented for estimating the performance of programs written for execution on fail-stop processors. It is based on modeling the program as a discrete-time Markov chain and then using z-transforms to derive a probability distribution for time to completion.
Reducing ıTESLA memory requirements
Authors: A. E. Hegazy, A. M. Darwish, R. El-Fouly
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

This paper addresses secure broadcast in wireless sensor networks (WSN). We introduce new set of security protocols for broadcast operation, providing enhancements over the current set of security protocols. We introduce two protocols as an enhancement for ìTESLA protocol. In these protocols we focuses on reducing the memory requirements for the broadcast session while maintain the same security level. The first protocol, Low Buffer ìTESLA (LB- ìTESLA), achieves 88% reduction in the node buffer size comparing to the original ìTESLA protocol. The second protocol, Reversed MAC ìTESLA (RM- ìTESLA), achieves 92% reduction in the node buffer size comparing to the original ìTESLA protocol. This reduction enables longer session's duration and reduces the memory requirement.
StreamMiner: a classifier ensemble-based engine to mine concept-drifting data streams
Authors: Wei Fan
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We demonstrate StreamMiner, a random decision-tree ensemble based engine to mine data streams. A fundamental challenge in data stream mining applications (e.g., credit card transaction authorization, security buy-sell transaction, and phone call records, etc) is concept-drift or the discrepancy between the previously learned model and the true model in the new data. The basic problem is the ability to judiciously select data and adapt the old model to accurately match the changed concept of the data stream. StreamMiner uses several techniques to support mining over data streams with possible concept-drifts. We demonstrate the following two key functionalities of StreamMiner: 1. Detecting possible concept-drift on the fly when the trained streaming model is used to classify incoming data streams without knowing the ground truth. 2. Systematic data selection of old data and new data chunks to compute the optimal model that best fits on the changing data streams.
Machine Dating of Handwritten Manuscripts
Authors: U. Garain, S. Parui, T. Paquet, L. Heutte
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents a pioneering study on automatic dating of handwritten manuscripts. Analysis of handwriting style forms the core of the dating method. Initially, it is hypothesized that a manuscript can be dated, to a certain level of accuracy, by looking at the way it is written. The hypothesis is then verified with real samples of known dates. A general framework is proposed for machine dating of handwritten manuscripts. Experiments on a database containing manuscripts of Gustave Flaubert (1821- 1880), the famous French novelist reports about 62% accuracy when manuscripts are dated within a range of five calendar years with respect to their exact year of writing.
Geographic image retrieval in mobile guides
Authors: Rui Jesus, Ricardo Dias, Rute Frias, Nuno Correia
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

This paper describes an application that is based on geographic queries to retrieve personal pictures when visiting points of interest using mobile devices such as PDAs. The retrieved information can be visualized in different ways, including the spatial visualization of the pictures of the places visited. The paper describes the user interface features and the experiments that were made to illustrate the proposed methods.
A Close Look at Domain Testing
Authors: L. A. Clarke
Venue: IEEE Transactions on Software Engineering (1982)

White and Cohen have proposed the domain testing method, which attempts to uncover errors in a path domain by selecting test data on and near the boundary of the path domain. The goal of domain testing is to demonstrate that the boundary is correct within an acceptable error bound. Domain testing is intuitively appealing in that it provides a method for satisfying the often suggested guideline that boundary conditions should be tested.
Load shedding for window joins over streams
Authors: Dong-Hong Han, Guo-Ren Wang, Chuan Xiao, Rui Zhou
Venue: Journal of Computer Science and Technology (2007)

We address several load shedding techniques over sliding window joins. We first construct a dual window architectural model including aux-windows and join-windows, and build statistics on aux-windows. With the statistics, we develop an effective load shedding strategy producing maximum subset join outputs. In order to accelerate the load shedding process, binary indexed trees have been utilized to reduce the cost on shedding evaluation. When streams have high arrival rates, we propose an approach incorporating front-shedding and rear-shedding, and find an optimal trade-off between them. As for the scenarios of variable speed ratio, we develop a plan reallocating CPU resources and dynamically resizing the windows. In addition, we prove that load shedding is not affected during the process of reallocation. Both synthetic and real data are used in our experiments, and the results show the promise of our strategies.
Universal Modular Trees: A Design Procedure
Authors: R. A. Thompson
Venue: IEEE Transactions on Computers (1978)

An alternative design procedure is presented for the implementation of finite-state Moore machines as universal modular trees (UMT's). A machine property is shown to provide a design goal in the tree depth. Design specification is made heuristically by labeling transitions on a shift register state diagram. Programming of feedback and output trees is accomplished with a template tree. The procedure is felt to be more prone to reaching minimal tree depth and more expository of design choices (an aid in fault reconfiguration) than previous design procedures.
Implementing and Optimizing Lisp for the Cray
Authors: J. W. Anderson
Venue: IEEE Software (1987)

This Portable Common Lisp version for the Cray couples the language's strengths with the machine's power. The researchers who developed the implementation tell how they did it.
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems
Authors: Jinsong Han, Yunhao Liu
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Although anonymizing Peer-to-Peer (P2P) systems often incurs extra costs in terms of transfer efficiency, many systems tryto mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peershave to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such paths is significantlyhigh. In this paper, we propose Rumor Riding (RR), a lightweight mutual anonymity protocol for decentralized P2P systems.RR employs a random walk scheme which frees initiating peers from the heavy load of path construction. Compared with previousRSA-based anonymity approaches, RR also takes advantage of lower cryptographic overhead by mainly utilizing a symmetric cryptographicalgorithm to achieve anonymity. We demonstrate the effectiveness of this design through trace-driven simulations. The analyticaland experimental results show that RR is more efficient than existing protocols. We also discuss our early implementationexperiences with the RR prototype.
Algorithm based on simulated annealing for land-use allocation
Authors: Inés Santé-Riveira, Marcos Boullón-Magán, Rafael Crecente-Maseda, David Miranda-Barrós
Venue: Computers Geosciences (2008)

This article describes the use of simulated annealing for allocation of land units to a set of possible uses on, the basis of their suitability for those uses, and the compactness of the total areas allotted to the same use or kind of use, which are fixed a priori. The results obtained for the Terra Cha district of Galicia (N.W. Spain) using different objective weighting schemes are compared with each other and with those obtained for this district under the same area constraints, using hierarchical optimization, ideal point analysis, and multi-objective land allocation (MOLA) to maximize average use suitability. Inclusion of compactness in the simulated annealing objective function avoids the highly disperse allocations typical of optimizations that ignore this sub-objective.
Research on Detecting Method of Submarine Oil Pipelines Corrosion Degree Based on Chaos Genetic Algorithm Neural Network
Authors: Meijuan Gao, Jingwen Tian, Kai Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Considering the issues that the relationship between the submarine oil pipelines corrosion degree and detection information of sensor is a complicated and nonlinear and the chaos genetic algorithm neural network has the ability of strong nonlinear function approach and the feature of global optimization, in this paper, a detection method of submarine oil pipelines corrosion degree based on chaos genetic algorithm neural network is presented. It got the original data by sensors. We made multiscale wavelet transform and frequency analysis to multichannels original data, extracted and selected the key attribute parameters. We construct the structure of chaos genetic algorithm neural network that used for the corrosion degree detection of oil pipelines. The method can truly detect the corrosion degree of oil pipelines by learning the detection information of sensors. The detection results show that this method is feasible and effective.
Standard Graphics Software for High-Performance Applications
Authors: james Warner
Venue: IEEE Computer Graphics and Applications (1985)

Software tools packages based on graphics standards can aid the developers of high-performance graphics systems¿but require careful evaluation.
Exploring in-situ sensing irregularity in wireless sensor networks
Authors: Joengmin Hwang, Tian He, Yongdae Kim
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

The circular sensing model has been widely used to estimate performance of sensing applications in existing analysis and simulations. While this model provides valuable high-level guidelines, the quantitative results obtained may not reflect the true performance of these applications, due to the existence of obstacles and sensing irregularity introduced by insufficient hardware calibration. In this project, we design and implement two Sensing Area Modeling (SAM) techniques useful in the real world. They complement each other in the design space. P-SAM provides accurate sensing area models for individual nodes using controlled or monitored events, while V-SAM provides continuous sensing similarity models using natural events in an environment. With these two models, we pioneer an investigation of the impact of sensing irregularity on application performance, such as coverage scheduling. We evaluate SAM extensively in real-world settings, using three testbeds consisting of 40 MICAz motes and 14 XSM motes. To study the performance at scale, we also provide an extensive 1,400-node simulation. Evaluation results reveal several serious issues concerning circular models, and demonstrate significant improvements
The Integrated Control of Anti-lock Braking System and Active Suspension in Vehicle
Authors: J. Shao, L. Zheng, Y. N. Li, J. S. Wei, M. G. Luo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper investigates the integrated control of anti- lock braking system(ABS) and active suspension in vehicle. The control objective for the integrated approach is to reduce braking distance and stop time more than just only ABS, meanwhile the performance of suspension not going to the bad. The half car model with four degrees of freedom of active suspension is established along with an ABS system model. Fuzzy logic controllers are designed and implemented to control these two subsystems. An integrated control algorithm is presented to coordinate the two subsystems. Numerical simulations are carried out to identify the effectiveness of the proposed fuzzy logic controller. The results obtained show that the integrated control of ABS and active suspension improves braking performance significantly compared with an ABS system without combining active suspension, on the other hand, the performance of suspension is not sacrificed.
An MPSoC Performance Estimation Framework Using Transaction Level Modeling
Authors: Rabie Ben Atitallah, Smail Niar, Samy Meftali, Jean-Luc Dekeyser
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

To use the tremendous hardware resources available in next generation MultiProcessor Systems-on-Chip (MPSoC) efficiently, rapid and accurate design space exploration (DSE) methods are needed to evaluate the different design alternatives. In this paper, we present a framework that makes fast simulation and performance evaluation of MPSoC possible early in the design flow, thus reducing the time-to-market. In this framework and within the Transaction Level Modeling (TLM) approach, we present a new definition of the timed Programmer's View (PVT) level by introducing two complementary modeling sublevels. The first one, PVT Transaction Accurate (PVT-TA), offers a high simulation speedup factor over the Cycle Accurate Bit Accurate (CABA) level modeling. The second one, PVT Event Accurate (PVT-EA), provides a better accuracy with a still acceptable speedup factor. An MPSoC platform has been developed using these two sublevels including performance estimation models. Simulation results show that the combination of these two sublevels gives a high simulation speedup factor of up to 18 with a negligible performance estimation error margin.
A Propsed Method for Simpliofied Microcomputer Programming*
Authors: G. A. Korn
Venue: Computer (1975)

A key obstacle to wider application of the new microprocessors is the need to program in assembly language with fairly cumbersome instruction sets. We propose a new technique which will make it easy for applications-oriented non-programmers to generate efficient microcomputer programs without any need to learn assembly language. The user merely specifies an analog-computer-like block diagram whose intuitively meaningful block-operators specify standard mathematical operations (addition, multiplication, integration, etc.) and input/output operations (e.g., analog/digital conversion, switching, sensing). These standard operations are implemented as subroutines in the microcomputer read-only memory (ROM). An interactive editor/translator program running on a small minicomputer translates block-diagram specifications into a simple address table and loads it into the microcomputer memory (RAM, PROM, or ROM). This address table represents the block-diagram operation sequence and specifies successive jumps to the correct standard subroutines in ROM and data fetching/storing operations in the random-access memory.
Bias-specified robust design optimization: A generalized mean squared error approach
Authors: Gunther Steenackers, Patrick Guillaume
Venue: Computers and Industrial Engineering (2008)

The primary goal of robust design is to determine the best design points by minimizing variability of the performance of a manufacturing process and minimizing deviation of the performance from a target value of interest. In this paper, a generalization and improvement of the robust optimization approach, based on the mean squared error, is suggested and applied. The constraint on the process bias is further relaxed. Different response surface functions are evaluated and compared. As an example, different optimization approaches are illustrated with a numerical test case. The results are explained and discussed.