Strong interactions at low energies

The lectures review some of the basic concepts relevant for an understanding of the low energy properties of the strong interactions: chiral symmetry, spontaneous symmetry breakdown, Goldstone bosons, quark condensate. The effective field theory used to analyze the low energy structure is briefly sketched. As an illustration, I discuss the implications of the recent data on the decay K→ππeν for the magnitude of the quark condensate.     

A framework for reconfigurable computing: task scheduling and context management-a summary

Reconfigurable computing is consolidating itself as a real alternative to ASICs (Application Specific Integrated Circuits) and general-purpose processors. The main advantage of reconfigurable computing derives from its unique combination of broad applicability, provided by the reconfiguration capability, and achievable performance, through the potential parallelism exploitation. The key aspects of the scheduling problem in a reconfigurable architecture are discussed, focusing on a task scheduling methodology for DSP and multimedia applications, as well as the context management and scheduling optimizations.     

Computer-generated holograms from 3D-objects written on twisted-nematic liquid crystal displays

In order to optimize computer-generated holograms (CGHs) for three-dimensional objects, an extension of the well known Gerchberg-Saxton algorithm is used. Optical reconstructions using an electrically addressed twisted-nematic liquid crystal display are presented. For arbitrary CGHs, reconstructing 3D-objects, we will discuss the problems and solutions associated with periodic replication of holograms.     

I-slot characteristics

I-shaped slots will fit entirely on the rectangular waveguide narrow wall without wrapping onto the broad wall. This slot type is suitable for single plane scan-phased arrays where element spacing, in the scan plane, is equal to or less than one-half wavelength. The method of moments solution for the I-slot is presented. Comparison of computed results with measured data illustrates the validity of this solution. To facilitate future designs, the waveguide scattering parameters and the radiation characteristics of I-slots are included     

Forming mental models in learning operating procedures for terminalequipment

People faced with an unfamiliar product or service tend to fall back on mental models based on analogical relationships with familiar products or services. Two experiments on the analogical relationships or metaphors that people might use when operating a communications terminal are described. In the first experiment, the role previously acquired operating knowledge has in determining the mental models people use when directory dialing with novel equipment is examined. In a second experiment, it is shown that an explicit appeal to an analogy between conventional mail and electronic mail can help users learn to use an electronic mail system, and make it easier for them to remember how to use the system as long as 90 days after initial exposure. It is concluded that the mental model is constructed only from the user's operating knowledge acquired as a result of past experiences, and the metaphor method is effective when the instructions are metaphorically taught     

Single-chip design of bit-error-correcting stack decoders

The design of a single-chip VLSI system to implement the Zigangirov-Jelinek sequential decoding algorithm for bit-error-correction is described and the dependence of performance on design parameters is discussed. By virtue of being self-contained, having few input and output pins, and processing stack elements once each clock cycle, the system should be capable of high-speed decoding. For constraint length 21, rate 1/2 codes, and 3-b soft decision detection, it is found that a system containing approximately 25000 stack cells reduces errors in a 3-dB signal-to-noise level environment, corresponding to 7.8% hard decision error rate, by two orders of magnitude. Higher decoding gain is obtained at lower noise levels through the use of a relatively long constraint length. The constraint length is not limited by the architecture. Chip area estimates needed to obtain prescribed decoded error rates and average decoding rates are also described and indicate that an effective system is potentially achievable with current technology     

List-mode likelihood: EM algorithm and image quality estimationdemonstrated on 2-D PET

Using a theory of list-mode maximum-likelihood (ML) source reconstruction presented recently by Barrett et al. (1997), this paper formulates a corresponding expectation-maximization (EM) algorithm, as well as a method for estimating noise properties at the ML estimate. List-mode ML is of interest in cases where the dimensionality of the measurement space impedes a binning of the measurement data. It can be advantageous in cases where a better forward model can be obtained by including more measurement coordinates provided by a given detector. Different figures of merit for the detector performance can be computed from the Fisher information matrix (FIM). This paper uses the observed FIM, which requires a single data set, thus, avoiding costly ensemble statistics. The proposed techniques are demonstrated for an idealized two-dimensional (2-D) positron emission tomography (PET) [2-D PET] detector. The authors compute from simulation data the improved image quality obtained by including the time of flight of the coincident quanta     

Scale periodicity and its sampling theorem

The scalar transform is a new representation for signals, offering a perspective that is different from the Fourier transform. We introduce the notion of a scalar periodic function. These functions are then represented through the discrete scale series. We also define the notion of a strictly scale-limited signal. Analogous to the Shannon interpolation formula, we show that such signals can be exactly reconstructed from exponentially spaced samples of the signal in the time domain. As an interesting, practical application, we show how properties unique to the scale transform make it very useful in computing depth maps of a scene     

Deciding Frattini is NP-complete

We show that it is a NP-complete problem to decide whether a finite poset arises as the (Birkhoff) dual of the Frattini sublattice of some finite distributive lattice.This work was supported in part by Swiss NSF grant 20-32644.91.