Dendritic atrophy constricts functional maps in resonance and impedance properties of hippocampal model neurons

A gradient in the density of hyperpolarization-activated cyclic-nucleotide gated (HCN) channels is necessary for the emergence of several functional maps within hippocampal pyramidal neurons. Here, we systematically analyzed the impact of dendritic atrophy on nine such functional maps, related to input resistance and local/transfer impedance properties, using conductance-based models of hippocampal pyramidal neurons. We introduced progressive dendritic atrophy in a CA1 pyramidal neuron reconstruction through a pruning algorithm, measured all functional maps in each pruned reconstruction, and arrived at functional forms for the dependence of underlying measurements on dendritic length. We found that, across frequencies, atrophied neurons responded with higher efficiency to incoming inputs, and the transfer of signals across the dendritic tree was more effective in an atrophied reconstruction. Importantly, despite the presence of identical HCN-channel density gradients, spatial gradients in input resistance, local/transfer resonance frequencies and impedance profiles were significantly constricted in reconstructions with dendrite atrophy, where these physiological measurements across dendritic locations converged to similar values. These results revealed that, in atrophied dendritic structures, the presence of an ion channel density gradient alone was insufficient to sustain homologous functional maps along the same neuronal topograph. We assessed the biophysical basis for these conclusions and found that this atrophy-induced constriction of functional maps was mediated by an enhanced spatial spread of the influence of an HCN-channel cluster in atrophied trees. These results demonstrated that the influence fields of ion channel conductances need to be localized for channel gradients to express themselves as homologous functional maps, suggesting that ion channel gradients are necessary but not sufficient for the emergence of functional maps within single neurons.

Skeleton based visual pattern recognition. Applications to tabletop interaction

211 p. :il.

Lignin extraction, purification and depolymerization study

280 p. : il.

Never-resting microglia: physiological roles in the healthy brain and pathological implications

Microglia are largely known as the major orchestrators of the brain inflammatory response. As such, they have been traditionally studied in various contexts of disease, where their activation has been assumed to induce a wide range of detrimental effects. In the last few years, a series of discoveries have challenged the current view of microglia, showing their active and positive contribution to normal brain function. This Research Topic will review the novel physiological roles of microglia in the developing, mature and aging brain, under non-pathological conditions. In particular, this Research Topic will discuss the cellular and molecular mechanisms by which microglia contribute to the formation, pruning and plasticity of synapses; the maintenance of the blood brain barrier; the regulation of adult neurogenesis and hippocampal learning; and neuronal survival, among other important roles. Because these novel findings defy our understanding of microglial function in health as much as in disease, this Research Topic will also summarize the current view of microglial nomenclature, phenotypes, origin and differentiation, sex differences, and contribution to various brain pathologies. Additionally, novel imaging approaches and molecular tools to study microglia in their non-activated state will be discussed. In conclusion, this Research Topic seeks to emphasize how the current research in neuroscience is challenged by never-resting microglia.

Gestão de resíduos de poda: estudo de caso da Fundação Parques e Jardins do Município do Rio de Janeiro.

A partir do consenso já existente, de que o desenvolvimento urbano é responsável, em parte, pelo desequilíbrio ambiental predominante nas cidades mais populosas, nas quais a administração dos resíduos gerados torna-se um grande desafio, este estudo foi realizado com a finalidade de desenvolver um modelo de gerenciamento para os resíduos de poda de árvores de espaços públicos, visando a utilização do material podado, considerado de boa qualidade, o que minimizaria a disposição de resíduos em aterros sanitários. Para tanto, foi desenvolvido um modelo diferenciado do ponto de vista de legal, gerencial, tecnológico e econômico, que pudesse servir de base à pesquisa e gerar estratégias para beneficiar o meio ambiente. A Unidade de Conservação, que pertence à Fundação Parques e Jardins da Prefeitura da Cidade do Rio de Janeiro, localizada na Taquara, foi analisada no Estudo de Caso. As espécies arbóreas que produzem maior volume de poda nessa seção foram selecionadas de modo que fosse possível o seu aproveitamento econômico-ecológico. Concluiu-se que há uma inviabilidade para segregação dos resíduos de poda por parte da Fundação Parques e Jardins e que os mesmos poderiam ser transferidos diretamente para o aterro receptor, em fase de encerramento de atividades, sem custos excedentes. Foi feita uma apreciação especial do Centro de Tratamento de Resíduos Sólidos de Gericinó, por ser grande receptor dos resíduos produzidos nas operações de manejo da área em evidência. Foi elaborada a proposta de criação de uma Usina Verde nas áreas já desativadas do aterro, como forma complementar ao processo de revitalização da área aterrada após o término de suas atividades. Esta ação contemplaria a região com um bosque, onde seriam absorvidos todos os produtos dos resíduos de poda. Haveria, também, a probabilidade de utilização operacional dos catadores nas etapas de obtenção de compostos orgânicos, cobertura morta e equipamentos paisagísticos entre outros.

Effective handling of dialogue state in the hidden information state POMDP-based dialogue manager

Effective dialogue management is critically dependent on the information that is encoded in the dialogue state. In order to deploy reinforcement learning for policy optimization, dialogue must be modeled as a Markov Decision Process. This requires that the dialogue statemust encode all relevent information obtained during the dialogue prior to that state. This can be achieved by combining the user goal, the dialogue history, and the last user action to form the dialogue state. In addition, to gain robustness to input errors, dialogue must be modeled as a Partially Observable Markov Decision Process (POMDP) and hence, a distribution over all possible states must be maintained at every dialogue turn. This poses a potential computational limitation since there can be a very large number of dialogue states. The Hidden Information State model provides a principled way of ensuring tractability in a POMDP-based dialogue model. The key feature of this model is the grouping of user goals into partitions that are dynamically built during the dialogue. In this article, we extend this model further to incorporate the notion of complements. This allows for a more complex user goal to be represented, and it enables an effective pruning technique to be implemented that preserves the overall system performance within a limited computational resource more effectively than existing approaches. © 2011 ACM.

An ngram-based statistical machine translation decoder

In this paper we describe MARIE, an Ngram-based statistical machine translation decoder. It is implemented using a beam search strategy, with distortion (or reordering) capabilities. The underlying translation model is based on an Ngram approach, extended to introduce reordering at the phrase level. The search graph structure is designed to perform very accurate comparisons, what allows for a high level of pruning, improving the decoder efficiency. We report several techniques for efficiently prune out the search space. The combinatory explosion of the search space derived from the search graph structure is reduced by limiting the number of reorderings a given translation is allowed to perform, and also the maximum distance a word (or a phrase) is allowed to be reordered. We finally report translation accuracy results on three different translation tasks.

采用了剪枝优化的子类型关系判定算法

静态类型化XML处理语言为处理XML数据提供了新的途径,但现有的此类语言大多数效率较低.研究此类语言的一个重要问题——子类型关系的判定,并使用剪枝优化策略对XDuce的子类型关系判定算法进行优化.实验数据显示,优化后算法的执行效率平均提高20%.该策略具有普遍性,对所有使用类似算法的静态类型化XML处理语言都有效.

数控自动编程专家系统

本文简要地介绍了数控自动编程专家系统.其中包括:专家系统知识表示的形式;分层次的黑板结构;前向推理求解策略和相应的解释功能;系统针对不同类型的曲线组合,采用不同的独立的知识源(KS)进行处理.由于在知识的处理上采用编码技术,在前向推理求解策略中使用启发信息和“剪技”技术,提高了系统的时空效率.系统中的规划程序能自动规划切削路径.输出供数控车床使用的 NC 代码,并可在显示屏上进行图形显示和切削仿真.目前原型系统已经在 IBM-PC 和 Sun3/60计算机上利用FORTRAN 语言实现.

A Radial Basis Function Approach to Financial Time Series Analysis

Nonlinear multivariate statistical techniques on fast computers offer the potential to capture more of the dynamics of the high dimensional, noisy systems underlying financial markets than traditional models, while making fewer restrictive assumptions. This thesis presents a collection of practical techniques to address important estimation and confidence issues for Radial Basis Function networks arising from such a data driven approach, including efficient methods for parameter estimation and pruning, a pointwise prediction error estimator, and a methodology for controlling the "data mining'' problem. Novel applications in the finance area are described, including customized, adaptive option pricing and stock price prediction.

Hypothesizing Device Mechanisms: Opening Up the Black Box

I describe an approach to forming hypotheses about hidden mechanism configurations within devices given external observations and a vocabulary of primitive mechanisms. An implemented causal modelling system called JACK constructs explanations for why a second piece of toast comes out lighter, why the slide in a tire gauge does not slip back inside when the gauge is removed from the tire, and how in a refrigerator a single substance can serve as a heat sink for the interior and a heat source for the exterior. I report the number of hypotheses admitted for each device example, and provide empirical results which isolate the pruning power due to different constraint sources.

Heuristics for Job-Shop Scheduling

Two methods of obtaining approximate solutions to the classic General Job-shop Scheduling Program are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules. The selected space pruning constraints are then used to reduce the search space and the sampling is repeated. This approach can be used either to verify whether some set of space pruning constraints can prune with discrimination or to generate solutions directly. Schedules can be represented as trajectories through a Cartesian space. Under the objective criteria of Minimum maximum Lateness family of "good" schedules (trajectories) are geometric neighbors (reside with some "tube") in this space. This second method of generating solutions takes advantage of this adjacency by pruning the space from the outside in thus converging gradually upon this "tube." One the average this methods significantly outperforms an array of the Priority Dispatch rules when the object criteria is that of Minimum Maximum Lateness. It also compares favorably with a recent relaxation procedure.

A cultura da gravioleira (Annona muricata L.).

Informacoes sobre o cultivo da graviola envolvendo: clima, solo, descricao botanica, variedades, propagacao, procedimentos para obtencao de mudas, preparo da area e plantio definitivo, tratos culturais (poda, capina, adubacao, doencas, pragas), floracao, frutificacao, producao, colheita, comercializacao, coeficiente tecnico, em Manaus-AM (Brasil).

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.

Spatiotemporal Gesture Segmentation

Spotting patterns of interest in an input signal is a very useful task in many different fields including medicine, bioinformatics, economics, speech recognition and computer vision. Example instances of this problem include spotting an object of interest in an image (e.g., a tumor), a pattern of interest in a time-varying signal (e.g., audio analysis), or an object of interest moving in a specific way (e.g., a human's body gesture). Traditional spotting methods, which are based on Dynamic Time Warping or hidden Markov models, use some variant of dynamic programming to register the pattern and the input while accounting for temporal variation between them. At the same time, those methods often suffer from several shortcomings: they may give meaningless solutions when input observations are unreliable or ambiguous, they require a high complexity search across the whole input signal, and they may give incorrect solutions if some patterns appear as smaller parts within other patterns. In this thesis, we develop a framework that addresses these three problems, and evaluate the framework's performance in spotting and recognizing hand gestures in video. The first contribution is a spatiotemporal matching algorithm that extends the dynamic programming formulation to accommodate multiple candidate hand detections in every video frame. The algorithm finds the best alignment between the gesture model and the input, and simultaneously locates the best candidate hand detection in every frame. This allows for a gesture to be recognized even when the hand location is highly ambiguous. The second contribution is a pruning method that uses model-specific classifiers to reject dynamic programming hypotheses with a poor match between the input and model. Pruning improves the efficiency of the spatiotemporal matching algorithm, and in some cases may improve the recognition accuracy. The pruning classifiers are learned from training data, and cross-validation is used to reduce the chance of overpruning. The third contribution is a subgesture reasoning process that models the fact that some gesture models can falsely match parts of other, longer gestures. By integrating subgesture reasoning the spotting algorithm can avoid the premature detection of a subgesture when the longer gesture is actually being performed. Subgesture relations between pairs of gestures are automatically learned from training data. The performance of the approach is evaluated on two challenging video datasets: hand-signed digits gestured by users wearing short sleeved shirts, in front of a cluttered background, and American Sign Language (ASL) utterances gestured by ASL native signers. The experiments demonstrate that the proposed method is more accurate and efficient than competing approaches. The proposed approach can be generally applied to alignment or search problems with multiple input observations, that use dynamic programming to find a solution.