996 resultados para fast axis
Resumo:
Web data can often be represented in free tree form; however, free tree mining methods seldom exist. In this paper, a computationally fast algorithm FreeS is presented to discover all frequently occurring free subtrees in a database of labelled free trees. FreeS is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises the enumeration approach based on a tree-structure guided scheme. This paper presents lemmas that introduce conditions to conform the generation of free tree candidates during enumeration. Empirical study using both real and synthetic datasets shows that FreeS is scalable and significantly outperforms (i.e. few orders of magnitude faster than) the state-of-the-art frequent free tree mining algorithms, HybridTreeMiner and FreeTreeMiner.
Resumo:
Comparative studies on protein structures form an integral part of protein crystallography. Here, a fast method of comparing protein structures is presented. Protein structures are represented as a set of secondary structural elements. The method also provides information regarding preferred packing arrangements and evolutionary dynamics of secondary structural elements. This information is not easily obtained from previous methods. In contrast to those methods, the present one can be used only for proteins with some secondary structure. The method is illustrated with globin folds, cytochromes and dehydrogenases as examples.
Resumo:
The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.
Resumo:
Abstract is not available.
Resumo:
Chital or axis deer (Axis axis) form fluid groups that change in size temporally and in relation to habitat. Predictions of hypotheses relating animal density, rainfall, habitat structure, and breeding seasonality, to changes in chital group size were assessed simultaneously using multiple regression models of monthly data collected over a 2 yr period in Guindy National Park, in southern India. Over 2,700 detections of chital groups were made during four seasons in three habitats (forest, scrubland and grassland). In scrubland and grassland, chital group size was positively related to animal density, which increased with rainfall. This suggests that in these habitats, chital density increases in relation to food availability, and group sizes increase due to higher encounter rate and fusion of groups. The density of chital in forest was inversely related to rainfall, but positively to the number of fruiting tree species and availability of fallen litter, their forage in this habitat. There was little change in mean group size in the forest, although chital density more than doubled during the dry season and summer. Dispersion of food items or the closed nature of the forest may preclude formation of larger groups. At low densities, group sizes in all three habitats were similar. Group sizes increased with chital density in scrubland and grassland, but more rapidly in the latter—leading to a positive relationship between openness and mean group size at higher densities. It is not clear, however, that this relationship is solely because of the influence of habitat structure. The rutting index (monthly percentage of adult males in hard antler) was positively related to mean group size in forest and scrubland, probably reflecting the increase in group size due to solitary males joining with females during the rut. The fission-fusion system of group formation in chital is thus interactively influenced by several factors. Aspects that need further study, such as interannual variability, are highlighted.
Resumo:
Although they made up a significant share of the retail music market from the 60s to the 90s, and were often used as promotional and marketing tools, cassettes became re-configured in the 80s as an integral component of cassette magazines. Binding sound, music, talk, text, visual art and design, they were a truly innovative interdisciplinary form. This paper explores the history of these artefacts with particular emphasis on the Brisbane underground music scene of the late 70s and 80s, and discusses their significance in as a bridge between the music scene and art scenes of this period.
Resumo:
We present experimental validation of a new reconstruction method for off-axis digital holographic microscopy (DHM). This method effectively suppresses the object autocorrelation,namely, the zero-order term,from holographic data,thereby improving the reconstruction bandwidth of complex wavefronts. The algorithm is based on nonlinear filtering and can be applied to standard DHM setups with realistic recording conditions.We study the robustness of the technique under different experimental configurations,and quantitatively demonstrate its enhancement capabilities on phase signals.
Resumo:
Background Risk-stratification of diffuse large B-cell lymphoma (DLBCL) requires identification of patients with disease that is not cured despite initial R-CHOP. Although the prognostic importance of the tumour microenvironment (TME) is established, the optimal strategy to quantify it is unknown. Methods The relationship between immune-effector and inhibitory (checkpoint) genes was assessed by NanoString™ in 252 paraffin-embedded DLBCL tissues. A model to quantify net anti-tumoural immunity as an outcome predictor was tested in 158 R-CHOP treated patients, and validated in tissue/blood from two independent R-CHOP treated cohorts of 233 and 140 patients respectively. Findings T and NK-cell immune-effector molecule expression correlated with tumour associated macrophage and PD-1/PD-L1 axis markers consistent with malignant B-cells triggering a dynamic checkpoint response to adapt to and evade immune-surveillance. A tree-based survival model was performed to test if immune-effector to checkpoint ratios were prognostic. The CD4*CD8:(CD163/CD68)*PD-L1 ratio was better able to stratify overall survival than any single or combination of immune markers, distinguishing groups with disparate 4-year survivals (92% versus 47%). The immune ratio was independent of and added to the revised international prognostic index (R-IPI) and cell-of-origin (COO). Tissue findings were validated in 233 DLBCL R-CHOP treated patients. Furthermore, within the blood of 140 R-CHOP treated patients immune-effector:checkpoint ratios were associated with differential interim-PET/CT+ve/-ve expression.
Resumo:
An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.
Resumo:
Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.
Resumo:
In recent work (Int. J. Mass Spec., vol. 282, pp. 112–122) we have considered the effect of apertures on the fields inside rf traps at points on the trap axis. We now complement and complete that work by considering off-axis fields in axially symmetric (referred to as “3D”) and in two dimensional (“2D”) ion traps whose electrodes have apertures, i.e., holes in 3D and slits in 2D. Our approximation has two parts. The first, EnoAperture, is the field obtained numerically for the trap under study with apertures artificially closed. We have used the boundary element method (BEM) for obtaining this field. The second part, EdueToAperture, is an analytical expression for the field contribution of the aperture. In EdueToAperture, aperture size is a free parameter. A key element in our approximation is the electrostatic field near an infinite thin plate with an aperture, and with different constant-valued far field intensities on either side. Compact expressions for this field can be found using separation of variables, wherein the choice of coordinate system is crucial. This field is, in turn, used four times within our trap-specific approximation. The off-axis field expressions for the 3D geometries were tested on the quadrupole ion trap (QIT) and the cylindrical ion trap (CIT), and the corresponding expressions for the 2D geometries were tested on the linear ion trap (LIT) and the rectilinear ion trap (RIT). For each geometry, we have considered apertures which are 10%, 30%, and 50% of the trap dimension. We have found that our analytical correction term EdueToAperture, though based on a classical small-aperture approximation, gives good results even for relatively large apertures.
Resumo:
The paper presents a novel slicing based method for computation of volume fractions in multi-material solids given as a B-rep whose faces are triangulated and shared by either one or two materials. Such objects occur naturally in geoscience applications and the said computation is necessary for property estimation problems and iterative forward modeling. Each facet in the model is cut by the planes delineating the given grid structure or grid cells. The method, instead of classifying the points or cells with respect to the solid, exploits the convexity of triangles and the simple axis-oriented disposition of the cutting surfaces to construct a novel intermediate space enumeration representation called slice-representation, from which both the cell containment test and the volume-fraction computation are done easily. Cartesian and cylindrical grids with uniform and non-uniform spacings have been dealt with in this paper. After slicing, each triangle contributes polygonal facets, with potential elliptical edges, to the grid cells through which it passes. The volume fractions of different materials in a grid cell that is in interaction with the material interfaces are obtained by accumulating the volume contributions computed from each facet in the grid cell. The method is fast, accurate, robust and memory efficient. Examples illustrating the method and performance are included in the paper.
Resumo:
Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.
Resumo:
Purpose The research purpose was to identify both the inspiration sources used by fast fashion designers and ways the designers sort information from the sources during the product development process. Design/methodology/approach This is a qualitative study, drawing on semi-structured interviews conducted with the members of the in-house design teams of three Australian fast fashion companies. Findings Australian fast fashion designers rely on a combination of trend data, sales data, product analysis and travel for design development ideas. The designers then use the consensus and embodiment methods to interpret and synthesise information from those inspiration sources. Research limitations/implications The empirical data used in the analysis were limited by interviewing fashion designers within only three Australian companies. Originality/value This research augments knowledge of fast fashion product development, in particular designers’ methods and approaches to product design within a volatile and competitive market.
Resumo:
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.