Sol–Gel Processing for Optical Communication Technology

Sol–gel is a versatile technology offering advantageous processing of complex shapes as well as material compositions. In the realm of optical communications, the applicability of a number of dielectric and hybrid materials in various photonic devices makes the technology particularly appealing vis-a-vis the vapor-phase methods that dominate the field today. One can find numerous reports of sol–gel processing for photonic components, although instances where this has been developed for product manufacture are far fewer. Here, we examine the different classes of optical communication devices from fibers to waveguides to photonic crystals and the ability of sol–gel processing to address their needs. Successful deployment appears to depend on two aspects: making innovative modifications to the traditional concept and developing supporting technologies to overcome the key drawbacks.     

Video personalization in heterogeneous and resource-constrained environments

Access to multimedia data and multimedia services is becoming increasingly common in networked mobile environments. In such environments, both the mobile client devices and multimedia servers are typically resource constrained. Moreover, the mobile client population is often heterogeneous in terms of the clients’ preferences with regard to multimedia content, the clients’ quality of service requirements and system-level resource constraints. In order to provide a resource-constrained mobile client with its desired video content, it is often necessary to personalize the requested multimedia content in a manner that satisfies simultaneously the various client-specified content preferences and the system-level resource constraints. Also, in order to simultaneously reduce the client-experienced latency, provide optimal quality of service to the clients and ensure efficient utilization of server and network resources, it is necessary to perform client request aggregation on the server end. To this end, a video personalization strategy is proposed to provide mobile, resource-constrained clients with personalized video content that is most relevant to the clients’ requests while satisfying simultaneously multiple client-side system-level resource constraints. A client request aggregation strategy is also proposed to cluster client requests with similar video content preferences and similar client-side resource constraints such that the number of requests the server needs to process and service, and the client-experienced latency are both reduced simultaneously. The primary contributions of the paper are: (1) the formulation and implementation of a Multiple-choice Multi-dimensional Knapsack Problem (MMKP)-based video personalization strategy; and (2) the design and implementation of a client request aggregation strategy based on a multi-stage clustering algorithm. Experimental results comparing the proposed MMKP-based video personalization strategy to existing 0/1 Knapsack Problem (0/1KP)-based and the Fractional Knapsack Problem (FKP)-based video personalization strategies are presented. It is observed that: (1) the proposed MMKP-based personalization strategy includes more relevant video content in response to the client’s request compared to the existing 0/1KP-based and FKP-based personalization strategies; and (2) in contrast to the 0/1KP-based and FKP-based personalization strategies which can satisfy only a single client-side resource constraint at a time, the proposed MMKP-based personalization strategy is capable of satisfying multiple client-side resource constraints simultaneously. Experimental results comparing the client-experienced latency with and without the proposed server-side client request aggregation strategy are also presented. It is shown that the proposed client request aggregation strategy reduces the mean client-experienced latency without significant reduction in the average relevance of the delivered video content and without significant deviation in the client-side resources actually consumed by the delivered video content from the client-specified resource constraints.     

Parallel stereocorrelation on a reconfigurable multi-ring network

A reconfigurable network termed as the reconfigurable multi-ring network (RMRN) is described. The RMRN is shown to be a truly scalable network in that each node in the network has a fixed degree of connectivity and the reconfiguration mechanism ensures a network diameter of O(log₂ N) for anN-processor network. Algorithms for the two-dimensional mesh and the SIMD or SPMD n-cube are shown to map very elegantly onto the RMRN. Basic message passing and reconfiguration primitives for the SIMD/SPMD RMRN are designed for use as building blocks for more complex parallel algorithms. The RMRN is shown to be a viable architecture for image processing and computer vision problems using the parallel computation of the stereocorrelation imaging operation as an example. Stereocorrelation is one of the most computationally intensive imaging tasks. It is used as a visualization tool in many applications, including remote sensing, geographic information systems and robot vision.An earlier version of this paper was presented at the 1995 International Conference on Parallel and Distributed Processing Techniques and Applications.     

替换机械式开关的单IC基电子电路

简单廉价电路使用一个低成本按键开关就可以触发电源的开关.该电路可替换更高价格及外形较大的按键式机械开关.按键开关触发一个单稳电路.     

Structure and elevated temperature properties of carbon-free ferritic alloys strengthened by a laves phase

A Laves phase, Fe₂Ta, was utilized to obtain good elevated temperature properties in a carbon-free iron alloy containing 1 at. pct Ta and 7 at. pct Cr. Room temperature embrittlement resulting from the precipitation of the Laves phase at grain boundaries was overcome by spheroidizing the precipitate. This was accomplished by thermally cycling the alloys through the α→γ transformation. The short-time yield strength of the alloys decreased very slowly with increase in test temperature up to 600°C, but above this temperature, the strength decreased rapidly. Results of constant load creep and stress rupture tests conducted at several temperatures and stresses indicated that the rupture and creep strengths of spheroidized 1 Ta-7 Cr alloy were higher than those of several commercial steels containing chromium and/or molybdenum carbides but lower than those of steels containing substantial amounts of tungsten and vanadium. When molybdenum was added to the base Fe-Ta-Cr alloy, the rupture and creep strengths were considerably increased. M. Dilip Bhandarkar, formerly with Lawrence Berkeley Laboratory.     

Special Feature the Impact Of Semiconductor Technology on Computer Systems

Semiconductor logic and solid-state memory—the same basic technologies that gave us the calculator revolution—promise to provide the tools for automation in the factory and office.     

Design Trade-Offs in VAX-11 Translation Buffer Organization

A major feature of the VAX-11 is its large virtual address space. This trace-driven simulation scheme evaluates address translation hardware that supports this feature cost-effectively.     

Evolutionary Approaches to Figure-Ground Separation

The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on relaxation and gradient descent-based search, and stochastic optimization techniques based on simulated annealing and microcanonical annealing. A mathematical model encapsulating the figure-ground separation problem that makes explicit the definition of shape in terms of attributes such as cocircularity, smoothness, proximity and contrast is described. The model is based on the formulation of an energy function that incorporates pairwise interactions between local image features in the form of edgels and is shown to be isomorphic to the interacting spin (Ising) system from quantum physics. This paper explores a class of stochastic optimization techniques based on evolutionary algorithms for the problem of figure-ground separation. A class of hybrid evolutionary stochastic optimization algorithms based on a combination of evolutionary algorithms, simulated annealing and microcanonical annealing are shown to exhibit superior performance when compared to their purely evolutionary counterparts and to classical simulated annealing and microcanonical annealing algorithms. Experimental results on synthetic edgel maps and edgel maps derived from gray scale images are presented.     

Chromosome Reconstruction from Physical Maps Using a Cluster of Workstations

Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is shown to be isomorphic to the classical NP-complete Optimal Linear Arrangement problem. Parallel algorithms for simulated annealing and microcanonical annealing based on Markov chain decomposition are proposed and applied to the problem of chromosome reconstruction via clone ordering. These algorithms are implemented on a cluster of UNIX workstations using the Parallel Virtual Machine (PVM) system. PVM is a software system that permits a heterogeneous collection of networked computers to be viewed by a user's program as a single monolithic parallel computing resource. The parallel algorithms are implemented and tested on clonal data derived from Chromosome IV of the fungus Asperigillus nidulans Perturbation methods and problem-specific annealing heuristics for the parallel simulated annealing and parallel microcanonical annealing algorithms are proposed and described. Convergence, speedup and scalability characteristics of the various parallel algorithms are analyzed and discussed. This revised version was published online in June 2006 with corrections to the Cover Date.