9 resultados para Got To Give It Up
em Universidad de Alicante
Resumo:
Canal 9 –o Nou, como se llamó en su última etapa– con su carácter ejemplarizante para el resto de autonómicas, se convierte en el objeto de estudio perfecto para los investigadores en comunicación. El trabajo se centra en la última etapa de RTVV, bajo la influencia de un nuevo estatuto legal, que dotaba a la televisión de herramientas presuntamente facilitadoras de la pluralidad en los informativos. Mediante un análisis cualitativo basado en entrevistas semiestructuradas a un panel de expertos, intentamos averiguar si se produjo en ese tiempo un cambio apreciable en la redacción de Canal 9, combinado con un cambio de talante en la gestión de la empresa. La conclusión, con los matices que desarrollamos en el texto, es que sí que se produjo una apertura en esa fase, que desgraciadamente fue abortada por el cierre precipitado. La eliminación de la emisora autonómica provocó un efecto destructivo en cadena en el sistema audiovisual valenciano que aún no se ha superado.
Resumo:
Examining a team’s performance from a physical point of view their momentum might indicate unexpected turning points in defeat or success. Physicists describe this value as to require some effort to be started, but also that it is relatively easy to keep it going once a sufficient level is reached (Reed and Hughes, 2006). Unlike football, rugby, handball and many more sports, a regular volleyball match is not limited by time but by points that need to be gathered. Every minute more than one point is won by either one team or the other. That means a series of successive points enlarges the gap between the teams making it more and more difficult to catch up with the leading one. This concept of gathering momentum, or the reverse in a performance, can give the coaches, athletes and sports scientists further insights into winning and losing performances. Momentum investigations also contain dependencies between performances or questions if future performances are reliant upon past streaks. Squash and volleyball share the characteristic of being played up to a certain amount of points. Squash was examined according to the momentum of players by Hughes et al. (2006). The initial aim was to expand normative profiles of elite squash players using momentum graphs of winners and errors to explore ‘turning points’ in a performance. Dynamic systems theory has enabled the definition of perturbations in sports exhibiting rhythms (Hughes et al., 2000; McGarry et al., 2002; Murray et al., 2008), and how players and teams cause these disruptions of rhythm can inform on the way they play, these techniques also contribute to profiling methods. Together with the analysis of one’s own performance it is essential to have an understanding of your oppositions’ tactical strengths and weaknesses. By modelling the oppositions’ performance it is possible to predict certain outcomes and patterns, and therefore intervene or change tactics before the critical incident occurs. The modelling of competitive sport is an informative analytic technique as it directs the attention of the modeller to the critical aspects of data that delineate successful performance (McGarry & Franks, 1996). Using tactical performance profiles to pull out and visualise these critical aspects of performance, players can build justified and sophisticated tactical plans. The area is discussed and reviewed, critically appraising the research completed in this element of Performance Analysis.
Resumo:
Self-organising neural models have the ability to provide a good representation of the input space. In particular the Growing Neural Gas (GNG) is a suitable model because of its flexibility, rapid adaptation and excellent quality of representation. However, this type of learning is time-consuming, especially for high-dimensional input data. Since real applications often work under time constraints, it is necessary to adapt the learning process in order to complete it in a predefined time. This paper proposes a Graphics Processing Unit (GPU) parallel implementation of the GNG with Compute Unified Device Architecture (CUDA). In contrast to existing algorithms, the proposed GPU implementation allows the acceleration of the learning process keeping a good quality of representation. Comparative experiments using iterative, parallel and hybrid implementations are carried out to demonstrate the effectiveness of CUDA implementation. The results show that GNG learning with the proposed implementation achieves a speed-up of 6× compared with the single-threaded CPU implementation. GPU implementation has also been applied to a real application with time constraints: acceleration of 3D scene reconstruction for egomotion, in order to validate the proposal.
Resumo:
A heterofunctional support for enzyme immobilization may be defined as that which possesses several distinct functionalities on its surface able to interact with a protein. We will focus on those supports in which a final covalent attachment between the enzyme and the support is achieved. Heterofunctionality sometimes has been featured in very old immobilization techniques, even though in many instances it has been overlooked, giving rise to some misunderstandings. In this respect, glutaraldehyde-activated supports are the oldest multifunctional supports. Their matrix has primary amino groups, the hydrophobic glutaraldehyde chain, and can covalently react with the primary amino groups of the enzyme. Thus, immobilization may start (first event of the immobilization) via different causes and may involve different positions of the enzyme surface depending on the activation degree and immobilization conditions. Other “classical” heterofunctional supports are epoxy commercial supports consisting of reactive covalent epoxy groups on a hydrophobic matrix. Immobilization is performed at high ionic strength to permit protein adsorption, so that covalent attachment may take place at a later stage. Starting from these old immobilization techniques, tailor-made heterofunctional supports have been designed to permit a stricter control of the enzyme immobilization process. The requirement is to find conditions where the main covalent reactive moieties may have very low reactivity toward the enzyme. In this Review we will discuss the suitable properties of the groups able to give the covalent attachment (intending a multipoint covalent attachment), and the groups able to produce the first enzyme adsorption on the support. Prospects, limitations, and likely pathways for the evolution (e.g., coupling of site-directed mutagenesis and thiol heterofunctional supports of enzyme immobilization on heterofunctional supports) will be discussed in this Review.
Resumo:
Justificación: Dentro de la estrategia de Universidades Saludables, la Universidad de Alicante (UA) inicia un proyecto para conocer, difundir y potenciar los activos para la salud. Se plantea dotar de contenido empírico la propuesta de Morgan y Ziglio de usar el modelo de activos para la salud pública identificados por la comunidad universitaria. Objetivos: explorar la factibilidad y los retos de la aplicación de mapeos de activos para la salud en la UA con el fin de que la comunidad universitaria pueda ganar salud, calidad de vida y bienestar. Desarrollo de la experiencia: Formación de promotores de salud: • La promoción de la salud y la teoría salutogénica. • Aproximación al modelo y la estrategia de activos en salud. Enfoque Asset-Based Community Development (ABCD). • Diferencia entre recursos y activos. • Técnicas de observación y diálogo. • Técnicas mixtas: open space, TICs y mapping... • Competencias profesionales, entorno facilitador y apoyo para obtener resultados. Metodología: Lograr el mapeo de los activos en salud, sus entornos y sus estudiantes siguiendo el enfoque de John McKnight. Aplicación de “lo aprendido” en el contexto de la UA: Planificación del proyecto para el año 2014. Resultados: construcción de un mapa de activos para la salud, geolocalizado en la Universidad de Alicante. Dinamización del mapa de activos, estudiando conexiones entre activos y necesidades de la comunidad universitaria con las personas participantes, para realizar propuestas de acción futura. Difusión del mismo a través de tecnologías de la información.
Resumo:
Modern compilers present a great and ever increasing number of options which can modify the features and behavior of a compiled program. Many of these options are often wasted due to the required comprehensive knowledge about both the underlying architecture and the internal processes of the compiler. In this context, it is usual, not having a single design goal but a more complex set of objectives. In addition, the dependencies between different goals are difficult to be a priori inferred. This paper proposes a strategy for tuning the compilation of any given application. This is accomplished by using an automatic variation of the compilation options by means of multi-objective optimization and evolutionary computation commanded by the NSGA-II algorithm. This allows finding compilation options that simultaneously optimize different objectives. The advantages of our proposal are illustrated by means of a case study based on the well-known Apache web server. Our strategy has demonstrated an ability to find improvements up to 7.5% and up to 27% in context switches and L2 cache misses, respectively, and also discovers the most important bottlenecks involved in the application performance.
Resumo:
Chiral L-prolinamides 2 containing the (R,R)- and (S,S)-trans-cyclohexane-1,2-diamine scaffold and a 2-pyrimidinyl unit are synthesized and used as general organocatalysts for intermolecular and intramolecular aldol reactions with 1,6-hexanedioic acid as a co-catalyst under solvent-free conditions. The intermolecular reaction between ketone–aldehyde and aldehyde–aldehyde must be performed under wet conditions with catalyst (S,S)-2b at 10 °C, which affords anti-aldols with high regio-, diastereo-, and enantioselectivities. For the Hajos–Parrish–Eder–Sauer–Wiechert reaction, both diastereomers of catalyst 2 give similar results at room temperature in the absence of water to give the corresponding Wieland–Miescher ketone and derivatives. Both types of reactions were scaled up to 1 g, and the organocatalysts were recovered by extractive workup and reused without any appreciable loss in activity. DFT calculations support the stereochemical results of the intermolecular process and the bifunctional role played by the organocatalyst by providing a computational comparison of the H-bonding networks occurring with catalysts 2a and 2b.
Resumo:
Enantiomerically pure carbamate-monoprotected trans-cyclohexane-1,2-diamines are used as chiral organocatalysts for the addition of aryl ketones and acetone to nitroalkenes to give enantioenriched β-substituted γ-nitroketones. The reaction was performed in the presence of 3,4-dimethoxybenzoic acid as an additive, in chloroform as the solvent at room temperature, achieving enantioselectivities up to 96%. Theoretical calculations are used to justify the observed sense of the stereoinduction.
Resumo:
Nowadays, new computers generation provides a high performance that enables to build computationally expensive computer vision applications applied to mobile robotics. Building a map of the environment is a common task of a robot and is an essential part to allow the robots to move through these environments. Traditionally, mobile robots used a combination of several sensors from different technologies. Lasers, sonars and contact sensors have been typically used in any mobile robotic architecture, however color cameras are an important sensor due to we want the robots to use the same information that humans to sense and move through the different environments. Color cameras are cheap and flexible but a lot of work need to be done to give robots enough visual understanding of the scenes. Computer vision algorithms are computational complex problems but nowadays robots have access to different and powerful architectures that can be used for mobile robotics purposes. The advent of low-cost RGB-D sensors like Microsoft Kinect which provide 3D colored point clouds at high frame rates made the computer vision even more relevant in the mobile robotics field. The combination of visual and 3D data allows the systems to use both computer vision and 3D processing and therefore to be aware of more details of the surrounding environment. The research described in this thesis was motivated by the need of scene mapping. Being aware of the surrounding environment is a key feature in many mobile robotics applications from simple robotic navigation to complex surveillance applications. In addition, the acquisition of a 3D model of the scenes is useful in many areas as video games scene modeling where well-known places are reconstructed and added to game systems or advertising where once you get the 3D model of one room the system can add furniture pieces using augmented reality techniques. In this thesis we perform an experimental study of the state-of-the-art registration methods to find which one fits better to our scene mapping purposes. Different methods are tested and analyzed on different scene distributions of visual and geometry appearance. In addition, this thesis proposes two methods for 3d data compression and representation of 3D maps. Our 3D representation proposal is based on the use of Growing Neural Gas (GNG) method. This Self-Organizing Maps (SOMs) has been successfully used for clustering, pattern recognition and topology representation of various kind of data. Until now, Self-Organizing Maps have been primarily computed offline and their application in 3D data has mainly focused on free noise models without considering time constraints. Self-organising neural models have the ability to provide a good representation of the input space. In particular, the Growing Neural Gas (GNG) is a suitable model because of its flexibility, rapid adaptation and excellent quality of representation. However, this type of learning is time consuming, specially for high-dimensional input data. Since real applications often work under time constraints, it is necessary to adapt the learning process in order to complete it in a predefined time. This thesis proposes a hardware implementation leveraging the computing power of modern GPUs which takes advantage of a new paradigm coined as General-Purpose Computing on Graphics Processing Units (GPGPU). Our proposed geometrical 3D compression method seeks to reduce the 3D information using plane detection as basic structure to compress the data. This is due to our target environments are man-made and therefore there are a lot of points that belong to a plane surface. Our proposed method is able to get good compression results in those man-made scenarios. The detected and compressed planes can be also used in other applications as surface reconstruction or plane-based registration algorithms. Finally, we have also demonstrated the goodness of the GPU technologies getting a high performance implementation of a CAD/CAM common technique called Virtual Digitizing.