ppxscal/embedding_network huggingface dataset:
Training to Detect Deception: An Experimental Investigation
Authors: Joey F. George, Kent Marett, Judee K. Burgoon, Janna Crews, Jinwei Cao, Ming Lin, David P. Biros
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Humans are not very good at detecting deception in normal communication. One possible remedy for improving detection accuracy is to educate people about various indicators of deception and then train them to spot these indicators when they are used in normal communication. This paper reports on one such training effort involving over 100 military officers. Participants received training on deception detection generally, on specific indicators, and on heuristics. They completed pre- and post-tests on their knowledge in these areas and on their ability to detect deception. Detection accuracy was measured by asking participants to judge if behavior in a video, on an audiotape, or in a text passage was deceptive or honest.Trained individuals outperformed those who did not receive training on the knowledge tests, but there were no differences between the groups in detection accuracy. In addition, individuals who received training using specially developed software did as well as individuals who were trained by lecture or by lecture and software in combination, for both knowledge and detection accuracy.
A new method for the state reduction of incompletely specified finite sequential machines
Authors: M. J. Avedillo, J. M. Quintana, J. L. Huertas
Venue: Proceedings of the conference on European design automation (1990)

A new method for the state reduction of incompletely specified Finite Sequential Machines is proposed. Fundamental theorem of minimization theory states that, given an incomplete state table, another state table specifying the same external behavior corresponds to each closed set of compatibility classes which covers all internal states of the given table. The new heuristic algorithm builds up a closed cover for a given state table selecting maximal compatibles (MCs) one by one until both covering and closure requirements are satisfied. Near-minimal solutions are so incrementally generated. The process is dynamic as the consequences of adding a particular MC are precisely determine. The new algorithm is designed for speed and has proven to be extremely valuable in situations where fast but good optimization is required. The algorithm has been programmed and results on a wide set of machines shown.
Dependence of the stability of semi-implicit atmospheric models on reference temperature profile
Authors: A. Bourchtein, M. Naumov
Venue: Applied Numerical Mathematics (2003)

The linear stability of three-time-level finite-difference semi-implicit schemes is studied for hydrostatic atmospheric models with viscosity terms. The main objective is the investigation of stability dependence on choice of reference temperature profile. Characteristic equation for amplification factor is derived in the case of simplified baroclinic atmospheric numerical model, keeping the implicit approximation for the basic temperature profile and explicit approximation for its deviations. Analytical solutions for amplification factor are found in some special cases and computational experiments are performed for different values of model parameters, such as vertical discretization (number of levels and its distribution), temperature profile (basic and actual), and time step. The influence of the viscosity terms on scheme stability is also studied. Performed analysis confirms two main results obtained numerically in other models: instability generated by inappropriate determination of temperature profile is absolute and computational stability can be recovered if the basic reference profile is chosen to be warmer than the actual one.
On permuting cut with contraction
Authors: Mirjana Borisavljević, Kosta Došen, Zoran Petrić
Venue: Mathematical Structures in Computer Science (2000)

This paper presents a cut-elimination procedure for intuitionistic propositional logic in which cut is eliminated directly, without introducing the multiple-cut rule mix, and in which pushing cut above contraction is one of the reduction steps. The presentation of this procedure is preceded by an analysis of Gentzen's mix-elimination procedure, made in the perspective of permuting cut with contraction. We also show that in the absence of implication, pushing cut above contraction does not pose problems for directly eliminating cut.
Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics
Authors: Cristina Boeres, Alexandre Lima, Vinod E. F. Rebello
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Researchers are constantly looking for ways to improve the execution time of parallel applications on distributed systems. Although compile-time static scheduling heuristics employ complex mechanisms, the quality of their schedules are handicapped by estimated run-time costs. On the other hand, while dynamic schedulers use actual run-time costs, they have to be of low complexity in order to reduce the scheduling overhead. This paper investigates the viability of integrating these two approaches into a hybrid scheduling framework. The relationship between static schedulers, dynamic heuristics and scheduling events are examined. The results show that a hybrid scheduler can indeed improve the schedules produced by good traditional static list scheduling algorithms.
Building Collaboration into IDEs
Authors: Li-Te Cheng, Cleidson R.B. de Souza, Susanne Hupfer, John Patterson, Steven Ross
Venue: Queue (2003)

Software development is rarely a solo coding effort. More often, it is a collaborative process, with teams of developers working together to design solutions and produce quality code. The members of these close-knit teams often look at one another’s code, collectively make plans about how to proceed, and even fix each other’s bugs when necessary. Teamwork does not stop there, however. An extended team may include project managers, testers, architects, designers, writers, and other specialists, as well as other programming teams. Programmers also interact with the community of developers outside their organization to obtain advice, code snippets, and a general understanding of what works and what doesn’t.
Runtime Power Monitoring in High-End Processors: Methodology and Empirical Data
Authors: Canturk Isci, Margaret Martonosi
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

With power dissipation becoming an increasingly vexingproblem across many classes of computer systems, measuringpower dissipation of real, running systems has becomecrucial for hardware and software system research and design.Live power measurements are imperative for studiesrequiring execution times too long for simulation, such asthermal analysis. Furthermore, as processors become morecomplex and include a host of aggressive dynamic powermanagement techniques, per-component estimates of powerdissipation have become both more challenging as well asmore important.In this paper we describe our technique for a coordinatedmeasurement approach that combines real totalpower measurement with performance-counter-based, per-unitpower estimation. The resulting tool offers live totalpower measurements for Intel Pentium 4 processors, andalso provides power breakdowns for 22 of the major CPUsubunits over minutes of SPEC2000 and desktop workloadexecution. As an example application, we use the generatedcomponent power breakdowns to identify program powerphase behavior. Overall, this paper demonstrates a processorpower measurement and estimation methodology andalso gives experiences and empirical application resultsthat can provide a basis for future power-aware research.
Singularities in the spatial complex plane for vortex sheets and thin vortex layers
Authors: Gregory R. Baker
Venue:  (2003)

An important special case of shear layers is the narrowly confined vortex layer whose mathematical model is a vortex sheet with the motion described by the Birkhoff equation. Consistent discretizations of the Birkhoff equation fail to yield reliable results; in particular, a curvature singularity forms in finite time. This failure motivated the development of alternative approaches. One of them is to replace the vortex sheet by a layer of finite thickness and uniform vorticity. That prevents singularity formation. The limiting behaviour of a thin layer may be addressed by understanding the formation and subsequent motion of singularities formed in the spatial complex plane. Next, the motion of these singularities can be compared to that of the equivalent vortex sheet. The difficulty is that the parametrizations for vortex sheet and the boundaries of the thin layer do not coincide. Therefore, a new and easy way is found to compare the motion of a thin layer with the motion of a vortex sheet. The motion of the fluid particles on one side of the sheet is used, and this choice is referred to as a one-sided vortex sheet. As a result, the fluid motion of the boundary of the thin layer becomes the motion of the fluid particles of a one-sided vortex sheet in the limit of vanishing thickness. The equations of motion for a one-sided vortex sheet are derived and analytically continued into the complex plane of the new parametrization. Asymptotic methods applied to these equations reveal the presence of a 3/2-power singularity moving towards the real axis. This singularity is related to the one for the classical vortex sheet by studying the mapping between the parametrizations. The equations of motion for the thin layer are also analytically continued into the complex plane of the parametrization variable. By studying the limit of vanishing thickness, confirmation is made that the motion of the boundary of the thin layer does become the motion of the one-sided vortex sheet. Finally, asymptotic methods are applied to the analytically continued equations to understand the initial formation of singularities. Numerical calculations of the boundary motion confirm the presence of 3/2-power singularities. The trajectory of these singularities approach the one for the vortex sheet in the limit of vanishing thickness before the singularity time.
Mapping performer parameters to synthesis engines
Authors: Andy Hunt, Marcelo M. Wanderley
Venue: Organised Sound (2002)

This paper considers the issues involved in the design of electronic and computer interfaces, specifically mapping - the designed link between an instrument's playing interface and its sound source. It defines the problem area, reviews the literature, and gives examples of specific system mappings. A general model is presented, with the aim of providing a framework for future discussions on what makes an effective mapping. Several guidelines for mapping strategies are given, based on existing work.
Performance Modeling of Distributed Hybrid Architectures
Authors: Piero F. Spinnato, G. D. van Albada, Peter M. A. Sloot
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--Hybrid architectures are systems where a high performance general purpose computer is coupled to one or more Special Purpose Devices (SPDs). Such a system can be the optimal choice for several fields of computational science. Configuring the system and finding the optimal mapping of the application tasks onto the hybrid machine often is not straightforward. Performance modeling is a tool to tackle and solve these problems. We have developed a performance model to simulate the behavior of a hybrid architecture consisting of a parallel multiprocessor where some nodes are the host of a GRAPE board. GRAPE is a very high performance SPD used in computational astrophysics. We validate our model on the architecture at our disposal, and show examples of predictions that our model can produce.
Scape: Supporting Stereoscopic Collaboration in Augmented and Projective Environments
Authors: Hong Hua, Leonard D. Brown, Chunyu Gao
Venue: IEEE Computer Graphics and Applications (2004)

Our collaborative augmented reality system for multiple users simultaneously creates outside-in workbench views and inside-out life-size walk-through views, bridging the virtual and augmented reality paradigms.
A Constructive Approach to Hardware/Software Partitioning
Authors: Leila Silva, Augusto Sampaio, Edna Barros
Venue: Formal Methods in System Design (2004)

A crucial point in hardware/software co-design is how to perform the partitioning of a system into hardware and software components. Although several algorithms to partitioning have been recently proposed, the formal verification of the partitioning procedure is an emergent research topic. In this paper we present an innovative and automatic approach to partitioning with emphasis on correctness. The formalism used is occam and the algebraic laws that define its semantics. In the proposed approach, the partitioning procedure is characterised as a program transformation task and the partitioned system is derived from the original description of the system by applying transformation rules, all of them proved from the basic laws of occam. A tool has been developed to allow the partitioning to be carried out automatically. The entire approach is illustrated here through a small case study.
Combining qualitative evaluation and social network analysis for the study of classroom social interactions
Authors: A. Martínez, Y. Dimitriadis, B. Rubia, E. Gómez, P. de la Fuente
Venue: Computers Education (2003)

Studying and evaluating real experiences that promote active and collaborative learning is a crucial field in CSCL. Major issues that remain unsolved deal with the merging of qualitative and quantitative methods and data, especially in educational settings that involve both physical and computer-supported collaboration. In this paper we present a mixed evaluation method that combines traditional sources of data with computer logs, and integrates quantitative statistics, qualitative data analysis and social network analysis in an overall interpretative approach. Several computer tools have been developed to assist in this process, integrated with generic software for qualitative analysis. The evaluation method and tools have been incrementally applied and validated in the context of an educational and research project that has been going on during the last three years. The use of the method is illustrated in this paper by an example consisting of the evaluation of a particular category within this project. The proposed method and tools aim at giving an answer to the need of innovative techniques for the study of new forms of interaction emerging in CSCL; at increasing the efficiency of the traditionally demanding qualitative methods, so that they can be used by teachers in curriculum-based experiences; and at the definition of a set of guidelines for bridging different data sources and analysis perspectives.
Propp&ndash;Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields
Authors: Olle Häggström, Jeffrey E. Steif
Venue: Combinatorics, Probability and Computing (2000)

In this paper, we combine two previous works, the first being by the first author and K. Nelander, and the second by J. van den Berg and the second author, to show (1) that one can carry out a Propp&ndash;Wilson exact simulation for all Markov random fields on &Zopf;d satisfying a certain high noise assumption, and (2) that all such random fields are a finitary image of a finite state i.i.d. process. (2) is a strengthening of the previously known fact that such random fields are so-called Bernoulli shifts.
An extensible architecture-based framework for coordination languages
Authors: Torsten Fink, Karsten Otto
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The dynamic and heterogeneous nature of distributed systems make the development of distributed applications a difficult task. Various tools, such as middleware systems, component systems, and coordination languages, offer support to the application developer at different levels.There are several coordination systems that integrate such tools into a complete environment to build applications from heterogeneous components. To achieve extensibility they usually have a layered architecture: An application is first mapped to a middle layer and then to a target system. But this approach hides the specific features of a target system from the developer, as they are not represented in the middle layer, and often induces additional run-time overhead.In this paper we introduce the extensible coordination framework ECF that allows developers to build efficient distributed applications which exploit the specific features of the target systems. Support for target systems and application domains are encapsulated by extension modules. Modules can be built on top of other modules to support refined functionality.
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
Authors: João Paulo De Angeli, Andréa M. P. Valli, Neyval C. Reis,  Jr., Alberto F. De Souza
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel computing platforms with distributed-memory, particularly for clusters of workstations. The solution algorithm for the Navier-Stokes equations utilizes an explicit scheme for pressure and an implicit scheme forvelocities, i. e., the velocity field at a new time step can be computed once the corresponding pressure is known. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a separate processing node. All nodes then execute computations in parallel, each node on its associated subdomain. The parallel computations include initialization, coefficient generation, linear solution on the sub-domain, and inter-node communication. The exchange of information across the sub-domains, or processors, is achieved using the message passing interface standard, MPI. The use of MPI ensures portability across different computing platforms ranging from massively parallel machines to clusters of workstations. The execution time and speed-up are evaluated through comparing the performance of different numbers of processors. The results indicate that the parallel code can significantly improve prediction capability and efficiency for largescale simulations.
Training in remote database server administration
Authors: Ludwig Slusky, Parviz Partow-Navid
Venue: Current issues in IT education (2003)

This chapter introduces the development of a Unix Lab at the Department of Information Systems at California State University, Los Angeles. It also describes the lab's impact on our curriculum and the future plans for the inclusion of remote access and wireless technology.
Morphology-driven simplification and multiresolution modeling of terrains
Authors: Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed Mostefa Mesmoudi, Enrico Puppo
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

We propose a technique for simplification and multiresolution modeling of a terrain represented as a TIN. Our goal is to maintain the morphological structure of the terrain in the resulting multiresolution model. To this aim, we extend Morse theory, developed for continuous and differentiable functions, to the case of piecewise linear functions. We decompose a TIN into areas with uniform morphological properties (such as valleys, basins, etc.) separated by a network of critical lines and points. We describe an algorithm to compute the above decomposition and the critical net, and a TIN simplification algorithm that preserves them. On this basis, we build a multiresolution terrain model, which provides a representation of critical features at any level of detail.
Evolutionary semi-supervised fuzzy clustering
Authors: Hong Liu, Shang-Teng Huang
Venue: Pattern Recognition Letters (2003)

For learning classifier from labeled and unlabeled data, this paper proposes an evolutionary semi-supervised fuzzy clustering algorithm. Class labels information provided by labeled data is used to guide the evolution process of each fuzzy partition on unlabeled data, which plays the role of chromosome. The fitness of each chromosome is evaluated with a combination of fuzzy within cluster variance of unlabeled data and misclassification error of labeled data. The structure of the clusters obtained can be used to classify a future new pattern. The performance of the proposed approach is evaluated using two benchmark data sets. Experimental results indicate that the proposed approach can improve classification accuracy significantly, compared to classifier trained with a small number of labeled data only. Also, it outperforms a similar approach SSFCM.
Deployment and Dynamic Reconfiguration Planning for Distributed Software Systems
Authors: Naveed Arshad, Dennis Heimbigner, Alexander. L. Wolf
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Initial deployment and subsequent dynamic reconfiguration of a software system is difficult because of the interplay of many interdependent factors, including cost, time, application state, and system resources. As the size and complexity of software systems increases, procedures (manual or automated) that assume a static software architecture and environment are becoming untenable. We have developed a novel technique for carrying out the deployment and reconfiguration planning processes that leverages recent advances in the field of temporal planning. We describe a tool called Planit, which manages the deployment and reconfiguration of a software system utilizing a temporal planner. Given a model of the structure of a software system, the network upon which the system should be hosted, and a goal configuration, Planit will use the temporal planner to devise possible deployments of the system. Given information about changes in the state of the system, network and a revised goal, Planit will use the temporal planner to devise possible reconfigurations of the system. We present the results of a case study in which Planit is applied to a system consisting of variouscomponents that communicate across an application-level overlay network.
A nonterminating 8&#x03C6;7 summation for the root system Cr
Authors: Michael Schlosser
Venue: Journal of Computational and Applied Mathematics (2003)

Using multiple q-integrals and a determinant evaluation, we establish a nonterminating 8φ7 summation for the root system Cr. We also give some important specializations explicitly.
Method for the Focal Plane Determination of Microscopic Objects
Authors: Miguel E. Bravo-Zanoguera, Miguel A. Paz-González, Jeffrey H. Price
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Microscopy autofocus is designed to obtain the bestaverage focus over the entire field of view, even thoughobjects often reside at multiple foci. Here we reportdesign of a focus detection circuit for random accessoperation on any object in a given area-of-interest. Apreviously reported focus measurement techniquebased on the energy of the high frequency componentsof the video signal was modified to operate on aprogrammable area-of-interest. Then, thedetermination of the focal plane of the measuredregion corresponds to the position where the focusmeasure is maximized for the object. Resolutions ofless than 10 µm have been obtained for the focal planedetermination of contiguous objects. Besides, goodflexibility on setting the size of the measuring windowhas been achieved. We expect that this development,coupled to additional image analysis automation, willprovide tremendous savings in labor for complexmicromanipulation.