A wind park reduced-order model using singular perturbations theory

Due to the increasing penetration of wind energy, it is necessary to possess design tools that are able to simulate the impact of these installations on electric utility grids. In order to provide a net contribution to this issue, a detailed wind park model has been developed and is briefly presented. However, the computational costs associated with the performance of such a detailed model in describing the behavior of a wind park composed by a considerable number of units may render its practical application very difficult. To overcome this problem, singular perturbations theory has been applied to reduce the order of the detailed wind park model, and therefore create the conditions for the development of a dynamic equivalent which is able to retain the relevant dynamics with respect to the existing AC power system. Validation results proving the ability of singular perturbations reduced order model to match the results provided by the detailed model are shown and commented upon     

Spurious Valleys in the Error Surface of Recurrent Networks—Analysis and Avoidance

This paper gives a detailed analysis of the error surfaces of certain recurrent networks and explains some difficulties encountered in training recurrent networks. We show that these error surfaces contain many spurious valleys, and we analyze the mechanisms that cause the valleys to appear. We demonstrate that the principle mechanism can be understood through the analysis of the roots of random polynomials. This paper also provides suggestions for improvements in batch training procedures that can help avoid the difficulties caused by spurious valleys, thereby improving training speed and reliability.     

Microbiological survey of a South African poultry processing plant

Bacterial populations associated with poultry processing were determined on neck skin samples, equipment surfaces and environmental samples by replicate surveys. Aerobic plate counts, Enterobacteriaceae counts, Enterobacteriaceae counts and Pseudomonas counts were performed by standard procedures and the prevalence of Listeria, presumptive Salmonella and Staphylococcus aureus determined. Statistically significant (P < 0.05) increases in counts of all types of bacteria were obtained on product samples as a result of processing. Although bacterial counts on neck skin samples decreased by 0.3 to 0.4 log CFU g-1 after spray washing of carcasses, subsequent spinchilling and packaging of whole carcasses resulted in 0.7 to 1.2 log CFU g-1 increases. Bacterial numbers on equipment surfaces, however, decreased significantly from the "dirty" to the "clean" areas of the abattoir. Transport cages, "rubber fingers", defeathering curtains, shackles and conveyor belts repeatedly showed aerobic plate counts in excess of 5.0 log CFU 25 cm-2. Aerobic plate counts of scald tank and spinchiller water were 2 log CFU ml-1 higher than those of potable water samples. Bacterial numbers of the air in the "dirty" area were higher than those of the "clean" area. Listeria, presumptive Salmonella and Staphylococcus aureus were isolated from 27.6, 51.7 and 24.1% of all product samples, respectively, and Listeria and Staphylococcus aureus were also isolated from selected equipment surfaces.     

Hybrid automata, reachability, and Systems Biology

Hybrid automata are a powerful formalism for the representation of systems evolving according to both discrete and continuous laws. Unfortunately, undecidability soon emerges when one tries to automatically verify hybrid automata properties. An important verification problem is the reachability one that demands to decide whether a set of points is reachable from a starting region.If we focus on semi-algebraic hybrid automata the reachability problem is semi-decidable. However, high computational costs have to be afforded to solve it. We analyse this problem by exploiting some existing tools and we show that even simple examples cannot be efficiently solved. It is necessary to introduce approximations to reduce the number of variables, since this is the main source of runtime requirements. We propose some standard approximation methods based on Taylor polynomials and ad hoc strategies. We implement our methods within the software SAHA-Tool and we show their effectiveness on two biological examples: the Repressilator and the Delta-Notch protein signaling.     

Home-based communication system for older adults and their remote family

As in many Latin–American countries, in Mexico many older adults live alone as a result of the migration of one or more of their relatives, mostly to the USA. Thus, not only do they live alone, but they might seldom see these relatives for long periods, even though they often depend on them financially. With the goal of designing appropriate communication technology for seniors and their relatives experiencing this situation, we conducted interviews and evaluated scenarios and prototypes to reveal the practical ways they maintain emotional ties despite the distance. Based on those findings, we envisioned a communication system through which seniors and their relatives can maintain close social ties by sharing information, personal reminiscences and stories. We found that older adults perceived the system as a richer, natural form of communication with their relatives that could facilitate their integration into the networks that currently connect members of their families.     

A Minimal Closed-form Solution for the Perspective Three Orthogonal Angles (P3oA) Problem: Application To Visual Odometry

We provide a simple closed-form solution to the Perspective three orthogonal angles (P3oA) problem: given the projection of three orthogonal lines in a calibrated camera, find their 3D directions. Upon this solution, an algorithm for the estimation of the camera relative rotation between two frames is proposed. The key idea is to detect triplets of orthogonal lines in a hypothesize-and-test framework and use all of them to compute the camera rotation in a robust way. This approach is suitable for human-made environments where numerous groups of orthogonal lines exist. We evaluate the numerical stability of the P3oA solution and the estimation of the relative rotation with synthetic and real data, comparing our results to other state-of-the-art approaches.     

Face tracking with automatic model construction

This paper describes an active model with a robust texture model built on-line. The model uses one camera and it is able to operate without active illumination. The texture model is defined by a series of clusters, which are built in a video sequence using previously encountered samples. This model is used to search for the corresponding element in the following frames. An on-line clustering method, named leaderP is described and evaluated on an application of face tracking. A 20-point shape model is used. This model is built offline, and a robust fitting function is used to restrict the position of the points. Our proposal is to serve as one of the stages in a driver monitoring system. To test it, a new set of sequences of drivers recorded outdoors and in a realistic simulator has been compiled. Experimental results for typical outdoor driving scenarios, with frequent head movement, turns and occlusions are presented. Our approach is tested and compared with the Simultaneous Modeling and Tracking (SMAT) [1], and the recently presented Stacked Trimmed Active Shape Model (STASM) [2], and shows better results than SMAT and similar fitting error levels to STASM, with much faster execution times and improved robustness.     

Using OGRO and CertiVeR to improve OCSP validation for Grids

Authentication and authorization in many distributed systems rely on the use of cryptographic credentials that in most of the cases have a defined lifetime. This feature mandates the use of mechanisms able to determine whether a particular credential can be trusted at a given moment. This process is commonly named validation. Among available validation mechanisms, the Online Certificate Status Protocol (OCSP) stands out due to its ability to carry near real time certificate status information. Despite its importance for security, OCSP faces considerable challenges in the computational Grid (i.e. Proxy Certificate’s validation) that are being studied at the Global Grid Forum’s CA Operations Work Group (CAOPS-WG). As members of this group, we have implemented an OCSP validation infrastructure for the Globus Toolkit 4, composed of the CertiVeR Validation Service and our Open GRid Ocsp (OGRO) client library, which introduced the Grid Validation Policy. This paper summarizes our experiences on that work and the results obtained up to now. Furthermore we introduce the prevalidation concept, a mechanism analogous to the Authorization Push-Model, capable of improving OCSP validation performance in Grids. This paper also reports the results obtained with OGRO’s prevalidation rules for Grid Services as a proof of concept.