912 resultados para Efficient Points
Resumo:
Israel figures among the world-leaders in R&D expenditure and has a high-performing scientific community. Since the 1990s it has been associated with the Scientific Policy of the European Union via the European Research Framework Programmes (FP). The cooperation between Israel and the EU in this domain has gradually increased and benefits the scientific communities on both sides. In 2014 the association of Israel to the latest and biggest European FP ever adopted (Horizon 2020) was renewed for the fourth time. Based on all the scientific evidence provided, the elaboration of a European Research Policy can be identified as a highly regulated domain, offering relevant ‘channels of influence’. These channels offer Israel the opportunity to act within the Research Policy system. Being a member of several formal EU bodies in charge of implementing EU Research Policy, Israel is able to introduce its positions effectively. This is accompanied by an outstanding level of activity by Israel in linking concrete EU Research Policy measures to the Israeli Scientific Community at the national level. To carry out this task, Israel relies on an effective organization, which remodels the provided EU structures: European ‘National Contact Points’ (NCPs) are concentrated within the ‘Europe Israel R&D Directorate’ (ISERD). ISERD connects efficiently all the relevant actors, forums and phases of EU-Israeli Research Policy. ISERD can be recognized as being at the heart of Israel's research cooperation with the EU, and its structure may be a source of in
Resumo:
Classical cadherin adhesion molecules are fundamental determinants of cell-cell recognition that function in cooperation with the actin cytoskeleton. Productive cadherin-based cell recognition is characterized by a distinct morphological process of contact zone extension, where limited initial points of adhesion are progressively expanded into broad zones of contact. We recently demonstrated that E-cadherin ligation recruits the Arp2/3 actin nucleator complex to the plasma membrane in regions where cell contacts are undergoing protrusion and extension. This suggested that Arp2/3 might generate the protrusive forces necessary for cell surfaces to extend upon one another during contact assembly. We tested this hypothesis in mammalian cells by exogenously expressing the CA region of N-WASP. This fragment, which potently inhibits Arp2/3-mediated actin assembly in vitro, also effectively reduced actin assembly at cadherin adhesive contacts. Blocking Arp2/3 activity by this strategy profoundly reduced the ability of cells to extend cadherin adhesive contacts but did not affect cell adhesiveness. These findings demonstrate that Arp2/3 activity is necessary for cells to efficiently extend and assemble cadherin-based adhesive contacts.
Resumo:
The Gauss-Marquardt-Levenberg (GML) method of computer-based parameter estimation, in common with other gradient-based approaches, suffers from the drawback that it may become trapped in local objective function minima, and thus report optimized parameter values that are not, in fact, optimized at all. This can seriously degrade its utility in the calibration of watershed models where local optima abound. Nevertheless, the method also has advantages, chief among these being its model-run efficiency, and its ability to report useful information on parameter sensitivities and covariances as a by-product of its use. It is also easily adapted to maintain this efficiency in the face of potential numerical problems (that adversely affect all parameter estimation methodologies) caused by parameter insensitivity and/or parameter correlation. The present paper presents two algorithmic enhancements to the GML method that retain its strengths, but which overcome its weaknesses in the face of local optima. Using the first of these methods an intelligent search for better parameter sets is conducted in parameter subspaces of decreasing dimensionality when progress of the parameter estimation process is slowed either by numerical instability incurred through problem ill-posedness, or when a local objective function minimum is encountered. The second methodology minimizes the chance of successive GML parameter estimation runs finding the same objective function minimum by starting successive runs at points that are maximally removed from previous parameter trajectories. As well as enhancing the ability of a GML-based method to find the global objective function minimum, the latter technique can also be used to find the locations of many non-global optima (should they exist) in parameter space. This can provide a useful means of inquiring into the well-posedness of a parameter estimation problem, and for detecting the presence of bimodal parameter and predictive probability distributions. The new methodologies are demonstrated by calibrating a Hydrological Simulation Program-FORTRAN (HSPF) model against a time series of daily flows. Comparison with the SCE-UA method in this calibration context demonstrates a high level of comparative model run efficiency for the new method. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.
Resumo:
Different cultures and historical precedents produce a broad range of influences on the training of hotel managers in Europe and the United States. The author isolates a certain number of facts the nature of which clarify an understanding of two attitudes which complement each other to the benefit of their common objective - efficient professional training.
Resumo:
We present efficient algorithms for solving Legendre equations over Q (equivalently, for finding rational points on rational conics) and parametrizing all solutions. Unlike existing algorithms, no integer factorization is required, provided that the prime factors of the discriminant are known.
Resumo:
In a paper by Biro et al. [7], a novel twist on guarding in art galleries is introduced. A beacon is a fixed point with an attraction pull that can move points within the polygon. Points move greedily to monotonically decrease their Euclidean distance to the beacon by moving straight towards the beacon or sliding on the edges of the polygon. The beacon attracts a point if the point eventually reaches the beacon. Unlike most variations of the art gallery problem, the beacon attraction has the intriguing property of being asymmetric, leading to separate definitions of attraction region and inverse attraction region. The attraction region of a beacon is the set of points that it attracts. For a given point in the polygon, the inverse attraction region is the set of beacon locations that can attract the point. We first study the characteristics of beacon attraction. We consider the quality of a "successful" beacon attraction and provide an upper bound of $\sqrt{2}$ on the ratio between the length of the beacon trajectory and the length of the geodesic distance in a simple polygon. In addition, we provide an example of a polygon with holes in which this ratio is unbounded. Next we consider the problem of computing the shortest beacon watchtower in a polygonal terrain and present an $O(n \log n)$ time algorithm to solve this problem. In doing this, we introduce $O(n \log n)$ time algorithms to compute the beacon kernel and the inverse beacon kernel in a monotone polygon. We also prove that $\Omega(n \log n)$ time is a lower bound for computing the beacon kernel of a monotone polygon. Finally, we study the inverse attraction region of a point in a simple polygon. We present algorithms to efficiently compute the inverse attraction region of a point for simple, monotone, and terrain polygons with respective time complexities $O(n^2)$, $O(n \log n)$ and $O(n)$. We show that the inverse attraction region of a point in a simple polygon has linear complexity and the problem of computing the inverse attraction region has a lower bound of $\Omega(n \log n)$ in monotone polygons and consequently in simple polygons.
Resumo:
Fully articulated hand tracking promises to enable fundamentally new interactions with virtual and augmented worlds, but the limited accuracy and efficiency of current systems has prevented widespread adoption. Today's dominant paradigm uses machine learning for initialization and recovery followed by iterative model-fitting optimization to achieve a detailed pose fit. We follow this paradigm, but make several changes to the model-fitting, namely using: (1) a more discriminative objective function; (2) a smooth-surface model that provides gradients for non-linear optimization; and (3) joint optimization over both the model pose and the correspondences between observed data points and the model surface. While each of these changes may actually increase the cost per fitting iteration, we find a compensating decrease in the number of iterations. Further, the wide basin of convergence means that fewer starting points are needed for successful model fitting. Our system runs in real-time on CPU only, which frees up the commonly over-burdened GPU for experience designers. The hand tracker is efficient enough to run on low-power devices such as tablets. We can track up to several meters from the camera to provide a large working volume for interaction, even using the noisy data from current-generation depth cameras. Quantitative assessments on standard datasets show that the new approach exceeds the state of the art in accuracy. Qualitative results take the form of live recordings of a range of interactive experiences enabled by this new approach.
Resumo:
Protocols for the generation of dendritic cells (DCs) using serum as a supplementation of culture media leads to reactions due to animal proteins and disease transmissions. Several types of serum-free media (SFM), based on good manufacture practices (GMP), have recently been used and seem to be a viable option. The aim of this study was to evaluate the results of the differentiation, maturation, and function of DCs from Acute Myeloid Leukemia patients (AML), generated in SFM and medium supplemented with autologous serum (AS). DCs were analyzed by phenotype characteristics, viability, and functionality. The results showed the possibility of generating viable DCs in all the conditions tested. In patients, the X-VIVO 15 medium was more efficient than the other media tested in the generation of DCs producing IL-12p70 (p=0.05). Moreover, the presence of AS led to a significant increase of IL-10 by DCs as compared with CellGro (p=0.05) and X-Vivo15 (p=0.05) media, both in patients and donors. We concluded that SFM was efficient in the production of DCs for immunotherapy in AML patients. However, the use of AS appears to interfere with the functional capacity of the generated DCs.
Resumo:
Chronic pain has been often associated with myofascial pain syndrome (MPS), which is determined by myofascial trigger points (MTrP). New features have been tested for MTrP diagnosis. The aim of this study was to evaluate two-dimensional ultrasonography (2D US) and ultrasound elastography (UE) images and elastograms of upper trapezius MTrP during electroacupuncture (EA) and acupuncture (AC) treatment. 24 women participated, aged between 20 and 40 years (M ± SD = 27.33 ± 5.05) with a body mass index ranging from 18.03 to 27.59 kg/m2 (22.59 ± 3.11), a regular menstrual cycle, at least one active MTrP at both right (RTPz) and left trapezius (LTPz) and local or referred pain for up to six months. Subjects were randomized into EA and AC treatment groups and the control sham AC (SHAM) group. Intensity of pain was assessed by visual analogue scale; MTrP mean area and strain ratio (SR) by 2D US and UE. A significant decrease of intensity in general, RTPz, and LTPz pain was observed in the EA group (p = 0.027; p < 0.001; p = 0.005, respectively) and in general pain in the AC group (p < 0.001). Decreased MTrP area in RTPz and LTPz were observed in AC (p < 0.001) and EA groups (RTPz, p = 0.003; LTPz, p = 0.005). Post-treatment SR in RTPz and LTPz was lower than pre-treatment in both treatment groups. 2D US and UE effectively characterized MTrP and surrounding tissue, pointing to the possibility of objective confirmation of subjective EA and AC treatment effects.
Resumo:
The text describes a study about the adoption of virtual learning environments and its consequences to the learning process of undergraduate students at the State University of Campinas - Unicamp. These environments can be incorporated in various ways into the academic daily life of students and teachers. One efficient way to promote the adoption of these environments, as observed by the Distance Learning support team, is to train teachers and students in their use. Two training alternatives are described in this text to instruct the academic community in the use of TelEduc, a freeware developed and coordinated by the NIED - Núcleo de Informática Aplicada à Educação (Center for Information Technology Applied to Education), and officially adopted by Unicamp. Training courses are offered in two ways - presence or distance learning - to suit each teacher's preferences. This article compares the two modes of training, showing their strong and weak points. The adoption of TelEduc and its direct consequences to the learning process are described in a study carried out with some engineering undergraduates at Unicamp. The authors' questions and the general views of teachers and students regarding the effectiveness of the use of TelEduc as a supporting tool to presence teaching are presented. This investigation revealed the importance of training teachers in the effective use of these environments.
Resumo:
Universidade Estadual de Campinas . Faculdade de Educação Física
Resumo:
Universidade Estadual de Campinas. Faculdade de Educação Física
Resumo:
Universidade Estadual de Campinas . Faculdade de Educação Física
Resumo:
Universidade Estadual de Campinas . Faculdade de Educação Física