Do expertise and the degree of perception-action coupling affect natural anticipatory performance?

Two experiments using a temporal occlusion paradigm (the first with expert and novice participants and the second with participants of intermediate skill) were conducted to examine the capability of tennis players to predict the direction of an opponent's service in situ. In both experiments two different response conditions, reflecting differing degrees of perception-action coupling, were employed. In a coupled condition players were required to make a movement-based response identical to that which they would use to hit a return of service in a game situation, whereas in an uncoupled condition a verbal prediction of service direction was required. Experiment 1 provided clear evidence of superior prediction accuracy under the coupled response condition when ball flight was available, plus some limited evidence to suggest that superior prediction accuracy under uncoupled response conditions might hold true if only advance (pre-contact) information was available. Experiment 2 showed the former finding to be a robust one, but was unable to reveal any support for the latter. Experiment 1 also revealed that expert superiority is more apparent for predictions made under natural (coupled) than uncoupled response-mode conditions. Collectively, these findings suggest that different perceptual processes may be in operation in anticipatory tasks which depend on skill level, the type of information presented, and degree of perception-action coupling inherent in the task requirements.

LEARNING ENVIRONMENTS IN THE CONTEXT OF A MASTER DEGREE IN ANIMATION AND ILLUSTRATION

This paper aims to describe the processes of teaching illustration and animation, together, in the context of a masters degree program. In Portugal, until very recently, illustration and animation higher education courses, were very scarce and only provided by a few private universities, which offered separated programs - either illustration or animation. The MA in Illustration and Animation (MIA) based in the Instituto Politécnico do Cávado e Ave in Portugal, dared to join these two creative areas in a common learning model and is already starting it’s third edition with encouraging results and will be supported by the first international conference on illustration and animation (CONFIA). This masters program integrates several approaches and techniques (in illustration and animation) and integrates and encourages creative writing and critique writing. This paper describes the iterative process of construction, and implementation of the program as well as the results obtained on the initial years of existence in terms of pedagogic and learning conclusions. In summary, we aim to compare pedagogic models of animation or illustration teaching in higher education opposed to a more contemporary and multidisciplinary model approach that integrates the two - on an earlier stage - and allows them to be developed separately – on the second part of the program. This is based on the differences and specificities of animation (from classic techniques to 3D) and illustration (drawing the illustration) and the intersection area of these two subjects within the program structure focused on the students learning and competencies acquired to use in professional or authorial projects.

CP properties of symmetry-constrained two-Higgs-doublet models

The two-Higgs-doublet model can be constrained by imposing Higgs-family symmetries and/or generalized CP symmetries. It is known that there are only six independent classes of such symmetry-constrained models. We study the CP properties of all cases in the bilinear formalism. An exact symmetry implies CP conservation. We show that soft breaking of the symmetry can lead to spontaneous CP violation (CPV) in three of the classes.

Unit Commitment in a Competitive and Emission Constrained Environment

This paper is on the unit commitment problem, considering not only the economic perspective, but also the environmental perspective. We propose a bi-objective approach to handle the problem with conflicting profit and emission objectives. Numerical results based on the standard IEEE 30-bus test system illustrate the proficiency of the proposed approach.

Coordination between mid-term maintenance outage decisions and short-term security-constrained scheduling in smart distribution systems

Distribution systems are the first volunteers experiencing the benefits of smart grids. The smart grid concept impacts the internal legislation and standards in grid-connected and isolated distribution systems. Demand side management, the main feature of smart grids, acquires clear meaning in low voltage distribution systems. In these networks, various coordination procedures are required between domestic, commercial and industrial consumers, producers and the system operator. Obviously, the technical basis for bidirectional communication is the prerequisite of developing such a coordination procedure. The main coordination is required when the operator tries to dispatch the producers according to their own preferences without neglecting its inherent responsibility. Maintenance decisions are first determined by generating companies, and then the operator has to check and probably modify them for final approval. In this paper the generation scheduling from the viewpoint of a distribution system operator (DSO) is formulated. The traditional task of the DSO is securing network reliability and quality. The effectiveness of the proposed method is assessed by applying it to a 6-bus and 9-bus distribution system.

International mobility in the Pharmacy degree at the school of allied health sciences of Oporto

Background: The Erasmus program is a subprogram of the Lifelong Learning program, exclusive for Higher Education that promotes (among other initiatives), the mobility of students(studies, training or internships). The mobility of students of higher education seeks to improve the quality and development of future professionals, providing a multidisciplinary and multicultural experience. Setting: Academic Pharmacy/Pharmacy Technicians Methods: We conducted a descriptive and transversal study on the implementation of the mobility program and analyze the results, which involved applying a survey to students. Results: Since 2009/2010, the Pharmacy Degree at ESTSP has established 7 SMs protocols resulting in an average mobility of 5 students IN and 7 Students OUT. We have also endeavoured in SMp Protocols for extracurricular training with an average of 3 students OUT. The application process is normally open during the year before the mobility period. For most of the students involved, this was a first time opportunity to be in a foreign country and more than 70% choose the mobility program because it is seen as a possibility to improve their curriculum, for personal development or even to pursue employment opportunities abroad. The mobility for teachers is also encouraged. Conclusions: The exchange of experiences and training, acquired during cooperation activities should be an element of continuous dynamics and institutional affirmation. Initiatives such as the ERASMUS Program contribute to the educational and scientific enrichment, and promote international competitiveness among Higher Education Institutions.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Dimensionless analysis of constrained damping treatments

One of the most effective ways of controlling vibrations in plate or beam structures is by means of constrained viscoelastic damping treatments. Contrary to the unconstrained configuration, the design of constrained and integrated layer damping treatments is multifaceted because the thickness of the viscoelastic layer acts distinctly on the two main counterparts of the strain energy the volume of viscoelastic material and the shear strain field. In this work, a parametric study is performed exploring the effect that the design parameters, namely the thickness/length ratio, constraining layer thickness, material modulus, natural mode and boundary conditions have on these two counterparts and subsequently, on the treatment efficiency. This paper presents five parametric studies, namely, the thickness/length ratio, the constraining layer thickness, material properties, natural mode and boundary conditions. The results obtained evidence an interesting effect when dealing with very thin viscoelastic layers that contradicts the standard treatment efficiency vs. layer thickness relation; hence, the potential optimisation of constrained and integrated viscoelastic treatments through the use of properly designed thin multilayer configurations is justified. This work presents a dimensionless analysis and provides useful general guidelines for the efficient design of constrained and integrated damping treatments based on single or multi-layer configurations. (C) 2012 Elsevier Ltd. All rights reserved.

Mapping stability : real rational maps of degree zero

In memory of our beloved Professor José Rodrigues Santos de Sousa Ramos (1948-2007), who João Cabral, one of the authors of this paper, had the honor of being his student between 2000 and 2006, we wrote this paper following the research by experimentation, using the new technologies to capture a new insight about a problem, as him so much love to do it. His passion was to create new relations between different fields of mathematics. He was a builder of bridges of knowledge, encouraging the birth of new ways to understand this science. One of the areas that Sousa Ramos researched was the iteration of maps and the description of its behavior, using the symbolic dynamics. So, in this issue of this journal, honoring his memory, we use experimental results to find some stable regions of a specific family of real rational maps, the ones that he worked with João Cabral. In this paper we describe a parameter space (a,b) to the real rational maps fa,b(x) = (x2 −a)/(x2 −b), using some tools of dynamical systems, as the study of the critical point orbit and Lyapunov exponents. We give some results regarding the stability of these family of maps when we iterate it, specially the ones connected to the order 3 of iteration. We hope that our results would help to understand better the behavior of these maps, preparing the ground to a more efficient use of the Kneading Theory on these family of maps, using symbolic dynamics.

Sensing Cloud Optimization applied to a non-convex constrained economical dispatch

Conferência: 39th Annual Conference of the IEEE Industrial-Electronics-Society (IECON) - NOV 10-14, 2013

Evaluation of ochratoxin A exposure degree in two Portuguese cities through wheat and maize bread consumption during the winter 2007

The occurrence of OTA in fresh and packed wheat and in maize bread and the evaluation of the exposure degree through their consumption in two Portuguese populations from Porto and Coimbra, during the winter of 2007, were studied. One hundred and sixty eight bread samples, 61 maize and 107 wheat, were analysed by liquid chromatography–fluorescence detection (LC–FD). The results showed that 84% of samples were contaminated, with a maximum level of 3.85 ng/g (above the EU maximum limit, 3 ng/g). Fresh wheat bread presented higher levels than packed wheat bread. Moreover, the traditional maize bread, in either city, was consistently more contaminated than wheat bread, 0.25 vs 0.19 ng/g, and 0.48 vs 0.34 ng/ g for Porto and Coimbra, respectively. Avintes maize bread showed the highest mean contamination and maximum levels. The higher estimated daily intake of OTA from both types of bread in the population of Coimbra compared to Porto reflects the higher average contamination of bread in the first city.

Modernização da linha da Beira Baixa: troço Covilhã - Guarda

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Vias de Comunicação e Transportes

RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

Securing group communication in wireless sensor networks has recently been extensively investigated. Many works have addressed this issue, and they have considered the grouping concept differently. In this paper, we consider a group as being a set of nodes sensing the same data type, and we alternatively propose an efficient secure group communication scheme guaranteeing secure group management and secure group key distribution. The proposed scheme (RiSeG) is based on a logical ring architecture, which permits to alleviate the group controller’s task in updating the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack, and gives a solution to detect and eliminate the compromised nodes. The security analysis and performance evaluation show that the proposed scheme is secure, highly efficient, and lightweight. A comparison with the logical key hierarchy is preformed to prove the rekeying process efficiency of RiSeG. Finally, we present the implementation details of RiSeG on top of TelosB sensor nodes to demonstrate its feasibility.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.