ppxscal/embedding_network huggingface dataset:
A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs
Authors: Stefan Droste, Thomas Jansen, Ingo Wegener
Venue: Evolutionary Computation (1998)

Evolutionary algorithms (EAs) are heuristic randomized algorithms which, by many impressive experiments, have been proven to behave quite well for optimization problems of various kinds. In this paper a rigorous theoretical complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with Boolean inputs is given. Different mutation rates are compared, and the use of the crossover operator is investigated. The main contribution is not the result that the expected run time of the (1 + 1) evolutionary algorithm is Θ(n ln n) for separable functions with n variables but the methods by which this result can be proven rigorously.
Fuzzy Based Trusted Ad Hoc On-demand Distance Vector Routing Protocol for MANET
Authors: J. Martin Leo Manickam, S. Shanmugavel
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Ad hoc networks are frequently established in insecure environments and hence become susceptible to attacks. A number of recently proposed secure routing protocols entail a number of prerequisites during both the network establishment and operation phases as they employ cryptographic algorithms. In contrast, trust-based routing protocols locate trusted routes and permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of our proposed Fuzzy based Trusted AODV routing protocol in a network, with varying number of malicious nodes. With the help of simulations, we demonstrate that the performance of the proposed protocol is better than AODV in terms of routing overhead ratio, throughput, latency and packet loss under similar attack conditions. Index Terms -- mobile networking, MANET, security, trust, routing protocol, fuzzy.
B74-16 Design of On-Line Computer Systems
Authors: G. W. R. Luderer
Venue: IEEE Transactions on Computers (1974)

This book evolved from notes for a seminar with the same title which has been given repeatedly at the Institute for Advanced Technology, a directorate of CDC. It intends to present an integrated guideline for the design of on-line computer systems, focusing on technical (rather than managerial) aspects, although it may help the manager to maintain a fundamental understanding of what his programmers and analysts are up to. Its six parts are meant to be basically independent, and the following is an overview of their contents.
Privacy and Protection in Operating Systems
Authors: D. K. Branstan
Venue: Computer (1973)

The IEEE Committee on Operating Systems sponsored a workshop on privacy and protection in operating systems in Princeton, New Jersey, from June 12-14, 1972. Thirty-two people interested in operating system protection met at the Nassau Inn to discuss various problems and their possible solutions. The workshop was organized by Dr. R. Stockton Gaines of the Institute for Defense Analysis, Princeton. He and Professor Peter Denning, Princeton University, acted as session chairmen.
An Improved Moving Object Detection Algorithm Based on Frame Difference and Edge Detection
Authors: Chaohui Zhan, Xiaohui Duan, Shuoyu Xu, Zheng Song, Min Luo
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Moving object detection is very important in intelligent surveillance. In this paper, an improved algorithm based on frame difference and edge detection is presented for moving object detection. First of all, it detects the edges of each two continuous frames by Canny detector and gets the difference between the two edge images. And then, it divides the edge difference image into several small blocks and decides if they are moving areas by comparing the number of non-zero pixels to a threshold. At last, it does the block-connected component labeling to get the smallest rectangle that contains the moving object. Experimental results show the improved algorithm overcomes the shortcomings of the frame difference method. It has a high recognition rate and a high detection speed, which has a broad market prospect.
How Software Designs Decay: A Pilot Study of Pattern Evolution
Authors: Clemente Izurieta, James M. Bieman
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

A common belief is that software designs decay as systems evolve. This research examines the extent to which software designs actually decay by studying the aging of design patterns in successful object oriented systems. Aging of design patterns is measured using various types of decay indices developed for this research. Decay indices track the internal structural changes of a design pattern realization and the code that surrounds the realization. Hypotheses for each kind of decay are tested. We found that the original design pattern functionality remains, and pattern decay is due to the "grime", non-pattern code, that grows around the pattern realization.
Using Support Vector Machines to Predict the Variation of Organic Pollutants in Pond Water
Authors: Nan Li, Zetian Fu, Wengui Cai, Xiaoshuan Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

There is a growing perception that the research of fishery water quality forecasting are popular and important topic today, due to the food quality security and health impact caused by exposing to water pollutants existing in aquaculture. This paper aims to prove the feasibility of predicting the organic pollutant levels of pond water via SVM. The experimental data in weekly time series are collected from the fishery ponds in Xiao Tangshan in Beijing. The functional characteristics, including the network structure, the kernel function selection and the parameter sensitivity of SVM are investigated. The performance of the SVM model and the conventional BP neural network in predicting is also compared.
Microsystems a Microprocessor Architecture for a Changing World: The Motorola 68000
Authors: E. Stritter
Venue: Computer (1979)

The first implementation of a new microprocessor architecture promises to narrow the gap between the power of very small and very large computers.
PAWS: A Framework for Executing Adaptive Web-Service Processes
Authors: Danilo Ardagna, Marco Comuzzi, Enrico Mussi, Barbara Pernici, Pierluigi Plebani
Venue: IEEE Software (2007)

The PAWS (Processes with Adaptive Web Services) framework facilitates flexible and adaptive execution of managed Web-service-based business processes. The framework coherently integrates several service-adaptation modules and uniquely couples design-time and runtime mechanisms for process specification and global framework execution. During design, PAWS achieves flexibility through a number of mechanisms: it identifies a set candidate services for each process task, negotiates QoS, specifies quality constraints, and then identifies mapping rules for invoking services with different interfaces. At runtime, PAWS exploits the design-time mechanisms to support adaptation during process execution: it selects the best set of services to execute the process, reacts to service failures, and preserves execution when a context change occurs. PAWS has been applied in several case studies in various domains; results show that it can reduce design-time efforts to create a flexible process, while ensuring a good trade-off between user and provider requirements. This article is part of a special issue on service-centric software systems.
Modified-rate-quantization algorithm for multiple-input multiple-output systems under imperfect channel knowledge
Authors: Khalida Ghanem, Tayeb A. Denidni, Farid Ghanem
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, a modified-rate-quantization algorithm for multiple input multiple output (MIMO) systems is proposed using singular-value decomposition (SVD). This low complexity scheme adapts the subchannel transmit power and spectral efficiency in the spatial and temporal domains under transmit power and instantaneous bit error rate (BER) constraints. It is shown that with five discrete-rate levels, the proposed scheme reaches a spectral efficiency performance similar to the scheme with a continuous rate. The robustness of the proposed scheme to channel state information (CSI) imperfections is also studied. The obtained results show that the spectral efficiency is unaffected up to a certain level, but the bit error rate (BER) performance is particularly sensitive to these imperfections, especially at high SNR levels. Indeed, this ideally designed MIMO system over-estimates the subchannels, which leads to a deterioration of the BER performance. A new version of this algorithm, which is suitable for vertical Bell Labs layered space---time (V-BLAST) systems, is also presented. Through simulation results, it appears that the extended algorithm allows to reach a better performance in terms of spectral efficiency than other known schemes, but it is more sensitive to imperfect CSI than the first version.
A Image Digital Watermarking based on DWT in Invariant Wavelet Domain
Authors: Xinyang Huang, Yang Luo, Minsheng Tan, Dazheng Lin
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Surviving geometric attacks in image watermarking is considered to be of great importance. In the face of geometrical attacks, all shortcomings of almost all digital watermarking algorithms have been exposed. This paper presents an improved invariant wavelet that is better than the bilinear interpolation, and designs a novel blind image watermarking algorithm of Scalar Costa System based on DWT in the Rotation- and Scale- and Translation- (RST) Moment Invariant Wavelet, i.e. RSTMIW domain. The experiments show that this novel algorithm is robust against RST geometrical, filter and noise attacks, however, sensitive to local crop attacks.
High-Speed Arithmetic Arrays
Authors: D. P. Agrawal
Venue: IEEE Transactions on Computers (1979)

High-speed multifunction arithmetic arrays for multiplication, division, square and square-root operations are presented in this paper. These arrays seem attractive due to their versatility and speed. A recently described quotient-bit evaluation technique that uses the carry-save method in a nonuniform division array is extended here for the restoring-division process. This array includes the multiplication process as well, and the division time approaches that of multiplication. The design objective of multifunctional arithmetic arrays precludes consideration of other high-speed division techniques. A further extension of the restoring division process is shown to make the design of an array for square/square-root operation straightforward. The two underlying arrays can be coalesced to perform any one of the four operations. Possible methods of merging the arrays, with their relative merits, are also discussed. For illustration purposes, complete internal details of such a generalized pipelined array for 4-bit operation is included in this paper. Due consideration is also given to the possibility of large-scale integration of the different arrays illustrated in this paper.
On the Existence of Combinational Logic Circuits Exhibiting Multiple Redundancy
Authors: J. E. Smith
Venue: IEEE Transactions on Computers (1978)

Multiple redundancy is a very complex form of redundancy about which little is known. This correspondence shows by construction that redundancy of any multiplicity can exist in an arbitrary combinational circuit, and that redundancy of any multiplicity = 4 can exist in a tree circuit. Many examples are given. The correspondence concludes with a discussion of the effect multiple redundancy can have on multiple fault testing. It is shown that with a proper algorithm multiple redundancy can actually cause fewer problems than single redundancy does when single fault testing is being considered.
New strategies to improve offset and the speed---accuracy---power tradeoff in CMOS amplifiers
Authors: Carlos Muñiz-Montero, Ramon Gonzalez Carvajal, Alejandro Díaz-Sánchez, Jose Miguel Rocha-Pérez
Venue: Analog Integrated Circuits and Signal Processing (2007)

Four continuous-time strategies to improve the speed---accuracy---power tradeoff in CMOS amplifiers by using low-power offset-compensation circuits are presented. The offset contribution at the output voltage is extracted and used to modify the DC component of the input voltage or the value of the active load, through low frequency feedback loops, which are realized using two transistors operating in weak inversion and a small capacitor. Because these circuits do not affect the bandwidth and allow using small transistors, the power consumption is greatly reduced with respect to an uncompensated amplifier of the same speed and offset behavior. The proposed strategies present reduced costs in area, power consumption and complexity, and a decrease in the low frequency noise contributions. MonteCarlo, HSPICE simulations results of common source, class AB and fully differential amplifiers, and experimental results of a class AB amplifier, all implemented in a 0.5-μm CMOS technology are shown. Statistical analyses of these strategies are also presented. Improvements up to 99.74% and 398.6% in the offset and the power consumption are respectively observed.
Optimization of frequent itemset mining on multiple-core processor
Authors: Li Liu, Eric Li, Yimin Zhang, Zhizhong Tang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine. A detailed study shows that, even with the best implementation, current FP-tree based algorithms still under-utilize a multi-core system due to poor data locality and insufficient parallelism expression. We propose two techniques: a cache-conscious FP-array (frequent pattern array) and a lock-free dataset tiling parallelization mechanism to address this problem. The FP-array efficiently improves the data locality performance, and makes use of the benefits from hardware and software prefetching. The result yields an overall 4.0 speedup compared with the state-of-the-art implementation. Furthermore, to unlock the power of multi-core processor, a lock-free parallelization approach is proposed to restructure the FP-tree building algorithm. It not only eliminates the locks in building a single FP-tree with fine-grained threads, but also improves the temporal data locality performance. To summarize, with the proposed cache-conscious FP-array and lock-free parallelization enhancements, the overall FP-tree algorithm achieves a 24 fold speedup on an 8-core machine. Finally, we believe the presented techniques can be applied to other data mining tasks as well with the prevalence of multi-core processor.
Circular Noises Removal from Scanned Document Images
Authors: G. Meng, N. Zheng, Y. Zhang, Y. Song
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Defects inspection and correction is an important topic in the fields of scanned documents preprocessing. In this paper, a very fast and robust algorithm is proposed for locating and removing a special kind of circular noises caused by scanning documents with punched holes. Firstly, original image is reduced according to an elaborately selected ratio. Punched holes after reduction will leave some distinctive small regions. By examining such small regions, holes noises can be fast detected and located. To diminish false detections, Hough transformation is applied to the roughly located regions to further confirm the located holes. Finally, circular noise is eliminated by fitting a bi-linear blending Coons surface which interpolates along the four edges of noisy region. Experiments on a variety of scanned documents with punched holes demonstrate the feasibility and efficiency of the proposed algorithm.
An optimal randomized algorithm for d-variate zonoid depth
Authors: Pat Morin
Venue: Computational Geometry: Theory and Applications (2008)

A randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G. Koshevoy, K. Mosler, Zonoid data depth: Theory and computation, in: A. Prat (Ed.), COMPSTAT 1996-Proceedings in Computational Statistics, Physica-Verlag, Heidelberg, 1996, pp. 235-240; K. Mosler, Multivariate Dispersion, Central Regions and Depth. The Lift Zonoid Approach, Lecture Notes in Statistics, vol. 165, Springer-Verlag, New York, 2002] of a point with respect to a fixed dimensional point set is presented.
A Model-Driven Approach for Dependable Software Systems
Authors: Michael Jiang, Zhihui Yang
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

High dependability is a key requirement for many types of systems, such as safety-critical systems, telecommunication systems, and mission-critical software systems. Although software components and web services are proven technologies to tackle design complexity, their reliability affects the reliability and availability of the systems they are part of. The composition of components and web services further complicates the issue. For highly dependable systems, the faults of components and web services have to be minimized to achieve overall system dependability. This paper describes a model-driven engineering approach to improve the dependability of domain- specific software systems built with component and web service composition. In this framework, web services and components are specified as model elements and their dependability is enhanced by generating both functional code and protective mechanisms to reduce the impact of component and service failures. The applicability of this approach is demonstrated in our implementation and deployment of mobile services. Keywords: Dependability, availability, reliability, Meta-model, web services, and software component.
Numerical Simulation Technique for Nonlinear Singularly Perturbed Predator-Prey Reaction Diffusion System in Biomathematics
Authors: Xin Cai, Zhong-di Cen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In biomathematics, singularly perturbed predator-prey systems are of common occurrence. A singularly perturbed problem with nonlinear predator-prey reaction diffusion system in 2 dimension is studied. The system changes rapidly near initial time layer. Traditional numerical method failed to simulate the system. Numerical simulation of this kind of system is rare so far, this motives us to consider novel simulation technique. Firstly stretched variable is introduced so that the analytic solution is decomposed into the reduced solution and the initial layer correction solution. Secondly, the nonlinearization process of the reduced problem system is proposed. Thirdly, two numerical method, stretched variable method and Shishkintype method, are constructed. Finally, simulation example is studied to demonstrate that both stretched variable method and Shishkin-type method are efficient computational method. Shishkin-type method is more practical in use for this kind of complicated system.
A Two-phase Flight Data Feature Selection Method Using both Filter and Wrapper
Authors: Liang Zhang, Fengming Zhang, Yongfeng Hu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Feature selection is an important issue in flight data mining. By selecting only relevant features of flight data, higher prediction accuracy can be expected and computational complexity can be reduced. In this paper we propose a novel two-phase flight data feature selection approach using both filter and wrapper. It begins by running artificial neural network weight analysis (ANNWA) as a fi1ter approach to remove irrelevant features, then it runs genetic algorithm as a wrapper approach to remove redundant or useless features. We demonstrate the usefulness of the proposed approach on two real-world datasets based on flight data. Our algorithm reduces the size of flight data feature space significantly without compromising the classification or the prediction performance.
Dead Code Elimination in CTOC
Authors: Ki-Tae Kim, Je-Min Kim, Weon-Hee Yoo
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the \Phi-function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures.
An Efficient Traffic Adaptive Backoff Protocol for Wireless MAC Layer
Authors: Jun Wang, Min Song
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

To avoid collisions in wireless networks, medium access control (MAC) protocols, such as Distributed Coordination Function (DCF), have been developed to assist each node to decide when and how to access the communication channel. Although DCF is widely used in 802.11 based wireless local area networks, its performance is limited because DCF does not take into account the traffic intensity and node density. In other word, DCF only knows collision occurs but does not know how severe of the collision. In this paper, we develop a novel traffic adaptive backoff (TAB) protocol. We use network allocation vector count to approximate the intensity of surrounding traffic and the density of the nodes. TAB protocol then chooses a random backoff time uniformly between a lower threshold and an upper threshold. Simulations results suggest that the TAB protocol improves network performance by achieving a better channel utilization and reducing the number of dropped packets.
Stochastic comparisons of parallel systems when components have proportional hazard rates
Authors: Subhash Kochar, Maochao Xu
Venue: Probability in the Engineering and Informational Sciences (2007)

Let X1, &hellip;, Xn be independent random variables with Xi having survival function F&lambda;i, i = 1, &hellip;, n, and let Y1, &hellip;,Yn be a random sample with common population survival distribution F&lambda;, where &lambda;=&Sigma;i=1 n&lambda;i/n. Let Xn:n and Yn:n denote the lifetimes of the parallel systems consisting of these components, respectively. It is shown that Xn:n is greater than Yn:n in terms of likelihood ratio order. It is also proved that the sample range Xn:n X1:n is larger than Yn:n Y1:n according to reverse hazard rate ordering. These two results strengthen and generalize the results in Dykstra, Kochar, and Rojo [6] and Kochar and Rojo [11], respectively.