Optimal detection of visual evoked potentials

The authors consider the problem of detecting visual evoked potentials (VEP's). A matched subspace filter is applied to the detection of the VEP and is demonstrated to perform better than a number of other evoked potential detectors. Unlike single-harmonic detectors, the matched subspace filter (MSF) detector is suitable for detecting multiharmonic VEP's. Moreover, the MSF is optimal in the uniformly most powerful sense for multiharmonic signals with unknown noise variance     

Output feedback trajectory stabilization of the uncertainty DC servomechanism system

This work proposes a solution for the output feedback trajectory-tracking problem in the case of an uncertain DC servomechanism system. The system consists of a pendulum actuated by a DC motor and subject to a time-varying bounded disturbance. The control law consists of a Proportional Derivative controller and an uncertain estimator that allows compensating the effects of the unknown bounded perturbation. Because the motor velocity state is not available from measurements, a second-order sliding-mode observer permits the estimation of this variable in finite time. This last feature allows applying the Separation Principle. The convergence analysis is carried out by means of the Lyapunov method. Results obtained from numerical simulations and experiments in a laboratory prototype show the performance of the closed loop system.     

Smooth Shape‐Aware Functions with Controlled Extrema

Functions that optimize Laplacian‐based energies have become popular in geometry processing, e.g. for shape deformation, smoothing, multiscale kernel construction and interpolation. Minimizers of Dirichlet energies, or solutions of Laplace equations, are harmonic functions that enjoy the maximum principle, ensuring no spurious local extrema in the interior of the solved domain occur. However, these functions are only C⁰ at the constrained points, which often causes smoothness problems. For this reason, many applications optimize higher‐order Laplacian energies such as biharmonic or triharmonic. Their minimizers exhibit increasing orders of continuity but lose the maximum principle and show oscillations. In this work, we identify characteristic artifacts caused by spurious local extrema, and provide a framework for minimizing quadratic energies on manifolds while constraining the solution to obey the maximum principle in the solved region. Our framework allows the user to specify locations and values of desired local maxima and minima, while preventing any other local extrema. We demonstrate our method on the smoothness energies corresponding to popular polyharmonic functions and show its usefulness for fast handle‐based shape deformation, controllable color diffusion, and topologically‐constrained data smoothing.     

An analysis and design method for linear systems under nested saturation

This paper considers a linear system under nested saturation. Nested saturation arises, for example, when the actuator is subject to magnitude and rate saturation simultaneously. A condition is derived in terms of a set of auxiliary feedback gains for determining if a given ellipsoid is contractively invariant. Moreover, this condition is shown to be equivalent to linear matrix inequalities (LMIs) in the actual and auxiliary feedback gains. As a result, the estimation of the domain of attraction for a given set of feedback gains can be formulated as an optimization problem with LMI constraints. By viewing the feedback gains as extra free parameters, the optimization problem can be used for controller design.     

Forgiveness and Conflict Resolution in Marriage.

Two studies examined whether forgiveness in married couples is associated with better conflict resolution. Study 1 examined couples in their 3rd year of marriage and identified 2 forgiveness dimensions (retaliation and benevolence). Husbands' retaliatory motivation was a significant predictor of poorer wife-reported conflict resolution, whereas wives' benevolence motivation predicted husbands' reports of better conflict resolution. Examining longer term marriages, Study 2 identified three forgiveness dimensions (retaliation, avoidance and benevolence). Whereas wives' benevolence again predicted better conflict resolution, husbands' avoidance predicted wives' reports of poorer conflict resolution. All findings were independent of both spouses' marital satisfaction. The findings are discussed in terms of the importance of forgiveness for marital conflict and its implications for spouse goals. Future research directions on forgiveness are outlined. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Kozak Similarity Score Algorithm Identifies Alternative Translation Initiation Codons Implicated in Cancers

Ribosome profiling and mass spectroscopy have identified canonical and noncanonical translation initiation codons (TICs) that are upstream of the main translation initiation site and used to translate oncogenic proteins. There have previously been conflicting reports about the patterns of nucleotides that surround noncanonical TICs. Here, we use a Kozak Similarity Score algorithm to find that nearly all of these TICs have flanking nucleotides closely matching the Kozak sequence. Remarkably, the nucleotides flanking alternative noncanonical TICs are frequently closer to the Kozak sequence than the nucleotides flanking TICs used to translate the gene’s main protein. Of note, the 5′ untranslated region (5‘UTR) of cancer-associated genes with an upstream TIC tend to be significantly longer than the same region in genes not associated with cancer. The presence of a longer-than-typical 5′UTR increases the likelihood of ribosome binding to upstream noncanonical TICs, and may be a distinguishing feature of a number of genes overexpressed in cancer. Noncanonical TICs that are located in the 5′UTR, although thought by some to be disadvantageous and suppressed by evolution, may translate oncogenic proteins because of their flanking nucleotides.     

Adaptive Threat Modeling for Secure Ad Hoc Routing Protocols

Secure routing protocols for mobile ad hoc networks provide the required functionality for proper network operation. If the underlying routing protocol cannot be trusted to follow the protocol operations, additional trust layers, such as authentication, cannot be obtained. Threat models drive analysis capabilities, affecting how we evaluate trust. Current attacker threat models limit the results obtained during protocol security analysis over ad hoc routing protocols. Developing a proper threat model to evaluate security properties in mobile ad hoc routing protocols presents a significant challenge. If the attacker strength is too weak, we miss vital security flaws. If the attacker strength is too strong, we cannot identify the minimum required attacker capabilities needed to break the routing protocol. In this paper we present an adaptive threat model to evaluate route discovery attacks against ad hoc routing protocols. Our approach enables us to evaluate trust in the ad hoc routing process and allows us to identify minimum requirements an attacker needs to break a given routing protocol.