ppxscal/embedding_network huggingface dataset:
An Exploratory Study on Promising Cues in Deception Detection and Application of Decision Tree
Authors: Tiantian Qin, Judee Burgoon, Jay F. Nunamaker,  Jr.
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Automatic deception detection (ADD) becomes more and more important. ADD can be facilitated with the development of data mining techniques. In the paper we focus on decision tree to automatic classify deceptions. The major question is how to select experiment data (input data for training in decision tree) so that it maximally benefits the decision tree performance. We investigate promising level of the cues of experiment data, and then adjust the applications in decision tree accordingly. Five comparative decision tree experiments demonstrate that tree performance, such as accurate rate and complexity, is dramatically improved by statistically and semantically selecting cues.
Active learning with multiple views
Authors: Craig Knoblock
Venue:  (2002)

Labeling training data for machine learning algorithms is tedious, time consuming, and error prone. Consequently, it is of utmost importance to minimize the amount of labeled data that is required to learn a target concept. In the work presented here, I focus on reducing the need for labeled data in multi-view learning tasks. The key characteristic of multi-view learning tasks is that the target concept can be independently learned within different views (i.e., disjoint sets of features that are sufficient to learn the concept of interest). For instance, robot navigation is a 2-view learning task because a robot can learn to avoid obstacles based on either sonar or vision sensors. In my dissertation, I make three main contributions. First, I introduce Co-Testing, which is an active learning algorithm that exploits multiple views. Co-Testing is based on the idea of learning from mistakes. More precisely, it queries examples on which the views predict a different label: if two views disagree, one of them is guaranteed to make a mistake. In a variety of real-world domains, from information extraction to text classification and discourse tree parsing, Co-Testing outperforms existing active learners. Second, I show that existing multi-view learners can perform unreliably if the views are incompatible or correlated. To cope with this problem, I introduce a robust multi-view learner, Co-EMT, which interleaves semi-supervised and active multi-view learning. My empirical results show that Co-EMT outperforms existing multi-view learners on a wide variety of learning tasks. Third, I introduce a view validation algorithm that predicts whether or not two views are adequate for solving a new, unseen learning task. View validation uses information acquired while solving several exemplar learning tasks to train a classifier that discriminates between tasks for which the views are adequate and inadequate for multi-view learning. My experiments on wrapper induction and text classification show that view validation requires a modest amount of training data to make high accuracy predictions.
(IS)4: is information systems interesting in itself?
Authors: Mark J. Perry
Venue: European Journal of Information Systems (2003)

The article comments on, and critiques, a view of IS as an independent discipline. It argues that, rather than being a subject that is distinct and distinguishable from existing research disciplines, it cannot be seen as uniquely different, and to attempt to do so would be theoretically and practically unsafe. A number of suggestions as to how IS research might be conducted and assessed in light of this claim are made.
PlanetLab: an overlay testbed for broad-coverage services
Authors: Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, Mike Wawrzoniak, Mic Bowman
Venue: ACM SIGCOMM Computer Communication Review (2003)

PlanetLab is a global overlay network for developing and accessing broad-coverage network services. Our goal is to grow to 1000 geographically distributed nodes, connected by a disverse collection of links. PlanetLab allows multiple service to run concurrently and continuously, each in its own slice of PlanetLab. This paper discribes our initial implementation of PlanetLab, including the mechanisms used to impelment virtualization, and the collection of core services used to manage PlanetLab.
Index-driven similarity search in metric spaces (Survey Article)
Authors: Gisli R. Hjaltason, Hanan Samet
Venue: ACM Transactions on Database Systems (TODS) (2003)

Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q, based on some similarity measure. In this article, we focus on methods for similarity search that make the general assumption that similarity is represented with a distance metric d. Existing methods for handling similarity search in this setting typically fall into one of two classes. The first directly indexes the objects based on distances (distance-based indexing), while the second is based on mapping to a vector space (mapping-based approach). The main part of this article is dedicated to a survey of distance-based indexing methods, but we also briefly outline how search occurs in mapping-based methods. We also present a general framework for performing search based on distances, and present algorithms for common types of queries that operate on an arbitrary "search hierarchy." These algorithms can be applied on each of the methods presented, provided a suitable search hierarchy is defined.
Explicit Time-Stepping for Stiff ODEs
Authors: Kenneth Eriksson, Claes Johnson, Anders Logg
Venue: SIAM Journal on Scientific Computing (2003)

We present a new strategy for solving stiff ODEs with explicit methods. By adaptively taking a small number of stabilizing small explicit time steps when necessary, a stiff ODE system can be stabilized enough to allow for time steps much larger than what is indicated by classical stability analysis. For many stiff problems the cost of the stabilizing small time steps is small, so the improvement is large. We illustrate the technique on a number of well-known stiff test problems.
From Task-Oriented to Goal-Oriented Web Requirements Analysis
Authors: Davide Bolchini, John Mylopoulos
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Task analysis has been used traditionally in HCI and CSCW to define requirements for user interfaces, web-based or otherwise. This paper argues that a shift of paradigm is needed in web engineering from task-oriented to goal-oriented approaches for designing applications delivering a quality user experience and achieving the objectives of the stakeholders. Task models focus on fine-grained and precisely defined user needs, thereby risking a commitment to premature design decisions. Moreover, since task analysis focuses on users doing things with the system, tasks do not capture the goals of other stakeholders who are not users. Goal-oriented methods, on the other hand, provide specific support for coping with high-level users' and stakeholders' goals, facilitates the exploration of design alternatives and the definition of requirements at a suitable level of abstraction. As such, goal-based techniques are more suitable for early stages of requirements analysis; task models can be used for laterstages, such as detailed interaction design and usability evaluation. The paper conducts a detailed comparison of task- and goal-analysis design techniques, using an ongoing project for a museum website to illustrate the two techniques and their relative strengths.
SCTP: A Proposed Standard for Robust Internet Data Transport
Authors: Armando L. Caro,  Jr., Janardhan R. Iyengar, Paul D. Amer, Sourabh Ladha, Gerard J. Heinz,  II, Keyur C. Shah
Venue: Computer (2003)

The stream control transmission protocol is an evolving general purpose Internet transport protocoldesigned to bridge the gap between TCP and UDP.SCTP evolved from a telephony signaling protocol for IP networks and is now a proposed standard with the Internet Engineering Task Force. Like TCP, SCTP provides a reliable, full-duplex connection and mechanisms to control network congestion. However, SCTP expands transport layer possibilities beyond TCP and UDP, offering new delivery options that are particularly desirable for telephony signaling andmultimedia applications.
A Set-Theoretical Foundation of Qualitative Reasoning and its Application to the Modeling of Economics and Business Management Problems
Authors: Aimo Hinkkanen, Karl R. Lang, Andrew B. Whinston
Venue: Information Systems Frontiers (2003)

The qualitative reasoning (QR) field has developed various representation and reasoning methods for the modeling with incomplete information or incomplete knowledge. While most uncertain reasoning approaches describe uncertain or imprecisely known information as probability distribution functions, qualitative reasoning bases its model specification on qualitative descriptions that are derived from known qualitative system properties. Problems are formulated as sets of qualitative constraints and their analysis is performed by applying a qualitative calculus. This paper presents a general, unifying theory of the various existing qualitative reasoning systems that includes, as special cases, reasoning methods that use representations of qualitative differential equations and qualitative difference equations. Based on set theory, our QR framework describes fundamental concepts such as qualitative models and solutions, and relates them to the quantitative analogues of its underlying quantitative reference system. Our motivation arises from the types of models found in the management sciences. Thus we emphasize the significance of discrete, dynamic models and optimization models in the business management and economics fields, both of which have received less attention in current QR research. Finally, we extend our theoretical framework to include an approach to qualitative optimization.
Roles for sensory perception in the teaching and learning of functional notation using micro-computer-based laboratories
Authors: Robert Keith Watkins
Venue:  (2003)

Using a hybrid of qualitative methods, I studied two college algebra students engaged in eight instructional activities using a micro-computer controlled hand-held sensors, known as a Calculator Based Laboratory 2 (CBL2). Drawing from these case studies, I have attempted to describe roles that perception can play in the teaching and learning of mathematics. I begin by giving an explication of my epistemology; both as it adheres to dominant paradigms in research today, and as it differs from those mainstream views. Following this, I locate three foci of interest in the research literature: functions and their representations, sensory perception, and hand-held computers. After describing my methodology, I introduce my participants and examine the way each interacted with the various CBL2 sensors and activities. During the study, I noted a significant difference in the way students responded to sensate and insensate probes. Experiences with the former were more often called to mind and manipulated in the imagination, while experiences with the later were reported in terms of pure number and only acted upon by school mathematics. A limited number of activities were conducted, but both students reported a strong preference for kinesthetic experiences. In contrast, for activities employing insensate probes, students reported no intuitions on the correspondence between the experimental apparatus and the graphs produced. The distinction I have drawn between sensate and insensate probes is one not previously discussed in the literature. The participants in my case-studies: (1) Provided a number of indications that they experienced the activities conducted with sensate and insensate probes differently; (2) Reported a significant preference for activities using sensate versus insensate probes; (3) Performed CBL activities involving their kinesthetic sense (i.e., the coordinated use of sensory-motor operations) with increased intuitive understanding of the corresponding graphic representations, and (4) Demonstrated greater long-term retention of the memories and understandings they developed during kinesthetic activities. Less tangibly, but perhaps no less significantly, I have attempted to elaborate a natural basis for mathematics that resolves the paradox between the subjective construction of knowledge and the universality of mathematical truth. To this end, I have tried to outline a natural history of mathematics and revitalize the Piagetian Genetic Epistemology.* *This dissertation is multimedia (contains text and other applications not available in printed format). The CD requires the following system application: Microsoft Office.
A note on NUCOMP
Authors: Alfred J. van der Poorten
Venue: Mathematics of Computation (2003)

This note is a detailed explanation of Shanks-Atkin NUCOMP-- composition and reduction carried out "simultaneously"--for all quadratic fields, that is, including real quadratic fields. That explanation incidentally deals with various "exercises" left for confirmation by the reader in standard texts. Extensive testing in both the numerical and function field cases by Michael J Jacobson, Jr, reported elsewhere, confirms that NUCOMP as here described is in fact efficient for composition both of indefinite and of definite forms once the parameters are large enough to compensate for NUCOMP's extra overhead. In the numerical indefinite case that efficiency is a near doubling in speed already exhibited for discriminants as small as 107.
Operating System Support for Interface Virtualisation of Reconfigurable Coprocessors
Authors: Miljan Vuleti", Ludovic Righetti, Laura Pozzi, Paolo Ienne
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Reconfigurable Systems-on-Chip (SoC) consist of large Field-Programmable Gate-Arrays (FPGAs) and standard processors. The reconfigurable logic can be used for application-specific coprocessors to speedup execution of applications. The widespread use is limited by the complexity of interfacing software applications with coprocessors. We present a virtualisation layer that lowers the interfacing complexity and improves the portability. The layer shifts the burden of moving data between processor and coprocessor from the programmer to the Operating System (OS). A reconfigurable SoC running Linux is used to prove the concept.
Nstar: an interactive tool for local web search
Authors: Tao Guan, Kam Fai Wong
Venue: Information and Management (2003)

Defining Web query languages has received much attention in the last few years. A typical system consists of a wrapper which maps a data source to a common data model and on which semantic integration is provided. However, constructing wrappers is time-consuming and can cater for tens, but not thousands of data sources. New methods should thus be investigated and then developed. In this paper, we present a novel model to retrieve information from the WWW. It is designed for ad hoc users and employs sample-based mining to extract the desirable data. Our method is more flexible than the wrapper approach.
Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
Authors: Tiew-On Ting, M. V. C. Rao, C. K. Loo, S. S. Ngu
Venue: Journal of Heuristics (2003)

This paper presents a Hybrid Particle Swarm Optimization (HPSO) to solve the Unit Commitment (UC) problem. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as the minimization of the total objective function while satisfying all the associated constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented. Results shown are acceptable at this early stage.
Model Based Network Emulation to Study the Behavior and Quality of Real-Time Applications
Authors: Christian Scherpe, Bernd E. Wolfinger, Ingo Salzmann
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

The strong tendency to integrate distributed applications with real-time communication requirements into existing computer networks, such as the Internet and mobile networks, implies the necessity for quality-of-service (QoS) provisioning. In order to judge the quality of distributed real-time applications it is important to study scenarios where concrete applications are communicating via an existing network. Experimentation is even much more flexible, if no real network is used but, instead, network behavior is just reflected by means of a "network emulator" which emulates packet losses and delays.This paper introduces an architecture and a prototype implementation for a network emulator with highly flexible applicability. The behavior of this emulator is controlled optionally by means of analytical or simulation models or by means of traces based on measurements of packet delays and losses. The emulator allows to consider the impact of background loads in detail. Comprehensive case studies covering video transmissions demonstrate that the emulator can even be used in rather complex scenarios with interconnected communication networks.
Solving Variational Inequality Problems with Linear Constraints by a Proximal Decomposition Algorithm
Authors: Deren Han, Hong K. Lo
Venue: Journal of Global Optimization (2004)

The alternating direction method solves large scale variational inequality problems with linear constraints via solving a series of small scale variational inequality problems with simple constraints. The algorithm is attractive if the subproblems can be solved efficiently and exactly. However, the subproblem is itself variational inequality problem, which is structurally also difficult to solve. In this paper, we develop a new decomposition algorithm, which, at each iteration, just solves a system of well-conditioned linear equations and performs a line search. We allow to solve the subproblem approximately and the accuracy criterion is the constructive one developed recently by Solodov and Svaiter. Under mild assumptions on the problem's data, the algorithm is proved to converge globally. Some preliminary computational results are also reported to illustrate the efficiency of the algorithm.
Clifford algebras and approximating the permanent
Authors: Steve Chien, Lars Rasmussen, Alistair Sinclair
Venue: Journal of Computer and System Sciences (2003)

We study approximation algorithms for the permanent of an n × n (0,1) matrix A based on the following simple idea: obtain a random matrix B by replacing each 1-entry of A independently by ±e, where e is a random basis element of a suitable algebra; then output |det(B)|2. This estimator is always unbiased, but it may have exponentially large variance. In our first main result we show that, if we take the algebra to be a Clifford algebra of dimension polynomial in n, then we get an estimator with small variance. Hence, only a constant number of trials suffices to estimate the permanent to good accuracy. The idea of using Clifford algebras is a natural extension of earlier work by Godsil and Gutman, Karmarkar et al., and Barvinok, who used the real numbers, complex numbers and quaternions, respectively. The above result implies that, in principle, this approach gives a fully-polynomial randomized approximation scheme for the permanent, provided |det(B)|2 can be efficiently computed in the Clifford algebras. Since these algebras are noncommutative it is not clear how to do this. However, our second main result shows how to compute in polynomial time an estimator with the same mean and variance over the 4-dimensional algebra (which is the quaternions, and is non-commutative); in addition to providing some hope that the computations can be performed in higher dimensions, this quaternion algorithm provides an exponential improvement in the variance over that of the 2-dimensional complex version studied by Karmarkar et al.
Coordinated Interchange Scheduling and Opportunity Cost Payment: A Market Proposal to Seams Issues
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

This paper presents a joint market structure for energy, spinning reserves and VAR support in a multi-area setting. It is based on a co-optimization that can simultaneously optimize all three commodities across the "seams". An auxiliary problem principle based decomposition scheme is applied to the overall optimization for coordinating interchanges of energy and ancillary services between control areas. The proposed decomposition approach preserves independent dispatching for neighboring areas while achieves overall optimum. Nodal prices for energy and opportunity cost payments to forgone energy profit due to providing reserves and VAR support are also addressed. We believe the algorithm is of particular interest in the restructuring electricity industry for resolving seams issues. An illustrative example of a modified IEEE 30-bus system is used to demonstrate the validity of proposed algorithm.
The next revolution: vehicle user interfaces
Authors: Aaron Marcus
Venue: interactions (2004)

Imagine having to think about safety, usability, and aesthetics issues for the user interface of a two-ton mobile device hurtling through space at 100 km/hr. Now you get the picture.
Bluetooth-based sensor networks
Authors: Philippe Bonnet, Allan Beaufour, Mads Bondo Dydensborg, Martin Leopold
Venue: ACM SIGMOD Record (2003)

It is neither desirable nor possible to abstract sensor network software from the characteristics of the underlying hardware components. In particular the radio has a major impact on higher level software. In this paper, we review the lessons we learnt using Bluetooth radios in the context of sensor networks. These lessons are relevant for (a) application designers choosing the best radio given a set of requirements and for (b) researchers in the data management community who need to formulate assumptions about underlying sensor networks.
Assessing Staffing Needs for a Software Maintenance Project through Queuing Simulation
Authors: Giuliano Antoniol, Aniello Cimitile, Giuseppe A. Di Lucca, Massimiliano Di Penta
Venue: IEEE Transactions on Software Engineering (2004)

Abstract--We present an approach based on queuing theory and stochastic simulation to help planning, managing, and controlling the project staffing and the resulting service level in distributed multiphase maintenance processes. Data from a Y2K massive maintenance intervention on a large COBOL/JCL financial software system were used to simulate and study different service center configurations for a geographically distributed software maintenance project. In particular, a monolithic configuration corresponding to the customer's point-of-view and more fine-grained configurations, accounting for different process phases as well as for rework, were studied. The queuing theory and stochastic simulation provided a means to assess staffing, evaluate service level, and assess the likelihood to meet the project deadline while executing the project. It turned out to be an effective staffing tool for managers, provided that it is complemented with other project-management tools, in order to prioritize activities, avoid conflicts, and check the availability of resources.