935 resultados para point-to-segment algorithm
Resumo:
The paper is the outcome of a systematic effort to study and analyze the experiences of the Kirtipur Housing Project (KHP), the first ever grassroots-led squatter resettlement project in Kathmandu. It is widely hailed as a success story as it has been able to provide a legal, affordable and good quality housing solution to the Sukumbasis through grassroots mobilization. The paper analyses the dynamics of this mobilization and the roles of different actors to show how community empowerment, civil actions and local government interests have converged to create a constructive partnership in line with wider enabling principles. Apart from meeting the narrowly defined objective to rehouse 44 households, the project reflects capacity of the community, quite apart from lobbying and protest, in areas of project planning and management. While no grassroots mobilisation can be expected to replicate in a dynamic environment, the paper draws some policy insights that indicate the ability of the grassroots mobilization in Kathmandu to continue and grow. Conversely, the lessons learned from the project also point to limitations in terms lack of prerequisite critical mass or economic benefits to influence the government to prepare a policy framework under which it can foster in a more structured way.
Resumo:
Abstract A classic physiologic response to hypoxia in humans is the up-regulation of the ERYTHROPOIETIN (EPO) gene, which is the central regulator of red blood cell mass. The EPO gene, in turn, is activated by hypoxia inducible factor (HIF). HIF is a transcription factor consisting of an alpha subunit (HIF-alpha) and a beta subunit (HIF-beta). Under normoxic conditions, prolyl hydroxylase domain protein (PHD, also known as HIF prolyl hydroxylase and egg laying-defective nine protein) site specifically hydroxylates HIF-alpha in a conserved LXXLAP motif (where underlining indicates the hydroxylacceptor proline). This provides a recognition motif for the von Hippel Lindau protein, a component of an E3 ubiquitin ligase complex that targets hydroxylated HIF-alpha for degradation. Under hypoxic conditions, this inherently oxygen-dependent modification is arrested, thereby stabilizing HIF-alpha and allowing it to activate the EPO gene. We previously identified and characterized an erythrocytosis-associated HIF2A mutation, G537W. More recently, we reported two additional erythrocytosis-associated HIF2A mutations, G537R and M535V. Here, we describe the functional characterization of these two mutants as well as a third novel erythrocytosis-associated mutation, P534L. These mutations affect residues C-terminal to the LXXLAP motif. We find that all result in impaired degradation and thus aberrant stabilization of HIF-2alpha. However, each exhibits a distinct profile with respect to their effects on PHD2 binding and von Hippel Lindau interaction. These findings reinforce the importance of HIF-2alpha in human EPO regulation, demonstrate heterogeneity of functional defects arising from these mutations, and point to a critical role for residues C-terminal to the LXXLAP motif in HIF-alpha.
Resumo:
In this paper, we present a methodology for implementing a complete Digital Signal Processing (DSP) system onto a heterogeneous network including Field Programmable Gate Arrays (FPGAs) automatically. The methodology aims to allow design refinement and real time verification at the system level. The DSP application is constructed in the form of a Data Flow Graph (DFG) which provides an entry point to the methodology. The netlist for parts that are mapped onto the FPGA(s) together with the corresponding software and hardware Application Protocol Interface (API) are also generated. Using a set of case studies, we demonstrate that the design and development time can be significantly reduced using the methodology developed.
Resumo:
Common variable immunodeficiency (CVID) is a primary immunodeficiency characterized by hypogammaglobulinaemia and antibody deficiency to both T dependent and independent antigens. Patients suffer from recurrent sinopulmonary infections mostly caused by Streptococcus pneumoniae and Haemophilus influenzae, but also gastrointestinal or autoimmune symptoms. Their response to vaccination is poor or absent. In this study we investigated B cell activation induced by the TLR9 specific ligand (CpG-ODN) and bacterial extracts from S. pneumoniae and H. influenzae known to stimulate several TLR. We found that B cells from CVID patients express lower levels of CD86 after stimulation with CpG-ODN, S. pneumoniae and H. influenzae extracts in combination with anti-IgM antibody and also display a lower proliferative index when stimulated with bacterial extracts. Our results point to a broad TLR signalling defect in B lymphocytes from CVID patients that may be related to the hypogammaglobulinaemia and poor response to vaccination characteristic of these patients.
Resumo:
In recent years, gradient vector flow (GVF) based algorithms have been successfully used to segment a variety of 2-D and 3-D imagery. However, due to the compromise of internal and external energy forces within the resulting partial differential equations, these methods may lead to biased segmentation results. In this paper, we propose MSGVF, a mean shift based GVF segmentation algorithm that can successfully locate the correct borders. MSGVF is developed so that when the contour reaches equilibrium, the various forces resulting from the different energy terms are balanced. In addition, the smoothness constraint of image pixels is kept so that over- or under-segmentation can be reduced. Experimental results on publicly accessible datasets of dermoscopic and optic disc images demonstrate that the proposed method effectively detects the borders of the objects of interest.
Resumo:
Bulk paleosol samples collected from a Middle to Early Miocene moraine in the New Mountain area of the Dry Valleys, Antarctica, yielded Coleoptera exoskeletons and occasional endoskeletons showing considerable diagenetic effects along with several species of bacteria, all lodged in a dry-frozen but salt-rich horizon at shallow depth to the land surface. The till is at the older end of a chronologic sequence of glacial deposits, thought to have been deposited before the transition from wet-based to cold-based ice (similar to 15 Ma), and hence, entirely weathered in contact with the subaerial atmosphere. It is possible, though not absolutely verifiable, that the skeletons date from this early stage of emplacement having undergone modifications whenever light snowmelt occurred or salt concentrations lowered the freezing temperature to maintain water as liquid. Correlation of the Coleoptera species with cultured bacteria in the sample and the likelihood of co-habitation with Beauveria bassiani found in two adjacent, although younger paleosols, leads to new questions about the antiquity of the Coleoptera and the source of N and glucose from chitinase derived from the insects. The skeletons in the 831 section may date close to the oldest preserved chitin (Oligocene) yet found on Earth. While harsh Martian conditions make it seemingly intolerable for complex, multicellular organisms such as insects to exist in the near-surface and subaerially, life within similar cold, dry paleosol microenvironments (Cryosols) of Antarctica point to life potential for the Red Planet, especially when considering the relatively diverse microbe (bacteria and fungi) population. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.
Resumo:
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.
Resumo:
Life science research aims to continuously improve the quality and standard of human life. One of the major challenges in this area is to maintain food safety and security. A number of image processing techniques have been used to investigate the quality of food products. In this paper,we propose a new algorithm to effectively segment connected grains so that each of them can be inspected in a later processing stage. One family of the existing segmentation methods is based on the idea of watersheding, and it has shown promising results in practice.However,due to the over-segmentation issue,this technique has experienced poor performance in various applications,such as inhomogeneous background and connected targets. To solve this problem,we present a combination of two classical techniques to handle this issue.In the first step,a mean shift filter is used to eliminate the inhomogeneous background, where entropy is used to be a converging criterion. Secondly,a color gradient algorithm is used in order to detect the most significant edges, and a marked watershed transform is applied to segment cluttered objects out of the previous processing stages. The proposed framework is capable of compromising among execution time, usability, efficiency and segmentation outcome in analyzing ring die pellets. The experimental results demonstrate that the proposed approach is effectiveness and robust.
Resumo:
We present an implementation of quantum annealing (QA) via lattice Green's function Monte Carlo (GFMC), focusing on its application to the Ising spin glass in transverse field. In particular, we study whether or not such a method is more effective than the path-integral Monte Carlo- (PIMC) based QA, as well as classical simulated annealing (CA), previously tested on the same optimization problem. We identify the issue of importance sampling, i.e., the necessity of possessing reasonably good (variational) trial wave functions, as the key point of the algorithm. We performed GFMC-QA runs using such a Boltzmann-type trial wave function, finding results for the residual energies that are qualitatively similar to those of CA (but at a much larger computational cost), and definitely worse than PIMC-QA. We conclude that, at present, without a serious effort in constructing reliable importance sampling variational wave functions for a quantum glass, GFMC-QA is not a true competitor of PIMC-QA.
Resumo:
In this paper we seek to develop a ‘relational’ perspective on accountability and on so-called ‘unaccountability.’. We focus on Mark Bovens’s use of the forum metaphor in his accountability model, arguing that his relational perspective is too narrow. We advocate instead a far broader and more fundamental engagement with the idea of relational accountability. Expanding the metaphors, we point to two other accountability spaces: ‘agora,’ a primordial accountability space and ‘bazaar,’ an emergent accountability space rooted in ground-level exchange between different actors. Assertions about ‘unaccountability,’ we argue, very often reflect a failure to appreciate the fundamentally relational nature of accountability: those who use such assertions as bases for action aimed at making situations, processes or people ‘more accountable’ in fact seek to assert or impose a certain form of relationship – one that is hierarchical and monopolistic – and reflect therefore a drive to power and domination.
Resumo:
Economic dispatch (ED) problems often exhibit non-linear, non-convex characteristics due to the valve point effects. Further, various constraints and factors, such as prohibited operation zones, ramp rate limits and security constraints imposed by the generating units, and power loss in transmission make it even more challenging to obtain the global optimum using conventional mathematical methods. Meta-heuristic approaches are capable of solving non-linear, non-continuous and non-convex problems effectively as they impose no requirements on the optimization problems. However, most methods reported so far mainly focus on a specific type of ED problems, such as static or dynamic ED problems. This paper proposes a hybrid harmony search with arithmetic crossover operation, namely ACHS, for solving five different types of ED problems, including static ED with valve point effects, ED with prohibited operating zones, ED considering multiple fuel cells, combined heat and power ED, and dynamic ED. In this proposed ACHS, the global best information and arithmetic crossover are used to update the newly generated solution and speed up the convergence, which contributes to the algorithm exploitation capability. To balance the exploitation and exploration capabilities, the opposition based learning (OBL) strategy is employed to enhance the diversity of solutions. Further, four commonly used crossover operators are also investigated, and the arithmetic crossover shows its efficiency than the others when they are incorporated into HS. To make a comprehensive study on its scalability, ACHS is first tested on a group of benchmark functions with a 100 dimensions and compared with several state-of-the-art methods. Then it is used to solve seven different ED cases and compared with the results reported in literatures. All the results confirm the superiority of the ACHS for different optimization problems.
Resumo:
Seeds are traditionally considered as common or even public goods, their traits as ‘products of nature’. They are also essential to biodiversity, food security and food sovereignty. However, a suite of techno-legal interventions has legislated the enclosure of seeds: seed patents, plant variety protections, and stewardship agreements. These instruments create and protect private proprietary interests over plant material and point to the interface between seeds, capitalism, and law. In the following article, we consider the latest innovations, the bulk of which have been directed toward genetically disabling the reproductive capacities of seeds (terminator technology) or tying these capacities to outputs (‘round-up necessary’). In both instances, scarcity moves from artificial to real.
For the agro-industrial complex, the innovations are perfectly rational as they can simultaneously control supply and demand. For those outside the complex, however, the consequences are potentially ruinous. The practices of seed-saving and exchange no longer are feasible, even covertly. Contemporary genetic controls have upped the ante, by either disabling the reproductive capacity of seeds or, through cross-pollination and outcrossing, facilitating the autonomous spread of the genetic modifications that are importantly still traceable, identifiable and therefore capable of legal protection. In both instances, genuine scarcity becomes the new standard as private interests dominate what was a public sphere.
Resumo:
Mutual variation of the received signal which occurs as a consequence of the channel reciprocity property has recently been proposed as a viable method for secret key generation. However, this cannot be strictly maintained in practice as the property is applicable only in the absence of interference. To ensure the propagation defined key remains secret, one requirement is that there remain high degrees of uncertainty between the legitimate users channel response and that of any eavesdropper's. In this paper, we investigate whether such de-correlation occurs for an indoor point-to-point link at 2.45 GHz. This is achieved by computing the localized correlation coefficient between the simultaneous channel response measured by the legitimate users and that of multiple distributed eavesdroppers for static and dynamic scenarios.
Resumo:
O cádmio (Cd) é um metal não essencial e é considerado um poluente prioritário pela comunidade europeia. Este metal atinge o ambiente no decurso de várias actividades antropogénicas e tende a concentrar-se nos solos e sedimentos, onde está potencialmente disponível para as plantas, sendo posteriormente transferido através da cadeia trófica. Neste contexto, o principal objectivo da presente dissertação foi o estudo dos efeitos da assimilação e da acumulação de Cd em plantas e as suas consequências para animais consumidores. Numa primeira fase, foram estudados os principais efeitos fisiológicos e genotóxicos do Cd em plantas. As plantas de alface (Lactuca sativa L.) expostas a Cd apresentaram um decréscimo na eficiência fotossintética, aumento de peroxidação lipídica e alterações significativas na actividade de enzimas de stress oxidativo. Estas alterações culminaram num decréscimo do crescimento da parte aérea no final da exposição. As respostas obtidas pelos parâmetros bioquímicos sugerem que estes poderão ser utilizados como eventuais biomarcadores em testes ecotoxicológicos com Cd em abordagens integrantes em conjunto com parâmetros clássicos. Os efeitos mutagénicos de Cd foram avaliados através da determinação da instabilidade de microsatélites (IM). Não foi observada IM, nem nas folhas nem nas raízes de plantas de alface com 5 semanas de idade expostas a 100 μM Cd durante 14 dias, no entanto observou-se IM em raízes de alface exposta a 10 μM Cd durante 28 dias desde a germinação. A idade da planta e a maior acumulação de Cd nas raízes poderão explicar os resultados obtidos. A clastogenicidade de Cd foi analisada em três espécies vegetais com diferentes capacidades de destoxificação e acumulação de metais através de citometria de fluxo. Foram detectadas alterações significativas nos parâmetros analisados em raízes alface, mas não nas espécies Thlaspi caerulescens J & C Presl e Thlaspi arvense L. Estes resultados sugerem que o stress provocado pelo Cd originou clastogenicidade como consequência da perda de porções de cromossomas, uma vez que o conteúdo de ADN nuclear diminuiu. A transferência trófica através da cadeia alimentar permanece muito pouco estudada em termos ecotoxicológicos. A distribuição subcellular de metais num organismo pode ser utilizada para compreender a transferência trófica de um metal na cadeia alimentar. Como tal, numa última parte é estudado de que modo a distribuição subcellular do Cd em plantas com perfis de acumulação de Cd distintos afecta a biodisponibilidade e transferência trófica de Cd para isópodes. A distribuição de Cd entre as 4 fracções subcelulares obtidas através de centrifugação diferencial revelou a existência de diferenças significativas entre as espécies de plantas. Estes resultados em conjunto com a avaliação directa da eficiência de assimilação (EA) de Cd individual de cada uma das quatro fracções subcelulares das plantas em estudo, resultou em informação de grande relevância para a explicação das diferenças observadas na EA de Cd por parte de isópodes alimentados com folhas de diferentes espécies de plantas. Com base nos resultados obtidos, o Cd ligado a proteínas estáveis à temperatura (e.g. metaloteoninas e fitoquelatinas) é o menos biodisponível, sendo assim o que menos contribuiu para a transferência trófica, enquanto que o Cd ligado a proteínas desnaturadas pela temperatura foi a fracção mais disponível para transferência trófica de Cd ao isópode. Estes resultados realçam a relevância ecológica da distribuição subcelular de Cd em plantas que tem influência directa na tranferência trófica deste metal para os consumidores e ainda o facto de que alterações na distribuição subcelular de Cd em plantas devido a diferentes mecanismos de destoxificação poderá ter um impacto directo na transferência trófica de Cd para o animal consumidor.