Sensor fault-resilient control of interior permanent-magnet synchronous motor drives

In a conventional ac motor drive using field-oriented control, a dc-link voltage, speed, and at least two current sensors are required. Hence, in the event of sensor failure, the performance of the drive system can be severely compromised. This paper presents a sensor fault-tolerant control strategy for interior permanent-magnet synchronous motor (IPMSM) drives. Three independent observers are proposed to estimate the speed, dc-link voltage, and currents of the machine. If a sensor fault is detected, the drive system isolates the faulty sensor while retaining the remaining functional ones. The signal is then acquired from the corresponding observer in order to maintain the operation of the drive system. The experimental results provided verify the effectiveness of the proposed approach.

Differential expression of NADPH-diaphorase between electrophysiologically-defined classes of pyramidal neurons in rat ventral subiculum, in vitro

The subiculum is the major output region of the hippocampal formation. We have studied pyramidal neurons in slices of rat ventral subiculum to determine if there is a correlation between nicotinamide adenine dinucleotide phosphate-diaphorase (NADPH-d) activity and electrophysiological phenotype. The majority of NADPH-d-positive pyramidal neurons were found in the superficial cell layer (i.e. nearest to the hippocampal fissure) of the subiculum and appreciable NADPH-d activity was absent from pyramidal neurons in area CA1. This distribution of NADPH-d activity was mimicked by that of immunoreactivity for the neuronal isoform of nitric oxide synthase. Subicular pyramidal neurons were classified, electrophysiologically, as intrinsically burst-firing or regular spiking. After electrophysiological characterization, neurons were filled with Neurobiotin and revealed using fluorescence immunocytochemistry. The slices containing these neurons were also processed for NADPH-d. NADPH-d activity was found in six out of eight regular spiking neurons but was not found in any of 13 intrinsically burst-firing neurons (P=0.0008, Fisher's Exact Test). We conclude that in rat ventral subiculum, NADPH-d activity is present in a proportion of pyramidal neurons and indicates the presence of the neuronal isoform of nitric oxide synthase. Furthermore, amongst pyramidal neurons, NADPH-d activity is distributed preferentially to those with the regular spiking phenotype. The distribution of regular spiking neurons suggests that they may not be present to the same extent in all subicular output pathways. Thus, the actions of nitric oxide may be relatively specific to particular hippocampal connections.

Recursive actuator fault detection and diagnosis for emergency landing of UASs

This paper presents a practical recursive fault detection and diagnosis (FDD) scheme for online identification of actuator faults for unmanned aerial systems (UASs) based on the unscented Kalman filtering (UKF) method. The proposed FDD algorithm aims to monitor health status of actuators and provide indication of actuator faults with reliability, offering necessary information for the design of fault-tolerant flight control systems to compensate for side-effects and improve fail-safe capability when actuator faults occur. The fault detection is conducted by designing separate UKFs to detect aileron and elevator faults using a nonlinear six degree-of-freedom (DOF) UAS model. The fault diagnosis is achieved by isolating true faults by using the Bayesian Classifier (BC) method together with a decision criterion to avoid false alarms. High-fidelity simulations with and without measurement noise are conducted with practical constraints considered for typical actuator fault scenarios, and the proposed FDD exhibits consistent effectiveness in identifying occurrence of actuator faults, verifying its suitability for integration into the design of fault-tolerant flight control systems for emergency landing of UASs.

A sensor fault detection and isolation method in interior permanent-magnet synchronous motor drives based on an extended Kalman filter

Interior permanent-magnet synchronous motors (IPMSMs) become attractive candidates in modern hybrid electric vehicles and industrial applications. Usually, to obtain good control performance, the electric drives of this kind of motor require one position, one dc link, and at least two current sensors. Failure of any of these sensors might lead to degraded system performance or even instability. As such, sensor fault resilient control becomes a very important issue in modern drive systems. This paper proposes a novel sensor fault detection and isolation algorithm based on an extended Kalman filter. It is robust to system random noise and efficient in real-time implementation. Moreover, the proposed algorithm is compact and can detect and isolate all the sensor faults for IPMSM drives. Thorough theoretical analysis is provided, and the effectiveness of the proposed approach is proven by extensive experimental results.

Bone sialoprotein supports breast cancer cell adhesion proliferation and migration through differential usage of the αvβ3 and αvβ5 integrins

Bone sialoprotein (BSP), a secreted glycoprotein found in bone matrix, has been implicated in the formation of mammary microcalcifications and osteotropic metastasis of human breast cancer (HBC). BSP possesses an integrin-binding RGD (Arg-Gly-Asp) domain, which may promote interactions between HBC cells and bone extracellular matrix. Purified BSP, recombinant human BSP fragments and BSP-derived RGD peptides are shown to elicit migratory, adhesive, and proliferative responses in the MDA-MB-231 HBC cell line. Recombinant BSP fragment analysis localized a significant component of these activities to the RGD domain of the protein, and synthetic RGD peptides with BSP flanking sequences (BSPRGD) also conferred these responses. The fibronectin-derived RGD counterpart, GRGDSP (Gly-Arg-Gly-Asp-Ser-Pro), could not support these cellular responses, emphasizing specificity of the BSP configuration. Although most of the proliferative and adhesive responses could be attributed to RGD interactions, these interactions were only partly responsible for the migrational responses. Experiments with integrin-blocking antibodies demonstrated that BSP-RGD-induced migration utilizes the αvβ3 vitronectin receptor, whereas adhesion and proliferation responses were αvβ5-mediated. Using fluorescence activated cell sorting, we selected two separate subpopulations of MDA-MB-231 cells enriched for αvβ3 or αvβ5 respectively. Although some expression of the alternate αv integrin was still retained, the αvβ5-enriched MDA-MB-231 cells showed enhanced proliferative and adhesive responses, whereas the αvβ3-enriched subpopulation was suppressed for proliferation and adhesion, but showed enhanced migratory responses to BSP-RGD. In addition, similar analysis of two other HBC cell lines showed less marked, but similar RGD-dependent trends in adhesion and proliferation to the BSP fragments. Collectively, these data demonstrate BSP effects on proliferative, migratory, and adhesive functions in HBC cells and that the RGD-mediated component differentially employs αvβ3 and αvβ5 integrin receptors.

Differential effects of aging on spatial learning through exploratory navigation and map reading

It has been shown that abilities in spatial learning and memory are adversely affected by aging. The present study was conducted to investigate whether increasing age has equal consequences for all types of spatial learning or impacts certain types of spatial learning selectively. Specifically, two major types of spatial learning, exploratory navigation and map reading, were contrasted. By combining a neuroimaging finding that the medial temporal lobe (MTL) is especially important for exploratory navigation and a neurological finding that the MTL is susceptible to age-related atrophy, it was hypothesized that spatial learning through exploratory navigation would exhibit a greater decline in later life than spatial learning through map reading. In an experiment, young and senior participants learned locations of landmarks in virtual environments either by navigating in them in the first-person perspective or by seeing aerial views of the environments. Results showed that senior participants acquired less accurate memories of the layouts of landmarks than young participants when they navigated in the environments, but the two groups did not differ in spatial learning performance when they viewed the environments from the aerial perspective. These results suggest that spatial learning through exploratory navigation is particularly vulnerable to adverse effects of aging, whereas elderly adults may be able to maintain their map reading skills relatively well.

An attack-localizing watermarking scheme for natural language documents

We present a text watermarking scheme that embeds a bitstream watermark Wi in a text document P preserving the meaning, context, and flow of the document. The document is viewed as a set of paragraphs, each paragraph being a set of sentences. The sequence of paragraphs and sentences used to embed watermark bits is permuted using a secret key. Then, English language sentence transformations are used to modify sentence lengths, thus embedding watermarking bits in the Least Significant Bits (LSB) of the sentences’ cardinalities. The embedding and extracting algorithms are public, while the secrecy and security of the watermark depends on a secret key K. The probability of False Positives is extremely small, hence avoiding incidental occurrences of our watermark in random text documents. Majority voting provides security against text addition, deletion, and swapping attacks, further reducing the probability of False Positives. The scheme is secure against the general attacks on text watermarks such as reproduction (photocopying, FAX), reformatting, synonym substitution, text addition, text deletion, text swapping, paragraph shuffling and collusion attacks.

Converse results to the Wiener attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-exponent d from the public key (N,e) as long as d < N 1/4. Interestingly, Wiener stated that his attack may sometimes also work when d is slightly larger than N 1/4. This raises the question of how much larger d can be: could the attack work with non-negligible probability for d=N 1/4 + ρ for some constant ρ > 0? We answer this question in the negative by proving a converse to Wiener’s result. Our result shows that, for any fixed ε > 0 and all sufficiently large modulus lengths, Wiener’s attack succeeds with negligible probability over a random choice of d < N δ (in an interval of size Ω(N δ )) as soon as δ > 1/4 + ε. Thus Wiener’s success bound dattack, which are guaranteed to succeed even when δ > 1/4. The known attacks in this class (by Verheul and Van Tilborg and Dujella) run in exponential time, so it is natural to ask whether there exists an attack in this class with subexponential run-time. Our second converse result answers this question also in the negative.

Crossword puzzle attack on NLS

NLS is one of the stream ciphers submitted to the eSTREAM project. We present a distinguishing attack on NLS by Crossword Puzzle (CP) attack method which is introduced in this paper. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we present the graph showing how the bias of distinguisher vary with Konst. In result, we estimate the bias of the distinguisher to be around O(2^−30). Therefore, we claim that NLS is distinguishable from truly random cipher after observing O(2^60) keystream words. The experiments also show that our distinguishing attack is successful on 90.3% of Konst among 2^32 possible values. We extend the CP attack to NLSv2 which is a tweaked version of NLS. In result, we build a distinguisher which has the bias of around 2− 48. Even though this attack is below the eSTREAM criteria (2^−40), the security margin of NLSv2 seems to be too low.

Cryptanalysis of block ciphers with overdefined systems of equations

Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on probabilistic characteristics, which makes their security grow exponentially with the number of rounds N r r. In this paper we study the security of such ciphers under an additional hypothesis: the S-box can be described by an overdefined system of algebraic equations (true with probability 1). We show that this is true for both Serpent (due to a small size of S-boxes) and Rijndael (due to unexpected algebraic properties). We study general methods known for solving overdefined systems of equations, such as XL from Eurocrypt’00, and show their inefficiency. Then we introduce a new method called XSL that uses the sparsity of the equations and their specific structure. The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly with the number of rounds. The XSL attack would then be polynomial (or subexponential) in N r> , with a huge constant that is double-exponential in the size of the S-box. The exact complexity of such attacks is not known due to the redundant equations. Though the presented version of the XSL attack always gives always more than the exhaustive search for Rijndael, it seems to (marginally) break 256-bit Serpent. We suggest a new criterion for design of S-boxes in block ciphers: they should not be describable by a system of polynomial equations that is too small or too overdefined.

Distinguishing attack on SOBER-128 with linear masking

We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2^− − 8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We also show that the bias of the distinguisher can be improved (or estimated more precisely) by considering quadratic terms of the approximation. The probability bias of the quadratic approximation used in the distinguisher is estimated to be equal to O(2^− − 51.8), so that we claim that SOBER-128 is distinguishable from truly random cipher by observing O(2^103.6) keystream words.

Condition monitoring and fault diagnosis of diesel engines using instantaneous angular speed analysis

Continuous monitoring of diesel engine performance is critical for early detection of fault developments in an engine before they materialize into a functional failure. Instantaneous crank angular speed (IAS) analysis is one of a few nonintrusive condition monitoring techniques that can be utilized for such a task. Furthermore, the technique is more suitable for mass industry deployments than other non-intrusive methods such as vibration and acoustic emission techniques due to the low instrumentation cost, smaller data size and robust signal clarity since IAS is not affected by the engine operation noise and noise from the surrounding environment. A combination of IAS and order analysis was employed in this experimental study and the major order component of the IAS spectrum was used for engine loading estimation and fault diagnosis of a four-stroke four-cylinder diesel engine. It was shown that IAS analysis can provide useful information about engine speed variation caused by changing piston momentum and crankshaft acceleration during the engine combustion process. It was also found that the major order component of the IAS spectra directly associated with the engine firing frequency (at twice the mean shaft rotating speed) can be utilized to estimate engine loading condition regardless of whether the engine is operating at healthy condition or with faults. The amplitude of this order component follows a distinctive exponential curve as the loading condition changes. A mathematical relationship was then established in the paper to estimate the engine power output based on the amplitude of this order component of the IAS spectrum. It was further illustrated that IAS technique can be employed for the detection of a simulated exhaust valve fault in this study.

Examples illustrating the use of renormalization techniques for singularly perturbed differential equations

With nine examples, we seek to illustrate the utility of the Renormalization Group approach as a unification of other asymptotic and perturbation methods.

Extending FORK-256 attack to the full hash function

In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for the compression function, but in practice the attack could not be extended to the full function due to large memory requirements and computation time. In this paper we improve the attack and show that it is possible to find near-collisions in practice for any given value of IV. In particular, this means that the full hash function with the prespecified IV is vulnerable in practice, not just in theory. We exhibit an example near-collision for the complete hash function.