ppxscal/embedding_network huggingface dataset:
Numerical algebraic geometry and symbolic computation
Authors: Jan Verschelde
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

In a recent joint work with Andrew Sommese and Charles Wampler, numerical homotopy continuation methods have been developed to deal with positive dimensional solution sets of polynomial systems. As solving polynomial systems is such a fundamental problem, connections with recent research in symbolic computation are not hard to find. We will address two such connections.One part of the numerical output of our methods consists of a "membership test" used to determine whether a point lies on apositive dimensional solution component. While Grobner bases provide an exact answer to the ideal membership test, geometrical results can be obtained at a lower complexity, as shown by Marc Giusti and Joos Heintz [6]. The recent work of Gregoire Lecerf [7, 9] implements an irreducible decomposition in a symbolic manner.The factorization of multivariate polynomials with approximate coefficients was posed as an open problem in symbolic computation by Erich Kaltofen [8]. Providing a certificate for a numerical factorization by means of the linear trace is related to ideas of André Galligo and David Rupprecht [3, 4], which also appears in the works of Tateaki Sasaki [10] and collaborators. See also [1, 2] and [5].
A framework of using cooperating mobile agents to achieve load sharing in distributed web server groups
Authors: Jiannong Cao, Xianbing Wang, Sajal K. Das
Venue: Future Generation Computer Systems (2004)

This paper studies the issues of using mobile agents to achieve load sharing for network services in a wide-area network environment such as the Internet. Traditionally, load sharing algorithms are based on the message-passing paradigm. In this paper, we propose the use of mobile agents as an aid to design fully distributed and dynamic load-sharing mechanisms for wide-area network services, which provide several advantages over the pure message-passing-based approach. A framework (called MALS--mobile agent-enabled load-sharing) for structuring and designing load sharing in wide-area network services is presented. In particular, we describe the design of a mobile agent-enabled distributed dynamic load-sharing scheme within the MALS framework. A simulation environment of the load-sharing protocol is being implemented using AgletTM, a Java-compliant mobile agent platform from IBM. Preliminary experimental results demonstrated that the proposed framework is effective.
Rigorous Numerics for Dissipative Partial Differential Equations II. Periodic Orbit for the Kuramoto&#x2013;Sivashinsky PDE&#x2014;A Computer-Assisted Proof
Authors: Piotr Zgliczynski
Venue: Foundations of Computational Mathematics (2004)

We present a method of self-consistent a priori bounds, which allows us to study rigorously the dynamics of dissipative PDEs. As an application we present a computer-assisted proof of the existence of a periodic orbit for the Kuramoto-Sivashinsky equation where &#x03bd; = 0.127.
Genetically induced communication network fault tolerance
Authors: Stephen F. Bush
Venue: Complexity (2003)

This article presents the architecture and initial feasibility results of a proto-type communication network that utilizes genetic programming to evolve services and protocols as part of network operation. The network evolves responses to environmental conditions in a manner that could not be pre-programmed within legacy network nodes a priori. A priori in this case means before network operation has begun. Genetic material is exchanged, loaded, and run dynamically within an active network. The transfer and execution of code in support of the evolution of network protocols and services would not be possible without the active network environment. Rapid generation of network service code occurs via a genetic programming paradigm. Complexity and algorithmic information theory play a key role in understanding and guiding code evolution within the network.
Effects of long-term use of video-communication technologies on the conversational process
Authors: Rick van der Kleij, M. Paashuis, J. Langefeld (Anja), C. Schraagen
Venue: Cognition, Technology and Work (2004)

This paper examines the conversational process in video-mediated groups as compared to face-to-face groups. In a longitudinal between-groups design, 22 three-person groups were tested in four one-hour test sessions at two-week intervals. In each session, groups had to select and argue the correct answer out of three alternatives from a total of ten questions. The questions were selected from the archives of an annual Dutch television show called The Science Quiz. Results showed that, compared to face-to-face groups, video-mediated groups took more time for turns, required fewer turns to complete the task, interrupted each other less, and were less satisfied. At the end of the experiment, initial differences between groups on all these measures, except for satisfaction, had disappeared, suggesting an adaptation effect. The results are discussed in terms of implications for the design of video-communication technologies and possibilities for future research.
Software validation via scalable path-sensitive value flow analysis
Authors: Nurit Dor, Stephen Adams, Manuvir Das, Zhe Yang
Venue: Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis (2004)

In this paper, we present a new algorithm for tracking the flow of values through a program. Our algorithm represents a substantial improvement over the state of the art. Previously described value flow analyses that are control-flow sensitive do not scale well, nor do they eliminate value flow information from infeasible execution paths (i.e., they are path-insensitive). Our algorithm scales to large programs, and it is path-sensitive.The efficiency of our algorithm arises from three insights: The value flow problem can be "bit-vectorized" by tracking the flow of one value at a time; dataflow facts from different execution paths with the same value flow information can be merged; and information about complex aliasing that affects value flow can be plugged in from a different analysis.We have incorporated our analysis in ESP, a software validation tool. We have used ESP to validate the Windows operating system kernel (a million lines of code) against an important security property. This experience suggests that our algorithm scales to large programs, and is accurate enough to trace the flow of values in real code.
Re-examining the measurement models of success for internet commerce
Authors: Jerry Cha-Jan Chang, Gholamreza Torkzadeh, Gurpreet Dhillon
Venue: Information and Management (2004)

In an effort to understand the value of Internet commerce, Keeney interviewed over 100 individuals and proposed two sets of variables: means and fundamental objectives for Internet shopping. The first help businesses deliver what is important for customers so that the customers' objectives are achieved. Fundamental objectives represent ultimate values that customers care about and will influence their overall satisfaction. Using a sample of 620 responses in a two-phase exploratory study, two of the authors previously developed a 5-factor 21-item instrument to measure means objectives and a 4-factor 16-item instrument to measure fundamental objectives. They also proposed a second-order model of the fundamental objectives as a measure of overall customer satisfaction. The new study described here examined the two hypothesized measurement models and the proposed second-order model using a sample of 331 responses. Results confirm factor structures of the two models and suggest a more parsimonious instrument for each; a 5-factor 15-item scale for means objectives and a 4-factor 8-item scale for fundamental objectives. Goodness-of-fit indices for putative models of factor structures and the second-order model are presented.
Balanced Integration of Information Security into Business Management
Authors: Juhani Anttila, Jorma Kajava, Rauno Varonen
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Information is a basic building block of our modern society and needs to be protected. This paper approaches the question of information security from the viewpoint of business management. Information security is not a separate entity, isolated from other business practices; rather, it constitutes an integral part of the modern business management system, and assists the organization to achieve and maintain a competitive edge over its business rivals. The aim for business performance, including information security, is superiority over competitors. Fulfilling only the minimum requirements or achieving mediocrity is not enough. Since modern businesses are based on a process approach, also information security should be integrated into the management of business processes.
SIMT " A Privacy Preserving Web Metrics Tool
Authors: Maximilian Teltzrow, Soren Preibusch, Bettina Berendt
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Consumer metrics for analyzing the success of customer relationship management (CRM) are gaining increasing importance. CRM software packages have become commonplace. However, two major shortcomings exist. First, most software solutions are not offered as a web service on the Internet. Second, privacy restrictions need to be integrated into an overall framework of success indicators for consumer analysis. Whereas the first aspect can be addressed with standardized developer software for web services, the second must consider privacy legislation, privacy specifications on web sites (P3P), and data re-identification problems. To address these problems, we have developed a web service ¿ called SIMT ¿ that automatically adapts CRM indicators to an online retailerýs P3P policy. It is based on a declarative specification of privacy constraints, and syntactically extends P3P. This paper presents the prototype and describes how inference problems and legal restrictions have been addressed. The system has been tested on data from a large multi-channel retailer.
Blueprints: illustrating architecture and technical parts using hardware-accelerated non-photorealistic rendering
Authors: Marc Nienhaus, Jürgen Döllner
Venue: Proceedings of Graphics Interface 2004 (2004)

Outlining and enhancing visible and occluded features in drafts of architecture and technical parts are essential techniques to visualize complex aggregated objects and to illustrate position, layout, and relations of their components.In this paper, we present blueprints, a novel non-photorealistic hardware-accelerated rendering technique that outlines visible and non-visible perceptually important edges of 3D objects. Our technique is based on the edge map algorithm and the depth peeling technique to extract these edges from arbitrary 3D scene geometry in depth-sorted order. After edge maps have been generated, they are composed in image space using depth sprites, which allow us to combine blueprints with further 3D scene contents. We introduce depth masking to dynamically adapt the number of rendering passes for highlighting and illustrating features of particular importance and their relation to the entire assembly. Finally, we give an example of blueprints that visualize and illustrate ancient architecture in the scope of cultural heritage.
Analysis of Preconditioners for Saddle-Point Problems
Authors: D. Loghin, A. J. Wathen
Venue: SIAM Journal on Scientific Computing (2004)

Mixed finite element formulations give rise to large, sparse, block linear systems of equations, the solution of which is often sought via a preconditioned iterative technique. In this work we present a general analysis of block-preconditioners based on the stability conditions inherited from the formulation of the finite element method (the Babuska--Brezzi, or inf-sup, conditions). The analysis is motivated by the notions of norm-equivalence and field-of-values-equivalence of matrices. In particular, we give sufficient conditions for diagonal and triangular block-preconditioners to be norm- and field-of-values-equivalent to the system matrix.
Curvature Tensor Based Triangle Mesh Segmentation with Boundary Rectification
Authors: Lavoue Guillaume, Dupont Florent, Baskurt Atilla
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a new and efficient algorithm forthe decomposition of 3D arbitrary triangle meshes intosurface patches. The algorithm is based on thecurvature tensor field analysis and presents twodistinct complementary steps: a region basedsegmentation, which is an improvement of thatpresented in [1] and which decomposes the object intoknown and near constant curvature patches, and aboundary rectification based on curvature tensordirections, which corrects boundaries by suppressingtheir artifacts or discontinuities. Experiments wereconducted on various models including both CAD andnatural objects, results are satisfactory. Resultingsegmented patches, by virtue of their properties (knowncurvature, clean boundaries) are particularly adaptedto computer graphics tasks like parametric orsubdivision surface fitting in an adaptive compressionobjective.
Automatic Lecture Archiving System
Authors: Michihiko Minoh
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

An automatic lecture archiving system thatrecognizes dynamic situations in the classroom usingmulti modal sensors is presented. Since one of the mostimportant contents is human activity, such as meetings,lectures and events in the society, it becomes importantto record it without disturbing the activity. Thearchiving system for recording such activity may havecommon concept, and we name it as "environmentalmedia". Under this concept, we have developed anautomatic lecture archiving system and used it inseveral courses in our university. In this paper, themedia processing part of the automatic lecturearchiving system is mainly discussed.
Hole trapping in HfO2 insulators on Si(100)
Authors: V. V. Afanas'ev, A. Stesmans
Venue: Microelectronic Engineering (2004)

Hole trapping in insulating layers of HfO2 grown on Si(100) using different deposition methods is analysed by generating electron-hole pairs in the oxide and observing the stable trapped charge. The charge trapping appears to be strongly sensitive to the chemistry of the particular deposition method. The dependence of the trapped charge density on the HfO2 thickness indicates the hole trapping to be predominantly associated with a SiO2-like interlayer formed between Si and HfO2 during the deposition process or subsequent annealing. The diamagnetic nature of the positively charge centers in combination with the observed correlation between the positive charge and the release of atomic hydrogen at the Si/oxide interface suggest that the positive charge may be related to protonic species.
Temperature and drain voltage dependence of gate-induced drain leakage
Authors: L. Lopez, P. Masson, D. Née, R. Bouchakour
Venue: Microelectronic Engineering (2004)

The aim of this paper is to develop a simple and accurate model of the gate induced drain leakage (GIDL) of MOSFET's that can be easily implemented in a circuit simulator. We use an analytical expression of band-to-band tunneling in the case of trap-free gate oxide. The dependence of the GIDL current with temperature and with the drain potential is studded and modeled in the case of a n-MOS transistor. A methodology of parameter extraction is proposed.
Resilient infrastructure for network security
Authors: Matthew M. Williamson
Venue: Complexity (2003)

Present-day network security mechanisms are based on preventing attacks and responding to them as they occur. In the time before a response is implemented the attack is generally free to damage the system. Because responses are usually human driven, this time is long and the damage can be large. One way to minimize this damage is to create "resilient infrastructure." This is infrastructure that automatically slows attacks, so buying time for a human response. This article argues the case for resilient infrastructure in network security.
Energy-Efficient Communication in Multi-Channel Single-Hop Sensor Networks
Authors: Amol Bakshi, Viktor K. Prasanna
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Sensor networks are usually designed and optimized fora specific functionality, and the nature of tasks on differentnodes and the pattern of communication between nodesis known at design time.We are investigating a design approachfor sensor networks that involves the creation of robustand energy-efficient protocols for a library of generalcommunication primitives.Such a library will hide low-levelnetworking details and provide building blocks for theend user who can then focus on high level design of the application.In this paper, we consider single hop sensor networkswith multiple data channels, and define and evaluatethe performance of a simple and energy-efficient protocolfor a general and powerful primitive called (N, p, k¿, k¿)routing.This primitive denotes the transfer of N packetsamong p nodes with each node transmitting at most k¿ packetsand each node expecting to receive at most k¿ packets.One-to-all (broadcast), all-to-one (gather), many-to-many,etc., are special cases of (N, p, k¿, k¿) routing.Weuse a separate low-power control channel for coordinationamong nodes.Simulation results show that our protocolleads to very high utilization of the available databandwidth, and is also energy balanced.Fault-tolerant extensionsof the protocol are also discussed.
Shingle-Based Query Indexing for Location-Based Mobile E-Commerce
Authors: Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

We present a shingle-based query index (SQI) for supporting location-based services in mobile e-commerce. SQI is used to efficiently identify moving objects that are currently located inside a geographical region. A set of virtual shingles is predefined, each with a unique ID. One or more shingles are used to cover the geographical region defined by a range query, where the covering shingles may overlap with one another. SQI maintains a direct mapping from individual shingles to the range queries that contain them. The use of covering shingles has two important properties. First, it does not impose any limit on the object moving speed or direction. Second, it allows the reevaluation of continual range queries to capitalize on the incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of SQI and compare it with a cell-based approach.
Multi-Criteria Query Optimization in the Presence of Result Size and Quality Tradeoffs
Authors: Lakshmi Priya Mahalingam, K. Selçuk Candan
Venue: Multimedia Tools and Applications (2004)

In this paper, we present novel multi-criteria query optimization techniques for performing query optimization in databases, such as multimedia and web databases, which rely on imperfect access mechanisms and top-k predicates. We present an optimization model that (1) takes into account different binding patterns associated with query predicates, (2) considers the variations in the expected query result sizes as a function of query execution plans, and (3) considers the expected result qualities of the execution orders. We address the complexity and the well-known NP-complete nature of the query optimization problem by adaptively reducing the granularity of the search space. For this purpose, unlike the data histograms which capture the data distribution, we propose opt-histograms that capture the distribution of sub-query-plan values over many optimization tasks.
Unifying proof methodologies of duration calculus and timed linear temporal logic
Authors: Zhiming Liu, Anders P. Ravn, Xiaoshan Li
Venue: Formal Aspects of Computing (2004)

Linear temporal logic (LTL) has been widely used for specification and verification of reactive systems. Its standard model is sequences of states (or state transitions), and formulas describe sequencing of state transitions. When LTL is used to model real-time systems, a state is extended with a time stamp to record when a state transition takes place. Duration calculus (DC) is another well studied approach for real-time systems development. DC models behaviours of a system by functions from the domain of reals representing time to the system states. This paper extends this time domain to the Cartesian product of the real and the natural numbers. With the extended time domain, we provide the chop modality with a non-overlapping interpretation. This allows some linear temporal operators explicitly dealing with the discrete dimension of time to be derivable from the chop modality in essentially the same way that their continuous-time counterparts are in the classical DC. This provides a nice embedding of some timed LTL (TLTL) modalities into DC to unify the methods from DC and LTL for real-time systems development: Requirements and high level design decisions are interval properties and are therefore specified and reasoned about in DC, while properties of an implementation, as well as the refinement relation between two implementations, are specified and verified compositionally and inductively in LTL. Implementation properties are related to requirement and design properties by rules for lifting LTL formulas to DC formulas.
A Matlab Based On-Chip Signal Generation and Analysis Environment for Mixed Signal Circuits
Authors: Thomas O'Shea, Ian Grout
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper will discuss a PC based hardware/softwaredevelopment system for aiding the design of MemoryBased Analogue Signal Generation [Analogue Test Signal Generation Using Periodic Sigma-Delta-Encoded Data Streams] to be included inBuilt-In Self-Test (BIST) solutions for Analogue to DigitalConverters (ADCs). In this tester arrangement, Matlab isused, via Simulink Modelling, to generate a test stimulus,which can be directly downloaded into the developmenthardware, which emulates an On-Chip BIST solution.
Operator splitting and adaptive mesh refinement for the Luo-Rudy I model
Authors: John A. Trangenstein, Chisup Kim
Venue: Journal of Computational Physics (2004)

We apply second-order operator splitting to the Luo-Rudy I model for electrical wave propagation in the heart. The purpose of the operator splitting is to separate the nonlinear but local reaction computations from the linear but globally coupled diffusion computations. This approach allows us to use local nonlinear iterations for the stiff nonlinear reactions and to solve global linear systems for the implicit treatment of diffusion. For computational efficiency, we use dynamically adaptive mesh refinement (AMR), involving hierarchies of unions of grid patches on distinct levels of refinement. The linear system for the discretization of the diffusion on the composite AMR grid is formulated via standard conforming finite elements on unions grid patches within a level of refinement and aligned mortar elements along interfaces between levels of refinement. The linear systems are solved iteratively by preconditioned conjugate gradients. Our preconditioner uses multiplicative domain decomposition between levels of refinement; the smoother involves algebraic additive domain decomposition between patches within a level of refinement, and Gauss-Seidel iteration within grid patches. Numerical results are presented in 1D and 2D, including spiral waves.