The Complexity of Compressed Membership Problems for Finite Automata

In this paper, a compressed membership problem for finite automata, both deterministic (DFAs) and non-deterministic (NFAs), with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is employed: the SLPs are recompressed, so that substrings of the input word are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. Furthermore, in order to reflect the recompression in the NFA, we need to modify it only a little, in particular its size stays polynomial in the input size. Using this technique it is shown that the compressed membership for NFA with compressed labels is in NP, thus confirming the conjecture of Plandowski and Rytter (Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999) and extending the partial result of Lohrey and Mathissen (in CSR, LNCS, vol. 6651, pp. 275–288, Springer, Berlin, 2011); as this problem is known to be NP-hard (in Plandowski and Rytter, Jewels Are Forever, pp. 262–272, Springer, Berlin, 1999), we settle its exact computational complexity. Moreover, the same technique applied to the compressed membership for DFA with compressed labels yields that this problem is in P, and this problem is known to be P-hard (in Markey and Schnoebelen, Inf. Process. Lett. 90(1):3–6, 2004; Beaudry et al., SIAM J. Comput. 26(1):138–152, 1997).     

Domain-specific discrete event modelling and simulation using graph transformation

Graph transformation is being increasingly used to express the semantics of domain-specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time to accurately represent the behaviour of a real system and to obtain useful simulation metrics to measure throughputs, utilization times and average delays. Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and provide rules with the ability to schedule the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches and provide an implementation on top of the rewriting logic system Maude.     

Simple approach for the plasma treatment of polymeric membranes and investigation of the aging effect

The modification of the surface characteristics after treatment with plasma in polymeric materials, such as the aging phenomenon, calls the attention of research in the area of nonthermal plasma technology. In this work, a direct treatment with dielectric-barrier discharge plasma was used on the surfaces of ultrafiltration membranes. The measurements of the contact angle with water, attenuated total reflectance accessory, zeta potential, atomic force microscopy and scanning electron microscopy-MEV were performed on the surfaces to verify changes after plasma treatment and to understand the occurrence and timing of the plasma aging effect. In the analysis of the membrane performance, hydraulic permeation and protein retention tests were performed. The results showed an improvement in wettability and hydrophilic properties in the post-treated membranes. The study of reversibility/aging of the post-plasma surface is important for research that deals with the modification of polymeric membranes. Changes in surface morphology, topography and wettability of the membranes were observed up to seven days after treatment, with a tendency to return to the initial characteristics of the membranes.     

Characterization of magnetic materials using a scanning microwave microprobe

We investigated the electromagnetic properties of metals of iron, nickel, cobalt, aluminum, gold, copper, silver, and permalloy thin films on SiO(2) substrates using a near-field microwave microprobe. The electromagnetic properties of metal sheets were estimated by measuring the microwave reflection coefficient S(11) and compared with the theoretical values. We observed the hysteresis behavior of permalloy thin films on SiO(2) substrates using a near-field scanning microwave microprobes (NSMM) system. Experimental results are in good agreement with the theoretical model of transmission theory. In order to better characterize the electromagnetic properties of metals and magnetic metals instead of the usual method, we take advantage of the noncontact microprobing evaluation capabilities using a near-field microwave.     

Sensorless vector controller for a synchronous reluctance motor

A new high-performance sensorless speed vector controller that implements the maximum torque per ampere control strategy for the inverter-driven synchronous reluctance machine is presented in this paper. It is based on a parameter-dependent technique for online estimation of rotor position and angular velocity at the control rate. The current ripple principle is used to estimate position. The estimates are fed to a conventional closed-loop observer to predict the new position and angular velocity. The very high accuracy of the sensorless control algorithm at both low and high speeds is confirmed by experimental results     

Improved likelihood inference in Birnbaum-Saunders regressions

The Birnbaum-Saunders regression model is commonly used in reliability studies. We address the issue of performing inference in this class of models when the number of observations is small. Our simulation results suggest that the likelihood ratio test tends to be liberal when the sample size is small. We obtain a correction factor which reduces the size distortion of the test. Also, we consider a parametric bootstrap scheme to obtain improved critical values and improved p-values for the likelihood ratio test. The numerical results show that the modified tests are more reliable in finite samples than the usual likelihood ratio test. We also present an empirical application.