773 resultados para Collaborative Network Model
Resumo:
This study aimed to identify the post-graduation programs in Speech Pathology in Brazil, present the production of professors of these programs in the aspects of documentary typologies and present the evolution of this production up to year 2011, delineate the collaborative networks between professors and between institutions, as well as to present the indicators of networks. By accessing the Capes website, eight post-graduation programs were found, revealing a list with a total of 118 professors in Brazil. Data were extracted from the Lattes Platform using the ScriptLattes. The graphs were created in Excel, the networks were traced using the software Ucinet and the density and centrality indicators were calculated. It was observed that most courses are located in the South and Southeast regions of the country and, even though this is a recent field, it presents a significant collaborative network.
Resumo:
The aim of the present research is to analyse Ancib’s scientific production in the workgroup GT7 named Production and Communication of Information in ST&I, between the years of 2003 and 2009, through bibliometric indicators, from which it is possible to indicate what is more important or significant within a scientific field or context, so as to therefore analyse trends, existing relations or processes. The bibliometric studies are an approach method for the analysis of science behaviour in a given field. More specifically, by means of production and connection indicators, it aims at revealing and portraying the most productive authors, the kind of authorship present in this group, the most recurrent themes, most productive institutions, and the collaborative network determined by the institutional coauthorships and their indicators, so as to map and visualize the main researchers and institutions of the present GT, within the period of time in question. The research procedure derived from studying the 94 research project results presented in the period, where the paper reference, summary and corresponding key words can be found. Analysis concerning the most productive authors, most recurrent themes, kinds of authorship and most productive institutions have been carried out from the variables under review. The collaborative network between the institutions was built using the Pajek software, and, with the help of the Ucinet software, indicators of degree centrality, betweeness centrality, and closeness centrality have been reached, besides the calculation of density. The results point to 11 researchers and 9 institutions as the most productive ones. The collaborative institutional network was shown to be fragile, presenting low density, and in general the participating institutions have presented low centrality indexes. As a conclusion, it has been observed that the themes focus, in general, on bibliometric analysis and their indicators, using regional and national data as their universe.
Resumo:
The objective of this research is to analyze the scientific production about „Metric Studies‟. It was used the data base BRAPCI (data base of articles and journals in Information Science) to outline the authors and institutions that produced more. As research procedure it was analyzed the articles with the keywords that represent the area of metric studies such as: Bibliometric, Cientometric, Informetric, Webmetric and Patentometric between 1991 and 2011. It was analyzed the variable in study, building the collaborative network through the software Pajek. From these results, it was possible to delineate the tendencies presented in the scientific community on this subject from the data base BRAPCI.
Resumo:
This research aimed to identify the scientific production for articles published in its typology of the Post Graduated Program in Information Science, Unesp, Marília. Particularly, it was evaluated co-authored articles written by researcher teachers from the Program and built networks of scientific collaboration and the calculation of some indicators. As research procedure, reports of CAPES evaluation between the years 2001 to 2009 were considered it articles produced in co-authorship. It was built up a network of co-authoring, using the software Pajek, and calculated the indicators of density and centrality of the network, allowing analysis of the intensity of network connectivity and the role of each player individually and the network as a whole. We analyzed the collaborative network in order to visualize the partnerships among the researchers from the three research lines and between them and their collaborators to verify the connection intensity.
Resumo:
This work shows the importance of taking a good organization of space for the improvement of urban public transport. The model of urban transport is used improperly aggravating factor that generates diseconomies to society. The reduction of the use of public transport, degradation of environmental conditions, chronic congestion, poor accessibility and high rates of traffic accidents are common in many cities. The case study will be done in Jundiaí - SP, where actions were taken to try to reverse this situation of crisis in urban transport, as the change in transport network system. Will analyze the proposals adopted for the implementation of the new network model, steps taken, questionnaires and results from these studies. Verifying the effectiveness of the new transport network model adopted and its reflection with users, those who use the transportation and / or who directly suffer the influences this
Resumo:
Pós-graduação em Design - FAAC
Resumo:
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.
Resumo:
Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.
Resumo:
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.
Resumo:
Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. This study follows the current trend in optical networking industry by utilizing extension of IP control protocols. Dynamic routing algorithms, aware of current regeneration resources and link states, are designed to smartly route the connection requests under quality constraints. A hierarchical network model, supported by the MPLS-based control plane, is also proposed to provide scalability. Experiments show that network performance is improved without placement of extra regenerators.
Resumo:
The issue of whether loliginid squid can influence the average structure of marine ecosystems in a keystone role, i.e. a strong effect with relatively low biomass, has not yet been examined. Here, the diet of Loligo plei in inner shelf waters of the South Brazil Bight was examined, as a first step, based on the stomach contents of 2200 squid hand-jigged in shallow water (, 30 m) and taken as bycatch of shrimp trawlers in deeper water (30-100 m). Diet varied by size, season, and fishing zone. Stomachs were not empty in similar to 12%, with more empty during winter. The range of mantle lengths of squid caught by jigging (101-356 mm) appeared to differ from the squid trawled (30-236 mm), and the diet also differed. Food categories recorded in deeper water did not include amphipods or polychaetes, but in both fishing areas, fish were the most common prey. The fish prey identified included Trachurus lathami, small pelagic species, trichiurids, and Merluccius hubbsi. Demersal species, such as Ctenosciaena gracilicirrhus, and flatfish were also present. An ecosystem network model is updated through which a mixed-trophic impact matrix and ""keystoneness"" indicators were calculated. Loligo plei represents an important link between pelagic and demersal energy pathways, with high indices of keystoneness.
Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution
Resumo:
The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.
Resumo:
We obtain the Paris law of fatigue crack propagation in a fuse network model where the accumulated damage in each resistor increases with time as a power law of the local current amplitude. When a resistor reaches its fatigue threshold, it burns irreversibly. Over time, this drives cracks to grow until the system is fractured into two parts. We study the relation between the macroscopic exponent of the crack-growth rate -entering the phenomenological Paris law-and the microscopic damage accumulation exponent, gamma, under the influence of disorder. The way the jumps of the growing crack, Delta a, and the waiting time between successive breaks, Delta t, depend on the type of material, via gamma, are also investigated. We find that the averages of these quantities, <Delta a > and <Delta t >/< t(r)>, scale as power laws of the crack length a, <Delta a > proportional to a(alpha) and <Delta t >/< t(r)> proportional to a(-beta), where < t(r)> is the average rupture time. Strikingly, our results show, for small values of gamma, a decrease in the exponent of the Paris law in comparison with the homogeneous case, leading to an increase in the lifetime of breaking materials. For the particular case of gamma = 0, when fatigue is exclusively ruled by disorder, an analytical treatment confirms the results obtained by simulation. Copyright (C) EPLA, 2012
Resumo:
The transient and equilibrium properties of dynamics unfolding in complex systems can depend critically on specific topological features of the underlying interconnections. In this work, we investigate such a relationship with respect to the integrate-and-fire dynamics emanating from a source node and an extended network model that allows control of the small-world feature as well as the length of the long-range connections. A systematic approach to investigate the local and global correlations between structural and dynamical features of the networks was adopted that involved extensive simulations (one and a half million cases) so as to obtain two-dimensional correlation maps. Smooth, but diverse surfaces of correlation values were obtained in all cases. Regarding the global cases, it has been verified that the onset avalanche time (but not its intensity) can be accurately predicted from the structural features within specific regions of the map (i.e. networks with specific structural properties). The analysis at local level revealed that the dynamical features before the avalanches can also be accurately predicted from structural features. This is not possible for the dynamical features after the avalanches take place. This is so because the overall topology of the network predominates over the local topology around the source at the stationary state.
Resumo:
The concept of industrial clustering has been studied in-depth by policy makers and researchers from many fields, mainly due to the competitive advantages it may bring to regional economies. Companies often take part in collaborative initiatives with local partners while also taking advantage of knowledge spillovers to benefit from locating in a cluster. Thus, Knowledge Management (KM) and Performance Management (PM) have become relevant topics for policy makers and cluster associations when undertaking collaborative initiatives. Taking this into account, this paper aims to explore the interplay between both topics using a case study conducted in a collaborative network formed within a cluster. The results show that KM should be acknowledged as a formal area of cluster management so that PM practices can support knowledge-oriented initiatives and therefore make better use of the new knowledge created. Furthermore, tacit and explicit knowledge resulting from PM practices needs to be stored and disseminated throughout the cluster as a way of improving managerial practices and regional strategic direction. Knowledge Management Research & Practice (2012) 10, 368-379. doi:10.1057/kmrp.2012.23