ppxscal/embedding_network huggingface dataset:
Using corpus analysis to inform research into opinion detection in blogs
Authors: Deanna Osman, John Yearwood, Peter Vamplew
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Opinion detection research relies on labeled documents for training data, either by assumptions based on the document's origin or by using human assessors to categorise the documents. In recent years, blogs have become a source for opinion identification research (TREC Blog06). This study analyses the part-of-speech proportion and the words used within various corpora, determining key differences and similarities useful when preparing for opinion identification research. The resulting comparisons between the characteristics of the various corpora is detailed and discussed. In particular, opinion-bearing and nonopinion Blog06 documents were found to display a high level of similarity, indicating that blog documents assessed at the document level cannot be used as training data in opinion identification research.
A posteriori estimators for obstacle problems by the hypercircle method
Authors: Dietrich Braess, Ronald H. W. Hoppe, Joachim Sch&#x00f6;berl
Venue: Computing and Visualization in Science (2008)

A posteriori error estimates for the obstacle problem are established in the framework of the hypercircle method. To this end, we provide a general theorem of Prager&#x2013;Synge type. There is now no generic constant in the main term of the estimate. Moreover, the role of edge terms is elucidated, and the analysis also applies to other types of a posteriori error estimators for obstacle problems.
Self-taught clustering
Authors: Wenyuan Dai, Qiang Yang, Gui-Rong Xue, Yong Yu
Venue: Proceedings of the 25th international conference on Machine learning (2008)

This paper focuses on a new clustering task, called self-taught clustering. Self-taught clustering is an instance of unsupervised transfer learning, which aims at clustering a small collection of target unlabeled data with the help of a large amount of auxiliary unlabeled data. The target and auxiliary data can be different in topic distribution. We show that even when the target data are not sufficient to allow effective learning of a high quality feature representation, it is possible to learn the useful features with the help of the auxiliary data on which the target data can be clustered effectively. We propose a co-clustering based self-taught clustering algorithm to tackle this problem, by clustering the target and auxiliary data simultaneously to allow the feature representation from the auxiliary data to influence the target data through a common set of features. Under the new data representation, clustering on the target data can be improved. Our experiments on image clustering show that our algorithm can greatly outperform several state-of-the-art clustering methods when utilizing irrelevant unlabeled auxiliary data.
An internet role-game for the laboratory of network security course
Authors: Luigi Catuogno, Alfredo De Santis
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

Over the last few years, many universities and educational institutions have introduced computer security related courses to their degree programs. The majority of these courses feature intensive laboratory activity based on live experiments of attack and defense techniques by means of team games organized as "cyber-wars". In this paper we argue that, although it is a useful tool for teaching and learning these techniques, the exercise paradigm does not cover all the aspects of security relating to a real-world scenario, with it not allowing students to experience the realistic needs of maintaining network services. In this paper we present the "role-game of the Internet" which was designed as part of the lab activity of our Network Security Course. In our game, instead of fighting against each other, student-teams had to cooperate in order to accomplish a list of business-like tasks over a simulation of the Internet while preserving the security and availability of featured network services.
Neural network-based micropositioning control of smart shape memory alloy actuators
Authors: E. Asua, V. Etxebarria, A. García-Arribas
Venue: Engineering Applications of Artificial Intelligence (2008)

Shape memory alloys (SMA) are a special kind of smart materials whose dimensions change because of a temperature-dependent structural phase transition. This property can be used to generate motion or force in electromechanical devices and micromachines. However, their highly nonlinear hysteretical stimulus-response characteristic fundamentally limits the accuracy of SMA actuators. The purpose of this work is to design nonlinear control methods suitable for SMA-based positioning applications. To account for the hysteresis effects, inverse hysteresis models are inserted in proportional integral with antiwindup control loops. The inverse hysteresis models are obtained both using a linear phase shift approximation and by training neural networks using experimental data. It is found that neural networks are excellent tools perfectly capable of learning the hysteresis effects. Several control strategies, with and without compensation, are experimented on a laboratory SMA actuator and it is found that neural networks successfully improve the closed-loop response, leading to position accuracies close to the micron.
Tag Oriented Agile Requirements Identification
Authors: David Connolly, Frank Keenan, Brendan Ryder
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Requirements elicitation, particularly for agile development, presumes the availability of a customer. However, in many cases, as with market-driven projects, a customer is not necessarily available. Here, the challenge is to support the identification of potential requirements by other means. With web development, one approach is to examine other web sites that exhibit similar characteristics to the project under consideration. In certain cases, it may be possible, with appropriate tool support, to easily and quickly identify and document potential requirements. This poster describes one such prototype tool.
Instant Legacy
Venue: Queue (2007)

Companies building applications in an SOA environment must take care to ensure seamless interaction and make certain that any changes to their applications won't negatively impact other applications. In an interview with ACM Queuecast host Mike Vizard, John Michelsen, CTO of iTKO, a Dallas based provider of testing tools for SOA applications, discusses the need for companies to recognize this delicate balance. 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
Safe and effective determinant evaluation
Authors: K. L. Clarkson
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The problem of evaluating the sign of the determinant of a small matrix aries in many geometric algorithms. Given an n*n matrix A with integer entries, whose columns are all smaller than M in Euclidean norm, the algorithm given evaluates the sign of the determinant det A exactly. The algorithm requires an arithmetic precision of less than 1.5n+2lgM bits. The number of arithmetic operations needed is O(n/sup 3/)+O(n/sup 2/) log OD(A)/ beta , where OD(A) mod det A mod is the product of the lengths of the columns of A, and beta is the number of 'extra' bits of precision, min(lg(1/u)-1.1n-2lgn-2,lgN-lgM-1.5n-1), where u is the roundoff error in approximate arithmetic, and N is the largest representable integer. Since OD(A)
Single-Measurement Diagnostic Test Method for Parametric Faults of I/Q Modulating RF Transceivers
Authors: Erdem Serkan Erdogan, Sule Ozev
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

This paper presents a loop-back method for quadrature modulation transceiver circuits to diagnose parametric faults of the system, such as I/Q mismatch, baseband/RF time skew, and DC offsets. The proposed method is capable of separating the transmitter parameters from the receiver parameters in a single measurement. Digital baseband signals are used as test input and the received I/Q baseband signals are analyzed for parameter extraction. Experimental results show that the test method has 1.5\% RMS error performance inthe presence of thermal noise and unknown delays caused by the loop-back connection. The test technique can easily be implemented on a digital tester. Either on-chip baseband data converters or load board data converters (for transceiver circuits without digital output) can be used for interfacing the transceiver circuit under test.
Online algorithms for finger searching
Authors: R. Cole, A. Raghunathan
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The technique of speeding up access into search structures by maintaining fingers that point to various locations of the search structure is considered. The problem of choosing, in a large search structure, locations at which to maintain fingers is treated. In particular, a server problem in which k servers move along a line segment of length m, where m is the number of keys in the search structure, is addressed. Since fingers may be arbitrarily copied, a server is allowed to jump, or fork, to a location currently occupied by another server. Online algorithms are presented and their competitiveness analyzed. It is shown that the case in which k=2 behaves differently from the case in which k>or=3, by showing that there is a four-competitive algorithm for k=2 that never forks its fingers. For k>or=3, it is shown that any online algorithm that does not fork its fingers can be at most Omega (m/sup 1/2/)-competitive. The main result is that for k=3 there is an online algorithm that forks and is constant competitive (independent of m, the size of the search structure). The algorithm is simple and implementable.
Higher-order operator splitting methods for deterministic parabolic equations
Authors: A. T. Sornborger
Venue: International Journal of Computer Mathematics (2007)

The Sheng-Suzuki theorem states that all exponential operator splitting methods of order greater than 2 must contain negative time integration. There have been claims in the literature that higher-order splitting methods for deterministic parabolic equations are unstable due to this fact. We show stability for a class of higher-order splitting methods for integrating deterministic parabolic equations. We note that problems with backwards time integration will still exist for stochastic integration methods for which information is lost and backward timesteps become ill-defined. Therefore, completely positive splitting methods, such as those developed by Chin, still have an important place. We present numerical results from first-, second-, third-and fourth-order methods showing that the error becomes increasingly small as the order increases.
On the interference of ultra wideband devices on fixed wireless systems in a distributed scenario
Authors: Gianluca Guidoni, Romeo Giuliano, Franco Mazzenga
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

This paper evaluates the interference impact of UWB power controlled systems, classified as secondary services, against some narrowband radiosystems, Fixed Wireless Access (FWA), Point-to-Point (PP) and Fixed Satellite Service (FSS), embedded in a square sprawl of randomly distributed UWB devices. This study on the radio-coexistence accounts for various parameters such as the effect of different outdoor radio propagation models, UWB modulation techniques, UWB user bit rate and density, radiation pattern and pointing of victim antennas. We calculate the mean UWB interference level received by the victim receiver to be able to then compare it with the maximum allowed one in accordance with the ITU guidelines (ITU-R F.1094, ITU-R S.1432).
A simulator for adaptive parallel applications
Authors: Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
Venue: Journal of Computer and System Sciences (2008)

Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify allocation strategies and problem decomposition parameters that increase the efficiency of parallel applications. We describe a simulation framework supporting dynamic node allocation which, given a simple cluster model, predicts the running time of parallel applications taking CPU and network sharing into account. Simulations can be carried out without needing to modify the application code. Thanks to partial direct execution, simulation times and memory requirements are reduced. In partial direct execution simulations, the application's parallel behavior is retrieved via direct execution, and the duration of individual operations is obtained from a performance prediction model or from prior measurements. Simulations may then vary cluster model parameters, operation durations and problem decomposition parameters to analyze their impact on the application performance and identify the limiting factors. We implemented the proposed techniques by adding direct execution simulation capabilities to the Dynamic Parallel Schedules parallelization framework. We introduce the concept of dynamic efficiency to express the resource utilization efficiency as a function of time. We verify the accuracy of our simulator by comparing the effective running time, respectively the dynamic efficiency, of parallel program executions with the running time, respectively the dynamic efficiency, predicted by the simulator under different parallelization and dynamic node allocation strategies.
A web-based presentation framework for museums
Authors: Georgios D. Styliaras
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

This paper presents a framework that supports a web-based multimedia presentation of a museum on fixed information and educational stations and web sites. Museum curators are offered a wizard-like procedure through which they can structure and populate the content to be presented, associate the content to predefined application types that present it and configure the execution order of applications. No technical expertise is required by the curators in order to complete this procedure. The framework has been applied and refined in 30 medium-sized museums in Greece. In the future, an evaluation of the framework is planned along with its application in more museums. Additionally, the framework will support more tight communication with existing standards.
Generation of machine configurations based on product features
Authors: A. I. Shabaka, H. A. Elmaraghy
Venue: International Journal of Computer Integrated Manufacturing (2007)

A computer-aided process planning (CAPP) and machine assignment system, capable of coping with the changes in products and system, are required for reconfigurable manufacturing systems (RMS) or other dynamic manufacturing environments. The capabilities of the machines and manufacturing systems in RMS change with each configuration. An approach is presented for selecting the different types of machine(s) and their appropriate configurations to produce different types of parts and features, according to the required machine capabilities. The structure of the machine tool is represented in a kinematic chain-like format that captures the number, type and order of different axes of motion on both the tool or workpiece side for the machine. The proposed method is illustrated with an example. More than one minimum machine configuration may be generated for a single-operation cluster, which increases the flexibility in machine tool selection. The developed approach is general in nature and not limited to RMS. It is applicable to any manufacturing system where dynamic and flexible process planning and machine assignments are required. It could serve as an important tool in aiding the machine assignment/selection and process planning activities at the initial stages of manufacturing systems design and subsequent changes in products scope, and facilities expansion, downsizing and modification.
Co-designed anchor-free localization and location-based routing algorithm for rapidly-deployed wireless sensor networks
Authors: Hui Qu, Stephen B. Wicker
Venue: Information Fusion (2008)

We consider a wireless sensor network consisting of a single sink node at the center of a field of randomly distributed sensors. A simple anchor-free localization algorithm is proposed, in which the sink node imparts radial location information through the phased-array transmission of a series of beacons. Each individual sensor uses the knowledge of received beacons as well as information from neighbors to continue partitioning current sectors and identifying sub-sectors in which it resides until an accuracy requirement is satisfied. An energy-preserving routing algorithm is then proposed which uses the localization results as the basis for selecting relay nodes. We present the localization algorithm, analyze its partition errors as well as its impact on communication energy consumption, and then present the location-based routing algorithm. Simulation results indicate that the performance of our co-designed localization and routing algorithm in the presence of severe noise is as good as that provided by a shortest-path routing algorithm under ideal assumptions; therefore, our co-designing approach can achieve high performance with lightweight algorithms.
Effects of Co addition in eutectic Sn-3.5Ag solder on shear strength and microstructural development
Authors: Jung-Sub Lee, Kun-Mo Chu, Rainer Patzelt, Dionysios Manessis, Andreas Ostmann, Duk Young Jeon
Venue: Microelectronic Engineering (2008)

In this study, the approach of composite solder using eutectic Sn-3.5Ag solder and Co was tried. Co particles and Sn-3.5Ag solder paste were mechanically mixed at Co weight fractions from 0.1% to 2.0%. For the Co-mixed Sn-3.5Ag solder pastes, their melting temperatures and spreading areas were measured. The solder pastes were stencil printed on test substrates and reflowed to form solder bumps. Ball shear test was performed to examine shear strength of Co-reinforced Sn-3.5Ag solder bumps. As a result, Co addition up to 2wt.% did not alter the melting temperature under heating but reduced undercooling. The maximum shear strength of Co-reinforced Sn-3.5Ag solder bumps increased by 28% compared to normal ones. The increase in shear strength can be attributed to the (Cu,Co)"3Sn"2 intermetallic compounds.
Distance graphs with missing multiples in the distance sets
Authors: Daphne D.-F. Liu, Xuding Zhu
Venue: Journal of Graph Theory (1999)

Given positive integers m, k, and s with m > ks, let Dm,k,s represent the set {1, 2, &hellip;, m} - {k, 2k, &hellip;, sk}. The distance graph G(Z, Dm,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i - j| &epsilon; Dm,k,s. The chromatic number and the fractional chromatic number of G(Z, Dm,k,s) are denoted by &chi;(Z, Dm,k,s) and &chi;f(Z, Dm,k,s), respectively. For s = 1, &chi;(Z, Dm,k,1) was studied by Eggleton, Erd odblac;s, and Skilton [6], Kemnitz and Kolberg [12], and Liu [13], and was solved lately by Chang, Liu, and Zhu [2] who also determined &chi;f(Z, Dm,k,1) for any m and k. This article extends the study of &chi;(Z, Dm,k,s) and &chi;f(Z, Dm,k,s) to general values of s. We prove &chi;f(Z, Dm,k,s) = &chi;(Z, Dm,k,s) = k if m < (s + 1)k; and &chi;f(Z, Dm,k,s) = (m + sk + 1)-(s + 1) otherwise. The latter result provides a good lower bound for &chi;(Z, Dm,k,s). A general upper bound for &chi;(Z, Dm,k,s) is obtained. We prove the upper bound can be improved to [(m + sk + 1)-(s + 1)] + 1 for some values of m, k, and s. In particular, when s + 1 is prime, &chi;(Z, Dm,k,s) is either [(m + sk + 1)-(s + 1)] or [(m + sk + 1)-(s + 1)] + 1. By using a special coloring method called the precoloring method, many distance graphs G(Z, Dm,k,s) are classified into these two possible values of &chi;(Z, Dm,k,s). Moreover, complete solutions of &chi;(Z, Dm,k,s) for several families are determined including the case s = 1 (solved in [2]), the case s = 2, the case (k, s + 1) = 1, and the case that k is a power of a prime. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 245259, 1999
Multiple UAVs path planning algorithms: a comparative study
Authors: B. Moses Sathyaraj, L. C. Jain, A. Finn, S. Drake
Venue: Fuzzy Optimization and Decision Making (2008)

Unmanned aerial vehicles (UAVs) are used in team for detecting targets and keeping them in its sensor range. There are various algorithms available for searching and monitoring targets. The complexity of the search algorithm increases if the number of nodes is increased. This paper focuses on multi UAVs path planning and Path Finding algorithms. Number of Path Finding and Search algorithms was applied to various environments, and their performance compared. The number of searches and also the computation time increases as the number of nodes increases. The various algorithms studied are Dijkstra's algorithm, Bellman Ford's algorithm, Floyd-Warshall's algorithm and the AStar algorithm. These search algorithms were compared. The results show that the AStar algorithm performed better than the other search algorithms. These path finding algorithms were compared so that a path for communication can be established and monitored.
Generic command interpretation algorithms for conversational agents
Authors: Laurent Mazuel, Nicolas Sabouret
Venue: Web Intelligence and Agent Systems (2008)

This paper focuses on human-machine communication with intelligent agents, it proposes a generic architecture with an algorithm for natural language (NL) command interpretation which makes it easy to define different applications using the description and domains of the different agents, since all that is required is their respective codes and domain ontologies. There are two classical approaches for NL command interpretation: the top-down approach, which relies on the syntactical constraints of the agent's model, and the bottom-up approach which relies on the set of the agent's possible actions. The present work combines the two in a new bottom-up based algorithm that makes use of agent's constraints. The three algorithms are then compared, and results show that the combined approach gives best results.