ppxscal/embedding_network huggingface dataset:
Monte Carlo simulation-based algorithms for estimating the reliability of mobile agent-based systems
Authors: Mosaab Daoud, Qusay H. Mahmoud
Venue: Journal of Network and Computer Applications (2008)

In this paper, we propose two algorithms for estimating the task route reliability of mobile agent-based systems (MABS), which are based on the conditions of the underlying computer network. In addition, we propose a third algorithm for generating a random static planning strategy for mobile agents. The complexity of mobile agent network systems makes it hard to obtain the task route reliability of the MABS theoretically; instead we estimate it using Monte Carlo simulation. In this paper, we assume that the MABS consist of a number of independent mobile agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithms.
Design Innovations in Personal Computers
Authors: H. Garland
Venue: Computer (1977)

There is little question that the current enthusiasm in personal computing was catalyzed by the introduction of the MITS Altair computer kit in January 1975. This computer kit demonstrated by its cost (originally less than $400) that individuals could now afford a computer. And by its design the Altair established a standard bus structure for the personal computing industry.
Special Feature: Monitoring Program Execution: A Survey
Authors: B. Plattner
Venue: Computer (1981)

Progress in this realm of performance measurement has lagged behind advances in the general field of programming languages: careful study of its capabilities and limitations is long overdue.
A Combinatorial Algorithm for Solving Covering Problems
Authors: I. Tomescu
Venue: IEEE Transactions on Computers (1973)

In this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed.
A Comparative Case Study on the Impact of Test-Driven Development on Program Design and Test Coverage
Authors: Maria Siniaalto, Pekka Abrahamsson
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Test-driven development (TDD) is a programming technique in which the tests are written prior to the source code. It is proposed that TDD is one of the most fundamental practices enabling the development of software in an agile and iterative manner. Both the literature and practice suggest that TDD practice yields several benefits. Essentially, it is claimed that TDD leads to an improved software design, which has a dramatic impact on the maintainability and further development of the system. The impact of TDD on program design has seldom come under the researchers' focus. This paper reports the results from a comparative case study of three software development projects where the effect of TDD on program design was measured using object-oriented metrics. The results show that the effect of TDD on program design was not as evident as expected, but the test coverage was significantly superior to iterative test-last development.
Forecasted Particle Swarm Optimization
Authors: Xingjuan Cai, Jianchao Zeng, Ying Tan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper introduces a novel fitness estimation strategy for particle swarm optimization (PSO) that does not evaluate all new positions, thus operating faster. A fitness and associated reliability value are assigned to each new individual that is only evaluated using the true fitness function if the reliability value is below some threshold. This variant of PSO designs a two-stage convex fitness estimation method. The first stage is used to estimate a visual position's fitness and reliability value, whereas in the second stage, the individual's fitness and reliability value are estimated with this visual position. Simulation results show the proposed algorithm is effective and efficient.
A feature-based metric for the quantitative evaluation of pixel-level image fusion
Authors: Zheng Liu, David S. Forsyth, Robert Laganière
Venue: Computer Vision and Image Understanding (2008)

Pixel-level image fusion has been investigated in various applications and a number of algorithms have been developed and proposed. However, few authors have addressed the problem of how to assess the performance of those algorithms and evaluate the resulting fused images objectively and quantitatively. In this study, two new fusion quality indexes are proposed and implemented through using the phase congruency measurement of the input images. Therefore, the feature-based measurements can provide a blind evaluation of the image fusion result, i.e. no reference image is needed. These metrics take the advantage of the phase congruency measurement which provides a dimensionless contrast- and brightness-invariant representation of image features. The fusion quality indexes are compared with recently developed blind evaluation metrics. The validity of the new metrics are identified by the test on the fusion results achieved by a number of multiresolution pixel-level fusion algorithms.
Covering points with a polygon
Authors: Gill Barequet, Matthew T. Dickerson, Yuval Scharf
Venue: Computational Geometry: Theory and Applications (2008)

We consider problems in which we try to cover a given set of points (or a maximum number of them) with a given polygon. To solve these problems we use a new type of diagram that captures point-containment information for scalable, rotated, and/or translated versions of convex polygons. For a given polygon P and a contact point q in a point set S, the diagram parameterizes possible translations, rotations, and scales of P in order to represent containment regions for every other point v@?S. We present geometric and combinatorial properties of this diagram, and describe how it can be computed and used in the solution of several geometric matching problems. The latter have direct applications to object recognition and tolerancing problems in manufacturing.
Compressing large boolean matrices using reordering techniques
Authors: David Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, Suresh Venkatasubramanian
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph structures, and association rule mining. Designing space and time efficient scalable storage and query mechanisms for such large matrices is a challenging problem. We present a lossless compression strategy to store and access such large matrices efficiently on disk. Our approach is based on viewing the columns of the matrix as points in a very high dimensional Hamming space, and then formulating an appropriate optimization problem that reduces to solving an instance of the Traveling Salesman Problem on this space. Finding good solutions to large TSP's in high dimensional Hamming spaces is itself a challenging and little-explored problem -- we cannot readily exploit geometry to avoid the need to examine all N2 inter-city distances and instances can be too large for standard TSP codes to run in main memory. Our multi-faceted approach adapts classical TSP heuristics by means of instance-partitioning and sampling, and may be of independent interest. For instances derived from interactive visualization and telephone call data we obtain significant improvement in access time over standard techniques, and for the visualization application we also make significant improvements in compression.
GA in Optimized Control of Central Air-conditioning System Based on ANN Simulation
Authors: Xian-Mei Zhao, Hao-Yan Li, Jin Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

An ANN (artificial neural network) is used to model the characteristics of the central air-conditioning system, while a global search routine GA (genetic algorithm) is used for global optimized control. This paper describes the integration of ANN and GA used in a central air-conditioning system. Several different optimized control strategies based on GA and ANN simulation were compared with the normalized control strategy. An advanced control scheme was achieved.
Power Reduction Techniques for LSI Memory
Authors: F. S. Greene
Venue: Computer (1972)

Power reduction techniques are described for both LSI memory components and systems. These techniques have been verified experimentally for both read-only and random access read/write components using power switching circuits external to the chips. A number of ways to apply on-chip power switching are described. The power switching concept is also described for memory cards and systems that can be organized into blocks. 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
An efficient fuzzy based technique for signal classification
Authors: V. S. Kodogiannis
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

Fuzzy systems are currently finding practical applications, ranging from "soft" regulatory control in consumer products to accurate modelling of non-linear systems. This paper presents the design of a classification system for vehicle acoustic signal classification. Traffic management and information systems rely on a suite of sensors for estimating traffic parameters. Currently inductive loop detectors and video-based systems are often used to count and detect vehicles. Loop detectors are expensive to maintain and video-based systems are sensitive to environmental conditions and do not perform well in vehicle classification. Vehicle classification is important in the computation of the percentages of vehicle classes that use streets and motorways. The use of an automated system can lead to adequate road surface maintenance with obvious results in cost and quality. However the sound of a working vehicle could provide an important clue to the vehicle type. A novel approach, based on adaptive fuzzy logic systems, has been discussed in this paper. Its performance is evaluated through a simulation study, using metered data collected from a roadside microphone-array sensor at the Valle d'Aosta highway in north-western Italy. The results indicate that the fuzzy classifier based on the proposed defuzzification method, namely area of balance (AOB), provide more accurate classifications compared to other classifiers.
Improving the Convergence of RTDP
Authors: Tian Liang, Jigui Sun, Minghao Yin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Real-Time Dynamic Programming (RTDP) is an outstanding real-time algorithm for solving non- deterministic planning problems with full observability. RTDP has two key advantages comparing with other DP algorithms: first, it obtain an optimal policy without computing the whole space, second, it has a good anytime behavior. However, RTDP's convergence is slow. In this paper, we introduce RTDP(k), an algorithm based on RTDP with a similar structure. RTDP(k) improves the convergence as well as holds real-time algorithm properties. RTDP(k) updates k extended states per iteration following a "bounded propagation strategy". In Markov Decision Processes (MDPs), especially in Stochastic Shortest-path problems (SSPs), we have proved two points: first, every RTDP(k) trial terminates in a finite number of steps ,second, RTDP(k) eventually converges to an optimal policy. From a practical point of view, We show that RTDP(k) produces better solutions in the first trial and converges faster than RTDP on benchmarks for real-time search.
Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources
Authors: Mikkel Bundgaard, Thomas Hildebrandt, Jens Chr. Godskesen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We provide a type system inspired by affine intuitionistic logic for the calculus of Higher-Order Mobile Embedded Resources (Homer), resulting in the first process calculus combining affine linear (non-copyable) and non-linear (copyable) higher-order mobile processes, nested locations, and local names. The type system guarantees that linear resources are neither copied nor embedded in non-linear resources during computation. We exemplify the use of the calculus by modelling a simplistic e-cash Smart Card system, the security of which depends on the interplay between (linear) mobile hardware, embedded (non-linear) mobile processes, and local names. A purely linear calculus would not be able to express that embedded software processes may be copied. Conversely, a purely non-linear calculus would not be able to express that mobile hardware processes cannot be copied.
Random Features Applied to Face Recognition
Authors: Roberto A. Vazquez, Humberto Sossa
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

In this paper we show how a simplified version of a describing vector can be used to efficiently recognize complex objects. We describe how simplified vectors are randomly obtained from complete describing vectors and how these simplified versions can be used to recognize faces. We compare the efficiency of the proposal against PCA using several known distance classifiers with a benchmark of faces.
Parallel analysis of polymorphic viral code using automated deduction system
Authors: Ruo Ando
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

As malicious code has become more sophisticated and pervasive, faster and more effective system for forensics and prevention is important. Particularly, quick analysis of polymorphic (partly encrypted) viral code is necessary. In this paper we propose a parallel analysis of polymorphic viral code using automated deduction system. In proposed system, decipher routine and its parameters are detected by parallelized automated theorem proving. We apply the weighting and look-ahead heuristics for parallel analysis. We run several detection programs with different computing strategies for analyzing target viral binary code. When the fastest detection process is finished with computing time T(0), remaining detection processes with T(1..n) can be terminated in T(0). In experiment, computing time for detection is reduced with average rate about 46%. In about a half of all cases, T (0) * 3 \leqslant T(max) where T(max) is computing time without our strategy. That is, our parallel system makes detection program faster without appending hardware computing resources. Our system is lightweight and effective for reverse engineering and computer forensics.
Identifying Domain Context for the Intentional Modelling Technique MAP
Authors: Abdul Babar, Karl Cox, Vladimir Tosic, Steven Bleistein, June Verner
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Context identification is an important feature of goal modelling techniques. It helps to understand wider organisational systems during requirements engineering. The goal of this paper is to identify domain context for the process driven requirements modelling technique MAP. We present our preliminary research on adding domain context to MAP by using Jackson's context diagrams. The resulting model shows a clear picture of domain entities involved in the MAP processes. We validate our approach on a case dealing with the Point of Sale system of Seven Eleven Japan (SEJ).
Shared moments: opportunities for mobile phones in religious participation
Authors: Rhiannon Sterling, John Zimmerman
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

The near ubiquity of mobile phones in the world and in people's lives, have created new opportunities for reinterpretation of what these devices are and what they do. One area that has recently seen some interest is the use of mobile phones in religious practice; however, designers currently lack a framework for designing in the space. This research explores the appropriate role for a mobile phone in religious practice looking specifically at Zen Buddhists. Despite the assumed dysfunction between mobile technology and Buddhist philosophy of being present in the world, we found many opportunities for the phone to help maintain and enhance the bonds between members the religious community, making them feel a stronger sense of participation.
SVM Based Scheme for Thai and English Script Identification
Authors: S. Chanda, O. R. Terrades, U. Pal
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In some Thai documents, a single text line of a document page may contain both Thai and English scripts. For the Optical Character Recognition (OCR) of such a document page it is better to identify, at first, Thai and English script portions and then to use individual OCR system of the respective scripts on these identified portions. In this paper, a SVM based method is proposed for identification of word-wise printed English and Thai scripts from a single line of a document page. Here, at first, the document is segmented into lines and then lines are segmented into character groups (words). In the proposed scheme, we identify the script of the individual character group combining different character features obtained from structural shape, profile, component overlapping information, topological properties, water reservoir concept etc. Based on the experiment on 6110 data we obtained 99.36% script identification accuracy from the proposed scheme.
Interference excision in spread spectrum communications using adaptive positive time-frequency analysis
Authors: Sridhar Krishnan, Serhat Erküçük
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

This paper introduces a novel algorithm to excise single and multicomponent chirp-like interferences in direct sequence spread spectrum (DSSS) communications. The excision algorithm consists of two stages: adaptive signal decomposition stage and directional element detection stage based on the Hough-Radon transform (HRT). Initially, the received spread spectrum signal is decomposed into its time-frequency (TF) functions using an adaptive signal decomposition algorithm, and the resulting TF functions are mapped onto the TF plane. We then use a line detection algorithm based on the HRT that operates on the image of the TF plane and detects energy varying directional elements that satisfy a parametric constraint. Interference is modeled by reconstructing the corresponding TF functions detected by the HRT, and subtracted from the received signal. The proposed technique has two main advantages: (i) it localizes the interferences on the TF plane with no cross-terms, thus facilitating simple filtering techniques based on thresholding of the TF functions, and is an efficient way to excise the interference; (ii) it can be used for the detection of any directional interferences that can be parameterized. Simulation results with synthetic models have shown successful performance with linear and quadratic chirp interferences for single and multicomponent interference cases. The proposed method excises the interference even under very low SNR conditions of -10 dB, and the technique could be easily extended to any interferences that could be represented by a parametric equation in the TF plane.
Research on Risk in Long-Term Reservoir Dynamic Probability Scheduling
Authors: Cailin Li, Huijun Xu, Xiaohui Yuan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper presents the concept of engineering risk, the algorithm of mean first order second moment (MFOSM) and the approach for long-term reservoir dynamic probability scheduling (LRDPS). MFOSM is applied to study the current stage risk in LRDPS and the risk analysis model is built up for corresponding annual scheduling. Tested in Dan Jiangkou plant, which belongs to Central China Power Grid, the experiment shows that the approach is feasible and can be the assistance of scheduling decision.
Workshop Report: Methods of Verification in Design Automation
Authors: R. L. Russo
Venue: Computer (1976)

The 1975 Design Automation Workshop was held at Michigan State University last October 8-10, under the co-sponsorship of the IEEE Computer Society Technical Committees on Design Automation and Fault Tolerant Computing.
Steam Turbine Fault Diagnosis Method Based on Rough Set Theory and Bayesian Network
Authors: Pu Han, Deli Zhang, Lihui Zhou, Songming Jiao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Aiming at the uncertain problem in steam turbine fault diagnosis, a new method based on rough set theory and Bayesian network is proposed. Simplify expert knowledge and reduce fault symptoms using reduction approach of rough set theory, the minimal diagnostic rules can be obtained. According to the minimal rules, complexity of Bayesian network structure and difficulties of fault symptom acquisition are largely decreased. At the same time, probability reasoning can be realized by Bayesian network. Finally, the correctness and effectiveness of this method are validated by the result of practical fault diagnosis examples.
Resource Classification Based Negotiation in Web Services
Authors: Diala Abi Haidar, Nora Cuppens, Frederic Cuppens, Herve Debar
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Trust establishment is necessary in every negotiation between entities from different security domains. It is seen as a first step before gaining access to protected resources. In this paper, we introduce a new classification methodology for protected resources. We use this classification to define the behavior of entities within a state based negotiation process. This process is enforced by two modules, the negotiation module and the exception treatment module. The first one intercepts all the requests for access. It collects credentials and exchanges policies according to the available negotiation policies. The second one is called by the first one whenever an exception is raised. An exception is a non negotiated denied access or locked negotiation.
Digital Logic Simulation in a Time-Based, Table-Driven Environment
Authors: S. A. Szygenda
Venue: Computer (1975)

This paper is the first part of a two part sequence describing techniques and implementations for table-driven, time-based, parallel fault simulators for digital logic, Part 1 considers design verification simulation and Part 2 considers parallel fault simulation The major objective of these papers is to introduce basic simulation concepts and developmental considerations and to describe the storage and manipulation of data for these simulation environments. These aspects, from both a theoretical and practical viewpoint, represent the most critical considerations for both accurate and efficient digital logic simulation An adequate coverage of these topics will provide a basic understanding of the underlying consideration, both theoretical and practical, involved in the development of this type of simulator.