e present a heuristic control theory model that describes smoking under restricted and unrestricted access to cigarettes. The model is based on the allostasis theory and uses a formal representation of a multiscale opponent process. The model simulates smoking behavior of an individual and produces both short-term (“loading up” after not smoking for a while) and long-term smoking patterns (e.g., gradual transition from a few cigarettes to one pack a day). By introducing a formal representation of withdrawal- and craving-like processes, the model produces gradual increases over time in withdrawal- and craving-like signals associated with abstinence and shows that after 3 months of abstinence, craving disappears. The model was programmed as a computer application allowing users to select simulation scenarios. The application links images of brain regions that are activated during the binge/intoxication, withdrawal, or craving with corresponding simulated states. The model was calibrated to represent smoking patterns described in peer-reviewed literature; however, it is generic enough to be adapted to other drugs, including cocaine and opioids. Although the model does not mechanistically describe specific neurobiological processes, it can be useful in prevention and treatment practices as an illustration of drug-using behaviors and expected dynamics of withdrawal and craving during abstinence.
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph (Formula presented.), with local rewards (Formula presented.), and three types of positions: black (Formula presented.), white (Formula presented.), and random (Formula presented.) forming a partition of V. It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, even when (Formula presented.). In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability. In this short note, we show that BWR-games can be solved via convex programming in pseudo-polynomial time if the number of random positions is a constant.
We design temporal description logics (TDLs) suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (ℤ, <), satisfying the constant domain assumption. Concept and role inclusions of the TBox hold at all moments of time (globally), and data assertions of the ABox hold at specified moments of time. To express temporal constraints of conceptual data models, the languages are equipped with flexible and rigid roles, standard future and past temporal operators on concepts, and operators “always” and “sometime” on roles. The most expressive of our TDLs (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turns out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions, we construct logics whose complexity ranges between NLogSpace and PSpace. These positive results are obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models.
The rank and symmetric rank of a symmetric tensor may differ.
We study horizontal streaming excited by means of a low-frequency and low-intensity acoustic wave in 2D freely suspended films of thermotropic smectic liquid crystals. Acoustic pressure induces fast periodic transverse oscillations of the film, which produce in-plane stationary couples of vortices slowly rotating in opposite directions owing to hydrodynamic nonlinearity. The parameters of the vortices are measured using a new method, based on tracking solidlike disk-shaped islands. The horizontal motion occurs only when the amplitude of the acoustic pressure exceeds the threshold value, which can be explained by Bingham-like behavior of the smectic film. The measurements above threshold are in good agreement with existing theoretical predictions. We demonstrate experimentally that in-plane flow is well controlled by changing the acoustic pressure, excitation frequency, and geometry of the film. The observations open the way to using the phenomenon in nondisplay applications.
Research into neurobiological mechanisms of morphosyntactic processing of language has suggested specialised systems for decomposition and storage, which are used flexibly during the processing of complex polymorphemic words (such as those formed through affixation, e.g., boy + s = noun + plural marker or boy + ish = noun plus attenuator). However, neural underpinnings of acquisition of novel morphology are still unknown. We implicitly trained our participants with new derivational affixes through a word–picture association task and investigated the neural processes underlying formation of neural memory traces for new affixes. The participants' brain activity was recorded using magnetoencephalography (MEG), as they passively listened to the newly trained and untrained suffixes combined with real word and pseudoword stems. The MEG recording was repeated after a night's sleep using the same stimuli, to test the effects of overnight consolidation. The newly trained suffixes combined with real stems elicited stronger source activity in the left inferior frontal gyrus (LIFG) at ∼50 msec after the suffix onset than untrained suffixes, suggesting memory trace formation for the newly learned suffixes already on the same day. The following day, the suffix learning effect spread to the left superior temporal gyrus (STG) where it was again manifest as a response enhancement, particularly at ∼200–300 msec after the suffix onset, which might reflect an additional effect of overnight consolidation. Overall, the results demonstrate the rapid and dynamic processes of both immediate build-up and longer-term consolidation of neocortical memory traces for novel morphology, taking place after a short period of exposure to novel morphology and involving fronto-temporal perisylvian language circuitry.
Let Γ be an arithmetic group of affine automorphisms of the n-dimensional future tube T. It is proved that the quotient space T/Γ is smooth at infinity if and only if the group Γ is generated by reflections and the fundamental polyhedral cone (“Weyl chamber”) of the group dΓ in the future cone is a simplicial cone (which is possible only for n ≤ 10). As a consequence of this result, a smoothness criterion for the Satake–Baily–Borel compactification of an arithmetic quotient of a symmetric domain of type IV is obtained.