ppxscal/embedding_network huggingface dataset:
Triangular √3-subdivision schemes: the regular case
Authors: Qingtang Jiang, Peter Oswald
Venue: Journal of Computational and Applied Mathematics (2003)

The paper deals with the investigation of triangular √3-subdivision schemes in the stationary shift-invariant setting. In Section 2 we collect the available theory on refinable functions (subdivision surfaces), with emphasis on their Sobolev and Hölder smoothness. Families of interpolatory and approximating √3-subdivision schemes are investigated in Section 3. Some dual √3-subdivision schemes which are related to vector-valued refinable functions are also analyzed. For this purpose, we have developed Matlab routines for numerically investigating properties of vector subdivision schemes.
Web Services Business Strategies and Architectures
Authors: Kapil Apshankar, J. Jeffrey Hanson, Kunal Mittal, Judith M. Myerson, Mike Clark
Venue:  (2002)

:Adopting Web Services will affect many processes within any organization. To throw light on the most important issues, we have commissioned Experts in the Industry to share their insights. The resultant papers cover a broad spectrum from architecture to business strategies without diverting into deep technological fashions. Each study in the collection will answer specific business challenges thrown up by Web Service architectures. Before changing, commissioning, or evaluating a Web Service initiative, all IT Managers, System Architects, Lead Developers, and Business Visionaries should study and reference this book. Topics covered in this book include: Return on Investment EAI, business integration, and ebXML Key Web Services architectures Comparison of J2EE and .NET platforms Security
Vague Regions and Spatial Relationships: A Rough Set Approach
Authors: Theresa Beaubouef, Frederick Petry
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Uncertainty management is necessary for spatial data and GIS applications.This paperfocuses on topological relationships and uncertainty in spatial data regions.We discuss therepresentation of vague regions using the RCC-8 theory and show how rough sets can improve on this methodology through the use of its indiscernibility relation and approximation regions.
SHARPE: A Modeler's Toolkit
Authors: R. A. Sahner, K. S. Trivedi
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

SHARPE (Symbolic Hierarchical Automated Reliability and Performance Evaluator) is a program that supports the specification and automated solution of reliability and performance models. It contains support for fault trees, reliability block diagrams, reliability graphs, Markov and semi-Markov chains, generalized stochastic Petri nets, product-form queueing networks, and acyclic task graphs. These model types can be used separately or in hierarchical combination. SHARPE allows users complete freedom to choose model types, use results from models of any type as parameters for other models of any type, and choose from among alternate algorithms for model solution. We present an example of how SHARPE can be used to analyze a hierarchical performability model.
A Boolean Approach to Construct Neural Networks for Non-Boolean Problems
Authors: G. Thimm, E. Fiesler
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

A neural network construction method for problems specified for data sets with in- and or output values in the continuous or discrete domain is described and evaluated. This approach is based on a Boolean approximation of the data set and is generic for various neural network architectures. The construction method takes advantage of a construction method for Boolean problems without increasing the dimensions of the in- or output vectors, which is an advantage over approaches which work on a binarized version of the data set with an increased number of in- and output elements.Further, the networks are pruned in a second phase in order to obtain very small networks.
Coupled Simulation of Circuit and Piezoelectric Laminates
Authors: Cheng-gang Xu, Terri Fiez, Kartikeya Mayaram
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper, an algorithm for the coupled simulationof circuit and piezoelectric laminate devices is presented.A finite element solver for piezoelectric laminates isincluded in the SPICE framework as a capacitor. Thecharge of this capacitor is a function of both the terminalvoltage and the mechanical strain in the piezoelectricmaterial. The coupled simulator allows simulation ofnovel micropower generation circuits based onpiezoelectric laminates.
On perturbations of irregular Gabor frames
Authors: Joseph D. Lakey, Ying Wang
Venue: Journal of Computational and Applied Mathematics (2003)

We give a new sufficient condition under which an irregular Gabor system {eπipλxψ(x-qλ)} forms a Bessel sequence for L2(R). The Bessel bound just requires a mild decay on ψ. This condition then can be used to prove stability of an irregular Gabor frame under a perturbation of its generating function. We go on to outline how the perturbation result can be used to extend a sufficient condition of Heller for irregular Gabor frames with compactly supported generator to the case of a noncompactly supported generator.
Information exchange protocol: a new approach for future network management
Authors: Deh-Min Wu
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The paper proposes a new approach to classify the network management information formally and the authors intend to support the description of the network states and events. The classification concept described is slightly different from the approaches of CMIP (common management information protocol). The authors apply the situation classification capability extended from those found in description logic, in order to organize the state and event for network management in hierarchical structure. This approach is an extension of current CMIP approach with combined classification facility of relationship, concept and objects.
An Empirical Study of the Effect of Semantic Differences on Programmer Comprehension
Authors: David Binkley
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Software engineers face a wide range of difficult tasks. Understanding semantic relationships, such as the semantic differences between two programs, should aid a software engineer address many of these tasks. A series of experiments was conducted with an implementation of a semantic differencing algorithm for the C language. Sixty-three subjects participated in two controlled experiments. There is evidence that the experimental group, which had access to semantic differences, performed significantly faster ( p =0.023) and more accurately ( p =0.047) than the control group. The study provides empirical support to the assertion that semantic information assists program comprehension.
Solving Integer Programs from Dependence and Synchronization Problems
Authors: Jaspal Subhlok
Venue:  (1993)

We present a method to determine whether a set of equations has a non-negative integer solution. The method is designed for the particular occurence of this problem in the context of compiler analysis of parallel programs. The system of equations is first transformed to Smith normal form to determine if any integer solutions exist. In case of multiple integer solutions, a parameterized solution space representing all non-negative solutions is obtained. Fourier-Motzkin elimination is employed to determine if the real solution space is empty. If the solution space is not empty, either the existence of an integer solution is readily verified, or a simplified convex region is obtained such that the original system of equations has a solution if and only if this convex region contains an integer point. The main result of the paper is a set of new heuristic search procedures that are used to identify an integer solution in a convex region, or to prove that no integer solution exists. These are based on the geometrical properties of convex regions that are not empty but do not contain integer points. This method is an exact and efficient way of solving integer programming problems arising in dependence and synchronization analysis of parallel programs.
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
Authors: Jeffrey S Vitter, Elizabeth A.M. Shriver
Venue:  (1992)

In this paper we introduce parallel versions of two hierarchical memory models and give optimal algorithms in these models for sorting, FFT, and matrix multiplication. In our parallel models, there are P memory hierarchies operating simultaneously; communication among the hierarchies takes place at a base memory level. Our optimal sorting algorithm is randomized and is based upon the probabilistic partitioning technique developed in the companion paper for optimal disk sorting in a two-level memory with parallel block transfer. The probability of using l times the optimal running time is exponentially small in $l$ $(\log l) \log P$.
Automatic generation of an agent's basic behaviors
Authors: Olivier Buffet, Alain Dutech, François Charpillet
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The agent approach, as seen by [9], intends to design "intelligent" behaviors. Yet, Reinforcement Learning (RL) methods often fail when confronted with complex tasks. We are therefore trying to develop a methodology for the automated design of agents (in the framework of Markov Decision Processes) in the case where the global task can be decomposed into simpler -possibly concurrent- sub-tasks. Our main idea is to automatically combine basic behaviors using RL methods. This led us to propose two complementary mechanisms presented in the current paper. The first mechanism builds a global policy using a weighted combination of basic policies (which are reusable), the weights being learned by the agent (using Simulated Annealing in our case). An agent designed this way is highly scalable as, without further refinement of the global behavior, it can automatically combine several instances of the same basic behavior to take into account concurrent occurences of the same subtask. The second mechanism aims at creating new basic behaviors for combination. It is based on an incremental learning method that builds on the approximate solution obtained through the combination of older behaviors.
Efficient allocation of testing resources for software module testing based on the hyper-geometric distribution software reliability growth model
Authors: Rong-Huei Hou, Sy-Yen Kuo, Yi-Ping Chang
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

A considerable amount of testing resources is required during software module testing. In this paper, based on the HGDM (Hyper-Geometric Distribution Model) software reliability growth model, we investigate the following optimal resource allocation problems in software module testing: (1) minimization of the number of software faults still undetected in the system after testing given a total amount of testing resources, and (2) minimization of the total amount of testing resources repaired, given the number of software faults still undetected in the system after testing. Furthermore, based on the concepts of "average allocation" and "proportional allocation", two simple allocation methods are also introduced. Experimental results show that the optimal allocation method can improve the quality and reliability of the software system much more significantly than these simple allocation methods can. Therefore, the optimal allocation method is very efficient for solving the testing resource allocation problem.
A Parallel Block Iterative Method for the Hydrodynamic Device Model
Authors: L C Gardner, J P Lanzkron, J D Rose
Venue:  (1990)

Block iterative methods are applied to hydrodynamic simulations of a one-dimensional submicron semiconductor device. We show that block successive under-relaxation (SUR) converges with a fixed relaxation factor $ \omega ~=~ 0.13$ for simulations at 300 K and $ \omega~=~0.04$ at 77 K. To demonstrate the robustness of the block iterative method, we present numerical simulations of a steady-state electron shock wave in Si at 300 K for a 0.1 micron channel and at 77 K for a 1.0 micron channel. The block SUR method is parallelizable if the diagonal blocks can be solved efficiently. Using the chaotic relaxation and preconditioned conjugate gradient methods for the diagonal block solves, we obtain a parallel speed-up of approximately 2.5 on 10 processes of a Butterfly GP-1000. The 1D simulations serve as a numerical laboratory for developing methods that will be essential for computational efficiency in two-dimensional problems.
Efficient Delay Calculation in Presence of Crosstalk
Authors: Tong Xiao, Malgorzata Marek-Sadowska
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Efficient and accurate delay calculation is very important in physical design, optimization and fast verification. In this paper we consider explicit delay calculation for RC interconnects with coupling capacitance.The formulae are derived using a simplified transfer function, which offers enough accuracy. We have expressed coefficients of two-pole transfer function in terms of circuit parameters. Moment matching methods [8][12][13] do not yield such explicit expressions. Our simplified delay calculation method is most suitable in physical design and fast timing verification where the dependency of delay on circuit parameters is essential.
Essential Windows 2000 Commands Reference: The Indispensable Reference Guide for Power Users, Administrators and Developers
Authors: William R. Stanek
Venue:  (2002)

:Essential Windows 2000 Commands Reference puts information about essential Windows 2000 commands in your hands. You'll find detailed usage information on over 200 of the most used commands. Every command entry features one or more usage examples and many examples include command shell syntax as well as scripting syntax for batch, VBScript and JScript, making this one of the only resources available of its kind! This is the indispensable reference guide for power users, administrators and developers: *Well-organized and designed to provide instant access. *Listings of commands by name and by task allow you to quickly identify commands to use. *Tips for using, running and scheduling commands. *Troubleshooting tips, like how to install Recovery Console and configure Dr. Watson.
Evaluation of Quality Education on the Basis of Modern Information Technologies
Authors: O. G. Berestneva, O. V. Maroukhine, M. A. Maroukhine
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Nowadays majority of higher educational establishments in our country aim to graduate highlyqualified professionals in all spheres. Heighten attention rides on increased requirements to specialists, which entails continuous improvement of educational process. Therefore, the objective of development and improvement of education quality assessment technologies in higher educational establishments becomes topical. Application of up-to-date informationtechnologies enables to considerably simplify some procedures related to data collection and processing done to meet the objective, besides, it provides opportunity to utilize a sophisticated mathematical tool for research.
Sensitivity Analysis for Object Recognition from Large Structural Libraries
Authors: Benoit Huet, Edwin R. Hancock
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper studies the structural sensitivity of line-pattern recognition using shape-graphs. We compare the recognition performance for four different algorithms. Each algorithm uses a set of pair wise geometric attributes and a neighborhood graph to represent the structure of the line patterns. The first algorithm uses a pair-wise geometric histogram, the second uses a relational histogram on the edges of the shape graph, the third compares the set of attributes on the edges of the shape graph and the final algorithm compares the arrangement of line correspondences using graph-matching. The different algorithms are compared under line deletion, line addition, line fragmentation and line end-point measurement errors. It is the graph-matching algorithm which proves to be the most effective.
Permutation routing in double-loop networks: design and empirical evaluation
Authors: Tomaž Dobravec, Borut Robič, Janez Žerovnik
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

A double-loop network is an undirected graph whose nodes are integers 0, 1,..., n - 1 and each node u is adjacent to four nodes u ± h1 (mod > n), u ± h2(mod > n), where 0 < h1 < h2 < n/2. There are initially n packets, one at each of the n nodes. The packet at node u is destined to node π(u), where the mapping ω → π (u) is a permutation. The aim is to minimize the number of routing steps to route all the packets to their destinations. If l is the tight lower bound for this number, then the best known permutation routing algorithm takes, on average, 1.98l routing steps (and 2l routing steps in the worst-case).Because the worst-case complexity cannot be improved, we design four new static permutation routing algorithms with gradually improved average-case performances, which are 1.37l, 1.35l, 1.18l, and 1.12l. Thus, the best of these algorithms exceeds the optimal routing by at most 12% on average.To support our algorithm design we develop a program which simulates permutation routing in a network according to the given topology, routing model as well as communication pattern and measure several quality criteria. We have tested our algorithms on a large number of double-loop networks and permutations (randomly generated and standard).
Modelling of Phase Separation in Alloys with Coherent Elastic Misfit
Authors: Fratzl Peter, Penrose Oliver, Lebowitz Joel L.
Venue:  (1999)

Elastic interactions arising from a difference of lattice spacing between two coherent phases can have a strong influence on the phase separation (coarsening) behaviour of alloys. If the elastic moduli are different in the two phases, the elastic interactions may accelerate, slow down or even stop the phase separation process. If the material is elastically anisotropic, the precipitates can be shaped like plates or needles instead of spheres and can \sps arrange themselves into highly correlated patterns \cs. Tensions or compressions applied externally to the specimen may have a strong effect on the shapes and arrangement of the precipitates. In this paper, we review the main theoretical approaches that have been used to model these effects and we relate them to experimental observations. The theoretical approaches considered are (i) `macroscopic'' models treating the two phases as elastic media separated by a sharp interface (ii) `mesoscopic'' models in which the concentration varies continuously across the interface (iii) `microscopic'' models which use the positions of individual atoms.
An Asynchronous [(n-1)/3]-Resilient Consensus Protocols
Authors: Gabriel Bracha
Venue:  (1984)

A consensus protocol enables a system of $n$ asynchronous processes, some of them malicious, to reach agreement. No assumptions are made on the behaviour of the processes and the message system; both are capable of colluding to prevent the correct processes from reaching decision. A protocol is $t$-resilient if in the presence of up to $t$ malicious processes it reaches agreement with probability 1. In a recent paper, $t$-resilient consensus protocols were presented for $t > n / 5$. We improve this to $t > n / 3$, thus matching the lower bound on the number of correct processes necessary for consensus. The protocol restricts the behaviour of the malicious processes to that of merely fail-stop processes, which makes it interesting in other contexts.
A Spectrum of TCP-friendly Window-based Congestion Control Algorithms
Authors: Shudong Jin, Liang Guo, Ibrahim Matta, Azer Bestavros
Venue:  (2001)

Abstract The increased diversity of Internet application requirements has purred recent interests in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. In this paper, we define a new spectrum of window-based congestion control algorithms that are TCP-friendly as well as TCP-compatible under RED. Contrary to previous memory-less controls, our algorithms utilize history information in their control rules. Our proposed algorithms have two salient features: (1) They enable a wider region of TCP-friendliness, and thus more flexibility in trading off among smoothness, aggressiveness, and responsiveness; and (2) they ensure a faster convergence to fairness under a wide range of system conditions. SIMD is one instance of this spectrum of algorithms, in which the congestion window is increased super-linearly with time since the detection of the last loss. Compared to recently proposed TCP-friendly AIMD and binomial algorithms, we demonstrate the superiority of SIMD in: (1) adapting to sudden increases in available bandwidth, while maintaining competitive smoothness and responsiveness; and (2) rapidly converging to fairness and efficiency.
Display Models for Visualization
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Models for visualization are important, helping the developer and user to understand the visualization process; to follow the connections and the data paths through the system; and to reference and compare the functionality and the limitations of different systems or techniques.Display models specifically classify the data by what type of output can be created. Jacques Bertin described a symbolic reference model that he used to describe images and displays. In this paper we review his and other `display orientated models' describing important aspects of these methods and ideas. We then translate Bertin's scheme into an algebraic form as a method to describe visualizations.
Testing Process Guidance for Resource Constrained Software Testing
Authors: Anthony T. Rivers, Mladen A. Vouk
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

"Classical" operational-profile based testing strategies tend to advocate testing of product functions and operations according to the relative frequencies of their usage in the field. As such these strategies tend to explicitly or implicitly advocate re-execution of previously "covered" elements. This provides a built-in mechanism for letting the testers know that they are doing well through the resulting declining failure intensity.Unfortunately, in modern resource constrained software testing environments, the re-execution of functions that have already been tested is often discourage by business models that operate with limited budget and schedule. Consequently, in Resource Constrained Testing (RCT) environments failure intensity decay is open to interpretation, and may be an impractical guiding and decision tool.We present an approach based on the Testing Efficiency (TE) Metric that, for RCT environments, may be a more appropriate testing decision support aide. We also present supporting results from simulations, experiments and field application of the TE metric..