Modeling study of the aspect ratio influence on urban canopy energy fluxes with a modified wall-canyon energy budget scheme

The influence of the aspect ratio (building height/street canyon width) and the mean building height of cities on local energy fluxes and temperatures is studied by means of an Urban Canopy Model (UCM) coupled with a one-dimensional second-order turbulence closure model. The UCM presented is similar to the Town Energy Balance (TEB) model in most of its features but differs in a few important aspects. In particular, the street canyon walls are treated separately which leads to a different budget of radiation within the street canyon walls. The UCM has been calibrated using observations of incoming global and diffuse solar radiation, incoming long-wave radiation and air temperature at a site in So Paulo, Brazil. Sensitivity studies with various aspect ratios have been performed to assess their impact on urban temperatures and energy fluxes at the top of the canopy layer. In these simulations, it is assumed that the anthropogenic heat flux and latent heat fluxes are negligible. Results show that the simulated net radiation and sensible heat fluxes at the top of the canopy decrease and the stored heat increases as the aspect ratio increases. The simulated air temperature follows the behavior of the sensible heat flux. (C) 2010 Elsevier Ltd. All rights reserved.

Formulation of a tropical town energy budget (t-TEB) scheme

This work describes the tropical town energy budget (t-TEB) scheme addressed to simulate the diurnal occurrence of the urban heat island (UHI) as observed in the Metropolitan Area of Rio de Janeiro (MARJ; -22A degrees S; -44A degrees W) in Brazil. Reasoning about the tropical urban climate have guided the scheme implementation, starting from the original equations from Masson (Bound-Lay Meteorol 94:357-397, 2000). The modifications include (a) local scaling approaches for obtaining flux-gradient relationships in the roughness sub-layer, (b) the Monin-Obukhov similarity framework in the inertial sub-layer, (c) increasing aerodynamic conductance toward more unstable conditions, and (d) a modified urban subsurface drainage system to transfer the intercepted rainwater by roofs to the roads. Simulations along 2007 for the MARJ are obtained and compared with the climatology. The t-TEB simulation is consistent with the observations, suggesting that the timing and dynamics of the UHI in tropical cities could vary significantly from the familiar patterns observed in mid-latitude cities-with the peak heat island intensity occurring in the morning than at night. The simulations are suggesting that the thermal phase shift of this tropical diurnal UHI is a response of the surface energy budget to the large amount of solar radiation, intense evapotranspiration, and thermal response of the vegetated surfaces over a very humid soil layer.

Coding behavioural data for cladistic analysis: using dynamic homology without parsimony

Many of the controversies around the concept of homology rest on the subjectivity inherent to primary homology propositions. Dynamic homology partially solves this problem, but there has been up to now scant application of it outside of the molecular domain. This is probably because morphological and behavioural characters are rich in properties, connections and qualities, so that there is less space for conflicting character delimitations. Here we present a new method for the direct optimization of behavioural data, a method that relies on the richness of this database to delimit the characters, and on dynamic procedures to establish character state identity. We use between-species congruence in the data matrix and topological stability to choose the best cladogram. We test the methodology using sequences of predatory behaviour in a group of spiders that evolved the highly modified predatory technique of spitting glue onto prey. The cladogram recovered is fully compatible with previous analyses in the literature, and thus the method seems consistent. Besides the advantage of enhanced objectivity in character proposition, the new procedure allows the use of complex, context-dependent behavioural characters in an evolutionary framework, an important step towards the practical integration of the evolutionary and ecological perspectives on diversity. (C) The Willi Hennig Society 2010.

The non-coding RNA BC1 is down-regulated in the hippocampus of Wistar Audiogenic Rat (WAR) strain after audiogenic kindling

The aim of this study was to identify molecular pathways involved in audiogenic seizures in the epilepsy-prone Wistar Audiogenic Rat (WAR). For this, we used a suppression-subtractive hybridization (SSH) library from the hippocampus of WARs coupled to microarray comparative gene expression analysis, followed by Northern blot validation of individual genes. We discovered that the levels of the non-protein coding (npc) RNA BC1 were significantly reduced in the hippocampus of WARs submitted to repeated audiogenic seizures (audiogenic kindling) when compared to Wistar resistant rats and to both naive WARs and Wistars. By quantitative in situ hybridization, we verified lower levels of BC1 RNA in the GD-hilus and significant signal ratio reduction in the stratum radiatum and stratum pyramidale of hippocampal CA3 subfield of audiogenic kindled animals. Functional results recently obtained in a BC1-/- mouse model and our current data are supportive of a potential disruption in signaling pathways, upstream of BC1, associated with the seizure susceptibility of WARs. (C) 2010 Elsevier B.V. All rights reserved.

A geometric mass-preserving redistancing scheme for the level set function

In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and three spatial dimensions and compared with the widely used partial differential equation (PDE)-based redistancing method using structured Cartesian grids. Through the use of quantitative error measures of interest in level set methods, we show that the overall performance of the proposed geometric procedure is better than PDE-based reinitialization schemes, since it is more robust with comparable accuracy. We also show that the algorithm is well-suited for the highly stretched curvilinear grids used in CFD simulations. Copyright (C) 2010 John Wiley & Sons, Ltd.

Evaluation of a bounded high order upwind scheme for 3D incompressible free surface flow computations

fit the context of normalized variable formulation (NVF) of Leonard and total variation diminishing (TVD) constraints of Harten. this paper presents an extension of it previous work by the authors for solving unsteady incompressible flow problems. The main contributions of the paper are threefold. First, it presents the results of the development and implementation of a bounded high order upwind adaptative QUICKEST scheme in the 3D robust code (Freeflow), for the numerical solution of the full incompressible Navier-Stokes equations. Second, it reports numerical simulation results for 1D hock tube problem, 2D impinging jet and 2D/3D broken clam flows. Furthermore, these results are compared with existing analytical and experimental data. And third, it presents the application of the numerical method for solving 3D free surface flow problems. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved,

A Direct Numerov Sixth-order Numerical Scheme to Accurately Solve the Unidimensional Poisson Equation with Dirichlet Boundary Conditions

In this article, we present an analytical direct method, based on a Numerov three-point scheme, which is sixth order accurate and has a linear execution time on the grid dimension, to solve the discrete one-dimensional Poisson equation with Dirichlet boundary conditions. Our results should improve numerical codes used mainly in self-consistent calculations in solid state physics.

Estimating losses in an entanglement concentration scheme using the phenomenological operator approach to dissipation in cavity quantum electrodynamics

In a previous paper, we developed a phenomenological-operator technique aiming to simplify the estimate of losses due to dissipation in cavity quantum electrodynamics. In this paper, we apply that technique to estimate losses during an entanglement concentration process in the context of dissipative cavities. In addition, some results, previously used without proof to justify our phenomenological-operator approach, are now formally derived, including an equivalent way to formulate the Wigner-Weisskopf approximation.

Single Synapse Information Coding in Intraburst Spike Patterns of Central Pattern Generator Motor Neurons

Burst firing is ubiquitous in nervous systems and has been intensively studied in central pattern generators (CPGs). Previous works have described subtle intraburst spike patterns (IBSPs) that, despite being traditionally neglected for their lack of relation to CPG motor function, were shown to be cell-type specific and sensitive to CPG connectivity. Here we address this matter by investigating how a bursting motor neuron expresses information about other neurons in the network. We performed experiments on the crustacean stomatogastric pyloric CPG, both in control conditions and interacting in real-time with computer model neurons. The sensitivity of postsynaptic to presynaptic IBSPs was inferred by computing their average mutual information along each neuron burst. We found that details of input patterns are nonlinearly and inhomogeneously coded through a single synapse into the fine IBSPs structure of the postsynaptic neuron following burst. In this way, motor neurons are able to use different time scales to convey two types of information simultaneously: muscle contraction (related to bursting rhythm) and the behavior of other CPG neurons (at a much shorter timescale by using IBSPs as information carriers). Moreover, the analysis revealed that the coding mechanism described takes part in a previously unsuspected information pathway from a CPG motor neuron to a nerve that projects to sensory brain areas, thus providing evidence of the general physiological role of information coding through IBSPs in the regulation of neuronal firing patterns in remote circuits by the CNS.

A DISCRETIZATION SCHEME FOR AN ONE-DIMENSIONAL REACTION-DIFFUSION EQUATION WITH DELAY AND ITS DYNAMICS

The goal of this paper is to present an approximation scheme for a reaction-diffusion equation with finite delay, which has been used as a model to study the evolution of a population with density distribution u, in such a way that the resulting finite dimensional ordinary differential system contains the same asymptotic dynamics as the reaction-diffusion equation.

Identification of protein-coding and intronic noncoding RNAs down-regulated in clear cell renal carcinoma

The clear cell subtype of renal cell carcinoma (RCC) is the most lethal and prevalent cancer of the urinary system. To investigate the molecular changes associated with malignant transformation in clear cell RCC, the gene expression profiles of matched samples of tumor and adjacent non-neoplastic tissue were obtained from six patients. A custom-built cDNA microarray platform was used, comprising 2292 probes that map to exons of genes and 822 probes for noncoding RNAs mapping to intronic regions. Intronic transcription was detected in all normal and neoplastic renal tissues. A subset of 55 transcripts was significantly down-regulated in clear cell RCC relative to the matched nontumor tissue as determined by a combination of two statistical tests and leave-one-out patient cross-validation. Among the down-regulated transcripts, 49 mapped to untranslated or coding exons and 6 were intronic relative to known exons of protein-coding genes. Lower levels of expression of SIN3B, TRIP3, SYNJ2BP and NDE1 (P<0.02), and of intronic transcripts derived from SND1 and ACTN4 loci (P<0.05), were confirmed in clear cell RCC by Real-time RT-PCR. A subset of 25 transcripts was deregulated in additional six nonclear cell RCC samples, pointing to common transcriptional alterations in RCC irrespective of the histological subtype or differentiation state of the tumor. Our results indicate a novel set of tumor suppressor gene candidates, including noncoding intronic RNAs, which may play a significant role in malignant transformations of normal renal cells. (C) 2008 Wiley-Liss, Inc.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Study of the audio coding algorithm of the MPEG-4 AAC standard and comparison among implementations of modules of the algorithm

Audio coding is used to compress digital audio signals, thereby reducing the amount of bits needed to transmit or to store an audio signal. This is useful when network bandwidth or storage capacity is very limited. Audio compression algorithms are based on an encoding and decoding process. In the encoding step, the uncompressed audio signal is transformed into a coded representation, thereby compressing the audio signal. Thereafter, the coded audio signal eventually needs to be restored (e.g. for playing back) through decoding of the coded audio signal. The decoder receives the bitstream and reconverts it into an uncompressed signal. ISO-MPEG is a standard for high-quality, low bit-rate video and audio coding. The audio part of the standard is composed by algorithms for high-quality low-bit-rate audio coding, i.e. algorithms that reduce the original bit-rate, while guaranteeing high quality of the audio signal. The audio coding algorithms consists of MPEG-1 (with three different layers), MPEG-2, MPEG-2 AAC, and MPEG-4. This work presents a study of the MPEG-4 AAC audio coding algorithm. Besides, it presents the implementation of the AAC algorithm on different platforms, and comparisons among implementations. The implementations are in C language, in Assembly of Intel Pentium, in C-language using DSP processor, and in HDL. Since each implementation has its own application niche, each one is valid as a final solution. Moreover, another purpose of this work is the comparison among these implementations, considering estimated costs, execution time, and advantages and disadvantages of each one.

Financial distress as a collapse of incentive scheme

This paper explaina why workers lack motivation near bankruptcy, why they tend to leave companies in financiai distreas, and why thoae who remam require higher compensation. Theae indirect costa of financiai diatresa adie becauae the optimal combination of debt and incentive achem.ea, deaigned to minimize agency costa, ends up underpaying managers when there ia a bankruptcy threat. The paper a1so providea new empirica1 implications on the intera.ction between financiai reatructuring and changea in managerial compensation. Theae predictions are supported by the findings of Gilson and Vetsuypens (1992).

Combating shoulder-surfing: a hidden button gesture based scheme

This project describes an authentication technique that is shoulder-surfing resistant. Shoulder surfing is an attack in which an attacker can get access to private information by observing the user’s interaction with a terminal, or by using recording tools to record the user interaction and study the obtained data, with the objective of obtaining unauthorized access to a target user’s personal information. The technique described here relies on gestural analysis coupled with a secondary channel of authentication that uses button pressing. The thesis presents and evaluates multiple alternative algorithms for gesture analysis, and furthermore assesses the effectiveness of the technique.