Generation and control of ultrafast pulse trains for quasi-phase-matching high-harmonic generation

Two techniques are demonstrated to produce ultrashort pulse trains capable of quasi-phase-matching high-harmonic generation. The first technique makes use of an array of birefringent crystals and is shown to generate high-contrast pulse trains with constant pulse spacing. The second technique employs a grating-pair stretcher, a multiple-order wave plate, and a linear polarizer. Trains of up to 100 pulses are demonstrated with this technique, with almost constant inter-pulse separation. It is shown that arbitrary pulse separation can be achieved by introducing the appropriate dispersion. This principle is demonstrated by using an acousto-optic programmable dispersive filter to introduce third-and fourth-order dispersions leading to a linear and quadratic variation of the separation of pulses through the train. Chirped-pulse trains of this type may be used to quasi-phase-match high-harmonic generation in situations where the coherence length varies through the medium. (C) 2010 Optical Society of America

Dense pixel matching between unrectified and distorted images using dynamic programming

In this paper, a novel framework for dense pixel matching based on dynamic programming is introduced. Unlike most techniques proposed in the literature, our approach assumes neither known camera geometry nor the availability of rectified images. Under such conditions, the matching task cannot be reduced to finding correspondences between a pair of scanlines. We propose to extend existing dynamic programming methodologies to a larger dimensional space by using a 3D scoring matrix so that correspondences between a line and a whole image can be calculated. After assessing our framework on a standard evaluation dataset of rectified stereo images, experiments are conducted on unrectified and non-linearly distorted images. Results validate our new approach and reveal the versatility of our algorithm.

Design and analysis of matching circuit architectures for a closest match lookup

This paper investigates the implementation of a number of circuits used to perform a high speed closest value match lookup. The design is targeted particularly for use in a search trie, as used in various networking lookup applications, but can be applied to many other areas where such a match is required. A range of different designs have been considered and implemented on FPGA. A detailed description of the architectures investigated is followed by an analysis of the synthesis results. © 2006 IEEE.

Hardware elliptic curve cryptographic processor over GF(p)

A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications. © 2006 IEEE.

Carbon-14 wiggle-match dating of peat deposits: advantages and limitations

Carbon-14 wiggle-match dating (WMD) of peat deposits uses the non-linear relationship between 14C age and calendar age to match the shape of a series of closely spaced peat 14C dates with the 14C calibration curve. The method of WMD is discussed, and its advantages and limitations are compared with calibration of individual dates. A numerical approach to WMD is introduced that makes it possible to assess the precision of WMD chronologies. During several intervals of the Holocene, the 14C calibration curve shows less pronounced fluctuations. We assess whether wiggle-matching is also a feasible strategy for these parts of the 14C calibration curve. High-precision chronologies, such as obtainable with WMD, are needed for studies of rapid climate changes and their possible causes during the Holocene.

First-Order Reversal Curve Probing of Spatially Resolved Polarization Switching Dynamics in Ferroelectric Nanocapacitors

Spatially resolved polarization switching In ferroelectric nanocapacitors was studied on the sub-25 nm scale using the first-order reversal curve (FORC) method. The chosen capacitor geometry allows both high-veracity observation of the domain structure and mapping of polarization switching in a uniform field, synergistically combining microstructural observations and probing of uniform-field polarization responses as relevant to device operation. A classical Kolmogorov-Avrami-Ishibashi model has been adapted to the voltage domain, and the individual switching dynamics of the FORC response curves are well approximated by the adapted model. The comparison with microstructures suggests a strong spatial variability of the switching dynamics inside the nanocapacitors.

An Evidential Approach to Query Interface Matching on the Deep Web

Matching query interfaces is a crucial step in data integration across multiple Web databases. The problem is closely related to schema matching that typically exploits different features of schemas. Relying on a particular feature of schemas is not suffcient. We propose an evidential approach to combining multiple matchers using Dempster-Shafer theory of evidence. First, our approach views the match results of an individual matcher as a source of evidence that provides a level of confidence on the validity of each candidate attribute correspondence. Second, it combines multiple sources of evidence to get a combined mass function that represents the overall level of confidence, taking into account the match results of different matchers. Our combination mechanism does not require use of weighing parameters, hence no setting and tuning of them is needed. Third, it selects the top k attribute correspondences of each source attribute from the target schema based on the combined mass function. Finally it uses some heuristics to resolve any conflicts between the attribute correspondences of different source attributes. Our experimental results show that our approach is highly accurate and effective.