ppxscal/embedding_network huggingface dataset:
Looking for win/win solutions between lab-work and hands-on experience in IT research
Authors: Johan F. Hoorn, Simon van Dam, Guido Fambach, Arco van Nieuwland, Gerrit C. van der Veer
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

At times, the differences between business and science place considerable stress on their relationship. Scientists blame businesses for staking their claims for product quality based upon unfounded and unjustified assumptions. Businesses blame scientists for doing research that is irrelevant outside the laboratory. In HCI and CSCW, such controversies are counter-productive. When problems arise in information systems of large organizations, researchers will be forced to do science outside the laboratory. In this paper, we analyze the differences between the business models of science and commerce, and conclude that the common interest lies in obtaining information about system and stakeholder requirements that is reliable as well as valid. This can be achieved by applying controlled field experiments, combining a laboratory set-up with high ecological validity. Three business cases (i.e. VirTouch, The Mediator Group, and Exact Holding) illustrate that our common ground can initiate research that serves both scientific and business purposes. We round off our discussion with some recommendations on science-business cooperation and we will end on an ethical note.
Adaptive server selection for large scale interactive online games
Authors: Kang-Won Lee, Bong-Jun Ko, Seraphin Calo
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

In this paper, we present a novel distributed algorithm that dynamically selects game servers for a group of game clients participating in large scale interactive online games. The goal of server selection is to minimize server resource usage while satisfying the real-time delay constraint. We develop a synchronization delay model for interactive games and formulate the server selection problem, and prove that the considered problem is NP-hard. The proposed algorithm, called zoom-in-zoom-out, is adaptive to session dynamics (e.g. clients join and leave) and lets the clients select appropriate servers in a distributed manner such that the number of servers used by the game session is minimized. Using simulation, we present the performance of the proposed algorithm and show that it is simple yet effective in achieving its design goal. In particular, we show that the performance of our algorithm is comparable to that of a greedy selection algorithm, which requires global information and excessive computation.
Extra Processors versus Future Information in Optimal Deadline Scheduling
Authors: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan &#x201c;Johnny&#x201d; Ngan, Kar-Keung To
Venue: Theory of Computing Systems (2004)

This paper is concerned with the design of online scheduling algorithms that exploit extra resources. In particular, it studies how to make use of multiple processors to counteract the lack of future information in online deadline scheduling. Our results extend the previous work that are primarily based on using a faster processor to obtain a performance guarantee. The challenge arises from the fact that jobs are sequential in nature and cannot be executed on more than one processor at the same time. Thus, a faster processor can speed up a job while multiple unit-speed processors cannot.
On some recurrence type Smarandache sequences
Authors: A. A. K. Majumdar, H. Gunarto
Venue: Smarandache Notions Journal (2004)

In this paper, we study some properties of ten recurrence type Smarandache sequences, namely, the Smarandache odd, even, prime product, square product, higher-power product, permutation, consecutive, reverse, symmetric, and pierced chain sequences.
Fuzzy-Logic Based Navigation of Underwater Vehicles
Authors: V. Kanakakis, K. P. Valavanis, N. C. Tsourveloudis
Venue: Journal of Intelligent and Robotic Systems (2004)

A fuzzy logic based general purpose modular control architecture is presented for underwater vehicle autonomous navigation, control and collision avoidance. Three levels of fuzzy controllers comprising the sensor fusion module, the collision avoidance module and the motion control module are derived and implemented. No assumption is made on the specific underwater vehicle type, on the amount of a priori knowledge of the 3-D undersea environment or on static and dynamic obstacle size and velocity. The derived controllers account for vehicle position accuracy and vertical stability in the presence of ocean currents and constraints imposed by the roll motion. The main advantage of the proposed navigation control architecture is its simplicity, modularity, expandability and applicability to any type of autonomous or semi-autonomous underwater vehicles. Extensive simulation studies are performed on the NPS Phoenix vehicle whose dynamics have been modified to account for roll stability.
A Technique to Reduce Power and Test Application Time in BIST
Authors: Debjyoti Ghosh, Swarup Bhunia, Kaushik Roy
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

Increased switching activity during testing causessubstantial increase in power dissipation. This paper presents anefficient test application procedure for reducing power dissipationin test-per-scan BIST as well as the test application time,while maintaining the fault coverage. Experiments on ISCAS89benchmarks show promising results - up to 51.8% (63.1%) peakpower reduction and an average energy saving of 36.3% (62.3%)in the combinational logic (scan chain) for three partitions.
New High Speed CMOS Self-Checking Voter
Authors: Jose Manuel Cazeaux, Daniele Rossi, Cecilia Metra
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

Faults possibly affecting voters of TMR systems, employedin high reliability applications, can make them providethe fan-out logic with incorrect data, hence making theadoption of the TMR technique useless. In this paper we instantiatethe need for self-checking voters and we proposea new self-checking voting scheme that, compared to alternateself-checking solutions, features the advantage of beingfaster, while requiring comparable power consumption.This is achieved at the cost of a small increase in area overhead.
Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces
Authors: Kenji Fukumizu, Francis R. Bach, Michael I. Jordan
Venue: The Journal of Machine Learning Research (2004)

We propose a novel method of dimensionality reduction for supervised learning problems. Given a regression or classification problem in which we wish to predict a response variable Y from an explanatory variable X, we treat the problem of dimensionality reduction as that of finding a low-dimensional "effective subspace" for X which retains the statistical relationship between X and Y. We show that this problem can be formulated in terms of conditional independence. To turn this formulation into an optimization problem we establish a general nonparametric characterization of conditional independence using covariance operators on reproducing kernel Hilbert spaces. This characterization allows us to derive a contrast function for estimation of the effective subspace. Unlike many conventional methods for dimensionality reduction in supervised learning, the proposed method requires neither assumptions on the marginal distribution of X, nor a parametric model of the conditional distribution of Y. We present experiments that compare the performance of the method with conventional methods.
Web Mining: Research and Practice
Authors: Pranam Kolari, Anupam Joshi
Venue: Computing in Science and Engineering (2004)

Web mining techniques seek to extract knowledge from Web data. This article provides an overview of past and current work in the three main areas of Web mining research—content, structure, and usage—as well as emerging work in Semantic Web mining.
Optimizing Parallel Multiplication Operation for Rectangular and Transposed Matrices
Authors: Manojkumar Krishnan, Jarek Nieplocha
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In many applications, matrix multiplication involvesdifferent shapes of matrices. The shape of the matrix cansignificantly impact the performance of matrixmultiplication algorithm. This paper describes extensionsof the SRUMMA parallel matrix multiplication algorithm[1] to improve performance of transpose and rectangularmatrices. Our approach relies on a set of hybrid algorithmswhich are chosen based on the shape of matrices andtranspose operator involved. The algorithm exploitsperformance characteristics of clusters and shared memorysystems: it differs from the other parallel matrixmultiplication algorithms by the explicit use of sharedmemory and remote memory access (RMA) communicationrather than message passing. The experimental results onclusters and shared memory systems demonstrateconsistent performance advantages over pdgemm from theScaLAPACK parallel linear algebra package.
Impact of conductivity and size of the breakdown spot on the progressive-breakdown of thin SiO2 gate Oxides
Authors: M. Porti, M. Nafría, X. Aymerich
Venue: Microelectronic Engineering (2004)

In this work, for the first time, a conductive atomic force microscope has been used to electrically characterize the progressiveness of the breakdown phenomenon of stressed thin (2.9 and 4.2 nm) SiO2 films at a nanometer scale. The extremely high lateral resolution of the technique allows to analyse independently the role of the oxide conductivity and the area of the breakdown (BD) spot. In particular, the results show that the gradual increase of the overall current that flows through the broken down oxide area is the consequence of the progressive growth of both parameters: the oxide conductivity at the location where BD was initially triggered and the size of the BD spot.
Object location in realistic networks
Authors: Kirsten Hildrum, Robert Krauthgamer, John Kubiatowicz
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We devise an object location scheme that achieves a guaranteed low stretch in a wider and more realistic class of networks than previous schemes. The distinctive feature of our scheme is that it is inherently adaptive to the underlying topology. In particular, the system achieves 1+ε stretch (for arbitrarily fixed ε>0), with a neighbor list size that depends on the local density around the node (but not on the global growth rate bound). As a byproduct, our scheme has several advantages over existing ones, such as robustness to errors in network measurements, and simpler design choices of system builders, which may lead to improved and more robust deployments.
Quantitative Analysis of Membrane Protein Localization and Signaling
Authors: Peter M. Kasson, Johannes B. Huppa, Mark M. Davis, Axel T. Brunger
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Fluorescence microscopy of labeled proteins yields a wealth of data on cell signaling processes. However, systems for quantitative analysis of such data have lagged behind the recent progress in data acquisition technology. As cellular protein redistribution plays a key role in proximal signaling and the establishment of cell polarity, quantitative information is critical for understanding many signaling networks. We have developed a robust automated system to analyze membrane protein redistribution based on datasets obtained via fluorescence video microscopy. Our system provides methods for cell surface segmentation and reconstruction, cell shape tracking, cell-surface parameterization, and cluster formation analysis. Our system is novel in both its integration and its surface-based approach, enabling model-free analysis of protein redistribution across the entire cell. We validate our system by measuring receptor clustering in T lymphocytes undergoing activation, obtaining clustering velocities consistent with the previously reported single-particle tracking data that serve as our reference standard. Our methods generalize to many cell-signaling phenomena, allowing quantitative measurement of these cell membrane processes and offering the ability to derive empiric parameters for spatial signaling network models.
Interactive virtual materials
Authors: Matthias Müller, Markus Gross
Venue: Proceedings of Graphics Interface 2004 (2004)

In this paper we present a fast and robust approach for simulating elasto-plastic materials and fracture in real time. Our method extends the warped stiffness finite element approach for linear elasticity and combines it with a strain-state-based plasticity model. The internal principal stress components provided by the finite element computation are used to determine fracture locations and orientations. We also present a method to consistently animate and fracture a detailed surface mesh along with the underlying volumetric tetrahedral mesh. This multi-resolution strategy produces realistic animations of a wide spectrum of materials at interactive rates that have typically been simulated off-line thus far.
On Linear Programming Bounds for Spherical Codes and Designs
Authors: Alex Samorodnitsky
Venue: Discrete Computational Geometry (2004)

We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte&#x2019;s linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as the average of the best known upper and lower bounds. When the dimension n of the design is fixed, and the strength k goes to infinity, the LP bound on designs turns out, in conjunction with known lower bounds, to be proportional to kn-1.
Safe bounds in linear and mixed-integer linear programming
Authors: Arnold Neumaier, Oleg Shcherbina
Venue: Mathematical Programming: Series A and B (2004)

Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small integers. An example is given where many state-of-the-art MILP solvers fail. It is then shown how, using directed rounding and interval arithmetic, cheap pre- and postprocessing of the linear programs arising in a branch-and-cut framework can guarantee that no solution is lost, at least for mixed-integer programs in which all variables can be bounded rigorously by bounds of reasonable size.
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
Authors: Rodolfo Pellizzoni, Giuseppe Lipari
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

The problem of feasibility analysis for asynchronous periodictask sets (i.e. where tasks can have an initial offset)is known to be co-NP-complete in the strong sense.A sufficient pseudo-polynomial test has been proposed byBaruah et al., which consists in analyzing the feasibilityof the corresponding synchronous task set (i.e. all offsetsare set equal to 0) for which a pseudo-polynomial test isknown. If the test gives a positive result, then the originalasynchronous task set is feasible; else, no definitive answercan be given. In many cases, this sufficient test is too pessimistic,i.e. it gives no response for many feasible task sets.In this paper, we present a new sufficient pseudo-polynomialtest for asynchronous periodic task sets. Ourtest reduces the pessimism by considering the value of theoffsets and obtaining a set of critical arrival patterns. Weshow, with a set of extensive simulations, that our test outperformsthe previous sufficient test.
Separate and independent control of interfacial band alignments and dielectric constants in transition metal rare earth complex Oxides
Authors: G. Lucovsky, Y. Zhang, J. L. Whitten, D. G. Schlom, J. L. Freeouf
Venue: Microelectronic Engineering (2004)

Spectroscopic studies of transition metal (Tm) and rare earth (Re) oxides, combined with ab initio theory, identify the band edge electronic structure of alternative high-K dielectrics. The lowest conduction band states are derived from anti-bonding transition metal d-states with a π symmetry and show strong final state effects. Applied to the complex Tm/Re mixed oxides of the general form ReTmO3, this approach identifies a novel way for obtaining separate and independent control of band gap energies and dielectric constants through local bonding arrangements in which Tm and Re atoms are nearest neighbors to the same oxygen atom.
Focused named entity recognition using machine learning
Authors: Li Zhang, Yue Pan, Tong Zhang
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that these focused named entities are useful for many natural language processing applications, such as document summarization, search result ranking, and entity detection and tracking. We propose a statistical model for focused named entity recognition by converting it into a classification problem. We then study the impact of various linguistic features and compare a number of classification algorithms. From experiments on an annotated Chinese news corpus, we demonstrate that the proposed method can achieve near human-level accuracy.
Abstract Data Types Can Have Inequations1
Authors: Hidetaka Kondoh
Venue: Formal Aspects of Computing (2003)

This work proposes a typed functional wide-spectrum language, Funiq, for both programming and specification as an extension of Cardelli-Wegner&#x2019;s Fun enriched with the fixed-point construction on expressions and inequational refinements (as assertions) for types. The type system of our wide-spectrum Funiq language is shown to be a conservative extension of that of the original Fun and sound with respect to the complete PER semantics for types.
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Authors: Liam Roditty, Uri Zwick
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our algorithm has an amortized update time of O(m+n log n) and a worst-case query time of O(n), where m is the current number of edges in the graph, and n is the number of vertices in the graph. Each update operation either inserts a set of edges that touch the same vertex, or deletes an arbitrary set of edges. The algorithm is deterministic and uses fairly simple data structures. This is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges.One of the ingredients used by this new algorithm may be interesting in its own right. It is a new dynamic algorithm for strong connectivity in directed graphs with an interesting persistency property. Each insert operation creates a new version of the graph. A delete operation deletes edges from emphall versions. Strong connectivity queries can be made on each version of the graph. The algorithm handles each update in O(mα(m,n)) amortized time, and each query in O(1) time, where α(m,n) is a functional inverse of Ackermann's function appearing in the analysis of the union-find data structure. Note that the update time of O(mα(m,n)), in case of a delete operation, is the time needed for updating all versions of the graph.
Möbius function on cross-section lattices
Authors: Mohan S. Putcha
Venue: Journal of Combinatorial Theory Series A (2004)

Let M be an irreducible algebraic monoid with a reductive unit group G. Then there is an idempotent cross-section Λ of G × G-orbits that preserves the Zariski closure ordering. The purpose of this paper is to compute the Möbius function on the cross-section lattice Λ. This is accomplished by analyzing an associated boolean family of face lattices of polytopes and then solving a resulting system of linear equations.
Collaborative Reinforcement Learning of Autonomic Behaviour
Authors: Jim Dowling, Raymond Cunningham, Eoin Curran, Vinny Cahill
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper introduces Collaborative Reinforcement Learning (CRL), a coordination model for solving system-wide optimisation problems in distributed systems where there is no support for global state. In CRL the autonomic properties of a distributed system emerge from the coordination of individual agents solving discrete optimisation problems using Reinforcement Learning. In the context of an ad hoc routing protocol, we show how system-wide optimisation in CRL can be used to establish and maintain autonomic properties for decentralised distributed systems.
Model-driven business UI based on maps
Authors: Per Bendsen
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Future business applications will often have more than 2,000 forms and need to target several user interface (UI) technologies including: Web Browsers, Windows&reg; Applications, PDA's, and cell phones. The applications will need state-of-the-art layout combined with excellent usability with specially built forms that handle specific tasks based on user roles. How can the trade-off between developer productivity and user experience be handled?The technologies being implemented in Microsoft&reg; Business Framework include a model-driven business UI platform that exploits flexible maps and a layered form definition. The framework generates forms based on a model of the business logic, which is an integrated part of the business framework. The generation process uses declarative and changeable maps so that the process can be controlled and modified by the business developer.
News: Richard Clarke Talks Cybersecurity and JELL-O
Authors: Greg Goth
Venue: IEEE Security and Privacy (2004)

Richard Clarke Talks Cybersecurity and JELL-O
On the general graph embedding problem with applications to circuit layout
Authors: Jonathan S. Turner
Venue: ACM SIGACT News (1984)

This paper addresses a class of graph embeding problems in which the object is to map the vertices of one graph to the vertices of another, so that the images of vertices that are adjacent in the <u>source graph</u> are close together in the <u>target graph.</u> An important special case is the bandwidth minimization problem in which the target graph is a simple line graph. In a previous paper, this author showed that for random graphs having bandwidth at most <u>k</u>, a well-known heuristic produces solutions having cost not more than 3<u>k</u> with high probability. This paper ger ralizes these results to the general graph embedding problem. A class of heuristics is described that can be applied to many families of target graphs. Certain aspects of these heuristics depend on properties of the target graphs. These properties are characterized and used to state several metatheorems. Typical of the results is a theorem showing that there exists an efficient heuristic that for random graphs having a cost <u>k</u> embedding in a rectangular grid, will produce an embedding having cost not more than 3<u>k</u> with high probability.