Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Flutter margin with non-linearities: real-time prediction of flutter onset speed

The present article shows a procedure to predict the flutter speed based on real-time tuning of a quasi non-linear aeroelastic model. A two-dimensional non-linear (freeplay) aeroeslastic model is implemented inMatLab/Simulink with incompressible aerodynamic conditions. A comparison with real compressible conditions is provided. Once the numerical validation is accomplished, a parametric aeroelastic model is built in order to describe the proposed procedure and contribute to reduce the number of flight hours needed to expand the flutter envelope.

Inverse kinematics of a humanoid robot with non-spherical hip: a hybrid algorithm approach

This paper describes an approach to solve the inverse kinematics problem of humanoid robots whose construction shows a small but non negligible offset at the hip which prevents any purely analytical solution to be developed. Knowing that a purely numerical solution is not feasible due to variable efficiency problems, the proposed one first neglects the offset presence in order to obtain an approximate “solution” by means of an analytical algorithm based on screw theory, and then uses it as the initial condition of a numerical refining procedure based on the Levenberg‐Marquardt algorithm. In this way, few iterations are needed for any specified attitude, making it possible to implement the algorithm for real‐time applications. As a way to show the algorithm’s implementation, one case of study is considered throughout the paper, represented by the SILO2 humanoid robot.

On a competitive system under chemotactic effects with non-local terms

In this paper, we study a system of partial differential equations describing the evolution of a population under chemotactic effects with non-local reaction terms. We consider an external application of chemoattractant in the system and study the cases of one and two populations in competition. By introducing global competitive/cooperative factors in terms of the total mass of the populations, weobtain, forarangeofparameters, thatanysolutionwithpositive and bounded initial data converges to a spatially homogeneous state with positive components. The proofs rely on the maximum principle for spatially homogeneous sub- and super-solutions.

On a parabolic-elliptic chemotactic system with non-constant chemotactic sensitivity

We study a parabolic–elliptic chemotactic system describing the evolution of a population’s density “u” and a chemoattractant’s concentration “v”. The system considers a non-constant chemotactic sensitivity given by “χ(N−u)”, for N≥0, and a source term of logistic type “λu(1−u)”. The existence of global bounded classical solutions is proved for any χ>0, N≥0 and λ≥0. By using a comparison argument we analyze the stability of the constant steady state u=1, v=1, for a range of parameters. – For N>1 and Nλ>2χ, any positive and bounded solution converges to the steady state. – For N≤1 the steady state is locally asymptotically stable and for χN<λ, the steady state is globally asymptotically stable.

Source terms for calculations of vaporizing and burning fuel sprays with non-unity Lewis numbers in gases with temperature-dependent thermal conductivities

Liquid-fueled burners are used in a number of propulsion devices ranging from internal combustion engines to gas turbines. The structure of spray flames is quite complex and involves a wide range of time and spatial scales in both premixed and non-premixed modes (Williams 1965; Luo et al. 2011). A number of spray-combustion regimes can be observed experimentally in canonical scenarios of practical relevance such as counterflow diffusion flames (Li 1997), as sketched in figure 1, and for which different microscalemodelling strategies are needed. In this study, source terms for the conservation equations are calculated for heating, vaporizing and burning sprays in the single-droplet combustion regime. The present analysis provides extended formulation for source terms, which include non-unity Lewis numbers and variable thermal conductivities.

Sensitivity analysis for active matched antennas with non-foster elements

During the last years many researchers have been working on the active matching or on non-Foster matching networks for one- and two-port electrically small antennas (ESAs). A new parameter on the sensitivity of the two-port electrically small antenna when loaded with a non-F oster network is presented. This sensitivity analysis will allow us to choose what kind of antennas can be properly matched with non-Foster networks and their position in order to optimi ze the performance of the design. Then, a typical high Q two-port antenna will be harder to match over a broad bandwidth, since |S21| is very small and only agrees with |S11| over very small frequency bands, yielding very large sensitivity values. However, for these two-port antennas, if high levels of coupling can be engineered for a high Q multiple-port antenna, the return and insertion losses can be similar over larger bandwidths and, hence, the sensitivity can be kept low over larger bandwidths, enabling broader impedance matched bandwidths to be achieved, even for highly resonant antennas.

Influence of sequential and mixed fermentations with non-Saccharomyces yeasts on the sensory profile of red wine

The aim of this work is to evaluate the influence of S. pombe and T. delbrueckii species on the sensory quality of red wine when used in sequential and mixed fermentations with S. cerevisiae.

Dust effects on PV array performance: in-field observations with non-uniform patterns

This paper presents the impact of non-homogeneous deposits of dust on the performance of a PV array. The observations have been made in a 2-MW PV park in the southeast region of Spain. The results are that inhomogeneous dust leads to more significant consequences than the mere short-circuit current reduction resulting from transmittance losses. In particular, when the affected PV modules are part of a string together with other cleaned (or less dusty) ones, operation voltage losses arise. These voltage losses can be several times larger than the short-circuit ones, leading to power losses that can be much larger than what measurements suggest when the PV modules are considered separately. Significant hot-spot phenomena can also arise leading to cells exhibiting temperature differences of more than 20 degrees and thus representing a threat to the PV modules' lifetime.

Tools in Spanish Universities to facilitate the transmission from High School to University and their assessment.

Incoming students in the University have education deficiencies, so universities studies require a sound basis of scientific knowledge. In this project are analysed instruments to reinforcing knowledge in those areas related to the studies that students are about to embark on public Spanish universities. There are important differences among universities and, in each university there are great differences among titles. Initial courses (cursos cero) are widespread (in 50% of universities) that selfevaluation instruments (14 % of universities). It is necessary to improve diffusion of those instruments because it is not possible to evaluate them. So are proposed the next actuations: to make regular standard surveys for professors and students; to publish results of surveys; public universities should institutionalize their basic training offer and improve the dissemination of this offer especially through the web. This paper presents a questionnaire to assess student opinion about these tools. To analyze the effectiveness, and make an initial estimate of the evaluation of these tools, we conducted a pilot test of the questionnaire with 68 students at the University of Extremadura. The results of preliminary statistical analysis conducted on the pilot test indicate that the survey results are reliable. A global evaluation of both tools, with a scale of 1 to 5, gave an average score of 3.29 for initial courses and 3.41 for selfevaluation. The 72.9% of the students consider the "self assessment" more effective than the "initial course"

A Coordinated Plan for Teaching Software Engineering in the University Rey Juan Carlos.

Un plan para organizar las enseñanzas de la ingeniería del software en las titulaciones de informática de la URJC. Nowadays both industry and academic environments are showing a lot of interest in the Software Engineering discipline. Therefore, it is a challenge for universities to provide students with appropriate training in this area, preparing them for their future professional practice. There are many difficulties to provide that training. The outstanding ones are: the Software Engineering area is too broad and class hours are scarce; the discipline requires a high level of abstraction; it is difficult to reproduce real world situations in the classroom to provide a practical learning environment; the number of students per professor is very high (at least in Spain); companies develop software with a maturity level rarely over level 2 of the CMM for Software (again, at least in Spain) as opposed to what is taught at the University. Besides, there are different levels and study plans, making more difficult to structure the contents to teach in each term and degree. In this paper we present a plan for teaching Software Engineering trying to overcome some of the difficulties above.

Non uniform embedding based on relevance analysis with reduced computational complexity: application to the detection of pathologies from biosignal recordings

Nonlinear analysis tools for studying and characterizing the dynamics of physiological signals have gained popularity, mainly because tracking sudden alterations of the inherent complexity of biological processes might be an indicator of altered physiological states. Typically, in order to perform an analysis with such tools, the physiological variables that describe the biological process under study are used to reconstruct the underlying dynamics of the biological processes. For that goal, a procedure called time-delay or uniform embedding is usually employed. Nonetheless, there is evidence of its inability for dealing with non-stationary signals, as those recorded from many physiological processes. To handle with such a drawback, this paper evaluates the utility of non-conventional time series reconstruction procedures based on non uniform embedding, applying them to automatic pattern recognition tasks. The paper compares a state of the art non uniform approach with a novel scheme which fuses embedding and feature selection at once, searching for better reconstructions of the dynamics of the system. Moreover, results are also compared with two classic uniform embedding techniques. Thus, the goal is comparing uniform and non uniform reconstruction techniques, including the one proposed in this work, for pattern recognition in biomedical signal processing tasks. Once the state space is reconstructed, the scheme followed characterizes with three classic nonlinear dynamic features (Largest Lyapunov Exponent, Correlation Dimension and Recurrence Period Density Entropy), while classification is carried out by means of a simple k-nn classifier. In order to test its generalization capabilities, the approach was tested with three different physiological databases (Speech Pathologies, Epilepsy and Heart Murmurs). In terms of the accuracy obtained to automatically detect the presence of pathologies, and for the three types of biosignals analyzed, the non uniform techniques used in this work lightly outperformed the results obtained using the uniform methods, suggesting their usefulness to characterize non-stationary biomedical signals in pattern recognition applications. On the other hand, in view of the results obtained and its low computational load, the proposed technique suggests its applicability for the applications under study.

Temperature of solar cells with regard to photoactive and non-photoactive light absorption in concentrator PV modules

A new method has recently been proposed by us for accurate measurement of the solar cell temperature in any operational regime, in particular, at a maximum power point (MPP) of the I-V curve (T-p-n(MPP)). For this, fast switching of a cell from MPP to open circuit (OC) regime is carried out and open circuit voltage V-oc is measured immediately (within about 1 millisecond), so that this value becomes to be an indicator of T-p-n(MPP). In the present work, we have considered a practical case, when a solar cell is heated not only by absorption of light incident upon its surface (called "photoactive" absorption of power), but also by heat transferred from structural elements surrounding the cell and heated by absorption of direct or diffused sunlight ("non-photoactive" absorption of power with respect to a solar cell). This process takes place in any concentrator module with non-ideal concentrators. Low overheating temperature of the p-n junction (or p-n junctions in a multijunction cell) is a cumulative parameter characterizing the quality of a solar module by the factor of heat removal effectiveness and, at the same time, by the factor of low "non-photoactive" losses.

University employees work schedule

The aim of this project is to create a website which is useful both employees and students of a university, so employees can add information, if they log in with username and password access, and students can view this information . Employees may modify and display information such as title, room, or their faculty (from a list defined by the administrator), and most importantly, their schedule, whether class, tutoring, free time, or any of tasks that the administrator define. There will be a manager, responsible for managing employees, the availables faculties and the types of tasks that employees can use on their schedule. Students may see the employees schedules and rooms on the homepage. They differentiate between differents tasks of employees, because these are in different colors. They can also filter information for faculty, employee or day. To achieve our goal, we decided to program in Java using Servlets, which we will use to generate response to requests coming from users from the website. We will also use JSP, allowing us to create different websites files. We use JSP files and not HTML, because we need that the pages are dynamic, since not only want to show specific information, we like that information can change depending on user requests. The JSP file allows us to generate HTML, but also using JAVA language, which is necessary for our purpose. As the information we store is not fixed. We want this information can be modified at any time by employees and admin, so we need a database, which can be accessed from anywhere. We decided SQLite databases because are integrated quite well in our application, and offer a quick response. To access the database from our program, we simply connect it to the database, and with very few lines of code, add, delete or modify entries in different tables that owns the database. To facilitate the initial creation of the database, and the first tables, we use a Mozilla Firefox browser plugin, called SQLite Manager, which allows us to do so from a more friendly interface. Finally, we need a server that supports and implements specifications Servlets and JSP. We decided on the TomCat server, which is a container Servlets, because is free, easy to use, and compatible with our program. We realized all the project with Eclipse environment, also free program that allows integrating database, server and program the JSP and Servlets. Once submitted all the tools we used, we must first organize the structure of the web, relating each Servlets with JSP files. Next, create the database and the different Servlets, and adjust the database accesses to make sure we do it right. From here simply is to build up the page step by step, showing in each place we need, and redirect to different pages. In this way, we can build a complex website, free, and without being an expert in the field. RESUMEN. El objetivo de este proyecto, es crear una página web que sirva tanto a empleados como a alumnos de una universidad, de tal manera que los empleados podrán añadir información, mediante el acceso con usuario y contraseña, y los alumnos podrán visualizar está información. Los empleados podrán modificar y mostrar información como su título, despacho, facultad a la que pertenecen (de entre una lista definida por el administrador), y lo más importante, sus horarios, ya sean de clase, tutorías, tiempo libre, o cualquiera de las tareas que el administrador defina. Habrá un administrador, encargado de gestionar los empleados existentes, las facultades disponibles y los tipos de tareas que podrán usar los empleados en su horario. Los alumnos, podrán visualizar los horarios y despacho de los empleados en la página principal. Diferenciarán entre las distintas tareas de los profesores, porque estas se encuentran en colores diferentes. Además, podrán filtrar la información, por facultad, empleado o día de la semana. Para conseguir nuestro objetivo, hemos decidido programar en Java, mediante el uso de Servlets, los cuales usaremos para generar respuesta antes las peticiones que llegan de los usuarios desde la página web. También usaremos archivos JSP, que nos permitirán crear las diferentes páginas webs. Usamos archivos JSP y no HTML, porque necesitamos que las diferentes páginas sean dinámicas, ya que no solo queremos mostrar una información concreta, si no que esta información puede variar en función de las peticiones de usuario. El archivo JSP nos permite generar HTML, pero a la vez usar lenguaje JAVA, algo necesario para nuestro cometido. Como la información que queremos almacenar no es fija, si no que en todo momento debe poder ser modificada por empleados y administrador, necesitamos una base de datos, a la que podamos acceder desde la web. Nos hemos decidido por bases SQLite, ya que se integran bastante bien en nuestra aplicación, y además ofrecen una rápida respuesta. Para acceder a la base de datos desde nuestro programa, simplemente debemos conectar el mismo a la base de datos, y con muy pocas líneas de código, añadir, eliminar o modificar entradas de las diferentes tablas que posee la base de datos. Para facilitar la creación inicial de la base de datos, y de las primeras tablas, usamos un complemento del navegador Mozilla Firefox, llamado SQLite Manager, que nos permite hacerlo desde una interfaz más amigable. Por último, necesitamos de un servidor que soporte e implemente las especificaciones de los Servlets y JSP. Nos decidimos por el servidor TomCat, que es un contenedor de Servlets gratuito, de fácil manejo, y compatible con nuestro programa. Todo el desarrollo del proyecto, lo realizamos desde el entorno Eclipse, programa también gratuito, que permite integrar la base de datos, el servidor y programar los JSP y Servlets. Una vez presentadas todas las herramientas que hemos utilizado, primero debemos organizar la estructura de la web, relacionando cada archivo JSP con los Servlets a los que debe acceder. A continuación creamos la base de datos y los diferentes Servlets, y ajustamos bien los accesos a la base de datos para comprobar que lo hacemos correctamente. A partir de aquí, simplemente es ir construyendo la página paso a paso, mostrando en cada lugar lo que necesitemos, y redirigiendo a las diferentes páginas. De esta manera, podremos construir una página web compleja, de manera gratuita, y sin ser un experto en la materia.