ppxscal/embedding_network huggingface dataset:
FPGA resource and timing estimation from Matlab execution traces
Authors: Per Bjuréus, Mikael Millberg, Axel Jantsch
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

We present a simulation-based technique to estimate area and latency of an FPGA implementation of a Matlab specification. During simulation of the Matlab model, a trace is generated that can be used for multiple estimations. For estimation the user provides some design constraints such as the rate and bit width of data streams. In our experience the runtime of the estimator is approximately only 1/10 of the simulation time, which is typically fast enough to generate dozens of estimates within a few hours and to build cost-performance trade-off curves for a particular algorithm and input data. In addition, the estimator reports on the scheduling and resource binding used for estimation. This information can be utilized not only to assess the estimation quality, but also as first starting point for the final implementation.
Job characteristics and quality of working life in the IT workforce: the role of gender
Authors: Pascale Carayon, Peter Hoonakker, Segolene Marchand, Jen Schwarz
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

Women are largely underrepresented in the Information Technology (IT) workforce. Our research examines the factors related to the work environment that may contribute to the high turnover of women in the IT workforce. There is substantial research providing support for the relationship between job and organizational factors, on one hand, and quality of working life (QWL) (e.g., low job satisfaction and high job strain), on the other hand. In this paper, we conduct secondary data analysis of questionnaire survey collected from a sample of 1,278 employees of a single organization. We examine the impact of gender and job type (i.e. IT job versus non-IT job) on various indicators of quality of working life, as well as on the relationship between job and organizational factors (i.e. feedback, autonomy, skill variety, task significance, task identity and work pressure) and QWL. Results show that IT workers reported higher job satisfaction and lower job strain than non-IT workers. Gender had no impact on QWL. Feedback and autonomy were consistently related to job satisfaction, and work pressure was consistently related to job strain, irrespective of gender and type of job. On the other hand, women IT workers' job satisfaction was affected by work pressure, and women IT workers' job strain was affected by task significance. Women IT workers' job strain was not affected by autonomy, whereas job strain experienced by non-IT workers was affected by autonomy.
Indefinite Knowledge about an Object and Accuracy of Its Recovery Methods
Authors: G. G. Magaril-Il'yaev, K. Yu. Osipenko, V. M. Tikhomirov
Venue: Problems of Information Transmission (2003)

An approach to the problem of optimal recovery of functionals and operators on classes of functions under the conditions of infinite knowledge of functions themselves is discussed. The capabilities of this approach are demonstrated in a number of examples. In the end of the paper, a general result about optimal recovery of linear functionals is given.
Maximal partial spreads of T2(O) and T3(O)
Authors: M. R. Brown, J. De Beule, L. Storme
Venue: European Journal of Combinatorics (2003)

Assuming a partial spread of T2(O) or T3(O), with deficiency δ, is maximal and using results on minihypers, which are closely related to blocking sets in PG(2, q), we obtain lower bounds for δ. If q is even, using extendability of arcs in PG(2, q), we prove that a maximal partial spread of T2(O) which does not cover (∞) does not exist if δ ≤ q - 1. This improves a theorem of Tallini (Proceedings of the First International Conference on Blocking Sets (Giessen, 1989) 201 (1991) 141) for T2(O) = Q(4, q), and, furthermore, this result is sharp since partial spreads with deficiency δ = q are constructed.
Announced dynamic access probability protocol for next generation wireless networks
Authors: Zohar Naor, Hanoch Levy
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

A multiple access protocol that is particularly suitable for cellular Internet access and satellite-based networks with on-board processing is developed in this paper. The basic idea is that when a user wishes to send a message, it transmits with probability paccess that depends on the load on the channel. Under conditions of low load, the probability paccess approaches 1, while at high load paccess is relatively low. This media access control protocol guarantees high channel utilization at high load, as well as low delay at low load periods. Using the statistical usage of the shared channel, the load is estimated with certain uncertainty. Our analysis shows that using the statistical usage of the shared channel, the optimal access probability can be well estimated for a broad class of load distribution patterns. In addition, we propose to use a central station to broadcast the value of Paccess in networks with poor collision detection capability, or long feedback delay. The proposed method is particularly suitable for shared channels with poor collision detection capability, under conditions of bursty traffic and a large number of users. Examples for such channels are the reservation channel in satellite-based networks with on-board processing, and the control channel in cellular networks. Hence, the proposed method can be used for cellular Internet access and for accessing public satellite-based networks. The broadcast mechanism that already exists in such networks can be used to inform the users the dynamic access probability.
H2-matrix approximation of integral operators by interpolation
Authors: Wolfgang Hackbusch, Steffen Börm
Venue: Applied Numerical Mathematics (2002)

Typical panel clustering methods for the fast evaluation of integral operators are based on the Taylor expansion of the kernel function and therefore usually require the user to implement the evaluation of the derivatives of this function up to an arbitrary degree.We propose an alternative approach that replaces the Taylor expansion by simple polynomial interpolation. By applying the interpolation idea to the approximating polynomials on different levels of the cluster tree, the matrix vector multiplication can be performed in only O(npd) operations for a polynomial order of p and an n-dimensional trial space.The main advantage of our method, compared to other methods, is its simplicity: Only pointwise evaluations of the kernel and of simple polynomials have to be implemented.
Group characters, permutation actions and sharpness
Authors: Kenneth W. Johnson, Eirini Poimenidou
Venue: European Journal of Combinatorics (2003)

We extend the work which has appeared in papers on sharp characters and originated with Blichfeldt and Maillet to the Burnside ring of a finite group G. We show that the polynomial whose zeros are the set of marks of non-identity subgroups on a faithful G-set X evaluated at X is an integral multiple of the regular G-set, and deduce a result about the size of a base of X. Further consequences for ordinary group characters are obtained by re-examining Blichfeldt's work and we provide alternative definitions of sharpness. Conjectures are given related to the set of values of a permutation character, and it is proved that for a faithful transitive G-set X certain polynomials (in the Burnside ring) evaluated at X necessarily give G-sets.
Snapshot Estimators of Recent Hiv Incidence Rates
Authors: Edward H. Kaplan, Ron Brookmeyer
Venue: Operations Research (1999)

The recent HIV incidence rate (or hazard rate for infection) is an important quantity for use in monitoring the HIV/AIDS epidemic, evaluating HIV prevention programs, and allocating HIV prevention resources. Direct measurement of HIV incidence is difficult and time consuming, while estimating HIV incidence via backcalculation (deconvolution) using AIDS incidence data and the (presumed known) HIV incubation time distribution yields little information about recent infection. We propose a method for estimating recent HIV incidence in a population via a single sample at a single point in time. The method relies on understanding the progression of certain markers such as CD4 counts following infection. The actual formulas derived for the point and interval estimates of HIV incidence are simple and easy to use while the sample sizes needed to implement our approach are reasonable. We present two applications of our approach, comparing our results to those obtained from more conventional methods where possible.
The logic of deferring the design process
Authors: Nandish V. Patel
Venue: Adaptive evolutionary information systems (2003)

The aim of this chapter is to formulate theoretical foundations for deferring the IS design process to inform adaptable usage of deferred systems. A research agenda for Deferred System's Design is set and a new system component, the System-System Environment Interface, is defined as the public interface through which a deferred system can maintain close coupling with the system environment. A Problem-solving and planning technique is suggested, the Deferred-Specified IT/IS Matrix, to aid software developers to position a proposed system development in the system environment. A systems analysis technique is suggested to identify deferment points in a given system design. The chapter identifies seven properties of deferred systems that software developers can use to inform adaptable system designs.
Interpersonal cues and consumer trust in e-commerce
Authors: Jens Riegelsberger
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

E-commerce stretches interactions over space and time, and thus requires more trust than traditional shopping. Current approaches to trust-building in e-commerce focus on cognitive trust. Human trust decisions, however, are also based on affective reactions, which can be triggered by interpersonal cues. This research investigates the effect of visual interpersonal cues on users' trust in e-commerce. First results indicate that visual interpersonal cues in the form of photographs have an effect on users' decision-making. This effect, however, strongly depends on context variables, as well as individual differences. A further issue under investigation is the potential negative effect of interpersonal cues on task performance. Thus, in a next stage, this research will combine eye-tracking with physiological measurements to investigate effects on task performance and user cost.
Exponential split accumulator for high-speed reduced area low-power direct digital frequency synthesizers
Authors: Edward Merlo, Kwang-Hyun Baek, Myung-Jun Choe
Venue: Proceedings of the 13th ACM Great Lakes symposium on VLSI (2003)

A new split accumulator architecture to be used in direct digital frequency synthesizers (DDFS) systems is presented. This new design eliminates the need of adders on the section of the accumulator that is not used to address the phase to amplitude mapping block thus reducing area, constraints in implementation, and up to 82% in power consumption compared to standard designs.
Post-convolved splatting
Authors: Neophytos Neophytou, Klaus Mueller
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

One of the most expensive operations in volume rendering is the interpolation of samples in volume space. The number of samples, in turn, depends on the resolution of the final image. Hence, viewing the volume at high magnification will incur heavy computation. In this paper, we explore an approach that limits the number of samples to the resolution of the volume, independent of the magnification factor, using a cheap post-convolution process on the interpolated samples to generate the missing samples. For X-ray, this post-convolution is needed only once, after the volume is fully projected, while in full volume rendering, the post-convolution must be applied before each shading and compositing step. Using this technique, we are able to achieve speedups of two and more, without compromising rendering quality. We demonstrate our approach using an image-aligned sheet-buffered splatting algorithm, but our conclusions readily generalize to any volume rendering algorithm that advances across the volume in a slice-based fashion.
HW/SW codesign techniques for dynamically reconfigurable architectures
Authors: Juanjo Noguera, Rosa M. Badia
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

Hardward/software (HW/SW) codesign and reconfigurable computing are commonly used methodologies for digital-systems design. However, no previous work has been carried out in order to define a HW/SW codesign methodology with dynamic scheduling for run-time reconfigurable architectures. In addition, all previous approaches to reconfigurable computing multicontext scheduling are based on static-scheduling techniques. In this paper, we present three main contributions: 1) a novel HW/SW codesign methodology with dynamic scheduling for discrete event systems using dynamically reconfigurable architectures; 2) a new dynamic approach to reconfigurable computing multicontext scheduling; and 3) a HW/SW partitioning algorithm for dynamically reconfigurable architectures. We have developed a whole codesign framework, where we have applied our methodology and algorithms to the case study of software acceleration. An exhaustive study has been carried out, and the obtained results demonstrate the benefits of our approach.
Partial integrability for general nonlinear systems
Authors: Keng Huat Kwek, Yong Li, Shaoyun Shi
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2003)

The purpose of this paper is to find a criterion of partial integrability for general nonlinear systems. Here partial integrability means the existence of a certain numbers of first integrals less than the number required for the complete integration[10]. We also give an algebraic criterion of partial integrability for general semi-quasihomogeneous systems.
Super cilia skin: an interactive membrane
Authors: Hayes Raffle, Mitchell W. Joachim, James Tichenor
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper we introduce Super Cilia Skin, a new approach for integrating haptic and visual communication. Super Cilia Skin is conceived as a computationally enhanced membrane coupling tactile input with tactile and visual output. We present the design of our prototype, an array of individual actuators (cilia) that use changes in orientation to display images or physical gestures. We discuss ongoing research to develop tactile input capabilities and we present examples of how it can enrich interpersonal communication and children's learning.
Minimizing power across multiple technology and design levels
Authors: Takayasu Sakurai
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Approaches to achieve low-power and high-speed VLSI's are described with the emphasis on techniques across multiple technology and design levels. To suppress the leakage current in a standby mode, Boosted Gate MOS (BGMOS) is effective, which is based on cooperation between technology level and circuit level. To reduce the power in an active mode, VDD-hopping and VTH-hopping are promising, which are cooperative approaches between circuit and software. Power consumed in interconnect system can be reduced by a cooperative approach between application and layout as in bus shuffling. Other low-power design approaches are also discussed.
Smarandache sequence of happy numbers
Authors: Shyam Sunder Gupta
Venue: Smarandache Notions Journal (2002)

In this article, we present the results of investigation of Smarandache Concatenate Sequence formed from the sequence of Happy Numbers and report some primes and other results found from the sequence.
Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin--Destination Flows
Authors: K. Ashok, M. E. Ben-Akiva
Venue: Transportation Science (2000)

This paper examines two different approaches for real-time estimation/prediction of time-dependent Origin--Destination (O--D) flows. Both approaches lend themselves to formulation as state-space models. The first approach is an extension of previous work by the authors. The key idea in this approach is to define the state-vector in terms of deviations in O--D flows instead of the O--D flows themselves. We demonstrate that approximations to this model make the real-time estimation process computationally more tractable with little deterioration in quality of estimates. In the second approach, the state vector is defined in terms of deviations of departure rates from each origin and the shares headed to each destination. This approach attempts to capture the differential variation of departure rates and shares over time. Performance of the proposed models is evaluated using actual traffic data from different sources. Preliminary results indicate that the filtering procedure is robust and that, compared to the original model, a formulation based on departure rates and shares yields better predictions with some loss of accuracy in filtered estimates.
Gaussian averages, Bernoulli averages, and Gibbs' measures
Authors: Michel Talagrand
Venue: Random Structures Algorithms (2002)

We prove a new comparison principle between the expected value of the supremum of a family of r.v. of the type Σi ≤ N giai, where (gi) are i.i.d. standard gaussian, and the expected value of the supremum of the same family when the r.v. gi are replaced by Bernoulli r.v. ηi, P(ηi = ± 1) = 1/2. The main idea is to approximate the supremum by a weighted average, an idea well known in the theory of spin glasses.
General Open and Closed Queueing Networks with Blocking: A Unified Framework for Approximation
Authors: Mark Vroblefski, R. Ramesh, Stanley Zionts
Venue: INFORMS Journal on Computing (2000)

In this paper, we develop a unified framework for approximating open and closed queueing networks under any general blocking protocol by extending and generalizing the approximation algorithm for open tandem queues under minimal blocking presented in Di Mascolo et al. (1996). The proposed framework is based on decomposition. We develop decomposition structures and analysis algorithms for any general blocking system using the framework. The proposed algorithms have been extensively tested using simulations as a benchmarking device. The results show that the proposed framework yields robust, reliable, and accurate estimates of system characteristics, such as throughput and Work-In-Process inventory in a wide range of system configurations. The computational load is minimal. The unified framework presents a highly useful set of tools of analysis for queueing-system designers to use in evaluating the performance under numerous design alternatives. Directions for future research are presented, with a focus on critical application areas such as packet-switching-network design and cellular manufacturing.
Cognitive Foundations of Probability
Authors: Itzhak Gilboa, David Schmeidler
Venue: Mathematics of Operations Research (2002)

Prediction is based on past cases. We assume that a predictor can rank eventualities according to their plausibility given any memory that consists of repetitions of past cases. In a companion paper, we show that under mild consistency requirements, these rankings can be represented by numerical functions, such that the function corresponding to each eventuality is linear in the number of case repetitions. In this paper we extend the analysis to rankings of events. Our main result is that a cancellation condition Ã la de Finetti implies that these functions are additive with respect to union of disjoint sets. If the set of past cases coincides with the set of possible eventualities, natural conditions are equivalent to ranking events by their empirical frequencies. More generally, our results may describe how individuals form probabilistic beliefs given cases that are only partially pertinent to the prediction problem at hand, and how this subjective measure of pertinence can be derived from likelihood rankings.
Continuous and Discrete Shipping Strategies for the Single Link Problem
Authors: Luca Bertazzi, Maria Grazia Speranza
Venue: Transportation Science (2002)

We consider the problem of shipping several products from a common origin to a common destination. Each product is offered at the origin and absorbed at the destination at a given constant rate. The objective of the problem is to determine a shipping strategy that minimizes the sum of the transportation and the inventory costs. We present a general framework of analysis from which we derive the known approaches with a continuous frequency and with a set of given frequencies as particular cases. Moreover, we derive from the general framework a new model for the case with discrete shipping times in which a shipment can take place at each discrete time instant. We prove that the optimal solutions of the three models can be ranked and that the distance between the optimal costs can be unlimited in the worst case. Finally, we evaluate, on the basis of a set of randomly generated problem instances, the ?average? distance between the optimal solutions of the models.
A Krylov Subspace Method for Covariance Approximation and Simulation of Random Processes and Fields
Authors: Michael K. Schneider, Alan S. Willsky
Venue: Multidimensional Systems and Signal Processing (2003)

This paper proposes a new iterative algorithm for simultaneously computing an approximation to the covariance matrix of a random vector and drawing a sample from that approximation. The algorithm is especially suited to cases for which the elements of the random vector are samples of a stochastic process or random field. The proposed algorithm has close connections to the conjugate gradient method for solving linear systems of equations. A comparison is made between our algorithm's structure and complexity and other methods for simulation and covariance matrix approximation, including those based on FFTs and Lanczos methods. The convergence of our iterative algorithm is analyzed both analytically and empirically, and a preconditioning technique for accelerating convergence is explored. The numerical examples include a fractional Brownian motion and a random field with the spherical covariance used in geostatistics.
Preconditioning C1 Lagrange polynomial spline collocation method of elliptic equations by finite element method
Authors: Sang Dong Kim, Byeong Chun Shin
Venue: Applied Mathematics and Computation (2002)

This paper studies a preconditioning polynomial spline collocation method for an elliptic differential equation by a finite element stiffness matrix. For which, we first show that the decay rate of the C1 Lagrange polynomial spline increases with increasing degree and second show that the distribution of eigenvalues for the established preconditioning system is well bounded in terms of the number of unknowns for a fixed degree of polynomial spline.