Pillar-assisted epitaxial assembly of toric focal conic domains of smectic-a liquid crystals

SU-8 pillar-assisted epitaxial assembly of toric focal conic domains (TFCDs) arrays of smectic-A liquid crystals is studied. The 3D nature of the pillar array is crucial to confine and direct the formation of TFCDs on the top of each pillar and between neighboring pillars, leading to highly ordered square and hexagonal array TFCDs. Excellent agreement between the experimentally obtained critical pillar diameter and elasticity calculation is found.     

An Investigation of the Electrical Degradation of GaN High-Electron-Mobility Transistors by Numerical Simulations of DC Characteristics and Scattering Parameters

The effects of direct-current (DC) stress on GaN high-electron-mobility transistors (HEMTs) are investigated by means of numerical simulations, by which the creation of an acceptor trap in the AlGaN barrier layer was correlated to the observed experimental degradation. An increase in the trap concentration induces a worsening of the saturated current I _DSS, transconductance g _m, and output conductance g _O. An increase in the length of the trapping region induces a degradation of I _DSS and g _m, but can reduce g _O. Analysis of scattering parameters in the saturation region shows that the cutoff frequency f _T matches the trend of g _m.     

Comparison of MCNPX-C90 and TRIPOLI-4-D for fuel depletion calculations of a Gas-cooled Fast Reactor

The Gas-cooled Fast Reactor is one of the reactor concepts selected by the Generation IV International Forum for the next generation of innovative nuclear energy systems. Several fuel design concepts are being investigated. Burnup depletion of mixed fuel of uranium and plutonium, cooled with gas in a fast neutron energy spectrum must be simulated. Various codes are being developed and/or adapted to improve the quality of the results, and also to reduce the computing time required for the simulations.     

Distance browsing in distributed multimedia databases

The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed.In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.The proposed algorithm is being used in two running projects: SAPIR and NeP4B.     

Life cycle activity analysis: logistics and environmental policies for bottled water in Portugal

An innovative mathematical programming decision support model –Life Cycle Activity Analysis (LCAA)– is presented, integrating considerations of optimal allocations of resources and impacts upon the environment during the life cycle of products. LCAA is based on the classical formulation of activity analysis and on the life cycle assessment framework. The concept of linear activities is extended to embrace mass and energy fluxes over the entire life cycle of products including their environmental impacts. Special attention is given to the presence of loops in the product chains, such as those occurring when materials/products are recovered (reused, recycled.). An application brought from the Portuguese bottled water industry is described. The model features alternative activities for production technologies and product recovery strategies and permits the joint consideration of monetary costs and environmental burdens. The results obtained under five scenarios, including distinct disposal strategies and environmental constraints, are discussed.     

Structured Parallel Architecture for Displacement MIMO Kalman Equalizer in CDMA Systems

A reduced complexity MIMO Kalman equalizer architecture is proposed in this brief by jointly considering the displacement structure and the block-Toeplitz structure. Numerical matrix-matrix multiplications with O(F³) complexity are eliminated by simple data loading process, where F is the spreading factor. Finally, an iterative Conjugate-Gradient based algorithm is proposed to avoid the inverse of the Hermitian symmetric innovation covariance matrix in Kalman gain processor. The proposed architecture not only reduces the numerical complexity from O(F²) to O(Flog₂F) per chip, but also facilitates the parallel and pipelined VLSI implementation in real-time processing     

A metatheory of a mechanized object theory

In this paper we propose a metatheory, MT, which represents the computation which implements its object theory, OT, and, in particular, the computation which implements deduction in OT. To emphasize this fact we say that MT is a metatheory of a mechanized object theory. MT has some “unusual” properties, e.g. it explicitly represents failure in the application of inference rules, and the fact that large amounts of the code implementing OT are partial, i.e. they work only for a limited class of inputs. These properties allow us to use MT to express and prove tactics, i.e. expressions which specify how to compose possibly failing applications of inference rules, to interpret them procedurally to assert theorems in OT, to compile them into the system implementation code, and, finally, to generate MT automatically from the system code. The definition of MT is part of a larger project which aims at the implementation of self-reflective systems, i.e. systems which are able to introspect their own code, to reason about it and, possibly, to extend or modify it.     

Integration of polynomials over n-dimensional polyhedra

Explicit formulae and algorithms for computing integrals of polynomials over n-dimensional polyhedra are given. Two different approaches are discussed: one uses a decompositive representation, while the other one uses a boundary representation of the polyhedron. The algorithms are followed by a discussion of the complexity. In the appendix the pseudo-code and some examples of calculation are given.     

Electric load analysis using an artificial neural network

Load forecasting in the current, increasingly liberalized, electricity power market is of crucial importance as a means for producers to optimize and rationalize energy supply. A number of electric power companies are equipped to make forecasts with the aid of traditional statistical methods. This paper presents the use of an artificial neural net to an hourly based load forecasting application for a small electric grid on an Italian island (Lipari) not connected to the mainland. The aim was to examine the forecasting ability of a neural net in a situation where the electric load was subject to considerable seasonal variations over the year. The variations are affected by energy demand related to the tourism season as well as by climatic conditions, especially temperature. The network developed was a multi‐layer perceptron type built on three layers trained with a back‐propagation algorithm. The input layer receives all the most relevant information regarding: the class of day type, the hour in the daytime, the load and background temperature recorded at the indicated time for the months of March, August and October whilst the output layer provides the forecast value at the indicated time in December. The results obtained are encouraging; in the training phase the RMS error rate was around 2% and this rate settled at about 2.6% during testing. As both the margins of error recorded are acceptable, the use of a neural network for electric load forecasting applications can be considered an attractive option. Copyright © 2005 John Wiley & Sons, Ltd.