AGRICULTURAL BIRD PROBLEMS IN THE SOUTHEAST

Our chairman has wisely asked that we not spend all of our time here telling each other about our bird problems. In the Southeast, our difficulties with blackbirds are based upon the same bird habits that cause trouble elsewhere: they flock, they roost and they eat, generally taking advantage of the readily available handouts that today's agricul¬tural practices provide. Those of us on the receiving end of these de¬predations of course think that damage in our own particular area must be far the worst, anywhere. Because of the location of our meeting place today, perhaps it is worthwhile to point out that a report prepared by our Bureau's Washington office this year outlined the problem of blackbird damage to corn in the Middle Atlantic States, the Great Lakes Region and in Florida, and then followed with this statement--"An equally serious problem occurs in rice and grain sorghum fields of Arkansas, Mississippi, Texas and Louisiana." The report also men¬tions that the largest winter concentrations of blackbirds are found in the lower Mississippi Valley. Our 1963-64 blackbird-starling survey showed 43 principal roosts totaling approximately 100 million of these birds in Virginia, the Carolinas, Georgia, Alabama, Tennessee and Kentucky. We have our own birds during the summer plus the "tourist" birds from up here and elsewhere during the winter, and all of these birds must eat, so suffice it to say that we, too, have some bird problems in the Southeast. I'm sure you're more interested in what we're doing about them. To keep this in perspective also, please bear in mind that against the magnitude of these problems, our blackbird control research staff at Gainesville consists of 3 biologists, 1 biochemist and one technician. And unfortunately, none of us happens to be a miracle worker. I think, though, we have made great progress toward solving the bird problems in the Southeast for the man-hours that have been expended in this re¬search. My only suggestion to those who are impatient about not having more answers is that they examine the budget that has been set up for this work. Only then could we intelligently discuss what might be expected as a reasonable rate of research progress. When I think about what we have accomplished in a short span of time, with very small expenditure, I can assure you that I am very proud of our small research crew at Gainesville--and I say this quite sincerely. At the Gainesville station, we work under two general research approaches to the bird damage problem. These projects have been assigned to us. The first is research on management of birds, particularly blackbirds and starlings destructive to crops or in feedlots, and, secondly, the development and the adaptation of those chemical compounds found to be toxic to birds but relatively safe to mammals. These approaches both require laboratory and field work that is further subdivided into several specific research projects. Without describing the details of these now, I want to mention some of our recent results. From the results, I'm sure you will gather the general objectives and some of the procedures used.

Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms. This work is organized as follows: Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP. Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP. Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.

Resource management in location aware cognitive radio networks

Dynamic spectrum access (DSA) aims at utilizing spectral opportunities both in time and frequency domains at any given location, which arise due to variations in spectrum usage. Recently, Cognitive radios (CRs) have been proposed as a means of implementing DSA. In this work we focus on the aspect of resource management in overlaid CRNs. We formulate resource allocation strategies for cognitive radio networks (CRNs) as mathematical optimization problems. Specifically, we focus on two key problems in resource management: Sum Rate Maximization and Maximization of Number of Admitted Users. Since both the above mentioned problems are NP hard due to presence of binary assignment variables, we propose novel graph based algorithms to optimally solve these problems. Further, we analyze the impact of location awareness on network performance of CRNs by considering three cases: Full location Aware, Partial location Aware and Non location Aware. Our results clearly show that location awareness has significant impact on performance of overlaid CRNs and leads to increase in spectrum utilization effciency.

Montana Talc; Problems in Physical Properties

General information on talc, including foreign and United States occurrences, origin, and uses is covered. Montana deposits are discussed in greater detail as to location, geology, mineralogy, and mining. Studies of talc by petrographic and x-ray methods and an experiment to determine the porosity are described and discussed.

Weighted Majoritarian Rules for the Location of Multiple Public Facilities

We consider collective decision problems given by a profile of single-peaked preferences defined over the real line and a set of pure public facilities to be located on the line. In this context, Bochet and Gordon (2012) provide a large class of priority rules based on efficiency, object-population monotonicity and sovereignty. Each such rule is described by a fixed priority ordering among interest groups. We show that any priority rule which treats agents symmetrically — anonymity — respects some form of coherence across collective decision problems — reinforcement — and only depends on peak information — peakonly — is a weighted majoritarian rule. Each such rule defines priorities based on the relative size of the interest groups and specific weights attached to locations. We give an explicit account of the richness of this class of rules.

Trends in incidence of oesophageal and gastric cancer according to morphology and anatomical location, in Switzerland 1982-2011.

QUESTION UNDER STUDY/PRINCIPLES This study aimed to evaluate trends in the incidence of oesophageal and gastric cancer by anatomical location and histology using nationally representative Swiss data. METHODS We included all oesophageal and gastric cancers recorded in 10 Swiss population-based cancer registries 1982-2011. We calculated age-standardised incidence rates (ASIRs) per 100 000 person-years (PY) (European standard) for both cancer sites stratified by sex, language region (German, French-Italian), morphology and anatomical location. To assess time trends, we estimated annual percentage changes (APCs) with 95% confidence intervals (95% CIs). RESULTS ASIR of oesophageal adenocarcinoma increased in both sexes and language regions (p <0.001). The steepest increase occurred in males of the German-speaking region (APC 6.8%, 95% CI 5.8-7.8) with ASIRs of 0.8 per 100,000 PY in 1982-1987 and 3.9 per 100.000 PY in 2007-2011. Incidence of oesophageal squamous cell carcinoma decreased significantly in males of both language regions by around -1.5% per year. In contrast, a slight but significant increase (APC 1.4%, 95% CI 0.3-2.4]) of oesophageal squamous cell carcinoma was observed in females of the German-speaking region. We observed stable rates for cancer of the gastric cardia. The incidence of noncardia gastric cancer decreased substantially in both sexes and language regions (p <0.001). CONCLUSION In Switzerland, the incidence of oesophageal adenocarcinoma has risen whereas incidence of noncardia gastric cancer has decreased substantially as observed in other developed countries.

Pitfalls of location choice analysis : the finished goods producer versus the intermediate goods producer

In literature related to firm location choice, estimation equations are derived from the model of finished goods producers, but producer types are generally not considered. Research presented in this paper shows that the use of equations derived from such models against intermediate goods producers results in several problems.

How should the sustainability of the location of dry ports be measured? A proposed methodology using Bayesian networks and multi-criteria decision analysis

The global economic structure, with its decentralized production and the consequent increase in freight traffic all over the world, creates considerable problems and challenges for the freight transport sector. This situation has led shipping to become the most suitable and cheapest way to transport goods. Thus, ports are configured as nodes with critical importance in the logistics supply chain as a link between two transport systems, sea and land. Increase in activity at seaports is producing three undesirable effects: increasing road congestion, lack of open space in port installations and a significant environmental impact on seaports. These adverse effects can be mitigated by moving part of the activity inland. Implementation of dry ports is a possible solution and would also provide an opportunity to strengthen intermodal solutions as part of an integrated and more sustainable transport chain, acting as a link between road and railway networks. In this sense, implementation of dry ports allows the separation of the links of the transport chain, thus facilitating the shortest possible routes for the lowest capacity and most polluting means of transport. Thus, the decision of where to locate a dry port demands a thorough analysis of the whole logistics supply chain, with the objective of transferring the largest volume of goods possible from road to more energy efficient means of transport, like rail or short-sea shipping, that are less harmful to the environment. However, the decision of where to locate a dry port must also ensure the sustainability of the site. Thus, the main goal of this article is to research the variables influencing the sustainability of dry port location and how this sustainability can be evaluated. With this objective, in this paper we present a methodology for assessing the sustainability of locations by the use of Multi-Criteria Decision Analysis (MCDA) and Bayesian Networks (BNs). MCDA is used as a way to establish a scoring, whilst BNs were chosen to eliminate arbitrariness in setting the weightings using a technique that allows us to prioritize each variable according to the relationships established in the set of variables. In order to determine the relationships between all the variables involved in the decision, giving us the importance of each factor and variable, we built a K2 BN algorithm. To obtain the scores of each variable, we used a complete cartography analysed by ArcGIS. Recognising that setting the most appropriate location to place a dry port is a geographical multidisciplinary problem, with significant economic, social and environmental implications, we consider 41 variables (grouped into 17 factors) which respond to this need. As a case of study, the sustainability of all of the 10 existing dry ports in Spain has been evaluated. In this set of logistics platforms, we found that the most important variables for achieving sustainability are those related to environmental protection, so the sustainability of the locations requires a great respect for the natural environment and the urban environment in which they are framed.

Location of bioelectricity plants in the Madrid Community based on triticale crop: a multicriteria methodology

This paper presents a work whose objective is, first, to quantify the potential of the triticale biomass existing in each of the agricultural regions in the Madrid Community through a crop simulation model based on regression techniques and multiple correlation. Second, a methodology for defining which area has the best conditions for the installation of electricity plants from biomass has been described and applied. The study used a methodology based on compromise programming in a discrete multicriteria decision method (MDM) context. To make a ranking, the following criteria were taken into account: biomass potential, electric power infrastructure, road networks, protected spaces, and urban nuclei surfaces. The results indicate that, in the case of the Madrid Community, the Campiña region is the most suitable for setting up plants powered by biomass. A minimum of 17,339.9 tons of triticale will be needed to satisfy the requirements of a 2.2 MW power plant. The minimum range of action for obtaining the biomass necessary in Campiña region would be 6.6 km around the municipality of Algete, based on Geographic Information Systems. The total biomass which could be made available in considering this range in this region would be 18,430.68 t.

The Enlarged European Union and its Eastern Neighbours: Problems and Solutions. OSW Point of View, October 2003

The EU enlargement is scheduled to take place in 2004. After this date, it should be a priority for the EU to develop a coherent and comprehensive policy towards its nearest neighbours, i.e. countries bordering the Member States, which cannot join the EU in the nearest future due to their location or weaknesses of their political and economic systems. There are at least three reasons for this. Firstly, good relations with neighbours will underlie the broadly understood security of the Community. Relations with the nearest neighbours will determine both military security of the EU (including the combating of terrorism) and its ability to prevent other threats such as illegal migration, smuggling, etc. Secondly, good economic relations with neighbours may contribute to the Member States' economic growth in the longer term. And finally, the EU's ability to develop an effective and adequate policy towards its nearest neighbours will demonstrate its competence as a subject of international politics. In other words, the EU will not be recognised as a reliable political player in the global scene until it develops an effective strategy for its neighbourhood.

The preparation of reach-to-grasp movements in adults, children, and children with movement problems

This study explored the use of advance information in the control of reach-to-grasp movements. The paradigm required participants to reach and grasp illuminated blocks with their right hand. Four target blocks were positioned on a table surface, two each side of the mid-saggital plane. In the complete precue condition, advance information precisely specified target location. In the partial precue condition, advance information indicated target location relative to the midsaggital plane (left or right). In the null condition, the advance information was entirely ambiguous. Participants produced fastest responses in the complete precue condition, intermediate response times in the partial condition, and the slowest responses in the null condition. This result was observed in adults and four groups of children including a group aged 4-6 years. In contrast, children with Developmental Coordination Disorder (DCD, n = 11, aged 7-13 years) showed no advantage of partial precueing. Movement duration was determined by target location but was unaffected by precue condition. Movement duration was a clear function of age apart from children in the DCD group who showed equivalent movement times to those of the youngest children. These findings provide important insights into the control of reach-to-grasp movements and highlight that partial cues are exploited by children as young as 4 years but are not used in situations of abnormal development.

The problems of corruption in Post-Soviet Ukraine's Higher Education sector

This article provide an in-depth examination into how the existence of "informal" work practices, in a particular location, namely, the higher education system in Ukraine impacts the everyday lives of a specific population group, namely, students. The article provides a comprehensive overview of corruption in post-Soviet education systems, suggesting some historical and contemporary reasons for its current scale. In particular, the article focuses on students' experiences of corruption, first, exploring the difficulties that many individuals face when trying to gain access to the higher education system, and second, outlining students' experiences while progressing through the course. The article's concluding section examines the wider outcome of these processes on Ukrainian society as a whole as well as the impacts on individual students.

Coverage versus supply cost in facility location:physics of frustrated spin systems

A comprehensive coverage is crucial for communication, supply, and transportation networks, yet it is limited by the requirement of extensive infrastructure and heavy energy consumption. Here, we draw an analogy between spins in antiferromagnet and outlets in supply networks, and apply techniques from the studies of disordered systems to elucidate the effects of balancing the coverage and supply costs on the network behavior. A readily applicable, coverage optimization algorithm is derived. Simulation results show that magnetized and antiferromagnetic domains emerge and coexist to balance the need for coverage and energy saving. The scaling of parameters with system size agrees with the continuum approximation in two dimensions and the tree approximation in random graphs. Due to frustration caused by the competition between coverage and supply cost, a transition between easy and hard computation regimes is observed. We further suggest a local expansion approach to greatly simplify the message updates which shed light on simplifications in other problems. © 2014 American Physical Society.

It's the way you check-in:identifying users in location-based social networks

In recent years, the rapid spread of smartphones has led to the increasing popularity of Location-Based Social Networks (LBSNs). Although a number of research studies and articles in the press have shown the dangers of exposing personal location data, the inherent nature of LBSNs encourages users to publish information about their current location (i.e., their check-ins). The same is true for the majority of the most popular social networking websites, which offer the possibility of associating the current location of users to their posts and photos. Moreover, some LBSNs, such as Foursquare, let users tag their friends in their check-ins, thus potentially releasing location information of individuals that have no control over the published data. This raises additional privacy concerns for the management of location information in LBSNs. In this paper we propose and evaluate a series of techniques for the identification of users from their check-in data. More specifically, we first present two strategies according to which users are characterized by the spatio-temporal trajectory emerging from their check-ins over time and the frequency of visit to specific locations, respectively. In addition to these approaches, we also propose a hybrid strategy that is able to exploit both types of information. It is worth noting that these techniques can be applied to a more general class of problems where locations and social links of individuals are available in a given dataset. We evaluate our techniques by means of three real-world LBSNs datasets, demonstrating that a very limited amount of data points is sufficient to identify a user with a high degree of accuracy. For instance, we show that in some datasets we are able to classify more than 80% of the users correctly.