ppxscal/embedding_network huggingface dataset:
Sampling Trajectory Streams with Spatiotemporal Criteria
Authors: Michalis Potamias, Kostas Patroumpas, Timos Sellis
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information about data evolution, provenance detection, pattern matching etc. Despite recent research interest on processing continuous queries in the context of spatiotemporal data streams, the main focus is on managing the current location of numerous moving objects. In this paper, we turn our attention onto a historical perspective of movement and examine trajectories generated by streaming positional updates. The key challenge is how to maintain a concise, yet quite reliable summary of each object's movement, avoiding any superfluous details and saving in processing complexity and communication cost. We propose two single-pass approximation techniques based on sampling that take advantage of the spatial locality and temporal timeliness inherent in trajectory streams. As a means of reducing substantially the scale of the datasets, we utilize heuristic prediction to distinguish which locations to preserve in the compressed trajectories. A comprehensive experimental study verifies the stability and robustness of the proposed techniques and demonstrates that intelligent compression schemes are able to act as effective load shedding operators achieving remarkable results.
Auto-CFD-NOW: A pre-compiler for effectively parallelizing CFD applications on networks of workstations
Authors: Li Xiao, Xiaodong Zhang, Zhengqian Kuang, Baiming Feng, Jichang Kang
Venue: The Journal of Supercomputing (2006)

Computational Fluid Dynamics (CFD) applications are highly demanding for parallel computing. Many such applications have been shifted from expensive MPP boxes to cost-effective Networks of Workstations (NOW). Auto-CFD-NOW is a pre-compiler that transforms Fortran CFD sequential programs to efficient message-passing parallel programs running on NOW. Our work makes the following three unique contributions. First, this pre-compiler is highly automatic, requiring a minimum number of user directives for parallelization. Second, we have applied a dependency analysis technique for the CFD applications, called analysis after partitioning. We propose a mirror-image decomposition technique to parallelize self-dependent field loops that are hard to parallelize by existing methods. Finally, traditional optimizations of communication focus on eliminating redundant synchronizations. We have developed an optimization scheme which combines all the non-redundant synchronizations in CFD programs to further reduce the communication overhead. The Auto-CFD-NOW has been implemented on networks of workstations and has been successfully used for automatically parallelizing structured CFD application programs. Our experiments show its effectiveness and scalability for parallelizing large CFD applications.
Decision Process Reengineering of Outsourcing Based on Manufacturing Specification Management
Authors: F. Wu, C. Liu, P. P. Li, L. J. Ai
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Outsourcing decision-making is related widely factors which are complex and multi- perspectives problems. It is necessary a visual logic process which could be used to recognize complex decision processes in order to let the problems be discussed under an open environment. AS-IS outsourcing process of decision is analyzed by IDEF0 which includes the faults such as only operational consideration for continuous production and short aim of profit and no strategic consideration for core manufacturing competence acquiring and holding. Re-engineering of outsourcing decision process is carried out based on above from perspectives of object, subject, outcome of decision and supplier selection.
SCUBA: Secure Code Update By Attestation in sensor networks
Authors: Arvind Seshadri, Mark Luk, Adrian Perrig, Leendert van Doorn, Pradeep Khosla
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

This paper presents SCUBA (Secure Code Update By Attestation), for detecting and recovering compromised nodes in sensor networks. The SCUBA protocol enables the design of a sensor network that can detect compromised nodes without false negatives, and either repair them through code updates, or revoke the compromised nodes. The SCUBA protocol represents a promising approach for designing secure sensor networks by proposing a first approach for automatic recovery of compromised sensor nodes. The SCUBA protocol is based on ICE (Indisputable Code Execution), a primitive we introduce to dynamically establish a trusted code base on a remote, untrusted sensor node.
Dynamic projective coordinate system for elliptic curve cryptography
Authors: Theeb Ayedh Al-Gahtani
Venue:  (2006)

Scalar multiplication is the basic operation in elliptic curve cryptography that can be performed by many algorithms. These algorithms multiply a scalar value K with an elliptic curve base point P. One of the crucial decisions when implementing an efficient elliptic curve cryptosystem is deciding which point coordinate system to use. The point coordinate system used for addition and doubling of points on the elliptic curve determines the efficiency of these routines, and hence the efficiency of the basic cryptographic operation, scalar multiplication. Although using a fixed coordinate system enhances the performance of the scalar multiplication, (by removing the intermediate inversion operations), it becomes a security weakness since it can be exploited by projective coordinates leak attacks to reveal some secure information. Therefore, finding a coordinate system that can enhance the performance of the scalar multiplication and being secure against such attacks is desired goal. This thesis introduces a new approach called Dynamic Projective Coordinate (DPC) system. DPC provides a framework that automates the selection of the projective coordinate system and uses a single mathematical formulation/software code to implement different projective coordinate systems. This framework allows the computing/encrypting device to select the projective coordinate either at random, or according to a certain rule. DPC uses dynamic transformation functions to convert coordinates of any point on the elliptic curve to any projective coordinates by using the same mathematical formula. These transformation functions are used to develop dynamic addition and doubling formulas for elliptic curve over the prime field GF(p) and over the binary field GF(2m). Also, this thesis proposes a new classification method for Side Channel Attacks (SCA). This classification is based on the type of information being leaked which can be Operation-dependent, Data-dependent, Address-dependent or any combination of them. New countermeasures for data-dependent, data-and-operation dependent and address-dependent attacks are proposed. These countermeasures are based on the fact that DPC lends itself to randomize both the data being manipulated and the number of operations being performed by randomizing the coordinate system used.
Design of a class of multirate systems
Authors: W. M. Campbell, T. W. Parks
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The design of rate-changing multirate systems using a maximum relative l/sup 2/-error criterion is analyzed. Using multirate techniques, the criterion is simplified to a matrix-response approximation problem. An algorithm using convex optimization is proposed to solve the problem. An example illustrates the use of the algorithm and effectiveness over methods intended for LTI system design. This approach is useful if little is known about the signals to be processed.
Automatic generation of simulation program by XML-prolog
Authors: Ryo Fukuhara, Tomoharu Matsunaka, Kazutaka Kitamori
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We have developed an intelligent simulation development environment and intelligent search engine using "XML-Prolog" for as a framework for efficient and stable simulation development. This development environment has a cycle that consists of three elements (modeling, programming, and result generation) which are managed as XML documents. To illustrate the framework, a Monte Carlo simulation and sampling of resultant distributions are performed by logically merging knowledge concerning Monte Carlo methods and sampling techniques retrieved by intellectual means. Knowledge of how programs communicate is added the already merged knowledge and the XML documents are generated. The programming process comprises of simulation conditions and initial values programs which are generated by XML documents. In this paper, we describe automatically generating programs for Monte Carlo simulation with LPWS (Legendre polynomial weighted sampling) using XML-Prolog.
Tutorial on agent-based modeling and simulation
Authors: Charles M. Macal, Michael J. North
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Agent-based modeling and simulation (ABMS) is a new approach to modeling systems comprised of autonomous, interacting agents. ABMS promises to have far-reaching effects on the way that businesses use computers to support decision-making and researchers use electronic laboratories to support their research. Some have gone so far as to contend that ABMS is a third way of doing science besides deductive and inductive reasoning. Computational advances have made possible a growing number of agent-based applications in a variety of fields. Applications range from modeling agent behavior in the stock market and supply chains, to predicting the spread of epidemics and the threat of bio-warfare, from modeling consumer behavior to understanding the fall of ancient civilizations, to name a few. This tutorial describes the theoretical and practical foundations of ABMS, identifies toolkits and methods for developing ABMS models, and provides some thoughts on the relationship between ABMS and traditional modeling techniques.
Identification in electronic networks: characteristics of e-identifiers
Authors: Kayvan M. Lavassani, Bahar Movahedi, Vinod Kumar
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Identification in electronic networks (e-Identification) has been a source of new risks in e-commerce and e-government [3, 22]. Identity theft is the fastest growing white-collar crime in many countries, specifically in developed countries. The identity theft (IDT) report presented by Competition Bureau Canada indicates that the cost of IDT to the economy of Canada has increased by 83% in the period of 2002-2003. Also, the average loss of victims has increased from 1439Cnd$ in 2002, to 1614Cnd$ in 2003. This increase can also be observed in other developed countries at the same level. This rapid increase of identity theft indicates that the development of optimal identification systems in organizations is far behind the development of electronic networks. One of the central issues in IDT is the identification process. Understanding the identification processes in electronic systems, its concepts, and tools are the fundamentals of designing, implementing and operating an efficient and effective identification system. However, there have been very few studies in this area, and there is a gap in literature specifically on identification tools, their characteristics, their efficiency and their effectiveness, and their usability. This paper presents a comprehensive model representing virtually all of the commonly used identifiers in electronic networks and their characteristics, and also presents measures of efficiency and effectiveness of identification tools in electronic networks.1
Neural Correlates of Detecting Pretense: Automatic Engagement of the Intentional Stance under Covert Conditions
Authors: Tim P. German, Jeffrey L. Niehaus, Meghan P. Roarty, Barry Giesbrecht, Michael B. Miller
Venue: Journal of Cognitive Neuroscience (2004)

Typically developing children begin to produce and understand pretend play between 18 and 24 months of age, and early pretense has been argued to be a candidate ''core'' capacity central to the deployment of representations of other peoples' mental states&mdash;''theory of mind.'' In a functional magnetic resonance imaging study, 16 healthy adult volunteers were imaged while watching short (5 sec) clips of actors who either performed simple everyday actions or pretended to perform a similar set of actions, under covert conditions (e. g., participants were not directed to attend to actors' mental states). There was increased activity in the medial prefrontal areas (Brodmann's areas [BA] 9/6/32, 9, and 10), inferior frontal gyrus bilaterally (BA 44, 47), temporo-parietal regions (BA 21 and 22), and parahippocampal areas, including the amygdala, when subjects viewed pretend actions as compared with real actions. This result suggests that at least some areas previously implicated in making explicit mental state judgments are also strongly activated in response to actions that call for mental state interpretation (e. g., pretense) even when there is no explicit instruction for ''mind reading.'' This outcome is discussed in terms of accounts that propose ''theory of mind'' to be underwritten by automatic specialized mechanisms for the interpretation of the behavior of social agents.
A quasi-planar incident wave excitation for time-domain scattering analysis of periodic structures: Research Articles
Authors: David Degerfeldt, Tomas Halleröd, Börje Emilsson, Anders Bondeson, Thomas Rylander
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2006)

We present a quasi-planar incident wave excitation for time-domain scattering analysis of periodic structures. It uses a particular superposition of plane waves that yields an incident wave with the same periodicity as the periodic structure itself. The duration of the incident wave is controlled by means of its frequency spectrum or, equivalently, the angular spread in its constituting plane waves. Accuracy and convergence properties of the method are demonstrated by scattering computations for a planar dielectric half-space. Equipped with the proposed source, a time-domain solver based on linear elements yields an error of roughly 1&percnt; for a resolution of 20 points per wavelength and second-order convergence is achieved for smooth scatterers. Computations of the scattering characteristics for a sinusoidal surface and a random rough surface show similar performance. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Implementing Logic Wrappers Using XSLT Stylesheets
Authors: Amelia Badica, Costin Badica, Elvira Popescu
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The Web has become a major source of information that is easily accessible at low cost by individual and business consumers. Logic wrappers are a new technology that was proposed to help automatizing the task of data extraction from the Web. In this note we present an approach for efficiently implementing logic wrappers with the help of XSLT transformation language. The approach was successfully applied in various application areas: collecting product features from product information sheets and mining travel resources as found on Web sites of online transaction brokers.
A privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms
Authors: Shibnath Mukherjee, Zhiyuan Chen, Aryya Gangopadhyay
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2006)

Privacy preserving data mining has become increasingly popular because it allows sharing of privacy-sensitive data for analysis purposes. However, existing techniques such as random perturbation do not fare well for simple yet widely used and efficient Euclidean distance-based mining algorithms. Although original data distributions can be pretty accurately reconstructed from the perturbed data, distances between individual data points are not preserved, leading to poor accuracy for the distance-based mining methods. Besides, they do not generally focus on data reduction. Other studies on secure multi-party computation often concentrate on techniques useful to very specific mining algorithms and scenarios such that they require modification of the mining algorithms and are often difficult to generalize to other mining algorithms or scenarios. This paper proposes a novel generalized approach using the well-known energy compaction power of Fourier-related transforms to hide sensitive data values and to approximately preserve Euclidean distances in centralized and distributed scenarios to a great degree of accuracy. Three algorithms to select the most important transform coefficients are presented, one for a centralized database case, the second one for a horizontally partitioned, and the third one for a vertically partitioned database case. Experimental results demonstrate the effectiveness of the proposed approach.
GridPPI: A Lightweight Grid-Enabled Parallel Programming Framework
Authors: Sikan Chen, Minglu Li, Feng He
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Parallel application development for Grids can benefit from tools that abstract the underlying Grid middleware, hide the critical aspects of heterogeneous resources and provide utilities for parallelism. As a research on these issues, we have developed Grid Parallel Programming Interface (GridPPI), a Java library aiming at providing a framework for MPI-style development and execution of Java applications in service-oriented Grids. GridPPI primarily comprises an open architecture that is adaptive to various Grid platforms and an MPI-like parallel communication library that includes both basic and collective operations. We describe the design of GridPPI framework and its implementation on ChinaGrid Support Platform 2 (CGSP2) in detail, and present the performance evaluation.
Image-Based Multiclass Boosting and Echocardiographic View Classification
Authors: S. Kevin Zhou, J. H. Park, B. Georgescu, D. Comaniciu, C. Simopoulos, J. Otsuki
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We tackle the problem of automatically classifying cardiac view for an echocardiographic sequence as a multiclass object detection. As a solution, we present an imagebased multiclass boosting procedure. In contrast with conventional approaches for multiple object detection that train multiple binary classifiers, one per object, we learn only one multiclass classifier using the LogitBoosting algorithm. To utilize the fact that, in the midst of boosting, one class is fully separated from the remaining classes, we propose to learn a tree structure that focuses on the remaining classes to improve learning efficiency. Further, we accommodate the large number of background images using a cascade of boosted multiclass classifiers, which is able to simultaneously detect and classify multiple objects while rejecting the background class quickly. Our experiments on echocardiographic view classification demonstrate promising performances of image-based multiclass boosting.
From Wrapping to Knowledge
Authors: Jose L. Arjona, Rafael Corchuelo, David Ruiz, Miguel Toro
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

One the most challenging problems for Enterprise Information Integration is to deal with heterogeneous information sources on the Web. The reason is that they usually provide information that is in human-readable form only, which makes it difficult for a software agent to understand it. Current solutions build on the idea of annotating the information with semantics. If the information is unstructured, proposals such as S-CREAM, MnM, or Armadillo may be effective enough since they rely on using natural language processing techniques; furthermore, their accuracy can be improved by using redundant information on the Web, as C-PANKOW has proved recently. If the information is structured and closely related to a back-end database, Deep Annotation ranges among the most effective proposals, but it requires the information providers to modify their applications; if Deep Annotation is not applicable, the easiest solution consists of using a wrapper and transforming its output into annotations. In this paper, we prove that this transformation can be automated by means of an efficient, domain-independent algorithm. To the best of our knowledge, this is the first attempt to devise and formalize such a systematic, general solution.
On the analysis and interpretation of inhomogeneous quadratic forms as receptive fields
Authors: Pietro Berkes, Laurenz Wiskott
Venue: Neural Computation (2006)

In this letter, we introduce some mathematical and numerical tools to analyze and interpret inhomogeneous quadratic forms. The resulting characterization is in some aspects similar to that given by experimental studies of cortical cells, making it particularly suitable for application to second-order approximations and theoretical models of physiological receptive fields. We first discuss two ways of analyzing a quadratic form by visualizing the coefficients of its quadratic and linear term directly and by considering the eigenvectors of its quadratic term. We then present an algorithm to compute the optimal excitatory and inhibitory stimuli--those that maximize and minimize the considered quadratic form, respectively, given a fixed energy constraint. The analysis of the optimal stimuli is completed by considering their invariances, which are the transformations to which the quadratic form is most insensitive, and by introducing a test to determine which of these are statistically significant. Next we propose a way to measure the relative contribution of the quadratic and linear term to the total output of the quadratic form. Furthermore, we derive simpler versions of the above techniques in the special case of a quadratic form without linear term. In the final part of the letter, we show that for each quadratic form, it is possible to build an equivalent two-layer neural network, which is compatible with (but more general than) related networks used in some recent articles and with the energy model of complex cells. We show that the neural network is unique only up to an arbitrary orthogonal transformation of the excitatory and inhibitory subunits in the first layer.
Creating an inquiry-learning environment using the world wide web
Authors: Gene Alloway, Nathan Bos, Kathleen Hamel, Tracy Hammerman, Elisabeth Klann, Joseph Krajcik, David Lyons, Terry Madden, Jon Margerum-Leys, James Reed, Nancy Scala, Elliot Soloway, Ioanna Vekiri, Raven Wallace
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The University of Michigan Digital Library (UMDL) Project provides guidelines and design standards for teaching and learning materials and methods to support science inquiry using on-line resources. In this paper, we present an initial report of our experiences using online resources to promote sustained inquiry in science classrooms. We examine the challenges faced by teachers and students as well as the challenges posed in creating or finding useful content and in designing the technological tools for students to investigate meaningful questions on-line.