449 resultados para Distance Distribution
Resumo:
The process of learning symbolic Arabic digits in early childhood requires that magnitude and spatial information integrates with the concept of symbolic digits. Previous research has separately investigated the development of automatic access to magnitude and spatial information from symbolic digits. However, developmental trajectories of symbolic number knowledge cannot be fully understood when considering components in isolation. In view of this, we have synthesized the existing lines of research and tested the use of both magnitude and spatial information with the same sample of British children in Years 1, 2 and 3 (6-8 years of age). The physical judgment task of the numerical Stroop paradigm (NSP) demonstrated that automatic access to magnitude was present from Year 1 and the distance effect signaled that a refined processing of numerical information had developed. Additionally, a parity judgment task showed that the onset of the Spatial-Numerical Association of Response Codes (SNARC) effect occurs in Year 2. These findings uncover the developmental timeline of how magnitude and spatial representations integrate with symbolic number knowledge during early learning of Arabic digits and resolve inconsistencies between previous developmental and experimental research lines.
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:
In spite of significant research in the development of efficient algorithms for three carrier ambiguity resolution, full performance potential of the additional frequency signals cannot be demonstrated effectively without actual triple frequency data. In addition, all the proposed algorithms showed their difficulties in reliable resolution of the medium-lane and narrow-lane ambiguities in different long-range scenarios. In this contribution, we will investigate the effects of various distance-dependent biases, identifying the tropospheric delay to be the key limitation for long-range three carrier ambiguity resolution. In order to achieve reliable ambiguity resolution in regional networks with the inter-station distances of hundreds of kilometers, a new geometry-free and ionosphere-free model is proposed to fix the integer ambiguities of the medium-lane or narrow-lane observables over just several minutes without distance constraint. Finally, the semi-simulation method is introduced to generate the third frequency signals from dual-frequency GPS data and experimentally demonstrate the research findings of this paper.
Resumo:
High Speed Rail (HSR) is rapidly gaining popularity worldwide as a safe and efficient transport option for long-distance travel. Designed to win market shares from air transport, HSR systems optimise their productivity between increasing speeds and station spacing to offer high quality service and gain ridership. Recent studies have investigated the effects that the deployment of HSR infrastructure has on spatial distribution and the economic development of cities and regions. Findings appear mostly positive at higher geographical scales, where HSR links connect major urban centres several hundred kilometres apart and already well positioned within a national or international context. Also, at the urban level, studies have shown regeneration and concentration effects around HSR station areas with positive returns on city’s image and economy. However, doubts persist on the effects of HSR at an intermediate scale, where the accessibility trade off on station spacing limits access to many small and medium agglomerations. Thereby, their ability to participate in the development opportunities facilitated by HSR infrastructure is significantly reduced. The locational advantages deriving from transport improvements appear contrasting especially in regions that tend to have a polycentric structure, where cities may present greater accessibility disparities between those served by HSR and those left behind. This thesis fits in this context where intermediate and regional cities do not directly enjoy the presence of an HSR station while having an existing or planned proximate HSR corridor. With the aim of understanding whether there might be a solution to this apparent incongruity, the research investigates strategies to integrate HSR accessibility at the regional level. While current literature recommends to commit with ancillary investments to the uplift of station areas and the renewal of feeder systems, I hypothesised the interoperability between the HSR and the conventional networks to explore the possibilities offered by mixed traffic and infrastructure sharing. Thus, I developed a methodology to quantify the exchange of benefits deriving from this synergistic interaction. In this way, it was possible to understand which level of service quality offered by alternative transit strategies best facilitates the distribution of accessibility benefits for areas far from actual HSR stations. Therefore, strategies were selected for their type of service capable of regional extensions and urban penetrations, while incorporating a combination of specific advantages (e.g. speed, sub-urbanity, capacity, frequency and automation) in order to emulate HSR quality with increasingly efficient services. The North-eastern Italian macro region was selected as case study to ground the research offering concurrently a peripheral polycentric metropolitan form, the presence of a planned HSR corridor with some portions of HSR infrastructure implementation, and the project to develop a suburban rail service extended regionally. Results show significant distributive potential, in terms of network effects produced in relation with HSR, in increasing proportions for all the strategies considered: a regional metro rail strategy (abbreviated RMR), a regional high speed rail strategy (abbreviated RHSR), a regional light rail transit (abbreviated LRT) strategy, and a non-stopping continuous railway system (abbreviated CRS) strategy. The provision of additional tools to value HSR infrastructure against its accessibility benefits and their regional distribution through alternative strategies beyond the actual HSR stations, would have great implications, both politically and technically, in moving towards new dimensions of HSR evaluation and development.
Resumo:
Background Comprehensive geriatric assessment has been shown to improve patient outcomes, but the geriatricians who deliver it are in short-supply. A web-based method of comprehensive geriatric assessment has been developed with the potential to improve access to specialist geriatric expertise. The current study aims to test the reliability and safety of comprehensive geriatric assessment performed “online” in making geriatric triage decisions. It will also explore the accuracy of the procedure in identifying common geriatric syndromes, and its cost relative to conventional “live” consultations. Methods/Design The study population will consist of 270 acutely hospitalized patients referred for geriatric consultation at three sites. Paired assessments (live and online) will be conducted by independent, blinded geriatricians and the level of agreement examined. This will be compared with the level of agreement between two independent, blinded geriatricians each consulting with the patient in person (i.e. “live”). Agreement between the triage decision from live-live assessments and between the triage decision from live-online assessments will be calculated using kappa statistics. Agreement between the online and live detection of common geriatric syndromes will also be assessed using kappa statistics. Resource use data will be collected for online and live-live assessments to allow comparison between the two procedures. Discussion If the online approach is found to be less precise than live assessment, further analysis will seek to identify patient subgroups where disagreement is more likely. This may enable a protocol to be developed that avoids unsafe clinical decisions at a distance. Trial registration Trial registration number: ACTRN12611000936921
Resumo:
‘Nobody knows anything’, said William Goldman of studio filmmaking. The rule is ever more apt as we survey the radical changes that digital distribution, along with the digitisation of production and exhibition, is wreaking on global film circulation. Digital Disruption: Cinema Moves On-line helps to make sense of what has happened in the short but turbulent history of on-line distribution. It provides a realistic assessment of the genuine and not-so-promising methods that have been tried to address the disruptions that moving from ‘analogue dollars’ to ‘digital cents’ has provoked in the film industry. Paying close attention to how the Majors have dealt with the challenges – often unsuccessfully – it focuses as much attention on innovations and practices outside the mainstream. Throughout, it is alive to, and showcases, important entrepreneurial innovations such as Mubi, Jaman, Withoutabox and IMDb. Written by leading academic commentators that have followed the fortunes of world cinema closely and passionately, as well as experienced hands close to the fluctuating fortunes of the industry, Digital Disruption: Cinema Moves On-line is an indispensable guide to great changes in film and its audiences.
Resumo:
Distributed generators (DGs) are defined as generators that are connected to a distribution network. The direction of the power flow and short-circuit current in a network could be changed compared with one without DGs. The conventional protective relay scheme does not meet the requirement in this emerging situation. As the number and capacity of DGs in the distribution network increase, the problem of coordinating protective relays becomes more challenging. Given this background, the protective relay coordination problem in distribution systems is investigated, with directional overcurrent relays taken as an example, and formulated as a mixed integer nonlinear programming problem. A mathematical model describing this problem is first developed, and the well-developed differential evolution algorithm is then used to solve it. Finally, a sample system is used to demonstrate the feasiblity and efficiency of the developed method.
Resumo:
In this study the interplay effects for Enhanced Dynamic Wedge (EDW) treatments are experimentally investigated. Single and multiple field EDW plans for different wedge angles were delivered to a phantom and detector on a moving platform, with various periods, amplitudes for parallel and perpendicular motions. A four field 4D CT planned lung EDW treatment was delivered to a dummy tumor over four fractions. For the single field parallel case the amplitude and the period of motion both affect the interplay resulting in the appearance of a step function and penumbral cut off with the discrepancy worst where collimator-tumor speed is similar. For perpendicular motion the amplitude of tumor motion is the only dominant factor. For large wedge angle the dose discrepancy is more pronounced compared to the small wedge angle for the same field size and amplitude-period values. For a small field size i.e. 5 × 5 cm2 the loss of wedged distribution was observed for both 60º and 15º wedge angles for of parallel and perpendicular motions. Film results from 4D CT planned delivery displayed a mix of over and under dosages over 4 fractions, with the gamma pass rate of 40% for the averaged film image at 3%/1 mm DTA (Distance to Agreement). Amplitude and period of the tumor motion both affect the interplay for single and multi-field EDW treatments and for a limited (4 or 5) fraction delivery there is a possibility of non-averaging of the EDW interplay.
Resumo:
Voltage drop and rise at network peak and off–peak periods along with voltage unbalance are the major power quality problems in low voltage distribution networks. Usually, the utilities try to use adjusting the transformer tap changers as a solution for the voltage drop. They also try to distribute the loads equally as a solution for network voltage unbalance problem. On the other hand, the ever increasing energy demand, along with the necessity of cost reduction and higher reliability requirements, are driving the modern power systems towards Distributed Generation (DG) units. This can be in the form of small rooftop photovoltaic cells (PV), Plug–in Electric Vehicles (PEVs) or Micro Grids (MGs). Rooftop PVs, typically with power levels ranging from 1–5 kW installed by the householders are gaining popularity due to their financial benefits for the householders. Also PEVs will be soon emerged in residential distribution networks which behave as a huge residential load when they are being charged while in their later generation, they are also expected to support the network as small DG units which transfer the energy stored in their battery into grid. Furthermore, the MG which is a cluster of loads and several DG units such as diesel generators, PVs, fuel cells and batteries are recently introduced to distribution networks. The voltage unbalance in the network can be increased due to the uncertainties in the random connection point of the PVs and PEVs to the network, their nominal capacity and time of operation. Therefore, it is of high interest to investigate the voltage unbalance in these networks as the result of MGs, PVs and PEVs integration to low voltage networks. In addition, the network might experience non–standard voltage drop due to high penetration of PEVs, being charged at night periods, or non–standard voltage rise due to high penetration of PVs and PEVs generating electricity back into the grid in the network off–peak periods. In this thesis, a voltage unbalance sensitivity analysis and stochastic evaluation is carried out for PVs installed by the householders versus their installation point, their nominal capacity and penetration level as different uncertainties. A similar analysis is carried out for PEVs penetration in the network working in two different modes: Grid to vehicle and Vehicle to grid. Furthermore, the conventional methods are discussed for improving the voltage unbalance within these networks. This is later continued by proposing new and efficient improvement methods for voltage profile improvement at network peak and off–peak periods and voltage unbalance reduction. In addition, voltage unbalance reduction is investigated for MGs and new improvement methods are proposed and applied for the MG test bed, planned to be established at Queensland University of Technology (QUT). MATLAB and PSCAD/EMTDC simulation softwares are used for verification of the analyses and the proposals.
Resumo:
Utilizing a mono-specific antiserum produced in rabbits to hog kidney aromatic L-amino acid decarboxylase (AADC), the enzyme was localized in rat kidney by immunoperoxidase staining. AADC was located predominantly in the proximal convoluted tubules; there was also weak staining in the distal convoluted tubules and collecting ducts. An increase in dietary potassium or sodium intake produced no change in density or distribution of AADC staining in kidney. An assay of AADC enzyme activity showed no difference in cortex or medulla with chronic potassium loading. A change in distribution or activity of renal AADC does not explain the postulated dopaminergic modulation of renal function that occurs with potassium or sodium loading.
Resumo:
The potential of multiple distribution static synchronous compensators (DSTATCOMs) to improve the voltage profile of radial distribution networks has been reported in the literature by few authors. However, the operation of multiple DSTATCOMs across a distribution feeder may introduce control interactions and/or voltage instability. This study proposes a control scheme that alleviates interactions among controllers and enhances proper reactive power sharing among DSTATCOMs. A generalised mathematical model is presented to analyse the interactions among any number of DSTATCOMs in the network. The criterion for controller design is developed by conducting eigenvalue analysis on this mathematical model. The proposed control scheme is tested in time domain on a sample radial distribution feeder installed with multiple DSTATCOMs and test results are presented.
Resumo:
Key establishment is a crucial primitive for building secure channels in a multi-party setting. Without quantum mechanics, key establishment can only be done under the assumption that some computational problem is hard. Since digital communication can be easily eavesdropped and recorded, it is important to consider the secrecy of information anticipating future algorithmic and computational discoveries which could break the secrecy of past keys, violating the secrecy of the confidential channel. Quantum key distribution (QKD) can be used generate secret keys that are secure against any future algorithmic or computational improvements. QKD protocols still require authentication of classical communication, although existing security proofs of QKD typically assume idealized authentication. It is generally considered folklore that QKD when used with computationally secure authentication is still secure against an unbounded adversary, provided the adversary did not break the authentication during the run of the protocol. We describe a security model for quantum key distribution extending classical authenticated key exchange (AKE) security models. Using our model, we characterize the long-term security of the BB84 QKD protocol with computationally secure authentication against an eventually unbounded adversary. By basing our model on traditional AKE models, we can more readily compare the relative merits of various forms of QKD and existing classical AKE protocols. This comparison illustrates in which types of adversarial environments different quantum and classical key agreement protocols can be secure.