Recent Developments in Mems-Based Micro Fuel Cells

Abstract: Micro fuel cells ($\mu$-FC) represent promising power sources for portable applications. Today, one of the technological ways to make $\mu$-FC is to have recourse to standard microfabrication techniques used in the fabrication of micro electromechanical systems (MEMS). This paper shows an overview on the applications of MEMS techniques on miniature FC by presenting several solutions developed throughout the world. It also describes the latest developments of a new porous silicon-based miniature fuel cell. Using a silane grafted on an inorganic porous media as the proton-exchange membrane instead of a common ionomer such as Nafion, the fuel cell achieved a maximum power density of 58 mW cm-2 at room temperature with hydrogen as fuel.


Influence of Micro-Cantilever Geometry and Gap on Pull-in Voltage

Abstract: In this paper, we study the behaviour of a microcantilever beam under electrostatic actuation using finite difference method. This problem has a lot of applications in MEMS based devices like accelerometers, switches and others. In this paper, we formulated the problem of a cantilever beam with proof mass at its end and carried out the finite difference solution. we studied the effects of length, width, and the gap size on the pull-in voltage using data that are available in the literature. Also, the stability limit is compared with the single degree of freedom commonly used in the earlier literature as an approximation to calculate the pull-in voltage.


Design and Development of Novel Electroplating Spring Frame Mems Structure Specimens for the Microtensile Testing of Thin Film Materials

Abstract: Microelectromechanical systems (MEMS) technologies are developing rapidly with increasing study of the design, fabrication and commercialization of microscale systems and devices. Accurate mechanical properties are important for successful design and development of MEMS. We have demonstrated here a novel electroplating spring frame MEMS Structure Specimen integrates pin-pin align holes, misalignment compensate spring structure frame, load sensor beam and freestanding thin film. The specimen can be fit into a specially designed microtensile apparatus which is capable of carrying out a series of tests on sub-micro scale freestanding thin films.


Characterisation of the Etching Quality in Micro-Electro-Mechanical Systems by Thermal Transient Methodology

Abstract: Our paper presents a non-destructive thermal transient measurement method that is able to reveal differences even in the micron size range of MEMS structures. Devices of the same design can have differences in their sacrificial layers as consequence of the differences in their manufacturing processes e.g. different etching times. We have made simulations examining how the etching quality reflects in the thermal behaviour of devices. These simulations predicted change in the thermal behaviour of MEMS structures having differences in their sacrificial layers. The theory was tested with measurements of similar MEMS devices prepared with different etching times. In the measurements we used the T3Ster thermal transient tester equipment. The results show that deviations in the devices, as consequence of the different etching times, result in different temperature elevations and manifest also as shift in time in the relevant temperature transient curves.


The Effects of Additives on the Physical Properties of Electroformed Nickel and on the Stretch of Photoelectroformed Nickel Components

Abstract: The process of nickel electroforming is becoming increasingly important in the manufacture of MST products, as it has the potential to replicate complex geometries with extremely high fidelity. Electroforming of nickel uses multi-component electrolyte formulations in order to maximise desirable product properties. In addition to nickel sulphamate (the major electrolyte component), formulation additives can also comprise nickel chloride (to increase nickel anode dissolution), sulphamic acid (to control pH), boric acid (to act as a pH buffer), hardening/levelling agents (to increase deposit hardness and lustre) and wetting agents (to aid surface wetting and thus prevent gas bubbles and void formation). This paper investigates the effects of some of these variables on internal stress and stretch as a function of applied current density.


A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD Packaging

Abstract: In this research, a novel contact resistance model for the flat panel display (FPD) packaging based on the within layer parallel and between layers series resistance concepts was proposed. The FJ2530 anisotropic conductive films (ACF) by Sony Inc. containing the currently smallest 3micron conductive particles was used to conduct the experiments to verify the accuracy of the proposed model. Calculated resistance of the chip-on-glass (COG) packaging by the proposed model is 0.163\Omega. It is found that the gold bump with 0.162\Omega resistance play the major role of the overall resistance. Although the predicted resistance by the proposed model is only one third of the experimentally measured value, it has been three-fold improvement compared to the existing models.


Measurement Technique for Elastic and Mechanical Properties of Polycrystalline Silicon-Germanium Films Using Surface Acoustic Waves and Projection Masks

Abstract: Using Rayleigh surface acoustic waves (SAW), the Young's modulus, the density and the thickness of polycrystalline Silicon-Germanium (SiGe) films deposited on silicon and SiO2 were measured, in excellent agreement with theory. The dispersion curve of the propagating SAW is calculated with a Boundary Element Method (BEM)-Model based on Green's functions. The propagating SAW is generated with a nanosecond laser in a narrowband scheme projecting stripes from a mask on the surface of the sample. For this purpose a glass mask and a liquid crystal display (LCD) mask are used. The slope of the SAW is then measured using a probe beam setup. From the wavelength of the mask and the frequency of the measured SAW, the dispersion curve is determined point by point. Fitting the BEM-Model to the measured nonlinear dispersion curve provides several physical parameters simultaneously. In the present work this is demonstrated for the Young's modulus, the density and the thickness of SiGe films. The results from the narrowband scheme measurement are in excellent agreement with separated measurements of the thickness (profilometer), the density (balance) and the Young's modulus (nanoindenter).


Effect of Surface Finish of Substrate on Mechanical Reliability of in-48SN Solder Joints in Moems Package

Abstract: Interfacial reactions and shear properties of the In-48Sn (in wt.%) ball grid array (BGA) solder joints after bonding were investigated with four different surface finishes of the substrate over an underlying Cu pad: electroplated Ni/Au (hereafter E-NG), electroless Ni/immersion Au (hereafter ENIG), immersion Ag (hereafter I-Ag) and organic solderability preservative (hereafter OSP). During bonding, continuous AuIn2, Ni3(Sn,In)4 and Cu6(Sn,In)5 intermetallic compound (IMC) layers were formed at the solder/E-NG, solder/ENIG and solder/OSP interface, respectively. The interfacial reactions between the solder and I-Ag substrate during bonding resulted in the formation of Cu6(Sn,In)5 and Cu(Sn,In)2 IMCs with a minor Ag element. The In-48Sn/I-Ag solder joint showed the best shear properties among the four solder joints after bonding, whereas the solder/ENIG solder joint exhibited the weakest mechanical integrity.


Non Linear Techniques for Increasing Harvesting Energy from Piezoelectric and Electromagnetic Micro-Power-Generators

Abstract: Non-linear techniques are used to optimize the harvested energy from piezoelectric and electromagnetic generators. This paper introduces an analytical study for the voltage amplification obtained from these techniques. The analytical study is experimentally validated using a macro model of piezoelectric generator. Moreover, the integration influences on these techniques is studied. Through all the obtained results, a suitable structure for autonomous microsystems is proposed.


Optimization of Piezoelectric Electrical Generators Powered by Random Vibrations

Abstract: This paper compares the performances of a vibrationpowered electrical generators using PZT piezoelectric ceramic associated to two different power conditioning circuits. A new approach of the piezoelectric power conversion based on a nonlinear voltage processing is presented and implemented with a particular power conditioning circuit topology. Theoretical predictions and experimental results show that the nonlinear processing technique may increase the power harvested by a factor up to 4 compared to the Standard optimization technique. Properties of this new technique are analyzed in particular in the case of broadband, random vibrations, and compared to those of the Standard interface.


Power Processing Circuits for Mems Inertial Energy Scavengers

Abstract: Inertial energy scavengers are self-contained devices which generate power from ambient motion, by electrically damping the internal motion of a suspended proof mass. There are significant challenges in converting the power generated from such devices to useable form, particularly in micro-engineered variants. This paper presents approaches to this power conversion requirement, with emphasis on the cases of electromagnetic and electrostatic transduction.


Motion-Based Generators for Industrial Applications

Abstract: Scaling down of electronic systems has generated a large interest in the research on miniature energy sources. In this paper a closer look is given to the use of vibration based scavengers in industrial environments, where waste energy is abundantly available as engine related vibrations or large amplitude motions. The modeling of mechanical generators resulted in the design and realization of two prototypes, based on electromagnetic and electrostatic conversion of energy. Although the prototypes are not yet optimized against size and efficiency, a power of 0.3 mW has been generated in a 5 Hz motion with a 0.5 meter amplitude.


Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity Energy Converter

Abstract: This paper presents a micro electrostatic vibration-toelectricity energy converter. For the 3.3 V supply voltage and 1cm2 chip area constraints, optimal design parameters were found from theoretical calculation and Simulink simulation. In the current design, the output power is 200 $\mu$W/cm2 for the optimal load of 8 M\Omega. The device was fabricated in a silicon-on-insulator (SOI) wafer. Mechanical and electrical measurements were conducted. Residual particles caused shortage of the variable capacitor and the output power could not be measured. Device design and fabrication processes are being refined.


Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting Generators

Abstract: This paper is concerned with generators that harvest electrical energy from the kinetic energy present in the sensor nodes environment. These generators have the potential to replace or augment battery power which has a limited lifetime and requires periodic replacement which limits the placement and application of the sensor node.


Impact of Thermal Behavior on Offset in a High-Q Gyroscope

Abstract: In this paper, CFD approach is used to simulate the thermal behavior in a sensitive high-Q gyroscope. The electromagnetically driving wires, in which AC current flows, are treated as Joule heat sources in the model. We found that the differences of temperature, pressure and velocity along the driving direction and transversely across the proof masses increased as the gap height between the proof mass and top glass became smaller. Local pressure gradient is expected to possibly enhance the impact of any imperfect led by MEMS processes or designs on the offset of our tuning fork type gyroscope, which has been experimentally verified. A device with 200um gap gives a two-third offset down compared with that of its counterpart with 50um gap.


Scaling Effects for Electromagnetic Vibrational Power Generators

Abstract: This paper investigates how the power generated by electromagnetic based vibrational power generators scales with the dimension of the generator. The effects of scaling on the magnetic fields, the coil parameters and the electromagnetic damping are presented. An analysis is presented for both wire-wound coil technology and micro-fabricated coils.


A Generic Surface Micromachining Module for Mems Hermetic Packaging at Temperatures Below 200 degrees C

Abstract: This paper presents the different processing steps of a new generic surface micromachining module for MEMS hermetic packaging at temperatures around 180 degrees C based on nickel plating and photoresist sacrificial layers. The advantages of thin film caps are the reduced thickness and area consumption and the promise of being a low-cost batch process. Moreover, sealing happens by a reflow technique, giving the freedom of choosing the pressure and atmosphere inside the cavity. Sacrificial etch holes are situated above the device allowing shorter release times compared to the state-of-the-art. With the so-called over-plating process, small etch holes can be created in the membrane without the need of expensive lithography tools. The etch holes in the membrane have been shown to be sufficiently small to block the sealing material to pass through, but still large enough to enable an efficient release.


A Ku-Band Novel Micromachined Bandpass Filter with Two Transmission Zeros

Abstract: This paper presents a micromachined bandpass filter with miniature size that has relatively outstanding performance. A silicon-based eight-order microstrip bandpass filter is fabricated and measured. A novel design method of the interdigital filter that can create two transmission zeros is described. The location of the transmission zeros can be shifted arbitrarily in the stopband. By adjusting the zero location properly, the filter provides much better skirt rejection and lower insertion loss than a conventional microstrip interdigital filter. To reduce the chip size, through-silicon-substrate-via-hole is used. Good experimental results are obtained.


The Design and Fabrication of Platform Device for Dna Amplification

Abstract: Thermalcycler were extensively used machine for amplify DNA sample. One of the major problems in the working time was that it spent most of time for cooling and heating. In order to improve the efficient, this study presented a novel method for amplify DNA sample. For this concept, the DNA sample in the silicon chamber which was pushed by a beam through three temperature regions around a center and then the DNA segments could be amplified rapidly after 30 cycles. The polymerase chain reaction platform was composed of thin-film heaters, copper plates, DC powers, and temperature controllers. The photolithography and bulk etching technologies were utilized to construct the thin-film heater and DNA reaction chambers. Finally, 1 pound gL 100bp DNA segment of E. coli K12 was amplified successfully within 36 minutes on this PCR platform.


Design and Modeling of a Mems-Based Valveless Pump Driven by an Electromagnetic Force

Abstract: A novel valveless micro impedance pump is proposed and analyzed in this study.


Electrostatic Actuators Operating in Liquid Environment : Suppression of Pull-in Instability and Dynamic Response

Abstract: This paper presents results about fabrication and operation of electrostatic actuators in liquids with various permittivities. In the static mode, we provide experimental and theoretical demonstration that the pull-in effect can be shifted beyond one third of the initial gap and even be eliminated when electrostatic actuators are operated in liquids. This should benefit to applications in microfluidics requiring either binary state actuation (e.g. pumps, valves) or continuous displacements over the whole gap (e.g. microtweezers). In dynamic mode, actuators like micro-cantilevers present a great interest for Atomic Force Microscopy (AFM) in liquids. As this application requires a good understanding of the cantilever resonance frequency and Q-factor, an analytical modeling in liquid environment has been established. The theoretically derived curves are validated by experimental results using a nitride encapsulated cantilever with integrated electrostatic actuation. Electrode potential screening and undesirable electrochemistry in dielectric liquids are counteracted using AC-voltages. Both experimental and theoretical results should prove useful in micro-cantilever design for AFM in liquids.


Au-SN Flip-Chip Solder Bump for Microelectronic and Optoelectronic Applications

Abstract: As an alternative to the time-consuming solder pre-forms and pastes currently used, a co-electroplating method of eutectic Au-Sn alloy was used in this study. Using a co-electroplating process, it was possible to plate the Au-Sn solder directly onto a wafer at or near the eutectic composition from a single solution. Two distinct phases, Au5Sn and AuSn, were deposited at a composition of 30at.%Sn. The Au-Sn flip-chip joints were formed at 300 and 400 degrees without using any flux. In the case where the samples were reflowed at 300 degrees, only an (Au,Ni)3Sn2 IMC layer formed at the interface between the Au-Sn solder and Ni UBM. On the other hand, two IMC layers, (Au,Ni)3Sn2 and (Au,Ni)3Sn, were found at the interfaces of the samples reflowed at 400 degrees. As the reflow time increased, the thickness of the (Au,Ni)3Sn2 and (Au,Ni)3Sn IMC layers formed at the interface increased and the eutectic lamellae in the bulk solder coarsened.


Contactless Thermal Characterization Method of PCB-s Using an IR Sensor Array

Abstract: In this paper the feasibility study of an IR sensor card is presented. The methodology and the results of a quasi real-time thermal characterization tool and method for the temperature mapping of circuits and boards based on sensing the infrared radiation is introduced. With the proposed method the IR radiation-distribution of boards from the close proximity of the sensor card is monitored in quasi real-time. The proposed method is enabling in situ IR measurement among operating cards of a system e.g. in a rack.


Miniaturized Fluorescence Excitation Platform with Optical Fiber for Bio-Detection Chips

Abstract: This paper presents a new research study on the platform fabrication of fluorescence bio-detection chip with an optical fiber transmission. Anisotropic wet etching on (100) silicon wafers to fabrication V-groove for optical fiber alignment and micro-mirror were included. Combing with anodic bonding technique to adhere glass, silicon structure and optical fiber for a fluorescence excitation platform was completed. In this study, the etching solution 40% KOH was used to study the parameters effect. The results show that working temperature is the main parameter to significantly effect the etch rate. The anisotropic etching resulted 54.7 degrees reflective mirrors and its reflectivity for optical beam were also examined. The surface roughness of the micro-mirror is Ra 4.1 nm measured using AFM, it provides excellent optical reflection. The incident light and beam profiles were also examined for further study. This study can show this micro-platform adaptable for fluorescence bio-detection.


Characterization of Flexible RF Microcoil Dedicated to Surface Mri

Abstract: In Magnetic Resonance Imaging (MRI), to achieve sufficient Signal to Noise Ratio (SNR), the electrical performance of the RF coil is critical. We developed a device (microcoil) based on the original concept of monolithic resonator. This paper presents the used fabrication process based on micromoulding. The dielectric substrates are flexible thin films of polymer, which allow the microcoil to be form fitted to none-plane surface. Electrical characterizations of the RF coils are first performed and results are compared to the attempted values. Proton MRI of a saline phantom using a flexible RF coil of 15 mm in diameter is performed. When the coil is conformed to the phantom surface, a SNR gain up to 2 is achieved as compared to identical but planar RF coil. Finally, the flexible coil is used in vivo to perform MRI with high spatial resolution on a mouse using a small animal dedicated scanner operating at in a 2.35 T.


Integration of Micro-Electro-Mechanical Deformable Mirrors in Doped Fiber Amplifiers

Abstract: We present a simple technique to produce active Q-switching in various types of fiber amplifiers by active integration of an electrostatic actuated deformable metallic micro-mirror. The optical MEMS (MOEMS) device acts as one of the laser cavity reflectors and, at the same time, as switching/ modulator element. We aim to obtain laser systems emitting short, high-power pulses and having variable repetition rate. The electro-mechanical behavior of membrane (bridge-type) was simulated by using electrostatic and modal 3D finite element analysis (FEA). The results of the simulations fit well with the experimental mechanical, electrical and thermal measurements of the components. In order to decrease the sensitiveness to fiber-mirror alignment we are developing novel optical devices based on stressed-metal cantilever-type geometry that allow deflections up to 50 $\mu$m with increased reflectivity discrimination during actuation.


Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic Effect

Abstract: This paper presents a simple method to fabricate micro-ball lens and its array. The key technology is to use the hydrophobic characteristics of polyterafluoroethylene (PTFE) substrate. High contact angle between melted photoresist pattern and PTFE can generate micro-ball lens and its array. PTFE thin film was spun onto a silicon wafer and dried in oven. Photoresist AZ4620 was used to pattern micro-columns with different diameters 60, 70 and 80 $\mu$m. A thermal reflow process then was applied to melt these micro-column patterns resulted in micro-ball lens array. The achieved micro-ball lens array with diameter 98 $\mu$m was fabricated using 80 $\mu$m in diameter patterns. This method provides a simple fabrication process and low material cost.


Reduced-Order Modelling of the Bending of an Array of Torsional Micromirrors

Abstract: Reduced-Order Modelling of the Bending of an Array of An array of micromirrors for beam steering optical switching has been designed in a thick polysilicon technology. A novel semi-analytical method to calculate the static characteristics of the micromirrors by taking into account the flexural deformation of the structure is presented. The results are compared with 3D coupled-field FEM simulation.


Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled Electro-Mechanical Finite Element

Abstract: The aim of this paper is to deal with multi-physics simulation of micro-electro-mechanical systems (MEMS) based on an advanced numerical methodology. MEMS are very small devices in which electric as well as mechanical and fluid phenomena appear and interact. Because of their microscopic scale, strong coupling effects arise between the different physical fields, and some forces, which were negligible at macroscopic scale, have to be taken into account. In order to accurately design such micro-electro-mechanical systems, it is of primary importance to be able to handle the strong coupling between the electric and the mechanical fields. In this paper, the finite element method (FEM) is used to model the strong coupled electro-mechanical interactions and to perform static and transient analyses taking into account large mesh displacements. These analyses will be used to study the behaviour of electrostatically actuated micro-mirrors.


New Internal Stress Driven on-Chip Micromachines for Extracting Mechanical Properties of Thin Films

Abstract: A new concept of micromachines has been developed for measuring the mechanical properties of thin metallic films. The actuator is a beam undergoing large internal stresses built up during the deposition process. Al thin films are deposited partly on the actuator beam and on the substrate. By etching the structure, the actuator contracts and pulls the Al film. Full stress strain curves can be generated by designing a set of micromachines with various actuator lengths. In the present study, the displacements have been measured by scanning electronic microscopy. The stress is derived from simple continuum mechanics relationships. The tensile properties of Al films of various thicknesses have been tested. A marked increase of the strength with decreasing film thickness is observed.


Process Issues for a Multi-Layer Microelectrofluidic Platform

Abstract: We report on the development of some process capabilities for a polymer-based, multi-layer microelectrofluidic platform, namely: the hot embossing process, metallization on polymer and polymer bonding. Hot embossing experiments were conducted to look at the effects of load applied, embossing temperature and embossing time on the fidelity of line arrays representing micro channels. The results revealed that the embossing temperature is a more sensitive parameter than the others due to its large effect on the polymer material's viscoelastic properties. Dynamic mechanical analysis (DMA) on polymethyl methacrylate (PMMA) revealed a steep glass transition over a 20 oC range, with the material losing more than 95 % of its storage modulus. The data explained the hot embossing results which showed large change in the embossed channel dimensions when the temperature is within the glass transition range. It was demonstrated that the micro-printing of silver epoxy is a possible low-cost technique in the mass production of disposable lab chips. An interconnecting network of electrical traces was fabricated in the form of a four-layer PMMA-based device. A four PMMA layer device with interconnecting microfluidic channels was also fabricated and tested.


Fabrication of Switches on Polymer-Based by Hot Embossing

Abstract: In MEMS technology, most of the devices are fabricated on glass or silicon substrate. However, this research presents a novel manufacture method that is derived from conventional hot embossing technology to fabricate the electrostatic switches on polymer material. The procedures of fabrication involve the metal deposition, photolithography, electroplating, hot embossing and hot embed techniques. The fundamental concept of the hot embed technology is that the temperature should be increased above Tg of polymer, and the polymer becomes plastic and viscous and could be molded. According to the fundamental concept, the metal layer on the silicon/glass substrate could be embedded into polymer material during the hot embossing process. Afterward, the metal layer is bonded together with the polymer after removing the substrate in the de-embossing step. Finally, the electrostatic switch is fabricated on polymethylmethacrylate(PMMA) material to demonstrate the novel method.


A New Model of Fringing Capacitance and its Application to the Control of Parallel-Plate Electrostatic Micro Actuators

Abstract: Fringing field has to be taken into account in the formulation of electrostatic parallel-plate actuators when the gap separating the electrodes is comparable to the geometrical dimensions of the moving plate. Even in this case, the existing formulations often result in complicated mathematical models from which it is difficult to determine the deflection of the moving plate for given voltages and therefore to predict the necessary applied voltages for actuation control. This work presents a new method for the modeling of fringing field, in which the effect of fringing field is modeled as a serial capacitor. Numerical simulation demonstrates the suitability of this formulation. Based on this model, a robust control scheme is constructed using the theory of input-to-state stabilization (ISS) and back-stepping state feedback design. The stability and the performance of the system using this control scheme are demonstrated through both stability analysis and numerical simulation.


An Inflationary Fixed Point Operator in XQuery

Abstract: We introduce a controlled form of recursion in XQuery, inflationary fixed points, familiar in the context of relational databases. This imposes restrictions on the expressible types of recursion, but we show that inflationary fixed points nevertheless are sufficiently versatile to capture a wide range of interesting use cases, including the semantics of Regular XPath and its core transitive closure construct. While the optimization of general user-defined recursive functions in XQuery appears elusive, we will describe how inflationary fixed points can be efficiently evaluated, provided that the recursive XQuery expressions exhibit a distributivity property. We show how distributivity can be assessed both, syntactically and algebraically, and provide experimental evidence that XQuery processors can substantially benefit during inflationary fixed point evaluation.


Morphological annotation of Korean with Directly Maintainable Resources

Abstract: This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to process text before the operation of a syntactic parser. In its present state, it annotates one-stem words only. The output is a graph of morphemes annotated with accurate linguistic information. The granularity of the tagset is 3 to 5 times higher than usual tagsets. A comparison with a reference annotated corpus showed that it achieves 89% recall without any corpus training. The language resources used by the system are lexicons of stems, transducers of suffixes and transducers of generation of allomorphs. All can be easily updated, which allows users to control the evolution of the performances of the system. It has been claimed that morphological annotation of Korean text could only be performed by a morphological analysis module accessing a lexicon of morphemes. We show that it can also be performed directly with a lexicon of words and without applying morphological rules at annotation time, which speeds up annotation to 1,210 word/s. The lexicon of words is obtained from the maintainable language resources through a fully automated compilation process.


Translating OWL and Semantic Web Rules into Prolog: Moving Toward Description Logic Programs

Abstract: To appear in Theory and Practice of Logic Programming (TPLP), 2008. We are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL and its rule extension SWRL to develop an integrated ontology/rule language, and 2) layering rules on top of an ontology with RuleML and OWL. Toward this end, we are developing the SWORIER system, which enables efficient automated reasoning on ontologies and rules, by translating all of them into Prolog and adding a set of general rules that properly capture the semantics of OWL. We have also enabled the user to make dynamic changes on the fly, at run time. This work addresses several of the concerns expressed in previous work, such as negation, complementary classes, disjunctive heads, and cardinality, and it discusses alternative approaches for dealing with inconsistencies in the knowledge base. In addition, for efficiency, we implemented techniques called extensionalization, avoiding reanalysis, and code minimization.


Lexicon management and standard formats

Abstract: International standards for lexicon formats are in preparation. To a certain extent, the proposed formats converge with prior results of standardization projects. However, their adequacy for (i) lexicon management and (ii) lexicon-driven applications have been little debated in the past, nor are they as a part of the present standardization effort. We examine these issues. IGM has developed XML formats compatible with the emerging international standards, and we report experimental results on large-coverage lexica.


In memoriam Maurice Gross

Abstract: Maurice Gross (1934-2001) was both a great linguist and a pioneer in natural language processing. This article is written in homage to his memory


A resource-based Korean morphological annotation system

Abstract: We describe a resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. The output of our system is a graph of morphemes annotated with accurate linguistic information. The language resources used by the system can be easily updated, which allows us-ers to control the evolution of the per-formances of the system. We show that morphological annotation of Korean text can be performed directly with a lexicon of words and without morpho-logical rules.


Graphes param\'etr\'es et outils de lexicalisation

Abstract: Shifting to a lexicalized grammar reduces the number of parsing errors and improves application results. However, such an operation affects a syntactic parser in all its aspects. One of our research objectives is to design a realistic model for grammar lexicalization. We carried out experiments for which we used a grammar with a very simple content and formalism, and a very informative syntactic lexicon, the lexicon-grammar of French elaborated by the LADL. Lexicalization was performed by applying the parameterized-graph approach. Our results tend to show that most information in the lexicon-grammar can be transferred into a grammar and exploited successfully for the syntactic parsing of sentences.


Evaluation of a Grammar of French Determiners

Abstract: Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the quality of a grammar of French determiners that takes the form of a recursive transition network. The result of the application of this local grammar gives deeper syntactic information than chunking or information available in treebanks. We performed the evaluation by comparison with a corpus independently annotated with information on determiners. We obtained 86% precision and 92% recall on text not tagged for parts of speech.


Secure Fractal Image Coding

Abstract: In recent work, various fractal image coding methods are reported, which adopt the self-similarity of images to compress the size of images. However, till now, no solutions for the security of fractal encoded images have been provided. In this paper, a secure fractal image coding scheme is proposed and evaluated, which encrypts some of the fractal parameters during fractal encoding, and thus, produces the encrypted and encoded image. The encrypted image can only be recovered by the correct key. To keep secure and efficient, only the suitable parameters are selected and encrypted through in-vestigating the properties of various fractal parameters, including parameter space, parameter distribu-tion and parameter sensitivity. The encryption process does not change the file format, keeps secure in perception, and costs little time or computational resources. These properties make it suitable for secure image encoding or transmission.


An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering

Abstract: This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment. The main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves the individual solutions produced in each generation. Unlike our previous work (where learning is implicit), the learning in the memetic estimation of distribution algorithm is explicit, i.e. we are able to identify building blocks directly. The overall approach learns by building a probabilistic model, i.e. an estimation of the probability distribution of individual nurse-rule pairs that are used to construct schedules. The local search processor (i.e. the ant-miner) reinforces nurse-rule pairs that receive higher rewards. A challenging real world nurse rostering problem is used as the test problem. Computational results show that the proposed approach outperforms most existing approaches. It is suggested that the learning methodologies suggested in this paper may be applied to other scheduling problems where schedules are built systematically according to specific rules


Clustering with Transitive Distance and K-Means Duality

Abstract: Recent spectral clustering methods are a propular and powerful technique for data clustering. These methods need to solve the eigenproblem whose computational complexity is $O(n^3)$, where $n$ is the number of data samples. In this paper, a non-eigenproblem based clustering method is proposed to deal with the clustering problem. Its performance is comparable to the spectral clustering algorithms but it is more efficient with computational complexity $O(n^2)$. We show that with a transitive distance and an observed property, called K-means duality, our algorithm can be used to handle data sets with complex cluster shapes, multi-scale clusters, and noise. Moreover, no parameters except the number of clusters need to be set in our algorithm.


Very strict selectional restrictions

Abstract: We discuss the characteristics and behaviour of two parallel classes of verbs in two Romance languages, French and Portuguese. Examples of these verbs are Port. abater [gado] and Fr. abattre [b\'etail], both meaning "slaughter [cattle]". In both languages, the definition of the class of verbs includes several features: - They have only one essential complement, which is a direct object. - The nominal distribution of the complement is very limited, i.e., few nouns can be selected as head nouns of the complement. However, this selection is not restricted to a single noun, as would be the case for verbal idioms such as Fr. monter la garde "mount guard". - We excluded from the class constructions which are reductions of more complex constructions, e.g. Port. afinar [instrumento] com "tune [instrument] with".


The one-way function based on computational uncertainty principle

Abstract: This paper presents how to make use of the advantage of round-off error effect in some research areas. The float-point operation complies with the reproduce theorem without the external random perturbation. The computation uncertainty principle and the high nonlinear of chaotic system guarantee the numerical error is random and departure from the analytical result. Combining these two properties we can produce unilateral one-way function and provide a case of utilizing this function to construct encryption algorithm. The multiple-precision (MP) library is used to analyze nonlinear dynamics systems and achieve the code. As an example, we provide a scheme of encrypting a plaintext by employing the one-way function with Lorenz system. Since the numerical solution used in this scheme is beyond the maximum effective computation time (MECT) and it cannot satisfy the requirements of return-map analysis and phase space reconstruction, it can block some existing attacks.


Weak vs. Self vs. Probabilistic Stabilization

Abstract: Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorthms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.


Outilex, plate-forme logicielle de traitement de textes \'ecrits

Abstract: The Outilex software platform, which will be made available to research, development and industry, comprises software components implementing all the fundamental operations of written text processing: processing without lexicons, exploitation of lexicons and grammars, language resource management. All data are structured in XML formats, and also in more compact formats, either readable or binary, whenever necessary; the required format converters are included in the platform; the grammar formats allow for combining statistical approaches with resource-based approaches. Manually constructed lexicons for French and English, originating from the LADL, and of substantial coverage, will be distributed with the platform under LGPL-LR license.


Let's get the student into the driver's seat

Abstract: Speaking a language and achieving proficiency in another one is a highly complex process which requires the acquisition of various kinds of knowledge and skills, like the learning of words, rules and patterns and their connection to communicative goals (intentions), the usual starting point. To help the learner to acquire these skills we propose an enhanced, electronic version of an age old method: pattern drills (henceforth PDs). While being highly regarded in the fifties, PDs have become unpopular since then, partially because of their lack of grounding (natural context) and rigidity. Despite these shortcomings we do believe in the virtues of this approach, at least with regard to the acquisition of basic linguistic reflexes or skills (automatisms), necessary to survive in the new language. Of course, the method needs improvement, and we will show here how this can be achieved. Unlike tapes or books, computers are open media, allowing for dynamic changes, taking users' performances and preferences into account. Building an electronic version of PDs amounts to building an open resource, accomodatable to the users' ever changing needs.


Approximation Algorithms for Restless Bandit Problems

Abstract: The restless bandit problem is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. In its ultimate generality, the restless bandit problem is known to be PSPACE-Hard to approximate to any non-trivial factor, and little progress has been made despite its importance in modeling activity allocation under uncertainty. We consider a special case that we call Feedback MAB, where the reward obtained by playing each of n independent arms varies according to an underlying on/off Markov process whose exact state is only revealed when the arm is played. The goal is to design a policy for playing the arms in order to maximize the infinite horizon time average expected reward. This problem is also an instance of a Partially Observable Markov Decision Process (POMDP), and is widely studied in wireless scheduling and unmanned aerial vehicle (UAV) routing. Unlike the stochastic MAB problem, the Feedback MAB problem does not admit to greedy index-based optimal policies. We develop a novel and general duality-based algorithmic technique that yields a surprisingly simple and intuitive 2+epsilon-approximate greedy policy to this problem. We then define a general sub-class of restless bandit problems that we term Monotone bandits, for which our policy is a 2-approximation. Our technique is robust enough to handle generalizations of these problems to incorporate various side-constraints such as blocking plays and switching costs. This technique is also of independent interest for other restless bandit problems. By presenting the first (and efficient) O(1) approximations for non-trivial instances of restless bandits as well as of POMDPs, our work initiates the study of approximation algorithms in both these contexts.


An Adaptive Checkpointing Scheme for Peer-to-Peer Based Volunteer Computing Work Flows

Abstract: Volunteer Computing, sometimes called Public Resource Computing, is an emerging computational model that is very suitable for work-pooled parallel processing. As more complex grid applications make use of work flows in their design and deployment it is reasonable to consider the impact of work flow deployment over a Volunteer Computing infrastructure. In this case, the inter work flow I/O can lead to a significant increase in I/O demands at the work pool server. A possible solution is the use of a Peer-to- Peer based parallel computing architecture to off-load this I/O demand to the workers; where the workers can fulfill some aspects of work flow coordination and I/O checking, etc. However, achieving robustness in such a large scale system is a challenging hurdle towards the decentralized execution of work flows and general parallel processes. To increase robustness, we propose and show the merits of using an adaptive checkpoint scheme that efficiently checkpoints the status of the parallel processes according to the estimation of relevant network and peer parameters. Our scheme uses statistical data observed during runtime to dynamically make checkpoint decisions in a completely de- centralized manner. The results of simulation show support for our proposed approach in terms of reduced required runtime.


Maximum directed cuts in digraphs with degree restriction

Abstract: For integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.


On b-perfect chordal graphs

Abstract: The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.


Iterative Filtering for a Dynamical Reputation System

Abstract: The paper introduces a novel iterative method that assigns a reputation to n + m items: n raters and m objects. Each rater evaluates a subset of objects leading to a n x m rating matrix with a certain sparsity pattern. From this rating matrix we give a nonlinear formula to define the reputation of raters and objects. We also provide an iterative algorithm that superlinearly converges to the unique vector of reputations and this for any rating matrix. In contrast to classical outliers detection, no evaluation is discarded in this method but each one is taken into account with different weights for the reputation of the objects. The complexity of one iteration step is linear in the number of evaluations, making our algorithm efficient for large data set. Experiments show good robustness of the reputation of the objects against cheaters and spammers and good detection properties of cheaters and spammers.


An FPT Algorithm for Directed Spanning k-Leaf

Abstract: An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of directed graphs. The main new ingredient in our approach is a lemma that shows that given a locally optimal out-branching of a directed graph in which every arc is part of at least one out-branching, either an out-branching with at least k leaves exists, or a path decomposition with width O(k^3) can be found. This enables a dynamic programming based algorithm of running time 2^{O(k^3 \log k)} n^{O(1)}, where n=|V(D)|.


Observational semantics of the Prolog Resolution Box Model

Abstract: This paper specifies an observational semantics and gives an original presentation of the Byrd box model. The approach accounts for the semantics of Prolog tracers independently of a particular Prolog implementation. Prolog traces are, in general, considered as rather obscure and difficult to use. The proposed formal presentation of its trace constitutes a simple and pedagogical approach for teaching Prolog or for implementing Prolog tracers. It is a form of declarative specification for the tracers. The trace model introduced here is only one example to illustrate general problems relating to tracers and observing processes. Observing processes know, from observed processes, only their traces. The issue is then to be able to reconstitute, by the sole analysis of the trace, part of the behaviour of the observed process, and if possible, without any loss of information. As a matter of fact, our approach highlights qualities of the Prolog resolution box model which made its success, but also its insufficiencies.


Content Reuse and Interest Sharing in Tagging Communities

Abstract: Tagging communities represent a subclass of a broader class of user-generated content-sharing online communities. In such communities users introduce and tag content for later use. Although recent studies advocate and attempt to harness social knowledge in this context by exploiting collaboration among users, little research has been done to quantify the current level of user collaboration in these communities. This paper introduces two metrics to quantify the level of collaboration: content reuse and shared interest. Using these two metrics, this paper shows that the current level of collaboration in CiteULike and Connotea is consistently low, which significantly limits the potential of harnessing the social knowledge in communities. This study also discusses implications of these findings in the context of recommendation and reputation systems.


Instruction sequences with dynamically instantiated instructions

Abstract: We study sequential programs that are instruction sequences with dynamically instantiated instructions. We define the meaning of such programs in two different ways. In either case, we give a translation by which each program with dynamically instantiated instructions is turned into a program without them that exhibits on execution the same behaviour by interaction with some service. The complexity of the translations differ considerably, whereas the services concerned are equally simple. However, the service concerned in the case of the simpler translation is far more powerful than the service concerned in the other case.


Knowware: the third star after Hardware and Software

Abstract: This book proposes to separate knowledge from software and to make it a commodity that is called knowware. The architecture, representation and function of Knowware are discussed. The principles of knowware engineering and its three life cycle models: furnace model, crystallization model and spiral model are proposed and analyzed. Techniques of software/knowware co-engineering are introduced. A software component whose knowledge is replaced by knowware is called mixware. An object and component oriented development schema of mixware is introduced. In particular, the tower model and ladder model for mixware development are proposed and discussed. Finally, knowledge service and knowware based Web service are introduced and compared with Web service. In summary, knowware, software and hardware should be considered as three equally important underpinnings of IT industry. Ruqian Lu is a professor of computer science of the Institute of Mathematics, Academy of Mathematics and System Sciences. He is a fellow of Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He has published more than 100 papers and 10 books. He has won two first class awards from the Academia Sinica and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Loo-keng Mathematics Prize.


Report on "American Option Pricing and Hedging Strategies"

Abstract: This paper mainly discusses the American option's hedging strategies via binomialmodel and the basic idea of pricing and hedging American option. Although the essential scheme of hedging is almost the same as European option, small differences may arise when simulating the process for American option holder has more rights, spelling that the option can be exercised at anytime before its maturity. Our method is dynamic-hedging method.


Building the Tangent and Adjoint codes of the Ocean General Circulation Model OPA with the Automatic Differentiation tool TAPENADE

Abstract: The ocean general circulation model OPA is developed by the LODYC team at Paris VI university. OPA has recently undergone a major rewriting, migrating to FORTRAN95, and its adjoint code needs to be rebuilt. For earlier versions, the adjoint of OPA was written by hand at a high development cost. We use the Automatic Differentiation tool TAPENADE to build mechanicaly the tangent and adjoint codes of OPA. We validate the differentiated codes by comparison with divided differences, and also with an identical twin experiment. We apply state-of-the-art methods to improve the performance of the adjoint code. In particular we implement the Griewank and Walther's binomial checkpointing algorithm which gives us an optimal trade-off between time and memory consumption. We apply a specific strategy to differentiate the iterative linear solver that comes from the implicit time stepping scheme


Covariance and PCA for Categorical Variables

Abstract: Covariances from categorical variables are defined using a regular simplex expression for categories. The method follows the variance definition by Gini, and it gives the covariance as a solution of simultaneous equations. The calculated results give reasonable values for test data. A method of principal component analysis (RS-PCA) is also proposed using regular simplex expressions, which allows easy interpretation of the principal components. The proposed methods apply to variable selection problem of categorical data USCensus1990 data. The proposed methods give appropriate criterion for the variable selection problem of categorical


Valence extraction using EM selection and co-occurrence matrices

Abstract: This paper discusses two new procedures for extracting verb valences from raw texts, with an application to the Polish language. The first novel technique, the EM selection algorithm, performs unsupervised disambiguation of valence frame forests, obtained by applying a non-probabilistic deep grammar parser and some post-processing to the text. The second new idea concerns filtering of incorrect frames detected in the parsed text and is motivated by an observation that verbs which take similar arguments tend to have similar frames. This phenomenon is described in terms of newly introduced co-occurrence matrices. Using co-occurrence matrices, we split filtering into two steps. The list of valid arguments is first determined for each verb, whereas the pattern according to which the arguments are combined into frames is computed in the following stage. Our best extracted dictionary reaches an $F$-score of 45%, compared to an $F$-score of 39% for the standard frame-based BHT filtering.


Fluoroscopy-based navigation system in spine surgery

Abstract: The variability in width, height, and spatial orientation of a spinal pedicle makes pedicle screw insertion a delicate operation. The aim of the current paper is to describe a computer-assisted surgical navigation system based on fluoroscopic X-ray image calibration and three-dimensional optical localizers in order to reduce radiation exposure while increasing accuracy and reliability of the surgical procedure for pedicle screw insertion. Instrumentation using transpedicular screw fixation was performed: in a first group, a conventional surgical procedure was carried out with 26 patients (138 screws); in a second group, a navigated surgical procedure (virtual fluoroscopy) was performed with 26 patients (140 screws). Evaluation of screw placement in every case was done by using plain X-rays and post-operative computer tomography scan. A 5 per cent cortex penetration (7 of 140 pedicle screws) occurred for the computer-assisted group. A 13 per cent penetration (18 of 138 pedicle screws) occurred for the non computer-assisted group. The radiation running time for each vertebra level (two screws) reached 3.5 s on average in the computer-assisted group and 11.5 s on average in the non computer-assisted group. The operative time for two screws on the same vertebra level reaches 10 min on average in the non computer-assisted group and 11.9 min on average in the computer-assisted group. The fluoroscopy-based (two-dimensional) navigation system for pedicle screw insertion is a safe and reliable procedure for surgery in the lower thoracic and lumbar spine.


Robot-based tele-echography: clinical evaluation of the TER system in abdominal aortic exploration

Abstract: OBJECTIVE: The TER system is a robot-based tele-echography system allowing remote ultrasound examination. The specialist moves a mock-up of the ultrasound probe at the master site, and the robot reproduces the movements of the real probe, which sends back ultrasound images and force feedback. This tool could be used to perform ultrasound examinations in small health care centers or from isolated sites. The objective of this study was to prove, under real conditions, the feasibility and reliability of the TER system in detecting abdominal aortic and iliac aneurysms. METHODS: Fifty-eight patients were included in 2 centers in Brest and Grenoble, France. The remote examination was compared with the reference standard, the bedside examination, for aorta and iliac artery diameter measurement, detection and description of aneurysms, detection of atheromatosis, the duration of the examination, and acceptability. RESULTS: All aneurysms (8) were detected by both techniques as intramural thrombosis and extension to the iliac arteries. The interobserver correlation coefficient was 0.982 (P < .0001) for aortic diameters. The rate of concordance between 2 operators in evaluating atheromatosis was 84% +/- 11% (95% confidence interval). CONCLUSIONS: Our study on 58 patients suggests that the TER system could be a reliable, acceptable, and effective robot-based system for performing remote abdominal aortic ultrasound examinations. Research is continuing to improve the equipment for general abdominal use.


Near-Deterministic Inference of AS Relationships

Abstract: The discovery of Autonomous Systems (ASes) interconnections and the inference of their commercial Type-of-Relationships (ToR) has been extensively studied during the last few years. The main motivation is to accurately calculate AS-level paths and to provide better topological view of the Internet. An inherent problem in current algorithms is their extensive use of heuristics. Such heuristics incur unbounded errors which are spread over all inferred relationships. We propose a near-deterministic algorithm for solving the ToR inference problem. Our algorithm uses as input the Internet core, which is a dense sub-graph of top-level ASes. We test several methods for creating such a core and demonstrate the robustness of the algorithm to the core's size and density, the inference period, and errors in the core. We evaluate our algorithm using AS-level paths collected from RouteViews BGP paths and DIMES traceroute measurements. Our proposed algorithm deterministically infers over 95% of the approximately 58,000 AS topology links. The inference becomes stable when using a week worth of data and as little as 20 ASes in the core. The algorithm infers 2-3 times more peer-to-peer relationships in edges discovered only by DIMES than in RouteViews edges, validating the DIMES promise to discover periphery AS edges.


A Note On Computing Set Overlap Classes

Abstract: Let ${\cal V}$ be a finite set of $n$ elements and ${\cal F}=\{X_1,X_2, >..., X_m\}$ a family of $m$ subsets of ${\cal V}.$ Two sets $X_i$ and $X_j$ of ${\cal F}$ overlap if $X_i \cap X_j \neq \emptyset,$ $X_j \setminus X_i \neq \emptyset,$ and $X_i \setminus X_j \neq \emptyset.$ Two sets $X,Y\in {\cal F}$ are in the same overlap class if there is a series $X=X_1,X_2, ..., X_k=Y$ of sets of ${\cal F}$ in which each $X_iX_{i+1}$ overlaps. In this note, we focus on efficiently identifying all overlap classes in $O(n+\sum_{i=1}^m |X_i|)$ time. We thus revisit the clever algorithm of Dahlhaus of which we give a clear presentation and that we simplify to make it practical and implementable in its real worst case complexity. An useful variant of Dahlhaus's approach is also explained.


Spreadsheet Risk - A New Direction for HMRC?

Abstract: Her Majestys Revenue & Customs (HMRC) was born out of the need to create a UK tax authority by merging both the Inland Revenue and HM Customs & Excise into one department. HMRC encounters spreadsheets in tax-payers systems on a very regular basis as well as being a heavy user of spreadsheets internally. The approach to spreadsheet risk assessment and spreadsheet audit is by the use of trained computer auditors and data handlers. This, by definition, limits the use of our specialist spreadsheet audit tool to such trained staff. In order to tackle the growing use of spreadsheets, a new way of approaching the problem has been piloted. The aim is to issue all staff who come across spreadsheets with a simple to use analysis and risk assessment tool, based on the departmental software SpACE (Spreadsheet Audit & Compliance Examination).


Strategies for Addressing Spreadsheet Compliance Challenges

Abstract: Most organizations today use spreadsheets in some form or another to support critical business processes. However the financial resources, and developmental rigor dedicated to them are often minor in comparison to other enterprise technology. The increasing focus on achieving regulatory and other forms of compliance over key technology assets has made it clear that organizations must regard spreadsheets as an enterprise resource and account for them when developing an overall compliance strategy. This paper provides the reader with a set of practical strategies for addressing spreadsheet compliance from an organizational perspective. It then presents capabilities offered in the 2007 Microsoft Office System which can be used to help customers address compliance challenges.


A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom

Abstract: This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate cases, in which case the solution is a 1-dimensional curve. Our first main contribution is a definition of a condition number measuring reciprocal distance to degeneracy that can distinguish poor and well conditioned instances of this problem. (Degenerate problems would be infinitely ill conditioned in our framework.) Our second contribution, which is the main novelty of our algorithm, is an analysis showing that its running time is bounded in terms of the condition number of the problem instance as well as $n$ and the polynomial degrees.


Copeland Voting Fully Resists Constructive Control

Abstract: Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Faliszewski et al. [FHHR07] proved that Llull voting (which is here denoted by Copeland^1) and a variant (here denoted by Copeland^0) of Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denoted by Copeland^alpha where the parameter alpha is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections. We establish resistance or vulnerability results, in every previously studied control scenario, for Copeland^alpha, for each rational alpha, 0 <alpha < 1. In particular, we prove that Copeland^0.5, the system commonly referred to as ``Copeland voting,'' provides full resistance to constructive control. Among the systems with a polynomial-time winner problem, this is the first natural election system proven to have full resistance to constructive control. Results on bribery and fixed-parameter tractability of bounded-case control proven for Copeland^0 and Copeland^1 in [FHHR07] are extended to Copeland^alpha for each rational alpha, 0 < alpha < 1; we also give results in more flexible models such as microbribery and extended control.


Approximation Algorithms for Orienteering with Time Windows

Abstract: Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s,t and a time limit T, find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified time-window [R(v), D(v)] and a node v is counted as visited by the walk only if v is visited during its time-window. For the time-window problem, an O(\log \opt) approximation can be achieved even for directed graphs if the algorithm is allowed quasi-polynomial time. However, the best known polynomial time approximation ratios are O(\log^2 \opt) for undirected graphs and O(\log^4 \opt) in directed graphs. In this paper we make some progress towards closing this discrepancy, and in the process obtain improved approximation ratios in several natural settings. Let L(v) = D(v) - R(v) denote the length of the time-window for v and let \lmax = \max_v L(v) and \lmin = \min_v L(v). Our results are given below with \alpha denoting the known approximation ratio for orienteering (without time-windows). Currently \alpha = (2+\eps) for undirected graphs and \alpha = O(\log^2 \opt) in directed graphs. 1. An O(\alpha \log \lmax) approximation when R(v) and D(v) are integer valued for each v. 2. An O(\alpha \max{\log \opt, \log \frac{\lmax}{\lmin}}) approximation. 3. An O(\alpha \log \frac{\lmax}{\lmin}) approximation when no start and end points are specified. In particular, if \frac{\lmax}{\lmin} is poly-bounded, we obtain an O(\log n) approximation for the time-window problem in undirected graphs.


Nonuniform Bribery

Abstract: We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we request. Our model is an extension of the one of Faliszewski et al. [FHH06], where each voter has a single price for any change we may ask for. We show polynomial-time algorithms for our version of bribery for a broad range of voting protocols, including plurality, veto, approval, and utility based voting. In addition to our polynomial-time algorithms we provide NP-completeness results for a couple of our nonuniform bribery problems for weighted voters, and a couple of approximation algorithms for NP-complete bribery problems defined in [FHH06] (in particular, an FPTAS for plurality-weighted-$bribery problem).


Development of miniaturized light endoscope-holder robot for laparoscopic surgery

Abstract: PURPOSE: We have conducted experiments with an innovatively designed robot endoscope holder for laparoscopic surgery that is small and low cost. MATERIALS AND METHODS: A compact light endoscope robot (LER) that is placed on the patient's skin and can be used with the patient in the lateral or dorsal supine position was tested on cadavers and laboratory pigs in order to allow successive modifications. The current control system is based on voice recognition. The range of vision is 360 degrees with an angle of 160 degrees . Twenty-three procedures were performed. RESULTS: The tests made it possible to advance the prototype on a variety of aspects, including reliability, steadiness, ergonomics, and dimensions. The ease of installation of the robot, which takes only 5 minutes, and the easy handling made it possible for 21 of the 23 procedures to be performed without an assistant. CONCLUSION: The LER is a camera holder guided by the surgeon's voice that can eliminate the need for an assistant during laparoscopic surgery. The ease of installation and manufacture should make it an effective and inexpensive system for use on patients in the lateral and dorsal supine positions. Randomized clinical trials will soon validate a new version of this robot prior to marketing.


Finding the growth rate of a regular language in polynomial time

Abstract: We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a DFA accepting a language of polynomial growth, we can determine the order of polynomial growth in quadratic time.


On Myopic Sensing for Multi-Channel Opportunistic Access: Structure, Optimality, and Performance

Abstract: We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elliot channel model). A user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on numerical results. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, and resource-constrained jamming and anti-jamming.


From vectors to mnesors

Abstract: The mnesor theory is the adaptation of vectors to artificial intelligence. The scalar field is replaced by a lattice. Addition becomes idempotent and multiplication is interpreted as a selection operation. We also show that mnesors can be the foundation for a linear calculus.


Recommended Practices for Spreadsheet Testing

Abstract: This paper presents the authors recommended practices for spreadsheet testing. Documented spreadsheet error rates are unacceptable in corporations today. Although improvements are needed throughout the systems development life cycle, credible improvement programs must include comprehensive testing. Several forms of testing are possible, but logic inspection is recommended for module testing. Logic inspection appears to be feasible for spreadsheet developers to do, and logic inspection appears to be safe and effective.


Efficient Binary and Run Length Morphology and its Application to Document Image Processing

Abstract: This paper describes the implementation and evaluation of an open source library for mathematical morphology based on packed binary and run-length compressed images for document imaging applications. Abstractions and patterns useful in the implementation of the interval operations are described. A number of benchmarks and comparisons to bit-blit based implementations on standard document images are provided.


On the Relationship between the Posterior and Optimal Similarity

Abstract: For a classification problem described by the joint density $P(\omega,x)$, models of $P(\omega\eq\omega'|x,x')$ (the ``Bayesian similarity measure'') have been shown to be an optimal similarity measure for nearest neighbor classification. This paper analyzes demonstrates several additional properties of that conditional distribution. The paper first shows that we can reconstruct, up to class labels, the class posterior distribution $P(\omega|x)$ given $P(\omega\eq\omega'|x,x')$, gives a procedure for recovering the class labels, and gives an asymptotically Bayes-optimal classification procedure. It also shows, given such an optimal similarity measure, how to construct a classifier that outperforms the nearest neighbor classifier and achieves Bayes-optimal classification rates. The paper then analyzes Bayesian similarity in a framework where a classifier faces a number of related classification tasks (multitask learning) and illustrates that reconstruction of the class posterior distribution is not possible in general. Finally, the paper identifies a distinct class of classification problems using $P(\omega\eq\omega'|x,x')$ and shows that using $P(\omega\eq\omega'|x,x')$ to solve those problems is the Bayes optimal solution.


Learning Similarity for Character Recognition and 3D Object Recognition

Abstract: I describe an approach to similarity motivated by Bayesian methods. This yields a similarity function that is learnable using a standard Bayesian methods. The relationship of the approach to variable kernel and variable metric methods is discussed. The approach is related to variable kernel Experimental results on character recognition and 3D object recognition are presented..


Learning View Generalization Functions

Abstract: Learning object models from views in 3D visual object recognition is usually formulated either as a function approximation problem of a function describing the view-manifold of an object, or as that of learning a class-conditional density. This paper describes an alternative framework for learning in visual object recognition, that of learning the view-generalization function. Using the view-generalization function, an observer can perform Bayes-optimal 3D object recognition given one or more 2D training views directly, without the need for a separate model acquisition step. The paper shows that view generalization functions can be computationally practical by restating two widely-used methods, the eigenspace and linear combination of views approaches, in a view generalization framework. The paper relates the approach to recent methods for object recognition based on non-uniform blurring. The paper presents results both on simulated 3D ``paperclip'' objects and real-world images from the COIL-100 database showing that useful view-generalization functions can be realistically be learned from a comparatively small number of training examples.


View Based Methods can achieve Bayes-Optimal 3D Recognition

Abstract: This paper proves that visual object recognition systems using only 2D Euclidean similarity measurements to compare object views against previously seen views can achieve the same recognition performance as observers having access to all coordinate information and able of using arbitrary 3D models internally. Furthermore, it demonstrates that such systems do not require more training views than Bayes-optimal 3D model-based systems. For building computer vision systems, these results imply that using view-based or appearance-based techniques with carefully constructed combination of evidence mechanisms may not be at a disadvantage relative to 3D model-based systems. For computational approaches to human vision, they show that it is impossible to distinguish view-based and 3D model-based techniques for 3D object recognition solely by comparing the performance achievable by human and 3D model-based systems.}


Direct definition of a ternary infinite square-free sequence

Abstract: We propose a new ternary infinite (even full-infinite) square-free sequence. The sequence is defined both by an iterative method and by a direct definition. Both definitions are analogous to those of the Thue-Morse sequence. The direct definition is given by a deterministic finite automaton with output. In short, the sequence is automatic.


A Spectral Approach to Analyzing Belief Propagation for 3-Coloring

Abstract: Contributing to the rigorous understanding of BP, in this paper we relate the convergence of BP to spectral properties of the graph. This encompasses a result for random graphs with a ``planted'' solution; thus, we obtain the first rigorous result on BP for graph coloring in the case of a complex graphical structure (as opposed to trees). In particular, the analysis shows how Belief Propagation breaks the symmetry between the $3!$ possible permutations of the color classes.


Period of the d-Sequence Based Random Number Generator

Abstract: This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.


A Reactive Tabu Search Algorithm for Stimuli Generation in Psycholinguistics

Abstract: The generation of meaningless "words" matching certain statistical and/or linguistic criteria is frequently needed for experimental purposes in Psycholinguistics. Such stimuli receive the name of pseudowords or nonwords in the Cognitive Neuroscience literatue. The process for building nonwords sometimes has to be based on linguistic units such as syllables or morphemes, resulting in a numerical explosion of combinations when the size of the nonwords is increased. In this paper, a reactive tabu search scheme is proposed to generate nonwords of variables size. The approach builds pseudowords by using a modified Metaheuristic algorithm based on a local search procedure enhanced by a feedback-based scheme. Experimental results show that the new algorithm is a practical and effective tool for nonword generation.


Simrank++: Query rewriting through link analysis of the click graph

Abstract: We focus on the problem of query rewriting for sponsored search. We base rewrites on a historical click graph that records the ads that have been clicked on in response to past user queries. Given a query q, we first consider Simrank as a way to identify queries similar to q, i.e., queries whose ads a user may be interested in. We argue that Simrank fails to properly identify query similarities in our application, and we present two enhanced version of Simrank: one that exploits weights on click graph edges and another that exploits ``evidence.'' We experimentally evaluate our new schemes against Simrank, using actual click graphs and queries form Yahoo!, and using a variety of metrics. Our results show that the enhanced methods can yield more and better query rewrites.


Prostate biopsies guided by three-dimensional real-time (4-D) transrectal ultrasonography on a phantom: comparative study versus two-dimensional transrectal ultrasound-guided biopsies

Abstract: OBJECTIVE: This study evaluated the accuracy in localisation and distribution of real-time three-dimensional (4-D) ultrasound-guided biopsies on a prostate phantom. METHODS: A prostate phantom was created. A three-dimensional real-time ultrasound system with a 5.9MHz probe was used, making it possible to see several reconstructed orthogonal viewing planes in real time. Fourteen operators performed biopsies first under 2-D then 4-D transurethral ultrasound (TRUS) guidance (336 biopsies). The biopsy path was modelled using segmentation in a 3-D ultrasonographic volume. Special software was used to visualise the biopsy paths in a reference prostate and assess the sampled area. A comparative study was performed to examine the accuracy of the entry points and target of the needle. Distribution was assessed by measuring the volume sampled and a redundancy ratio of the sampled prostate. RESULTS: A significant increase in accuracy in hitting the target zone was identified using 4-D ultrasonography as compared to 2-D. There was no increase in the sampled volume or improvement in the biopsy distribution with 4-D ultrasonography as compared to 2-D. CONCLUSION: The 4-D TRUS guidance appears to show, on a synthetic model, an improvement in location accuracy and in the ability to reproduce a protocol. The biopsy distribution does not seem improved.


Spanners of Complete $k$-Partite Geometric Graphs

Abstract: We address the following problem: Given a complete $k$-partite geometric graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a spanner of $K$ that has a ``small'' stretch factor and ``few'' edges. We present two algorithms for this problem. The first algorithm computes a $(5+\epsilon)$-spanner of $K$ with O(n) edges in $O(n \log n)$ time. The second algorithm computes a $(3+\epsilon)$-spanner of $K$ with $O(n \log n)$ edges in $O(n \log n)$ time. The latter result is optimal: We show that for any $2 \leq k \leq n - \Theta(\sqrt{n \log n})$, spanners with $O(n \log n)$ edges and stretch factor less than 3 do not exist for all complete $k$-partite geometric graphs.


Upper Bounds for the Number of Hamiltonian Cycles

Abstract: An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that counting the number of Hamiltonian cycles of an undirected graph can be done by counting the number of Hamiltonian cycles of its corresponding symmetric directed graph. In this way, an upper bound for the number of Hamiltonian cycles of undirected graphs is also obtained.


Equations of States in Singular Statistical Estimation

Abstract: Learning machines which have hierarchical structures or hidden variables are singular statistical models because they are nonidentifiable and their Fisher information matrices are singular. In singular statistical models, neither the Bayes a posteriori distribution converges to the normal distribution nor the maximum likelihood estimator satisfies asymptotic normality. This is the main reason why it has been difficult to predict their generalization performances from trained states. In this paper, we study four errors, (1) Bayes generalization error, (2) Bayes training error, (3) Gibbs generalization error, and (4) Gibbs training error, and prove that there are mathematical relations among these errors. The formulas proved in this paper are equations of states in statistical estimation because they hold for any true distribution, any parametric model, and any a priori distribution. Also we show that Bayes and Gibbs generalization errors are estimated by Bayes and Gibbs training errors, and propose widely applicable information criteria which can be applied to both regular and singular statistical models.


Cryptanalysis of an image encryption scheme based on the Hill cipher

Abstract: This paper studies the security of an image encryption scheme based on the Hill cipher and reports its following problems: 1) there is a simple necessary and sufficient condition that makes a number of secret keys invalid; 2) it is insensitive to the change of the secret key; 3) it is insensitive to the change of the plain-image; 4) it can be broken with only one known/chosen-plaintext; 5) it has some other minor defects.


Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

Abstract: For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a homomorphism $f$ is $\sum_{u\in V(G)}c_{f(u)}(u)$. For each fixed digraph $H$, the minimum cost homomorphism problem for $H$, denoted MinHOM($H$), can be formulated as follows: Given an input digraph $G$, together with costs $c_i(u)$, $u\in V(G)$, $i\in V(H)$, decide whether there exists a homomorphism of $G$ to $H$ and, if one exists, to find one of minimum cost. Minimum cost homomorphism problems encompass (or are related to) many well studied optimization problems such as the minimum cost chromatic partition and repair analysis problems. We focus on the minimum cost homomorphism problem for locally semicomplete digraphs and quasi-transitive digraphs which are two well-known generalizations of tournaments. Using graph-theoretic characterization results for the two digraph classes, we obtain a full dichotomy classification of the complexity of minimum cost homomorphism problems for both classes.


The Fast Fibonacci Decompression Algorithm

Abstract: Data compression has been widely applied in many data processing areas. Compression methods use variable-size codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci coding, as a representative of these codes, is used for compressing small numbers. Time consumption of a decompression algorithm is not usually as important as the time of a compression algorithm. However, efficiency of the decompression may be a critical issue in some cases. For example, a real-time compression of tree data structures follows this issue. Tree's pages are decompressed during every reading from a secondary storage into the main memory. In this case, the efficiency of a decompression algorithm is extremely important. We have developed a Fast Fibonacci decompression for this purpose. Our approach is up to $3.5\times$ faster than the original implementation.


Evolving localizations in reaction-diffusion cellular automata

Abstract: We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules is required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.


A Universal Kernel for Learning Regular Languages

Abstract: We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient $\eps$-approximation.


Dimensionality Reduction and Reconstruction using Mirroring Neural Networks and Object Recognition based on Reduced Dimension Characteristic Vector

Abstract: In this paper, we present a Mirroring Neural Network architecture to perform non-linear dimensionality reduction and Object Recognition using a reduced lowdimensional characteristic vector. In addition to dimensionality reduction, the network also reconstructs (mirrors) the original high-dimensional input vector from the reduced low-dimensional data. The Mirroring Neural Network architecture has more number of processing elements (adalines) in the outer layers and the least number of elements in the central layer to form a converging-diverging shape in its configuration. Since this network is able to reconstruct the original image from the output of the innermost layer (which contains all the information about the input pattern), these outputs can be used as object signature to classify patterns. The network is trained to minimize the discrepancy between actual output and the input by back propagating the mean squared error from the output layer to the input layer. After successfully training the network, it can reduce the dimension of input vectors and mirror the patterns fed to it. The Mirroring Neural Network architecture gave very good results on various test patterns.


Automatic Pattern Classification by Unsupervised Learning Using Dimensionality Reduction of Data with Mirroring Neural Networks

Abstract: This paper proposes an unsupervised learning technique by using Multi-layer Mirroring Neural Network and Forgy's clustering algorithm. Multi-layer Mirroring Neural Network is a neural network that can be trained with generalized data inputs (different categories of image patterns) to perform non-linear dimensionality reduction and the resultant low-dimensional code is used for unsupervised pattern classification using Forgy's algorithm. By adapting the non-linear activation function (modified sigmoidal function) and initializing the weights and bias terms to small random values, mirroring of the input pattern is initiated. In training, the weights and bias terms are changed in such a way that the input presented is reproduced at the output by back propagating the error. The mirroring neural network is capable of reducing the input vector to a great degree (approximately 1/30th the original size) and also able to reconstruct the input pattern at the output layer from this reduced code units. The feature set (output of central hidden layer) extracted from this network is fed to Forgy's algorithm, which classify input data patterns into distinguishable classes. In the implementation of Forgy's algorithm, initial seed points are selected in such a way that they are distant enough to be perfectly grouped into different categories. Thus a new method of unsupervised learning is formulated and demonstrated in this paper. This method gave impressive results when applied to classification of different image patterns.


A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming

Abstract: Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are different concepts. The former holds, given programs P and Q, iff P can be faithfully replaced by Q within any context R, while the latter holds iff P and Q provide the same output, that is, they have the same answer sets. Notions in between strong and ordinary equivalence have been introduced as theoretical tools to compare incomplete programs and are defined by either restricting the syntactic structure of the considered context programs R or by bounding the set A of atoms allowed to occur in R (relativized equivalence).For the latter approach, different A yield properly different equivalence notions, in general. For the former approach, however, it turned out that any ``reasonable'' syntactic restriction to R coincides with either ordinary, strong, or uniform equivalence. In this paper, we propose a parameterization for equivalence notions which takes care of both such kinds of restrictions simultaneously by bounding, on the one hand, the atoms which are allowed to occur in the rule heads of the context and, on the other hand, the atoms which are allowed to occur in the rule bodies of the context. We introduce a general semantical characterization which includes known ones as SE-models (for strong equivalence) or UE-models (for uniform equivalence) as special cases. Moreover,we provide complexity bounds for the problem in question and sketch a possible implementation method. To appear in Theory and Practice of Logic Programming (TPLP).


Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings

Abstract: For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is known that this relation does not exceed 5/4 for any graph. We characterize the class of graphs for which this relation is precisely 5/4. Our characterization implies that these graphs contain a spanning subgraph, every component of which is the minimal graph of this class.


On Using Unsatisfiability for Solving Maximum Satisfiability

Abstract: Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work proposed using efficient Boolean Satisfiability (SAT) solvers for solving the MaxSAT problem, based on identifying and eliminating unsatisfiable subformulas. However, these algorithms do not scale in practice. This paper analyzes existing MaxSAT algorithms based on unsatisfiable subformula identification. Moreover, the paper proposes a number of key optimizations to these MaxSAT algorithms and a new alternative algorithm. The proposed optimizations and the new algorithm provide significant performance improvements on MaxSAT instances from practical applications. Moreover, the efficiency of the new generation of unsatisfiability-based MaxSAT solvers becomes effectively indexed to the ability of modern SAT solvers to proving unsatisfiability and identifying unsatisfiable subformulas.


Transactional WaveCache: Towards Speculative and Out-of-Order DataFlow Execution of Memory Operations

Abstract: The WaveScalar is the first DataFlow Architecture that can efficiently provide the sequential memory semantics required by imperative languages. This work presents an alternative memory ordering mechanism for this architecture, the Transaction WaveCache. Our mechanism maintains the execution order of memory operations within blocks of code, called Waves, but adds the ability to speculatively execute, out-of-order, operations from different waves. This ordering mechanism is inspired by progress in supporting Transactional Memories. Waves are considered as atomic regions and executed as nested transactions. If a wave has finished the execution of all its memory operations, as soon as the previous waves are committed, it can be committed. If a hazard is detected in a speculative Wave, all the following Waves (children) are aborted and re-executed. We evaluate the WaveCache on a set artificial benchmarks. If the benchmark does not access memory often, we could achieve speedups of around 90%. Speedups of 33.1% and 24% were observed on more memory intensive applications, and slowdowns up to 16% arise if memory bandwidth is a bottleneck. For an application full of WAW, WAR and RAW hazards, a speedup of 139.7% was verified.


Cumulative and Averaging Fission of Beliefs

Abstract: Belief fusion is the principle of combining separate beliefs or bodies of evidence originating from different sources. Depending on the situation to be modelled, different belief fusion methods can be applied. Cumulative and averaging belief fusion is defined for fusing opinions in subjective logic, and for fusing belief functions in general. The principle of fission is the opposite of fusion, namely to eliminate the contribution of a specific belief from an already fused belief, with the purpose of deriving the remaining belief. This paper describes fission of cumulative belief as well as fission of averaging belief in subjective logic. These operators can for example be applied to belief revision in Bayesian belief networks, where the belief contribution of a given evidence source can be determined as a function of a given fused belief and its other contributing beliefs.


Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2007 at ECOOP'07

Abstract: ICOOOLPS'2007 was the second edition of the ECOOP-ICOOOLPS workshop. ICOOOLPS intends to bring researchers and practitioners both from academia and industry together, with a spirit of openness, to try and identify and begin to address the numerous and very varied issues of optimization. After a first successful edition, this second one put a stronger emphasis on exchanges and discussions amongst the participants, progressing on the bases set last year in Nantes. The workshop attendance was a success, since the 30-people limit we had set was reached about 2 weeks before the workshop itself. Some of the discussions (e.g. annotations) were so successful that they would required even more time than we were able to dedicate to them. That's one area we plan to further improve for the next edition.


Lambda-RBAC: Programming with Role-Based Access Control

Abstract: We study mechanisms that permit program components to express role constraints on clients, focusing on programmatic security mechanisms, which permit access controls to be expressed, in situ, as part of the code realizing basic functionality. In this setting, two questions immediately arise: (1) The user of a component faces the issue of safety: is a particular role sufficient to use the component? (2) The component designer faces the dual issue of protection: is a particular role demanded in all execution paths of the component? We provide a formal calculus and static analysis to answer both questions.


Evaluating the Utility of Anonymized Network Traces for Intrusion Detection

Abstract: Anonymization is the process of removing or hiding sensitive information in logs. Anonymization allows organizations to share network logs while not exposing sensitive information. However, there is an inherent trade off between the amount of information revealed in the log and the usefulness of the log to the client (the utility of a log). There are many anonymization techniques, and there are many ways to anonymize a particular log (that is, which fields to anonymize and how). Different anonymization policies will result in logs with varying levels of utility for analysis. In this paper we explore the effect of different anonymization policies on logs. We provide an empirical analysis of the effect of varying anonymization policies by looking at the number of alerts generated by an Intrusion Detection System. This is the first work to thoroughly evaluate the effect of single field anonymization policies on a data set. Our main contributions are to determine a set of fields that have a large impact on the utility of a log.