49 resultados para Stokes vector
Resumo:
Modelling the level of demand for construction is vital in policy formulation and implementation as the construction industry plays an important role in a country’s economic development process. In construction economics, research efforts on construction demand modelling and forecasting are various, but few researchers have considered the impact of global economy events in construction demand modelling. An advanced multivariate modelling technique, namely the vector error correction (VEC) model with dummy variables, was adopted to predict demand in the Australian construction market. The results of prediction accuracy tests suggest that the general VEC model and the VEC model with dummy variables are both acceptable for forecasting construction economic indicators. However, the VEC model that considers external impacts achieves higher prediction accuracy than the general VEC model. The model estimates indicate that the growth in population, changes in national income, fluctuations in interest rates and changes in householder expenditure all play significant roles when explaining variations in construction demand. The VEC model with disturbances developed can serve as an experimentation using an advanced econometrical method which can be used to analyse the effect of specific events or factors on the construction market growth.
Resumo:
This paper addresses the problem of privacy-preserving data publishing for social network. Research on protecting the privacy of individuals and the confidentiality of data in social network has recently been receiving increasing attention. Privacy is an important issue when one wants to make use of data that involves individuals' sensitive information, especially in a time when data collection is becoming easier and sophisticated data mining techniques are becoming more efficient. In this paper, we discuss various privacy attack vectors on social networks. We present algorithms that sanitize data to make it safe for release while preserving useful information, and discuss ways of analyzing the sanitized data. This study provides a summary of the current state-of-the-art, based on which we expect to see advances in social networks data publishing for years to come.
Resumo:
A key traditional question the client learns in the conventional psychotherapies is ‘Am I getting what I want?’. But can this question incite a mindset that does not align with the ‘give and take’ essence of sustainable everyday relations? Is it possible that the psychotherapies—if these practices can be bundled together—might teach clients to become more self-centred and relationally illiterate? MARK FURLONG suggests that well-intentioned practitioners can inadvertently de-empathise, ignore or even disrupt their clients’ intimate networks. Findings from his research support the proposition that the action of the mainstream therapies tends to undermine the service users’ prospects for sustainable personal relationships. Exceptions were found in the specialist settings of paediatric and aged care, and in narrative and family therapy practice.
Resumo:
Least square problem with l1 regularization has been proposed as a promising method for sparse signal reconstruction (e.g., basis pursuit de-noising and compressed sensing) and feature selection (e.g., the Lasso algorithm) in signal processing, statistics, and related fields. These problems can be cast as l1-regularized least-square program (LSP). In this paper, we propose a novel monotonic fixed point method to solve large-scale l1-regularized LSP. And we also prove the stability and convergence of the proposed method. Furthermore we generalize this method to least square matrix problem and apply it in nonnegative matrix factorization (NMF). The method is illustrated on sparse signal reconstruction, partner recognition and blind source separation problems, and the method tends to convergent faster and sparser than other l1-regularized algorithms.
Resumo:
In this paper, a two-stage algorithm for vector quantization is proposed based on a self-organizing map (SOM) neural network. First, a conventional self-organizing map is modified to deal with dead codebooks in the learning process and is then used to obtain the codebook distribution structure for a given set of input data. Next, subblocks are classified based on the previous structure distribution with a prior criteria. Then, the conventional LBG algorithm is applied to these sub-blocks for data classification with initial values obtained via the SOM. Finally, extensive simulations illustrate that the proposed two-stage algorithm is very effective.
Resumo:
Many small organisms in various life stages can be transported in the digestive system of larger vertebrates, a process known as endozoochory. Potential dispersal distances of these “propagules” are generally calculated after monitoring retrieval in experiments with resting vector animals. We argue that vectors in natural situations will be actively moving during effective transport rather than resting. We here test for the first time how physical activity of a vector animal might affect its dispersal efficiency. We compared digestive characteristics between swimming, wading (i.e. resting in water) and isolation (i.e. resting in a cage) mallards (Anas platyrhynchos). We fed plastic markers and aquatic gastropods, and monitored retrieval and survival of these propagules in the droppings over 24 h. Over a period of 5 h of swimming, mallards excreted 1.5 times more markers than when wading and 2.3 times more markers than isolation birds, the pattern being reversed over the subsequent period of monitoring where all birds were resting. Retention times of markers were shortened for approximately 1 h for swimming, and 0.5 h for wading birds. Shorter retention times imply higher survival of propagules at increased vector activity. However, digestive intensity measured directly by retrieval of snail shells was not a straightforward function of level of activity. Increased marker size had a negative effect on discharge rate. Our experiment indicates that previous estimates of propagule dispersal distances based on resting animals are overestimated, while propagule survival seems underestimated. These findings have implications for the dispersal of invasive species, meta-population structures and long distance colonization events.
Resumo:
Identification of unnatural control chart patterns (CCPs) from manufacturing process measurements is a critical task in quality control as these patterns indicate that the manufacturing process is out-of-control. Recently, there have been numerous efforts in developing pattern recognition and classification methods based on artificial neural network to automatically recognize unnatural patterns. Most of them assume that a single type of unnatural pattern exists in process data. Due to this restrictive assumption, severe performance degradations are observed in these methods when unnatural concurrent CCPs present in process data. To address this problem, this paper proposes a novel approach based on singular spectrum analysis (SSA) and learning vector quantization network to identify concurrent CCPs. The main advantage of the proposed method is that it can be applied to the identification of concurrent CCPs in univariate manufacturing processes. Moreover, there are no permutation and scaling ambiguities in the CCPs recovered by the SSA. These desirable features make the proposed algorithm an attractive alternative for the identification of concurrent CCPs. Computer simulations and a real application for aluminium smelting processes confirm the superior performance of proposed algorithm for sets of typical concurrent CCPs.
Resumo:
This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.
Resumo:
A powerful image editing system called OVIE is described, which provides fast and accurate creation, composition, rendering and other manipulation of image contents. Flexibility and convenience of the system are achieved by including two modules: image decomposition and image vectorization to understand and represent an image respectively. To understand an image comprehensively, we propose to integrate image segmentation, shape completion and image completion techniques to ensure a seamless image editing. An array of pixels is replaced by vector data with geometric edit ability for image representation since the geometrically-based editing has physical meanings and thus it is more natural or intuitive for users to edit. Compared to the existing works, our system is more convenient and can generate effects with higher quality. © 2012 IEEE.