Audio as medium for content distribution (providing access to knowledge)

Reaching and educating the masses to the benefit of all of mankind is the ultimate goal and through the use of this technology facility/tool many can be reached in their own language, in their own community, in their own time and at their own pace. Making this content available to those who will benefit from the information, is vital. These people who want to consume the content are not necessarily that interested in the qualification, they need the information. Making the content available in an auditory format may also help those who may not be as literate as others. The uses of audio/ recorded lessons have a number of uses and should not just be seen as a medium for content distribution to distant communities. Recording lectures makes it possible for a lecturer to present lectures to a vast number of students, while just presenting the lecture once.

A mixed H2/H∞-based semiactive control for vibration mitigation in flexible structures

In this paper, we address this problem through the design of a semiactive controller based on the mixed H2/H∞ control theory. The vibrations caused by the seismic motions are mitigated by a semiactive damper installed in the bottom of the structure. It is meant by semiactive damper, a device that absorbs but cannot inject energy into the system. Sufficient conditions for the design of a desired control are given in terms of linear matrix inequalities (LMIs). A controller that guarantees asymptotic stability and a mixed H2/H∞ performance is then developed. An algorithm is proposed to handle the semiactive nature of the actuator. The performance of the controller is experimentally evaluated in a real-time hybrid testing facility that consists of a physical specimen (a small-scale magnetorheological damper) and a numerical model (a large-scale three-story building)

Decision Support Methods for Global Optomization

Immobile location-allocation (LA) problems is a type of LA problem that consists in determining the service each facility should offer in order to optimize some criterion (like the global demand), given the positions of the facilities and the customers. Due to the complexity of the problem, i.e. it is a combinatorial problem (where is the number of possible services and the number of facilities) with a non-convex search space with several sub-optimums, traditional methods cannot be applied directly to optimize this problem. Thus we proposed the use of clustering analysis to convert the initial problem into several smaller sub-problems. By this way, we presented and analyzed the suitability of some clustering methods to partition the commented LA problem. Then we explored the use of some metaheuristic techniques such as genetic algorithms, simulated annealing or cuckoo search in order to solve the sub-problems after the clustering analysis

Solving Large Location-Allocation problems by Clustering and Simulated Annealing

Globalization involves several facility location problems that need to be handled at large scale. Location Allocation (LA) is a combinatorial problem in which the distance among points in the data space matter. Precisely, taking advantage of the distance property of the domain we exploit the capability of clustering techniques to partition the data space in order to convert an initial large LA problem into several simpler LA problems. Particularly, our motivation problem involves a huge geographical area that can be partitioned under overall conditions. We present different types of clustering techniques and then we perform a cluster analysis over our dataset in order to partition it. After that, we solve the LA problem applying simulated annealing algorithm to the clustered and non-clustered data in order to work out how profitable is the clustering and which of the presented methods is the most suitable

On-farm animal welfare assessment in dairy cattle: improved lameness detection

Estudi realitzat a partir d’una estada a la University of British Columbia, Canada, entre 2010 i 2012. Primerament es va desenvolupar una escala per mesurar coixeses (amb valors de l’1 al 5). Aquesta escala es va utilitzar per estudiar l’associació entre factors de risc a nivell de granja (disseny de le instal.lacions i maneig) i la prevalencia de coixeses a Nord America. Les dades es van recollir en un total de 40 granges al Nord Est dels E.E.U.U (NE) i 39 a California (CA) . Totes les vaques del group mes productiu es van categoritzar segons la severitat de les coixeses: sanes, coixes i severament coixes. La prevalencia de coixeses en general fou del 55 % a NE i del 31% a CA. La prevalencia de coixeses severes fou del 8% a NE i del 4% a Ca. A NE, les coixeses en general increntaren amb la presencia de serradura als llits i disminuiren en granjes grans, amb major quantitat de llit i acces a pastura. Les coixeses mes severes incrementaren amb la falta d’higiene als llit i amb la presencia de serradura als llits, i disminuiren amb la quantitat de llit proveit, l’us de sorra als llits i amb la mida de la granja. A CA, les coixeses en general incrementaren amb la falta d’higiene al llit, i disminuiren amb la mida de la granja, la presencia de terres de goma, l’increment d’espai als cubicles , l’espai a l’abeuredor i la desinfeccio de les peulles. Les coixeses severes incrementaren amb la falta d’higiene al llit i disminuixen amb la frequencia de neteja del corral. En conclusio, canvis en el maneig i el disseny de les instal.lacions poden ajudar a disminuir la prevalencia de coixeses, tot i que les estrategies a seguir variaran segons la regio.

Integración del archivo de imágenes de un telescopio robótico al observatorio virtual

S’ha implementat un servei VO (Virtual Observatori) a les instal lacions del Telescopi TFRM, que permet distribuir les imatges preses amb el telescopi de manera remota i automàtica a qualsevol usuari del servei. El servei està format per un arxiu d’imatges, una aplicació que integra les imatges a l'arxiu y una aplicació que es comunica amb els clients d’VO, rebent peticions i responen segons s’especifica al protocol SIAP (Simple Image Access Protocol).

Locating emergency services with priority rules: The priority queuing covering location problem

One of the assumptions of the Capacitated Facility Location Problem (CFLP) is thatdemand is known and fixed. Most often, this is not the case when managers take somestrategic decisions such as locating facilities and assigning demand points to thosefacilities. In this paper we consider demand as stochastic and we model each of thefacilities as an independent queue. Stochastic models of manufacturing systems anddeterministic location models are put together in order to obtain a formula for thebacklogging probability at a potential facility location.Several solution techniques have been proposed to solve the CFLP. One of the mostrecently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, isimplemented in order to solve the model formulated. We present some computationalexperiments in order to evaluate the heuristics performance and to illustrate the use ofthis new formulation for the CFLP. The paper finishes with a simple simulationexercise.

Median problems in networks

The P-median problem is a classical location model par excellence . In this paper we, firstexamine the early origins of the problem, formulated independently by Louis Hakimi andCharles ReVelle, two of the fathers of the burgeoning multidisciplinary field of researchknown today as Facility Location Theory and Modelling. We then examine some of thetraditional heuristic and exact methods developed to solve the problem. In the third sectionwe analyze the impact of the model in the field. We end the paper by proposing new lines ofresearch related to such a classical problem.

New ideas need new space

We develop a setting with weak intellectual property rights, where firms' boundaries, location and knowledge spillovers are endogenous. We have two main results. The first one is that, if communication costs increase with distance, entrepreneurs concerned about information leakage have a benefit from locating away from the industry center: distance is an obstacle to collusive trades between members andnon-members. The second result is that we identify a trade-off for the entrepreneur between owning a facility (controlling all its characteristics) and sharing a facility with a {\it non-member} (an agent not involved in production), therefore losing control over some of its characteristics. We focus on ``location" as the relevant characteristic of the facility, but location can be used as a spatial metaphor for other relevant characteristics of the facility. For theentrepreneur, sharing the facility with non-members implies that the latter, as co-owners, know the location (even if they do not have access to it). Knowledge of the location for the co-owners facilitates collusion with employees, what increases leakage. The model yields a benefit for new plants from spatial dispersion (locating at the periphery of the industry), particularly so for new plants of new firms.We relate this result with recent empirical findings on the dynamics of industry location.

On optimal location with treshold requirements

The optimal location of services is one of the most important factors that affects service quality in terms of consumer access. On theother hand, services in general need to have a minimum catchment area so as to be efficient. In this paper a model is presented that locates the maximum number of services that can coexist in a given region without having losses, taking into account that they need a minimum catchment area to exist. The objective is to minimize average distance to the population. The formulation presented belongs to the class of discrete P--median--like models. A tabu heuristic method is presented to solve the problem. Finally, the model is applied to the location of pharmacies in a rural region of Spain.

The P-median problem in a changing network: The case of Barcelona

In this paper a p--median--like model is formulated to address theissue of locating new facilities when there is uncertainty. Severalpossible future scenarios with respect to demand and/or the travel times/distanceparameters are presented. The planner will want a strategy of positioning thatwill do as ``well as possible'' over the future scenarios. This paper presents a discrete location model formulation to address this P--Medianproblem under uncertainty. The model is applied to the location of firestations in Barcelona.

Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems

When dealing with the design of service networks, such as healthand EMS services, banking or distributed ticket selling services, thelocation of service centers has a strong influence on the congestion ateach of them, and consequently, on the quality of service. In this paper,several models are presented to consider service congestion. The firstmodel addresses the issue of the location of the least number of single--servercenters such that all the population is served within a standard distance,and nobody stands in line for a time longer than a given time--limit, or withmore than a predetermined number of other clients. We then formulateseveral maximal coverage models, with one or more servers per service center.A new heuristic is developed to solve the models and tested in a 30--nodesnetwork.

Location models in the public sector

The past four decades have witnessed an explosive growth in the field of networkbased facilitylocation modeling. This is not at all surprising since location policy is one of the mostprofitable areas of applied systems analysis in regional science and ample theoretical andapplied challenges are offered. Location-allocation models seek the location of facilitiesand/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or severalobjectives generally related to the efficiency of the system or to the allocation of resources.This paper concerns the location of facilities or services in discrete space or networks, thatare related to the public sector, such as emergency services (ambulances, fire stations, andpolice units), school systems and postal facilities. The paper is structured as follows: first,we will focus on public facility location models that use some type of coverage criterion,with special emphasis in emergency services. The second section will examine models based onthe P-Median problem and some of the issues faced by planners when implementing thisformulation in real world locational decisions. Finally, the last section will examine newtrends in public sector facility location modeling.

Surviving in a competitive spatial market: The threshold capture model

Most facility location decision models ignore the fact that for a facility to survive it needs a minimum demand level to cover costs. In this paper we present a decision model for a firm thatwishes to enter a spatial market where there are several competitors already located. This market is such that for each outlet there is a demand threshold level that has to be achievedin order to survive. The firm wishes to know where to locate itsoutlets so as to maximize its market share taking into account the threshold level. It may happen that due to this new entrance, some competitors will not be able to meet the threshold and therefore will disappear. A formulation is presented together with a heuristic solution method and computational experience.

Spatial market expansion through mergers

In this paper we present a model that studies firm mergers in a spatial setting. A new model is formulated that addresses the issue of finding the number of branches that have to be eliminated by a firm after merging with another one, in order to maximize profits. The model is then applied to an example of bank mergers in the city of Barcelona. Finally, a variant of the formulation that introduces competition is presented together with some conclusions.