Memory management optimization problems for integrated circuit simulators

In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator.An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time.     

Detection of hepatocarcinoma in rats by integration of the fluorescence spectrum: Experimental model

The incorporation of spectroscopic techniques into diagnostic procedures may greatly improve the chances for precise diagnostics. One promising technique is fluorescence spectroscopy, which has recently been used to detect many different types of diseases. In this work, we use laser-induced tissue fluorescence to detect hepatocarcinoma in rats using excitation light at wavelengths of 443 and 532 nm. Hepatocarcinoma was induced chemically in Wistar rats. The collected fluorescence spectrum ranges from the excitation wavelength up to 850 nm. A mathematical procedure carried out on the spectrum determines a figure of merit value, which allows the detection of hepatocarcinoma. The figure of merit involves a procedure which evaluates the ratio between the backscattered excitation wavelength and the broad emission fluorescence band. We demonstrate that a normalization allowed by integration of the fluorescence spectra is a simple operation that may allow the detection of hepatocarcinoma.     

On matrices with operator entries

In this paper we consider certain matrix equations in the field of Mikusiński operators, and construct a method for obtaining an approximate solution which allows working with numerical constants instead of operators. The theory of diagonally dominant matrices is applied for the analysis, existence and character of the obtained solutions. We introduce a method for determining approximate solutions of a discrete analogue for operational differential equations and give conditions for their existence. The error of the approximation is estimated.     

Thee + e −→¯nn cross section predicted remarkably larger than thee + e −→¯pp one

It is shown that all global analyses of nucleon electromagnetic form factor data predict the electron-positron annihilation into neutron-antineutron cross section (for which there are no data till now) to be in a finite energy region substantially larger than the electron-positron annihilation into the proton-antiproton one.Dedicated to the memory of M. Gmitro.     

IR finite one-loop box scalar integral with massless internal lines

The IR finite one-loop box scalar integral with massless internal lines has been recalculated. The result is very compact, simple and valid for arbitrary values of the relevant kinematic variables. It is given in terms of only two dilogarithms and a few logarithms, all of very simple arguments. Received: 31 January 2002 / Published online: 26 April 2002     

An expansion in the exponent for compound binomial approximations

The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.