Fabrication of multilayer systems combining microfluidic andmicrooptical elements for fluorescence detection

This paper presents the fabrication of a microchemical chip for the detection of fluorescence species in microfluidics. The microfluidic network is wet-etched in a Borofloat 33 (Pyrex) glass wafer and sealed by means of a second wafer. Unlike other similar chemical systems, the detection system is realized with the help of microfabrication techniques and directly deposited on both sides of the microchemical chip. The detection system is composed of the combination of refractive microlens arrays and chromium aperture arrays. The microfluidic channels are 60 μm wide and 25 μm deep. The utilization of elliptical microlens arrays to reduce aberration effects and the integration of an intermediate (between the two bonded wafers) aluminum aperture array are also presented. The elliptical microlenses have a major axis of 400 μm and a minor axis of 350 μm. The circular microlens diameters range from 280 to 300 μm. The apertures deposited on the outer chip surfaces are etched in a 3000-Å-thick chromium layer, whereas the intermediate aperture layer is etched in a 1000-Å-thick aluminum layer. The overall thickness of this microchemical system is less than 1.6 mm. The wet-etching process and new bonding procedures are discussed. Moreover, we present the successful detection of a 10-nM Cy5 solution with a signal-to-noise ratio (SNR) of 21 dB by means of this system     

QoS Filtering and Resource Reservation in an Internet Environment

Multimedia group applications often operate in an environment where the various participants are located on systems and communication links with different capabilities. Mechanisms are required that ensure full-quality media for high-performance workstations but lower-quality media for playout at low-end systems. QoS filters have been proposed as a way to adapt QoS to the user specified level by changing the structure of a media stream in a well defined way. Resource reservation and QoS filter instantiation should be closely integrated since both represent one particular aspect of the provision of individualistic QoS for heterogeneous users in multipeer communications. The Internet reservation protocol RSVP is receiver oriented and allows each receiver to specify its resource requirements. However, no actual mechanisms are defined that adapt the data stream to the receiver specified QoS requirements.In this paper we present an enhanced version of RSVP (called RSVP++) that integrates resource reservation and QoS filter control. In order to achieve this integration we extend the RSVP functional model and define a new QoS service class. RSVP++ can coexist with common RSVP systems, thus, openness and interoperability of the system are ensured.     

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search

Although lexicographic (lex) variants of greedy algorithms are often P -complete, NC -algorithms are known for the following lex-search problems: lexicographic depth-first search (lex-dfs) for dags [12], [17], lexicographic breadth-first search (lex-bfs) for digraphs [12], [17], and lexicographic topological-first search (lex-tfs) for dags [12]. For the all-sources version of the problem for dense digraphs, the lex-dfs (lex-bfs, lex-tfs) in [12] is (within a log factor of) work-optimal with respect to the all-sources sequential solution that performs a dfs (bfs, tfs) from every vertex. By contrast, to solve the single-source lexicographic version on inputs of size n , all known NC -algorithms perform work that is at least an n factor away from the work performed by their sequential counterparts. We present parallel algorithms that solve the single-source version of these lex-search problems in O(log  ² n) time using M(n) processors on the EREW PRAM. (M(n) denotes the number of processors required to multiply two n\times n integer matrices in O(log  n) time and has O(n ^2.376 ) as tightest currently known bound.) They all offer a polynomial improvement in work-efficiency over that of their corresponding best previously known and close the gap between the requirements of the best known parallel algorithms for the lex and the nonlex versions of the problems. Key to the efficiency of these algorithms is the novel idea of a lex-splitting tree and lex-conquer subgraphs of a dag G from source s . These structures provide a divide-and-conquer skeleton from which NC -algorithms for several lexicographic search problems emerge, in particular, an algorithm that places in the class NC the lex-dfs for reducible flow graphs—an interesting class of graphs which arise naturally in connection with code optimization and data flow analysis [4], [19]. A notable aspect of these algorithms is that they solve the lex-search problem instance at hand by efficiently transforming solutions of appropriate instances of (nonlex) path problems. This renders them potentially capable of transferring significant algorithmic advances—such as Driscoll et al.'s [14] single-source shortest paths algorithm and Ullman and Yannakakis' [34] transitive closure algorithm—from fundamental (nonlex) path problems to lex-search problems. Received January 9, 1994, and in revised form November 1997. Online publication July 20, 2001.     

Distributed planning and control systems for the virtual enterprise: organizational requirements and development life-cycle

This paper describes the requirements analysis and system specification of an Order Promise module to be used as part of a broader Decision Support System for production and operations planning of a Virtual Enterprise. This work is part of a broader project with a particular focus on the microelectronics industry which is a good example of Virtual Enterprise, and where a quick response to the customers needs and to unpredictable changes in production conditions is considered a major factor for success. First, the analysis and specification are presented within a development framework that involves the study of organizational issues of semiconductor enterprises. The use of ontological engineering for supporting the communication and shared understanding of the system concepts is explained and a virtual enterprise ontology is outlined. Following the clarification of the concept of virtual enterprise, the generic techno-organizational requirements for the information system are derived. Finally, a specification of the global planning module and a more detailed one regarding the order promise module is presented.     

An Analysis of Edge Detection by Using the Jensen-Shannon Divergence

This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images.     

几何数据压缩的一种新算法

本文提出一种几何数据压缩的新算法,其基本思想是在已知物体网格边界的条件下,首先寻找边界的凹点,然后建立网格结点的特殊树结构,即横切面树,并将横切面树中相邻节点内网格结点之间的关系表示为链表（三角形条带）,按契约数结构及链表（三角形条带）编码、存储帮传输网格结点的连接关系,这种算法不同于Gabriel Taubin算法,它具有对顶点坐标、属性坐标及三角形连接关系压缩无损等许多优点。     

Visual specification of measurements and redesigns for domain specific visual languages

Ensuring model quality is a key success factor in many computer science areas, and becomes crucial in recent software engineering paradigms like the one proposed by model-driven software development. Tool support for measurements and redesigns becomes essential to help developers improve the quality of their models. However, developing such helper tools for the wide variety of (frequently domain specific) visual notations used by software engineers is a hard and repetitive task that does not take advantage from previous developments, thus being frequently forgotten.In this paper we present our approach for the visual specification of measurements and redesigns for Domain Specific Visual Languages (DSVLs). With this purpose, we introduce a novel DSVL called SLAMMER that contains generalisations of some of the more used types of internal product measurements and redesigns. The goal is to facilitate the task of defining measurements and redesigns for any DSVL, as well as the generation of tools from such specification reducing or eliminating the necessity of coding. We rely on the use of visual patterns for the specification of the relevant elements for each measurement and redesign type. In addition, SLAMMER allows the specification of redesigns either procedurally or by means of graph transformation rules. These redesigns can be triggered when the measurements reach a certain threshold.These concepts have been implemented in the meta-modelling tool AToM³. In this way, when a DSVL is designed, it is possible to specify measurements and redesigns that will become available in the final modelling environment generated for the language. As an example, we show a case study in the web modelling domain.     

An adaptive learning approach for 3-D surface reconstruction from point clouds.

In this paper, we propose a multiresolution approach for surface reconstruction from clouds of unorganized points representing an object surface in 3-D space. The proposed method uses a set of mesh operators and simple rules for selective mesh refinement, with a strategy based on Kohonen's self-organizing map (SOM). Basically, a self-adaptive scheme is used for iteratively moving vertices of an initial simple mesh in the direction of the set of points, ideally the object boundary. Successive refinement and motion of vertices are applied leading to a more detailed surface, in a multiresolution, iterative scheme. Reconstruction was experimented on with several point sets, including different shapes and sizes. Results show generated meshes very close to object final shapes. We include measures of performance and discuss robustness.     

Characterizing displays by their temporal aperture: A theoretical framework

Abstract— The spatio‐temporal aperture and sample rate of a video display determines both the static and dynamic resolution of the video signal that is rendered. The dynamic display characteristics like the visibility of large‐area flicker, motion judder, and motion blur can be derived from the frame rate and the temporal extent of the pixel aperture (i.e., the temporal aperture). For example, liquid‐crystal displays (LCDs) have an aperture that is relatively small in the spatial dimension and wide in the temporal domain. Consequently, moving objects displayed on an LCD suffer from motion blur. Especially in TV applications, the temporal dimension has a large impact on the overall picture quality. The temporal aperture, together with the frame rate, is shown to predict the amount of perceived large‐area flicker, motion judder, and motion blur and also the performance of motion‐blur reduction algorithms for LCDs. From this analysis it is further determined how to obtain the optimal temporal aperture of a television display, for which not only properties of the human visual system (HVS), but also the properties of the video signal have to be taken into account.     

2‐D/3‐D displays based on switchable lenticulars

Abstract— An attractive concept for 3‐D displays is the one based on LCDs equipped with lenticular lenses. This enables autostereoscopic multiview 3‐D displays without a loss in brightness. A general issue in multiview 3‐D displays is their relatively low spatial resolution because the pixels are divided among the different views. To overcome this problem, we have developed switchable displays, using liquid‐crystal (LC) filled switchable lenticulars. In this way, it is possible to have a high‐brightness 3‐D display capable of fully exploiting the native 2‐D resolution of the underlying LCD. The feasibility of LC‐filled switchable lenticulars was shown in several applications. For applications in which it is advantageous to be able to display 3‐D and 2‐D content simultaneously, a 42‐in. locally switchable prototype having a matrix electrode structure was developed. These displays were realized using cylindrically shaped lenticular lenses in contact with LC. An alternative for these are lenticulars based on gradient‐index (GRIN) LC lenses. Preliminary results for such switchable GRIN lenses are presented as well.