INDISIM-YEAST, an individual-based model to study yeast

INDISIM-YEAST, an individual-based simulator, models the evolution of a yeast population by settingup rules of behaviour for each individual cell according to their own biological rules and characteristics. Ittakes into account the uptake, metabolism, budding reproduction and viability of the yeast cells, over aperiod of time in the bulk of a liquid medium, occupying a three dimensional closed spatial grid with twokinds of particles (glucose and ethanol). Each microorganism is characterized by its biomass, genealogicalage, states in the budding cellular reproduction cycle and position in the space among others. Simulationsare carried out for population properties (global properties), as well as for those properties that pertain toindividual yeast cells (microscopic properties). The results of the simulations are in good qualitativeagreement with established experimental trends.

Voltage fluctuations in IC power supply distribution

The supply voltage decrease and powerconsumption increase of modern ICs made the requirements for low voltage fluctuation caused by packaging and on-chip parasitic impedances more difficult to achieve. Most of the research works on the area assume that all the nodes of the chip are fed at thesame voltage, in such a way that the main cause of disturbance or fluctuation is the parasitic impedance of packaging. In the paper an approach to analyze the effect of high and fast current demands on the on-chip power supply network. First an approach to model the entire network by considering a homogeneous conductive foil is presented. The modification of the timing parameters of flipflops caused by spatial voltage drops through the IC surface are also investigated.

Fachada solar como pieza singular de arquitectura sostenible

Articulo sobre la importancia de las energias renovables y su integración arquitectónica en el camino hacia una arquitectura sostenible. Descripción y evaluación del proyecto Fachada Solar SCHOTT Iberica.

Description of a robotics-oriented relational positioning methodology

This paper presents a relational positioning methodology for flexibly and intuitively specifying offline programmed robot tasks, as well as for assisting the execution of teleoperated tasks demanding precise movements.In relational positioning, the movements of an object can be restricted totally or partially by specifying its allowed positions in terms of a set of geometric constraints. These allowed positions are found by means of a 3D sequential geometric constraint solver called PMF – Positioning Mobile with respect to Fixed. PMF exploits the fact that in a set of geometric constraints, the rotational component can often be separated from the translational one and solved independently.

NDA waveform estimation in the low-SNR regime

This correspondence addresses the problem of nondata-aidedwaveform estimation for digital communications. Based on the unconditionalmaximum likelihood criterion, the main contribution of this correspondenceis the derivation of a closed-form solution to the waveform estimationproblem in the low signal-to-noise ratio regime. The proposed estimationmethod is based on the second-order statistics of the received signaland a clear link is established between maximum likelihood estimation andcorrelation matching techniques. Compression with the signal-subspace isalso proposed to improve the robustness against the noise and to mitigatethe impact of abnormals or outliers.

Intrinsic subspace convergence in TDD MIMO communication

In numerical linear algebra, students encounter earlythe iterative power method, which finds eigenvectors of a matrixfrom an arbitrary starting point through repeated normalizationand multiplications by the matrix itself. In practice, more sophisticatedmethods are used nowadays, threatening to make the powermethod a historical and pedagogic footnote. However, in the contextof communication over a time-division duplex (TDD) multipleinputmultiple-output (MIMO) channel, the power method takes aspecial position. It can be viewed as an intrinsic part of the uplinkand downlink communication switching, enabling estimationof the eigenmodes of the channel without extra overhead. Generalizingthe method to vector subspaces, communication in thesubspaces with the best receive and transmit signal-to-noise ratio(SNR) is made possible. In exploring this intrinsic subspace convergence(ISC), we show that several published and new schemes canbe cast into a common framework where all members benefit fromthe ISC.

Maximum likelihood estimation of position in GNSS

In this letter, we obtain the Maximum LikelihoodEstimator of position in the framework of Global NavigationSatellite Systems. This theoretical result is the basis of a completelydifferent approach to the positioning problem, in contrastto the conventional two-steps position estimation, consistingof estimating the synchronization parameters of the in-viewsatellites and then performing a position estimation with thatinformation. To the authors’ knowledge, this is a novel approachwhich copes with signal fading and it mitigates multipath andjamming interferences. Besides, the concept of Position–basedSynchronization is introduced, which states that synchronizationparameters can be recovered from a user position estimation. Weprovide computer simulation results showing the robustness ofthe proposed approach in fading multipath channels. The RootMean Square Error performance of the proposed algorithm iscompared to those achieved with state-of-the-art synchronizationtechniques. A Sequential Monte–Carlo based method is used todeal with the multivariate optimization problem resulting fromthe ML solution in an iterative way.

Space-time front-ends for RAKE receivers in the FDD mode of UTRA

A unified and general vision of different space-time processors is presented. Many popular receivers can beaccomodated, like V-RAKE receivers, weighted V-RAKE, or spatial narrowband beamforming. By makingappropriate assumptions on the space/time characteristic of the interference it is possible to enhance theperformance of the receiver through spatial/temporal pre-processors. These receivers will be tested in the FDDmode of UTRA.

Linear transceiver design in nonregenerative relays with channel state information

This paper deals with the design of nonregenerativerelaying transceivers in cooperative systems where channel stateinformation (CSI) is available at the relay station. The conventionalnonregenerative approach is the amplify and forward(A&F) approach, where the signal received at the relay is simplyamplified and retransmitted. In this paper, we propose an alternativelinear transceiver design for nonregenerative relaying(including pure relaying and the cooperative transmission cases),making proper use of CSI at the relay station. Specifically, wedesign the optimum linear filtering performed on the data to beforwarded at the relay. As optimization criteria, we have consideredthe maximization of mutual information (that provides aninformation rate for which reliable communication is possible) fora given available transmission power at the relay station. Threedifferent levels of CSI can be considered at the relay station: onlyfirst hop channel information (between the source and relay);first hop channel and second hop channel (between relay anddestination) information, or a third situation where the relaymay have complete cooperative channel information includingall the links: first and second hop channels and also the directchannel between source and destination. Despite the latter beinga more unrealistic situation, since it requires the destination toinform the relay station about the direct channel, it is useful as anupper benchmark. In this paper, we consider the last two casesrelating to CSI.We compare the performance so obtained with theperformance for the conventional A&F approach, and also withthe performance of regenerative relays and direct noncooperativetransmission for two particular cases: narrowband multiple-inputmultiple-output transceivers and wideband single input singleoutput orthogonal frequency division multiplex transmissions.

Hybrid turbo FEC/ARQ systems and distributed space-time coding for cooperative transmission

Cooperative transmission can be seen as a "virtual" MIMO system, where themultiple transmit antennas are in fact implemented distributed by the antennas both at the source and the relay terminal. Depending on the system design, diversity/multiplexing gainsare achievable. This design involves the definition of the type of retransmission (incrementalredundancy, repetition coding), the design of the distributed space-time codes, the errorcorrecting scheme, the operation of the relay (decode&forward or amplify&forward) and thenumber of antennas at each terminal. Proposed schemes are evaluated in different conditionsin combination with forward error correcting codes (FEC), both for linear and near-optimum(sphere decoder) receivers, for its possible implementation in downlink high speed packetservices of cellular networks. Results show the benefits of coded cooperation over directtransmission in terms of increased throughput. It is shown that multiplexing gains areobserved even if the mobile station features a single antenna, provided that cell wide reuse of the relay radio resource is possible.

Mulching as an alternative technique for weed management in mandarine orchard tree rows

Peer reviewed

Frames: a maximum entropy statistical estimate of the inverse problem

A maximum entropy statistical treatment of an inverse problem concerning frame theory is presented. The problem arises from the fact that a frame is an overcomplete set of vectors that defines a mapping with no unique inverse. Although any vector in the concomitant space can be expressed as a linear combination of frame elements, the coefficients of the expansion are not unique. Frame theory guarantees the existence of a set of coefficients which is “optimal” in a minimum norm sense. We show here that these coefficients are also “optimal” from a maximum entropy viewpoint.

Manipulació geomètrica dels blocs d'AutoCAD

Aquest text és un recull de procediments per inserir els blocs d'AutoCAD de forma més eficient, en la resolució de problemes prèviament tipificats: la PRIMERA PART descriu protocols d'actuació que l'usuari haurà d'aplicar manualment, mentre que la SEGONA PART ofereix rutines programades en AutoLISP i VisualLISP que l'eximiran d'aquesta obligació.Si ho deixéssim aquí, però, podria semblar que els mateixos mètodes manuals presentats en primer lloc són després els que AutoLISP automatitza; per això convé aclarir que la problemàtica de la PRIMERA PART, tot i que pròxima a la de la SEGONA, és diferent i reprodueix el contingut d'una monografia (BLOCS I GEOMETRIA: 5 EXERCICIS COMENTATS) que forma part del material de suport a l'assignatura ELEMENTS DE CAD, impartida per l'autor en l'ETS d'Enginyeria de Telecomunicació de Barcelona i que té per objecte cobrir el buit bibliogràfic que es detectava en el vessant geomètric de la inserció de blocs, a diferència del que s'ocupa de l'estructura de dades més adient en cada context (incrustació de dibuixos amb INSERT versus vinculació mitjançant REFX), més profusament tractat, proposant una sistematització tipològica dels casos on l'escala és funció lineal d'una distància.La SEGONA PART va més enllà i amplia el repertori d'AutoCAD amb les ordres GINSERT, RATREDIT, INSERTOK, INS2D, INS3D, BLOQUEOK, DESCOMPOK, DEF-TRANSF, APL-TRANSF-V i APL-TRANSF-N, de les quals INS2D i INS3D (INSERTOK és una versió simplificada de INS2D, per a blocs sense atributs) són l'aportació més innovadora i que més lluny porta les potencialitats de la inserció de blocs: resumint-ho en una frase, es tracta d’aconseguir que la inserció d’un bloc (que pot ser l’original, un bloc constituït per una inserció de l’original o un de constituït per la inserció del precedent) s’encabeixi en un marc prèviament establert, a semblança de les ordres ESCALA o GIRA, que mitjançant l'opció Referencia apliquen als objectes seleccionats la transformació d'escalat o de rotació necessària per tal que un element de referència assoleixi una determinada grandària o posició. Tot i que, per identificar amb encert el nucli del problema, serà inevitable introduir una reflexió: quan s’ha tingut la precaució de referir un bloc 2D a un quadrat unitari ortogonal, inserir-lo de manera que s’adapti a qualsevol marc rectangular establert en el dibuix és immediat, però ja no ho és tant concatenar insercions de manera que, a més d’una combinació simple de escalat, gir i translació, l’operació dugui implícita una transformació de cisallament. Perquè és clar que si inserim el bloc girat i convertim la inserció en un bloc que al seu torn tornem a inserir, ara però amb escalat no uniforme, el transformat del quadrat de referència primitiu serà un paral·lelogram, però el problema és: dibuixat un marc romboïdal concret, ¿quin gir caldrà donar a la primera inserció, i quin gir i factors d’escala caldrà aplicar a la segona perquè el quadrat de referència s’adapti al marc? El problema es complica si, a més, volem aprofitar el resultat de la primera inserció per a d’altres paral·lelograms, organitzant un sistema no redundant de insercions intermèdies. Doncs bé: INS2D i INS3D donen satisfacció a aquestes qüestions (la segona ja no contempla l'encaix en un paral·lelogram, sinó en un paral·lelepípede) i són aplicables a blocs proveïts d’atributs, no només de tipus convencional (els continguts en el pla de base del bloc, únics de funcionament garantit amb l’ordre INSERT), sinó també dels situats i orientats lliurement.

L'arquitectura que es trepitja

Peer reviewed