Increased opioid dependence in a mouse model of panic disorder

[EN] Panic disorder is a highly prevalent neuropsychiatric disorder that shows co-occurrence with substance abuse. Here, we demonstrate that TrkC, the high-affinity receptor for neurotrophin-3, is a key molecule involved in panic disorder and opiate dependence, using a transgenic mouse model (TgNTRK3). Constitutive TrkC overexpression in TgNTRK3 mice dramatically alters spontaneous firing rates of locus coeruleus (LC) neurons and the response of the noradrenergic system to chronic opiate exposure, possibly related to the altered regulation of neurotrophic peptides observed. Notably, TgNTRK3 LC neurons showed an increased firing rate in saline-treated conditions and profound abnormalities in their response to met5-enkephalin. Behaviorally, chronic morphine administration induced a significantly increased withdrawal syndrome in TgNTRK3 mice. In conclusion, we show here that the NT-3/TrkC system is an important regulator of neuronal firing in LC and could contribute to the adaptations of the noradrenergic system in response to chronic opiate exposure. Moreover, our results indicate that TrkC is involved in the molecular and cellular changes in noradrenergic neurons underlying both panic attacks and opiate dependence and support a functional endogenous opioid deficit in panic disorder patients.

Conservation Biology of Elasmobranchs

Elasmobranchs are vital and valuable components of the marine biota. From an ecological perspective they occupy the role of top predators within marine food webs, providing a regulatory control that helps balance the ecosystem. From an evolutionary perspective, this group represents an early divergence along the vertebrate line that produced many unusual, but highly successful, adaptations in function and form. From man's perspective, elasmobranchs have been considered both an unavoidable nuisance, and an exploitable fishery resource. A few of the large shark species have earned a dubious notoriety because of sporadic attacks on humans that occur in coastal areas each year worldwide; the hysteria surrounding an encounter with a shark can be costly to the tourist industry. More importantly, elasmobranchs are often considered a detriment to commercial fishing operations; they cause significant economic damage to catches and fishing gear. On the other hand, consumer attitudes have changed concerning many previously unpopular food fishes, including elasmobranchs, and this group of fishes has been increasingly used by both recreational and commercial fishing interests. Many elasmobranchs have become a popular target of recreational fishermen for food and sport because of their abundance, size, and availability in coastal waters. Similarly, commercial fisheries for elasmobranchs have developed or expanded from an increased demand for elasmobranch food products. (PDF file contains 108 pages.)

Variability of Temperature and Salinity in the Middle Atlantic Bight and Gulf of Maine

Monitoring of the waters of the Middle Atlantic Bight and Gulf of Maine has been conducted by the MARMAP Ships of Opportunity Program since the early 1970's. Presented in this atlas are portrayals of the temporal and spatial patterns of surface and bottom temperature and surface salinity for these areas during the period 1978-1990. These patterns are shown in the form of time-space diagrams for single-year and multiyear (base period) time frames. Each base period figure shows thirteen-year (1978-1990) mean conditions, sample variance in the form of standard deviations of the measured values, and data locations. Each single-year figure displays annual conditions, sampling locations, and departures of annual conditions from the thirteen-year means, expressed as algebraic anomalies and standardized anomalies. (PDF file contains 112 pages.)

INTERPOL's surveillance network in curbing transnational terrorism

This paper investigates the role that INTERPOL surveillance – the Mobile INTERPOL Network Database (MIND) and the Fixed INTERPOL Network Database (FIND) – played in the War on Terror since its inception in 2005. MIND/FIND surveillance allows countries to screen people and documents systematically at border crossings against INTERPOL databases on terrorists, fugitives, and stolen and lost travel documents. Such documents have been used in the past by terrorists to transit borders. By applying methods developed in the treatment-effects literature, this paper establishes that countries adopting MIND/FIND experienced fewer transnational terrorist attacks than had they not adopted MIND/FIND. Our estimates indicate that, on average, during 2008–2011, adopting and using MIND/FIND results in 1.23 fewer transnational terrorist incidents each year per 100 million people. Thus, a country like France with a population just above 64 million people in 2008 would have 0.79 fewer transnational terrorist incidents per year owing to its use of INTERPOL surveillance. For most treatment countries, this amounts to a sizeable proportional reduction of about 60 per cent.

Adaptive Scalable SVD Unit for Fast Processing of Large LSE Problems

Singular Value Decomposition (SVD) is a key linear algebraic operation in many scientific and engineering applications. In particular, many computational intelligence systems rely on machine learning methods involving high dimensionality datasets that have to be fast processed for real-time adaptability. In this paper we describe a practical FPGA (Field Programmable Gate Array) implementation of a SVD processor for accelerating the solution of large LSE problems. The design approach has been comprehensive, from the algorithmic refinement to the numerical analysis to the customization for an efficient hardware realization. The processing scheme rests on an adaptive vector rotation evaluator for error regularization that enhances convergence speed with no penalty on the solution accuracy. The proposed architecture, which follows a data transfer scheme, is scalable and based on the interconnection of simple rotations units, which allows for a trade-off between occupied area and processing acceleration in the final implementation. This permits the SVD processor to be implemented both on low-cost and highend FPGAs, according to the final application requirements.

Topics in bifurcation theory

I. Existence and Structure of Bifurcation Branches

The problem of bifurcation is formulated as an operator equation in a Banach space, depending on relevant control parameters, say of the form G(u,λ) = 0. If dimN(G_u(u_O,λ_O)) = m the method of Lyapunov-Schmidt reduces the problem to the solution of m algebraic equations. The possible structure of these equations and the various types of solution behaviour are discussed. The equations are normally derived under the assumption that G^O_λεR(G^O_u). It is shown, however, that if G^O_λεR(G^O_u) then bifurcation still may occur and the local structure of such branches is determined. A new and compact proof of the existence of multiple bifurcation is derived. The linearized stability near simple bifurcation and "normal" limit points is then indicated.

II. Constructive Techniques for the Generation of Solution Branches

A method is described in which the dependence of the solution arc on a naturally occurring parameter is replaced by the dependence on a form of pseudo-arclength. This results in continuation procedures through regular and "normal" limit points. In the neighborhood of bifurcation points, however, the associated linear operator is nearly singular causing difficulty in the convergence of continuation methods. A study of the approach to singularity of this operator yields convergence proofs for an iterative method for determining the solution arc in the neighborhood of a simple bifurcation point. As a result of these considerations, a new constructive proof of bifurcation is determined.

Bifurcation theory of nonlinear boundary value problems

The theory of bifurcation of solutions to two-point boundary value problems is developed for a system of nonlinear first order ordinary differential equations in which the bifurcation parameter is allowed to appear nonlinearly. An iteration method is used to establish necessary and sufficient conditions for bifurcation and to construct a unique bifurcated branch in a neighborhood of a bifurcation point which is a simple eigenvalue of the linearized problem. The problem of bifurcation at a degenerate eigenvalue of the linearized problem is reduced to that of solving a system of algebraic equations. Cases with no bifurcation and with multiple bifurcation at a degenerate eigenvalue are considered.

The iteration method employed is shown to generate approximate solutions which contain those obtained by formal perturbation theory. Thus the formal perturbation solutions are rigorously justified. A theory of continuation of a solution branch out of the neighborhood of its bifurcation point is presented. Several generalizations and extensions of the theory to other types of problems, such as systems of partial differential equations, are described.

The theory is applied to the problem of the axisymmetric buckling of thin spherical shells. Results are obtained which confirm recent numerical computations.

Geometric integration applied to moving mesh methods and degenerate Lagrangians

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.

Legal dimensions of the Chinese experience in Los Angeles, 1860-1880

On October 24, 1871, a massacre of eighteen Chinese in Los Angeles brought the small southern California settlement into the national spotlight. Within a few days, news of this “night of horrors” was reported in newspapers across the country. This massacre has been cited in Asian American narratives as the first documented outbreak of ethnic violence against a Chinese community in the United States. This is ironic because Los Angeles’ small population has generally placed it on the periphery in historical studies of the California anti-Chinese movement. Because the massacre predated Los Angeles’ organized Chinese exclusion movements of the late 1870s, it has often been erroneously dismissed as an aberration in the history of the city.

The violence of 1871 was an outburst highlighting existing community tensions that would become part of public debate by decade’s close. The purpose of this study is to insert the massacre into a broader context of anti-Chinese sentiments, legal discrimination, and dehumanization in nineteenth century Los Angeles. While a second incident of widespread anti-Chinese violence never occurred, brutal attacks directed at Chinese small businessmen and others highlighted continued community conflict. Similarly, economic rivalries and concerns over Chinese prostitution that underlay the 1871 massacre were manifest in later campaigns of economic discrimination and vice suppression that sought to minimize Chinese influence within municipal limits. An analysis of the massacre in terms of anti-Chinese legal, social and economic strategies in nineteenth-century Los Angeles will elucidate these important continuities.

Randomness-efficient curve sampling

Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.

The randomness complexity of curve samplers is a crucial parameter for its applications. It is known that (non-explicit) curve samplers using O(log N + log(1/δ)) random bits exist, where N is the domain size and δ is the confidence error. The question of explicitly constructing randomness-efficient curve samplers was first raised in [TU06] where they obtained curve samplers with near-optimal randomness complexity.

In this thesis, we present an explicit construction of low-degree curve samplers with optimal randomness complexity (up to a constant factor) that sample curves of degree (m log_q(1/δ))^O(1) in F_q^m. Our construction is a delicate combination of several components, including extractor machinery, limited independence, iterated sampling, and list-recoverable codes.

Ortho-positronium annihilation: steps toward computing the first order radiative corrections

The 0.2% experimental accuracy of the 1968 Beers and Hughes measurement of the annihilation lifetime of ortho-positronium motivates the attempt to compute the first order quantum electrodynamic corrections to this lifetime. The theoretical problems arising in this computation are here studied in detail up to the point of preparing the necessary computer programs and using them to carry out some of the less demanding steps -- but the computation has not yet been completed. Analytic evaluation of the contributing Feynman diagrams is superior to numerical evaluation, and for this process can be carried out with the aid of the Reduce algebra manipulation computer program.

The relation of the positronium decay rate to the electronpositron annihilation-in-flight amplitude is derived in detail, and it is shown that at threshold annihilation-in-flight, Coulomb divergences appear while infrared divergences vanish. The threshold Coulomb divergences in the amplitude cancel against like divergences in the modulating continuum wave function.

Using the lowest order diagrams of electron-positron annihilation into three photons as a test case, various pitfalls of computer algebraic manipulation are discussed along with ways of avoiding them. The computer manipulation of artificial polynomial expressions is preferable to the direct treatment of rational expressions, even though redundant variables may have to be introduced.

Special properties of the contributing Feynman diagrams are discussed, including the need to restore gauge invariance to the sum of the virtual photon-photon scattering box diagrams by means of a finite subtraction.

A systematic approach to the Feynman-Brown method of Decomposition of single loop diagram integrals with spin-related tensor numerators is developed in detail. This approach allows the Feynman-Brown method to be straightforwardly programmed in the Reduce algebra manipulation language.

The fundamental integrals needed in the wake of the application of the Feynman-Brown decomposition are exhibited and the methods which were used to evaluate them -- primarily dis persion techniques are briefly discussed.

Finally, it is pointed out that while the techniques discussed have permitted the computation of a fair number of the simpler integrals and diagrams contributing to the first order correction of the ortho-positronium annihilation rate, further progress with the more complicated diagrams and with the evaluation of traces is heavily contingent on obtaining access to adequate computer time and core capacity.

A obrigação de extraditar para a repressão do terrorismo: a prática brasileira à luz do direito penal transnacional

O combate efetivo ao flagelo secular do terrorismo, ainda que possa se revestir de muitas formas, não prescinde da repressão penal de seus autores. Em vista da maciça internacionalização do terrorismo, a partir do Século XX, a cooperação jurídica internacional em matéria penal (aí incluída a extradição) consolida-se como instrumento de essencial importância para a repressão do terrorismo pela comunidade internacional, com a vantagem de resguardar o domínio do direito e, por conseguinte, de assegurar a paz e a segurança internacionais. A evolução do tratamento do crime de terrorismo pelo direito penal transnacional influenciada pelo direito da segurança coletiva, especialmente a partir dos atentados de 11 de setembro de 2001 exerceu expressivo impacto no direito extradicional. O entendimento desse efeito é fundamental para extrair-se do instituto da extradição todo o seu potencial para a repressão penal do terrorismo. Desde que presentes determinados requisitos, uma conduta de caráter terrorista à luz de parâmetros internacionais gera a obrigação estatal de extraditar ou processar seu autor, mesmo na ausência de tratado. Além disso, a extradição exercida ou não em decorrência de obrigação convencional tem seus princípios afetados pela obrigação internacional de repressão do terrorismo, particularmente no que se refere a questões como extraditabilidade, extradição por crimes políticos e extradição de refugiados. O direito brasileiro apresenta algumas vulnerabilidades para o cumprimento da obrigação aut dedere aut iudicare e a prática judicial brasileira relativa à extradição de acusados de atos de terrorismo poderia reportar-se mais ao direito internacional, com vistas a evitar o risco de violação de obrigações internacionais pelo Brasil.