Sofic Tree-Shifts

We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite ranked trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique reduced deterministic irreducible tree automaton accepting an irreducible sofic tree-shift, but that there is a unique synchronized one, called the Fischer automaton of the tree-shift. We define the notion of almost of finite type tree-shift which are sofic tree-shifts accepted by a tree automaton which is both deterministic and co-deterministic with a finite delay. It is a meaningful intermediate dynamical class in between irreducible finite type tree-shifts and irreducible sofic tree-shifts. We characterize the Fischer automaton of an almost of finite type tree-shift and we design an algorithm to check whether a sofic tree-shift is almost of finite type. We prove that the Fischer automaton is a topological conjugacy invariant of the underlying irreducible sofic tree-shift.     

A Multiple Resampling Method for Learning from Imbalanced Data Sets

Resampling methods are commonly used for dealing with the class-imbalance problem. Their advantage over other methods is that they are external and thus, easily transportable. Although such approaches can be very simple to implement, tuning them most effectively is not an easy task. In particular, it is unclear whether oversampling is more effective than undersampling and which oversampling or undersampling rate should be used. This paper presents an experimental study of these questions and concludes that combining different expressions of the resampling approach is an effective solution to the tuning problem. The proposed combination scheme is evaluated on imbalanced subsets of the Reuters-21578 text collection and is shown to be quite effective for these problems.     

Evaluation of models for tube material characterization with the tube bulging test in an industrial setting

It is now well recognized that the material data obtained from a tensile test is less appropriate than those from a Tube Bulging Test (TBT) for a finite element simulation of tube hydroforming. However, the manufacturers still use classical data (often tensile test data) for designing metal operations due to the lack of standard for the TBT and a more complex post processing analysis of experimental measures. Getting the hardening curve from the tube bulging test requires the use of an analytical or numerical model. In this paper, three models for post-processing measures obtained from the TBT are compared based on the same experimental procedure. Thanks to a preliminary step, consisting of the validation of the analytical models through the use of finite element simulations of the TBT, it highlights that the results obtained for the local (stress and strain) and global components (the thickness distribution along the tube and the deformed tube profile) are very close, whatever the models. The test configuration (die radius and free length) seems to have no significant impact on the resulting stress-strain curve for the three models. The three models are used for post processing tube bulging tests performed on AISI304, INCONEL and Copper tubes validating their capacity for tube characterization on different materials. Finally, this study demonstrates that the Boudeau-Malécot Model can be used to obtain hardening curve from TBT without a loss of accuracy compared to more complex post-processing models and with an important gain of quality compared to tensile test.     

A linear relaxation-based heuristic approach for logistics network design

We address the problem of designing and planning a multi-period, multi-echelon, multi-commodity logistics network with deterministic demands. This consists of making strategic and tactical decisions: opening, closing or expanding facilities, selecting suppliers and defining the product flows. We use a heuristic approach based on the linear relaxation of the original mixed integer linear problem (MILP). The main idea is to solve a sequence of linear relaxations of the original MILP, and to fix as many binary variables as possible at every iteration. This simple process is coupled with several rounding procedures for some key decision variables. The number of binary decision variables in the resulting MILP is small enough for it to be solved with a solver. The main benefit of this approach is that it provides feasible solutions of good quality within an affordable computation time.     

Untangling euler diagrams

In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indicated by boundaries surrounding their members. Generating such diagrams automatically such that set regions do not intersect unless the corresponding sets have a non-empty intersection is a difficult problem. Further, it may be impossible in some cases if regions are required to be continuous and convex. Several approaches exist to draw such set regions using more complex shapes, however, the resulting diagrams can be difficult to interpret. In this paper we present two novel approaches for simplifying a complex collection of intersecting sets into a strict hierarchy that can be more easily automatically arranged and drawn (Figure 1). In the first approach, we use compact rectangular shapes for drawing each set, attempting to improve the readability of the set intersections. In the second approach, we avoid drawing intersecting set regions by duplicating elements belonging to multiple sets. We compared both of our techniques to the traditional non-convex region technique using five readability tasks. Our results show that the compact rectangular shapes technique was often preferred by experimental subjects even though the use of duplications dramatically improves the accuracy and performance time for most of our tasks. In addition to general set representation our techniques are also applicable to visualization of networks with intersecting clusters of nodes.     

CMOS stacked folded differential structure power amplifier for high power RF application

This article describes the feasibility of a Power Amplifier (PA) in 0.13 μm CMOS technology from STMicroelectronics for high power applications. To obtain a high output power with a good linearity, a new topology called Stacked Folded Differential Structure (SFDS) is proposed. It allows obtaining similar power performances to a PA with DAT in a lower die area. This PA provides 23 dBm of maximum output power (P_max) with 20% of power added efficiency (PAE) at 1.95 GHz. The linear gain is equal to 11 dB and the output power at 1 dB compression point (OCP₁) achieves 21 dBm. © 2010 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

Evaluation of the OQuaRE framework for ontology quality

The increasing importance of ontologies has resulted in the development of a large number of ontologies in both coordinated and non-coordinated efforts. The number and complexity of such ontologies make hard to ontology and tool developers to select which ontologies to use and reuse. So far, there are no mechanism for making such decisions in an informed manner. Consequently, methods for evaluating ontology quality are required. OQuaRE is a method for ontology quality evaluation which adapts the SQuaRE standard for software product quality to ontologies. OQuaRE has been applied to identify the strengths and weaknesses of different ontologies but, so far, this framework has not been evaluated itself. Therefore, in this paper we present the evaluation of OQuaRE, performed by an international panel of experts in ontology engineering. The results include the positive and negative aspects of the current version of OQuaRE, the completeness and utility of the quality metrics included in OQuaRE and the comparison between the results of the manual evaluations done by the experts and the ones obtained by a software implementation of OQuaRE.     

Estimating the motion of plant root cells from in vivo confocal laser scanning microscopy images

Images of cellular structures in growing plant roots acquired using confocal laser scanning microscopy have some unusual properties that make motion estimation challenging. These include multiple motions, non-Gaussian noise and large regions with little spatial structure. In this paper, a method for motion estimation is described that uses a robust multi-frame likelihood model and a technique for estimating uncertainty. An efficient region-based matching approach was used followed by a forward projection method. Over small timescales the dynamics are simple (approximately locally constant) and the change in appearance small. Therefore, a constant local velocity model is used and the MAP estimate of the joint probability over a set of frames is recovered. Occurrences of multiple modes in the posterior are detected, and in the case of a single dominant mode, motion is inferred using Laplace’e method. The method was applied to several Arabidopsis thaliana root growth sequences with varying levels of success. In addition, comparative results are given for three alternative motion estimation approaches, the Kanade–Lucas–Tomasi tracker, Black and Anandan’s robust smoothing method, and Markov random field based methods.     

Distributed synthesis for well-connected architectures

We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External means that the specification only relates input and output variables. We introduce the subclass of uniformly well-connected (UWC) architectures for which there exists a routing allowing each output process to get the values of all inputs it is connected to, as soon as possible. We prove that the distributed synthesis problem is decidable on UWC architectures if and only if the output variables are totally ordered by their knowledge of input variables. We also show that if we extend this class by letting the routing depend on the output process, then the previous decidability result fails. Finally, we provide a natural restriction on specifications under which the whole class of UWC architectures is decidable.     

Assessing Subaquatic Mass Movement Hazards: an Integrated Observational and Hydrodynamic Modelling Approach

Water Resources Management - High-resolution lake and reservoir bathymetric surveys can pinpoint locations that may experience underwater landslides (subaquatic sedimentary mass movements). These...