OpenRaiser/Intern-Atlas huggingface dataset:
Large Area Roller Embossing of Multilayered Ceramic Green Composites
Venue: arXiv cs.OH 2008
Year: 2008

In this paper, we will report our achievements in developing large area patterning of multilayered ceramic green composites using roller embossing. The aim of our research is to pattern large area ceramic green composites using a modified roller laminating apparatus, which is compatible with screen printing machines, for integration of embossing and screen printing. The instrumentation of our roller embossing apparatus, as shown in Figure1, consists of roller 1 and rollers 2. Roller 1 is heated up to the desired embossing temperature ; roller 2 is, however, kept at room temperature. The mould is a nickel template manufactured by plating nickel-based micro patterns (height : 50 $μ$m) on a nickel film (thickness : 70 $μ$m) ; the substrate for the roller embossing is a multilayered Heraeus Heralock HL 2000 ceramic green composite. Comparing with the conventional simultaneous embossing, the advantages of roller embossing include : (1) low embossing force ; (2) easiness of demoulding ; (3) localized area in contact with heater ; and etc. We have demonstrated the capability of large area roller embossing with a panel size of 150mmx 150mm on the mentioned substrate. We have explored and confirmed the impact of parameters (feed speed, temperature of roller and applied pressure) to the pattern quality of roller embossing. Furthermore, under the optimized process parameters, we characterized the variations of pattern dimension over the panel area, and calculated a scaling factor in order to make the panel compatible with other processes. Figure 2 shows the embossed patterns on a 150mmx 150mm green ceramic panel.
Fabrication of Nanostructured PLGA Scaffolds Using Anodic Aluminum Oxide Templates
Venue: arXiv cs.OH 2008
Year: 2008

PLGA (poly(lactic-co-glycolic acid)) is one of the most used biodegradable and biocompatible materials. Nanostructured PLGA even has great application potentials in tissue engineering. In this research, a fabrication technique for nanostructured PLGA membrane was investigated and developed. In this novel fabrication approach, an anodic aluminum oxide (AAO) film was use as the template ; the PLGA solution was then cast on it ; the vacuum air-extraction process was applied to transfer the nano porous pattern from the AAO membrane to the PLGA membrane and form nanostures on it. The cell culture experiments of the bovine endothelial cells demonstrated that the nanostructured PLGA membrane can double the cell growing rate. Compared to the conventional chemical-etching process, the physical fabrication method proposed in this research not only is simpler but also does not alter the characteristics of the PLGA. The nanostructure of the PLGA membrane can be well controlled by the AAO temperate.
High Performance Microreactor for Rapid Fluid Mixing and Redox Reaction of Ascorbic Acid
Venue: arXiv cs.OH 2008
Year: 2008

A novel micro device with a mechanism of split and recombination (SNR) for rapid fluidic mixing and reaction, named a SNR micro-reactor, was designed, fabricated and systematically analyzed. This SNR micro-reactor possessing an in-plane dividing structure requires only simple fabrication. We investigated this reactor and compared it numerically and experimentally with a slanted-groove micromixer (SGM). From the numerical results the mixing indices and mixing patterns demonstrated that the mixing ability of the SNR micro-reactor was much superior to that of the SGM. From a mixing test with phenolphthalein and sodium hydroxide solutions, the mixing lengths of the SNR micro-reactor were less than 4 mm for a Reynolds number over a wide range (Re = 0.1 - 10). From a comparison of mixing lengths, the results revealed also that the SNR micro-reactor surpassed the SGM in mixing performance by more than 200 %. As a reaction length is a suitable test of the performance of a reactor, we introduced a redox reaction between ascorbic acid and iodine solutions to assess the reaction capability of these micro devices ; the reaction lengths of the SNR micro-reactor were much shorter than those of a SGM. The SNR micro-reactor has consequently a remarkable efficiency for fluid mixing and reaction.
In-Plane Bistable Nanowire For Memory Devices
Venue: arXiv cs.OH 2008
Year: 2008

We present a nanomechanical device design to be used in a non-volatile mechanical memory point. The structure is composed of a suspended slender nanowire (width : 100nm, thickness 430nm length : 8 to 30$μ$m) clamped at its both ends. Electrodes are placed on each sides of the nanowire and are used to actuate the structure (writing, erasing) and to measure the position through a capactive bridge (reading). The structure is patterned by electron beam lithography on a pre-stressed thermally grown silicon dioxide layer. When later released, the stressed material relaxes and the beam buckles in a position of lower energy. Such symmetric beams, called Euler beams, show two stable deformed positions thus form a bistable structure. This paper will present the fabrication, simulation and mechanical and electrical actuation of an in plane bistable nanowire. Final paper will include a section on FEM simulations.
Micro-electroforming metallic bipolar electrodes for mini-DMFC stacks
Venue: arXiv cs.OH 2008
Year: 2008

This paper describes the development of metallic bipolar plate fabrication using micro-electroforming process for mini-DMFC (direct methanol fuel cell) stacks. Ultraviolet (UV) lithography was used to define micro-fluidic channels using a photomask and exposure process. Micro-fluidic channels mold with 300 micrometers thick and 500 micrometers wide were firstly fabricated in a negative photoresist onto a stainless steel plate. Copper micro-electroforming was used to replicate the micro-fluidic channels mold. Following by sputtering silver (Ag) with 1.2 micrometers thick, the metallic bipolar plates were completed. The silver layer is used for corrosive resistance. The completed mini-DMFC stack is a 2x2 cm2 fuel cell stack including a 1.5x1.5 cm2 MEA (membrane electrode assembly). Several MEAs were assembly into mini-DMFC stacks using the completed metallic bipolar plates. All test results showed the metallic bipolar plates suitable for mini-DMFC stacks. The maximum output power density is 9.3mW/cm2 and current density is 100 mA/cm2 when using 8 vol. % methanol as fuel and operated at temperature 30 degrees C. The output power result is similar to other reports by using conventional graphite bipolar plates. However, conventional graphite bipolar plates have certain difficulty to be machined to such micro-fluidic channels. The proposed micro-electroforming metallic bipolar plates are feasible to miniaturize DMFC stacks for further portable 3C applications.
A Microcantilever-based Gas Flow Sensor for Flow Rate and Direction Detection
Venue: arXiv cs.OH 2008
Year: 2008

The purpose of this paper is to apply characteristics of residual stress that causes cantilever beams to bend for manufacturing a micro-structured gas flow sensor. This study uses a silicon wafer deposited silicon nitride layers, reassembled the gas flow sensor with four cantilever beams that perpendicular to each other and manufactured piezoresistive structure on each micro-cantilever by MEMS technologies, respectively. When the cantilever beams are formed after etching the silicon wafer, it bends up a little due to the released residual stress induced in the previous fabrication process. As air flows through the sensor upstream and downstream beam deformation was made, thus the airflow direction can be determined through comparing the resistance variation between different cantilever beams. The flow rate can also be measured by calculating the total resistance variations on the four cantilevers.
Through Silicon Vias as Enablers for 3D Systems
Venue: arXiv cs.OH 2008
Year: 2008

This special session on 3D TSV's will highlight some of the fabrication processes and used technologies to create vias from the frontside of an active circuit to its backside and potential implementation solutions to form complex systems leveraging these novel possibilities. General techniques for via formation are discussed as well as advanced integration solutions leveraging the power of 3D TSV's.
Rejection of Power Supply Noise in Wheatstone Bridges : Application to Piezoresistive MEMS
Venue: arXiv cs.OH 2008
Year: 2008

This paper deals with the design of MEMS using piezoresistivity as transduction principle. It is demonstrated that when the sensor topology doesn't allow a perfect matching of strain gauges, the resolution is limited by the ability of the conditioning circuit (typically a Wheatstone bridge) to reject power supply noise. As this ability is strongly reduced when an offset voltage is present at the output of the bridge, the proposed architecture implements a feedback loop to control MOS transistors inserted in the Wheatstone bridge to compensate resistor mismatches. This feedback exhibits a very good offset cancellation and therefore a better resolution is achieved.
Optimization of efficiency and energy density of passive micro fuel cells and galvanic hydrogen generators
Venue: arXiv cs.OH 2008
Year: 2008

A PEM micro fuel cell system is described which is based on self-breathing PEM micro fuel cells in the power range between 1 mW and 1W. Hydrogen is supplied with on-demand hydrogen production with help of a galvanic cell, that produces hydrogen when Zn reacts with water. The system can be used as a battery replacement for low power applications and has the potential to improve the run time of autonomous systems. The efficiency has been investigated as function of fuel cell construction and tested for several load profiles.
Approximation Algorithms for Shortest Descending Paths in Terrains
Venue: arXiv cs.CG 2008
Year: 2008

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give two approximation algorithms (more precisely, FPTASs) that solve the SDP problem on general terrains. Both algorithms are simple, robust and easy to implement.
Detecting Errors in Spreadsheets
Venue: arXiv cs.SE 2008
Year: 2008

The paper presents two complementary strategies for identifying errors in spreadsheet programs. The strategies presented are grounded on the assumption that spreadsheets are software, albeit of a different nature than conventional procedural software. Correspondingly, strategies for identifying errors have to take into account the inherent properties of spreadsheets as much as they have to recognize that the conceptual models of 'spreadsheet programmers' differ from the conceptual models of conventional programmers. Nevertheless, nobody can and will write a spreadsheet, without having such a conceptual model in mind, be it of numeric nature or be it of geometrical nature focused on some layout.
Pedestrian Flow at Bottlenecks - Validation and Calibration of Vissim's Social Force Model of Pedestrian Traffic and its Empirical Foundations
Venue: arXiv cs.MA 2008
Year: 2008

In this contribution first results of experiments on pedestrian flow through bottlenecks are presented and then compared to simulation results obtained with the Social Force Model in the Vissim simulation framework. Concerning the experiments it is argued that the basic dependence between flow and bottleneck width is not a step function but that it is linear and modified by the effect of a psychological phenomenon. The simulation results as well show a linear dependence and the parameters can be calibrated such that the absolute values for flow and time fit to range of experimental results.
Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American Options using Monte Carlo methods
Venue: arXiv cs.DC 2008
Year: 2008

In this paper we present two parallel Monte Carlo based algorithms for pricing multi--dimensional Bermudan/American options. First approach relies on computation of the optimal exercise boundary while the second relies on classification of continuation and exercise values. We also evaluate the performance of both the algorithms in a desktop grid environment. We show the effectiveness of the proposed approaches in a heterogeneous computing environment, and identify scalability constraints due to the algorithmic structure.
Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element
Venue: arXiv cs.DM 2008
Year: 2008

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that the randomly chosen elements have a fixed probability of being non-zero. In this paper, we derive approximate formulas for that probability by assuming that the terms in the permanent of a matrix are independent of one another, and we apply that assumption to several classes of matrices. In the course of deriving those formulas, we identified several integer sequences that are not listed on Sloane's Web site.
Communication Lower Bounds Using Dual Polynomials
Venue: arXiv cs.CC 2008
Year: 2008

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean function f(x_1,...,x_n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polynomials that certify the difficulty of approximating or sign-representing a given function. We provide a unified guide to the following results, complete with all the key proofs: (1) Sherstov's Degree/Discrepancy Theorem, which translates lower bounds on the threshold degree of a Boolean function into upper bounds on the discrepancy of a related function; (2) Two different methods for proving lower bounds on bounded-error communication based on the approximate degree: Sherstov's pattern matrix method and Shi and Zhu's block composition method; (3) Extension of the pattern matrix method to the multiparty model, obtained by Lee and Shraibman and by Chattopadhyay and Ada, and the resulting improved lower bounds for DISJOINTNESS; (4) David and Pitassi's separation of NP and BPP in multiparty communication complexity for k=(1-eps)log n players.
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
Venue: arXiv cs.DM 2008
Year: 2008

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear ``local constraint'' codes to be associated with the edges and vertices, respectively, of the graph. The $\k$-complexity of a graphical realization is defined to be the largest dimension of any of its local constraint codes. $\k$-complexity is a reasonable measure of the computational complexity of a sum-product decoding algorithm specified by a graphical realization. The main focus of this paper is on the following problem: given a linear code C and a graph G, how small can the $\k$-complexity of a realization of C on G be? As useful tools for attacking this problem, we introduce the Vertex-Cut Bound, and the notion of ``vc-treewidth'' for a graph, which is closely related to the well-known graph-theoretic notion of treewidth. Using these tools, we derive tight lower bounds on the $\k$-complexity of any realization of C on G. Our bounds enable us to conclude that good error-correcting codes can have low-complexity realizations only on graphs with large vc-treewidth. Along the way, we also prove the interesting result that the ratio of the $\k$-complexity of the best conventional trellis realization of a length-n code C to the $\k$-complexity of the best cycle-free realization of C grows at most logarithmically with codelength n. Such a logarithmic growth rate is, in fact, achievable.
Toward Fuzzy block theory
Venue: arXiv cs.AI 2008
Year: 2008

This study, fundamentals of fuzzy block theory, and its application in assessment of stability in underground openings, has surveyed. Using fuzzy topics and inserting them in to key block theory, in two ways, fundamentals of fuzzy block theory has been presented. In indirect combining, by coupling of adaptive Neuro Fuzzy Inference System (NFIS) and classic block theory, we could extract possible damage parts around a tunnel. In direct solution, some principles of block theory, by means of different fuzzy facets theory, were rewritten.
Certified Exact Transcendental Real Number Computation in Coq
Venue: arXiv cs.LO 2008
Year: 2008

Reasoning about real number expressions in a proof assistant is challenging. Several problems in theorem proving can be solved by using exact real number computation. I have implemented a library for reasoning and computing with complete metric spaces in the Coq proof assistant and used this library to build a constructive real number implementation including elementary real number functions and proofs of correctness. Using this library, I have created a tactic that automatically proves strict inequalities over closed elementary real number expressions by computation.
A toolkit for a generative lexicon
Venue: arXiv cs.CL 2008
Year: 2008

In this paper we describe the conception of a software toolkit designed for the construction, maintenance and collaborative use of a Generative Lexicon. In order to ease its portability and spreading use, this tool was built with free and open source products. We eventually tested the toolkit and showed it filters the adequate form of anaphoric reference to the modifier in endocentric compounds.
Stochastic Limit-Average Games are in EXPTIME
Venue: arXiv cs.GT 2008
Year: 2008

The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $ε$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in $\frac{1}ε$, for all $ε>0$.
Increasing Linear Dynamic Range of Commercial Digital Photocamera Used in Imaging Systems with Optical Coding
Venue: arXiv cs.CV 2008
Year: 2008

Methods of increasing linear optical dynamic range of commercial photocamera for optical-digital imaging systems are described. Use of such methods allows to use commercial photocameras for optical measurements. Experimental results are reported.
Equivalent characterizations of partial randomness for a recursively enumerable real
Venue: arXiv cs.IT 2008
Year: 2008

A real number αis called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to α. The randomness of a recursively enumerable real αcan be characterized in various ways using each of the notions; program-size complexity, Martin-Löf test, Chaitin's Ωnumber, the domination and Ω-likeness of α, the universality of a computable, increasing sequence of rational numbers which converges to α, and universal probability. In this paper, we generalize these characterizations of randomness over the notion of partial randomness by parameterizing each of the notions above by a real number T\in(0,1]. We thus present several equivalent characterizations of partial randomness for a recursively enumerable real number.
The Margitron: A Generalised Perceptron with Margin
Venue: arXiv cs.LG 2008
Year: 2008

We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (despite its) sharing the same update rule with the Perceptron, is shown in an incremental setting to converge in a finite number of updates to solutions possessing any desirable fraction of the maximum margin. Experiments comparing the Margitron with decomposition SVMs on tasks involving linear kernels and 2-norm soft margin are also reported.
LCSH, SKOS and Linked Data
Venue: arXiv cs.DL 2008
Year: 2008

A technique for converting Library of Congress Subject Headings MARCXML to Simple Knowledge Organization System (SKOS) RDF is described. Strengths of the SKOS vocabulary are highlighted, as well as possible points for extension, and the integration of other semantic web vocabularies such as Dublin Core. An application for making the vocabulary available as linked-data on the Web is also described.
Lossless Compression with Security Constraints
Venue: arXiv cs.IT 2008
Year: 2008

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from the encoders to the legitimate receiver, one of which can also be perfectly observed by the eavesdropper, are considered. The eavesdropper also has its own correlated observation. Inner and outer bounds on the achievable compression-equivocation rate region are given. Several different scenarios involving the side information at the transmitters as well as multiple receivers/eavesdroppers are also considered.
On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals
Venue: arXiv cs.IT 2008
Year: 2008

Csiszar and Narayan[3] defined the notion of secret key capacity for multiple terminals, characterized it as a linear program with Slepian-Wolf constraints of the related source coding problem of communication for omniscience, and upper bounded it by some information divergence expression from the joint to the product distribution of the private observations. This paper proves that the bound is tight for the important case when all users are active, using the polymatroidal structure[6] underlying the source coding problem. When some users are not active, the bound may not be tight. This paper gives a counter-example in which 3 out of the 6 terminals are active.
Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability
Venue: arXiv cs.IT 2008
Year: 2008

Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the alternative of using guessing exponent to analyze the Shannon's cipher system. Because guessing exponent captures the atypical behavior, the strongest expressible notion of secrecy requires the more stringent condition that the size of the key, instead of its entropy rate, to be equal to the size of the message. The relationship between equivocation and guessing exponent are also investigated in [6][7] but it is unclear which is a better measure, and whether there is a unifying measure of security. Instead of using equivocation rate or guessing exponent, we study the wiretap channel in [2] using the success exponent, defined as the exponent of a wiretapper successfully learn the secret after making an exponential number of guesses to a sequential verifier that gives yes/no answer to each guess. By extending the coding scheme in [2][5] and the converse proof in [4] with the new Overlap Lemma 5.2, we obtain a tradeoff between secrecy and reliability expressed in terms of lower bounds on the error and success exponents of authorized and respectively unauthorized decoding of the transmitted messages. From this, we obtain an inner bound to the region of strongly achievable public, private and guessing rate triples for which the exponents are strictly positive. The closure of this region is equivalent to the closure of the region in Theorem 1 of [2] when we treat equivocation rate as the guessing rate. However, it is unclear if the inner bound is tight.