OpenRaiser/Intern-Atlas huggingface dataset:
Manufacturing of A micro probe using supersonic aided electrolysis process
Venue: arXiv cs.OH 2008
Year: 2008

In this paper, a practical micromachining technology was applied for the fabrication of a micro probe using a complex nontraditional machining process. A series process was combined to machine tungsten carbide rods from original dimension. The original dimension of tungsten carbide rods was 3mm ; the rods were ground to a fixed-dimension of 50 micrometers using precision grinding machine in first step. And then, the rod could be machined to a middle-dimension of 20 micrometers by electrolysis. A final desired micro dimension can be achieved using supersonic aided electrolysis. High-aspect-ratio of micro tungsten carbide rod was easily obtained by this process. Surface roughness of the sample with supersonic aided agitation was compared with that with no agitation in electrolysis. The machined surface of the sample is very smooth due to ionized particles of anode could be removed by supersonic aided agitation during electrolysis. Deep micro holes can also be achieved by the machined high-aspect-rati tungsten carbide rod using EDM process. A micro probe of a ball shape at the end was processed by proposed supersonic aided electrolysis machining process.
Study of mechanical response in embossing of ceramic green substrate by micro-indentation
Venue: arXiv cs.OH 2008
Year: 2008

Micro-indentation test with a micro flat-end cone indenter was employed to simulate micro embossing process and investigate the thermo-mechanical response of ceramic green substrates. The laminated low temperature co-fired ceramic green tapes were used as the testing material ; the correlations of indentation depth versus applied force and applied stress at the temperatures of 25 degrees C and 75degrees C were studied. The results showed that permanent indentation cavities could be formed at temperatures ranging from 25 degrees C to 75 degrees C, and the depth of cavities created was applied force, temperature and dwell time dependent. Creep occurred and made a larger contribution to the plastic deformation at elevated temperatures and high peak loads. There was instantaneous recovery during the unloading and retarded recovery in the first day after indentation. There was no significant pile-up due to material flow observed under compression at the temperature up to 75 degrees C. The plastic deformation was the main cause for formation of cavity on the ceramic green substrate under compression. The results can be used as a guideline for embossing ceramic green substrates.
Optimization and AMS Modeling for Design of an Electrostatic Vibration Energy Harvester's Conditioning Circuit with an Auto-Adaptive Process to the External Vibration Changes
Venue: arXiv cs.OH 2008
Year: 2008

Electrostatic transducers for vibration energy scavenging have been an object to numerous studies, but are still facing major issues relating to their conditioning circuit. One of the most popular ones uses a charge pump and a flyback circuit based on a Buck DC-DC converter (Fig. 1). A commutation between the energy accumulation in the charge pump and the recharge of the buffer capacitor Cres is assured by a switch which is the major bottleneck in the energy harvester circuit. The commutation timing of the switch determines the efficiency of the energy harvesting. In previous papers [1] the switch commutates periodically with some fixed duty ratio. However, this solution is not appropriate when the environment parameters, e.g. the vibration frequency, change. We found that the switching should be ordered by the internal state of the circuit, an not by some fixed timing scenario. We presents how to find the optimal operation mode of the harvester. To validate the study, the system was modeled using a mixed VHDL-AMS - ELDO model.
Portable Valve-less Peristaltic Micro-pump Design and Fabrication
Venue: arXiv cs.OH 2008
Year: 2008

This paper is to describe a design and fabrication method for a valve-less peristaltic micro-pump. The valve-less peristaltic micro-pump with three membrane chambers in a serial is actuated by three piezoelectric (PZT) actuators. With the fluidic flow design, liquid in the flow channel is pumped to a constant flow speed ranged from 0.4 to 0.48 mm/s. In term of the maximum flow rate of the micro-pump is about 365 mircoliters/min, when the applied voltage is 24V and frequency 50 Hz. Photolithography process was used to fabricate the micro-pump mold. PDMS molding and PDMS bonding method were used to fabricate the micro-channel and actuator chambers. A portable drive controller was designed to control three PZT actuators in a proper sequence to drive the chamber membrane. Then, all parts were integrated into the portable valve-less peristaltic micro-pump system.
Microfluidic Device for Continuous Magnetophoretic Separation of Red Blood Cells
Venue: arXiv cs.OH 2008
Year: 2008

This paper presents a microfluidic device for magnetophoretic separation red blood cells from blood under contionous flow. The separation method consist of continous flow of a blood sample (diluted in PBS) through a microfluidic channel which presents on the bottom "dots" of feromagnetic layer. By appling a magnetic field perpendicular on the flowing direction, the feromagnetic "dots" generates a gradient of magnetic field which amplifies the magnetic force. As a result, the red blood cells are captured on the bottom of the microfluidic channel while the rest of the blood is collected at the outlet. Experimental results show that an average of 95 % of red blood cells are trapped in the device
Hot Roller Embossing for the Creation of Microfluidic Devices
Venue: arXiv cs.OH 2008
Year: 2008

We report on the hot roller embossing of polymer sheets for the creation of microfluidic structures. Measurements conducted on 100 $μ$m features showed that the lateral dimensions could be replicated to within 2% tolerance, while over 85% of mould depth was embossed. Feature sizes down to 50 $μ$m and feature depths up to 30 $μ$m had been achieved. At lower temperatures, asymmetric pile up of polymer material outside embossed regions was observed with higher pile up occurring on the trailing side of the embossed regions.
RF-MEMS beam components : FEM modelling and experimental identification of pull-in in presence of residual stress
Venue: arXiv cs.OH 2008
Year: 2008

In this paper an experimental validation of numerical approaches aimed to predict the coupled behaviour of microbeams for out-of-plane bending tests is performed. This work completes a previous investigation concerning in plane microbeams bending. Often out-of-plane microcantilevers and clamped-clamped microbeams suffer the presence of residual strain and stress, which affect the value of pull-in voltage. In case of microcantilever an accurate modelling includes the effect of the initial curvature due to microfabrication. In double clamped microbeams a preloading applied by tensile stress is considered. Geometrical onlinearity caused by mechanical coupling between axial and flexural behaviour is detected and modelled. Experimental results demonstrate a good agreement between FEM approaches proposed and tests. A fairly fast and accurate prediction of pull-in condition is performed, thus numerical models can be used to identify residual stress in microbridges by reverse analysis from the measured value of pull-in voltage.
Validation of compact models of microcantilever actuators for RF-MEMS application
Venue: arXiv cs.OH 2008
Year: 2008

Microcantilever specimens for in-plane and out-ofplane bending tests are here analyzed. Experimental validation of 2D and 3D numerical models is performed. Main features of in-plane and out-of-plane layouts are then discussed. Effectiveness of plane models to predict pull-in in presence of geometric nonlinearity due to a large tip displacement and initial curvature of microbeam is investigated. The paper is aimed to discuss the capability of 2D models to be used as compact tools to substitute some model order reduction techniques, which appear unsuitable in presence of both electromechanical and geometric nonlinearities.
High Q-factor CMOS-MEMS inductor
Venue: arXiv cs.OH 2008
Year: 2008

This study investigates a high Q-factor spiral inductor fabricated by the CMOS (complementary metal oxide semiconductor) process and a post-process. The spiral inductor is manufactured on silicon substrate using the 0.35 micrometers CMOS process. In order to reduce the substrate loss and enhance the Q-factor of the inductor, silicon substrate under the inductor is removed using a post-process. The post-process uses RIE (reactive ion etching) to etch the sacrificial layer of silicon dioxide, and then TMAH (tetra methyl ammonium hydroxide) is employed to remove the underlying silicon substrate and obtain the suspended spiral inductor. The advantage of the post process is compatible with the CMOS process. The Agilent 8510C network analyzer and a Cascade probe station are used to measure the performances of the spiral inductor. Experiments indicate that the spiral inductor has a Q-factor of 15 at 11 GHz, an inductance of 4 nH at 25.5 GHz and a self-resonance frequency of about 27 GHz.
Technologies for 3D Heterogeneous Integration
Venue: arXiv cs.OH 2008
Year: 2008

3D-Integration is a promising technology towards higher interconnect densities and shorter wiring lengths between multiple chip stacks, thus achieving a very high performance level combined with low power consumption. This technology also offers the possibility to build up systems with high complexity just by combining devices of different technologies. For ultra thin silicon is the base of this integration technology, the fundamental processing steps will be described, as well as appropriate handling concepts. Three main concepts for 3D integration have been developed at IZM. The approach with the greatest flexibility called Inter Chip Via - Solid Liquid Interdiffusion (ICV-SLID) is introduced. This is a chip-to-wafer stacking technology which combines the advantages of the Inter Chip Via (ICV) process and the solid-liquid-interdiffusion technique (SLID) of copper and tin. The fully modular ICV-SLID concept allows the formation of multiple device stacks. A test chip was designed and the total process sequence of the ICV-SLID technology for the realization of a three-layer chip-to-wafer stack was demonstrated. The proposed wafer-level 3D integration concept has the potential for low cost fabrication of multi-layer high-performance 3D-SoCs and is well suited as a replacement for embedded technologies based on monolithic integration. To address yield issues a wafer-level chip-scale handling is presented as well, to select known-good dies and work on them with wafer-level process sequences before joining them to integrated stacks.
Micro-tensile tests on micromachined metal on polymer specimens: elasticity, plasticity and rupture
Venue: arXiv cs.OH 2008
Year: 2008

This study is focused on the mechanical characterization of materials used in microelectronic and micro- electromechanical systems (MEMS) devices. In order to determine their mechanical parameters, a new deformation bench test with suitable micromachined specimens have been developed. Uniaxial tensile tests were performed on "low cost" specimens, consisting in electroplated thin copper films and structures, deposited on a polimide type substrate. Moreover, a cyclic mechanical actuation via piezoelectric actuators was tested on the same deformation bench. These experiments validate the device for performing dynamic characterization of materials, and reliability studies of different microstructures.
Decomposition Techniques for Subgraph Matching
Venue: arXiv cs.CC 2008
Year: 2008

In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques in the presence of global constraints. In particular, we solve the subgraph isomorphism problem. Further we design specific heuristics for this hard problem, exploiting its special structure to achieve decomposition. The underlying idea is to precompute a static heuristic on a subset of its constraint network, to follow this static ordering until a first problem decomposition is available, and to switch afterwards to a fully propagated, dynamically decomposing search. Experimental results show that, for sparse graphs, our decomposition method solves more instances than dedicated, state-of-the-art matching algorithms or standard constraint programming approaches.
Adaptive Affinity Propagation Clustering
Venue: arXiv cs.AI 2008
Year: 2008

Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter 'preference' can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clustering solution, adaptive adjustment of damping factors to eliminate oscillations, and adaptive escaping from oscillations when the damping adjustment technique fails. Experimental results on simulated and real data sets show that the adaptive AP is effective and can outperform AP in quality of clustering results.
A New Stream Cipher: Dicing
Venue: arXiv cs.CR 2008
Year: 2008

In this paper, we will propose a new synchronous stream cipher named DICING, which can be viewed as a clock-controlled one but with a new mechanism of altering steps. It has satisfactory performance and there have not been found weakness for the known attacks, the key sizes can be 128bits and 256bits respectively.
On the Secure Degrees of Freedom in the K-User Gaussian Interference Channel
Venue: arXiv cs.IT 2008
Year: 2008

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure DoFs in the case of an external eavesdropper. The fundamental difference between the two scenarios stems from the lack of channel state information (CSI) about the external eavesdropper. Remarkably, the results establish the positive impact of interference on the secrecy capacity of wireless networks.
Searching for Frequent Colors in Rectangles
Venue: arXiv cs.DS 2008
Year: 2008

We study a new variant of colored orthogonal range searching problem: given a query rectangle $Q$ all colors $c$, such that at least a fraction $τ$ of all points in $Q$ are of color $c$, must be reported. We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.
Binary Morphisms to Ultimately Periodic Words
Venue: arXiv cs.DM 2008
Year: 2008

This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
A Simple In-Place Algorithm for In-Shuffle
Venue: arXiv cs.DS 2008
Year: 2008

The paper presents a simple, linear time, in-place algorithm for performing a 2-way in-shuffle which can be used with little modification for certain other k-way shuffles.
Eliminating Trapping Sets in Low-Density Parity Check Codes by using Tanner Graph Covers
Venue: arXiv cs.IT 2008
Year: 2008

We discuss error floor asympotics and present a method for improving the performance of low-density parity check (LDPC) codes in the high SNR (error floor) region. The method is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. The proposed method can be modified to construct convolutional LDPC codes also. The method is illustrated by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm. Decoding results on AWGN channel are also presented to illustrate that optimizing codes for one channel/decoding algorithm can lead to performance improvement on other channels.
Distributed Self Management for Distributed Security Systems
Venue: arXiv cs.MA 2008
Year: 2008

Distributed system as e.g. artificial immune systems, complex adaptive systems, or multi-agent systems are widely used in Computer Science, e.g. for network security, optimisations, or simulations. In these systems, small entities move through the network and perform certain tasks. At some time, the entities move to another place and require therefore information where to move is most profitable. Common used systems do not provide any information or use a centralised approach where a center delegates the entities. This article discusses whether small information about the neighbours enhances the performance of the overall system or not. Therefore, two information-protocols are introduced and analysed. In addition, the protocols are implemented and tested using the artificial immune system SANA that protects a network against intrusions.
Fork Sequential Consistency is Blocking
Venue: arXiv cs.DC 2008
Year: 2008

We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency.
Visual Checking of Spreadsheets
Venue: arXiv cs.HC 2008
Year: 2008

The difference between surface and deep structures of a spreadsheet is a major cause of difficulty in checking spreadsheets. After a brief survey of current methods of checking (or debugging) spreadsheets, new visual methods of showing the deep structures are presented. Illustrations are given on how these visual methods can be employed in various interactive local and global debugging strategies.
Graph Algorithms for Improving Type-Logical Proof Search
Venue: arXiv cs.CL 2008
Year: 2008

Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little attention to the use of graph theoretic algorithms for type-logical proof search. In this paper we will look at several ways in which standard graph theoretic algorithms can be used to restrict the search space. In particular, we will provide an O(n4) algorithm for selecting an optimal axiom link at any stage in the proof search as well as a O(kn3) algorithm for selecting the k best proof candidates.
A multilateral filtering method applied to airplane runway image
Venue: arXiv cs.CV 2008
Year: 2008

By considering the features of the airport runway image filtering, an improved bilateral filtering method was proposed which can remove noise with edge preserving. Firstly the steerable filtering decomposition is used to calculate the sub-band parameters of 4 orients, and the texture feature matrix is then obtained from the sub-band local median energy. The texture similar, the spatial closer and the color similar functions are used to filter the image.The effect of the weighting function parameters is qualitatively analyzed also. In contrast with the standard bilateral filter and the simulation results for the real airport runway image show that the multilateral filtering is more effective than the standard bilateral filtering.
Network QoS Management in Cyber-Physical Systems
Venue: arXiv cs.NI 2008
Year: 2008

Technical advances in ubiquitous sensing, embedded computing, and wireless communication are leading to a new generation of engineered systems called cyber-physical systems (CPS). CPS promises to transform the way we interact with the physical world just as the Internet transformed how we interact with one another. Before this vision becomes a reality, however, a large number of challenges have to be addressed. Network quality of service (QoS) management in this new realm is among those issues that deserve extensive research efforts. It is envisioned that wireless sensor/actuator networks (WSANs) will play an essential role in CPS. This paper examines the main characteristics of WSANs and the requirements of QoS provisioning in the context of cyber-physical computing. Several research topics and challenges are identified. As a sample solution, a feedback scheduling framework is proposed to tackle some of the identified challenges. A simple example is also presented that illustrates the effectiveness of the proposed solution.
Steganography of VoIP Streams
Venue: arXiv cs.MM 2008
Year: 2008

The paper concerns available steganographic techniques that can be used for creating covert channels for VoIP (Voice over Internet Protocol) streams. Apart from characterizing existing steganographic methods we provide new insights by presenting two new techniques. The first one is network steganography solution which exploits free/unused protocols' fields and is known for IP, UDP or TCP protocols but has never been applied to RTP (Real-Time Transport Protocol) and RTCP (Real-Time Control Protocol) which are characteristic for VoIP. The second method, called LACK (Lost Audio Packets Steganography), provides hybrid storage-timing covert channel by utilizing delayed audio packets. The results of the experiment, that was performed to estimate a total amount of data that can be covertly transferred during typical VoIP conversation phase, regardless of steganalysis, are also included in this paper.
Neural Feedback Scheduling of Real-Time Control Tasks
Venue: arXiv cs.OH 2008
Year: 2008

Many embedded real-time control systems suffer from resource constraints and dynamic workload variations. Although optimal feedback scheduling schemes are in principle capable of maximizing the overall control performance of multitasking control systems, most of them induce excessively large computational overheads associated with the mathematical optimization routines involved and hence are not directly applicable to practical systems. To optimize the overall control performance while minimizing the overhead of feedback scheduling, this paper proposes an efficient feedback scheduling scheme based on feedforward neural networks. Using the optimal solutions obtained offline by mathematical optimization methods, a back-propagation (BP) neural network is designed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. Numerical simulation results show that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling.
Integrating Job Parallelism in Real-Time Scheduling Theory
Venue: arXiv cs.OS 2008
Year: 2008

We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions.