ppxscal/embedding_network huggingface dataset:
CoRdE: Cosserat rod elements for the dynamic simulation of one-dimensional elastic objects
Authors: J. Spillmann, M. Teschner
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Simulating one-dimensional elastic objects such as threads, ropes or hair strands is a difficult problem, especially if material torsion is considered. In this paper, we present CoRdE(french 'rope'), a novel deformation model for the dynamic interactive simulation of elastic rods with torsion. We derive continuous energies for a dynamically deforming rod based on the Cosserat theory of elastic rods. We then discretize the rod and compute energies per element by employing finite element methods. Thus, the global dynamic behavior is independent of the discretization. The dynamic evolution of the rod is obtained by numerical integration of the resulting Lagrange equations of motion. We further show how this system of equations can be decoupled and efficiently solved. Since the centerline of the rod is explicitly represented, the deformation model allows for accurate contact and self-contact handling. Thus, we can reproduce many important looping phenomena. Further, a broad variety of different materials can be simulated at interactive rates. Experiments underline the physical plausibility of our deformation model.
Classification by probabilistic clustering
Authors: T. M. Breuel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper describes an approach to classification based on a probabilistic clustering method. Most current classifiers perform classification by modeling class conditional densities directly or by modeling class-dependent discriminant functions. The approach described in this paper uses class-independent multilayer perceptrons (MLP) to estimate the probability that two given feature vectors are in the same class. These probability estimates are used to partition the input into separate classes in a probabilistic clustering. Classification by probabilistic clustering potentially offers greater robustness to different compositions of training and test sets than existing classification methods. Experimental results demonstrating the effectiveness of the method are given for an optical character recognition (OCR) problem. The relationship of the current approach to mixture density estimation, mixture discriminant analysis, and other OCR and handwriting recognition techniques is discussed.
Data-Purpose Algebra: Modeling Data Usage Policies
Authors: Chris Hanson, Tim Berners-Lee, Lalana Kagal, Gerald Jay Sussman, Daniel Weitzner
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Data is often encumbered by restrictions on the ways in which it may be used. These restrictions on usage may be determined by statute, by contract, by custom, or by common decency, and they are used to control collection of data, diffusion of data, and the inferences that can be made over the data. In this paper, we present a data-purpose algebra that can be used to model these kinds of restrictions in various different domains. We demonstrate the utility of our approach by modeling part of the Privacy Act (5 USC §552a)1, which states that data collected about US citizens can be used only for the purposes for which it was collected. We show (i) how this part of the Privacy act can be represented as a set of restrictions on data usage, (ii) how the authorized purposes of data flowing through different government agencies can be calculated, and (iii) how these purposes can be used to determine whether the Privacy Act is being enforced appropriately.
Paper versus Electronic: Challenges Associated with Physicians' Usage of Electronic Medical Records
Authors: Virginia Ilie, James F. Courtney, Craig Van Slyke
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This study builds on the theory of planned behavior, institutional and diffusion theories to investigate physicians' attitudes and usage behaviors of electronic medical records (EMR). Interviews with seventeen physician-residents enrolled in a Family Practice residency program and eight attending physicians in the same clinic showed that most physicians held rather negative attitudes regarding the EMR system. EMR was often times seen as an intrusion in the patient-physician interaction. Other findings relate to the impacts EMR had on physicians' time, expertise, physicians' learning, the length (and sometimes the accuracy) of the clinical notes. Challenges associated with behavioral control issues such as availability of computers and the physical positioning of computers are shown to be very important in the context of this case. Physician-residents have to use EMR because of its mandatory nature, however, if they had a choice or the power, the majority of physicians would use the paper chart.
DOLFFEN: Discovery Oriented Lab For First-Year Engineers
Authors: J. M. Abel
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The DOLFFEN project is a school and NSF sponsored effort to develop a hands-on laboratory course that will: (1) Instill same excitement and interest in students with respect to true experimentation and (2) Remedy in some degree the vast well of ignorance modern students have about the way real devices anal systems work, what they are made of, and (3) Demonstrate how technological artifacts exploit scientific principles to create useful devices and systems. From the point of view of educational philosophy, the course is constructivist in the sense that what students learn is a product of their exploration and inferences they draw from their results. There is no received wisdom and no theory to be validated. The lab writeups studiously avoid imperative sentences and primarily consist of questions to be answered by experiment. This approach is a deliberate attack on the formulaic, prescriptive lab protocols to which most undergraduate labs have sunk and which have been the cause of students' contempt for what parses as experimentation on our campuses. For the faculty, the approach is a tradeoff between coverage, depth, contact with the theory or base of knowledge and conveying the real sense of exploration or discovery that makes laboratory work so pleasurable and important. The tradeoff is like the one we make when we choose to prepare a dinner from a new recipe in the newspaper as opposed to irradiating a TV dinner. The latter is neat, predictable and convenient but not very tasty. The former is risky usually disappointing in some respects but always exciting and educational. In this paper some example experiments are described and results from a pilot of offering are given. The early results are encouraging and some lessons about student interests and capabilities have been learned.
An Interoperability Framework for Pan-European E-Government Services (PEGS)
Authors: Arnold Van Overeem, Johan Witters, Vassilios Peristeras
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Interoperability between public administrations receives nowadays a lot of attention. Also in the European Union interworking is high on the priority list, but the challenges to achieve the European Administrative space are enormous. Many research projects are undertaken, especially in the domain of semantic interoperability. Many of these efforts seem to start from a technical solution rather than from an actual business problem. By taking a narrow view on the problem space, they only promise limited support for the many challenges in the domain of interoperability and innovation of e-Government services. In this paper we present a business driven approach that looks promising in enabling entire classes of interoperability solutions.
Talk2Me: engaging interactive installation environments
Authors: Ann Judith Morrison, Margot Brereton, Peta Mitchell
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this research I explore what elements there may be in common between tangible interactive-technology works that successfully engage their participants. An exploration of existing methods for obtaining useful evaluations for non-use and ambiguous environments forms a part of the discussion.
On-line Conservative Learning for Person Detection
Authors: P. M. Roth, H. Grabner, H. Bischof, D. Skocaj
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

We present a novel on-line conservative learning framework for an object detection system. All algorithms operate in an on-line mode, in particular we also present a novel on-line AdaBoost method. The basic idea is to start with a very simple object detection system and to exploit a huge amount of unlabeled video data by being very conservative in selecting training examples. The key idea is to use reconstructive and discriminative classifiers in an iterative co-training fashion to arrive at increasingly better object detectors. We demonstrate the framework on a surveillance task where we learn person detectors that are tested on two surveillance video sequences. We start with a simple moving object classifier and proceed with incremental PCA (on shape and appearance) as a reconstructive classifier which in turn generates a training set for a discriminative on-line AdaBoost classifier.
Common structure and properties of filtering systems
Authors: Junichi Iijima, Sho Ho
Venue: Electronic Commerce Research and Applications (2007)

Recommendation systems have been studied actively since the 1990s. Generally, recommendation systems choose one or more candidates from a set of candidates through a filtering process. Methods of filtering can be divided into two categories: collaborative filtering, in which candidates are chosen based on choices of other persons whose interests or tastes are similar, and content-based filtering, in which items are chosen based on the profile or action history of the recommendee. However, these methods share the same structure in the sense that both of them recommend items based on relevance degrees of items and references, as well as relevance degrees between the recommendee and each reference. Most discussions about recommendation systems focus on the methods of choosing recommended candidates; few focus on foundational concepts of recommendation conditions that systems must satisfy, and problems that current systems have compared with these conditions. In this paper, recommendation systems are reconsidered from the viewpoint of multi-criteria decision making. Conventional filtering methods (e.g., collaborative filtering and content-based filtering) are formulated as linear weighted sum type recommendation systems. Several properties of linear weighted sum type recommendation systems are identified and formulated from the viewpoint of voting.
Low-cost modules for remote engineering education: performing laboratory experiments over the Internet
Authors: Hong Shen
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

AIM-Lab (Automated Internet Measurement Laboratory), an Internet-based remote laboratory on semiconductor device characterization, is used in the distance learning programs at Rensselaer Polytechnic Institute and at the Norwegian University of Science and Technology. Specifically, we apply AIM-Lab in first year graduate/senior courses on semiconductor device modeling. We report improvements on the AIM-Lab using low-cost computer boards for data acquisition.
A New Affine Registration Algorithm for Matching 2D Point Sets
Authors: Jeffrey Ho, Ming-Hsuan Yang, Anand Rangarajan, Baba Vemuri
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

We propose a novel affine registration algorithm for matching 2D feature points. Unlike many previously published work on affine point matching, the proposed algorithm does not require any optimization and in the absence of data noise, the algorithm will recover the exact affine transformation and the unknown correspondence. The twostep algorithm first reduces the general affine case to the orthogonal case, and the unknown rotation is computed as the roots of a low-degree polynomial with complex coefficients. The algebraic and geometric ideas behind the proposed method are both clear and transparent, and its implementation is straightforward. We validate the algorithm on a variety of synthetic 2D point sets as well as feature points on images of real-world objects.
Sequential modulation classification of dependent samples
Authors: Yu-Chuan Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We classify the modulation scheme of a received signal waveform modeled by a finite state Markov chain. We compare the likelihood ratio test (LRT) known as a fixed-sample-size classifier, which uses a fixed amount of data, and the sequential probability ratio test (SPRT) known as a fixed-error-rate classifier, which uses a variable amount of data just enough to achieve a certain correct rate. The SPRT approach has several advantages, including reduced computational complexity, less decision delay, controllable classification error rate, etc. The performance of MPSK and trellis-coded modulation (TCM) classifiers are demonstrated.
Controlling sensor density using mobility
Authors: Bin Zhang, G. S. Sukhatme
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

We present a distributed deployment algorithm for a mobile sensor network which is able to deploy sensor nodes in a distribution proportional to a scalar field. The algorithm randomly partitions space into sufficiently small neighborhoods at each iteration. Within each neighborhood a redistribution process directed by a cluster head is enacted. We prove that after sufficiently many iterations, the distribution of nodes approaches the desired profile in the overall region. The algorithm is scalable to large network sizes, and is not restricted to planar domains. We show experimentally that the algorithm is noise tolerant.
Supporting Compliance with Security Standards by Trust Case Templates
Authors: Lukasz Cyra, Janusz Gorski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Trust Cases are used to justify that a given object (a system, an infrastructure, an organization) exhibits certain properties. One of possible applications of trust cases is related to the processes of achieving and demonstrating the compliance with standards. A Trust Case Template derived from a given standard constitutes a skeleton of justification (encompassing evidence and argumentation) of the compliance with the standard. The article explains the notion of trust case templates and provides some details on the template development process and a generic procedure of template application. The applicability of the proposed approach is demonstrated by referring to the results of a case study of evaluating an example (real) system against the BS 7799 security management standard.
Sampling-based dimension reduction for subspace approximation
Authors: Amit Deshpande, Kasturi Varadarajan
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizesthe Lp-error for given points, i.e., p-th root of the sum of p-th powers of distances to given points,for any p ≥ 1. Our algorithm runs in time Õ (mn · pk3 (k/ε)2p) andproduces a subset of size Õ (pk2 (k/ε)2p) from the given points such that, withhigh probability, the span of these points gives a (1+ε)-approximation to the optimal k-dimensionalsubspace. We also show a dimension reduction type of result for this problem where we can efficiently find asubset of size Õ (pk2(p+1) + (k/ε)p+2) such that, with high probability, theirspan contains a k-dimensional subspace that gives (1+ε)-approximation to the optimum. We prove similarresults for the corresponding projective clustering problem where we need to find multiple k-dimensional subspaces.
A Finite State Analysis of Time-Triggered CAN (TTCAN) Protocol Using Spin
Authors: Indranil Saha, Suman Roy
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The paper presents a case study of the use of model checking for the analysis of an industrial protocol, a time triggered version of the CAN protocol (TTCAN). Our analysis of this protocol was carried out using the model checker Spin. The original CAN protocol can easily be modeled in Spin, but specifying TTCAN requires the provision of explicitly using time in the modeling language. With a view to express time triggered properties we use a discrete time version of Spin (DT-Spin). This extension allows one to quantify discrete time elapse between events by specifying the time slice in which they occur. Using DT-Spin we have been able to model TTCAN, and subsequently, verify a few of its time-triggered properties. This experience shows that it is possible to largely model TDMA-based protocols using discrete time.
Interactive curves and surfaces
Authors: A. Rockwood
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The emergence of visual programming and processing environments and the raw power of computers now makes it possible to present technical subjects with interactive involvement of the student. We report on a development that is the analogy of a science laboratory for geometry. The result is an electronic book which contains text navigation facilities, supplementary menu driven modes, and in particular, embedded interactive demonstrations and animation. The electronic book was a prototype for a class in geometric design. The class is representative of many science and engineering courses that rely heavily on developing connections between algebra and geometry.
Separating DAG-Like and Tree-Like Proof Systems
Authors: Phuong Nguyen
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We show that tree-like (Gentzen's calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents that have polynomial size cut-free proofs but requires superpolynomial tree-like proofs even when the cut rule is allowed on a class of cut-formulas that satisfies some plausible hardness assumption. This gives (in some cases, conditional) negative answers to several questions from a recent work of Maciel and Pitassi (LICS 2006). Our technique is inspired by the technique from Maciel and Pitassi. While the sequents used in earlier work are derived from the Pigeonhole principle, here we generalize Statman's sequents. This gives the desired separation, and at the same time provides stronger results in some cases.
Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Authors: Min Liu, Yushen Liu, Karthik Ramani
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper, we study the problem of mesh denoising for improving the single pass surface estimation on normals and curvature tensors. We focus mainly on the engineering objects represented as dense triangle meshes. In particular, a two run non-linear diffusion algorithm based on optimal estimation theory is proposed to adaptively filter out the undesired discontinuities introduced by noise while preserving the underlying features. We show that the proposed filter can successfully improve the local surface estimates while preserving the desired features in terms of tangential and curvature discontinuities.
The Complexity of Computing the Size of an Interval
Authors: Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
Venue: SIAM Journal on Computing (2006)

Given a p-order $A$ over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if $(x, y) \in A$, then $|x|$ is polynomially bounded by $|y|$), an interval size function of $A$ returns, for each string $x$ in the universe, the number of strings in the interval between strings $b(x)$ and $t(x)$ (with respect to $A$), where $b(x)$ and $t(x)$ are functions that are polynomial-time computable in the length of $x$. By choosing sets of interval size functions based on feasibility requirements for their underlying p-orders, we obtain new characterizations of complexity classes. We prove that the set of all interval size functions whose underlying p-orders are polynomial-time decidable is exactly &mesh;P. We show that the interval size functions for orders with polynomial-time adjacency checks are closely related to the class FPSPACE(poly). Indeed, FPSPACE(poly) is exactly the class of all nonnegative functions that are an interval size function minus a polynomial-time computable function. We study two important functions in relation to interval size functions. The function &mesh;DIV maps each natural number $n$ to the number of nontrivial divisors of $n$. We show that &mesh;DIV is an interval size function of a polynomial-time decidable partial p-order with polynomial-time adjacency checks. The function &mesh;MONSAT maps each monotone boolean formula $F$ to the number of satisfying assignments of $F$. We show that &mesh;MONSAT is an interval size function of a polynomial-time decidable total p-order with polynomial-time adjacency checks. Finally, we explore the related notion of cluster computation.
Efficient Multi-sink Relocation in Wireless Sensor Network
Authors: L. Friedmann, L. Boukhatem
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Sensor networks are dense wireless networks where information is gathered by sensor elements spread out in an interest area. The main deficiency of sensors is their finite source of energy. Therefore, an efficient utilization of this energy resource conditions the network lifetime. In order to enhance the performance of these networks, some research efforts have focused on the mobility of a single or multiple sink nodes. In this paper, we propose a new dynamic approach to extend the lifetime of a sensor network based on both mobility and multiplicity of sinks. According to the evolution of the network, in terms of energy dissipation and distribution, this approach aims to find the optimal position for all the sinks in order to maximize the lifetime of the network and move accordingly these sinks in an intelligent manner.
Towards conversational QA: automatic identification of problematic situations and user intent
Authors: Joyce Y. Chai, Chen Zhang, Tyler Baldwin
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

To enable conversational QA, it is important to examine key issues addressed in conversational systems in the context of question answering. In conversational systems, understanding user intent is critical to the success of interaction. Recent studies have also shown that the capability to automatically identify problematic situations during interaction can significantly improve the system performance. Therefore, this paper investigates the new implications of user intent and problematic situations in the context of question answering. Our studies indicate that, in basic interactive QA, there are different types of user intent that are tied to different kinds of system performance (e.g., problematic/error free situations). Once users are motivated to find specific information related to their information goals, the interaction context can provide useful cues for the system to automatically identify problematic situations and user intent.