ppxscal/embedding_network huggingface dataset:
The effects of spacing and titles on judgments of the effectiveness of structured abstracts
Authors: James Hartley, Lucy Betts
Venue: Journal of the American Society for Information Science and Technology (2007)

Previous research assessing the effectiveness of structured abstracts has been limited in two respects. First, when comparing structured abstracts with traditional ones, investigators usually have rewritten the original abstracts, and thus confounded changes in the layout with changes in both the wording and the content of the text. Second, investigators have not always included the title of the article together with the abstract when asking participants to judge the quality of the abstracts, yet titles alert readers to the meaning of the materials that follow. The aim of this research was to redress these limitations. Three studies were carried out. Four versions of each of four abstracts were prepared. These versions consisted of structured&sol;traditional abstracts matched in content, with and without titles. In Study 1, 64 undergraduates each rated one of these abstracts on six separate rating scales. In Study 2, 225 academics and research workers rated the abstracts electronically, and in Study 3, 252 information scientists did likewise. In Studies 1 and 3, the respondents rated the structured abstracts significantly more favorably than they did the traditional ones, but the presence or absence of titles had no effect on their judgments. In Study 2, no main effects were observed for structure or for titles. The layout of the text, together with the subheadings, contributed to the higher ratings of effectiveness for structured abstracts, but the presence or absence of titles had no clear effects in these experimental studies. It is likely that this spatial organization, together with the greater amount of information normally provided in structured abstracts, explains why structured abstracts are generally judged to be superior to traditional ones. &copy; 2007 Wiley Periodicals, Inc.
Pruning the Multilayer Perceptron through the Correlation of Backpropagated Errors
Authors: Claudio M. S. Medeiros, Guilherme A. Barreto
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we introduce an efficient methodology for pruning unnecessary weights of a trained multilayer Per- ceptron (MLP). The proposed method is based on the corre- lation analysis of the errors produced by the output neurons and the backpropagated errors associated with the hidden neurons. Weight connections for which the correlations are smaller than a user-defined error tolerance are discarded. The successive application of this weight pruning method- ology leads eventually to the complete elimination of all connections of a neuron. Extensive computer simulations using synthetic and real-world data indicate that the pro- posed method present better or equivalent results than stan- dard pruning techniques, such as the Optimal Brain Sur- geon (OBS) and Weight Decay and Elimination (WDE), with much lower computational costs. We also show that the resulting optimal architecture matches that provided by Akaike's Information Criterion (AIC).
Regular Events in Stochastic Sequential Machines
Authors: A. Paz
Venue: IEEE Transactions on Computers (1970)

Events representable in stochastic sequential machines, as defined previously by several authors, are shown to be regular in certain cases. The construction of deterministic machines representing those events is implicit.
Judgment aggregation and the problem of truth-tracking
Authors: Gabriella Pigozzi, Stephan Hartmann
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn much attention. The difficulty lies in the fact that a seemingly reasonable aggregation procedure, such as propositionwise majority voting, cannot ensure an equally consistent collective outcome. The literature on judgment aggregation refers to such dilemmas as the doctrinal paradox. Three procedures have been proposed in order to overcome the paradox: the premise-based and conclusion-based procedures on the one hand, and the fusion approach on the other hand. In this paper we assume that the decision which the group is trying to reach is factually right or wrong. Hence, the question is how good the fusion approach is in tracking the truth, and how it compares with the premise-based and conclusion-based procedures. We address these questions in a probabilistic framework and show that belief fusion does especially well for individuals with a middling competence of hitting the truth of a proposition.
An Overview of Nanoscale Devices and Circuits
Authors: Jing Huang, Mariam Momenzadeh, Fabrizio Lombardi
Venue: IEEE Design Test (2007)

Nanotechnology has attracted significant research interest as CMOS approaches its physical limits. This article is a survey of devices and circuits for nanoelectronics. Novel devices that operate at the nanoscale (such as field-effect transistors, diodes, and molecular and mechanical switches) have been recently proposed and built. Additionally, nonvolatile devices that hold their states in a few molecules have been experimentally demonstrated, and researchers have shown different techniques to be effective in the assembly of nanometer-wide wires into large arrays. The reduced size of these devices requires completely new approaches to manufacturing and fabrication (such as self-assembly) with immediate implications and significant impact on circuit design and architectures. This article briefly reviews these various aspects of nanotechnology.
Multi-view Face Detection Based on the Enhanced AdaBoost Using Walsh Features
Authors: Yunyang Yan, Zhibo Guo, Jingyu Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A novel face detection algorithm is proposed in this paper to improve the training speed and detection performance. Firstly, we used Walsh features instead of Haar-Like features in the AdaBoost algorithm. Walsh features have less redundancy than Haar-Like features due to its orthogonal specialty. Then, we defined a kind of week classifiers with dual-threshold to speedup training process and increase accuracy. Furthermore, during training, dual-threshold of every classifier is adaptively adjusted to separate the face and non-face as far as possible. Experimental results on MIT+CMU frontal face set and CMU profile face set demonstrated that the proposed technique can achieve better results on the detection speed and accuracy than the corresponding method.
Monadic augment and generalised short cut fusion
Authors: Neil Ghani, Patricia Johann
Venue: Journal of Functional Programming (2007)

Monads are commonplace programming devices that are used to uniformly structure computations; in particular, they are often used to mimic the effects of impure features such as state, error handling, and I/O. This paper further develops the monadic programming paradigm by investigating the extent to which monadic computations can be optimised by using generalisations of short cut fusion to eliminate monadic structures whose sole purpose is to glue together monadic program components. Ghani, Uustalu, and Vene have recently shown that every inductive type has an associated build combinator and an associated short cut fusion law. They have also used the notion of a parameterised monad to describe those monads that give rise to inductive types, and have shown that the standard augment combinators and cata/augment fusion rules for algebraic data types can be generalised to fixed points of all parameterised monads. We revisit these augment combinators and generalised short cut fusion rules for such types but consider them from a functional programming perspective, rather than a categorical one. In addition to making the category-theoretic ideas of Ghani, Uustalu, and Vene more easily accessible to a wider audience of functional programmers, we demonstrate their practical applicability by developing nontrivial application programs and performing modest benchmarking on them. We also show how the cata/augment rules can serve as the basis for deriving additional generic fusion laws, thus opening the way for an algebra of fusion. Finally, we offer deep theoretical insights, arguing that the augment combinators are monadic in nature, and thus that the cata/build and cata/augment rules are arguably the best generally applicable fusion rules obtainable.
Correction to November Issue
Venue: Computer (1977)

The spatial warp techniques illustrated in color photographs b-c- d-f on p. 63 of the November 1976 issue of Computer were incorrectly credited. 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
Differentiation of intramyocardial fluid pressure from fiber stress
Authors: Sina Y. Rabbany, J. Yasha Kresh, Abraham Noordergraaf
Venue: Technology and Health Care (1997)

To characterize the complex force field generated in the ventricular myocardium, intramyocardial pressure (IMP) measurement is used as an indirect means of assessing the distribution of regional wall stress. To resolve the long term confusion associated with this measurement, IMP is divided into its two dominant components&colon; intramyocardial fluid pressure (IFP) and intramyocardial fiber stress (IFS). The intramyocardial response to regional and global contractile function is examined in terms of changes in the magnitude and transmural gradient of IMP recording. The experimental results support the theoretical concept proposed where the hydraulic properties of the myocardium proved to have an influence on cardiac function. To gain a deeper understanding of myocardial function, cellular and subcellular components must be considered.
A Range-Difference Based Self-Positioning Scheme for Underwater Acoustic Sensor Networks
Authors: Xiuzhen Cheng, Haining Shu Haining Shu, Qilian Liang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, we present a silent positioning scheme termed as UPS for underwater acoustic sensor networks. UPS relies on the time-difference of arrivals measured locally at a sensor to detect range differences from the sensor to four anchor nodes. These range differences are averaged over multiple beacon intervals before they are combined to estimate the 3D sensor location through trilateration. UPS requires no time-synchronization and provides location privacy at underwater vehicles/sensors whose locations need to be determined. Simulation study on the position error of UPS under acoustic fading channels indicates that UPS is an effective scheme for underwater vehicle/sensor selfpositioning.
Testing Logic Networks and Designing for Testability
Authors: T. W. Williams
Venue: Computer (1979)

VLSI has brought exciting increases in circuit density and performance capability. But it has also aggravated the problem of chip, component and system testing. Here are some approaches to dealing with that problem.
Comparing the Power of Robots
Authors: Jason M. O'Kane, Steven M. Lavalle
Venue: International Journal of Robotics Research (2008)

Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing and actuation abilities are needed to complete a given task? Are some robot systems provably "more powerful", in terms of the tasks that they can complete, than others? Can we find meaningful equivalence classes of robot systems? This line of research is inspired by the theory of computation, which has produced similar results for abstract computing machines. Our basic contribution is a dominance relation over robot systems that formalizes the idea that some robots are stronger than others. This comparison, which is based on how the robots progress through their information spaces, induces a partial order over the set of robot systems. We prove some basic properties of this partial order and show that it is directly related to the robots' ability to complete tasks. We give examples to demonstrate the theory, including a detailed analysis of a limited-sensing global localization problem.
An Analysis of Database Watermarking Security
Authors: Julien Lafaye
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper, we study watermarking security [3] in the context of relational databases. As opposed to robustness which refers to the difficulty of removing an embedded mark without destroying the quality of the host content, security refers to the information that leaks about the secret from watermarked content. We identify two attack models, Multiple Keys Single Database and Single Key Multiple Databases as relevant attack models in which to study security of relational databases watermarking. Then, we provide a detailed analysis of watermarking security for the AHK [1] algorithm.
Beyond Ada 2005: allocating tasks to processors in SMP systems
Authors: A. J. Wellings, A. Burns
Venue: ACM SIGAda Ada Letters (2007)

Ada 2005 has added no new facilities to support applications that want to run on multiprocessor systems. Following the example set by Ada 95, the language facilitates multiprocessor implementations but provides no direct support for an application-controlled mapping of tasks to processors. Such partitioning is often required to obtain feasible real-time systems. This paper argues that multiprocessors systems are becoming so prevalent that the current position is no longer tenable. A proposal for minimal support is presented.
Discriminant Subspace Analysis: A Fukunaga-Koontz Approach
Authors: Sheng Zhang, Terence Sim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to the Fisher Criterion. Several methods of computing the FLD have been proposed in the literature, most of which require the calculation of the so-called scatter matrices. In this paper, we bring a fresh perspective to FLD via the Fukunaga-Koontz Transform (FKT). We do this by decomposing the whole data space into four subspaces with different discriminability, as measured by eigenvalue ratios. By connecting the eigenvalue ratio with the generalized eigenvalue, we show where the Fisher Criterion is maximally satisfied. We prove the relationship between FLD and FKT analytically, and propose a unified framework to understanding some existing work. Furthermore, we extend our our theory to Multiple Discriminant Analysis (MDA). This is done by transforming the data into intra- and extra-class spaces, followed by maximizing the Bhattacharyya distance. Based on our FKT analysis, we identify the discriminant subspaces of MDA/FKT, and propose an efficient algorithm, which works even when the scatter matrices are singular, or too large to be formed. Our method is general and may be applied to different pattern recognition problems. We validate our method by experimenting on synthetic and real data.
A Distributed System for Real-Time Transaction Processing
Authors: G. Le Lann
Venue: Computer (1981)

An experimental system designed as part of INRIA's Project Sirius, Delta implements a distributed executive for real-time transactional systems.
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Authors: Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Martini, Marko Jahnke, Jens Tolle
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identify nodes attempting to create a black hole. We use well-established techniques to gain knowledge about the network topology and use this knowledge to perform plausibility checks of the routing information propagated by the nodes in the network. We consider a node generating fake routing information as malicious. Therefore, we trigger an alarm if the plausibility check fails. Furthermore, we present promising first simulation results. With our new approach, it is possible to already detect the attempt to create a black hole before the actual impact occurs.
BCD and Radi x-2 Conversions
Authors: K. J. Breeding
Venue: IEEE Transactions on Computers (1971)

An algorithm for the conversion of BCD numbers to numbers in the -2 radix system is presented. This algorithm consists of simple arithmetic operations such as division by two and addition of the constants one and five. These operations may easily be performed in a -2 radix computer by shifting a number right for division by two and a table look-up procedure for the additions. The reverse conversion is also briefly discussed
Product Line Approach to Role-Based Middleware Development for Ubiquitous Sensor Network
Authors: Woojin Lee, Sungwon Kang, Dan Hyung Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Currently sensor network middlewares are developed so that they include all functionalities for various nodes. Since sensor network nodes usually operate with limited resources, it is desirable for them to have middlewares that have only the functionalities necessary to perform their roles. This paper proposes a systematic method for developing sensor network middleware using the product line approach In this method, functionalities of the sensor network middleware common to all nodes and functionalities specific to the different roles of nodes are carefully separated and grouped so that nodes with different roles have different middlewares that are specialized to their roles but minimally consumes the resources.
Interval + Communications = Walsh: For signal multiplexing under interval uncertainty, Walsh functions are optimal
Authors: Rami Al-Jamal, Samir Manoli, Alejandro E. Brito, Olga Kosheleva
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

In communications, often, statistical characteristics of the noise vary so much that, in essence, we can only have interval estimates for this noise. We show that under this interval uncertainty, the optimal multiplexing technique consists of using Walsh functions. This result provides a new theoretical explanation for the success of Walsh-based multiplexing techniques which are actively used in cellular phones and in other types of wireless communication.
A Feedback Negative Selection Algorithm to Anomaly Detection
Authors: Jinquan Zeng, Tao Li, Xiaojie Liu, Caiming Liu, Lingxi Peng, Feixian Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Negative selection algorithm (NSA) lacks adaptability and needs a large number of self elements to build the profile of the system and train detectors. In order to overcome these limitations and build an appropriate profile of the system in a varying self and nonself condition, this paper presents a feedback negative selection algorithm, which is referred to FNSA algorithm, and its applications to anomaly detection. The proposed approach uses the feedback technique, which adjusts the self radius of self elements, the detection radius of detectors and the number of detectors, to adapt the varieties of self/nonself space and build the appropriate profile of the system based on some of self elements. Furthermore, the approach can increase the accuracy in solving the anomaly detection problem. To determine the performance of the approach, the experiments with well-known dataset were performed and compared with other works reported in the literature. Results exhibited that our proposed approach outperforms the previous techniques.
Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory
Authors: C. Reischer, D. A. Simovici
Venue: IEEE Transactions on Computers (1971)

A class of linear algebraic structures over the set of Boolean functions is presented. Afterwards, from these structures a new one is studied the right-weak algebra. By using the properties of this algebra, some new results are established about the commutativity of the superposition, the ideals, the annulators, and the properties of the iteration.
Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm
Authors: Yingzi Wei, Yulan Hu, Kanfeng Gu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Traditional genetic algorithms often meet the occurrence of slow convergence and enclosure competition. We present a parallel algorithm for the traveling salesman problem (TSP) which incorporates several greedy heuristics based on genetic algorithms. We call this algorithm the greedy genetic algorithm (GGA) here. The ideas we incorporate in our algorithm include: (i) generating the initial population using the gene bank; (ii) double-directional greedy crossover and the local searches of greedy mutation; (iii) special-purpose immigrations to promote diversity of population and an open competition; (iv) stepwise parallel optimization of each individual of the population; (v) developing an overall design that attempts to strike a right balance between diversification and a bias towards fitter individuals. We test all these ideas to assess their impacts on the GGA performance, and also compare our final algorithm to the simple genetic algorithm on the benchmark instances in TSPLIB, a well-known library of TSP instances. We find the greedy genetic algorithm to be a very effective and robust algorithm for TSPs.
A Survey of Standards and Proposed Metrics for Software Quality Testing
Authors: J. B. Bowen
Venue: Computer (1979)

Military standards now contain detailed requirements for software quality. The metrics and techniques described here are being used to evaluate readiness for acceptance testing. 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
Multiple-step-ahead prediction in control systems with Gaussian process models and TS-fuzzy models
Authors: Rainer Palm
Venue: Engineering Applications of Artificial Intelligence (2007)

In this paper one-step-ahead and multiple-step-ahead predictions of time series in disturbed open loop and closed loop systems using Gaussian process models and TS-fuzzy models are described. Gaussian process models are based on the Bayesian framework where the conditional distribution of output measurements is used for the prediction of the system outputs. For one-step-ahead prediction a local process model with a small past horizon is built online with the help of Gaussian processes. Multiple-step-ahead prediction requires the knowledge of previous outputs and control values as well as the future control values. A ''naive'' multiple-step-ahead prediction is a successive one-step-ahead prediction where the outputs in each consecutive step are used as inputs for the next step of prediction. A global TS-fuzzy model is built to generate the nominal future control trajectory for multiple-step-ahead prediction. In the presence of model uncertainties a correction of the so computed control trajectory is needed. This is done by an internal feedback between the two process models. The method is tested on disturbed time invariant and time variant systems for different past horizons. The combination of the TS-fuzzy model and the Gaussian process model together with a correction of the control trajectory shows a good performance of the multiple-step-ahead prediction for systems with uncertainties.