Phytoplankton in the surface desalted lens of the Kara Sea

Phytoplankton of a surface strongly desalinated water lens was investigated on the basis of materials collected during Cruise 57 of R/V Akademik Mstislav Keldysh in September 2007. The lens with salinity <18 psu had area of ca. 19000 sq. km and was located in the northwestern part of the Kara Sea near the eastern coast of Novaya Zemlya. It was a specific biotope that had been isolated from surrounding waters for more than three months. In the investigated area 66 algae species were identified. The maximal species diversity was found in the upper layers of the desalinated lens, where species number was 1.5 to 3 times higher than in other parts of the water column. Phytoplankton abundance in the upper layers of the lens was 1.5 to 4.5 times higher than in its lower part and generally higher than below the picnocline. Diatoms were the most abundant group in the upper layers of the lens, while flagellates dominated in the subpicnocline part of the water column. Maximal values of phytoplankton biomass were observed everywhere in the upper layers of the lens, where they were 1.2 to 3.7 times higher than in the lower part of the lens and 1.3 to 7.2 times higher than in the layer below the picnocline. Dinoflagellates generally gave the most contribution to total phytoplankton biomass. Phytoplankton of the desalinated surface lens in the northwestern part of the Kara Sea by its composition and quantitative parameters had the nearest resemblance to a phytocenosis that we observed two weeks later at a shallow desalinated shelf closely adjacent to the Ob estuary.

Ku band transmitarray lens for microwave applications

In this document a microstrip constrained lens device for Ku band, for microwave purpose, is presented. This paper offers an overview of artificial lens-type devices and the proposed transmitarray lens is thoroughly studied in terms of design and manufacturing, with architecture discussion and selection, along with the design, manufacturing and validation of all the forming components of the transmitarray (transmission circuits, radiating elements, etc.). Each element is properly characterized and assembled properly in the complete transmitarray prototype. Eventually, radiation pattern measurements as well as gain and directivity values, are provided to show the proper behaviour of the proposed transmitarray lens.

Planar compact array with parasitic elements for MIMO systems

A compact planar array with parasitic elements is studied to be used in MIMO systems. Classical compact arrays suffer from high coupling which makes correlation and matching efficiency to be worse. A proper matching network improves these lacks although its bandwidth is low and may increase the antenna size. The proposed antenna makes use of parasitic elements to improve both correlation and efficiency. A specific software based on MoM has been developed to analyze radiating structures with several feed points. The array is optimized through a Genetic Algorithm to determine parasitic elements position in order to fulfill different figures of merit. The proposed design provides the required correlation and matching efficiency to have a good performance over a significant bandwidth.

Low-Profile Dual Circularly Polarized Antenna Array for Satellite Communications in the X Band

A planar antenna is introduced that works as a portable system for X-band satellite communications. This antenna is low-profile and modular with dimensions of 40 × 40 × 2.5 × cm. It is composed of a square array of 144 printed circuit elements that cover a wide bandwidth (14.7%) for transmission and reception along with dual and interchangeable circular polarization. A radiation efficiency above 50% is achieved by a low-loss stripline feeding network. This printed antenna has a 3 dB beamwidth of 5°, a maximum gain of 26 dBi and an axial ratio under 1.9 dB over the entire frequency band. The complete design of the antenna is shown, and the measurements are compared with simulations to reveal very good agreement.

Red Multihaz de Desfase Escalonado para el Control de un Array de Antenas.

This paper presents a general systems that can be taken into account to control between elements in an antenna array. Because the digital phase shifter devices have become a strategic element and also some steps have been taken for their export by U.S. Government, this element has increased its price to the low supply in the market. Therefore, it is necessary to adopt some solutions that allow us to deal with the design and construction of antenna arrays. system based on a group of a staggered phase shift with external switching is shown, which is extrapolated array.

Solid catadioptric telephoto lens design with SMS method

Two new optical structures are designed using the Simultaneous Multiple Surfaces (SMS) method, comprised of 2 reflecting surfaces and 2 refracting surfaces, 800mm focal length, f/8 (aperture diameter 100 mm) and 1.180 diagonal field of view in the SWIR band. The lens surfaces are rotational symmetric and calculated to have good control of non-paraxial rays. We have achieved designs with excellent performance, and with total system length of less than 60 mm.

Ultra-compact SWIR telephoto lens design with SMS method

In this work, we propose two new optical structures, using the Simultaneous Multiple Surfaces (SMS) method, comprised of 2 reflecting surfaces and 2 refracting surfaces, 800mm focal length, f/8 (aperture diameter 100 mm) and 1.18 0 diagonal field of view in the SWIR band. The lens surfaces are rotational symmetric and calculated to have good control of non-paraxial rays. We have achieved designs with excellent performance, and with total system length of less than 60 mm.

Multibeam Network Design and Measurement for Triangular Array of Three Radiating Elements

Nowadays, more a more base stations are equipped with active conformal antennas. These antenna designs combine phase shift systems with multibeam networks providing multi-beam ability and interference rejection, which optimize multiple channel systems. GEODA is a conformal adaptive antenna system designed for satellite communications. Operating at 1.7 GHz with circular polarization, it is possible to track and communicate with several satellites at once thanks to its adaptive beam. The antenna is based on a set of similar triangular arrays that are divided in subarrays of three elements called `cells'. Transmission/Receiver (T/R) modules manage beam steering by shifting the phases. A more accurate steering of the antenna GEODA could be achieved by using a multibeam network. Several multibeam network designs based on Butler network will be presented

3x3 Multibeam Network for a Triangular Array of Three Radiating Elements

A multibeam antenna study based on Butler network will be undertaken in this document. These antenna designs combines phase shift systems with multibeam networks to optimize multiple channel systems. The system will work at 1.7 GHz with circular polarization. Specifically, result simulations and measurements of 3 element triangular subarray will be shown. A 45 element triangular array will be formed by the subarrays. Using triangular subarrays, side lobes and crossing points are reduced.

6x3 Microstrip Beam Forming Network for Multibeam Triangular Array

A six inputs and three outputs structure which can be used to obtain six simultaneous beams with a triangular array of 3 elements is presented. The beam forming network is obtained combining balanced and unbalanced hybrid couplers and allows to obtain six main beams with sixty degrees of separation in azimuth direction. Simulations and measurements showing the performance of the array and other detailed results are presented

Progress In FK Concentrators

The Fresnel Köhler (FK) concentrator was first presented in 2008. Since then, various CPV companies have adopted this technology as base for their future commercial product. The key for this rapid penetration is a mixture of simplicity (the FK is essentially a Fresnel lens concentrator, a technology that dominates the market) and excellent performance: high concentration without giving up large manufacturing∕aiming tolerances, enabling high efficiency even at the array level. All these features together have a great potential to lower energy costs. This work shows recent results and progress regarding this device, covering new design features, measurements and tests along with first performance achievements at the array level (pilot 6.5 Kwp plant). The work also discusses the potential impact of the FK enhanced performance on the Levelized Cost Of Electricity (LCOE)

Array Compacto De Monopolos Planos Con Plano De Tierra Ranurado Para Sistemas Mimo

A compact array of monopoles with a slotted ground plane is analyzed for being used in MIMO systems. Compact arrays suffer usually from high coupling which degrades significantly MIMO benefits. Through a matching network, main drawbacks can be solved, although it tends to provide a low bandwidth. The studied design is an array of monopoles with a slot in the ground plane. The slot shape is optimized with a Genetic Algorithm and an own electromagnetic software based on MoM in order to fulfill main figures of merit within a significant bandwidth

Advanced Topics in Resource Analysis: Certification, Incrementality, Concurrency and Array-Sensitivity

El Análisis de Consumo de Recursos o Análisis de Coste trata de aproximar el coste de ejecutar un programa como una función dependiente de sus datos de entrada. A pesar de que existen trabajos previos a esta tesis doctoral que desarrollan potentes marcos para el análisis de coste de programas orientados a objetos, algunos aspectos avanzados, como la eficiencia, la precisión y la fiabilidad de los resultados, todavía deben ser estudiados en profundidad. Esta tesis aborda estos aspectos desde cuatro perspectivas diferentes: (1) Las estructuras de datos compartidas en la memoria del programa son una pesadilla para el análisis estático de programas. Trabajos recientes proponen una serie de condiciones de localidad para poder mantener de forma consistente información sobre los atributos de los objetos almacenados en memoria compartida, reemplazando éstos por variables locales no almacenadas en la memoria compartida. En esta tesis presentamos dos extensiones a estos trabajos: la primera es considerar, no sólo los accesos a los atributos, sino también los accesos a los elementos almacenados en arrays; la segunda se centra en los casos en los que las condiciones de localidad no se cumplen de forma incondicional, para lo cual, proponemos una técnica para encontrar las precondiciones necesarias para garantizar la consistencia de la información acerca de los datos almacenados en memoria. (2) El objetivo del análisis incremental es, dado un programa, los resultados de su análisis y una serie de cambios sobre el programa, obtener los nuevos resultados del análisis de la forma más eficiente posible, evitando reanalizar aquellos fragmentos de código que no se hayan visto afectados por los cambios. Los analizadores actuales todavía leen y analizan el programa completo de forma no incremental. Esta tesis presenta un análisis de coste incremental, que, dado un cambio en el programa, reconstruye la información sobre el coste del programa de todos los métodos afectados por el cambio de forma incremental. Para esto, proponemos (i) un algoritmo multi-dominio y de punto fijo que puede ser utilizado en todos los análisis globales necesarios para inferir el coste, y (ii) una novedosa forma de almacenar las expresiones de coste que nos permite reconstruir de forma incremental únicamente las funciones de coste de aquellos componentes afectados por el cambio. (3) Las garantías de coste obtenidas de forma automática por herramientas de análisis estático no son consideradas totalmente fiables salvo que la implementación de la herramienta o los resultados obtenidos sean verificados formalmente. Llevar a cabo el análisis de estas herramientas es una tarea titánica, ya que se trata de herramientas de gran tamaño y complejidad. En esta tesis nos centramos en el desarrollo de un marco formal para la verificación de las garantías de coste obtenidas por los analizadores en lugar de analizar las herramientas. Hemos implementado esta idea mediante la herramienta COSTA, un analizador de coste para programas Java y KeY, una herramienta de verificación de programas Java. De esta forma, COSTA genera las garantías de coste, mientras que KeY prueba la validez formal de los resultados obtenidos, generando de esta forma garantías de coste verificadas. (4) Hoy en día la concurrencia y los programas distribuidos son clave en el desarrollo de software. Los objetos concurrentes son un modelo de concurrencia asentado para el desarrollo de sistemas concurrentes. En este modelo, los objetos son las unidades de concurrencia y se comunican entre ellos mediante llamadas asíncronas a sus métodos. La distribución de las tareas sugiere que el análisis de coste debe inferir el coste de los diferentes componentes distribuidos por separado. En esta tesis proponemos un análisis de coste sensible a objetos que, utilizando los resultados obtenidos mediante un análisis de apunta-a, mantiene el coste de los diferentes componentes de forma independiente. Abstract Resource Analysis (a.k.a. Cost Analysis) tries to approximate the cost of executing programs as functions on their input data sizes and without actually having to execute the programs. While a powerful resource analysis framework on object-oriented programs existed before this thesis, advanced aspects to improve the efficiency, the accuracy and the reliability of the results of the analysis still need to be further investigated. This thesis tackles this need from the following four different perspectives. (1) Shared mutable data structures are the bane of formal reasoning and static analysis. Analyses which keep track of heap-allocated data are referred to as heap-sensitive. Recent work proposes locality conditions for soundly tracking field accesses by means of ghost non-heap allocated variables. In this thesis we present two extensions to this approach: the first extension is to consider arrays accesses (in addition to object fields), while the second extension focuses on handling cases for which the locality conditions cannot be proven unconditionally by finding aliasing preconditions under which tracking such heap locations is feasible. (2) The aim of incremental analysis is, given a program, its analysis results and a series of changes to the program, to obtain the new analysis results as efficiently as possible and, ideally, without having to (re-)analyze fragments of code that are not affected by the changes. During software development, programs are permanently modified but most analyzers still read and analyze the entire program at once in a non-incremental way. This thesis presents an incremental resource usage analysis which, after a change in the program is made, is able to reconstruct the upper-bounds of all affected methods in an incremental way. To this purpose, we propose (i) a multi-domain incremental fixed-point algorithm which can be used by all global analyses required to infer the cost, and (ii) a novel form of cost summaries that allows us to incrementally reconstruct only those components of cost functions affected by the change. (3) Resource guarantees that are automatically inferred by static analysis tools are generally not considered completely trustworthy, unless the tool implementation or the results are formally verified. Performing full-blown verification of such tools is a daunting task, since they are large and complex. In this thesis we focus on the development of a formal framework for the verification of the resource guarantees obtained by the analyzers, instead of verifying the tools. We have implemented this idea using COSTA, a state-of-the-art cost analyzer for Java programs and KeY, a state-of-the-art verification tool for Java source code. COSTA is able to derive upper-bounds of Java programs while KeY proves the validity of these bounds and provides a certificate. The main contribution of our work is to show that the proposed tools cooperation can be used for automatically producing verified resource guarantees. (4) Distribution and concurrency are today mainstream. Concurrent objects form a well established model for distributed concurrent systems. In this model, objects are the concurrency units that communicate via asynchronous method calls. Distribution suggests that analysis must infer the cost of the diverse distributed components separately. In this thesis we propose a novel object-sensitive cost analysis which, by using the results gathered by a points-to analysis, can keep the cost of the diverse distributed components separate.

SMS-based optimization strategy for ultra-compact SWIR telephoto lens design: erratum

We report and correct an error in [Opt. Express 20, 9726–9735 (2012)]. The author list has been modified. All other contents are unchanged.