ppxscal/embedding_network huggingface dataset:
Fast evaluation of neural networks via confidence rating
Authors: Jerónimo Arenas-García, Vanessa Gómez-Verdejo, Aníbal R. Figueiras-Vidal
Venue: Neurocomputing (2007)

Neural networks have become very useful tools for input-output knowledge discovery. However, some of the most powerful schemes require very complex machines and, thus, a large amount of calculation. This paper presents a general technique to reduce the computational burden associated with the operational phase of most neural networks that calculate their output as a weighted sum of terms, which comprises a wide variety of schemes, such as Multi-Net or Radial Basis Function networks. Basically, the idea consists on sequentially evaluating the sum terms, using a series of thresholds which are associated with the confidence that a partial output will coincide with the overall network classification criterion. Furthermore, we design some procedures for conveniently sorting out the network units, so that the most important ones are evaluated first. The possibilities of this strategy are illustrated with some experiments on a benchmark of binary classification problems, using RealAdaboost and RBF networks, which show that important computational savings can be achieved without significant degradation in terms of recognition accuracy.
Benchmarks on tera-scalable models for DNS of turbulent channel flow
Authors: J. Xu
Venue: Parallel Computing (2007)

Due to the extensive requirements of memory and speed for direct numerical simulation (DNS) of channel turbulence, people could only perform DNS at moderate Reynolds number before. However, with the fast development of supercomputers, it has become more and more approachable for researchers to perform DNS of turbulence at high Reynolds number. This makes it imperative to consider the development of tera-scalable DNS codes that are capable of fully exploiting these massively parallel machines. In order to achieve this, three parallel models (1D, 2D and 3D decompositions) have been implemented and benchmarked. All these models have been successfully ported on BlueGene/L. We have benchmarked these models on BG/L at ANL and BGW at IBM Watson center. Details of these models have been described, discussed and presented in this paper. The optimized model can be used to perform DNS at high Reynolds number in the near future.
An Approach to Integration Testing of Object-Oriented Programs
Authors: Zhe (Jessie) Li, Tom Maibaum
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Object-oriented programming has some unique features which facilitate software reuse and component-based de- velopment. However, testing object-oriented programs us- ing only traditional techniques is unlikely to find the faults caused by these features. The problem is that few integra- tion testing techniques have been systematically studied or defined. We present a novel approach to generate and exe- cute test cases for object-oriented programs from UML di- agrams. We have designed an approach to implement test cases using the concept of Coordination Contract. A Coor- dination Contract, related to the idea of the active associ- ation class in UML, defines connections among a group of objects without interfering with their implementations. By using the contract, test case generation and execution can be completed automatically. A prototype tool has been de- veloped to automatically derive the contracts based on the mechanism of test case generation mentioned above.
Into the 80's with Microcomputer-Based Learning
Authors: R. M. Aiken
Venue: Computer (1980)

The ultimate success of microcomputer-based learning will depend on a convincing proof of its effectiveness.
State Reduction in Incompletely Specified Finite-State Machines
Authors: C. P. Pfleeger
Venue: IEEE Transactions on Computers (1973)

The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques-state assignment to the DON'T CARE entries, and so-called "state splitting"-are investigated. For both of the techniques, the question, "Can I achieve an equivalent k state machine?" is shown to be polynomial complete, with the resulting conjecture that neither is solvable in time bounded by a polynomial function of the size of the machine.
A taxonomy of ubiquitous computing applications
Authors: Nam Joo Jeon, Choon Seong Leem, Min Hyung Kim, Hyoun Gyu Shin
Venue: Wireless Personal Communications: An International Journal (2007)

Ubiquitous computing is emerging as a new paradigm in next-generation information technology. This new paradigm has been embodied into tremendous business models and applications through lots of ubiquity-related technologies. In this study, a new taxonomy for these business applications and technologies is suggested. In order to prove the practical values, two case applications of the taxonomy are conducted. In the cases, 24 ubiquitous computing services and 19 ubiquitous computing projects are classified so that the status quo of ubiquitous computing is analyzed.
Efficient computation of view subsets
Authors: Frank Dehne, Todd Eavis, Andrew Rau-Chaplin
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

Over the past ten to fifteen years, data warehouse platformshave grown enormously, both in terms of their importance and their sheer size. Traditionally, such systems have been based upon a dimensional model known as the Star Schema that consists of a central fact table and a series of related dimension tables. Given the enormous size of the fact table, virtually all current systems augment the primary fact table with a small number of focused summary tables. Previous research has addressed the issue of the selection or identification of the most cost-effective summaries. However, the problem of efficiently computing a given view subset has received far less attention. In this paper, we present a suite of greedy algorithms for the construction of these view subsets. Experimental results demonstrate cost savings of between 20% and 70% relative to the naive alternatives, depending upon the degree of materialization required.
Computing and the Handicapped
Authors: P. L. Hazan
Venue: Computer (1981)

The United Nations has designated 1981 the International Year for Disabled Persons. It is therefore appropriate that Computer is dedicating its first issue of the year to computing and the handicapped. The evolution of lowcost computing technology promises an unprecedented spectrum of opportunities for the developmentally disabled. From aids to independent living to flexible tools that can greatly increase the variety and quality of job opportunities, the rapidly evolving field of computing is pregnant with possibilities. To help turn these possibilities to reality, Johns Hopkins University is conducting a national search/contest in applications of computers for the handicapped.
Formal analysis techniques for gossiping protocols
Authors: Rena Bakhshi, Francois Bonnet, Wan Fokkink, Boudewijn Haverkort
Venue: ACM SIGOPS Operating Systems Review (2007)

We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them.
Timing optimization by restructuring long combinatorial paths
Authors: Jürgen Werber, Dieter Rautenbach, Christian Szegedy
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We show how to adapt this algorithm to logic optimization for timing correction at late stages of VLSI physical design and report experimental results on recent industrial chips. By restructuring long critical paths, our code achieves worst-slack improvements of up to several hundred picoseconds on top of traditional timing optimization techniques.
FastRoute 2.0: A High-quality and Efficient Global Router
Authors: Min Pan, C. Chu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Because of the increasing dominance of interconnect issues in advanced IC technology, it is desirable to incorporate global routing into early design stages to get accurate interconnect information. Hence, high-quality and fast global routers are in great demand. In this paper, we propose two major techniques to improve the extremely fast global router, FastRoute (Pan and Chu, 2006) in terms of solution quality : (1) monotonic routing, (2) multi-source multi-sink maze routing. The new router is called FastRoute 2.0. Experimental results show that FastRoute 2.0 can generate high-quality routing solutions with fast runtime compared with three state-of-the-art academic global routers FastRoute, Labyrinth (Kastner et al., 2000) and Chi Dispersion router (Hadsell and Madden, 2003). On the set of benchmarks used in Pan and Chu, 2006 and Hadsell and Madden (2003), the total overflow of FastRoute 2.0 is 98, compared to 1012 (FastRoute), 2846 (Labyrinth) and 1271 (Chi Dispersion Router). The runtime of FastRoute 2.0 is 73% slower than FastRoute, but 78times and 37times faster than Labyrinth and Chi Dispersion router. The promising results make it possible to integrate global routing into early design stages. This could dramatically improve the design solution quality.
Estimating the Fault Coverage of Functional Test Sequences Without Fault Simulation
Authors: Irith Pomeranz, Praveen K. Parvathala, Srinivas Patil
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Functional test sequences were shown to detect defects that are not detected by structural tests. They also help in avoiding overtesting. However, fault simulation to compute the stuck-at fault coverage of functional test sequences can be time consuming especially in applications where a large number of test sequences need to be evaluated and compared. To obtain fast yet accurate estimates of the stuck-at fault coverages of functional test sequences, we describe a fault coverage metric based only on logic simulation of the gate level circuit. The metric is based on the set of states that the circuit traverses under the test sequence. We define several versions of the metric suitable for different applications. We present experimental results demonstrating the effectiveness of the metric for ranking of test sequences based on their fault coverage.
Applying Biclustering to Perform Collaborative Filtering
Authors: Fabricio O. de Franca, Hamilton M. Ferreira, Fernando J. Von Zuben
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Collaborative filtering (CF) is a method to perform automated suggestions for a user based on the opinion of other users with similar interest. Most of the CF algorithms do not take into account the existent duality between users and items, considering only the similarities between users or only the similarities between items. In this paper we propose a novel methodology for the CF capable of dealing with this situation. By proposing an immune-inspired biclustering technique to carry out clustering of rows and columns at the same time, our algorithm is able to group similarities between users and items. In order to evaluate the proposed methodology, we have applied it to MovieLens dataset which contains user's ratings to a large set of movies. The results indicate that our proposal is able to provide useful recommendations for the users, outperforming other methodologies for CF reported in the literature.
A Parallel Framework for Interactive Rendering of Massive Complex Scenes on PCs Cluster
Authors: Xiaohong Jiang, Kaibin Lei, Hua Xiong, Yan Li, Jiaoying Shi
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper present a parallel framework for interactively rendering massive complex scenes on PCs cluster. The framework integrates parallel rendering, scene graph, software acceleration techniques, and out-of-core data management. We propose a novel parallel rendering architecture based on dynamic rendering team and hybrid rendering pipeline to balance work load and to handle different graphics primitive distribution. A unified scene graph representation is designed for flexible object manipulation in upper applications and efficient rendering in lower rendering pipeline. We present a priority-based out-of-core data management scheme which guarantees fixed memory footprint and data scheduling efficiency. We have implemented this framework and developed two applications to test its performance on a cluster of 32 PCs: a walkthrough application for massive complex scenes and a distributed multi-player video game.
QoS of Timeout-based self-Tuned Failure Detectors in iSCSI
Authors: Guang Yang, JinLi Zhou, Gang Liu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Unreliable failure detectors have been an important abstraction to build dependable communication applications over iSCSI storage systems subject to faults. Their implementations are commonly based on timeouts to ensure iSCSI processes termination. However, for systems built on the Internet, it is hard to estimate this time value because traffic variations. In order to increase the quality of service (QoS), selftuned failure detectors dynamically adapt their timeouts to the communication delay behavior added of a safety margin. In this paper, we evaluate the QoS of a failure detector for predictor and safety margins in iSCSI storage system. As the results show, to improve the QoS, we must consider the relation between the pair predictor-margin. Furthermore, performance and accuracy requirements should be considered for a suitable relationship.
The EasyCRC Tool
Authors: Assaf Raman, Shmuel Tyszberowicz
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

CRC cards are an informal approach to object oriented modeling, used to represent the responsibilities of classes and the interaction between the classes. They are created through white-box scenarios that model the behavior of the system. Sequence diagrams are the most popular UML artifact for scenarios modeling. Though closely related, the CRC cards methodology is not supported by most UML modeling tools, and tools that support CRC cards do not support UML diagrams. This paper presents EasyCRC, a tool that combines sequence diagrams with CRC cards, originally written to teach the object-oriented paradigm.
Optimization of kinetic energy of a micro-object by impulse fields
Authors: D. S. Zavalishchin, S. T. Zavalishchin
Venue: Automation and Remote Control (2007)

The generalization is performed of the Schrodinger equation for the kinetic energy of a micro-object to potential fields with the structure of distribution of the first order of singularity. This made it possible to solve the problem of minimization of the kinetic energy of a micro-object at the prescribed level of its observation in the class of potentials concentrated in a limited volume with a smooth surface. It was found that the singular component of the optimal potential is a simple layer concentrated at the volume boundary. Graphs are displayed of some affine transformations of the squares of optimal wave functions and appropriate potentials.
Methodology for the Generation of Program Test Data
Authors: W. E. Howden
Venue: IEEE Transactions on Computers (1975)

A methodology for generating program test data is described. The methodology is a model of the test data generation process and can be used to characterize the basic problems of test data generation. It is well defined and can be used to build an automatic test data generation system.
Solutions of Sturm-Liouville boundary value problems for higher-order differential equations
Authors: Yuji Liu
Venue: Journal of Applied Mathematics and Computing (2007)

The existence of solutions of a class of two-point boundary value problems for higher order differential equations is studied. Sufficient conditions for the existence of at least one solution are established. It is of interest that the nonlinearity f in the equation depends on all lower derivatives, and the growth conditions imposed on f are allowed to be super-linear (the degrees of phases variables are allowed to be greater than 1 if it is a polynomial). The results are different from known ones since we don't apply the Green's functions of the corresponding problem and the method to obtain a priori bound of solutions are different enough from known ones. Examples that can not be solved by known results are given to illustrate our theorems.
Completely Periodic Multithreshold Functions
Authors: G. C. Sethares
Venue: IEEE Transactions on Computers (1970)

A class of Boolean functions arising naturally from a consideration of the periodicities of multithreshold functions is defined and the basic properties of these functions, the completely periodic functions, are determined. The observation that this class is invariant under the group of affine transformations allows for a tabulation of the completely periodic functions of up to four variables. Finally, bounds on the number of completely periodic functions of n variables are determined.
Packing d-degenerate graphs
Authors: Béla Bollobás, Alexandr Kostochka, Kittikorn Nakprasit
Venue: Journal of Combinatorial Theory Series B (2008)

We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollobas-Eldridge-Catlin Conjecture holds in a considerably stronger form if one of the graphs is d-degenerate for d not too large: if d,@D"1,@D"2>=1 and n>max{40@D"1ln@D"2,40d@D"2} then a d-degenerate graph of maximal degree @D"1 and a graph of order n and maximal degree @D"2 pack. We use this result to show that, for d fixed and n large enough, one can pack n1500d^2 arbitrary d-degenerate n-vertex graphs of maximal degree at most n1000dlnn.
Efficient handling of sensor failures
Authors: Andreea Berfield, Panos K. Chrysanthis, Alexandros Labrinidis
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

Sensors provide unprecedented access to a wealth of information from the physical environment in real-time. However, they suffer from a variety of resource limitations, most importantly power consumption and communication bandwidth. Additionally, environmental conditions can contribute to sensor failures, disrupting the flow of query results. In this paper, we propose new techniques to deal with sensor failures based on the principles of partition and single path redundancy. Our experimental results confirm the efficiency of our techniques with respect to different performance metrics in general, and, in particular, high quality of data.
Toward Spotting the Pedophile Telling victim from predator in text chats
Authors: Nick Pendar
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents the results of a pilot study on using automatic text categorization techniques in identifying online sexual predators. We report on our SVM and k-NN models. Our distance weighted k-NN classifier reaches an f-measure of 0.943 on test data distinguishing the child and the victim sides of text chats between sexual predators and volunteers posing as underage victims.
Lot release times and dispatching rule for a TFT-LCD cell process
Authors: J. T. Lin, F. K. Wang, C. C. Peng
Venue: Robotics and Computer-Integrated Manufacturing (2008)

In this paper, the simulation analysis of the cell process in a thin film transistor-liquid crystal display (TFT-LCD) manufacturing was analyzed, and the effects of the lot release times and dispatching rule were considered. Discrete-event simulation models were developed in an e-M Plant to study this system. The lot release times and dispatching rule based on minimum setup times was used in this system. In order to improve the system performance, a heuristic algorithm for lot release times and a queue time maximum un-matches (QTMU) dispatching rule for rubbing machines are proposed. The simulation results revealed a substantial improvement of the cell process performance and reduced the setup times for the rubbing machine and the cycle time of TFT-array substrate and color filter (CF) substrate processing.
CADS: continuous authentication on data streams
Authors: Stavros Papadopoulos, Yin Yang, Dimitris Papadias
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider (SP), together with additional authentication information. Clients register continuous range queries to the SP. Whenever the data change, the SP must update the results of all affected queries and inform the clients accordingly. The clients can verify the correctness of the results using the authentication information provided by the DO. Compared to conventional databases, stream environments pose new challenges such as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no missing results in between updates. We face these challenges through several contributions. Since there is no previous work, we first present a technique, called REF, that achieves correctness and temporal completeness but incurs false transmissions, i.e., the SP has to inform clients whenever there is a data update, even if their results are not affected. Then, we propose CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. Finally, we extend CADS to the case where multiple owners outsource their data to the same SP. The SP integrates all data in a single authentication process, independently of the number of DOs.
New Applications & Recent Research
Authors: D. Michalopoulos
Venue: Computer (1981)

An experimental IBM computer circuit, with switching speeds faster than emitter-coupled logic, but with the low power level and small cell size of transistor-transistor logic, was announced February 25 at Compcon Spring. The circuit was invented by IBM engineers Richard R. Konian and James. L. Walsh, at IBM's East Fishkill, N.Y., facility.
The Info-plosion Project
Authors: Masaru Kitsuregawa
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

How much information project in California University examined the volume of information that have been produced so far [3,4], and revealed that actually very large volume of information has been produced, even if sensor information is not included in the target of this research. So, if such information is included, the amount becomes much larger. Therefore, we considered that it is a big challenge in information science to make value from such massive volume of data. Recently, it is said that knowledge worker waste more than 30 percent of their work time to search something. It is necessary to make information retrieval more efficient. This paper introduces info-plosion project, which tackles this challenge. In this paper we introduce four core subprojects.