Effects of sinus surgery on speech

The human 4 hour patch test provides an opportunity to identify substances with significant skin irritation potential without recourse to the use of animals. The protocol is designed to avoid the production of more than mild irritant reactions and meets the highest ethical standards. This paper provides the background to the development of the method and comments on its performance in the light of recent intra- and inter-laboratory investigations. In particular, the value of the method in providing 'gold standard' data for the identification of those substances (or preparations) which should, or should not, be classified as irritant to skin in European legislation is discussed. On the basis of the published data and supplementary investigations, recommendations are made on both the conduct and interpretation of the human 4 hour patch test. Finally, the lack of any necessity for formal validation of this assay is addressed.     

Electrical linewidth test structures fabricated in monocrystallinefilms for reference-material applications

The physical widths of reference features incorporated into electrical linewidth test structures patterned in films of monocrystalline silicon have been determined from Kelvin voltage measurements. The films in which the test structures are patterned are electrically insulated from the bulk-silicon substrate by a layer of silicon dioxide provided by SIMOX (Separation by the IMplantation of OXygen) processing. The motivation is to facilitate the development of linewidth reference materials for critical-dimension (CD) metrology-instrument calibration. The selection of the (110) orientation of the starting silicon and the orientation of the structures' features relative to the crystal lattice enable a lattice-plane-selective etch to generate reference-feature properties of rectangular cross section and atomically planar sidewalls. These properties are highly desirable for CD applications in which feature widths are certified with nanometer-level uncertainty for use by a diverse range of CD instruments. End applications include the development and calibration of new generations of CD instruments directed at controlling processes for manufacturing devices having sub-quarter-micrometer features     

Biodegradation of indole at high concentration by persolvent fermentation with Pseudomonas sp. ST-200

The value of flexible videoendoscopy as a biofeedback tool in conservative swallowing rehabilitation of patients suffering from aspiration after head and neck surgery was examined. For this purpose, the outcomes of conventional swallowing therapy and of swallowing therapy with support of videoendoscopic biofeedback were compared. In the first 40 days of swallowing therapy, videoendoscopic biofeedback significantly increased the chance of therapeutic success, shortening the period of functional rehabilitation in comparison to conventional swallowing therapy. Limitations of this visual biofeedback procedure are poor cognitive skills of the patient, rejection of the procedure by the patient and local factors that make the positioning of the endoscope difficult.     

Low-truncation-error finite difference equations for photonicssimulation. II. Vertical-cavity surface-emitting lasers

For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

Parallel architecture for fast transforms with trigonometric kernel

We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rⁿ. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms