ppxscal/embedding_network huggingface dataset:
Analysis of Iterated Modular Exponentiation: The Orbitsof x^&alpha; mod N
Authors: J. J. Brennan, Bruce Geist
Venue: Designs, Codes and Cryptography (1998)

Let N and &agr; be integers larger than 1. Define an orbit to be the collection of residues in _N^* generated by iteratively applying x &rarr; x ^&alpha; mod N to an element x &isin; Z_N^* which eventually maps back to itself. An orbit&lsquo;s length is the number of distinct residues in the orbit. When N is a large bicomposite integer, such as is commonly used in many cryptographic applications, and when certain prime factorizations related to N are known, all orbit lengths and the number of orbits of each possible length can be efficiently computed using the results presented. If the required integer factorizations are only partially known, the risk that a randomly selected periodic element might produce an orbit shorter than some (typically large) divisor of (&phis;(N)) can be bounded. The information needed to produce such a bound is fully available when the prime factors of N are generated using the prime generation algorithm defined in Maurer maur. Results presented can assist in choosing wisely a modulus N for the Blum, Blum, and Shub pseudo-random bit generator. If N is a bicomposite RSA modulus, the analysis shows how to quantify the risk posed by an iterated encryption attack.
Guaranteeing Fair Service to Persistent Dependent Tasks
Authors: Amotz Bar-Noy, Alain Mayer, Baruch Schieber, Madhu Sudan
Venue: SIAM Journal on Computing (1998)

We introduce a new scheduling problem that is motivated by applications in the area of access and flow control in high-speed and wireless networks. An instance of the problem consists of a set of persistent tasks that have to be scheduled repeatedly. Each task has a demand to be scheduled "as often as possible." There is no explicit limit on the number of tasks that can be scheduled concurrently. However, such limits are imposed implicitly because some tasks may be in conflict and cannot be scheduled simultaneously. These conflicts are presented in the form of a conflict graph. We define parameters which quantify the fairness and regularity of a given schedule. We then proceed to show lower bounds on these parameters and present fair and efficient scheduling algorithms for the case where the conflict graph is an interval graph. Some of the results presented here extend to the case of perfect graphs and circular-arc graphs as well.
Numerical Experiences with New Truncated Newton Methodsin Large Scale Unconstrained Optimization
Authors: Stefano Lucidi, Massimo Roma
Venue: Computational Optimization and Applications (1997)

Recently, in [12] a very general class of truncated Newton methods has been proposed for solving large scale unconstrained optimization problems. In this work we present the results of an extensive numerical experience obtained by different algorithms which belong to the preceding class. This numerical study, besides investigating which are the best algorithmic choices of the proposed approach, clarifies some significant points which underlies every truncated Newton based algorithm.
The Stochastic Modeling of Purchase Intentions and Behavior
Authors: Martin R. Young, Wayne S. Desarbo, Vicki G. Morwitz
Venue: Management Science (1998)

A common objective of social science and business research is the modeling of the relationship between demographic/psychographic characteristics of individuals and the likelihood of certain behaviors for these same individuals. Frequently, data on actual behavior are unavailable; rather, one has available only the self-reported intentions of the individual. If the reported intentions imperfectly predict actual behavior, then any model of behavior based on the intention data should account for the associated measurement error, or else the resulting predictions will be biased. In this paper, we provide a method for analyzing intentions data that explicitly models the discrepancy between reported intention and behavior, thus facilitating a less biased assessment of the impact of designated covariates on actual behavior. The application examined here relates to modeling relationships between demographic characteristics and actual purchase behavior among consumers. A new Bayesian approach employing the Gibbs sampler is developed and compared to alternative models. We show, through simulated and real data, that, relative to methods that implicitly equate intentions and behavior, the proposed method can increase the accuracy with which purchase response models are estimated.
An exact solution to simultaneous technology mapping and linear placement problem
Authors: Jinan Lou, Amir H. Salek, Massoud Pedram
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of minimizing the post-layout area. The proposed algorithm relies on generation of gate-area versus cut-width curves using a dynamic programming approach. A novel design flow, which extends this algorithm to minimize the circuit delay and handle general DAG structures, is also presented. Experimental results on MCNC benchmarks are reported.
Fifty years of progress in software engineering
Authors: L. B. S. Raccoon
Venue: ACM SIGSOFT Software Engineering Notes (1997)

In this paper, I describe a new outlook on the history of Software Engineering. I portray large-scale structures within Software Engineering to give a better understanding of the flow of history. I use these large-scale structures to reveal the steady, ongoing evolution of concepts, and show how they relate to the myriad whorls and eddies of change. I also have four smaller, more specific purposes in writing this paper.First, I want to point out that old ideas do not die. In The Mythical Man-Month after 20 Years, Brooks claims "the Waterfall Model is Wrong." But if the Waterfall model were wrong, we would stop arguing over it. Though the Waterfall model may not describe the whole truth, it describes an interesting structure that occurs in many well-defined projects and it will continue to describe this truth for a long time to come. I expect the Waterfall model will live on for the next one hundred years and more.Second, I want to show that the Chaos model, Chaos life cycle, Complexity Gap, and Chaos strategy are part of the natural evolution of Software Engineering. The Chaos model and strategy supersede, but do not contradict, the Waterfall and Spiral models, and the Stepwise Refinement strategy. They are more up to date because they express contemporary issues more effectively, and fit our contemporary situations better. The Chaos model, life cycle, and strategy are equally as important, but not better than, other concepts.Third, I compare the Chaos model, life cycle, and strategy to other models, life cycles, and strategies. This paper can be considered a comparison of the ideas presented in my papers about chaos with other ideas in the field. I avoided comparisons in my other papers because I wanted to define those ideas in their own terms and the comparisons did not further the new ideas.Fourth, I make a few predictions about the next ten years of Software Engineering. The large-scale structures described in this history provide a stronger base for understanding how software engineering will evolve in the future.This paper is laid out as follows. In the first section, I use the flow of water as a metaphor to describe the flow of progress in Software Engineering. I use the Water metaphor to show some of the structures within Software Engineering. The current work builds on top of the historical work, and future work will build on top of current work. In the remaining sections, I describe the waves, streams, and tides that portray the evolution of concepts and technologies in Software Engineering.
Recognition of Digits in Hydrographic Maps: Binary Versus Topographic Analysis
Authors: Øivind Due Trier, Torfinn Taxt, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

This paper compares the performance of topographic analysis and binary analysis for recognition of digits in hydrographic maps. The performance of each method was measured by the correct classification rate of the final symbol recognition step when processing a complete hydrographic map of size 0.45 × 0.6 m2 with about 35,000 digits. The experimental results indicated that binary analysis had a better performance than topographic analysis. Overall, the performance of the binary analysis was acceptable.
An hp Error Analysis of MITC Plate Elements
Authors: Rolf Stenberg, Manil Suri
Venue: SIAM Journal on Numerical Analysis (1997)

We give an hp error analysis of several rectangular families of finite elements for the Reissner--Mindlin plate bending equations. We consider both the original MITC families [K. J. Bathe, F. Brezzi, and M. Fortin, Internat. J. Numer. Methods Engrg., 28 (1989), pp. 1787--1801] and some new ones introduced in this paper. For the deflection and rotation we give error estimates which are optimal with respect to the mesh size h and optimal up to $\ordo(\p^\varepsilon)$, $\varepsilon >0$ arbitrary, with respect to the polynomial degree p. We also obtain estimates for the error in the shear force, calculated via two different methods. Our analysis utilizes some recent results of ours for the mixed method for the Stokes problem, as well as hp interpolation estimates for mixed methods for second-order elliptic equations. In this regard, we derive new hp results in this paper for the Brezzi--Douglas--Fortin--Marini spaces and improve upon previous estimates for the Brezzi--Douglas--Marini spaces.
Scheduling with simulation in the food drinks industry
Authors: Michael D. Novels, Stan Jonik
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The ever increasing pressures from the market place has caused companies to re-assess how the production planning function is carried out and to look for tools that "I support the decision making process and generate achievable schedules in a timely manner. This paper describes the use of capacity planning and scheduling decision support tools that combine a simulation model generated with ARENA, with PREACTOR, a PC based finite scheduler. The use of this combination is illustrated by their use in food processing plant in the UK and then discusses how these may influence the way that variable costs are measured.
Two approaches to the implementation of a distributed simulation system
Authors: Murali Krishnamurthi, Usha Chandrasekaran, Sallie Sheppard
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper describes two approaches to the implementation of distributed simulation currently being pursued at Texas A M University. The first approach describes the design and the implementation of a distributed simulation system onto a Motorola 68000 based architecture. This approach involves transparently distributing the language support functions of an existing simulation language (GASP) onto multiple processors. The second approach discusses the implementation of simulation support software in a high level distributed processing language. This approach involves the distribution of portions of the simulation model which can be executed in parallel onto multiple processors by the model builder. The paper discusses the details of both the approaches and the current status of their implementation.
A Geometric Approach to Maximum-Speed n-Dimensional Continuous Linear Interpolation in Rectangular Grids
Authors: Riccardo Rovatti, Michele Borgatti, Roberto Guerrieri
Venue: IEEE Transactions on Computers (1998)

An algorithm for the linear interpolation of multi-input functions sampled on rectangular grids is presented. A geometric approach is adopted and the mathematics is thoroughly developed. We show that the algorithm is optimum. In fact, when the number n of inputs grows to infinity its computational requirement is ${\cal O}(n {\rm\ log}\ n),$ which is the same as the lower-bound on the cost of continuous linear interpolation procedures.
The Effect of Gaussian Error in Object Recognition
Authors: Karen B. Sarachik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

In model based recognition, the goal is to locate an instance of one or more known objects in an image. The problem is compounded in real images by the presence of clutter, occlusion, and sensor error, which can lead to "false negatives," failures to recognize the presence of the object, and "false positives," in which the algorithm incorrectly identifies an occurrence of the object. The probability of either event is affected by parameters within the recognition algorithm, which are almost always chosen in an ad-hoc fashion. The effect of the parameter values on the likelihood that the recognition algorithm will make a mistake are usually not understood explicitly.To address the problem, we explicitly model the noise that occurs in the image. In a typical recognition algorithm, hypotheses about the position of the object are tested against the evidence in the image, and an overall score is assigned to each hypothesis. We use a statistical model to determine what score a correct or incorrect hypothesis is likely to have, and use standard binary hypothesis testing techniques to distinguish correct from incorrect hypotheses. Using this approach, we can compare algorithms and noise models, and automatically choose values for internal system thresholds to minimize the probability of making a mistake.
Analyzing and Synthesizing Images by Evolving Curves with theOsher-Sethian Method
Authors: Ron Kimmel, Nahum Kiryati, Alfred M. Bruckstein
Venue: International Journal of Computer Vision (1997)

Numerical analysis of conservation laws plays an important role in the implementation of curve evolution equations. This paper reviews the relevant concepts in numerical analysis and the relation between curve evolution, Hamilton-Jacobi partial differential equations, and differential conservation laws. This close relation enables us to introduce finite difference approximations, based on the theory of conservation laws, into curve evolution. It is shown how curve evolution serves as a powerful tool for image analysis, and how these mathematical relations enable us to construct efficient and accurate numerical schemes. Some examples demonstrate the importance of the CFL condition as a necessary condition for the stability of the numerical schemes.
Session directories and scalable Internet multicast address allocation
Authors: Mark Handley
Venue: ACM SIGCOMM Computer Communication Review (1998)

A multicast session directory is a mechanism by which users can discover the existence of multicast sessions. In the Mbone, session announcements have also served as multicast address reservations - a dual purpose that is efficient, but which may cause some side-affects as session directories scale.In this paper we examine the scaling of multicast address allocation when it is performed by such a multicast session directory. Despite our best efforts to make such an approach scale, this analysis ultimately reveals significant scaling problems, and suggests a new approach to multicast address allocation in the Internet environment.
New Inexact Parallel Variable Distribution Algorithms
Authors: Michael V. Solodov
Venue: Computational Optimization and Applications (1997)

We consider the recently proposed parallel variable distribution (PVD) algorithm of Ferris and Mangasarian [4] for solving optimization problems in which the variables are distributed amongp processors. Each processor has the primary responsibility for updating its block of variables while allowing the remaining &ldquo;secondary&rdquo; variables to change in a restricted fashion along some easily computable directions. We propose useful generalizations that consist, for the general unconstrained case, of replacing exact global solution of the subproblems by a certain natural sufficient descent condition, and, for the convex case, of inexact subproblem solution in the PVD algorithm. These modifications are the key features of the algorithm that has not been analyzed before. The proposed modified algorithms are more practical and make it easier to achieve good load balancing among the parallel processors. We present a general framework for the analysis of this class of algorithms and derive some new and improved linear convergence results for problems with weak sharp minima of order 2 and strongly convex problems. We also show that nonmonotone synchronization schemes are admissible, which further improves flexibility of PVD approach.
Uniqueness in Shape from Shading Revisited
Authors: Ryszard Kozera
Venue: Journal of Mathematical Imaging and Vision (1997)

We analyse the problem of representing solutions of first-order partial differential equations in terms of complete integrals and envelopes. In this context, we revisit the uniqueness results already existing in the shape-from-shading literature that concern eikonal equations corresponding to the images of a Lambertian hemi-sphere and a Lambertian plane. We show that the approach adopted by Brooks in [2, 3] is incomplete and subsequently re-establish its uniqueness claims.
A framework for rare event simulation of stochastic Petri nets using &ldquo;RESTART&rdquo;
Authors: Christian Kelling
Venue: Proceedings of the 28th conference on Winter simulation (1996)

For the performability evaluation of complex systems simulation remains often the only feasible method. Unfortunately, simulation experiments tend to be very time consuming if rare events have to be considered. This paper describes an algorithmic approach for fast simulation of rare events applied in a Petri net modeling environment. The technique is based on the RESTART method, which is applicable for rare events in a wide range of simulation models, and has the potential to reduce the simulation overhead extremely. The paper presents selection and refinement techniques for the most important input parameters of RESTART. The techniques allow an efficient execution of RESTART simulations especially in a flexible evaluation tool. The results show run length reductions up to six orders of magnitude.
Vector generation for maximum instantaneous current through supply lines for CMOS circuits
Authors: Angela Krstić, Kwang-Ting Cheng
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

We present two new algorithms for generating a smallset of patterns for estimating the maximum instantaneouscurrent through the power supply lines for CMOScircuits.The first algorithm is based on timed ATPG,while the second is a probability-based approach.Bothalgorithms can handle circuits with arbitrary but knowndelays and they produce a set of 2-vector tests.Experimentalresults demonstrating that the outcome of applyingour algorithms is a small set of patterns producinga current that is a tight lower bound on the maximuminstantaneous current are included.
The Optimum Class-Selective Rejection Rule
Authors: Thien M. Ha
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Class-selective rejection is an extension of simple rejection. That is, when an input pattern cannot be reliably assigned to one of the N classes in an N-class problem, it is assigned to a subset of classes that are most likely to issue the pattern, instead of simply being rejected. By selecting more classes, the risk of making an error can be reduced, at the price of subsequently having a larger remaining number of classes. The optimality of class-selective rejection is therefore defined as the best tradeoff between error rate and average number of selected classes. Formally, the tradeoff study is embedded in the framework of decision theory. The average expected loss is expressed as a linear combination of error rate and average number of classes. The minimization of the average expected loss, therefore, provides the best tradeoff. The complexity of the resulting optimum rule is reduced, via a discrete convex minimization, to be linear in the number of classes. Upper-bounds on error rate and average number of classes are derived. An example is provided to illustrate various aspects of the optimum decision rule. Finally, the implications of the new decision rule are discussed.
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Authors: Egon Balas, Alkis Vazacopoulos
Venue: Management Science (1998)

Many recently developed local search procedures for job shop scheduling use interchange of operations, embedded in a simulated annealing or tabu search framework. We develop a new variable depth search procedure, GLS (Guided Local Search), based on an interchange scheme and using the new concept of neighborhood trees. Structural properties of the neighborhood are used to guide the search in promising directions. While this procedure competes successfully with others even as a stand-alone, a hybrid procedure that embeds GLS into a Shifting Bottleneck framework and takes advantage of the differences between the two neighborhood structures proves to be particularly efficient. We report extensive computational testing on all the problems available from the literature.
Current-Mode Temperature Compensated Continuous-Time CMOSTransconductance-C Filter
Authors: Kimmo Koli, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (1998)

In this paper a low voltage low power current-mode continuous-time low-pass filter is presented. The current-integrator is constructed of a multi-output linearized transconductance element driven by a balanced transimpedance amplifier. A 1 MHz third order elliptic low pass filter is designed and fabricated with the proposed current-mode integrator. The measurements show capability of operation with down to a 3 V supply voltage. The measured current consumption is 850 &micro;A at room temperature and the dynamic range is 66 dB. The distortion of the filter is below 50 dBc with peak signal levels up to twice the quiescent current level and with the refined designs even lower distortion is expected. The filter uses a CMOS-current reference for temperature and process variation stabilization with a measured corner frequency temperature coefficient of &minus;100 ppm/K.
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications
Authors: Koji Nakano, Stephen Olariu
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Given a set S of n points in the plane and two directions $r_1$ and $r_2,$ the Angle-Restricted All Nearest Neighbor problem (ARANN, for short) asks to compute, for every point p in S, the nearest point in S lying in the planar region bounded by two rays in the directions $r_1$ and $r_2$ emanating from p. The ARANN problem generalizes the well-known ANN problem and finds applications to pattern recognition, image processing, and computational morphology. Our main contribution is to present an algorithm that solves an instance of size n of the ARANN problem in O(1) time on a reconfigurable mesh of size n×n. Our algorithm is optimal in the sense that $\Omega\;(n^2)$ processors are necessary to solve the ARANN problem in O(1) time. By using our ARANN algorithm, we can provide O(1) time solutions to the tasks of constructing the Geographic Neighborhood Graph and the Relative Neighborhood Graph of n points in the plane on a reconfigurable mesh of size n×n. We also show that, on a somewhat stronger reconfigurable mesh of size $n\times n^2,$ the Euclidean Minimum Spanning Tree of n points can be computed in O(1) time.