A quantitative analysis of the phytoplankton of the Gulf of Panama III. General ecological conditions and the phytoplankton dynamics at 8°45'N, 79°23'W from November 1954 to May 1957

Bi-weekly phytoplankton samples were collected at 0, 10, and 20 m and enumerated by the Utermöhl sedimentation technique; 14C productivity measurements at 10 m, oblique zooplankton tows, and routine hydrographic observations were also made. Northerly winds induce upwelling during December-April, followed by a rainy season; a slight resurgence in upwelling may occur during July and/or August. Annual variations in upwelling intensity and rainfall occur. During upwelling, the upper 50 m, about 30 per cent of the total volume of the Gulf of Panama, is replaced with water 5 to 10 C colder than the more stratified, turbid and nutrient impoverished watermass present during the rainy season. The mean annual runoff accompanying an average annual precipitation of 2731 mm is estimated to equal a layer of fresh water 3.2 m thick. About 10 per cent of the phytoplankton phosphate and inorganic nitrogen requirements during the rainy season are accreted. (PDF contains 260 pages.)

Variations in year-class strength and estimates of the catchability coefficient of yellowfin tuna, Thunnus albacares, in the Eastern Pacific Ocean

ENGLISH: Year-class composition of catch, virtual population size and yearclass strength were determined from serial samples of size composition of catches and catch records. Murphy's Solution to the catch equation, which is free from the effects caused by changes in fishing pressure, was used to estimate year-class strength, i.e. the total population of fish age 3/4 years. The resultant estimates indicated that the X55, X56, X57, X62 and X63 year classes were above average and the X58, X59, X60, X61 and X64 year classes were below average. The year-class designation refers to the year of actual entry or presumed year of entry into the commercial fishery (at approximately 1 year of age). The strongest and poorest year classes were the X57 and X61 classes, respectively. The ratio of the strongest to the weakest year class was 2.6. This amount of variation is small compared to that found for other species of fish. It was found that the relationship between stock size and yearclass strength is of no value in predicting year-class strength. As a by-product of the analysis, estimates of the catchability coefficients (qN) of the age groups in the fishery were obtained, These estimates were found to vary with age and time. Age-two fish apparently showed the greatest vulnerability to fishing gear, followed by ages three and one, respectively. The average estimate of the catchability coefficient in weight was calculated and found to compare favorably with Schaefer's estimate. The influence of sea-surface water temperature upon year-class strength was investigated to determine whether the latter can be predicted from a knowledge of sea-surface temperatures prevailing during and following spawning. No correlation was evident. SPANISH: La composición de la clase anual en la captura, el tamaño de la población virtual y la fuerza de clase anual, fueron determinados según una serie de muestras de la composición de tamaño de las capturas y de los registros de captura. La Solución de Murphy de la ecuación de captura, que está libre de los efectos causados por los cambios de la presión de pesca, fue usada para estimar la fuerza de la clase anual, i.e. la población total de peces de 3/4 años. Las estimaciones resultantes indican que las clases anuales X55, X56, X57, X62 y X63 fueron superiores al promedio y que las clases anuales X58, X59, X60, X61 y X64 fueron inferiores al promedio. La designación de la clase anual se refiere al año actual de entrada o al año supuesto de entrada en la pesca comercial (aproximadamente a la edad de 1 año). Las clases anuales más fuertes y más pobres fueron la X57 y X61 respectivamente. La razón de la clase anual más fuerte en relación a la más débil fue 2.6. Esta cantidad de variación es pequeña comparada con la encontrada para otras especies de peces. Se encontró que la relación entre en tamaño del stock y la fuerza de la clase anual no tiene valor en predecir la fuerza de la clase anual. Se obtuvieron estimaciones de los coeficientes de capturabilidad (qN) de los grupos de edad en la pesquería como un producto derivado del análisis. Se encontraron que estas estimaciones variaron con la edad y tiempo. Los peces de edad dos aparentemente presentaron la vulnerabilidad más grande en relación al arte pesquero, seguidos por las edades tres y una, respectivamente. La estimación promedio del coeficiente de capturabilidad en peso fue calculada y se encontró que podía compararse favorablemente con la estimación de Schaefer. La influencia de la temperatura del agua superficial del mar sobre la fuerza de la clase anual fue investigada para determinar si se podía predecir esta última según el conocimíento de las temperaturas superficiales del mar prevalecientes durante el desove y después de éste. No hubo correlación evidente. (PDF contains 44 pages.)

Ekonomian lizentziaturako matematika III. Azterketak

irakasgaia gainditu behar duten ikasleentzat, eta baita ere, gai batzuetan, gradu berriko Matematika I eta Matematika II irakasgaiko ikasleentzat.Ekonomian Lizentziaturako Matematika III irakasgaiko azken hamar urteetan jarri diren azterketak eta haien erantzunak aurkituko dituzue. Lehenengo zatian, egin gabeko azterketak daude, ordena kronologikoan, zaharrenetik berrienera, eta bigarren zatian, erantzunak daude, ordena kronologikoan ere baina gaika ere. Horrela, programaren gai bakoitzaren ariketa guztiak elkarrekin aurkituko dituzue, gaiz gai ikasi nahi izanez gero.

Enpresen administrazio eta zuzendaritzako lizentziaturako matematika III. Azterketak

Enpresen Administrazio eta Zuzendaritzako Lizentziaturako Matematika III irakasgaia gainditu behar duten ikasleentzat, eta baita ere, gai batzuetan, gradu berriko Matematika I eta Matematika II irakasgaiko ikasleentzat.Enpresen Administrazio eta Zuzendaritzako Lizentziaturako Matematika III irakasgaiko azken hamar urteetan jarri diren azterketak eta haien erantzunak aurkituko dituzue. Lehenengo zatian, egin gabeko azterketak daude, ordena kronologikoan, zaharrenetik berrienera, eta bigarren zatian, erantzunak daude, ordena kronologikoan ere baina gaika ere. Horrela, programaren gai bakoitzaren ariketa guztiak elkarrekin aurkituko dituzue, gaiz gai ikasi nahi izanez gero.

Annaes do Parlamento Brazileiro. Tomo III [1878]

Anais do Parlamento Brasileiro, 1878.

Jarduera Fisikoaren orokortasunak bihotz-errehabilitazioaren III. faseko programa batean

Bihotz - errehabilitazioaren III. fasean alderdi ezberdinak hartu behar dira kontuan eta lan honek, alderdi ezberdin hauek azaldu nahi izan dit u: patologia ezberdinak azaltzea , jarduera fisikoaren orokortasunak eta entrena mendu metodo ezberdinak azaltzea eta azkenik, patologia zehatzen arabera kont uan hartu beharrekoak azaltzea Orain arte bihotz - errehabilitazioaren barruan entrenamendu aerobiko jarraia soilik landu den arren, lan honek entrenamendu aerobiko interbalikoaren onura adierazgarriak baieztatzen ditu: ahalmen aerobikoa hobetzea, VO 2pikoa hobetzea, ezker bentrikuluaren eiekzio frakzioa handitzea ... Gainera, entrenamendu aerobikoaz gain, indar entrenamenduak, arnasketa entrenamenduak eta malgutasun entrenamenduak ere onura adierazgarriak lortzen dituztela frogatu da, entrenamendu mota hauek entrenamendu aerobikoaren konplimentagarri izan behar direlarik.

Existence, uniqueness, and stability of solutions of a class of nonlinear partial differential equations

In this study we investigate the existence, uniqueness and asymptotic stability of solutions of a class of nonlinear integral equations which are representations for some time dependent non- linear partial differential equations. Sufficient conditions are established which allow one to infer the stability of the nonlinear equations from the stability of the linearized equations. Improved estimates of the domain of stability are obtained using a Liapunov Functional approach. These results are applied to some nonlinear partial differential equations governing the behavior of nonlinear continuous dynamical systems.

Serie Vídeos tutoriales para fonética. Video 3. Grabación (Parte III: Grabadoras)

Esta es una colección de 10 vídeos tutoriales que pueden ser empleados como material educativo en los cursos de fonética básica en el ámbito universitario. Los vídeos 1-3 tratan aspectos relacionados con la grabación: el tipo de micrófonos que se emplean, las clases de espacios en las que se suelen llevar a cabo la captura de señales de audio y las grabadoras que se suelen emplear. El vídeo 4 explora técnicas de captura y observación de datos de flujo y presión en fonética aerodinámica. Los vídeos 5-10 presentan información sobre los principales usos que se le brindan al programa Praat (Boersma y Weenink, 2014) en los estudios actuales de fonética acústica, desde la clase de información sobre modos de articulación de las consonantes que se puede identificar en oscilogramas hasta la creación de señales sonoras sintetizadas por medio de unos procedimientos que tiene el programa para tal propósito, los cuales son susceptibles de ser empleados en experimentos de percepción auditiva.

Insights into the mechanism of human erythrocyte hexose transport : a transferred NOE study of glucose binding to GLUT1

This study examines binding of α- and β-D-glucose in their equilibrium mixture to the glucose transporter (GLUT1) in human erythrocyte membrane preparations by an ^1H NMR method, the transferred NOE (TRNOE). This method is shown theoretically and experimentally to be a sensitive probe of weak ligand-macromolecule interactions. The TRNOEs observed are shown to arise solely from glucose binding to GLUT1. Sites at both membrane faces contribute to the TRNOEs. Binding curves obtained are consistent with a homogeneous class of sugar sites, with an apparent K_D which varies (from ~30 mM to ~70 mM for both anomers) depending on the membrane preparation examined. Preparations with a higher proportion of the cytoplasmic membrane face exposed to bulk solution yield higher apparent KK_Ds. The glucose transport inhibitor cytochalasin B essentially eliminates the TRNOE. Nonlinearity was found in the dependence on sugar concentration of the apparent inhibition constant for cytochalasin B reversal of the TRNOE observed in the α anomer (and probably the β anomer); such nonlinearity implies the existence of ternary complexes of sugar, inhibitor and transporter. The inhibition results furthermore imply the presence of a class of relatively high-affinity (K_D < 2mM) sugar sites specific for the α anomer which do not contribute to NMR-observable binding. The presence of two classes of sugar-sensitive cytochalasin B sites is also indicated. These results are compared with predictions of the alternating conformer model of glucose transport. Variation of apparent K_D in the NMR-observable sites, the formation of ternary complexes and the presence of an anomer-specific site are shown to be inconsistent with this model. An alternate model is developed which reconciles these results with the known transport behavior of GLUT1. In this model, the transporter possesses (at minimum) three classes of sugar sites: (i) transport sites, which are alternately exposed to the cytoplasmic or the extracellular compartment, but never to both simultaneously, (ii) a class of sites (probably relatively low-affinity) which are confined to one compartment, and (iii) the high-affinity α anomer-specific sites, which are confined to the cytoplasmic compartment.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

High-coherence hybrid Si/III-V semiconductor lasers

The relentlessly increasing demand for network bandwidth, driven primarily by Internet-based services such as mobile computing, cloud storage and video-on-demand, calls for more efficient utilization of the available communication spectrum, as that afforded by the resurging DSP-powered coherent optical communications. Encoding information in the phase of the optical carrier, using multilevel phase modulationformats, and employing coherent detection at the receiver allows for enhanced spectral efficiency and thus enables increased network capacity. The distributed feedback semiconductor laser (DFB) has served as the near exclusive light source powering the fiber optic, long-haul network for over 30 years. The transition to coherent communication systems is pushing the DFB laser to the limits of its abilities. This is due to its limited temporal coherence that directly translates into the number of different phases that can be imparted to a single optical pulse and thus to the data capacity. Temporal coherence, most commonly quantified in the spectral linewidth Δν, is limited by phase noise, result of quantum-mandated spontaneous emission of photons due to random recombination of carriers in the active region of the laser.

In this work we develop a generically new type of semiconductor laser with the requisite coherence properties. We demonstrate electrically driven lasers characterized by a quantum noise-limited spectral linewidth as low as 18 kHz. This narrow linewidth is result of a fundamentally new laser design philosophy that separates the functions of photon generation and storage and is enabled by a hybrid Si/III-V integration platform. Photons generated in the active region of the III-V material are readily stored away in the low loss Si that hosts the bulk of the laser field, thereby enabling high-Q photon storage. The storage of a large number of coherent quanta acts as an optical flywheel, which by its inertia reduces the effect of the spontaneous emission-mandated phase perturbations on the laser field, while the enhanced photon lifetime effectively reduces the emission rate of incoherent quanta into the lasing mode. Narrow linewidths are obtained over a wavelength bandwidth spanning the entire optical communication C-band (1530-1575nm) at only a fraction of the input power required by conventional DFB lasers. The results presented in this thesis hold great promise for the large scale integration of lithographically tuned, high-coherence laser arrays for use in coherent communications, that will enable Tb/s-scale data capacities.

Topics in randomized numerical linear algebra

This thesis studies three classes of randomized numerical linear algebra algorithms, namely: (i) randomized matrix sparsification algorithms, (ii) low-rank approximation algorithms that use randomized unitary transformations, and (iii) low-rank approximation algorithms for positive-semidefinite (PSD) matrices.

Randomized matrix sparsification algorithms set randomly chosen entries of the input matrix to zero. When the approximant is substituted for the original matrix in computations, its sparsity allows one to employ faster sparsity-exploiting algorithms. This thesis contributes bounds on the approximation error of nonuniform randomized sparsification schemes, measured in the spectral norm and two NP-hard norms that are of interest in computational graph theory and subset selection applications.

Low-rank approximations based on randomized unitary transformations have several desirable properties: they have low communication costs, are amenable to parallel implementation, and exploit the existence of fast transform algorithms. This thesis investigates the tradeoff between the accuracy and cost of generating such approximations. State-of-the-art spectral and Frobenius-norm error bounds are provided.

The last class of algorithms considered are SPSD "sketching" algorithms. Such sketches can be computed faster than approximations based on projecting onto mixtures of the columns of the matrix. The performance of several such sketching schemes is empirically evaluated using a suite of canonical matrices drawn from machine learning and data analysis applications, and a framework is developed for establishing theoretical error bounds.

In addition to studying these algorithms, this thesis extends the Matrix Laplace Transform framework to derive Chernoff and Bernstein inequalities that apply to all the eigenvalues of certain classes of random matrices. These inequalities are used to investigate the behavior of the singular values of a matrix under random sampling, and to derive convergence rates for each individual eigenvalue of a sample covariance matrix.