ppxscal/embedding_network huggingface dataset:
A Proposed Radix- and Word-length-independent Standard for Floating-point Arithmetic
Authors: W. Cody, J. Coonen, D. Gay, K. Hanson, D. Hough, W. Kahan, R. Karpinski, J. Palmer, F. Ris, D. Stevenson
Venue: IEEE Micro (1984)

Besides making the proposed IEEE 854 standard available for comment, this article explains how to overcome some of its implementation problems.
Non-Linear Vibrational Normal Modes of Biomolecules
Authors: Stavros C. Farantos
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The vibrational harmonic normal modes of a molecule, which are valid at relatively low energies close to a potential minimum, are extended by periodic orbits to higher energies where anharmonicity and coupling of the degrees of freedom set in. The families of periodic orbits which emanate from the equilibria (minima and transition states) of a molecular potential energy function are located with multiple shooting methods and they are continued in energy. The method is well established for triatomic molecule.^, and recently it has been applied to biomolecules such as alanine dipeptide. Long lived localized trajectories associated with specijic conformations and non-linear vibrational modes can be traced. The influence of a solvent like water to excited non-linear normal modes is examined.
A Fast and Stable Penalty Method for Rigid Body Simulation
Authors: Evan Drumwright
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Two methods have been used extensively to model resting contact for rigid body simulation. The first approach, the penalty method, applies virtual springs to surfaces in contact to minimize interpenetration. This method, as typically implemented, results in oscillatory behavior and considerable penetration. The second approach, based on formulating resting contact as a linear complementarity problem, determines the resting contact forces analytically to prevent interpenetration. The analytical method exhibits expected-case polynomial complexity in the number of contact points, and may fail to find a solution in polynomial time when friction is modeled. We present a fast penalty method that minimizes oscillatory behavior and leads to little penetration during resting contact; our method compares favorably to the analytical method with regard to these two measures, while exhibiting much faster performance both asymptotically and empirically.
Ajax Frameworks in Interactive Web Apps
Authors: Nicolás Serrano, Juan Pablo Aroztegi
Venue: IEEE Software (2007)

Since 2005, developers have used Ajax to let users interact with Web applications much as they do with desktop applications. But the Ajax features represented in applications such as Google Maps, Netvibes, and Zimbra Collaboration Suite demand detailed coding. Ajax frameworks are utility sets that make it easier to develop and maintain these applications.
Multiprocessing: An Annotated Bibliography
Authors: M. Satyanarayanan
Venue: Computer (1980)

The years since the advent of multiprocessing have witnessed the proliferation of journal articles, conferences, and symposia on multiprocessing systems and closely related topics. The body of literature so generated is both vast and scattered-a situation that can be quite disheartening to one unfamiliar with this area of computer science.
In the News
Authors: Mark Ingebretsen, Maya Dollarhide
Venue: IEEE Intelligent Systems (2007)

The first news story, "Intelligent Tutors Make the Grade," looks at ASSISTment, Tactical Iraqi, and Robot-Hosting—three systems that provide customized assistance to students. The second news story, "The Rise of Self-Aware Robots," reports on the Starfish robot, which learns about itself and uses that knowledge to operate and self-correct when injured.
The Ada Environment: A Perspective
Authors: V. Stenning
Venue: Computer (1981)

Can the Ada environment meet the goals of the DoD high-order language effort? The approach described here promises to be both practical and cost-effective.
Toward a theory of evolution strategies: Some asymptotical results from the (1,+ λ)-theory
Authors: Hans-Georg Beyer
Venue: Evolutionary Computation (1993)

A method for the determination of the progress rate and the probability of success for the Evolution Strategy (ES) is presented. The new method is based on the asymptotical behavior of the χ-distribution and yields exact results in the case of infinite-dimensional parameter spaces. The technique is demonstrated for the (l,+ λ) ES using a spherical model including noisy quality functions. The results are used to discuss the convergence behavior of the ES.
Proceedings of the 2007 workshop on Engineering fault tolerant systems
Venue: Foundations of Software Engineering (2007)

Software and hardware systems have become increasingly used in many industrial sectors, such as manufacturing, energy supply, aerospace, transportation, communication and healthcare. Failures due to software or hardware malfunctions, users' mistakes and malicious intentions can have serious economics consequences, and can also endanger human life. Fault tolerance prevents system failures and is intended to ensure that it delivers the required service in spite of faults and errors which it might encounter and as such it is crucial for meeting high reliability and availability requirements. Fault tolerance engineering during the entire life cycle has been advocated by some researchers as one of the main approaches to ensuring the overall system dependability. In particular, different classes of faults, errors and failures must be identified and dealt with at each phase of software development, depending on the abstraction level used in modelling the software system under development. A number of studies have been conducted so far in these areas, but understanding where and how fault-tolerance should be integrated in the software life-cycle still requires major research efforts. This international workshop builds on this trend and aims at investigating how fault tolerance mechanisms can be taken into account when engineering complex software systems. To address the new problems the system developers are facing nowadays (such as identifying the places where fault tolerance means must be applied and the degree of fault tolerance that must be achieved) we need novel models to be applied at different abstraction levels (requirement, architecture and design models for fault tolerance, together with new implementation schemes), innovative technologies (tools and frameworks for implementing distributed fault tolerant systems) and advanced verification environments (to assess the achieved level of fault tolerance and to evaluate the dependability properties of the systems). Recently there has been growing interest in the areas directly related and overlapping with fault tolerance, such as system self-healing, resilience, self-adaptation and self-management. The topics related to engineering of systems with such properties are in the scope of the workshop as the intention is to improve the current understanding of how fault tolerance engineering can benefit from research on these areas. EFTS 2007 is the appropriate venue to reflect on the achievements of the researchers and practitioners in the fields of software engineering and fault tolerance, bringing together people from these two communities.
Protein Classification Using Artificial Neural Networks with Different Protein Encoding Methods
Authors: Andre Luis Debiaso Rossi
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The fast growth of annotated biological data implies in the need of developing new techniques and tools to clas- sify these data, in such way that they can be useful. Pro- tein classification is one relevant task in this context. This paper presents different models of neural network, aiming to compare the influence of the protein sequence encoding method in the performance of the Neural network to clas- sify proteins. Besides, it is proposed two methods of protein sequence encoding, that were tested with several neural net- work, for classifying proteins using two approaches: based on families of proteins and based on function of proteins. The results of performance of the neural networks are pre- sented and compared with other works in the area.
Kernel shapes of fuzzy sets in fuzzy systems for function approximation
Authors: Qiang Luo, Wenqiang Yang, Dongyun Yi
Venue: Information Sciences: an International Journal (2008)

The shapes of if-part fuzzy sets affect the approximating capability of fuzzy systems. In this paper, the fuzzy systems with the kernel-shaped if-part fuzzy sets are built directly from the training data. It is proved that these fuzzy systems are universal approximators and their uniform approximation rates can be estimated in the single-input-single-output (SISO) case. On the basis of these rates, the relationships between the approximating capability and the shapes of if-part fuzzy sets are developed for the fuzzy systems. Furthermore, the sinc functions that serve as input membership functions are proved to have the almost best approximation property in a particular class of membership functions. The theoretical results are confirmed from the simulation data. In addition, the estimations of the uniform approximation rates are extended to the multi-input-single-output (MISO) case.
Basic Observables for Probabilistic May Testing
Authors: Maria Carla Palmeri, Rocco De Nicola, Mieke Massink
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

The definition of behavioural preorders over process terms as the maximal (pre-)congruences induced by basic observables has proven to be a useful technique to define various preorders and equivalences in the non-probabilistic setting. In this paper, we consider probabilistic observables to define an observational semantics for a probabilistic process calculus. The resulting pre-congruence is proven to coincide with a probabilistic may preorder, which, in turn, corresponds to a natural probabilistic extension of the may testing preorder of De Nicola and Hennessy.
Modeling Spin-Polarized Electron Transport in Semiconductors for Spintronics Applications
Authors: Simon Kos, Marina Hruska, Scott A. Crooker, Avadh Saxena, Darryl L. Smith
Venue: Computing in Science and Engineering (2007)

A primary goal in semiconductor spintronics is to develop a new generation of functional devices that exploit not only an electron's charge (as in today's electronics industry) but also its spin. The authors show how a system of coupled spin drift-diffusion equations can accurately model spin-polarized electron transport in semiconductors. Numerical solutions allow for direct and quantitative comparison with experimental imaging data.
Mining Frequent Ordered Patterns without Candidate Generation
Authors: Cong-Rui Ji, Zhi-Hong Deng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Mining frequent patterns is an important data mining task and has been widely studied. However, the traditional frequent pattern mining does not involve the ordered problem, which is widely exists in the real world. A lot of papers have been proposed to solve the ordered problem, including sequential pattern mining, item sequences mining, temporal feature extraction, web log study and ordered patterns mining. Most of these papers used an APRIORI-based algorithm hence did not adopt the wonderful ideas and advanced technologies in traditional frequent patterns mining. This paper introduced a data structure called FOP-tree which is a modified version of FP-tree to solve the ordered patterns mining. The performance study shows that the FOP-tree is efficient and scalable for mining both long and short frequent ordered patterns, and is much faster than the traditional APRIORI-bases algorithms on several situations.
Connectivity Compression for Stripified Triangle Meshes Using Basic Strips
Authors: Hao Huang, Fan Zhou
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents a new triangle meshes compression algorithm, which encodes connectivity information between vertex chains in the meshes that are already stripified. The algorithm builds up basic strips based on the vertex chains of the original strips at first. The information of redundant edges is implicit hence the only information need to encode is about absent edges. The proposed algorithm provides a new representation that is guaranteed to encode connectivity information of any meshes in less than 2 bits/T, and in 1.2 bits/T on average in the experiment results using FTSG. In the experiments, the method was proved to have good performance.
Multiuser detection with neural network and PIC in CDMA systems for AWGN and Rayleigh fading asynchronous channels
Authors: Yalçın Işık, Necmi Taşpınar
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, multiuser detection in code division multiple access (CDMA) was performed by using neural network (NN) and parallel interference cancellation (PIC). Neural network is used as a front-end stage of one stage PIC circuit. PIC is a classical technique in multi user detection process and its bit error rate (BER) performance is not good in one stage for most of the applications. For improving its BER performance, generally multi stage PIC which has high computational complexity is used. In this study, we have got better BER performance than the three stage PIC receiver in AWGN channel, almost same BER performance with the three stages PIC receiver in the Rayleigh fading channel.
A framework for detection and measurement of phishing attacks
Authors: Sujata Garera, Niels Provos, Monica Chew, Aviel D. Rubin
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

Phishing is form of identity theft that combines social engineering techniques and sophisticated attack vectors to harvest financial information from unsuspecting consumers. Often a phisher tries to lure her victim into clicking a URL pointing to a rogue page. In this paper, we focus on studying the structure of URLs employed in various phishing attacks. We find that it is often possible to tell whether or not a URL belongs to a phishing attack without requiring any knowledge of the corresponding page data. We describe several features that can be used to distinguish a phishing URL from a benign one. These features are used to model a logistic regression filter that is efficient and has a high accuracy. We use this filter to perform thorough measurements on several million URLs and quantify the prevalence of phishing on the Internet today
Line flow contingency selection and ranking using cascade neural network
Authors: Rajendra Singh, Laxmi Srivastava
Venue: Neurocomputing (2007)

Line flow or real-power contingency selection and ranking is performed to choose the contingencies that cause the worst overloading problems. In this paper, a cascade neural network-based approach is proposed for fast line flow contingency selection and ranking. The developed cascade neural network is a combination of a filter module and a ranking module. All the contingency cases are applied to the filter module, which is trained to classify them either in critical contingency class or in non-critical contingency class using a modified BP algorithm. The screened critical contingencies are passed to the ranking module (four-layered feed-forward artificial neural network (ANN)) for their further ranking. Effectiveness of the proposed ANN-based method is demonstrated by applying it for contingency screening and ranking at different loading conditions for IEEE 14-bus system. Once trained, the cascade neural network gives fast and accurate screening and ranking for unknown patterns and is found to be suitable for on-line applications at energy management centre.
Cache Invalidation Strategies for Mobile Ad Hoc Networks
Authors: Wenzhong Li, Edward Chan, Yilin Wang, Daoxu Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Cache invalidation is an important issue in mobile caching and has received much attention by researchers. However most existing studies on cache invalidation strategies are limited to cellular wireless networks in which the mobile terminals can communicate with the base stations directly. In this paper, we address the seldom studied issue of cache invalidation in mobile ad hoc networks(MANETs), where the use of multi-hop communications poses serious challenges.We propose three cache invalidation strategies for MANETs. The three methods, namely pull on demand (POD), modified amnesic terminals (MAT) and pull-based amnesic terminals (PAT) are adapted from Barbara and Imielinski's classic cache invalidation schemes [1] to handle the special requirements of MANETs. Both analytical results as well as simulation experiments are used to examine the performance of these three schemes, and it is shown that PAT provides the best overall performance.
Grid data management systems & services
Authors: Arun Jagatheesan, Reagan Moore, Norman W. Paton, Paul Watson
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The Grid is an emerging infrastructure for providing coordinated and consistent access to distributed, heterogeneous computational and information storage resources amongst autonomous organizations. Data grids are being built across the world as the next generation data handling systems for sharing access to data and storage systems within multiple administrative domains. A data grid provides logical name spaces for digital entities and storage resources to create global identifiers that are location independent. Data grid systems provide services on the logical name space for the manipulation, management, and organization of digital entities. Databases are increasingly being used within Grid applications for data and metadata management, and several groups are now developing services for the access and integration of structured data on the Grid. The service-based approach to making data available on the Grid is being encouraged by the adoption of the Open Grid Services Architecture (OGSA), which is bringing about the integration of the Grid with Web Service technologies. The tutorial will introduce the Grid, and examine the requirements, issues and possible solutions for integrating data into the Grid. It will take examples from current systems, in particular the SDSC Storage Resource Broker and the OGSA-Database Access and Integration project.
No more HotDependencies: toward dependency-agnostic online upgrades in distributed systems
Authors: Tudor Dumitras, Jiaqi Tan, Zhengheng Gho, Priya Narasimhan
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Traditional approaches for online upgrades of distributed systems rely on dependency tracking to preserve system integrity during and after the upgrade. Because dependency reification can become intractable, we aim to enforce the isolation of the old and new versions during the upgrade. We achieve this by installing the new version in a "parallel universe" - a separate physical or virtual infrastructure that does not communicate directly with the old version. This allows our upgrading middleware to treat the complex IT infrastructure as a black box with unknown hidden-dependencies, and to validate the upgrade by cross-checking the outputs of the two universes.
Minimization of Download Times for Large Files over Wireless Channels
Authors: Enzo Baccarelli, Mauro Biagi, Nicola Cordeschi, Cristian Pelizzoni
Venue: IEEE Transactions on Mobile Computing (2007)

The emerging proxy-based wireless Content Delivery Networks (CDNs) should to be designed to download hugesize files over fading-affected channels. However, from a radio resource management point of view, several basic problems need to be still solved for such wireless delivery systems to operate efficiently. Specifically, due to the fading nature of the downlink channel, a still open basic problem is to design optimal energyallocation (e.g., scheduling) policies that minimize the requested download-time when constraints on the total available energy and peak-energy are simultaneously active. In this contribution, this problem is solved for application scenarios where the downlink channel is slotted and continuous-state, the carried out traffic is elastic and the resulting conveyed throughput is measured by any desired increasing concave rate-function. Specifically, the optimal energy-allocation policy minimizing the download-time is computed in closed-form and its performance is compared against that of a basic On-Off heuristic energy-scheduler on some Rayleigh-faded Multi-Antenna delivery systems of practical interest. The carried-out performance comparisons point out that the presented optimal policy typically may outperform the heuristic one up to two-orders of magnitude, specially when the delivery system is strongly energy-limited.
Medical Segmentation Using Sobolev Optical Flow
Authors: Yang Yu, Hong Zhao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In Computer Aided Detection (CAD) of the pulmonary nodules, automated analysis of nodules within the complex background of anatomic structures is extremely challenging for clinicians. The identification of the lung structures is the initial stage in CAD for improving the detection sensitivity. This paper presents a novel automated lung segmentation method for nodule detection from CT images, using the information provided about motion of the tissue within the lung and pulmonary boundaries. A deformable image registration technique, optical flow, is used to detect the structures in magnitude to difference between two adjacent slices from a CT scan. Recent research has shown that L2 -type inner product introduces a pathological Riemannian metric on the space of smooth curves. Consequently, we refine our optical flow constraint in Sobolev metrics, which induce favorable regularity properties in gradient flows. Tests with real medical images demonstrate the method and its implementation.
Over the Horizon
Authors: C. Adams
Venue: Computer (1976)

If there was a line of continuity throughout the various sessions of the Computer Elements Technical Committee meeting last June in Vail, Colorado, it was that we are entering a period of technology consolidation. Advances foreseen in the near future are predicted to be extensions of areas of application utilizing existing technologies. The stated need for higher speed or more powerful technologies was only obvious at this meeting by its absence. 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