989 resultados para Sink nodes


Relevância:

20.00% 20.00%

Publicador:

Resumo:

OBJETIVO: Avaliar os efeitos do ácido acetilsalicílico a 10% e 20% em linfonodos mesentéricos de coelhos para posterior embasamento e uso em metástases linfonodais. MÉTODOS: Um total de 20 linfonodos de 20 coelhos (divididos aleatoriamente em quatro grupos) foi avaliado. As soluções de aspirina a 10% (grupos A e C) e 20% (grupos B e D) foram injetadas em linfonodos mesentéricos de coelhos sadios e seus efeitos macroscópicos e histológicos foram avaliados em 24 horas (grupos A e B) e em sete dias (grupos C e D). RESULTADOS: Nos grupos avaliados em 24 horas (A e B) foi verificada intensa necrose e hemorragia, aumento importante de apoptose em todo o linfonodo, com alargamento dos seios medulares e aumento dos centros germinativos. Nos grupos avaliados em sete dias (C e D) também houve aumento da apoptose, com maior elevação de histiócitos e diminuição importante da necrose; a hemorragia foi ausente e aumento de células gigantes foi visualizado, conferindo processo inflamatório crônico do tipo corpo estranho. Não houve diferença entre as concentrações utilizadas (10 e 20%) em nenhuma das comparações. CONCLUSÕES: A injeção de aspirina em linfonodos causou necrose e um aumento de apoptose após 24 horas e após sete dias de tratamento, houve regeneração dos gânglios linfáticos, com diminuição intensa de necrose e grande aumento de apoptose. Uma vez que o aumento de apoptose é um dos pilares dos tratamentos antineoplásicos, estes resultados experimentais embasam eventual aplicação clínica da aspirina no tratamento de metástases linfonodais.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Leishmune (R) vaccine is the first licensed vaccine against canine visceral leishmaniasis. It contains the Fucose-Mannose-ligand (FML) antigen of Leishmania donovani. The potential Leishmune (R) vaccine effect on the interruption of the transmission of the disease, was assayed by monitoring, in untreated (n = 40) and vaccinated dogs (n = 32) of a Brazilian epidemic area: the kala-azar clinical signs, the FML-seropositivity and the Leishmania parasite evidence by immunohistochemistry of skin and PCR for Leishmanial DNA of lymph node and blood samples. on month I I after vaccination, untreated controls showed: 25% of symptomatic cases, 50% of FML-seropositivity, 56.7% of lymph node PCR, 15.7% of blood PCR and 25% of immunohistochemical positive reactions. The Leishmune (R)-vaccinated dogs showed 100% of seropositivity to FML and a complete absence of clinical signs and of parasites (0%) in skin, lymph node and blood PCR samples (P < 0.01). The positivity in FML-ELISA in untreated dogs significantly correlates with the PCR in lymph node samples (p < 0.001) and with the increase in number of symptoms (p = 0.006) being strong markers of infectiousness. The absence of symptoms and of evidence of Leishmania DNA and parasites in Leishmune (R)-vaccinated animals indicates the non-infectious condition of the Leishmune (R)-vaccinated dogs. (c) 2005 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The authors compare the detection of metastases in sentinel lymph nodes (SLNs) and nonsentinel lymph nodes (NSLNs) using hematoxvlin-eosin (HE) staining versus immunohistochemistry (IHC). Thirty-six patients with breast carcinoma undergo exeresis of the primary tumor and of 50 SLNs and 491 NSLNs. Sentinel lymph nodes are sectioned into transverse slices of 2- to 3-mm thickness, and a cytologic smear and a frozen section were obtained from each slice. The slices are completely cut into serial sections at 100-mu m intervals. Two consecutive 4-mu m-thick sections are then obtained from each level and were prepared for HE staining and IHC. Nonsentinel lymph nodes are evaluated similarly to SLNs. The authors obtain 4076 SLN sections and 32 012 NSLN sections, fora total of 36 088 sections. A comparison of HE staining versus IHC based on the total number of sections shows a sensitivity of 93.8%, a negative predictive value of 98.9%, and an accuracy of 99.1 %. The values obtained by HE staining are similar to those obtained by IHC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Wireless Sensor Networks (WSN) are a special kind of ad-hoc networks that is usually deployed in a monitoring field in order to detect some physical phenomenon. Due to the low dependability of individual nodes, small radio coverage and large areas to be monitored, the organization of nodes in small clusters is generally used. Moreover, a large number of WSN nodes is usually deployed in the monitoring area to increase WSN dependability. Therefore, the best cluster head positioning is a desirable characteristic in a WSN. In this paper, we propose a hybrid clustering algorithm based on community detection in complex networks and traditional K-means clustering technique: the QK-Means algorithm. Simulation results show that QK-Means detect communities and sub-communities thus lost message rate is decreased and WSN coverage is increased. © 2012 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Visceral leishmaniasis (VL), also known as kala-azar, is a disseminated protozoan infection caused by Leishmania donovani complex. Traditionally the definite diagnosis is made by amastigote detection in the tissue. The aim this study was to evaluate the PCR technique in stained slides of bone marrow and lymph nodes aspirates with suspect diagnosis for leishmaniasis. Slides were selected totaling 62 suspect cases (33 bone marrow samples and 29 lymph node samples) and 17 positive cases (8 bone marrow and 9 lymph node). From 62 suspect cases, 39 (62.90%) were confirmed to be positive being 17 (n = 29) lymph node aspirates and 22 (n = 33) bone marrow. This finding is in agreement with the higher sensitivity of the PCR assay compared to direct microscopic observation. In conclusion, the findings of this study supports the use of PCR on archive cytological preparation stained slides for the diagnosis of canine visceral leishmaniasis, emphasizing the higher sensitivity of this technique when compared to direct microscopic examination and mostly the use of the suspect status for the cytology samples that presents the previously mentioned particularities with focus on detecting the oligosymptomatic or assymptomatic dogs in endemic areas functioning as potential reservoirs for this disease. (C) 2014 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The presence of metastatic lymph nodes is a relevant aspect in the treatment of head and neck cancer, bringing about a 50% reduction in survival. Objective: To assess the number of lymph nodes removed in the neck dissection and their relationship with the prognosis. Methods: A retrospective study involving 143 patients with tongue and mouth floor epidermoid carcinoma, which histological exam showed no lymph node metastases. Among those, 119 were males and 24 females, with mean age of 54 years. As to the primary tumor site, 65 were in the tongue and 78 in the mouth floor. T stage distribution was of four T1, 84 T2, 36 T3 and 19 T4. We carried out 176 neck dissections, unilateral in 110 cases and bilateral in 33. Of these, 78 were radical and 98 selective. The patients were broken down into three groups, according to the 33 and 66 percentiles of the number of lymph nodes resected. Results: The mean number of resected lymph nodes was 27; 24 in selective dissections and 31 in the complete ones. We did not have statistically significant differences when associated to the T and N stages. Conclusions: The larger number of lymph nodes dissected in the neck dissection identifies the group of better prognoses among pN0 cases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports results regarding the properties of accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the exploration time), conjecture that the maximum accessibility implies the minimal exploration time, and confirm the relationship between the accessibility values and the number of nodes visited after a basic time unit. The latter relationship is investigated with respect to three types of dynamics: traditional random walks, self-avoiding random walks, and preferential random walks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Small scale fluid flow systems have been studied for various applications, such as chemical reagent dosages and cooling devices of compact electronic components. This work proposes to present the complete cycle development of an optimized heat sink designed by using Topology Optimization Method (TOM) for best performance, including minimization of pressure drop in fluid flow and maximization of heat dissipation effects, aiming small scale applications. The TOM is applied to a domain, to obtain an optimized channel topology, according to a given multi-objective function that combines pressure drop minimization and heat transfer maximization. Stokes flow hypothesis is adopted. Moreover, both conduction and forced convection effects are included in the steady-state heat transfer model. The topology optimization procedure combines the Finite Element Method (to carry out the physical analysis) with Sequential Linear Programming (as the optimization algorithm). Two-dimensional topology optimization results of channel layouts obtained for a heat sink design are presented as example to illustrate the design methodology. 3D computational simulations and prototype manufacturing have been carried out to validate the proposed design methodology.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Large scale wireless adhoc networks of computers, sensors, PDAs etc. (i.e. nodes) are revolutionizing connectivity and leading to a paradigm shift from centralized systems to highly distributed and dynamic environments. An example of adhoc networks are sensor networks, which are usually composed by small units able to sense and transmit to a sink elementary data which are successively processed by an external machine. Recent improvements in the memory and computational power of sensors, together with the reduction of energy consumptions, are rapidly changing the potential of such systems, moving the attention towards datacentric sensor networks. A plethora of routing and data management algorithms have been proposed for the network path discovery ranging from broadcasting/floodingbased approaches to those using global positioning systems (GPS). We studied WGrid, a novel decentralized infrastructure that organizes wireless devices in an adhoc manner, where each node has one or more virtual coordinates through which both message routing and data management occur without reliance on either flooding/broadcasting operations or GPS. The resulting adhoc network does not suffer from the deadend problem, which happens in geographicbased routing when a node is unable to locate a neighbor closer to the destination than itself. WGrid allow multidimensional data management capability since nodes' virtual coordinates can act as a distributed database without needing neither special implementation or reorganization. Any kind of data (both single and multidimensional) can be distributed, stored and managed. We will show how a location service can be easily implemented so that any search is reduced to a simple query, like for any other data type. WGrid has then been extended by adopting a replication methodology. We called the resulting algorithm WRGrid. Just like WGrid, WRGrid acts as a distributed database without needing neither special implementation nor reorganization and any kind of data can be distributed, stored and managed. We have evaluated the benefits of replication on data management, finding out, from experimental results, that it can halve the average number of hops in the network. The direct consequence of this fact are a significant improvement on energy consumption and a workload balancing among sensors (number of messages routed by each node). Finally, thanks to the replications, whose number can be arbitrarily chosen, the resulting sensor network can face sensors disconnections/connections, due to failures of sensors, without data loss. Another extension to {WGrid} is {W*Grid} which extends it by strongly improving network recovery performance from link and/or device failures that may happen due to crashes or battery exhaustion of devices or to temporary obstacles. W*Grid guarantees, by construction, at least two disjoint paths between each couple of nodes. This implies that the recovery in W*Grid occurs without broadcasting transmissions and guaranteeing robustness while drastically reducing the energy consumption. An extensive number of simulations shows the efficiency, robustness and traffic road of resulting networks under several scenarios of device density and of number of coordinates. Performance analysis have been compared to existent algorithms in order to validate the results.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recent progress in microelectronic and wireless communications have enabled the development of low cost, low power, multifunctional sensors, which has allowed the birth of new type of networks named wireless sensor networks (WSNs). The main features of such networks are: the nodes can be positioned randomly over a given field with a high density; each node operates both like sensor (for collection of environmental data) as well as transceiver (for transmission of information to the data retrieval); the nodes have limited energy resources. The use of wireless communications and the small size of nodes, make this type of networks suitable for a large number of applications. For example, sensor nodes can be used to monitor a high risk region, as near a volcano; in a hospital they could be used to monitor physical conditions of patients. For each of these possible application scenarios, it is necessary to guarantee a trade-off between energy consumptions and communication reliability. The thesis investigates the use of WSNs in two possible scenarios and for each of them suggests a solution that permits to solve relating problems considering the trade-off introduced. The first scenario considers a network with a high number of nodes deployed in a given geographical area without detailed planning that have to transmit data toward a coordinator node, named sink, that we assume to be located onboard an unmanned aerial vehicle (UAV). This is a practical example of reachback communication, characterized by the high density of nodes that have to transmit data reliably and efficiently towards a far receiver. It is considered that each node transmits a common shared message directly to the receiver onboard the UAV whenever it receives a broadcast message (triggered for example by the vehicle). We assume that the communication channels between the local nodes and the receiver are subject to fading and noise. The receiver onboard the UAV must be able to fuse the weak and noisy signals in a coherent way to receive the data reliably. It is proposed a cooperative diversity concept as an effective solution to the reachback problem. In particular, it is considered a spread spectrum (SS) transmission scheme in conjunction with a fusion center that can exploit cooperative diversity, without requiring stringent synchronization between nodes. The idea consists of simultaneous transmission of the common message among the nodes and a Rake reception at the fusion center. The proposed solution is mainly motivated by two goals: the necessity to have simple nodes (to this aim we move the computational complexity to the receiver onboard the UAV), and the importance to guarantee high levels of energy efficiency of the network, thus increasing the network lifetime. The proposed scheme is analyzed in order to better understand the effectiveness of the approach presented. The performance metrics considered are both the theoretical limit on the maximum amount of data that can be collected by the receiver, as well as the error probability with a given modulation scheme. Since we deal with a WSN, both of these performance are evaluated taking into consideration the energy efficiency of the network. The second scenario considers the use of a chain network for the detection of fires by using nodes that have a double function of sensors and routers. The first one is relative to the monitoring of a temperature parameter that allows to take a local binary decision of target (fire) absent/present. The second one considers that each node receives a decision made by the previous node of the chain, compares this with that deriving by the observation of the phenomenon, and transmits the final result to the next node. The chain ends at the sink node that transmits the received decision to the user. In this network the goals are to limit throughput in each sensor-to-sensor link and minimize probability of error at the last stage of the chain. This is a typical scenario of distributed detection. To obtain good performance it is necessary to define some fusion rules for each node to summarize local observations and decisions of the previous nodes, to get a final decision that it is transmitted to the next node. WSNs have been studied also under a practical point of view, describing both the main characteristics of IEEE802:15:4 standard and two commercial WSN platforms. By using a commercial WSN platform it is realized an agricultural application that has been tested in a six months on-field experimentation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[EN] This paper deals with the study of some new properties of the intrinsic order graph. The intrinsic order graph is the natural graphical representation of a complex stochastic Boolean system (CSBS). A CSBS is a system depending on an arbitrarily large number n of mutually independent random Boolean variables. The intrinsic order graph displays its 2n vertices (associated to the CSBS) from top to bottom, in decreasing order of their occurrence probabilities. New relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. Further, the distribution of the weights of the 2n nodes in the intrinsic order graph is analyzed…