First- and second-order stimulus length selectivity in New World monkey striate cortex

Motion is a powerful cue for figure-ground segregation, allowing the recognition of shapes even if the luminance and texture characteristics of the stimulus and background are matched. In order to investigate the neural processes underlying early stages of the cue-invariant processing of form, we compared the responses of neurons in the striate cortex (V1) of anaesthetized marmosets to two types of moving stimuli: bars defined by differences in luminance, and bars defined solely by the coherent motion of random patterns that matched the texture and temporal modulation of the background. A population of form-cue-invariant (FCI) neurons was identified, which demonstrated similar tuning to the length of contours defined by first- and second-order cues. FCI neurons were relatively common in the supragranular layers (where they corresponded to 28% of the recorded units), but were absent from layer 4. Most had complex receptive fields, which were significantly larger than those of other V1 neurons. The majority of FCI neurons demonstrated end-inhibition in response to long first- and second-order bars, and were strongly direction selective, Thus, even at the level of V1 there are cells whose variations in response level appear to be determined by the shape and motion of the entire second-order object, rather than by its parts (i.e. the individual textural components). These results are compatible with the existence of an output channel from V1 to the ventral stream of extrastriate areas, which already encodes the basic building blocks of the image in an invariant manner.

Transmission comparison of ultra-long Raman fibre laser based amplification with first and dual order Raman amplification using 10×118 Gbit/s DP-QPSK

Experimental investigations of 10×118 Gbit/s DP-QPSK WDM transmission using three types of distributed Raman amplification techniques are presented. Novel ultra-long Raman fibre laser based amplification with second order counter-propagated pumping is compared with conventional first order and dual order counter-pumped Raman amplification. We demonstrate that URFL based amplification can extend the transmission reach up to a distance of 7520 km in comparison with 5010 km and 6180 km using first order and dual order Raman amplification respectively. © 2014 IEEE.

Representing "Recursive" Default Logic in Modal Logic

The "recursive" definition of Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the "recursive" fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning of the fixed-point is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original "recursive" definition of Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults.

On the Relationships Among Quantified Autoepistemic Logic, its Kernel, and Quantified Reflective Logic

A Quantified Autoepistemic Logic is axiomatized in a monotonic Modal Quantificational Logic whose modal laws are slightly stronger than S5. This Quantified Autoepistemic Logic obeys all the laws of First Order Logic and its L predicate obeys the laws of S5 Modal Logic in every fixed-point. It is proven that this Logic has a kernel not containing L such that L holds for a sentence if and only if that sentence is in the kernel. This result is important because it shows that L is superfluous thereby allowing the ori ginal equivalence to be simplified by eliminating L from it. It is also shown that the Kernel of Quantified Autoepistemic Logic is a generalization of Quantified Reflective Logic, which coincides with it in the propositional case.

Representing Reflective Logic in Modal Logic

The nonmonotonic logic called Reflective Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Reflective Logic with an initial set of axioms and defaults if and only if the meaning of that set of sentences is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original Reflective Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults thus allowing such defaults to produce quantified consequences. Furthermore, this generalization properly treats such quantifiers since all the laws of First Order Logic hold and since both the Barcan Formula and its converse hold.

Representing Default Logic in Modal Logic

The nonmonotonic logic called Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning or rather disquotation of that set of sentences is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults thus allowing such defaults to produce quantified consequences. Furthermore, this generalization properly treats such quantifiers since both the Barcan Formula and its converse hold.

Representing Autoepistemic Logic in Modal Logic

The nonmonotonic logic called Autoepistemic Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Autoepistemic Logic with an initial set of axioms if and only if the meaning or rather disquotation of that set of sentences is logically equivalent to a particular modal functor of the meaning of that initial set of sentences. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and unlike the original Autoepistemic Logic, it is easily generalized to the case where quantified variables may be shared across the scope of modal expressions thus allowing the derivation of quantified consequences. Furthermore, this generalization properly treats such quantifiers since both the Barcan formula and its converse hold.

Linear binocular combination of responses to contrast modulation:contrast-weighted summation in first- and second-order vision

Binocular combination for first-order (luminancedefined) stimuli has been widely studied, but we know rather little about this binocular process for spatial modulations of contrast (second-order stimuli). We used phase-matching and amplitude-matching tasks to assess binocular combination of second-order phase and modulation depth simultaneously. With fixed modulation in one eye, we found that binocularly perceived phase was shifted, and perceived amplitude increased almost linearly as modulation depth in the other eye increased. At larger disparities, the phase shift was larger and the amplitude change was smaller. The degree of interocular correlation of the carriers had no influence. These results can be explained by an initial extraction of the contrast envelopes before binocular combination (consistent with the lack of dependence on carrier correlation) followed by a weighted linear summation of second-order modulations in which the weights (gains) for each eye are driven by the first-order carrier contrasts as previously found for first-order binocular combination. Perceived modulation depth fell markedly with increasing phase disparity unlike previous findings that perceived first-order contrast was almost independent of phase disparity. We present a simple revision to a widely used interocular gain-control theory that unifies first- and second-order binocular summation with a single principle-contrast-weighted summation-and we further elaborate the model for first-order combination. Conclusion: Second-order combination is controlled by first-order contrast.

Using bifurcations in the determination of lock-in ranges for third-order phase-locked loops

Transmission and switching in digital telecommunication networks require distribution of precise time signals among the nodes. Commercial systems usually adopt a master-slave (MS) clock distribution strategy building slave nodes with phase-locked loop (PLL) circuits. PLLs are responsible for synchronizing their local oscillations with signals from master nodes, providing reliable clocks in all nodes. The dynamics of a PLL is described by an ordinary nonlinear differential equation, with order one plus the order of its internal linear low-pass filter. Second-order loops are commonly used because their synchronous state is asymptotically stable and the lock-in range and design parameters are expressed by a linear equivalent system [Gardner FM. Phaselock techniques. New York: John Wiley & Sons: 1979]. In spite of being simple and robust, second-order PLLs frequently present double-frequency terms in PD output and it is very difficult to adapt a first-order filter in order to cut off these components [Piqueira JRC, Monteiro LHA. Considering second-harmonic terms in the operation of the phase detector for second order phase-locked loop. IEEE Trans Circuits Syst [2003;50(6):805-9; Piqueira JRC, Monteiro LHA. All-pole phase-locked loops: calculating lock-in range by using Evan`s root-locus. Int J Control 2006;79(7):822-9]. Consequently, higher-order filters are used, resulting in nonlinear loops with order greater than 2. Such systems, due to high order and nonlinear terms, depending on parameters combinations, can present some undesirable behaviors, resulting from bifurcations, as error oscillation and chaos, decreasing synchronization ranges. In this work, we consider a second-order Sallen-Key loop filter [van Valkenburg ME. Analog filter design. New York: Holt, Rinehart & Winston; 1982] implying a third order PLL The resulting lock-in range of the third-order PLL is determined by two bifurcation conditions: a saddle-node and a Hopf. (C) 2008 Elsevier B.V. All rights reserved.

A Sensorless PMDC Motor Speed Controller with a Logical Overcurrent Protection

A method to control the speed or the torque of a permanent-magnet direct current motor is presented. The rotor speed and the external torque estimation are simultaneously provided by appropriate observers. The sensorless control scheme is based on current measurement and switching states of power devices. The observer’s performances are dependent on the accurate machine parameters knowledge. Sliding mode control approach was adopted for drive control, providing the suitable switching states to the chopper power devices. Despite the predictable chattering, a convenient first order switching function was considered enough to define the sliding surface and to correspond with the desired control specifications and drive performance. The experimental implementation was supported on a single dsPIC and the controller includes a logic overcurrent protection.

Biaxial Nematic Order in the Hard-boomerang Fluid

We consider a fluid of hard boomerangs, each composed of two hard spherocylinders joined at their ends at an angle Psi. The resulting particle is nonconvex and biaxial. The occurence of nematic order in such a system has been investigated using Straley's theory, which is a simplificaton of Onsager's second-virial treatment of long hard rods, and by bifurcation analysis. The excluded volume of two hard boomerangs has been approximated by the sum of excluded volumes of pairs of constituent spherocylinders, and the angle-dependent second-virial coefficient has been replaced by a low-order interpolating function. At the so-called Landau point, Psi(Landau)approximate to 107.4 degrees, the fluid undergoes a continuous transition from the isotropic to a biaxial nematic (B) phase. For Psi not equal Psi(Landau) ordering is via a first-order transition into a rod-like uniaxial nematic phase (N(+)) if Psi > Psi(Landau), or a plate-like uniaxial nematic (N(-)) phase if Psi < Psi(Landau). The B phase is separated from the N(+) and N(-) phases by two lines of continuous transitions meeting at the Landau point. This topology of the phase diagram is in agreement with previous studies of spheroplatelets and biaxial ellipsoids. We have checked the accuracy of our theory by performing numerical calculations of the angle-dependent second virial coefficient, which yields Psi(Landau)approximate to 110 degrees for very long rods, and Psi(Landau)approximate to 90 degrees for short rods. In the latter case, the I-N transitions occur at unphysically high packing fractions, reflecting the inappropriateness of the second-virial approximation in this limit.

Fractional order modelling of fractional-order holds

Discrete time control systems require sample- and-hold circuits to perform the conversion from digital to analog. Fractional-Order Holds (FROHs) are an interpolation between the classical zero and first order holds and can be tuned to produce better system performance. However, the model of the FROH is somewhat hermetic and the design of the system becomes unnecessarily complicated. This paper addresses the modelling of the FROHs using the concepts of Fractional Calculus (FC). For this purpose, two simple fractional-order approximations are proposed whose parameters are estimated by a genetic algorithm. The results are simple to interpret, demonstrating that FC is a useful tool for the analysis of these devices.

Analysis of sandwich beam structures using kriging based higher order models

Functionally graded composite materials can provide continuously varying properties, which distribution can vary according to a specific location within the composite. More frequently, functionally graded materials consider a through thickness variation law, which can be more or less smoother, possessing however an important characteristic which is the continuous properties variation profiles, which eliminate the abrupt stresses discontinuities found on laminated composites. This study aims to analyze the transient dynamic behavior of sandwich structures, having a metallic core and functionally graded outer layers. To this purpose, the properties of the particulate composite metal-ceramic outer layers, are estimated using Mod-Tanaka scheme and the dynamic analyses considers first order and higher order shear deformation theories implemented though kriging finite element method. The transient dynamic response of these structures is carried out through Bossak-Newmark method. The illustrative cases presented in this work, consider the influence of the shape functions interpolation domain, the properties through-thickness distribution, the influence of considering different materials, aspect ratios and boundary conditions. (C) 2014 Elsevier Ltd. All rights reserved.

Refinement in hybridised institutions

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Sharpened lower bounds for cut elimination

We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower bounds for eliminating cuts from a proof established superexponential lower bounds as a stack of exponentials, with the height of the stack proportional to the maximum depth d of the formulas in the original proof. Our new lower bounds remove the constant of proportionality, giving an exponential stack of height equal to d − O(1). The proof method is based on more efficiently expressing the Gentzen-Solovay cut formulas as low depth formulas.