Search results for "Algorithms"
showing 10 items of 1716 documents
Quasi-spherical focal spot in two-photon scanning microscopy by three-ring apodization
2005
International audience; We present a beam-shaping technique for two-photon excitation (TPE) fluorescence microscopy. We show that by inserting a properly designed three-ring pupil filter in the illumination beam of the microscope, the effective optical sectioning capacity of such a system improves so that the point spread function gets a quasi-spherical shape. Such an improvement, which allows the acquisition of 3D images with isotropic quality, is obtained at the expense of only a small increase of the overall energy in the axial sidelobes. The performance of this technique is illustrated with a scanning TPE microscopy experiment in which the image of small beads is obtained. We demonstrat…
Characterization of Orlicz–Sobolev space
2007
We give a new characterization of the Orlicz–Sobolev space W1,Ψ(Rn) in terms of a pointwise inequality connected to the Young function Ψ. We also study different Poincaré inequalities in the metric measure space.
Human-technology relations in an age of surveillance capitalism. Towards an anthropological theory of the dialectic between analogue and digital huma…
2021
What can anthropology contribute to the current debates about the negative effects of social media on people? Starting from a critique of anthropological work that sees human subjectivity and culture as ontologically unaffected by social media use, I propose that human engagement with these digital technologies produces significant ontological transformations that deserve more attention. I develop my analysis in dialogue with Boellstorff’s ontology of the digital, Nardi’s theorisation of virtuality and affordances, and Zuboff’s formulation of surveillance capitalism, and I use empirical illustrations from the Cambridge Analytica data scandal to highlight key theoretical junctures. My main c…
13C/12C composition, a novel parameter to study the downward migration of paper sludge in soils
2002
δ13C values of crop and forest soils were measured 8 years after disposal of paper sewage sludge. The carbon transfer from paper sludge downward to the first humic layer is evidenced by a 13C-enrichnient of up to + 5.6‰ due to the input of 13C-enriched sludge carbonates. 13C/12C composition is thus a novel, sensitive parameter to follow the downward transfer of paper sludge carbon.
Statistical Analysis of a Method to Predict Drug–Polymer Miscibility
2015
In this study, a method proposed to predict drug-polymer miscibility from differential scanning calorimetry measurements was subjected to statistical analysis. The method is relatively fast and inexpensive and has gained popularity as a result of the increasing interest in the formulation of drugs as amorphous solid dispersions. However, it does not include a standard statistical assessment of the experimental uncertainty by means of a confidence interval. In addition, it applies a routine mathematical operation known as "transformation to linearity," which previously has been shown to be subject to a substantial bias. The statistical analysis performed in this present study revealed that t…
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
New background correction approach based on polynomial regressions for on-line liquid chromatography-Fourier transform infrared spectrometry.
2008
Abstract In the present study a new approach for the chemometric background correction in on-line gradient LC–FTIR is introduced. For this purpose, the spectral changes of the elution mixture during gradient elution were analyzed applying 2D correlation spectroscopy. The fundamentals of the new background correction algorithm, based on polynomial fits calculated from a reference spectra matrix (Polyfit-RSM method) are explained. The Polyfit-RSM approach was applied on blank gradient runs as well as on LC–FTIR data obtained from the injection of a soft drink sample using acetonitrile:water as eluent. Results found were critically assessed and compared to those obtained by two previous backgr…
Benchmarking parameter-free AMaLGaM on functions with and without noise.
2013
We describe a parameter-free estimation-of-distribution algorithm (EDA) called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm (AMaLGaM-ID[Formula: see text]A, or AMaLGaM for short) for numerical optimization. AMaLGaM is benchmarked within the 2009 black box optimization benchmarking (BBOB) framework and compared to a variant with incremental model building (iAMaLGaM). We study the implications of factorizing the covariance matrix in the Gaussian distribution, to use only a few or no covariances. Further, AMaLGaM and iAMaLGaM are also evaluated on the noisy BBOB problems and we assess how well multiple evaluations per solution can average ou…
A Characterization of Quintic Helices
2005
A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.
Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses
2013
International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…