452 resultados para feedforward networks
Resumo:
Complex networks have been studied extensively due to their relevance to many real-world systems such as the world-wide web, the internet, biological and social systems. During the past two decades, studies of such networks in different fields have produced many significant results concerning their structures, topological properties, and dynamics. Three well-known properties of complex networks are scale-free degree distribution, small-world effect and self-similarity. The search for additional meaningful properties and the relationships among these properties is an active area of current research. This thesis investigates a newer aspect of complex networks, namely their multifractality, which is an extension of the concept of selfsimilarity. The first part of the thesis aims to confirm that the study of properties of complex networks can be expanded to a wider field including more complex weighted networks. Those real networks that have been shown to possess the self-similarity property in the existing literature are all unweighted networks. We use the proteinprotein interaction (PPI) networks as a key example to show that their weighted networks inherit the self-similarity from the original unweighted networks. Firstly, we confirm that the random sequential box-covering algorithm is an effective tool to compute the fractal dimension of complex networks. This is demonstrated on the Homo sapiens and E. coli PPI networks as well as their skeletons. Our results verify that the fractal dimension of the skeleton is smaller than that of the original network due to the shortest distance between nodes is larger in the skeleton, hence for a fixed box-size more boxes will be needed to cover the skeleton. Then we adopt the iterative scoring method to generate weighted PPI networks of five species, namely Homo sapiens, E. coli, yeast, C. elegans and Arabidopsis Thaliana. By using the random sequential box-covering algorithm, we calculate the fractal dimensions for both the original unweighted PPI networks and the generated weighted networks. The results show that self-similarity is still present in generated weighted PPI networks. This implication will be useful for our treatment of the networks in the third part of the thesis. The second part of the thesis aims to explore the multifractal behavior of different complex networks. Fractals such as the Cantor set, the Koch curve and the Sierspinski gasket are homogeneous since these fractals consist of a geometrical figure which repeats on an ever-reduced scale. Fractal analysis is a useful method for their study. However, real-world fractals are not homogeneous; there is rarely an identical motif repeated on all scales. Their singularity may vary on different subsets; implying that these objects are multifractal. Multifractal analysis is a useful way to systematically characterize the spatial heterogeneity of both theoretical and experimental fractal patterns. However, the tools for multifractal analysis of objects in Euclidean space are not suitable for complex networks. In this thesis, we propose a new box covering algorithm for multifractal analysis of complex networks. This algorithm is demonstrated in the computation of the generalized fractal dimensions of some theoretical networks, namely scale-free networks, small-world networks, random networks, and a kind of real networks, namely PPI networks of different species. Our main finding is the existence of multifractality in scale-free networks and PPI networks, while the multifractal behaviour is not confirmed for small-world networks and random networks. As another application, we generate gene interactions networks for patients and healthy people using the correlation coefficients between microarrays of different genes. Our results confirm the existence of multifractality in gene interactions networks. This multifractal analysis then provides a potentially useful tool for gene clustering and identification. The third part of the thesis aims to investigate the topological properties of networks constructed from time series. Characterizing complicated dynamics from time series is a fundamental problem of continuing interest in a wide variety of fields. Recent works indicate that complex network theory can be a powerful tool to analyse time series. Many existing methods for transforming time series into complex networks share a common feature: they define the connectivity of a complex network by the mutual proximity of different parts (e.g., individual states, state vectors, or cycles) of a single trajectory. In this thesis, we propose a new method to construct networks of time series: we define nodes by vectors of a certain length in the time series, and weight of edges between any two nodes by the Euclidean distance between the corresponding two vectors. We apply this method to build networks for fractional Brownian motions, whose long-range dependence is characterised by their Hurst exponent. We verify the validity of this method by showing that time series with stronger correlation, hence larger Hurst exponent, tend to have smaller fractal dimension, hence smoother sample paths. We then construct networks via the technique of horizontal visibility graph (HVG), which has been widely used recently. We confirm a known linear relationship between the Hurst exponent of fractional Brownian motion and the fractal dimension of the corresponding HVG network. In the first application, we apply our newly developed box-covering algorithm to calculate the generalized fractal dimensions of the HVG networks of fractional Brownian motions as well as those for binomial cascades and five bacterial genomes. The results confirm the monoscaling of fractional Brownian motion and the multifractality of the rest. As an additional application, we discuss the resilience of networks constructed from time series via two different approaches: visibility graph and horizontal visibility graph. Our finding is that the degree distribution of VG networks of fractional Brownian motions is scale-free (i.e., having a power law) meaning that one needs to destroy a large percentage of nodes before the network collapses into isolated parts; while for HVG networks of fractional Brownian motions, the degree distribution has exponential tails, implying that HVG networks would not survive the same kind of attack.
Resumo:
There is a continued need to consider ways to prevent early adolescent engagement in a variety of harmful risk-taking behaviours for example, violence, road-related risks and alcohol use. The current prospective study examined adolescents’ reports of intervening to try and stop friends’ engagement in such behaviours among 207 early adolescents (mean age = 13.51 years, 50.1% females). Findings showed that intervening behaviour after three months was predicted by the confidence to intervene which in turn was predicted by student and teacher support although not parental support. The findings suggest that the benefits of positive relationship experiences might extend to the safety of early adolescent friendship groups particularly through the development of confidence to try and stop friends’ risky and dangerous behaviours. Findings from the study support the important role of the school in creating a culture of positive adolescent behaviour whereby young people take social responsibility.
Resumo:
Participation in networks, both as a concept and process, is widely supported in environmental education as a democratic and equitable pathway to individual and social change for sustainability. However, the processes of participation in networks are rarely problematized. Rather, it is assumed that we inherently know how to participate in networks. This assumption means that participation is seldom questioned. Underlying support for participation in networks is a belief that it allows individuals to connect in new and meaningful ways, that individuals can engage in making decisions and in bringing about change in arenas that affect them, and that they will be engaging in new, non-hierarchical and equitable relationships. In this paper we problematize participation in networks. As an example we use research into a decentralized network – described as such in its own literature - the Queensland Environmentally Sustainable Schools Initiative Alliance in Australia – to argue that while network participants were engaged and committed to participation in this network, 'old' forms of top-down engagement and relationships needed to be unlearnt. This paper thus proposes that for participation in decentralized networks to be meaningful, new learning about how to participate needs to occur.
Resumo:
This paper illustrates the damage identification and condition assessment of a three story bookshelf structure using a new frequency response functions (FRFs) based damage index and Artificial Neural Networks (ANNs). A major obstacle of using measured frequency response function data is a large size input variables to ANNs. This problem is overcome by applying a data reduction technique called principal component analysis (PCA). In the proposed procedure, ANNs with their powerful pattern recognition and classification ability were used to extract damage information such as damage locations and severities from measured FRFs. Therefore, simple neural network models are developed, trained by Back Propagation (BP), to associate the FRFs with the damage or undamaged locations and severity of the damage of the structure. Finally, the effectiveness of the proposed method is illustrated and validated by using the real data provided by the Los Alamos National Laboratory, USA. The illustrated results show that the PCA based artificial Neural Network method is suitable and effective for damage identification and condition assessment of building structures. In addition, it is clearly demonstrated that the accuracy of proposed damage detection method can also be improved by increasing number of baseline datasets and number of principal components of the baseline dataset.
Resumo:
An array of monopole elements with reduced element spacing of λ/6 to λ/20 is considered for application in digital beam-forming and direction-finding. The small element spacing introduces strong mutual coupling between the array elements. This paper discusses that decoupling can be achieved analytically for arrays with three elements and describes Kuroda’s identities to realize the lumped elements of the derived decoupling network. Design procedures and equations are proposed. Experimental results are presented. The decoupled array has a bandwidth of 1% and a superdirective radiation pattern.
Resumo:
Companies and their services are being increasingly exposed to global business networks and Internet-based ondemand services. Much of the focus is on flexible orchestration and consumption of services, beyond ownership and operational boundaries of services. However, ways in which third-parties in the “global village” can seamlessly self-create new offers out of existing services remains open. This paper proposes a framework for service provisioning in global business networks that allows an open-ended set of techniques for extending services through a rich, multi-tooling environment. The Service Provisioning Management Framework, as such, supports different modeling techniques, through supportive tools, allowing different parts of services to be integrated into new contexts. Integration of service user interfaces, business processes, operational interfaces and business object are supported. The integration specifications that arise from service extensions are uniformly reflected through a kernel technique, the Service Integration Technique. Thus, the framework preserves coherence of service provisioning tasks without constraining the modeling techniques needed for extending different aspects of services.
Resumo:
Immigrant entrepreneurship, or, self-employment by immigrants (Light & Bonacich, 1988), has been of growing interest to researchers (Hosler, 1996). This is due in part to major immigrant receiving countries, such as Australia, the United States, Canada, the United Kingdom and Western Europe, experiencing a high growth rate in their immigrant populations, leading to a more visible presence of immigrant business in major cities (Woon, 2008). By starting their own businesses, immigrant entrepreneurs may circumvent some of the barriers and disadvantages encountered in looking for a job (Sequeira & Rasheed, 2006). Successful immigrant entrepreneurs will integrate into the economy by creating jobs, providing products and services for members of their own ethnic community and society, as well as introducing new products and services that expand consumers’ choices (Rath & Kloosterman, 2000). Immigrant entrepreneurs tend to start business within their ethnic enclave, as it is an integral part of their social and cultural context and the location where ethnic resources reside (Logan et al., 2002). An ethnic enclave is an interdependent network of social and business relationships that are geographically concentrated with its co-ethnic people (Portes & Bach, 1985).
Resumo:
Having wrung the most from workforce and workplace productivity initiaitves, innovation has come to the fore as a key goal and directive for public sector organisations to become more efficient. This clarion call for innovation can be heard all around the world, with public services everywhere taking up the message to develop better, smarter, novel, more innovative processes, programs and policies. In the current push for innovation, networks are considered to be a superior vehicle through which collective knowledge can be shared and leveraged; replacing or at least supplementing the role function previously provided by inventive leaders...
Resumo:
The rapid growth in the number of users using social networks and the information that a social network requires about their users make the traditional matching systems insufficiently adept at matching users within social networks. This paper introduces the use of clustering to form communities of users and, then, uses these communities to generate matches. Forming communities within a social network helps to reduce the number of users that the matching system needs to consider, and helps to overcome other problems from which social networks suffer, such as the absence of user activities' information about a new user. The proposed system has been evaluated on a dataset obtained from an online dating website. Empirical analysis shows that accuracy of the matching process is increased using the community information.
Resumo:
Generic, flexible social media spaces such as Facebook and Twitter constitute an increasingly important element in our overall media repertoires. They provide a technological basis for instant and world-wide, ad hoc, many-to-many communication, and their effect on global communication patterns has already been highlighted. The short-messaging platform Twitter, for example, caters for uses ranging from interpersonal and quasi-private phatic exchanges to ‘ambient journalism’: ad hoc new reporting and dissemination as major events break. Many such uses have themselves emerged through user-driven processes: even standard Twitter conventions such as the @reply (to publicly address a fellow user) or the #hashtag(to collect related messages in an easily accessible space) are user inventions, in fact, and were incorporated into Twitter’s own infrastructure only subsequently. This demonstrates the substantial potential of social, user-led innovation in social media spaces.
Resumo:
The next generation of SOA needs to scale for flexible service consumption, beyond organizational boundaries and current B2B applications, into communities, eco-systems, and business networks. In the wider and, ultimately, global settings, new capabilities are needed so that business partners can efficiently and reliably enable, adapt, and expose services where they can be discovered, ordered, consumed, metered, and paid for, through new applications and opportunities, driven by third parties in the global "village". This trend is already underway, in different ways, through various early adopter market segments. For the small medium enterprises segment, Google, Intuit-Microsoft, and others have launched appstores, through which an open-ended array of hosted applications are sourced from the development community and procured as maketplace commondities. In the corporate sector, the marketplace model and business network hubs are being put in place on top of connectivity and network orchestration investments for capitalizing services as tradable assets, seen in banking/finance (e.g. American Express Intelligent Marketplace), logistics (e.g., the E2open hub), and the public sector (e.g., UK DirectGov whole-of-government citizen services delivery).
Resumo:
A wireless sensor network system must have the ability to tolerate harsh environmental conditions and reduce communication failures. In a typical outdoor situation, the presence of wind can introduce movement in the foliage. This motion of vegetation structures causes large and rapid signal fading in the communication link and must be accounted for when deploying a wireless sensor network system in such conditions. This thesis examines the fading characteristics experienced by wireless sensor nodes due to the effect of varying wind speed in a foliage obstructed transmission path. It presents extensive measurement campaigns at two locations with the approach of a typical wireless sensor networks configuration. The significance of this research lies in the varied approaches of its different experiments, involving a variety of vegetation types, scenarios and the use of different polarisations (vertical and horizontal). Non–line of sight (NLoS) scenario conditions investigate the wind effect based on different vegetation densities including that of the Acacia tree, Dogbane tree and tall grass. Whereas the line of sight (LoS) scenario investigates the effect of wind when the grass is swaying and affecting the ground-reflected component of the signal. Vegetation type and scenarios are envisaged to simulate real life working conditions of wireless sensor network systems in outdoor foliated environments. The results from the measurements are presented in statistical models involving first and second order statistics. We found that in most of the cases, the fading amplitude could be approximated by both Lognormal and Nakagami distribution, whose m parameter was found to depend on received power fluctuations. Lognormal distribution is known as the result of slow fading characteristics due to shadowing. This study concludes that fading caused by variations in received power due to wind in wireless sensor networks systems are found to be insignificant. There is no notable difference in Nakagami m values for low, calm, and windy wind speed categories. It is also shown in the second order analysis, the duration of the deep fades are very short, 0.1 second for 10 dB attenuation below RMS level for vertical polarization and 0.01 second for 10 dB attenuation below RMS level for horizontal polarization. Another key finding is that the received signal strength for horizontal polarisation demonstrates more than 3 dB better performances than the vertical polarisation for LoS and near LoS (thin vegetation) conditions and up to 10 dB better for denser vegetation conditions.
Resumo:
This series of research vignettes is aimed at sharing current and interesting research findings from our team of international entrepreneurship researchers. In this vignette Dr Maria Kaya and Associate Professor Paul Steffens consider both the classification of musicians and their use of online social networks.
Resumo:
The role of networks and their contribution to sustaining and developing creative industries is well documented (Wittel 2001; Kong 2005; Pratt 2007). This article argues that although networks operate across geographical boundaries, particularly through the use of communication technologies, the majority of studies have focussed on the ways in which networks operate in a) specific inner-urban metropolitan regions or b) specific industries. Such studies are informed by the geographical mindset of creative city proponents such as Florida (2002) and Landry (2000) in which inner-urban precincts are seen as the prime location for creative industries activity, business development and opportunity. But what of those creative industries situated beyond the inner city? Evidence in Australia suggests there is increasing creative industries activity beyond the inner city, in outer-suburban and ex-urban areas (Gibson & Brennan-Horley 2006). This article identifies characteristics of creative industries networks in outer-suburban locations in Melbourne and Brisbane. It argues that supporting and sustaining creative industries networks in these locations may require different strategies than those applied to inner-city networks. The article thus contributes to the growing understanding of the cultural economic geography of creative industries.
Resumo:
The role of networks and their contribution to sustaining and developing creative industries is well documented (Wittel 2001, Kong 2005, Pratt, 2007). This article argues that although networks operate across geographical boundaries, particularly through the use of communication technologies, the majority of studies have focussed on the ways in which networks operate among creative industry workers located in a) specific inner-urban metropolitan regions or b) specific industries. Such studies are informed by the geographical mindset of creative city proponents such as Florida (2002) and Landry (2000) in which inner-urban precincts are seen as the prime location or ‘hub’ for creative industries activity, business development and opportunity. But what of those creative industries situated beyond the inner city? Evidence in Australia suggests that there is increasing creative industries activity beyond the inner city, in outer-suburban and ex-urban areas (Gibson and Brennan-Horley 2006). This article identifies features of networks operating two outer-suburban locations.