WorldWideScience

Sample records for facility located nearest

  1. IHS Facility Locator

    Data.gov (United States)

    U.S. Department of Health & Human Services — This map can be used to find an Indian Health Service, Tribal or Urban Indian Health Program facility. This map can be used to: Zoom in to a general location to...

  2. Competitive facility location along a highway

    NARCIS (Netherlands)

    Ahn, H.-K.; Cheng, S.-W.; Cheong, O.; Golin, M.; Oostrum, R. van

    2001-01-01

    We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the

  3. FINDING A RESIDENCE WITH ALL FACILITIES USING NEAREST NEIGHBOR SEARCH

    Directory of Open Access Journals (Sweden)

    K. Padmapriya

    2014-01-01

    Full Text Available Nearest neighbor search is one of the most widely-used techniques and its applications including mobile communication, Geographic information systems, bioinformatics, computer vision and marketing. For example, four friends want to rent an apartment which should be nearer to their working places. Our paper discussed about the problems on finding the most appropriate location among a set of available places. The problem is defined as a top-k query which gives output of k points from a set of available places P along with the conveniences. We proposed algorithms based on R-trees to answer the query exactly. The efficiency of our proposed algorithms is verified through various experiments and found that it is better than existing algorithms use large scale real datasets.

  4. [Prediction of protein subcellular locations by ensemble of improved K-nearest neighbor].

    Science.gov (United States)

    Xue, Wei; Wang, Xiongfei; Zhao, Nan; Yang, Rongli; Hong, Xiaoyu

    2017-04-25

    Adaboost algorithm with improved K-nearest neighbor classifiers is proposed to predict protein subcellular locations. Improved K-nearest neighbor classifier uses three sequence feature vectors including amino acid composition, dipeptide and pseudo amino acid composition of protein sequence. K-nearest neighbor uses Blast in classification stage. The overall success rates by the jackknife test on two data sets of CH317 and Gram1253 are 92.4% and 93.1%. Adaboost algorithm with the novel K-nearest neighbor improved by Blast is an effective method for predicting subcellular locations of proteins.

  5. On Constrained Facility Location Problems

    Institute of Scientific and Technical Information of China (English)

    Wei-Lin Li; Peng Zhang; Da-Ming Zhu

    2008-01-01

    Given m facilities each with an opening cost, n demands, and distance between every demand and facility,the Facility Location problem finds a solution which opens some facilities to connect every demand to an opened facility such that the total cost of the solution is minimized. The k-Facility Location problem further requires that the number of opened facilities is at most k, where k is a parameter given in the instance of the problem. We consider the Facility Location problems satisfying that for every demand the ratio of the longest distance to facilities and the shortest distance to facilities is at most w, where w is a predefined constant. Using the local search approach with scaling technique and error control technique, for any arbitrarily small constant ∈ > 0, we give a polynomial-time approximation algorithm for the ω-constrained Facility Location problem with approximation ratio 1 + √ω + 1 + ∈, which significantly improves the previous best known ratio (ω + 1)/α for some 1 ≤α≤ 2, and a polynomial-time approximation algorithm for the ω-constrained κ-Facility Location problem with approximation ratio ω + 1 + ∈. On the aspect of approximation hardness, we prove that unless NP (C) DTIME(nO(loglogn)), the ω-constrained Facility Location problem cannot be approximated within 1 + √ω-1,which slightly improves the previous best known hardness result 1.243 + 0.316 ln(ω - 1). The experimental results on the standard test instances of Facility Location problem show that our algorithm also has good performance in practice.

  6. Reliable Facility Location Problem with Facility Protection.

    Science.gov (United States)

    Tang, Luohao; Zhu, Cheng; Lin, Zaili; Shi, Jianmai; Zhang, Weiming

    2016-01-01

    This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian Relaxation and local search is proposed and is demonstrated to be both effective and efficient based on computational experiments on random numerical examples with 49, 88, 150 and 263 nodes in the network. A real case study for a 100-city network in Hunan province, China, is presented, based on which the properties of the model are discussed and some managerial insights are analyzed.

  7. Mental Health Treatement Facilities Locator

    Data.gov (United States)

    U.S. Department of Health & Human Services — An online resource for locating mental health treatment facilities and programs supported by the Substance Abuse and Mental Health Services Administration (SAMHSA)....

  8. Modeling discrete competitive facility location

    CERN Document Server

    Karakitsiou, Athanasia

    2015-01-01

    This book presents an up-to-date review of modeling and optimization approaches for location problems along with a new bi-level programming methodology which captures the effect of competition of both producers and customers on facility location decisions. While many optimization approaches simplify location problems by assuming decision making in isolation, this monograph focuses on models which take into account the competitive environment in which such decisions are made. New insights in modeling, algorithmic and theoretical possibilities are opened by this approach and new applications are possible. Competition on equal term plus competition between market leader and followers are considered in this study, consequently bi-level optimization methodology is emphasized and further developed. This book provides insights regarding modeling complexity and algorithmic approaches to discrete competitive location problems. In traditional location modeling, assignment of customer demands to supply sources are made ...

  9. Uncapacitated facility location problems: contributions

    Directory of Open Access Journals (Sweden)

    Galvão Roberto Diéguez

    2004-01-01

    Full Text Available The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a general formulation of uncapacitated location problems; the study of dynamic location models; covering and hierarchical location problems; queuing-based probabilistic location models. The contributions encompass theoretical developments, computational algorithms and practical applications. All work took place in an academic environment, with the invaluable collaboration of colleagues (both in Brazil and abroad and research students at COPPE. Each section in the paper is dedicated to a topic that involves a personal contribution. Every one of them is placed within the context of the existing literature.

  10. Predicting Audience Location on the Basis of the k-Nearest Neighbor Multilabel Classification

    Directory of Open Access Journals (Sweden)

    Haitao Wu

    2014-01-01

    Full Text Available Understanding audience location information in online social networks is important in designing recommendation systems, improving information dissemination, and so on. In this paper, we focus on predicting the location distribution of audiences on YouTube. And we transform this problem to a multilabel classification problem, while we find there exist three problems when the classical k-nearest neighbor based algorithm for multilabel classification (ML-kNN is used to predict location distribution. Firstly, the feature weights are not considered in measuring the similarity degree. Secondly, it consumes considerable computing time in finding similar items by traversing all the training set. Thirdly, the goal of ML-kNN is to find relevant labels for every sample which is different from audience location prediction. To solve these problems, we propose the methods of measuring similarity based on weight, quickly finding similar items, and ranking a specific number of labels. On the basis of these methods and the ML-kNN, the k-nearest neighbor based model for audience location prediction (AL-kNN is proposed for predicting audience location. The experiments based on massive YouTube data show that the proposed model can more accurately predict the location of YouTube video audience than the ML-kNN, MLNB, and Rank-SVM methods.

  11. Evaluating a k-nearest neighbours-based classifier for locating faulty areas in power systems

    Directory of Open Access Journals (Sweden)

    Juan José Mora Flórez

    2010-05-01

    Full Text Available This paper reports a strategy for identifying and locating faults in a power distribution system. The strategy was based on the K-nearest neighbours technique. This technique simply helps to estimate a distance from the features used for describing a particu-lar fault being classified to the faults presented during the training stage. If new data is presented to the proposed fault locator, it is classified according to the nearest example recovered. A characterisation of the voltage and current measurements obtained at one single line end is also presented in this document for assigning the area in the case of a fault in a power system. The pro-posed strategy was tested in a real power distribution system, average 93% confidence indexes being obtained which gives a good indicator of the proposal’s high performance. The results showed how a fault could be located by using features obtained from voltage and current, improving utility response and thereby improving system continuity indexes in power distribution sys-tems.

  12. Oil Storage Facilities - Storage Tank Locations

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — A Storage Tank Location is a DEP primary facility type, and its sole sub-facility is the storage tank itself. Storage tanks are aboveground or underground, and are...

  13. Recycling Facilities - Land Recycling Cleanup Locations

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — Land Recycling Cleanup Location Land Recycling Cleanup Locations (LRCL) are divided into one or more sub-facilities categorized as media: Air, Contained Release or...

  14. Recycling Facilities - Land Recycling Cleanup Locations

    Data.gov (United States)

    NSGIC Education | GIS Inventory — Land Recycling Cleanup Location Land Recycling Cleanup Locations (LRCL) are divided into one or more sub-facilities categorized as media: Air, Contained Release or...

  15. Predicting eukaryotic protein subcellular location by fusing optimized evidence-theoretic K-Nearest Neighbor classifiers.

    Science.gov (United States)

    Chou, Kuo-Chen; Shen, Hong-Bin

    2006-08-01

    Facing the explosion of newly generated protein sequences in the post genomic era, we are challenged to develop an automated method for fast and reliably annotating their subcellular locations. Knowledge of subcellular locations of proteins can provide useful hints for revealing their functions and understanding how they interact with each other in cellular networking. Unfortunately, it is both expensive and time-consuming to determine the localization of an uncharacterized protein in a living cell purely based on experiments. To tackle the challenge, a novel hybridization classifier was developed by fusing many basic individual classifiers through a voting system. The "engine" of these basic classifiers was operated by the OET-KNN (Optimized Evidence-Theoretic K-Nearest Neighbor) rule. As a demonstration, predictions were performed with the fusion classifier for proteins among the following 16 localizations: (1) cell wall, (2) centriole, (3) chloroplast, (4) cyanelle, (5) cytoplasm, (6) cytoskeleton, (7) endoplasmic reticulum, (8) extracell, (9) Golgi apparatus, (10) lysosome, (11) mitochondria, (12) nucleus, (13) peroxisome, (14) plasma membrane, (15) plastid, and (16) vacuole. To get rid of redundancy and homology bias, none of the proteins investigated here had >/=25% sequence identity to any other in a same subcellular location. The overall success rates thus obtained via the jack-knife cross-validation test and independent dataset test were 81.6% and 83.7%, respectively, which were 46 approximately 63% higher than those performed by the other existing methods on the same benchmark datasets. Also, it is clearly elucidated that the overwhelmingly high success rates obtained by the fusion classifier is by no means a trivial utilization of the GO annotations as prone to be misinterpreted because there is a huge number of proteins with given accession numbers and the corresponding GO numbers, but their subcellular locations are still unknown, and that the

  16. Substance Abuse Treatment Facilities Locator

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Substance Abuse and Mental Health Services Administration (SAMHSA) provides on-line resource for locating drug and alcohol abuse treatment programs. The...

  17. Location - Managed Facility - St. Paul District (MVP)

    Data.gov (United States)

    Army Corps of Engineers, Department of the Army, Department of Defense — St. Paul District - US Army Corps of Engineers Managed Facility locations. District headquarters, Natural Resource, Recreation, Lock and Dam, and Regulatory offices...

  18. A Decision Model for Locating Controversial Facilities

    Science.gov (United States)

    Mumphrey, Anthony J.; And Others

    1971-01-01

    Locating controversial public facilities, such as highways or airports, that generate significant public opposition requires a more sophisticated methodology than the traditional least cost" procedures for minimizing physical costs. Two models--a short-run political placation" model and a long-run welfare distribution" model--evaluate the…

  19. Facility Location with Double-peaked Preferences

    DEFF Research Database (Denmark)

    Filos-Ratsikas, Aris; Li, Minming; Zhang, Jie

    2015-01-01

    We study the problem of locating a single facility on a real line based on the reports of self-interested agents, when agents have double-peaked preferences, with the peaks being on opposite sides of their locations. We observe that double-peaked preferences capture real-life scenarios and thus...... complement the well-studied notion of single-peaked preferences. We mainly focus on the case where peaks are equidistant from the agents’ locations and discuss how our results extend to more general settings. We show that most of the results for single-peaked preferences do not directly apply to this setting...

  20. Optimization of preventive health care facility locations

    Directory of Open Access Journals (Sweden)

    McGregor S

    2010-03-01

    Full Text Available Abstract Background Preventive health care programs can save lives and contribute to a better quality of life by diagnosing serious medical conditions early. The Preventive Health Care Facility Location (PHCFL problem is to identify optimal locations for preventive health care facilities so as to maximize participation. When identifying locations for preventive health care facilities, we need to consider the characteristics of the preventive health care services. First, people should have more flexibility to select service locations. Second, each preventive health care facility needs to have a minimum number of clients in order to retain accreditation. Results This paper presents a new methodology for solving the PHCFL problem. In order to capture the characteristics of preventive health care services, we define a new accessibility measurement that combines the two-step floating catchment area method, distance factor, and the Huff-based competitive model. We assume that the accessibility of preventive health care services is a major determinant for participation in the service. Based on the new accessibility measurement, the PHCFL problem is formalized as a bi-objective model based on efficiency and coverage. The bi-objective model is solved using the Interchange algorithm. In order to accelerate the solving process, we implement the Interchange algorithm by building two new data structures, which captures the spatial structure of the PHCFL problem. In addition, in order to measure the spatial barrier between clients and preventive health care facilities accurately and dynamically, this paper estimates travelling distance and travelling time by calling the Google Maps Application Programming Interface (API. Conclusions Experiments based on a real application for the Alberta breast cancer screening program show that our work can increase the accessibility of breast cancer screening services in the province.

  1. Location selection criteria for supplementary motorway facilities

    Directory of Open Access Journals (Sweden)

    Malobabić Radomir

    2002-01-01

    Full Text Available Supplementary contents along motorways are rather important facilities for a safe and secure functioning of a substantial part of the road transport system. In the paper, it has been stressed that our practice has not dealt with this problem satisfactorily throughout the motorways design process and especially in the realization phase. Therefore, the solving of this major issue ought to be approached systematically and planning oriented so as to achieve an optimal effect of supplementary contents in the motorways’ exploitation. The role of these facilities is multifold. Some relate to a safer road functioning and some enable a more comfortable and secure traveling. To make them work as a system it is indispensable to set up location selection criteria and rules for the complementary facilities Respecting the adequate rhythm and function dominance is exceptionally important as well as establishing the traffic safety and applying high ecological standards.

  2. Scaling and entropy in p-median facility location along a line

    Science.gov (United States)

    Gastner, Michael T.

    2011-09-01

    The p-median problem is a common model for optimal facility location. The task is to place p facilities (e.g., warehouses or schools) in a heterogeneously populated space such that the average distance from a person's home to the nearest facility is minimized. Here we study the special case where the population lives along a line (e.g., a road or a river). If facilities are optimally placed, the length of the line segment served by a facility is inversely proportional to the square root of the population density. This scaling law is derived analytically and confirmed for concrete numerical examples of three US interstate highways and the Mississippi River. If facility locations are permitted to deviate from the optimum, the number of possible solutions increases dramatically. Using Monte Carlo simulations, we compute how scaling is affected by an increase in the average distance to the nearest facility. We find that the scaling exponents change and are most sensitive near the optimum facility distribution.

  3. 7 CFR 1738.12 - Location of facilities.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 11 2010-01-01 2010-01-01 false Location of facilities. 1738.12 Section 1738.12... Location of facilities. RUS will make broadband loans for facilities which RUS determines are necessary to... facilities financed with loan funds to be located outside of eligible rural communities. ...

  4. 30 CFR 71.401 - Location of facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Location of facilities. 71.401 Section 71.401... Location of facilities. Bathhouses, change rooms, and sanitary flush toilet facilities shall be in a location convenient for the use of the miners. Where these facilities are designed to serve more than one...

  5. 75 FR 19555 - NARA Facility Locations and Hours

    Science.gov (United States)

    2010-04-15

    ..., and 1280 [FDMS Docket NARA-10-0002] RIN 3095-AB66 NARA Facility Locations and Hours AGENCY: National... Regional Records Service Office, and the addition of facility information for the locations of two NARA... facility added. * * * * * PART 1253--LOCATION OF RECORDS AND HOURS OF USE 0 3. The authority citation for...

  6. 30 CFR 75.1712-2 - Location of surface facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Location of surface facilities. 75.1712-2... SAFETY AND HEALTH MANDATORY SAFETY STANDARDS-UNDERGROUND COAL MINES Miscellaneous § 75.1712-2 Location of surface facilities. Bathhouses, change rooms, and sanitary toilet facilities shall be in a location...

  7. 10 CFR 75.6 - Facility and location reporting.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 2 2010-01-01 2010-01-01 false Facility and location reporting. 75.6 Section 75.6 Energy... AGREEMENT General Provisions § 75.6 Facility and location reporting. (a) Except where otherwise specified... that its facility or location is required to report under the Safeguards Agreement shall make its...

  8. A Review of the Discrete Facility Location Problem

    Institute of Scientific and Technical Information of China (English)

    WANG Fei; XU Yu; LI Yi-xue

    2006-01-01

    In this paper we attempt to classify discrete facility location problems in the right perspective and propose discrete facility location problems that include: median problems, covering problems, center problems, multi-commodities problems and dynamic problems on the basis of former research by other scholars. We consider vehicle routing location problems, inventory-location problems and hub problems as a recent research field of discrete facility location problems according to literature from the last 10 years.

  9. 7 CFR 1735.91 - Location of facilities.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 11 2010-01-01 2010-01-01 false Location of facilities. 1735.91 Section 1735.91 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF... All Acquisitions and Mergers § 1735.91 Location of facilities. Telephone facilities to be acquired...

  10. The solution of location problems with certain existing facility structures

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1983-01-01

    It is known that in the Euclidean distance case, the optimal minisum location of a new facility in relation to four existing facilities is at the intersection of the two lines joining two pairs of the facilities. The authors extend this concept to minisum problems having any even number of existing...... facilities and characterized by generalized distance norms...

  11. A localization property for facility location problems with arbitrary norms

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1988-01-01

    In an earlier article (1983), the authors showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines...... intersect at a single point. In this article the authors extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities...

  12. A localization property for facility location problems with arbitrary norms

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1988-01-01

    In an earlier article (1983), the authors showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines...... intersect at a single point. In this article the authors extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities...

  13. Spatial interaction models facility location using game theory

    CERN Document Server

    D'Amato, Egidio; Pardalos, Panos

    2017-01-01

    Facility location theory develops the idea of locating one or more facilities by optimizing suitable criteria such as minimizing transportation cost, or capturing the largest market share. The contributions in this book focus an approach to facility location theory through game theoretical tools highlighting situations where a location decision is faced by several decision makers and leading to a game theoretical framework in non-cooperative and cooperative methods. Models and methods regarding the facility location via game theory are explored and applications are illustrated through economics, engineering, and physics. Mathematicians, engineers, economists and computer scientists working in theory, applications and computational aspects of facility location problems using game theory will find this book useful.

  14. The solution of location problems with certain existing facility structures

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1983-01-01

    It is known that in the Euclidean distance case, the optimal minisum location of a new facility in relation to four existing facilities is at the intersection of the two lines joining two pairs of the facilities. The authors extend this concept to minisum problems having any even number of existi...

  15. 14 CFR 21.43 - Location of manufacturing facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Location of manufacturing facilities. 21.43... CERTIFICATION PROCEDURES FOR PRODUCTS AND PARTS Type Certificates § 21.43 Location of manufacturing facilities. Except as provided in § 21.29, the Administrator does not issue a type certificate if the...

  16. 47 CFR 3.42 - Location of processing facility.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Location of processing facility. 3.42 Section 3.42 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL AUTHORIZATION AND ADMINISTRATION OF... Location of processing facility. Settlement of maritime mobile and maritime mobile-satellite service...

  17. Capacitated Dynamic Facility Location Problem Based on Tabu Search Algorithm

    Institute of Scientific and Technical Information of China (English)

    KUANG Yi-jun; ZHU Ke-jun

    2007-01-01

    Facility location problem is a kind of NP-Hard combinational problem. Considering ever-changing demand sites, demand quantity and releasing cost, we formulate a model combining tabu search and FCM (fuzzy clustering method) to solve the eapacitated dynamic facility location problem. Some results are achieved and they show that the proposed method is effective.

  18. Intertemporal and Spatial Location of Disposal Facilities

    NARCIS (Netherlands)

    Andre, F.J.; Velasco, F.; Gonzalez, L.

    2004-01-01

    Optimal capacity and location of a sequence of land.lls are studied, and the interactions between both decisions are pointed out.The decision capacity has some spatial implications, because it a.ects the feasible region for the rest of land.lls, and some temporal implications, because the capacity

  19. Intertemporal and spatial location of disposal facilities

    OpenAIRE

    Andre, F.J.; Velasco, F; Gonzalez, L.

    2009-01-01

    The optimal capacity and location of a sequence of landfills are studied, and the interactions between both decisions are pointed out. Deciding the capacity of a landfill has some spatial implications, because it effects the feasible region for the rest of the landfills, and some temporal implications because the capacity determines the lifetime of the landfill and hence the instant of time where the next landfills will need to be constructed. Some general mathematical properties of the solut...

  20. 位置隐私保护下的连续最近邻查询%Continous Nearest-Neighbor Query in Location Privacy Preserving

    Institute of Scientific and Technical Information of China (English)

    王勇; 董一鸿; 钱江波; 陈华辉

    2016-01-01

    已有的位置隐私保护下的连续最近邻查询往往采用snapshot方式进行,导致较高的中央处理器开销。为此,研究了基于位置隐私的连续最近邻查询,提出了基于重用技术的位置隐私保护的连续最近邻查询算法。该算法利用相邻时刻查询结果集的相似性来减少计算成本,从而实现答案集的快速更新,可大大加快系统响应时间。实验结果表明了该算法的有效性。%Enjoying the location-based service ( LBS ) , the mobile subscribers may threaten the disclo-sure of location privacy. To protect location privacy, an effective method for location privacy preserving was proposed to cloak the user's exact coordinates into a spatial region and turn the location-based query into region-based query. Existing continuous nearest-neighbor query algorithms with privacy-aware are based on snapshot, which incur higher central processing unit ( CPU) cost. The location privacy-based continuous nearest-neighbor query was studied and an algorithm named reusing-based location privacy-preserving continuous nearest-neighbor query ( RLPCNN) which is based on reusing technique query up-dating was proposed. The algorithm can reduce the cost of computation by using the similarity between the two adjacent time and make the answer set updated quickly, which can quicken the response time markedly. The experiments show that the algorithm is effective and efficient.

  1. Congestion Service Facilities Location Problem with Promise of Response Time

    Directory of Open Access Journals (Sweden)

    Dandan Hu

    2013-01-01

    Full Text Available In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.

  2. Recycling Facilities - Mine Drainage Treatment/Land Recycling Project Locations

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — Mine Drainage Treatment/Land Reclamation Locations are clean-up projects that are working to eliminate some form of abandoned mine. The following sub-facility types...

  3. 14 CFR 21.137 - Location of manufacturing facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Location of manufacturing facilities. 21.137 Section 21.137 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION... manufacturing facilities. The Administrator does not issue a production certificate if the...

  4. Parallel Approximation Algorithms for Facility-Location Problems

    OpenAIRE

    Blelloch, Guy E.; Tangwongsan, Kanat

    2010-01-01

    This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including $\\NC$ and $\\RNC$ algorithms for (metric) facility location, $k$-center, $k$-median, and $k$-means. These problems have received considerable attention during the past decades from the approximation algorithms community, concentrating primarily on improving the approximation guarantees. In this paper, we ask, is it possible to parallelize some of the beautiful results from...

  5. SubChlo: predicting protein subchloroplast locations with pseudo-amino acid composition and the evidence-theoretic K-nearest neighbor (ET-KNN) algorithm.

    Science.gov (United States)

    Du, Pufeng; Cao, Shengjiao; Li, Yanda

    2009-11-21

    The chloroplast is a type of plant specific subcellular organelle. It is of central importance in several biological processes like photosynthesis and amino acid biosynthesis. Thus, understanding the function of chloroplast proteins is of significant value. Since the function of chloroplast proteins correlates with their subchloroplast locations, the knowledge of their subchloroplast locations can be very helpful in understanding their role in the biological processes. In the current paper, by introducing the evidence-theoretic K-nearest neighbor (ET-KNN) algorithm, we developed a method for predicting the protein subchloroplast locations. This is the first algorithm for predicting the protein subchloroplast locations. We have implemented our algorithm as an online service, SubChlo (http://bioinfo.au.tsinghua.edu.cn/subchlo). This service may be useful to the chloroplast proteome research.

  6. 33 CFR 137.65 - Visual inspections of the facility, the real property on which the facility is located, and...

    Science.gov (United States)

    2010-07-01

    ... facility, the real property on which the facility is located, and adjoining properties. 137.65 Section 137... inspections of the facility, the real property on which the facility is located, and adjoining properties. (a... the facility and the real property on which the facility is located, and the improvements at the...

  7. On a rational stopping rule for facilities location algorithms

    DEFF Research Database (Denmark)

    Juel, Henrik

    1984-01-01

    In the multifacility location problem, a number of new facilities are to be located so as to minimize a sum of weighted distances. Love and Yeong (1981) developed a lower bound on the optimal value for use in deciding when to stop an iterative solution procedure. The authors develop a stronger...

  8. On a rational stopping rule for facilities location algorithms

    DEFF Research Database (Denmark)

    Juel, Henrik

    1984-01-01

    In the multifacility location problem, a number of new facilities are to be located so as to minimize a sum of weighted distances. Love and Yeong (1981) developed a lower bound on the optimal value for use in deciding when to stop an iterative solution procedure. The authors develop a stronger...

  9. The p-median Facility Location Problem and Solution Approaches

    Directory of Open Access Journals (Sweden)

    Mehmet BASTI

    2012-05-01

    Full Text Available In today’s globalized and increasingly competitive environment, organizations’ need to implement successful strategies for supply chain management has become indispensable. Transportation costs within the supply chain comprise an important part of the organizations’ expenses. For this reason, the strategic selection of location is an issue that directly affects supply chain performance and costs. At this stage, it becomes very important to apply the latest and the best methods to the facility location problem. The focus of this study is the p-median problem and its solution techniques, one of the location allocation problems aimed at minimizing the costs arising from shipments between facilities and demand points.

  10. On Pure and (approximate) Strong Equilibria of Facility Location Games

    DEFF Research Database (Denmark)

    Hansen, Thomas Dueholm; Telelis, Orestis A.

    2008-01-01

    We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents using the same facility share fairly its installation cost, but every...... networks we prove upper and lower bounds on PoS, while an O(ln n) upper bound implied by previous work is tight for non-metric networks. We also prove a constant upper bound for the SPoA of metric networks when strong equilibria exist. For the weighted game on general networks we prove existence of e...

  11. Uncapacitated facility location problem with self-serving demands

    Directory of Open Access Journals (Sweden)

    E Monabbati

    2013-12-01

    Full Text Available In classical uncapacitated facility location problems (UFLP the goal is to satisfy requirements of some demand points by setting up some servers, among potential facility locations, such that the total cost including service costs and fixed costs are minimized. In this paper a generalization of UFLP is considered in which some demand points, called self-serving, could be served exclusively by a new server at that point. Numerical experiments show that near optimal solutions are achieved by the proposed method.

  12. A competitive facility location in a closed form supply chain

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Mohammadi

    2014-06-01

    Full Text Available This paper studies capacitated facility location problem by considering green management perspectives. The proposed study considers reverse logistic problem as an alternative strategy for facility location in an attempt to take care of environmental characteristics. The resulted problem is formulated as mixed integer programming and it is classified as an NP-Hard problem. Therefore, a Lagrangian relaxation methodology is presented to reduce the complexity of the proposed problem and the solution has been implemented for some instances to examine the performance of the proposed study.

  13. A Probabilistic, Facility-Centric Approach to Lightning Strike Location

    Science.gov (United States)

    Huddleston, Lisa L.; Roeder, William p.; Merceret, Francis J.

    2012-01-01

    A new probabilistic facility-centric approach to lightning strike location has been developed. This process uses the bivariate Gaussian distribution of probability density provided by the current lightning location error ellipse for the most likely location of a lightning stroke and integrates it to determine the probability that the stroke is inside any specified radius of any location, even if that location is not centered on or even with the location error ellipse. This technique is adapted from a method of calculating the probability of debris collisionith spacecraft. Such a technique is important in spaceport processing activities because it allows engineers to quantify the risk of induced current damage to critical electronics due to nearby lightning strokes. This technique was tested extensively and is now in use by space launch organizations at Kennedy Space Center and Cape Canaveral Air Force Station. Future applications could include forensic meteorology.

  14. 76 FR 68170 - Instructions for Implementing Sustainable Locations for Federal Facilities in Accordance With...

    Science.gov (United States)

    2011-11-03

    ... Locations for Federal Facilities in Accordance With Executive Order 13514 AGENCY: Council on Environmental Quality. ACTION: Notice of availability of sustainable locations for Federal facilities implementing... Federal agencies for integrating sustainable facility location decision-making principles into agency...

  15. Site survey for optimum location of Optical Communication Experimental Facility

    Science.gov (United States)

    1968-01-01

    Site survey was made to determine the optimum location for an Optical Communication Experimental Facility /OCEF/ and to recommend several sites, graded according to preference. A site was desired which could perform two-way laser communication with a spacecraft and laser tracking with a minimum of interruption by weather effects.

  16. Linear facility location in three dimensions - Models and solution methods

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik; Schöbel, Anita

    2002-01-01

    We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the line (segment) to a given set of points is minimized. An example is planning the drilling of a mine shaft, with access to ore deposits through...

  17. Linear facility location in three dimensions - Models and solution methods

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik; Schöbel, Anita

    2002-01-01

    We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the line (segment) to a given set of points is minimized. An example is planning the drilling of a mine shaft, with access to ore deposits through...

  18. Fault-tolerant Concave Facility Location Problem with Uniform Requirements

    Institute of Scientific and Technical Information of China (English)

    Xing WANG; Da-Chuan XU; Zheng-Hai HUANG

    2012-01-01

    In this paper,we consider the fault-tolerant concave facility location problem (FTCFL) with uniform requirements. By investigating the structure of the FTCFL,we obtain a modified dual-fitting bifactor approximation algorithm.Combining the scaling and greedy argumentation technique,the approximation factor is proved to be 1.52.

  19. A hybrid nested partitions algorithm for banking facility location problems

    KAUST Repository

    Xia, Li

    2010-07-01

    The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach. © 2010 IEEE.

  20. An Android based location service using GSMCellID and GPS to obtain a graphical guide to the nearest cash machine

    Science.gov (United States)

    Jacobsen, Jurma; Edlich, Stefan

    2009-02-01

    There is a broad range of potential useful mobile location-based applications. One crucial point seems to be to make them available to the public at large. This case illuminates the abilities of Android - the operating system for mobile devices - to fulfill this demand in the mashup way by use of some special geocoding web services and one integrated web service for getting the nearest cash machines data. It shows an exemplary approach for building mobile location-based mashups for everyone: 1. As a basis for reaching as many people as possible the open source Android OS is assumed to spread widely. 2. Everyone also means that the handset has not to be an expensive GPS device. This is realized by re-utilization of the existing GSM infrastructure with the Cell of Origin (COO) method which makes a lookup of the CellID in one of the growing web available CellID databases. Some of these databases are still undocumented and not yet published. Furthermore the Google Maps API for Mobile (GMM) and the open source counterpart OpenCellID are used. The user's current position localization via lookup of the closest cell to which the handset is currently connected to (COO) is not as precise as GPS, but appears to be sufficient for lots of applications. For this reason the GPS user is the most pleased one - for this user the system is fully automated. In contrary there could be some users who doesn't own a GPS cellular. This user should refine his/her location by one click on the map inside of the determined circular region. The users are then shown and guided by a path to the nearest cash machine by integrating Google Maps API with an overlay. Additionally, the GPS user can keep track of him- or herself by getting a frequently updated view via constantly requested precise GPS data for his or her position.

  1. Sufficient conditions for optimal facility locations to coincide

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1980-01-01

    In some cases multifacility location problems may be solved by verifying a few simple inequalities involving the interfacility weights. The authors develop certain inequalities which are sufficient conditions for optimality in some multifacility problems. In the problems considered, distances are...... are represented by a symmetric metric and there are no constraints on the location of the new facilities......In some cases multifacility location problems may be solved by verifying a few simple inequalities involving the interfacility weights. The authors develop certain inequalities which are sufficient conditions for optimality in some multifacility problems. In the problems considered, distances...

  2. A facility location model for socio-environmentally responsible decision-making

    National Research Council Canada - National Science Library

    Ansbro, Dominic; Wang, Qing

    2013-01-01

    .... The model presented considers a network of suppliers, manufacturing facilities, customers, scrap recyclers, general recycling facilities and landfill sites and makes facility location and allocation...

  3. On Pure and (approximate) Strong Equilibria of Facility Location Games

    CERN Document Server

    Hansen, Thomas Dueholm

    2008-01-01

    We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents using the same facility share fairly its installation cost, but every agent pays individually a (weighted) connection cost to the chosen location. We study the Price of Stability (PoS) of pure Nash equilibria and the Price of Anarchy of strong equilibria (SPoA), that generalize pure equilibria by being resilient to coalitional deviations. A special case of recently studied network design games, Facility Location merits separate study as a classic model with numerous applications and individual characteristics: our analysis for unweighted agents on metric networks reveals constant upper and lower bounds for the PoS, while an O(ln n) upper bound implied by previous work is tight for non-metric networks. Strong equilibria do not always exist, even for the unweighted metric case. For this cas...

  4. A Capacitated Facility Location Approach for the Tanker Employment Problem

    Science.gov (United States)

    2005-03-01

    Depot (MD) Vehicle Routing Problem (VRP) ......................................... 14 2.5 Capacitated Facility Location Problem (CFLP) with Sole...service receiver groups. In this sense the problem can be viewed as a multi-depot vehicle routing problem . Anchor points are two stationary points...for future research. 2.4 Multi-Depot (MD) Vehicle Routing Problem (VRP) Another approach to the Tanker Employment Problem is to model it as a VRP

  5. The p-median Facility Location Problem and Solution Approaches

    OpenAIRE

    BASTI, MEHMET

    2012-01-01

    In today’s globalized and increasingly competitive environment, organizations’ need to implement successful strategies for supply chain management has become indispensable. Transportation costs within the supply chain comprise an important part of the organizations’ expenses. For this reason, the strategic selection of location is an issue that directly affects supply chain performance and costs. At this stage, it becomes very important to apply the latest and the best methods to the facility...

  6. 40 CFR 267.18 - What are the standards for selecting the location of my facility?

    Science.gov (United States)

    2010-07-01

    ... the location of my facility? 267.18 Section 267.18 Protection of Environment ENVIRONMENTAL PROTECTION... FACILITIES OPERATING UNDER A STANDARDIZED PERMIT General Facility Standards § 267.18 What are the standards for selecting the location of my facility? (a) You may not locate portions of new facilities where...

  7. Location, use, and locational efficiency of health facilities in a Madras neighbourhood.

    Science.gov (United States)

    Kumaran, V V

    1983-01-01

    The present paper has two related aims: an attempt to measure locational efficiency of health facilities in a Madras neighbourhood - Alandur - through an analysis of use patterns obtained from a questionnaire study, and an application of two significant methods on problems relating to organisation of health services - set covering reasoning and maximal covering location method. Some major conclusions of the two related analyses are: - Generally use declines with distance. However, beyond the eleventh distance zone, the use increases sharply, only to decrease after the fourteenth distance zone, the number of visits attributable to quality services at locations in these distance zones. - Among the variables determining the use patterns, distance is most important, followed by cost of treatment, the quality care, nature of facility and its availability. - Set covering method yielded 5 potential health location sites which proved to be efficient in both population coverage and maximum time distances of five and ten minutes /maximal covering location method/. Two alternative sets identified by set covering method proved to be inefficient on both population and distance counts when maximal covering method was applied.

  8. 14 CFR 145.105 - Change of location, housing, or facilities.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Change of location, housing, or facilities..., Materials, and Data § 145.105 Change of location, housing, or facilities. (a) A certificated repair station... certificated repair station must operate while it is changing its location, housing, or facilities. ...

  9. 7 CFR 1735.13 - Location of facilities and service for nonrural subscribers.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 11 2010-01-01 2010-01-01 false Location of facilities and service for nonrural...-TELECOMMUNICATIONS PROGRAM Loan Purposes and Basic Policies § 1735.13 Location of facilities and service for nonrural... location. (b) To the greatest extent practical, loans are limited to providing telephone facilities that...

  10. 41 CFR 301-74.5 - How should we select a location and a facility?

    Science.gov (United States)

    2010-07-01

    ... location and a facility? 301-74.5 Section 301-74.5 Public Contracts and Property Management Federal Travel... Agency Responsibilities § 301-74.5 How should we select a location and a facility? Site selection is a... location and the specific facility(ies) selected. In determining the best site in the interest of the...

  11. 41 CFR 109-40.112 - Transportation factors in the location of Government facilities.

    Science.gov (United States)

    2010-07-01

    ... in the location of Government facilities. 109-40.112 Section 109-40.112 Public Contracts and Property... 40.1-General Provision § 109-40.112 Transportation factors in the location of Government facilities... prior to the selection of new site locations and during the planning and construction phases in the...

  12. A bicriteria model for locating a semi-desirable facility in

    DEFF Research Database (Denmark)

    Juel, Henrik; Brimberg, Jack

    1998-01-01

    We consider the problem of locating a facility in the plane. Customers want the facility to be close to obtain cheaply the service offered by it. But customers also want the facility to be far away to avoid the pollution from it. We model the situation using two criteria: One is the well-known mi......, with weights adding to one. We outline a method for determining the efficient frontier of facility locations, and provide an illustrative numerical example....

  13. Aggregation and non aggregation techniques for large facility location problems: A survey

    Directory of Open Access Journals (Sweden)

    Irawan Chandra Ade

    2015-01-01

    Full Text Available A facility location problem is concerned with determining the location of some useful facilities in such a way so to fulfil one or a few objective functions and constraints. We survey those problems where, in the presence of a large number of customers, some form of aggregation may be required. In addition, a review on conditional location problems where some (say q facilities already exist in the study area is presented.

  14. A simulation based research on chance constrained programming in robust facility location problem

    Science.gov (United States)

    Kaijun, Leng; Wen, Shi; Guanghua, Song; Lin, Pan

    2017-03-01

    Since facility location decisions problem include long-term character and potential parameter variations, it is important to consider uncertainty in its modeling. This paper examines robust facility location problem considering supply uncertainty, in which we assume the supply of the facility in the actual operation is not equal to the supply initially established, the supply is subject to random fluctuation. The chance constraints are introduced when formulating the robust facility location model to make sure the system operate properly with a certain probability while the supply fluctuates. The chance constraints are approximated safely by using Hoeffding's inequality and the problem is transformed to a general deterministic linear programming. Furthermore, how the facility location cost change with confidence level is investigated through a numerical example. The sensitivity analysis is conducted for important parameters of the model and we get the main factors that affect the facility location cost.

  15. On models for continuous facility location with partial coverage

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik; Körner, Mark-Christoph

    2014-01-01

    This paper presents a new concept of partial coverage distance, where demand points within a given threshold distance of a new facility are covered in the traditional sense, while non-covered demand points are penalized an amount proportional to their distance to the covered region. Two single fa...

  16. Sufficient conditions for optimal facility locations to coincide

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1980-01-01

    In some cases multifacility location problems may be solved by verifying a few simple inequalities involving the interfacility weights. The authors develop certain inequalities which are sufficient conditions for optimality in some multifacility problems. In the problems considered, distances are...

  17. 30 CFR 75.1712-8 - Application for waiver of location requirements for underground sanitary facilities.

    Science.gov (United States)

    2010-07-01

    ... underground sanitary facilities. Applications for waivers of the location requirements of § 75.1712-6 shall be... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Application for waiver of location requirements for underground sanitary facilities. 75.1712-8 Section 75.1712-8 Mineral Resources MINE SAFETY AND...

  18. An approximation algorithm for a facility location problem with stochastic demands

    NARCIS (Netherlands)

    Bumb, A.F.; van Ommeren, Jan C.W.

    2004-01-01

    In this article we propose, for any $\\epsilon>0$, a $2(1+\\epsilon)$-approximation algorithm for a facility location problem with stochastic demands. This problem can be described as follows. There are a number of locations, where facilities may be opened and a number of demand points, where requests

  19. 30 CFR 57.6131 - Location of explosive material storage facilities.

    Science.gov (United States)

    2010-07-01

    ... NONMETAL MINES Explosives Storage-Surface Only § 57.6131 Location of explosive material storage facilities... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Location of explosive material storage facilities. 57.6131 Section 57.6131 Mineral Resources MINE SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF...

  20. 14 CFR 21.309 - Location of or change to manufacturing facilities.

    Science.gov (United States)

    2010-01-01

    ..., and Appliances § 21.309 Location of or change to manufacturing facilities. (a) An applicant may obtain... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Location of or change to manufacturing facilities. 21.309 Section 21.309 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF...

  1. 14 CFR 21.122 - Location of or change to manufacturing facilities.

    Science.gov (United States)

    2010-01-01

    ... § 21.122 Location of or change to manufacturing facilities. (a) An applicant may obtain a production... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Location of or change to manufacturing facilities. 21.122 Section 21.122 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF...

  2. An improved Lagrangian relaxation and dual ascent approach to facility location problems

    DEFF Research Database (Denmark)

    Jörnsten, Kurt; Klose, Andreas

    2016-01-01

    method for optimizing both the semi-Lagrangian dual function as well as its simplified form for the case of a generic discrete facility location problem and apply the method to the uncapacitated facility location problem. Our computational results show that the method generally only requires a very few...

  3. 30 CFR 56.6131 - Location of explosive material storage facilities.

    Science.gov (United States)

    2010-07-01

    ... MINES Explosives Storage § 56.6131 Location of explosive material storage facilities. (a) Storage... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Location of explosive material storage facilities. 56.6131 Section 56.6131 Mineral Resources MINE SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF...

  4. An approximation algorithm for a facility location problem with stochastic demands

    NARCIS (Netherlands)

    Bumb, A.F.; Ommeren, van J.C.W.

    2004-01-01

    In this article we propose, for any $\\epsilon>0$, a $2(1+\\epsilon)$-approximation algorithm for a facility location problem with stochastic demands. This problem can be described as follows. There are a number of locations, where facilities may be opened and a number of demand points, where requests

  5. Cost modelling as decision support when locating manufacturing facilities

    Directory of Open Access Journals (Sweden)

    Christina Windmark

    2016-01-01

    Full Text Available This paper presents a methodology for cost estimation in developing decision supports for production location issues. The purpose is to provide a structured work procedure to be used by practitioners to derive the knowledge needed to make informed decisions on where to locate production. This paper present a special focus on how to integrate cost effects during the decision process. The work procedure and cost models were developed in close collaboration with a group of industrial partners. The result is a structure of cost estimation tools aligned to different steps in the work procedure. The cost models can facilitate both cost estimation for manufacturing a product under new preconditions, including support costs, and cost simulations to analyse the risks of wrong estimations and uncertainties in the input parameters. Future research aims to test the methodology in ongoing transfer projects to further understand difficulties in managing global production systems. In existing models and methods presented in the literature, cost is usually estimated on a too aggregated level to be suitable for decision support regarding production system design. The cost estimation methodology presented here provides new insights on cost driving factors related to the production system.

  6. 34 CFR 395.30 - The location and operation of vending facilities for blind vendors on Federal property.

    Science.gov (United States)

    2010-07-01

    ... 34 Education 2 2010-07-01 2010-07-01 false The location and operation of vending facilities for... § 395.30 The location and operation of vending facilities for blind vendors on Federal property. (a... facilities on any Federal property. (b) Any limitation on the location or operation of a vending facility for...

  7. Comparison of optimized algorithms in facility location allocation problems with different distance measures

    Science.gov (United States)

    Kumar, Rakesh; Chandrawat, Rajesh Kumar; Garg, B. P.; Joshi, Varun

    2017-07-01

    Opening the new firm or branch with desired execution is very relevant to facility location problem. Along the lines to locate the new ambulances and firehouses, the government desires to minimize average response time for emergencies from all residents of cities. So finding the best location is biggest challenge in day to day life. These type of problems were named as facility location problems. A lot of algorithms have been developed to handle these problems. In this paper, we review five algorithms that were applied to facility location problems. The significance of clustering in facility location problems is also presented. First we compare Fuzzy c-means clustering (FCM) algorithm with alternating heuristic (AH) algorithm, then with Particle Swarm Optimization (PSO) algorithms using different type of distance function. The data was clustered with the help of FCM and then we apply median model and min-max problem model on that data. After finding optimized locations using these algorithms we find the distance from optimized location point to the demanded point with different distance techniques and compare the results. At last, we design a general example to validate the feasibility of the five algorithms for facilities location optimization, and authenticate the advantages and drawbacks of them.

  8. [The acquisition of schemata about location of urban facilities in public space].

    Science.gov (United States)

    Kawai, Miho; Murakoshi, Shin

    2003-12-01

    The purpose of this study is to investigate acquisition of schemata about location of urban facilities. Materials were photos of public space, in which one of three urban facilities (a mailbox, a public-telephone, and a coin--operated locker) were removed by photo-retouching software. The task was to choose the most suitable urban facility for each corrected-photo and to locate it at the most suitable position on the photo. Among three participant groups (primary school 3rd grade: n = 153, primary school 5th grade: n = 118, undergraduate: n = 250), undergraduates chose the most suitable urban facility, and their located position was more concentrated. The results suggest that participants acquire the schemata and use them for inference. Although even 3rd grade children have acquired the schema to some extent, the adults have more detailed schemata of urban facilities in public space.

  9. Making regional facility location decisions: the example of Hospital do Oeste Norte, Portugal

    National Research Council Canada - National Science Library

    Gonçalves, Jorge; Antunes Ferreira, J; Condessa, Beatriz

    2014-01-01

    This paper seeks to contribute to the debate on the decision-making process for the location of large public facilities, responding to the growing demand for greater rationality in public investment...

  10. Library Facility Siting and Location Handbook. The Greenwood Library Management Collection.

    Science.gov (United States)

    Koontz, Christine M.

    This handbook is a guide to the complex process of library facility siting and location. It includes relevant research and professionals' siting experiences, as well as actual case studies of closures, openings, mergers, and relocations of library facilities. While the bulk of the volume provides practical information, the work also presents an…

  11. An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem

    DEFF Research Database (Denmark)

    Ho, Sin C.

    2015-01-01

    This paper discusses the Single Source Capacitated Facility Location Problem (SSCFLP) where the problem consists in determining a subset of capacitated facilities to be opened in order to satisfy the customers’ demands such that total costs are minimized. The paper presents an iterated tabu search...

  12. 77 FR 58470 - Irradiation Treatment; Location of Facilities in the Southern United States; Technical Amendment

    Science.gov (United States)

    2012-09-21

    ... Animal and Plant Health Inspection Service 7 CFR Part 319 RIN 0579-AD35 Irradiation Treatment; Location of Facilities in the Southern United States; Technical Amendment AGENCY: Animal and Plant Health... approving treatment facilities for fruits, vegetables, and other articles to prevent the introduction or...

  13. An approximation algorithm for a facility location problem with inventories and stochastic demands

    NARCIS (Netherlands)

    Bumb, A.F.; van Ommeren, Jan C.W.; Megiddo, N.; Xu, Y.; Zhu, B.

    2005-01-01

    In this article we propose, for any $\\varepsilon$ > 0, a 2(1 + $\\varepsilon$)-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The

  14. A MULTI-PRODUCT AND MULTI-PERIOD FACILITY LOCATION MODEL FOR REVERSE LOGISTICS

    OpenAIRE

    Benaissa Mounir; Benabdelhafid Abdellatif

    2010-01-01

    Reverse logistics has become an important entity in the world economy. Businesses increasingly have to cope with product returns, mandated environmental regulations and increasing costs associated with product disposal. This study presents a cost-minimization model for a multi-time-step, multi-type product waste reverse logistics system. The facility location is a central issue of the logistics networks. In this article we are interested in optimizing of the sites facility location for a reve...

  15. An Integrated Intuitionistic Fuzzy Multi Criteria Decision Making Method for Facility Location Selection

    OpenAIRE

    BORAN, Fatih

    2011-01-01

    The facility location selection, which is one of the important activities in strategic planning for a wide range of private and public companies, is a multi-criteria decision making problem including both quantitative and qualitative criteria. Traditional methods for facility location selection can not be effectively handled because information can not be represented by precise information under many conditions. This paper proposes the integration of intuitionistic fuzzy preference relation a...

  16. A reliable facility location design model with site-dependent disruption in the imperfect information context.

    Science.gov (United States)

    Yun, Lifen; Wang, Xifu; Fan, Hongqiang; Li, Xiaopeng

    2017-01-01

    This paper proposes a reliable facility location design model under imperfect information with site-dependent disruptions; i.e., each facility is subject to a unique disruption probability that varies across the space. In the imperfect information contexts, customers adopt a realistic "trial-and-error" strategy to visit facilities; i.e., they visit a number of pre-assigned facilities sequentially until they arrive at the first operational facility or give up looking for the service. This proposed model aims to balance initial facility investment and expected long-term operational cost by finding the optimal facility locations. A nonlinear integer programming model is proposed to describe this problem. We apply a linearization technique to reduce the difficulty of solving the proposed model. A number of problem instances are studied to illustrate the performance of the proposed model. The results indicate that our proposed model can reveal a number of interesting insights into the facility location design with site-dependent disruptions, including the benefit of backup facilities and system robustness against variation of the loss-of-service penalty.

  17. Mathematical Model and Stochastic Multi-Criteria Acceptability Analysis for Facility Location Problem

    Directory of Open Access Journals (Sweden)

    Selahattin Karabay

    2016-06-01

    Full Text Available This paper studies a real-life public sector facility location problem. The problem fundamentally originated from the idea of downsizing the number of service centres. However, opening of new facilities is also considered in case the current facilities fail to fulfil general management demands. Two operation research methodologies are used to solve the problem and the obtained results are compared. First, a mathematical programming model is introduced to determine where the new facilities will be located, and which districts get service from which facilities, as if there were currently no existing facilities. Second, the Stochastic Multi-criteria Acceptability Analysis-TRI (SMAA-TRI method is used to select the best suitable places for service centres among the existing facilities. It is noted that the application of mathematical programming model and SMAA-TRI integration approach on facility location problem is the first study in literature. Compression of outcomes shows that mixed integer linear programming (MILP model tries to open facilities in districts which are favoured by SMAA-TRI solution.

  18. New spatial clustering-based models for optimal urban facility location considering geographical obstacles

    Science.gov (United States)

    Javadi, Maryam; Shahrabi, Jamal

    2014-03-01

    The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which focused on solving facility location problems by performing spatial clustering, have used the Euclidean distance between two points as the dissimilarity function. Natural obstacles, such as mountains and rivers, can have drastic impacts on the distance that needs to be traveled between two geographical locations. While calculating the distance between various supply chain entities (including facilities and demand points), it is necessary to take such obstacles into account to obtain better and more realistic results regarding location-allocation. In this article, new models were presented for location of urban facilities while considering geographical obstacles at the same time. In these models, three new distance functions were proposed. The first function was based on the analysis of shortest path in linear network, which was called SPD function. The other two functions, namely PD and P2D, were based on the algorithms that deal with robot geometry and route-based robot navigation in the presence of obstacles. The models were implemented in ArcGIS Desktop 9.2 software using the visual basic programming language. These models were evaluated using synthetic and real data sets. The overall performance was evaluated based on the sum of distance from demand points to their corresponding facilities. Because of the distance between the demand points and facilities becoming more realistic in the proposed functions, results indicated desired quality of the proposed models in terms of quality of allocating points to centers and logistic cost. Obtained results show promising

  19. The adequacy of the facility and the location of waste collection

    Science.gov (United States)

    Ulrich-Supovec, Marjana

    2017-06-01

    The purpose of this article is to summarise some provisions of the legislation applicable in the territory of the Republic of Slovenia that have to be complied with when selecting facilities intended for waste collection. In addition to equipment, the adequacy of such facility also depends on its site. Not only waste management legislation and environment protection legislation, but also legislation governing water, nature preservation and conservation, natural and cultural heritage and mining legislation stipulate the possibility of using facilities where collectors can sort and store waste before depositing it for subsequent management. This paper presents location examples where various factors exclude the possibility of using facilities as waste collection centres.

  20. Planning of public healthcare facility using a location allocation modelling: A case study

    Science.gov (United States)

    Shariff, S. Sarifah Radiah; Moin, Noor Hasnah; Omar, Mohd

    2014-09-01

    Finding the correct location of any facility and determining the demands which are to be assigned to it is very crucial in public health service. This is to ensure that the public gain maximum benefits. This article analyzes the previous location decisions of public primary healthcare (PHC) facilities in the district of Kuala Langat, Malaysia. With total population of 220214 (in 2010), the PHC in the district is currently served by 28 facilities. The percentages of total population covered (in 2007) within the maximum allowable distance of 3km and 5km are 69.7 percent and 77.8 percent respectively. This is very low compared to the Malaysian National Health Policy of Health for All or 100 percent coverage. The determination of health facility location should be planned carefully to further increase effective primary health service to the nation that is required for economic sustainability.

  1. A hybrid algorithm for stochastic single-source capacitated facility location problem with service level requirements

    Directory of Open Access Journals (Sweden)

    Hosseinali Salemi

    2016-04-01

    Full Text Available Facility location models are observed in many diverse areas such as communication networks, transportation, and distribution systems planning. They play significant role in supply chain and operations management and are one of the main well-known topics in strategic agenda of contemporary manufacturing and service companies accompanied by long-lasting effects. We define a new approach for solving stochastic single source capacitated facility location problem (SSSCFLP. Customers with stochastic demand are assigned to set of capacitated facilities that are selected to serve them. It is demonstrated that problem can be transformed to deterministic Single Source Capacitated Facility Location Problem (SSCFLP for Poisson demand distribution. A hybrid algorithm which combines Lagrangian heuristic with adjusted mixture of Ant colony and Genetic optimization is proposed to find lower and upper bounds for this problem. Computational results of various instances with distinct properties indicate that proposed solving approach is efficient.

  2. Three formulations of the multi-type capacitated facility location problem

    DEFF Research Database (Denmark)

    Klose, Andreas

    The "multi-type" or "modular" capacitated facility location problem is a discrete location model that addresses non-convex piecewise linear production costs as, for instance, staircase cost functions. The literature basically distinguishes three different ways to formulate non-convex piecewise...

  3. Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems

    CERN Document Server

    Chakrabarty, Deeparnab

    2010-01-01

    We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients and also need to be sequentially activated before they can provide service. Formally, we are given a set \\F of n facilities with facility-opening costs {f_i}, a set of m clients, and connection costs {c_{ij}} specifying the cost of assigning a client j to a facility i, a root node r denoting the depot, and a time metric d on \\F\\cup{r}. Our goal is to open a subset F of facilities, find a path P starting at r and spanning F to activate the open facilities, and connect each client j to a facility \\phi(j)\\in F, so as to minimize \\sum_{i\\in F}f_i +\\sum_{clients j}(c_{\\phi(j),j}+t_j), where t_j is the time taken to reach \\phi(j) along path P. We call this the minimum latency uncapacitated facility location (MLUFL) problem. Our main result is an O(\\log n\\max{\\log n,\\log m})-approximation for MLUFL. We also show that any improvement in th...

  4. Nearest Neighbor Averaging and its Effect on the Critical Level and Minimum Detectable Concentration for Scanning Radiological Survey Instruments that Perform Facility Release Surveys.

    Energy Technology Data Exchange (ETDEWEB)

    Fournier, Sean Donovan; Beall, Patrick S; Miller, Mark L

    2014-08-01

    Through the SNL New Mexico Small Business Assistance (NMSBA) program, several Sandia engineers worked with the Environmental Restoration Group (ERG) Inc. to verify and validate a novel algorithm used to determine the scanning Critical Level (L c ) and Minimum Detectable Concentration (MDC) (or Minimum Detectable Areal Activity) for the 102F scanning system. Through the use of Monte Carlo statistical simulations the algorithm mathematically demonstrates accuracy in determining the L c and MDC when a nearest-neighbor averaging (NNA) technique was used. To empirically validate this approach, SNL prepared several spiked sources and ran a test with the ERG 102F instrument on a bare concrete floor known to have no radiological contamination other than background naturally occurring radioactive material (NORM). The tests conclude that the NNA technique increases the sensitivity (decreases the L c and MDC) for high-density data maps that are obtained by scanning radiological survey instruments.

  5. Development and evaluation of an integrated emergency response facility location model

    Directory of Open Access Journals (Sweden)

    Jae-Dong Hong

    2012-06-01

    Full Text Available Purpose: The purpose of this paper is to propose and compare the performance of the “two” robust mathematical models, the Robust Integer Facility Location (RIFL and the Robust Continuous Facility Location (RCFL models, to solve the emergency response facility and transportation problems in terms of the total logistics cost and robustness. Design/methodology/approach: The emergency response facilities include distribution warehouses (DWH where relief goods are stored, commodity distribution points (CDP, and neighborhood locations. Authors propose two robust models: the Robust Integer Facility Location (RIFL model where the demand of a CDP is covered by a main DWH or a backup CDP; the Robust Continuous Facility Location (RCFL model where that of a CDP is covered by multiple DWHs. The performance of these models is compared with each other and to the Regular Facility Location (RFL model where a CDP is covered by one main DWH. The case studies with multiple scenarios are analyzed. Findings: The results illustrate that the RFL outperforms others under normal conditions while the RCFL outperforms others under the emergency conditions. Overall, the total logistics cost and robustness level of the RCFL outperforms those of other models while the performance of RFL and RIFL is mixed between the cost and robustness index. Originality/value: Two new emergency distribution approaches are modeled, and evaluated using case studies. In addition to the total logistics cost, the robustness index is uniquely presented and applied. The proposed models and robustness concept are hoped to shed light to the future works in the field of disaster logistics management.

  6. A greedy heuristic algorithm for solving the capacitated planar multi-facility location-allocation problem

    Science.gov (United States)

    Luis, Martino; Ramli, Mohammad Fadzli; Lin, Abdullah

    2016-10-01

    This study investigates the capacitated planar multi-facility location-allocation problem by considering various capacity constraints. The problem is also known as the capacitated multi-source Weber problem, where the number of facilities to be located is specified and each of which has a capacity constraint. An efficient greedy randomised adaptive search procedure (GRASP) is proposed to deal with the problem. A scheme that applies the furthest distance rule (FDR) and self-adjusted threshold parameters to generate initial facility locations that are situated sparsely within GRASP framework is also presented. The construction of the restricted candidate list (RCL) within GRASP is also guided by applying a concept of restricted regions that prevents new facility locations to be sited too close to the previous selected facility locations. The performance of the proposed GRASP heuristics is tested using benchmark data sets from literature. The computational experiments show that the proposed methods provide encouraging solutions when compared to recently published papers. Some future research avenues on the subject are also briefly highlighted.

  7. A minisum model with forbidden regions for locating a semi-desirable facility in the plane

    DEFF Research Database (Denmark)

    Juel, Henrik; Brimberg, Jack

    1998-01-01

    Most facilities in today's technological society may be classified as semi-desirable. That is, the facility provides a benefit or service to society, while adversely affecting the quality of life or social values in a number of possible ways. The paper proposes a location model for a new semi......-desirable facility that accounts for the service costs by a standard minisum objective with arbitrary travel distance function. The social costs are imputed by specifying around each demand point or population center a convex forbidden region, also defined by an arbitrary distance metric, in which the new facility...... may not be located. A general solution algorithm is suggested, and the methodology is applied to circular forbidden regions and special travel distance functions....

  8. A minisum model with forbidden regions for locating a semi-desirable facility in the plane

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik

    Most facilities in today's technological society may be classified as semi-desirable. That is, the facility provides a benefit or service to society, while adversely affecting the quality of life or social values in a number of possible ways. The paper proposes a location model for a new semi......-desirable facility which accounts for the service costs by a standard minisum objective with arbitrary travel distance function. The social costs are imputed by specifying around each demand point or population center a convex forbidden region, also defined by an arbitrary distance metric, in which the new facility...... may not be located. A general solution algorithm is suggested, and the methodology applied to circular forbidden regions and special travel distance functions....

  9. An analytic network process approach for locating undesirable facilities: an example from Istanbul, Turkey.

    Science.gov (United States)

    Tuzkaya, Gülfem; Onüt, Semih; Tuzkaya, Umut R; Gülsün, Bahadir

    2008-09-01

    Locating an undesirable facility is a sophisticated problem, for the evaluation procedures involve several objectives and the solution to the problem calls for some compromises to be made between probable conflicting criteria. This paper addresses the problem of undesirable facility location selection using the analytic network process (ANP), a multi-criteria decision-making technique. The ANP technique enables us to consider both qualitative and quantitative criteria as well as the interdependencies and feedbacks. A number of criteria (benefits, opportunities, costs and risks) and their sub-criteria are considered for siting a new facility with which this study has dealt. The questions of what criteria would be considered and what the interdependencies between these criteria and their weights would be were discussed and determined via interviews with some competent authorities of the Istanbul Municipality and of two environmental organizations. Four representative locations were evaluated and the most convenient one was selected. This was followed by the sensitivity analyses of the results.

  10. Inferring Groups of Objects, Preferred Routes, and Facility Locations from Trajectories

    DEFF Research Database (Denmark)

    Ceikute, Vaida

    In today’s society, GPS-enabled devices are used widely. A broad range of location-based services (LBS) allow users to receive and share information related to their positions. Thus, it is possible to accumulate GPS data, and it is expected that the amount of available GPS data will increase very...... on empirical studies with real route usage data and an existing online routing service. Finally, we use GPS trajectories as customer flows in a modern formulation of the facility location problem. We propose a practical framework that, given a road network, a set of trajectories, and a set of existing...... facilities, computes the optimal segment(s) for the location of a new facility. Customer flows are scored, and the score of a flow is distributed among the road segments that the flow covers according to a score distribution model. We propose two algorithms that adopt different approaches to compute...

  11. Solving the multiple competitive facilities location and design problem on the plane.

    Science.gov (United States)

    Redondo, Juana López; Fernández, José; García, Inmaculada; Ortigosa, Pilar M

    2009-01-01

    A continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment is considered. Other facilities offering the same product or service already exist in the area. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This is a global optimization problem, with many local optima. In this paper we analyze several approaches to solve it, namely, three multistart local search heuristics, a multistart simulated annealing algorithm, and two variants of an evolutionary algorithm. Through a comprehensive computational study it is shown that the evolutionary algorithms are the heuristics that provide the best solutions. Furthermore, using a set of problems for which the optimal solutions are known, only the evolutionary algorithms were able to find the optimal solutions for all the instances. The evolutionary strategies presented in this paper can be easily adapted to handle other continuous location problems.

  12. MIP models for connected facility location: A theoretical and computational study☆

    Science.gov (United States)

    Gollowitzer, Stefan; Ljubić, Ivana

    2011-01-01

    This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%. PMID:25009366

  13. MIP models for connected facility location: A theoretical and computational study.

    Science.gov (United States)

    Gollowitzer, Stefan; Ljubić, Ivana

    2011-02-01

    This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%.

  14. A Game Theoretical Model for Location of Terror Response Facilities under Capacitated Resources

    Science.gov (United States)

    Kang, Qi; Xu, Weisheng; Wu, Qidi

    2013-01-01

    This paper is concerned with the effect of capacity constraints on the locations of terror response facilities. We assume that the state has limited resources, and multiple facilities may be involved in the response until the demand is satisfied consequently. We formulate a leader-follower game model between the state and the terrorist and prove the existence and uniqueness of the Nash equilibrium. An integer linear programming is proposed to obtain the equilibrium results when the facility number is fixed. The problem is demonstrated by a case study of the 19 districts of Shanghai, China. PMID:24459446

  15. A game theoretical model for location of terror response facilities under capacitated resources.

    Science.gov (United States)

    Meng, Lingpeng; Kang, Qi; Han, Chuanfeng; Xu, Weisheng; Wu, Qidi

    2013-01-01

    This paper is concerned with the effect of capacity constraints on the locations of terror response facilities. We assume that the state has limited resources, and multiple facilities may be involved in the response until the demand is satisfied consequently. We formulate a leader-follower game model between the state and the terrorist and prove the existence and uniqueness of the Nash equilibrium. An integer linear programming is proposed to obtain the equilibrium results when the facility number is fixed. The problem is demonstrated by a case study of the 19 districts of Shanghai, China.

  16. A Game Theoretical Model for Location of Terror Response Facilities under Capacitated Resources

    Directory of Open Access Journals (Sweden)

    Lingpeng Meng

    2013-01-01

    Full Text Available This paper is concerned with the effect of capacity constraints on the locations of terror response facilities. We assume that the state has limited resources, and multiple facilities may be involved in the response until the demand is satisfied consequently. We formulate a leader-follower game model between the state and the terrorist and prove the existence and uniqueness of the Nash equilibrium. An integer linear programming is proposed to obtain the equilibrium results when the facility number is fixed. The problem is demonstrated by a case study of the 19 districts of Shanghai, China.

  17. A simulated annealing methodology to multiproduct capacitated facility location with stochastic demand.

    Science.gov (United States)

    Qin, Jin; Xiang, Hui; Ye, Yong; Ni, Linglin

    2015-01-01

    A stochastic multiproduct capacitated facility location problem involving a single supplier and multiple customers is investigated. Due to the stochastic demands, a reasonable amount of safety stock must be kept in the facilities to achieve suitable service levels, which results in increased inventory cost. Based on the assumption of normal distributed for all the stochastic demands, a nonlinear mixed-integer programming model is proposed, whose objective is to minimize the total cost, including transportation cost, inventory cost, operation cost, and setup cost. A combined simulated annealing (CSA) algorithm is presented to solve the model, in which the outer layer subalgorithm optimizes the facility location decision and the inner layer subalgorithm optimizes the demand allocation based on the determined facility location decision. The results obtained with this approach shown that the CSA is a robust and practical approach for solving a multiple product problem, which generates the suboptimal facility location decision and inventory policies. Meanwhile, we also found that the transportation cost and the demand deviation have the strongest influence on the optimal decision compared to the others.

  18. Verified centers, nonverified centers, or other facilities: a national analysis of burn patient treatment location.

    Science.gov (United States)

    Zonies, David; Mack, Christopher; Kramer, Bradley; Rivara, Frederick; Klein, Matthew

    2010-03-01

    Although comprehensive burn care requires significant resources, patients may be treated at verified burn centers, nonverified burn centers, or other facilities due to a variety of factors. The purpose of this study was to evaluate the association between patient and injury characteristics and treatment location using a national database. We performed an analysis of all burn patients admitted to United States hospitals participating in the Healthcare Cost and Utilization Project over 2 years. Univariate and multivariate analyses were performed to identify patient and injury factors associated with the likelihood of treatment at designated burn care facilities. Definitive care facilities were categorized as American Burn Association-verified centers, nonverified burn centers, or other facilities. During the 2 years of the study, 29,971 burn patients were treated in 1,376 hospitals located in 19 participating states. A total of 6,712 (22%) patients were treated at verified centers, with 26% and 52% treated at nonverified or other facilities, respectively. Patients treated at verified centers were younger than those treated at nonverified or other facilities (33.1 years versus 33.7 years versus 41.9 years; p facilities. Published by Elsevier Inc.

  19. Making regional facility location decisions: the example of Hospital do Oeste Norte, Portugal

    Directory of Open Access Journals (Sweden)

    Jorge Gonçalves

    2014-11-01

    Full Text Available This paper seeks to contribute to the debate on the decision-making process for the location of large public facilities, responding to the growing demand for greater rationality in public investment whilst still offering services of quality and addressing the problem of spatial friction. The specific problem analysed in this paper is the need to define the best location for a public hospital in a particular region of Portugal. The singularity of the approach adopted lies above all in the seg- mentation into macro-location and micro-location.

  20. Making regional facility location decisions: the example of Hospital do Oeste Norte, Portugal.

    Science.gov (United States)

    Gonçalves, Jorge; Antunes Ferreira, J; Condessa, Beatriz

    2014-11-01

    This paper seeks to contribute to the debate on the decision-making process for the location of large public facilities, responding to the growing demand for greater rationality in public investment whilst still offering services of quality and addressing the problem of spatial friction. The specific problem analysed in this paper is the need to define the best location for a public hospital in a particular region of Portugal. The singularity of the approach adopted lies above all in the segmentation into macro-location and micro-location.

  1. An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

    Directory of Open Access Journals (Sweden)

    Ľuboš Buzna

    2014-01-01

    Full Text Available We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve the p-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm.

  2. Facility Location Modeling in Multi-Echelon Distribution System: A Case Study of Indonesian Liquefied Petroleum Gas Supply Chain

    Directory of Open Access Journals (Sweden)

    Ilyas Masudin

    2013-04-01

    Full Text Available This paper presents model of Indonesian LPG supply chain by opening new facilities (new echelon taking into account the current facilities. The objective is to investigate the relation between distribution costs such as transportation, inventory cost and facility location in Indonesian multi-echelon LPG supply chain. Fixed-charged capacitated facility location problem is used to determine the optimal solution of the proposed model. In the sensitivity analysis, it is reported that the trade-offs between facility locations and distribution costs are exist. Results report that as the number of facility increases, total transportation and inventory cost also increase.

  3. Locations and attributes of utility-scale solar power facilities in Colorado and New Mexico, 2011

    Science.gov (United States)

    Ignizio, Drew A.; Carr, Natasha B.

    2012-01-01

    The data series consists of polygonal boundaries for utility-scale solar power facilities (both photovoltaic and concentrating solar power) located within Colorado and New Mexico as of December 2011. Attributes captured for each facility include the following: facility name, size/production capacity (in MW), type of solar technology employed, location, state, operational status, year the facility came online, and source identification information. Facility locations and perimeters were derived from 1-meter true-color aerial photographs (2011) produced by the National Agriculture Imagery Program (NAIP); the photographs have a positional accuracy of about ±5 meters (accessed from the NAIP GIS service: http://gis.apfo.usda.gov/arcgis/services). Solar facility perimeters represent the full extent of each solar facility site, unless otherwise noted. When visible, linear features such as fences or road lines were used to delineate the full extent of the solar facility. All related equipment including buildings, power substations, and other associated infrastructure were included within the solar facility. If solar infrastructure was indistinguishable from adjacent infrastructure, or if solar panels were installed on existing building tops, only the solar collecting equipment was digitized. The "Polygon" field indicates whether the "equipment footprint" or the full "site outline" was digitized. The spatial accuracy of features that represent site perimeters or an equipment footprint is estimated at +/- 10 meters. Facilities under construction or not fully visible in the NAIP imagery at the time of digitization (December 2011) are represented by an approximate site outline based on the best available information and documenting materials. The spatial accuracy of these facilities cannot be estimated without more up-to-date imagery – users are advised to consult more recent imagery as it becomes available. The "Status" field provides information about the operational

  4. Three formulations of the multi-type capacitated facility location problem

    DEFF Research Database (Denmark)

    Klose, Andreas

    The "multi-type" or "modular" capacitated facility location problem is a discrete location model that addresses non-convex piecewise linear production costs as, for instance, staircase cost functions. The literature basically distinguishes three different ways to formulate non-convex piecewise li....... We show that the latter formulation, with these inequalities included, strictly dominates the other two ways of formulating the problem. We additionally investigate different strategies of including these variable upper bounds within the model using a common MIP solver....

  5. 18 CFR 292.208 - Special requirements for hydroelectric small power production facilities located at a new dam or...

    Science.gov (United States)

    2010-04-01

    ... for hydroelectric small power production facilities located at a new dam or diversion. 292.208 Section... requirements for hydroelectric small power production facilities located at a new dam or diversion. (a) A... means of a new dam or diversion (as that term is defined in § 292.202(p)) is a qualifying facility...

  6. A bicriteria model for locating a semi-desirable facility in

    DEFF Research Database (Denmark)

    Juel, Henrik; Brimberg, Jack

    1998-01-01

    We consider the problem of locating a facility in the plane. Customers want the facility to be close to obtain cheaply the service offered by it. But customers also want the facility to be far away to avoid the pollution from it. We model the situation using two criteria: One is the well-known mi......We consider the problem of locating a facility in the plane. Customers want the facility to be close to obtain cheaply the service offered by it. But customers also want the facility to be far away to avoid the pollution from it. We model the situation using two criteria: One is the well......-known minisum criterion; in the other we want to minimize the weighted sum of Euclidean distances raised to a negative power. The second criterion is analyzed in some detail, and we state some properties of this part of the model. In the bicriteria model we minimize the weighted sum of the two criteria...

  7. A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Görtz, Simon; Klose, Andreas

    2012-01-01

    This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. To guess a primal solution to the Lagrangean dual, we average solutions to the Lagrangean...

  8. 77 FR 23409 - Toxics Release Inventory (TRI) Reporting for Facilities Located in Indian Country and...

    Science.gov (United States)

    2012-04-19

    ..., because tribal governmental structures may vary, EPA is updating its terminology to refer to the principal..., so as to avoid any confusing overlap in terminology for facilities located in Indian country. With... rule to include ceded territories used for hunting, fishing, and gathering. Other commenters...

  9. A simple dual ascent algorithm for the multilevel facility location problem

    NARCIS (Netherlands)

    Bumb, Adriana; Kern, Walter; Goemans, Michel; Jansen, Klaus; Rolim, José D.P.; Trevisan, Luca

    2001-01-01

    We present a simple dual ascent method for the multilevel facility location problem which finds a solution within 6 times the optimum for the uncapacitated case and within 12 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.

  10. A subgradient-based branch-and-bound algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Görtz, Simon; Klose, Andreas

    This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions...

  11. Location Optimization of Urban Mining Facilities with Maximal Covering Model in GIS: A Case of China

    NARCIS (Netherlands)

    Xue, Yanyan; Wen, Zongguo; Ji, Xiaoli; Bressers, Johannes T.A.; Zhang, Chenkai

    2016-01-01

    Urban mining offers an efficient supply of resources because of rich mines and low environmental impacts. Location selection and optimization for urban mining facilities is more complicated than for natural mines, given that it may vary according to the urban population, consumption habits, and

  12. An improved cut-and-solve algorithm for the single-source capacitated facility location problem

    DEFF Research Database (Denmark)

    Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund

    2017-01-01

    In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two...

  13. Cost Reduction Ability by Electricity Tariff Selection for Construction Facilities Located in Non-price Areas

    Directory of Open Access Journals (Sweden)

    Makasheva Svetlana

    2016-01-01

    Full Text Available State of the art in the tariff type selection in the retail and the wholesale electricity market for construction or reconstruction facilities located at Far East are considered. As a management solution the electricity tariff’s selection for enterprises at stage of construction or reconstruction is accented.

  14. Location Optimization of Urban Mining Facilities with Maximal Covering Model in GIS: A Case of China

    NARCIS (Netherlands)

    Xue, Yanyan; Wen, Zongguo; Ji, Xiaoli; Bressers, Hans Th.A.; Zhang, Chenkai

    2016-01-01

    Urban mining offers an efficient supply of resources because of rich mines and low environmental impacts. Location selection and optimization for urban mining facilities is more complicated than for natural mines, given that it may vary according to the urban population, consumption habits, and econ

  15. A cross-monotonic cost sharing method for the facility location game with service installation costs

    Institute of Scientific and Technical Information of China (English)

    XU DaChuan

    2009-01-01

    In this paper, we consider the metric uncapacitated facility location game with service installation costs. Our main result is an 11-approximate cross-monotonic cost-sharing method under the assumption that the installation cost depends only on the service type.

  16. A cross-monotonic cost sharing method for the facility location game with service installation costs

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In this paper,we consider the metric uncapacitated facility location game with service installation costs. Our main result is an 11-approximate cross-monotonic cost-sharing method under the assumption that the installation cost depends only on the service type.

  17. A subgradient-based branch-and-bound algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Görtz, Simon; Klose, Andreas

    This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions...

  18. An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

    NARCIS (Netherlands)

    Byrka, J.; Aardal, K.I.

    2010-01-01

    We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem, which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye, and Zhang. Note that the approximability lower bound by Guha and Khuller is 1.463 . . . . An algorithm is a (

  19. On locating a semi-desirable facility on the continuous plane

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik

    1998-01-01

    The paper considers a bicriteria model for locating a semi-desirable facility on the plane. One criterion is that of minimizing the sum of weighted distances between customers and facility, where distances are given by an arbitrary norm. The other criterion is that of maximizing the weighted...... Euclidean distance from the facility to the closest customer. The objective is to generate the set of efficient points, from which the decision maker must choose the preferred one. Two reformulations are considered: in one, the sum of weighted distances is minimized, subject to constraints requiring...... that each customer must have a weighted Euclidean distance to the facility of at least a given parameter; varying the parameter yields the efficient set. In the other, both criteria are viewed as minimization problems and a convex combination of them is minimized. Properties of the reformulations are given...

  20. On locating a semi-desirable facility on the continuous plane

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik

    1998-01-01

    The paper considers a bicriteria model for locating a semi-desirable facility on the plane. One criterion is that of minimizing the sum of weighted distances between customers and facility, where distances are given by an arbitrary norm. The other criterion is that of maximizing the weighted...... Euclidean distance from the facility to the closest customer. The objective is to generate the set of efficient points, from which the decision maker must choose the preferred one. Two reformulations are considered: in one, the sum of weighted distances is minimized, subject to constraints requiring...... that each customer must have a weighted Euclidean distance to the facility of at least a given parameter; varying the parameter yields the efficient set. In the other, both criteria are viewed as minimization problems and a convex combination of them is minimized. Properties of the reformulations are given...

  1. Accreditation status and geographic location of outpatient vascular testing facilities among Medicare beneficiaries: the VALUE (Vascular Accreditation, Location & Utilization Evaluation) study.

    Science.gov (United States)

    Rundek, Tatjana; Brown, Scott C; Wang, Kefeng; Dong, Chuanhui; Farrell, Mary Beth; Heller, Gary V; Gornik, Heather L; Hutchisson, Marge; Needleman, Laurence; Benenati, James F; Jaff, Michael R; Meier, George H; Perese, Susana; Bendick, Phillip; Hamburg, Naomi M; Lohr, Joann M; LaPerna, Lucy; Leers, Steven A; Lilly, Michael P; Tegeler, Charles; Alexandrov, Andrei V; Katanick, Sandra L

    2014-10-01

    There is limited information on the accreditation status and geographic distribution of vascular testing facilities in the US. The Centers for Medicare & Medicaid Services (CMS) provide reimbursement to facilities regardless of accreditation status. The aims were to: (1) identify the proportion of Intersocietal Accreditation Commission (IAC) accredited vascular testing facilities in a 5% random national sample of Medicare beneficiaries receiving outpatient vascular testing services; (2) describe the geographic distribution of these facilities. The VALUE (Vascular Accreditation, Location & Utilization Evaluation) Study examines the proportion of IAC accredited facilities providing vascular testing procedures nationally, and the geographic distribution and utilization of these facilities. The data set containing all facilities that billed Medicare for outpatient vascular testing services in 2011 (5% CMS Outpatient Limited Data Set (LDS) file) was examined, and locations of outpatient vascular testing facilities were obtained from the 2011 CMS/Medicare Provider of Services (POS) file. Of 13,462 total vascular testing facilities billing Medicare for vascular testing procedures in a 5% random Outpatient LDS for the US in 2011, 13% (n=1730) of facilities were IAC accredited. The percentage of IAC accredited vascular testing facilities in the LDS file varied significantly by US region, pfacilities that are IAC accredited is low and varies by region. Increasing the number of accredited vascular testing facilities to improve test quality is a hypothesis that should be tested in future research. © The Author(s) 2014.

  2. Solid waste facilities location using of analytical network process and data envelopment analysis approaches.

    Science.gov (United States)

    Khadivi, M R; Fatemi Ghomi, S M T

    2012-06-01

    Selection of the appropriate site for solid waste facilities is a complex problem and requires an extensive evaluation process, because it is very difficult to develop a selection criterion that can precisely describe the preference of one location over another. Therefore selection of these sites can be viewed as a multiple criteria decision-making or multiple attributes decision-making problem. For this purpose, we propose a technique that can effectively take managerial preferences and subjective data into consideration, along with quantitative factors. The tool proposed here relies on the use of the analytical network process (ANP) and to help integrate managerial evaluations into a more quantitatively based decision tool, data envelopment analysis (DEA) is applied. In this paper, a location selection procedure is presented to construct an undesirable facility applying ANP and DEA approaches in two stages. In the first stage ANP approach is used, results of this stage are inputs for the second stage. In this stage, DEA is applied to select the best location. Finally, to illustrate the proposed framework, at "Results and discussion" section, a total of four undesirable facility locations are evaluated. Copyright © 2012 Elsevier Ltd. All rights reserved.

  3. Designing Multi Objective Facility Location Models Based on Multiple Type Facility Dispersion and Data Envelopment Analysis Using Fuzzy Goal Programing Approach

    OpenAIRE

    Mahdi Karbasian1; Mahdi Dashti

    2013-01-01

    In this paper, four different multiple-type dispersion facilities location modeling formulations have been developed, which utilize efficiency measures of Data Envelopment Analysis to find optimal and efficient facility location patterns. While the problems studied previously do not clearly indicate which candidate is elected by a unit, simultaneous DEA approach has been used for analysis. In these models, existing facilities are considered. These models with two objectives, considerabely mat...

  4. 竞争型公共设施区位决策--概念、选址原则及模型构建%Competitive Public Facilities Location Decision:Concept, Location Selection Principle and Model Construction

    Institute of Scientific and Technical Information of China (English)

    宋正娜

    2016-01-01

    竞争型公共设施竞争性、公益性并存,其区位决策相对更加复杂。首先提出了“竞争型公共设施”的概念,指出“兼顾效率与公平的空间均衡”是其选址的基本原则,并概括出具体选址要求:遵循供需双方的空间相互作用模式、限制至邻近设施的最大出行成本、追求总出行成本最小化、约束设施规模门槛、与低层级设施在出行成本上相区分等。其次构建了基于概率分配规则的重力P中值模型,通过纳入设施规模因子实现区位和规模同步求解,并对邻近设施最大出行成本和设施最小规模进行约束,以实现空间公平-效率、服务质量公平与规模效率等多重目标。最后经过实证检验,优化后的设施布局更为均衡合理。%Competitive public facilities are both public-welfare and competitive, among them the comprehen-sive hospitals are most representative. Their location decision is relatively more complicated. This study aims to solve the problem that how to seek the optimal locations of such facilities. First of all, this study puts for-ward the concept of“competitive public facilities”which had been not defined systematically and normatively, pointed out that“the spatial equilibrium to coordinate the efficiency and equity”is the basic principle in loca-tion selection of competitive public facilities, and summarized a series of location requirements that they are to abide by the spatial interaction between the supply and demand, to limit the extreme travel cost from the settle-ment to the nearest facilities, to minimize the weighted total travel cost, to restrain the facility scale threshold, and to distinguish appropriately in spatial distribution between the higher level competitive public facilities and the ones. Secondly, gravity P median model was constructed with the probability distribution to replace the proximity rule by embedding the improved Huff probability model

  5. Solving the Bilevel Facility Location Problem under Preferences by a Stackelberg-Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    José-Fernando Camacho-Vallejo

    2014-01-01

    Full Text Available This research highlights the use of game theory to solve the classical problem of the uncapacitated facility location optimization model with customer order preferences through a bilevel approach. The bilevel model provided herein consists of the classical facility location problem and an optimization of the customer preferences, which are the upper and lower level problems, respectively. Also, two reformulations of the bilevel model are presented, reducing it into a mixed-integer single-level problem. An evolutionary algorithm based on the equilibrium in a Stackelberg’s game is proposed to solve the bilevel model. Numerical experimentation is performed in this study and the results are compared to benchmarks from the existing literature on the subject in order to emphasize the benefits of the proposed approach in terms of solution quality and estimation time.

  6. Stochastic Multi-Commodity Facility Location Based on a New Scenario Generation Technique

    Science.gov (United States)

    Mahootchi, M.; Fattahi, M.; Khakbazan, E.

    2011-11-01

    This paper extends two models for stochastic multi-commodity facility location problem. The problem is formulated as two-stage stochastic programming. As a main point of this study, a new algorithm is applied to efficiently generate scenarios for uncertain correlated customers' demands. This algorithm uses Latin Hypercube Sampling (LHS) and a scenario reduction approach. The relation between customer satisfaction level and cost are considered in model I. The risk measure using Conditional Value-at-Risk (CVaR) is embedded into the optimization model II. Here, the structure of the network contains three facility layers including plants, distribution centers, and retailers. The first stage decisions are the number, locations, and the capacity of distribution centers. In the second stage, the decisions are the amount of productions, the volume of transportation between plants and customers.

  7. Decision support with respect to facility location and fleet composition for FoodBank Cape Town

    CSIR Research Space (South Africa)

    Lanz, EJ

    2011-09-01

    Full Text Available Facility Location Problems Vehicle Fleet Composition Current & Future Work What is Food Banking? Started by John van Hengel in late 1960s in Phoenix, Arizona, USA. Good food going to waste due to defect packaging or near expiration date. Distributed... algorithm for the capacitated clustering problem, International Transactions in Operational Research, 6, pp. 665|678. Labbe M, Peeters D & Thisse JF, 1995, Location on networks, chapter 7, pp. 551|617, Ball MO, Magnanti TL, Monma CL & Nemhauser GL (Eds...

  8. A facility location model for municipal solid waste management system under uncertain environment.

    Science.gov (United States)

    Yadav, Vinay; Bhurjee, A K; Karmakar, Subhankar; Dikshit, A K

    2017-12-15

    In municipal solid waste management system, decision makers have to develop an insight into the processes namely, waste generation, collection, transportation, processing, and disposal methods. Many parameters (e.g., waste generation rate, functioning costs of facilities, transportation cost, and revenues) in this system are associated with uncertainties. Often, these uncertainties of parameters need to be modeled under a situation of data scarcity for generating probability distribution function or membership function for stochastic mathematical programming or fuzzy mathematical programming respectively, with only information of extreme variations. Moreover, if uncertainties are ignored, then the problems like insufficient capacities of waste management facilities or improper utilization of available funds may be raised. To tackle uncertainties of these parameters in a more efficient manner an algorithm, based on interval analysis, has been developed. This algorithm is applied to find optimal solutions for a facility location model, which is formulated to select economically best locations of transfer stations in a hypothetical urban center. Transfer stations are an integral part of contemporary municipal solid waste management systems, and economic siting of transfer stations ensures financial sustainability of this system. The model is written in a mathematical programming language AMPL with KNITRO as a solver. The developed model selects five economically best locations out of ten potential locations with an optimum overall cost of [394,836, 757,440] Rs.(1) /day ([5906, 11,331] USD/day) approximately. Further, the requirement of uncertainty modeling is explained based on the results of sensitivity analysis. Copyright © 2017 Elsevier B.V. All rights reserved.

  9. Dimensional testing for reverse k-nearest neighbor search

    DEFF Research Database (Denmark)

    Casanova, Guillaume; Englmeier, Elias; Houle, Michael E.

    2017-01-01

    Given a query object q, reverse k-nearest neighbor (RkNN) search aims to locate those objects of the database that have q among their k-nearest neighbors. In this paper, we propose an approximation method for solving RkNN queries, where the pruning operations and termination tests are guided by a...

  10. K-nearest neighbor finding using MaxNearestDist.

    Science.gov (United States)

    Samet, Hanan

    2008-02-01

    Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth- first or a best-first algorithm to the search hierarchy containing the data. These algorithms are generally applicable to any index based on hierarchical clustering. The idea is that the data is partitioned into clusters which are aggregated to form other clusters, with the total aggregation being represented as a tree. These algorithms have traditionally used a lower bound corresponding to the minimum distance at which a nearest neighbor can be found (termed MinDist) to prune the search process by avoiding the processing of some of the clusters as well as individual objects when they can be shown to be farther from the query object q than all of the current k nearest neighbors of q. An alternative pruning technique that uses an upper bound corresponding to the maximum possible distance at which a nearest neighbor is guaranteed to be found (termed MaxNearestDist) is described. The MaxNearestDist upper bound is adapted to enable its use for finding the k nearest neighbors instead of just the nearest neighbor (i.e., k=1) as in its previous uses. Both the depth-first and best-first k-nearest neighbor algorithms are modified to use MaxNearestDist, which is shown to enhance both algorithms by overcoming their shortcomings. In particular, for the depth-first algorithm, the number of clusters in the search hierarchy that must be examined is not increased thereby potentially lowering its execution time, while for the best-first algorithm, the number of clusters in the search hierarchy that must be retained in the priority queue used to control the ordering of processing of the clusters is also not increased, thereby potentially lowering its storage requirements.

  11. GIS based location optimization for mobile produced water treatment facilities in shale gas operations

    Science.gov (United States)

    Kitwadkar, Amol Hanmant

    Over 60% of the nation's total energy is supplied by oil and natural gas together and this demand for energy will continue to grow in the future (Radler et al. 2012). The growing demand is pushing the exploration and exploitation of onshore oil and natural gas reservoirs. Hydraulic fracturing has proven to not only create jobs and achieve economic growth, but also has proven to exert a lot of stress on natural resources---such as water. As water is one of the most important factors in the world of hydraulic fracturing, proper fluids management during the development of a field of operation is perhaps the key element to address a lot of these issues. Almost 30% of the water used during hydraulic fracturing comes out of the well in the form of flowback water during the first month after the well is fractured (Bai et. al. 2012). Handling this large amount of water coming out of the newly fractured wells is one of the major issues as the volume of the water after this period drops off and remains constant for a long time (Bai et. al. 2012) and permanent facilities can be constructed to take care of the water over a longer period. This paper illustrates development of a GIS based tool for optimizing the location of a mobile produced water treatment facility while development is still occurring. A methodology was developed based on a multi criteria decision analysis (MCDA) to optimize the location of the mobile treatment facilities. The criteria for MCDA include well density, ease of access (from roads considering truck hauls) and piping minimization if piping is used and water volume produced. The area of study is 72 square miles east of Greeley, CO in the Wattenberg Field in northeastern Colorado that will be developed for oil and gas production starting in the year 2014. A quarterly analysis is done so that we can observe the effect of future development plans and current circumstances on the location as we move from quarter to quarter. This will help the operators to

  12. Strategic closed-loop facility location problem with carbon market trading

    DEFF Research Database (Denmark)

    Diabat, A.; Abdallah, T.; Al-Refaie, A.

    2013-01-01

    and recovery of products in a closed-loop configuration. Remanufacturing is the basis of profit-oriented reverse logistics in which recovered products are restored to a marketable condition in order to be resold to the primary or secondary market. In this paper, we introduce a multiechelon multicommodity...... facility location problem with a trading price of carbon emissions and a cost of procurement. The company might either incur costs if the carbon cap, normally assigned by regulatory agencies, is lower than the total emissions, or gain profit if the carbon cap is higher than the total emissions. A numerical...

  13. Methodology for optimising location of new primary health care facilities in rural communities: a case study in KwaZulu-Natal, South Africa.

    Science.gov (United States)

    Tanser, Frank

    2006-10-01

    To develop a quantitative methodology to optimally site new primary health care facilities so as to achieve the maximum population level increase in accessibility to care. The study aims to test the methodology in a rural community characterised by considerable heterogeneity in population distribution and health care access. A geographical information system was used to estimate travel time to the nearest primary health care facility for each of the 26 000 homesteads in the subdistrict. The homestead's travel time estimate was then converted into an impedance to care estimate using distance decay (in clinic use) data obtained from the subdistrict. A map of total person impedance/km(2) was then produced using a 3 km standard Gaussian filter. The resulting map was used to site a test clinic in the largest contiguous area of high person impedance. Hlabisa health subdistrict, KwaZulu-Natal, South Africa. The population level increase in accessibility that would be achieved by the construction of the test clinic would be 3.6 times the increase in accessibility achieved by the construction of the newest clinic in the subdistrict. The corresponding ratio for increasing clinic coverage (% of the population within 60 minutes of care) would be 4.7. The methodology successfully identifies a locality for a new facility that would maximise the population level increase in accessibility to care. The same principles used in this research could also be applied in other settings. The methodology is of practical value in health research and practice and provides a framework for optimising location of new primary health care facilities.

  14. Inferring Groups of Objects, Preferred Routes, and Facility Locations from Trajectories

    DEFF Research Database (Denmark)

    Ceikute, Vaida

    on empirical studies with real route usage data and an existing online routing service. Finally, we use GPS trajectories as customer flows in a modern formulation of the facility location problem. We propose a practical framework that, given a road network, a set of trajectories, and a set of existing......In today’s society, GPS-enabled devices are used widely. A broad range of location-based services (LBS) allow users to receive and share information related to their positions. Thus, it is possible to accumulate GPS data, and it is expected that the amount of available GPS data will increase very...... substantially in the years to come. The availability of such GPS data holds huge potential to improve existing LBS or lead to the creation of new ones. This thesis investigates the use of GPS data in three different areas. Specifically, from GPS data we obtain trajectories of moving objects, from which we can...

  15. Special case waste located at Oak Ridge National Laboratory facilities: Survey report

    Energy Technology Data Exchange (ETDEWEB)

    Forgy, J.R. Jr.

    1995-11-01

    Between October 1994 and October 1995, a data base was established at the Oak Ridge National Laboratory (ORNL) to provide a current inventory of the radioactive waste materials, located at ORNL, for which the US Department of Energy (DOE) has no definite planned disposal alternatives. DOE refers to these waste materials as special case waste. To assist ORNL and DOE management in future planning, an inventory system was established and a baseline inventory prepared. This report provides the background of the ORNL special case waste survey project, as well as special case waste category definitions, both current and anticipated sources and locations of special case waste materials, and the survey and data management processes. Special case waste will be that waste material which, no matter how much practical characterization, treatment, and packaging is made, will never meet the acceptance criteria for permanent disposal at ORNL, and does not meet the criteria at a currently planned off-site permanent disposal facility.

  16. An Application Of Facility Location Models With Hotspot Analysis For Optimal Location Of Abattoir Bio-Energy Plant In Anambra State Of Nigeria

    Directory of Open Access Journals (Sweden)

    E. C. Chukwuma

    2015-08-01

    Full Text Available Poor waste management strategy in abattoir in the the study area has needs a major attention considering it negative impacts on man land and water. Sitting of centralized biogas plant in a strategic location in the state would be the major means of combating the environmental challenges of increase in abattoir waste generation as result of population explosion in the state. This study investigates optimal location for sitting central abattoir waste treatment facility in Anambra State of Nigeria using facility location models with hotspot analysis in GIS environment. The result of the study shows that Using centre of gravity model the central location was estimated to be at Xc Yc 6.900953016 6.110157865. Based on inadequacy of the model hotspot analysis operation was done the hotspot analysis delineated clusters of abattoirs significantly higher in bio-wastes production than the overall study area. The hotspot analysis shows that the West regions of the study area has many abattoir that is classified as hotspot abattoirs. Using the hotspot abattoirs as proposed sites for load-distance model three abattoirs were identified as proposed sites- Obosi slaugher house Nkpor Private slaughter house and Oye-olise Ogbunike slaugher house. Their load distance values are 17250.40058 16299.24005 and 18210.14631 respectively. The optimal location for construction of central abattoir bio-waste treatment facility based on the application of these location facility models and hotspot analysis is Nkpor private slaughter house or its environs.

  17. A NESTED PARTITIONS FRAMEWORK FOR SOLVING LARGE-SCALE MULTICOMMODITY FACILITY LOCATION PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Leyuan SHI; Robert R.MEYER; Mehmet BOZBAY; Andrew J.MILLER

    2004-01-01

    Large-scale multicommodity facility location problems are generally intractable with respect to standard mixed-integer programming (MIP) tools such as the direct application of general-purpose Branch & Cut (BC) commercial solvers i.e. CPLEX. In this paper, the authors investigate a nested partitions (NP) framework that combines meta-heuristics with MIP tools (including branch-and-cut).We also consider a variety of alternative formulations and decomposition methods for this problem class. Our results show that our NP framework is capable of efficiently producing very high quality solutions to multicommodity facility location problems. For large-scale problems in this class, this approach is significantly faster and generates better feasible solutions than either CPLEX (applied directly to the given MIP) or the iterative Lagrangian-based methods that have generally been regarded as the most effective structure-based techniques for optimization of these problems. We also briefly discuss some other large-scale MIP problem classes for which this approach is expected to be very effective.

  18. A Decision Framework for Location Selection in Thailand: A Case Study in Hard Disk Drive Manufacturing Facility Location

    OpenAIRE

    Bhumipipatana, Kanitsaran

    2010-01-01

    ABSTRACT Making location selection for the operation of products is a complex decision-making process for manufacturing firms since the optimal location could enhance the firms’ competitive advantage and lead to a success in business. In this study, the critical factors affecting foreign firms’ international location decision are explored and aggregated into a comprehensive set of main factors and sub-factors. The results are examined by looking at the group sample of the Hard Disk Drive ...

  19. Nearest and reverse nearest neighbor queries for moving objects

    DEFF Research Database (Denmark)

    Benetis, R.; Jensen, Christian Søndergaard; Karciauskas, G.

    2006-01-01

    With the continued proliferation of wireless communications and advances in positioning technologies, algorithms for efficiently answering queries about large populations of moving objects are gaining in interest. This paper proposes algorithms for k nearest and reverse k nearest neighbor queries...... on the current and anticipated future positions of points moving continuously in the plane. The former type of query returns k objects nearest to a query object for each time point during a time interval, while the latter returns the objects that have a specified query object as one of their k closest neighbors...

  20. The spatial and urban planning concerns related to nuclear facilities locations: Case study of the Vinča Institute location

    Directory of Open Access Journals (Sweden)

    Stefanović Nebojša D.

    2017-01-01

    Full Text Available The spatial and urban planning is one of the key instruments for the planned formation and development of locations for nuclear facilities, especially in terms of meeting the strict spatial conditionality, as well as in terms of the formation of protection zones in their surroundings. This paper systemizes the international criteria and requirements for the locations of nuclear facilities and analyses the spatial distribution of nuclear facilities in the surrounding countries of the Republic of Serbia. The research was conducted on the example of the location of the Vinča Institute of Nuclear Sciences, within which the fulfilment of spatial requirements, treatment of the location in the existing spatial and urban plans and relationship between other functions in the surrounding area were analysed. The paper proves the starting hypothesis that the general requirements related to both the spatial development of nuclear facilities locations and the protection from radiation have not been met in the Vinča location and its surroundings. It was determined that the spatial and urban plans encompassing the area of Vinča do not contain sufficiently specific planning solutions and that, as such, they do not provide a sufficient planning basis for meeting the necessary requirements and obligations regarding the protection from radiation. The paper also gives recommendations for further spatial development and protection of the Vinča location and its surroundings. The research condcted in this paper indicates the importance and priority of further research so that the necessary planning solutions for further development of the complex in Vinča and for the formation of protection zones could be defined through creating a new planning documentation. In addition, the paper particularly highlights the need for conducting a research to identify a location for permanent disposal of radioactive waste. It also indicates the necessity of considering the aspects

  1. A branch-and-price algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Klose, Andreas; Görtz, Simon

    2007-01-01

    to compute optimal solutions to large or difficult problem instances by means of a branch-and-bound procedure information about such a primal fractional solution can be advantageous. In this paper, a (stabilized) column generation method is, therefore, employed in order to solve a corresponding master......The capacitated facility location problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. It consists in selecting plant sites from a finite set of potential sites and in allocating customer demands in such a way as to minimize...... operating and transportation costs. A number of solution approaches based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. Subgradient optimization does not provide a primal (fractional) optimal solution to the corresponding master problem. However, in order...

  2. The Nearest Group of Galaxies

    CERN Document Server

    Van den Bergh, S

    1999-01-01

    The small Antlia-Sextans clustering of galaxies is located at a distance of only 1.36 Mpc from the Sun, and 1.72 Mpc from the adopted barycenter of the Local Group. The latter value is significantly greater than the radius of the zero- velocity surface of the Local Group which, for an assumed age of 14 Gyr, has Ro = 1.18 " 0.15 Mpc. This, together with the observation that the members of the Ant-Sex group have a mean redshift of +114 " 12 km s-1 relative to the centroid of the Local Group, suggests that the Antlia-Sextans group is not bound to our Local Group, and that it is expanding with the Hubble flow. If this conclusion is correct, then Antlia-Sextans may be the nearest external clustering of galaxies. The total galaxian population of the Ant-Sex group is ~ 1/5 that of the Local Group. However, the integrated luminosity of Ant-Sex is two orders of magnitude lower than that of the Local Group. Subject headings: Galaxies - clusters: individual (Antlia-Sextans)

  3. A simulation-based robust biofuel facility location model for an integrated bio-energy logistics network

    Directory of Open Access Journals (Sweden)

    Jae-Dong Hong

    2014-10-01

    Full Text Available Purpose: The purpose of this paper is to propose a simulation-based robust biofuel facility location model for solving an integrated bio-energy logistics network (IBLN problem, where biomass yield is often uncertain or difficult to determine.Design/methodology/approach: The IBLN considered in this paper consists of four different facilities: farm or harvest site (HS, collection facility (CF, biorefinery (BR, and blending station (BS. Authors propose a mixed integer quadratic modeling approach to simultaneously determine the optimal CF and BR locations and corresponding biomass and bio-energy transportation plans. The authors randomly generate biomass yield of each HS and find the optimal locations of CFs and BRs for each generated biomass yield, and select the robust locations of CFs and BRs to show the effects of biomass yield uncertainty on the optimality of CF and BR locations. Case studies using data from the State of South Carolina in the United State are conducted to demonstrate the developed model’s capability to better handle the impact of uncertainty of biomass yield.Findings: The results illustrate that the robust location model for BRs and CFs works very well in terms of the total logistics costs. The proposed model would help decision-makers find the most robust locations for biorefineries and collection facilities, which usually require huge investments, and would assist potential investors in identifying the least cost or important facilities to invest in the biomass and bio-energy industry.Originality/value: An optimal biofuel facility location model is formulated for the case of deterministic biomass yield. To improve the robustness of the model for cases with probabilistic biomass yield, the model is evaluated by a simulation approach using case studies. The proposed model and robustness concept would be a very useful tool that helps potential biofuel investors minimize their investment risk.

  4. Characterization of the Old Hydrofracture Facility (OHF) waste tanks located at ORNL

    Energy Technology Data Exchange (ETDEWEB)

    Keller, J.M.; Giaquinto, J.M.; Meeks, A.M.

    1997-04-01

    The Old Hydrofracture Facility (OHF) is located in Melton Valley within Waste Area Grouping (WAG) 5 and includes five underground storage tanks (T1, T2, T3, T4, and T9) ranging from 13,000 to 25,000 gal. capacity. During the period of 1996--97 there was a major effort to re-sample and characterize the contents of these inactive waste tanks. The characterization data summarized in this report was needed to address waste processing options, examine concerns dealing with the performance assessment (PA) data for the Waste Isolation Pilot Plant (WIPP), evaluate the waste characteristics with respect to the waste acceptance criteria (WAC) for WIPP and Nevada Test Site (NTS), address criticality concerns, and to provide the data needed to meet DOT requirements for transporting the waste. This report discusses the analytical characterization data collected on both the supernatant and sludge samples taken from three different locations in each of the OHF tanks. The isotopic data presented in this report supports the position that fissile isotopes of uranium ({sup 233}U and {sup 235}U) do not satisfy the denature ratios required by the administrative controls stated in the ORNL LLLW waste acceptance criteria (WAC). The fissile isotope of plutonium ({sup 239}Pu and {sup 241}Pu) are diluted with thorium far above the WAC requirements. In general, the OHF sludge was found to be hazardous (RCRA) based on total metal content and the transuranic alpha activity was well above the 100 nCi/g limit for TRU waste. The characteristics of the OHF sludge relative to the WIPP WAC limits for fissile gram equivalent, plutonium equivalent activity, and thermal power from decay heat were estimated from the data in this report and found to be far below the upper boundary for any of the remote-handled transuranic waste (RH-TRU) requirements for disposal of the waste in WIPP.

  5. Mine-detection test facilities at TNO-FEL test location "Waalsdorp"

    NARCIS (Netherlands)

    Rhebergen, J.B.; Zwamborn, A.P.M.

    1998-01-01

    As part of the TNO-FEL Ultra-Wide-Band Ground-Penetrating-Radar (UWB-GPR) project, a test facility for controlled GPR experiments was planned. Construction of this sand-box test facility has recently been completed. At the same site another test facility, for evaluating various commercial of the

  6. Mine-detection test facilities at TNO-FEL test location "Waalsdorp"

    NARCIS (Netherlands)

    Rhebergen, J.B.; Zwamborn, A.P.M.

    1998-01-01

    As part of the TNO-FEL Ultra-Wide-Band Ground-Penetrating-Radar (UWB-GPR) project, a test facility for controlled GPR experiments was planned. Construction of this sand-box test facility has recently been completed. At the same site another test facility, for evaluating various commercial of the she

  7. Designing Multi Objective Facility Location Models Based on Multiple Type Facility Dispersion and Data Envelopment Analysis Using Fuzzy Goal Programing Approach

    Directory of Open Access Journals (Sweden)

    Mahdi Karbasian

    2013-01-01

    Full Text Available In this paper, four different multiple-type dispersion facilities location modeling formulations have been developed, which utilize efficiency measures of Data Envelopment Analysis to find optimal and efficient facility location patterns. While the problems studied previously do not clearly indicate which candidate is elected by a unit, simultaneous DEA approach has been used for analysis. In these models, existing facilities are considered. These models with two objectives, considerabely match the real world problems. Since these four models are multiobjective, a fuzzy goal programming approach has been applied to solve the four problems. In this paper, after introducing the proposed models, an example, with the results of numerical calculations has been presented.

  8. Optimal weighted nearest neighbour classifiers

    CERN Document Server

    Samworth, Richard J

    2011-01-01

    We derive an asymptotic expansion for the excess risk (regret) of a weighted nearest-neighbour classifier. This allows us to find the asymptotically optimal vector of non-negative weights, which has a rather simple form. We show that the ratio of the regret of this classifier to that of an unweighted $k$-nearest neighbour classifier depends asymptotically only on the dimension $d$ of the feature vectors, and not on the underlying population densities. The improvement is greatest when $d=4$, but thereafter decreases as $d \\rightarrow \\infty$. The popular bagged nearest neighbour classifier can also be regarded as a weighted nearest neighbour classifier, and we show that its corresponding weights are somewhat suboptimal when $d$ is small (in particular, worse than those of the unweighted $k$-nearest neighbour classifier when $d=1$), but are close to optimal when $d$ is large. Finally, we argue that improvements in the rate of convergence are possible under stronger smoothness assumptions, provided we allow nega...

  9. Accreditation Status and Geographic Location of Outpatient Echocardiographic Testing Facilities Among Medicare Beneficiaries: The VALUE-ECHO Study.

    Science.gov (United States)

    Brown, Scott C; Wang, Kefeng; Dong, Chuanhui; Yi, Li; Marinovic Gutierrez, Carolina; Di Tullio, Marco R; Farrell, Mary Beth; Burgess, Pamela; Gornik, Heather L; Hamburg, Naomi M; Needleman, Laurence; Orsinelli, David; Robison, Susana; Rundek, Tatjana

    2017-08-08

    Accreditation of echocardiographic testing facilities by the Intersocietal Accreditation Commission (IAC) is supported by the American College of Cardiology and American Society of Echocardiography. However, limited information exists on the accreditation status and geographic distribution of echocardiographic facilities in the United States. Our study aimed to identify (1) the proportion of outpatient echocardiography facilities used by Medicare beneficiaries that are IAC accredited, (2) their geographic distribution, and (3) variations in procedure type and volume by accreditation status. As part of the VALUE-ECHO (Value of Accreditation, Location, and Utilization Evaluation-Echocardiography) study, we examined the proportion of IAC-accredited echocardiographic facilities performing outpatient echocardiography in the 2013 Centers for Medicare and Medicaid Services outpatient limited data set (100% sample) and their geographic distribution using geocoding in ArcGIS (ESRI, Redlands, CA). Among 4573 outpatient facilities billing Medicare for echocardiographic testing in 2013, 99.6% (n = 4554) were IAC accredited (99.7% in the 50 US states and 86.2% in Puerto Rico). The proportion IAC-accredited echocardiographic facilities varied by region, with 98.7%, 99.9%, 99.9%, 99.5%, and 86.2% of facilities accredited in the Northeast, South, Midwest, West, and Puerto Rico, respectively (P facilities. Most procedures (90.9%) were transthoracic echocardiograms, of which 99.7% were conducted in IAC-accredited echocardiographic facilities. Almost all outpatient echocardiographic facilities billed by Medicare are IAC accredited. This accreditation rate is substantially higher than previously reported for US outpatient vascular testing facilities (13% IAC accredited). The uniformity of imaging and interpretation protocols from a single accrediting body is important to facilitate optimal cardiovascular care. © 2017 by the American Institute of Ultrasound in Medicine.

  10. Optimizations of transverse projected emittance at the photo-injector test facility at DESY, location Zeuthen

    Energy Technology Data Exchange (ETDEWEB)

    Rimjaem, S., E-mail: r.sakhorn@gmail.com [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); Stephan, F.; Krasilnikov, M. [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); Ackermann, W. [Technische Universtaet Darmstadt, Schossgartenstrasse 8, 64289 Darmstadt (Germany); Asova, G.; Baehr, J. [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); Gjonaj, E. [Technische Universtaet Darmstadt, Schossgartenstrasse 8, 64289 Darmstadt (Germany); Grabosch, H.J.; Hakobyan, L.; Haenel, M.; Ivanisenko, Y.; Khojoyan, M.; Klemz, G. [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); Lederer, S. [Deutsches Elektronen-Synchrotron (DESY), Notkestrasse 85, 22607 Hamburg (Germany); Mahgoub, M. [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); Michelato, P.; Monaco, L. [Istituto Nazionale di Fisica Nucleare, Sezione di Milano - LASA, Via F.lli Cervi 201, 20090 Segrate Milano (Italy); Nozdrin, M.; O' Shea, B.; Otevrel, M. [Deutsches Elektronen-Synchrotron (DESY), Platanenallee 6, 15738 Zeuthen (Germany); and others

    2012-04-11

    High brightness electron sources for linac based short-wavelength free-electron lasers are developed and optimized for small transverse projected emittance at the photo-injector test facility at DESY, location Zeuthen (PITZ). A major part of the measurement program at PITZ is dedicated to transverse phase space optimization in order to fulfill the requirements of the European X-ray free-electron laser (European XFEL). A laser-driven RF-gun, treated with a dry-ice sublimation-impulse cleaning technique, a new photocathode laser system allowing short rise and fall times of the flat-top temporal distribution as well as several new diagnostic components have been installed at PITZ in 2008. The electrons generated via the photo-effect at a cesium telluride (Cs{sub 2}Te) cathode are accelerated by a 1.6 cell L-band RF-gun cavity with a maximum accelerating gradient at the cathode of about 60 MV/m. The transverse projected emittance is measured using a single slit scan technique. In the 2008-2009 run period, a detailed characterization of the projected transverse emittance was performed at different operating conditions. Optimizations and measurement results as well as simulation predictions of the transverse projected emittance for bunch charges of 1, 0.5, 0.25 and 0.1 nC are presented and discussed in this paper. The geometric mean of the normalized projected rms emittance in both transverse directions for an electron bunch charge of 1 nC was measured to be 0.89{+-}0.01 mm mrad for a 100% rms phase-space distribution.

  11. Results of operation and current safety performance of nuclear facilities located in the Russian Federation

    Science.gov (United States)

    Kuznetsov, V. M.; Khvostova, M. S.

    2016-12-01

    After the NPP radiation accidents in Russia and Japan, a safety statu of Russian nuclear power plants causes concern. A repeated life time extension of power unit reactor plants, designed at the dawn of the nuclear power engineering in the Soviet Union, power augmentation of the plants to 104-109%, operation of power units in a daily power mode in the range of 100-70-100%, the use of untypical for NPP remixed nuclear fuel without a careful study of the results of its application (at least after two operating periods of the research nuclear installations), the aging of operating personnel, and many other management actions of the State Corporation "Rosatom", should attract the attention of the Federal Service for Ecological, Technical and Atomic Supervision (RosTekhNadzor), but this doesn't happen. The paper considers safety issues of nuclear power plants operating in the Russian Federation. The authors collected statistical information on violations in NPP operation over the past 25 years, which shows that even after repeated relaxation over this period of time of safety regulation requirements in nuclear industry and highly expensive NPP modernization, the latter have not become more safe, and the statistics confirms this. At a lower utilization factor high-power pressure-tube reactors RBMK-1000, compared to light water reactors VVER-440 and 1000, have a greater number of violations and that after annual overhauls. A number of direct and root causes of NPP mulfunctions is still high and remains stable for decades. The paper reveals bottlenecks in ensuring nuclear and radiation safety of nuclear facilities. Main outstanding issues on the storage of spent nuclear fuel are defined. Information on emissions and discharges of radioactive substances, as well as fullness of storages of solid and liquid radioactive waste, located at the NPP sites are presented. Russian NPPs stress test results are submitted, as well as data on the coming removal from operation of NPP

  12. Assessment Of Market Facilities And Locational Effects On Adjoining Neighborhoods In Nigerian Urban Centers Empirical Evidence From Akure Nigeria

    Directory of Open Access Journals (Sweden)

    Adeyinka S. A.

    2015-08-01

    Full Text Available There is the need for people to buy and sell and transact their businesses in a way that life can go on normally. This study examined the markets facilities level and locational effects on adjoining neighbourhoods in Akure Township. Both primary and secondary data types were employed in the study primary data were collected through the administration of questionnaire on traders and patronsbuyers in the markets and residents of adjoining neighbourhoods and personal observation. Secondary data were collected from government publications. Data collected were analysed using descriptive statistical methods which included frequency counts and Likerts scale to analyse the satisfaction of traders and patrons on the facilities in the markets and severity of locational effects on residents of adjoining neighbourhoods. Findings from the study showed that facilities such as parking spaces fire extinguishers circulation spaces within the markets trading spaces safe area for children perimeter fencing and loading and off-loading bay were inadequately provided. While on-street display of goods traffic congestion air pollution on-street parking due to inadequate parking spaces were the severely perceived locational effects. The study concluded that facilities in the markets were inadequate and that markets constitute nuisances to the adjoining areas. It hereby recommends that markets in the study area be provided with the required level of facilities to prevent future urban problems.

  13. Classifying substance use disorder treatment facilities with co-located mental health services: A latent class analysis approach.

    Science.gov (United States)

    Mauro, Pia M; Furr-Holden, C Debra; Strain, Eric C; Crum, Rosa M; Mojtabai, Ramin

    2016-06-01

    The Affordable Care Act calls for increased integration and coordination of behavioral health services, as people with co-occurring disorders (CODs), meeting criteria for both substance use and psychiatric disorders, are overrepresented in treatment samples. Nationwide estimates of mental health (MH) service co-location in substance use disorder (SUD) treatment facilities are needed. We empirically derived a multiple-indicator categorization of services for CODs in SUD treatment facilities. We used latent class analysis to categorize 14,037 SUD treatment facilities in the United States and territories included in the 2012 National Survey of Substance Abuse Treatment Services. Latent class indicators included MH screening and diagnosis, MH support services, psychiatric medications, groups for CODs, and psychosocial approaches. Multinomial logistic regression compared facility-identified primary focus (i.e., SUD, MH, mix of SUD-MH, and general/other) and other facility characteristics across classes. A four-class solution was chosen with the following classes: Comprehensive MH/COD Services (25%), MH without COD Services (25%), MH Screening Services (21%), and Limited MH Services (29%). The former two classes with co-located MH services were less likely to report a SUD-primary focus than the latter classes reporting only MH screening or Limited MH Services. Only the Comprehensive MH/COD Services class also had a high probability of providing special groups for CODs. Approximately half of SUD treatment facilities were in classes with co-located mental health services, but only a quarter provided comprehensive COD services. Future studies should assess differences in patient experiences and treatment outcomes across facilities with and without COD services. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  14. Environmental Monitoring, Air Quality - MO 2011 Facility Air Locations - Missouri Emmissions Inventory System (SHP)

    Data.gov (United States)

    NSGIC State | GIS Inventory — This data set includes locations from the Missouri Emissions Inventory System (MOEIS) database. Locational data was obtained using a variety of methods including but...

  15. EPA Facility Locations and Regional Boundaries - National Geospatial Data Asset (NGDA)

    Data.gov (United States)

    U.S. Environmental Protection Agency — This downloadable package contains the following layers: EPA facility points, EPA region boundary polygons and EPA region boundary polygons extended to the 200nm...

  16. On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games

    DEFF Research Database (Denmark)

    Thang, Nguyen Kim

    2010-01-01

    in an allowable location that minimizes the utilitarian social cost — the sum of agents costs. A mechanism is strategyproof (SP) if no agent may misreport its locations and be better off; it is group-strategyproof (GSP) if no coalition of agents benefits by jointly misreporting their locations The requirement...

  17. Assisted Living Facilities, Locations of Assisted Living Facilities identifed visually and placed on the Medical Multi-Hazard Mitigation layer., Published in 2006, 1:1200 (1in=100ft) scale, Noble County Government.

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — Assisted Living Facilities dataset current as of 2006. Locations of Assisted Living Facilities identifed visually and placed on the Medical Multi-Hazard Mitigation...

  18. Randomized approximate nearest neighbors algorithm.

    Science.gov (United States)

    Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir

    2011-09-20

    We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k(2)·(d + log k), with T the number of iterations performed. The memory requirements of the procedure are of the order N·(d + k). A by-product of the scheme is a data structure, permitting a rapid search for the k nearest neighbors among {x(j)} for an arbitrary point x ∈ R(d). The cost of each such query is proportional to T·(d·(log d) + log(N/k)·k·(d + log k)), and the memory requirements for the requisite data structure are of the order N·(d + k) + T·(d + N). The algorithm utilizes random rotations and a basic divide-and-conquer scheme, followed by a local graph search. We analyze the scheme's behavior for certain types of distributions of {x(j)} and illustrate its performance via several numerical examples.

  19. Location Privacy Preserving k Nearest Neighbor Query Method on Road Network in Presence of User's Preference%支持偏好调控的路网隐私保护k近邻查询方法

    Institute of Scientific and Technical Information of China (English)

    倪巍伟; 陈萧; 马中希

    2015-01-01

    随着人们对个体隐私的日益关注,位置服务中的隐私保护问题成为数据库领域新兴的研究热点.针对面向路网的隐私保护k近邻查询中,保护位置隐私引发的难以兼顾查询质量问题及查询者对查询效率与准确性间偏好调控需求问题,引入PoI(Points of Interest)概率分布概念,通过分析服务器端PoI邻接关系,生成PoI概率分布.将服务器端查找k近邻PoI过程分解为路网扩张查询阶段和迭代替换阶段,为迭代替换阶段构建基于PoI概率分布的可替换PoI概率预测机制.基于所构建概率预测机制,提出支持用户偏好调控的保护位置隐私k近邻查询方法AdPriQuery(Adjustable Privacy-preserving k nearest neighbor Query),查询者通过调节筛选概率阈值,在兼顾位置隐私安全的同时,实现对查询效率与准确性的偏好调控.所提调控机制对已有的基于空间混淆的路网环境保护位置隐私近邻查询方法具有良好的兼容性.理论分析和实验结果表明,所提方法在兼顾保护位置隐私的同时,能有效提高服务器端查询效率,同时支持查询结果准确性与查询效率的偏好调控要求.

  20. Developing a plan for primary health care facilities in Soweto, South Africa. Part II: Applying locational criteria.

    Science.gov (United States)

    Doherty, J; Rispel, L; Webb, N

    1996-12-01

    This article is the second of a two-part series describing the development of a ten-year plan for primary health care facility development in Soweto. The first article concentrated on the political problems and general methodological approach of the project. This second article describes how the technical problem of planning in the context of scanty information was overcome. The reasoning behind the various assumptions and criteria which were used to assist the planning of the location of facilities is explained, as well as the process by which they were applied. The merits and limitations of this planning approach are discussed, and it is suggested that the approach may be useful to other facility planners, particularly in the developing world.

  1. Cell Locating with the Image Analysis System of the CAS-LIBB Single-Particle Microbeam Facility

    Institute of Scientific and Technical Information of China (English)

    Wang Xiaohua; Wang Shaohu; Yu Zengliang

    2005-01-01

    A single-particle microbeam facility has been constructed at the Key Laboratory of Ion Beam Bioengineering (LIBB), Chinese Academy of Sciences (CAS). At the CAS-LIBB microbeam facility, we have developed protocols to place exact numbers of charged particles through nuclear centroids of cells, at defined positions in the cytoplasm relative to the nucleus, and through defined fractions of cells in a population. In this paper, we address the methods for nucleus, cytoplasm and bystander (either a single or an exact number of ions is delivered to a certain percentage of cells in a population to study the bystander effects of radiation) irradiation in detail from the precision of target finding and cell locating in the image analysis system. Moreover, for cells touching slightly in an image, a watershed method is used to separate these touching objects;after that, the number of objects in an image is counted accurately and the irradiation points are located precisely.

  2. Sports Facilities, Shopping Centers or Homes: What Locations are Important for Adults’ Physical Activity? A Cross-Sectional Study

    Directory of Open Access Journals (Sweden)

    Marijke Jansen

    2016-03-01

    Full Text Available Physical activity (PA is influenced by the built environment. However, little is known about the types of built environment where adults spend their time, and at what levels of PA they engage in those environments. Understanding the effect of the built environment on PA requires insight into PA behavior at different types of locations (e.g., home, work, shopping centers, and sports facilities. Therefore, this study describes where adults aged 45–65 years were active with moderate-to-vigorous intensity (MVPA, and examines associations of socio-demographic factors and neighborhood with MVPA at these locations. Participants’ (N = 308 PA was measured for seven days using accelerometers and GPS-devices. Adults spent most minutes of MVPA at home and work. Highest MVPA-ratios of total time spent at a location were achieved in sports facilities and during transport. Neighborhood characteristics and socio-demographic factors such as work status, health status and household structure, had significant effects on MVPA at various locations and on total MVPA. Understanding PA behavior at various locations may provide insights that allow professionals in different domains (e.g., health, landscaping, urban planning to develop strategies to stimulate PA.

  3. Sports Facilities, Shopping Centers or Homes: What Locations are Important for Adults' Physical Activity? A Cross-Sectional Study.

    Science.gov (United States)

    Jansen, Marijke; Ettema, Dick; Pierik, Frank; Dijst, Martin

    2016-03-04

    Physical activity (PA) is influenced by the built environment. However, little is known about the types of built environment where adults spend their time, and at what levels of PA they engage in those environments. Understanding the effect of the built environment on PA requires insight into PA behavior at different types of locations (e.g., home, work, shopping centers, and sports facilities). Therefore, this study describes where adults aged 45-65 years were active with moderate-to-vigorous intensity (MVPA), and examines associations of socio-demographic factors and neighborhood with MVPA at these locations. Participants' (N = 308) PA was measured for seven days using accelerometers and GPS-devices. Adults spent most minutes of MVPA at home and work. Highest MVPA-ratios of total time spent at a location were achieved in sports facilities and during transport. Neighborhood characteristics and socio-demographic factors such as work status, health status and household structure, had significant effects on MVPA at various locations and on total MVPA. Understanding PA behavior at various locations may provide insights that allow professionals in different domains (e.g., health, landscaping, urban planning) to develop strategies to stimulate PA.

  4. Department of Energy’s ARM Climate Research Facility External Data Center Operations Plan Located At Brookhaven National Laboratory

    Energy Technology Data Exchange (ETDEWEB)

    Cialella, A. [Brookhaven National Lab. (BNL), Upton, NY (United States); Gregory, L. [Brookhaven National Lab. (BNL), Upton, NY (United States); Lazar, K. [Brookhaven National Lab. (BNL), Upton, NY (United States); Liang, M. [Brookhaven National Lab. (BNL), Upton, NY (United States); Ma, L. [Brookhaven National Lab. (BNL), Upton, NY (United States); Tilp, A. [Brookhaven National Lab. (BNL), Upton, NY (United States); Wagener, R. [Brookhaven National Lab. (BNL), Upton, NY (United States)

    2015-05-01

    The External Data Center (XDC) Operations Plan describes the activities performed to manage the XDC, located at Brookhaven National Laboratory (BNL), for the Department of Energy’s Atmospheric Radiation Measurement (ARM) Climate Research Facility. It includes all ARM infrastructure activities performed by the Data Management and Software Engineering Group (DMSE) at BNL. This plan establishes a baseline of expectation within the ARM Operations Management for the group managing the XDC.

  5. Smart facility location planning for Smart Cities: using GIS technology and facility provision standards for pro-active planning of social facilities to support smart growth

    CSIR Research Space (South Africa)

    Green, Chéri

    2016-08-01

    Full Text Available This paper describes a rational approach to the planning of social facility provision to eradicate service backlogs of the current period as well as preparing for the future. For more than a decade a GIS based methodology has been used in South...

  6. 76 FR 60390 - Irradiation Treatment; Location of Facilities in the Southern United States

    Science.gov (United States)

    2011-09-29

    ... for the irradiation treatment of certain imported fruit from India and Thailand upon arrival in the..., and to enforce the provisions of the customs and navigation laws in force. \\3\\ Commuting area would be... over nuclear facilities and materials. Irradiation of Fruits From India and Thailand Currently, the...

  7. An Integrated Assessment of Location-Dependent Scaling for Microalgae Biofuel Production Facilities

    Energy Technology Data Exchange (ETDEWEB)

    Coleman, Andre M.; Abodeely, Jared; Skaggs, Richard; Moeglein, William AM; Newby, Deborah T.; Venteris, Erik R.; Wigmosta, Mark S.

    2014-07-01

    Successful development of a large-scale microalgae-based biofuels industry requires comprehensive analysis and understanding of the feedstock supply chain—from facility siting/design through processing/upgrading of the feedstock to a fuel product. The evolution from pilot-scale production facilities to energy-scale operations presents many multi-disciplinary challenges, including a sustainable supply of water and nutrients, operational and infrastructure logistics, and economic competitiveness with petroleum-based fuels. These challenges are addressed in part by applying the Integrated Assessment Framework (IAF)—an integrated multi-scale modeling, analysis, and data management suite—to address key issues in developing and operating an open-pond facility by analyzing how variability and uncertainty in space and time affect algal feedstock production rates, and determining the site-specific “optimum” facility scale to minimize capital and operational expenses. This approach explicitly and systematically assesses the interdependence of biofuel production potential, associated resource requirements, and production system design trade-offs. The IAF was applied to a set of sites previously identified as having the potential to cumulatively produce 5 billion-gallons/year in the southeastern U.S. and results indicate costs can be reduced by selecting the most effective processing technology pathway and scaling downstream processing capabilities to fit site-specific growing conditions, available resources, and algal strains.

  8. MRS/IS facility co-located with a repository: preconceptual design and life-cycle cost estimates

    Energy Technology Data Exchange (ETDEWEB)

    Smith, R.I.; Nesbitt, J.F.

    1982-11-01

    A program is described to examine the various alternatives for monitored retrievable storage (MRS) and interim storage (IS) of spent nuclear fuel, solidified high-level waste (HLW), and transuranic (TRU) waste until appropriate geologic repository/repositories are available. The objectives of this study are: (1) to develop a preconceptual design for an MRS/IS facility that would become the principal surface facility for a deep geologic repository when the repository is opened, (2) to examine various issues such as transportation of wastes, licensing of the facility, and environmental concerns associated with operation of such a facility, and (3) to estimate the life cycle costs of the facility when operated in response to a set of scenarios which define the quantities and types of waste requiring storage in specific time periods, which generally span the years from 1990 until 2016. The life cycle costs estimated in this study include: the capital expenditures for structures, casks and/or drywells, storage areas and pads, and transfer equipment; the cost of staff labor, supplies, and services; and the incremental cost of transporting the waste materials from the site of origin to the MRS/IS facility. Three scenarios are examined to develop estimates of life cycle costs of the MRS/IS facility. In the first scenario, HLW canisters are stored, starting in 1990, until the co-located repository is opened in the year 1998. Additional reprocessing plants and repositories are placed in service at various intervals. In the second scenario, spent fuel is stored, starting in 1990, because the reprocessing plants are delayed in starting operations by 10 years, but no HLW is stored because the repositories open on schedule. In the third scenario, HLW is stored, starting in 1990, because the repositories are delayed 10 years, but the reprocessing plants open on schedule.

  9. Approximate Nearest Neighbor Queries among Parallel Segments

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias

    2010-01-01

    We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...

  10. Innovative Solid State Lighting Replacements for Industrial and Test Facility Locations Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The proposed effort will develop a solid-state LED replacement lamp for rocket engine test stand lighting and more general hazardous-location lighting. The LED...

  11. 基于失效情景的应急设施选址问题%Emergency Facility Location Problem Based on the Facility Failure Scenarios

    Institute of Scientific and Technical Information of China (English)

    张敏; 黄钧; 朱建明

    2012-01-01

    非常规突发事件巨大的破坏力以及发生时间、地点和规模的不确定性,使应急系统内设施有可能被破坏而失效,因此选址时必须考虑设施失效情景的发生.给出以最大限度覆盖用户需求为目标,基于失效设施数目具有不确定性情景的设施选址双层随机规划模型;通过计算模型上下界,给出减小规模的等价模型,降低了双层规划求解难度;最后实验验证了模型的合理性,并给出新增选址方案.%The facility in the emergency system is possible to be out of work because of the huge destructive power of the irregular emergency and the uncertainty of the time, place and scale of occurrence, so facility failure scenarios must be considered at the time of location. In this paper, the bi-level stochastic programming location model is proposed which target is covering the demand of the customers maximally on the basis of defining the facility uncertain failure scenarios. The equivalence model with reducing scale is given through calculating the upper bound and lower bound of the model and the difficulty for solving the bi-level stochastic programming model is lowered. Lastly, the rationality of the model is proved by the test and the new additional location scheme is given.

  12. 基于 SpaceTwist 的 k-匿名增量近邻查询位置隐私保护算法%SpaceTwist-based k-anonymity incremental nearest neighbor query algorithm for location privacy protection

    Institute of Scientific and Technical Information of China (English)

    胡德敏; 郑霞

    2016-01-01

    随着移动网络的持续进步,基于位置的服务在日常生活中被广泛应用,同时位置隐私保护也成为广大用户所关注的焦点。基于 SpaceTwist 和 k-匿名算法,结合路网环境提出一种新的位置隐私保护方法。该方法摆脱第三方可信匿名器,采用客户—服务器体系结构,根据用户的位置隐私需求结合用户所在路网环境设计出用户端匿名区生成算法,并且保证 k-匿名。用户端以该匿名区请求基于位置的服务,服务器根据用户请求返回检索点并满足用户期望的 K 近邻结果。根据不同的路网环境和用户隐私需求进行大量实验,证明该算法在满足用户基于位置服务需求的同时提高了对用户位置隐私的保护。%With continued advances in mobile Internet,the location-based services are widely used in daily life,more and more users focus on the location privacy protection.This paper proposed a new location privacy protection scheme which com-bined with the network environment and based on the SpaceTwist algorithm and k-anonymity algorithm.The approach prefered to client-server structure rather than trusted third party server and designed the anonymity algorithm in user end according to user’s request of location privacy and the network environment,which ensured the k-anonymity.The mobile end users could request the location-based services in its anonymous area,and the server would return the access points to meet user’s expect K-value.Finally,it evaluated the proposed approach by a large number of experiments according to different network environ-ment together with different users privacy needs.The results demonstrate this algorithm meets the user’s requests of location-based services and at the same time it improves the protection of user’s location privacy.

  13. Facility Location Using Maximum Covering Model: An Application In Retail Sector

    Directory of Open Access Journals (Sweden)

    Çiğdem Alabaş Uslu

    2012-06-01

    Full Text Available In this study, a store location problem has been addressed for service sector, and a real application problem for a leading firm in modern retail sector in Turkey has been solved by modeling with mathematical programming. Since imitating a store location in retail sector is hard and provides an important competitive edge, determining accurate store locations becomes a critical issue for the management. Application problem solved in this study is to choose appropriate areas for opening stores with different capacities and quantities in Umraniye, Istanbul. The problem has been converted to a maximum set covering model by considering after sales forecasts and also by taking into account several decision criteria foreseen by the management. Optimum solutions of the developed model for different scenarios has been obtained using a package program and presented to the firm management.

  14. Nearest Neighbour Corner Points Matching Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Changlong

    2015-01-01

    Full Text Available Accurate detection towards the corners plays an important part in camera calibration. To deal with the instability and inaccuracies of present corner detection algorithm, the nearest neighbour corners match-ing detection algorithms was brought forward. First, it dilates the binary image of the photographed pictures, searches and reserves quadrilateral outline of the image. Second, the blocks which accord with chess-board-corners are classified into a class. If too many blocks in class, it will be deleted; if not, it will be added, and then let the midpoint of the two vertex coordinates be the rough position of corner. At last, it precisely locates the position of the corners. The Experimental results have shown that the algorithm has obvious advantages on accuracy and validity in corner detection, and it can give security for camera calibration in traffic accident measurement.

  15. A Novel Hierarchical Model to Locate Health Care Facilities with Fuzzy Demand Solved by Harmony Search Algorithm

    Directory of Open Access Journals (Sweden)

    Mehdi Alinaghian

    2014-08-01

    Full Text Available In the field of health losses resulting from failure to establish the facilities in a suitable location and the required number, beyond the cost and quality of service will result in an increase in mortality and the spread of diseases. So the facility location models have special importance in this area. In this paper, a successively inclusive hierarchical model for location of health centers in term of the transfer of patients from a lower level to a higher level of health centers has been developed. Since determination the exact number of demand for health care in the future is difficult and in order to make the model close to the real conditions of demand uncertainty, a fuzzy programming model based on credibility theory is considered. To evaluate the proposed model, several numerical examples are solved in small size. In order to solve large scale problems, a meta-heuristic algorithm based on harmony search algorithm was developed in conjunction with the GAMS software which indicants the performance of the proposed algorithm.

  16. Evaluation of the location and recency of faulting near prospective surface facilities in Midway Valley, Nye County, Nevada

    Energy Technology Data Exchange (ETDEWEB)

    Swan, F.H.; Wesling, J.R.; Angell, M.M.; Thomas, A.P.; Whitney, J.W.; Gibson, J.D.

    2002-01-17

    Evaluation of surface faulting that may pose a hazard to prospective surface facilities is an important element of the tectonic studies for the potential Yucca Mountain high-level radioactive waste repository in southwestern Nevada. For this purpose, a program of detailed geologic mapping and trenching was done to obtain surface and near-surface geologic data that are essential for determining the location and recency of faults at a prospective surface-facilities site located east of Exile Hill in Midway Valley, near the eastern base of Yucca Mountain. The dominant tectonic features in the Midway Valley area are the north- to northeast-trending, west-dipping normal faults that bound the Midway Valley structural block-the Bow Ridge fault on the west side of Exile Hill and the Paint-brush Canyon fault on the east side of the valley. Trenching of Quaternary sediments has exposed evidence of displacements, which demonstrate that these block-bounding faults repeatedly ruptured the surface during the middle to late Quaternary. Geologic mapping, subsurface borehole and geophysical data, and the results of trenching activities indicate the presence of north- to northeast-trending faults and northwest-trending faults in Tertiary volcanic rocks beneath alluvial and colluvial sediments near the prospective surface-facilities site. North to northeast-trending faults include the Exile Hill fault along the eastern base of Exile Hill and faults to the east beneath the surficial deposits of Midway Valley. These faults have no geomorphic expression, but two north- to northeast-trending zones of fractures exposed in excavated profiles of middle to late Pleistocene deposits at the prospective surface-facilities site appear to be associated with these faults. Northwest-trending faults include the West Portal and East Portal faults, but no disruption of Quaternary deposits by these faults is evident. The western zone of fractures is associated with the Exile Hill fault. The eastern

  17. Evaluation of the Location and Recency of Faulting Near Prospective Surface Facilities in Midway Valley, Nye County, Nevada

    Science.gov (United States)

    Swan, F.H.; Wesling, J.R.; Angell, M.M.; Thomas, A.P.; Whitney, J.W.; Gibson, J.D.

    2001-01-01

    Evaluation of surface faulting that may pose a hazard to prospective surface facilities is an important element of the tectonic studies for the potential Yucca Mountain high-level radioactive waste repository in southwestern Nevada. For this purpose, a program of detailed geologic mapping and trenching was done to obtain surface and near-surface geologic data that are essential for determining the location and recency of faults at a prospective surface-facilities site located east of Exile Hill in Midway Valley, near the eastern base of Yucca Mountain. The dominant tectonic features in the Midway Valley area are the north- to northeast-trending, west-dipping normal faults that bound the Midway Valley structural block-the Bow Ridge fault on the west side of Exile Hill and the Paint-brush Canyon fault on the east side of the valley. Trenching of Quaternary sediments has exposed evidence of displacements, which demonstrate that these block-bounding faults repeatedly ruptured the surface during the middle to late Quaternary. Geologic mapping, subsurface borehole and geophysical data, and the results of trenching activities indicate the presence of north- to northeast-trending faults and northwest-trending faults in Tertiary volcanic rocks beneath alluvial and colluvial sediments near the prospective surface-facilities site. North to northeast-trending faults include the Exile Hill fault along the eastern base of Exile Hill and faults to the east beneath the surficial deposits of Midway Valley. These faults have no geomorphic expression, but two north- to northeast-trending zones of fractures exposed in excavated profiles of middle to late Pleistocene deposits at the prospective surface-facilities site appear to be associated with these faults. Northwest-trending faults include the West Portal and East Portal faults, but no disruption of Quaternary deposits by these faults is evident. The western zone of fractures is associated with the Exile Hill fault. The eastern

  18. Pruning nearest neighbor cluster trees

    CERN Document Server

    Kpotufe, Samory

    2011-01-01

    Nearest neighbor (k-NN) graphs are widely used in machine learning and data mining applications, and our aim is to better understand what they reveal about the cluster structure of the unknown underlying distribution of points. Moreover, is it possible to identify spurious structures that might arise due to sampling variability? Our first contribution is a statistical analysis that reveals how certain subgraphs of a k-NN graph form a consistent estimator of the cluster tree of the underlying distribution of points. Our second and perhaps most important contribution is the following finite sample guarantee. We carefully work out the tradeoff between aggressive and conservative pruning and are able to guarantee the removal of all spurious cluster structures at all levels of the tree while at the same time guaranteeing the recovery of salient clusters. This is the first such finite sample result in the context of clustering.

  19. The nearest young moving groups

    CERN Document Server

    López-Santiago, J; Fernández-Figueroa, M J; Montes, D

    2006-01-01

    The latest results in the research of forming planetary systems have led several authors to compile a sample of candidates for searching for planets in the vicinity of the sun. Young stellar associations are indeed excellent laboratories for this study, but some of them are not close enough to allow the detection of planets through adaptive optics techniques. However, the existence of very close young moving groups can solve this problem. Here we have compiled the members of the nearest young moving groups, as well as a list of new candidates from our catalogue of late-type stars possible members of young stellar kinematic groups, studying their membership through spectroscopic and photometric criteria.

  20. GIS and Optimisation: Potential Benefits for Emergency Facility Location in Humanitarian Logistics

    Directory of Open Access Journals (Sweden)

    Oscar Rodríguez-Espíndola

    2016-03-01

    Full Text Available Floods are one of the most dangerous and common disasters worldwide, and these disasters are closely linked to the geography of the affected area. As a result, several papers in the academic field of humanitarian logistics have incorporated the use of Geographical Information Systems (GIS for disaster management. However, most of the contributions in the literature are using these systems for network analysis and display, with just a few papers exploiting the capabilities of GIS to improve planning and preparedness. To show the capabilities of GIS for disaster management, this paper uses raster GIS to analyse potential flooding scenarios and provide input to an optimisation model. The combination is applied to two real-world floods in Mexico to evaluate the value of incorporating GIS for disaster planning. The results provide evidence that including GIS analysis for a decision-making tool in disaster management can improve the outcome of disaster operations by reducing the number of facilities used at risk of flooding. Empirical results imply the importance of the integration of advanced remote sensing images and GIS for future systems in humanitarian logistics.

  1. Optimal Facility Location Model Based on Genetic Simulated Annealing Algorithm for Siting Urban Refueling Stations

    Directory of Open Access Journals (Sweden)

    Dawei Chen

    2015-01-01

    Full Text Available This paper analyzes the impact factors and principles of siting urban refueling stations and proposes a three-stage method. The main objective of the method is to minimize refueling vehicles’ detour time. The first stage aims at identifying the most frequently traveled road segments for siting refueling stations. The second stage focuses on adding additional refueling stations to serve vehicles whose demands are not directly satisfied by the refueling stations identified in the first stage. The last stage further adjusts and optimizes the refueling station plan generated by the first two stages. A genetic simulated annealing algorithm is proposed to solve the optimization problem in the second stage and the results are compared to those from the genetic algorithm. A case study is also conducted to demonstrate the effectiveness of the proposed method and algorithm. The results indicate the proposed method can provide practical and effective solutions that help planners and government agencies make informed refueling station location decisions.

  2. Location, Location, Location

    CERN Multimedia

    Clery, Daniel

    2007-01-01

    "When nations vie for massive international scientific facilities, science can take a back seat to politics and even sheer chance. Dealmakers say there's no magic formula for getting things right." (3 pages)

  3. Location, location, location

    CERN Multimedia

    Clery, Daniel

    2007-01-01

    "When nations vie for massive international scientific facilities, science can take a back seat to politics and even sheer chance. Dealmakers say there's no magic formula for getting things right." (4,5 pages)

  4. Prisons and Correctional Facilities, Located during MicroData field address collection 2004-2006. Kept in Spillman database for retrieval., Published in 2004, Vilas County Government.

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — Prisons and Correctional Facilities dataset current as of 2004. Located during MicroData field address collection 2004-2006. Kept in Spillman database for retrieval..

  5. Tire Processing Facilities, Location of motor vehicle inspection sites within Louisiana, Published in 2005, 1:24000 (1in=2000ft) scale, Louisiana State University.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Tire Processing Facilities dataset, published at 1:24000 (1in=2000ft) scale as of 2005. It is described as 'Location of motor vehicle inspection sites within...

  6. Hybrid k -Nearest Neighbor Classifier.

    Science.gov (United States)

    Yu, Zhiwen; Chen, Hantao; Liuxs, Jiming; You, Jane; Leung, Hareton; Han, Guoqiang

    2016-06-01

    Conventional k -nearest neighbor (KNN) classification approaches have several limitations when dealing with some problems caused by the special datasets, such as the sparse problem, the imbalance problem, and the noise problem. In this paper, we first perform a brief survey on the recent progress of the KNN classification approaches. Then, the hybrid KNN (HBKNN) classification approach, which takes into account the local and global information of the query sample, is designed to address the problems raised from the special datasets. In the following, the random subspace ensemble framework based on HBKNN (RS-HBKNN) classifier is proposed to perform classification on the datasets with noisy attributes in the high-dimensional space. Finally, the nonparametric tests are proposed to be adopted to compare the proposed method with other classification approaches over multiple datasets. The experiments on the real-world datasets from the Knowledge Extraction based on Evolutionary Learning dataset repository demonstrate that RS-HBKNN works well on real datasets, and outperforms most of the state-of-the-art classification approaches.

  7. Executive Order 12898 and Social, Economic, and Sociopolitical Factors Influencing Toxic Release Inventory Facility Location in EPA Region 6: A Multi-Scale Spatial Assessment of Environmental Justice

    Science.gov (United States)

    Moore, Andrea Lisa

    2013-01-01

    Toxic Release Inventory facilities are among the many environmental hazards shown to create environmental inequities in the United States. This project examined four factors associated with Toxic Release Inventory, specifically, manufacturing facility location at multiple spatial scales using spatial analysis techniques (i.e., O-ring statistic and…

  8. Executive Order 12898 and Social, Economic, and Sociopolitical Factors Influencing Toxic Release Inventory Facility Location in EPA Region 6: A Multi-Scale Spatial Assessment of Environmental Justice

    Science.gov (United States)

    Moore, Andrea Lisa

    2013-01-01

    Toxic Release Inventory facilities are among the many environmental hazards shown to create environmental inequities in the United States. This project examined four factors associated with Toxic Release Inventory, specifically, manufacturing facility location at multiple spatial scales using spatial analysis techniques (i.e., O-ring statistic and…

  9. D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    Science.gov (United States)

    Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.

    2016-06-01

    Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  10. Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

    Science.gov (United States)

    Bagherinejad, Jafar; Niknam, Azar

    2017-06-01

    In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.

  11. Secure Nearest Neighbor Query on Crowd-Sensing Data.

    Science.gov (United States)

    Cheng, Ke; Wang, Liangmin; Zhong, Hong

    2016-09-22

    Nearest neighbor queries are fundamental in location-based services, and secure nearest neighbor queries mainly focus on how to securely and quickly retrieve the nearest neighbor in the outsourced cloud server. However, the previous big data system structure has changed because of the crowd-sensing data. On the one hand, sensing data terminals as the data owner are numerous and mistrustful, while, on the other hand, in most cases, the terminals find it difficult to finish many safety operation due to computation and storage capability constraints. In light of they Multi Owners and Multi Users (MOMU) situation in the crowd-sensing data cloud environment, this paper presents a secure nearest neighbor query scheme based on the proxy server architecture, which is constructed by protocols of secure two-party computation and secure Voronoi diagram algorithm. It not only preserves the data confidentiality and query privacy but also effectively resists the collusion between the cloud server and the data owners or users. Finally, extensive theoretical and experimental evaluations are presented to show that our proposed scheme achieves a superior balance between the security and query performance compared to other schemes.

  12. Secure Nearest Neighbor Query on Crowd-Sensing Data

    Directory of Open Access Journals (Sweden)

    Ke Cheng

    2016-09-01

    Full Text Available Nearest neighbor queries are fundamental in location-based services, and secure nearest neighbor queries mainly focus on how to securely and quickly retrieve the nearest neighbor in the outsourced cloud server. However, the previous big data system structure has changed because of the crowd-sensing data. On the one hand, sensing data terminals as the data owner are numerous and mistrustful, while, on the other hand, in most cases, the terminals find it difficult to finish many safety operation due to computation and storage capability constraints. In light of they Multi Owners and Multi Users (MOMU situation in the crowd-sensing data cloud environment, this paper presents a secure nearest neighbor query scheme based on the proxy server architecture, which is constructed by protocols of secure two-party computation and secure Voronoi diagram algorithm. It not only preserves the data confidentiality and query privacy but also effectively resists the collusion between the cloud server and the data owners or users. Finally, extensive theoretical and experimental evaluations are presented to show that our proposed scheme achieves a superior balance between the security and query performance compared to other schemes.

  13. 层次型应急设施布局模型及其应用%Hierarchical Emergency Facility Location Model and Its Application

    Institute of Scientific and Technical Information of China (English)

    王铮; 廖悲雨; 隋文娟

    2011-01-01

    应急设施的特殊性决定了应急设施布局作为特殊的设施布局问题,必须更加注重及时性。应急服务的级别决定应急布局模型的考虑因素,现实中往往同时布局多个层次的应急设施,本文基于一个P-中心重心的混合模型,建立了层次型应急设施布局模型。根据应急服务的真实情况,该模型对距离的测算进行了改进,以交通网络距离代替欧氏距离。最后,将其应用于上海市上海某区的医疗设施布局。%The particularity of emergency facilities determines that emergency facility location, as a special type of facility location problem, must pay more attention to timeliness. According to the levels of emergency services, different factors are taken into account when modeling emergency facility location. Actually, there are often several levels of emergency facilities in our real life. This article proposes a hierarchical emergency facility location model based on a hybrid model of p -center and p -median model, in which a p - center model is applied to the lower level services and a p -median model is applied to the higher level services. In accordance with the real situation of emergency services, this model improves the distance measurement by replacing the Euclidean distance with transport network distance. Finally, the hierarchical emergency facility location model is applied to the medical facilities location in Putuo District of Shanghai.

  14. Monitoring nearest neighbor queries with cache strategies

    Institute of Scientific and Technical Information of China (English)

    PAN Peng; LU Yan-sheng

    2007-01-01

    The problem of continuously monitoring multiple K-nearest neighbor (K-NN) queries with dynamic object and query dataset is valuable for many location-based applications. A practical method is to partition the data space into grid cells, with both object and query table being indexed by this grid structure, while solving the problem by periodically joining cells of objects with queries having their influence regions intersecting the cells. In the worst case, all cells of objects will be accessed once. Object and query cache strategies are proposed to further reduce the I/O cost. With object cache strategy, queries remaining static in current processing cycle seldom need I/O cost, they can be returned quickly. The main I/O cost comes from moving queries, the query cache strategy is used to restrict their search-regions, which uses current results of queries in the main memory buffer. The queries can share not only the accessing of object pages, but also their influence regions. Theoretical analysis of the expected I/O cost is presented, with the I/O cost being about 40% that of the SEA-CNN method in the experiment results.

  15. Airports and Airfields, Airstrip locations within Sedgwick County. Primary attributes include site number, location ID, facility type, effective date, air strip name, city name, latitude, longitude, and elevation., Published in 2008, 1:1200 (1in=100ft) scale, Sedgwick County Government.

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — Airports and Airfields dataset current as of 2008. Airstrip locations within Sedgwick County. Primary attributes include site number, location ID, facility type,...

  16. Location, location, location

    NARCIS (Netherlands)

    Anderson, S.P.; Goeree, J.K.; Ramer, R.

    1997-01-01

    We analyze the canonical location-then-price duopoly game with general log- concave consumer densities. A unique pure-strategy equilibrium to the two-stage game exists if the density is not "too asymmetric" and not "too concave." These criteria are satisfied by many commonly used densities. Equilibr

  17. Nearest Neighbor Queries in Road Networks

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Kolar, Jan; Pedersen, Torben Bach

    2003-01-01

    With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries for query and data objects that are moving...... for the nearest neighbor search in the prototype is presented in detail. In addition, the paper reports on results from experiments with the prototype system....

  18. 可变吸引力竞争选址模型与算法研究%Competitive Facility Location Models and Algrithms Based on Variable Attractiveness

    Institute of Scientific and Technical Information of China (English)

    陈中武; 张宗祥

    2013-01-01

    Based on Huff's gravity rule,we consider the competitive facility location problem in which new facilities have to be located by a new market entrant firm to compete against already existing facilities that may belong to one or more competitors.We assume that the probability of customers patronize a facility is proportional to the facility attractiveness and inversely proportional to the distance between them.The objective is to determine the locations of the new facilities and their attractiveness levels so as to maximize the profit.We formulate a mixed-integer nonlinear programming model and try to.Numerical experiments on randomly generated instances demonstrate the effectiveness of the method%结合Huff重力模型,考虑了市场存在一个或多个竞争对手情形下的新设施竞争选址模型.假设顾客访问设施的概率与设施吸引力成正比,与设施同需求点的距离成反比.企业通过确定新设施的选址位置和设施的吸引力水平来追求利润最大化.建立了混合整数非线性规划模型并设计算法进行求解.并通过随机算例验证了算法的有效性.

  19. The effect of location and facility demand on the marginal cost of delivered wood chips from energy crops: A case study of the state of Tennessee

    Energy Technology Data Exchange (ETDEWEB)

    Graham, R.L.; Liu, W.; Downing, M. [Oak Ridge National Lab., TN (United States). Biofuels Feedstock Development Program; Noon, C.; Daly, M. [Univ. of Tennessee, Knoxville, TN (United States). Management Science Program; Moore, A. [Dept. of Trade and Industry, Harwell (United Kingdom). Energy Technology Support Unit

    1995-12-31

    Cost-supply curves for delivered wood chips from short rotation woody crops were calculated for 21 regularly-spaced locations spanning the state of Tennessee. These curves were used to systematically evaluate the combined effects of location and facility demand on wood chip feedstock costs in Tennessee. The cost-supply curves were developed using BRAVO, a GIS-based decision support system which calculates marginal cost of delivering wood chips to a specific location given road network maps and maps of farmgate prices and supplies of woody chips from short rotation energy crops. Marginal costs of delivered chips varied by both facility location in the state and facility demand. Marginal costs were lowest in central Tennessee unless the facility demand was greater than 2.7 million dry Mg per year (3 million dry tons per year) in which case west Tennessee was the lowest cost region. Marginal costs rose rapidly with increasing facility demand in the mountainous eastern portion of the state. Transportation costs accounted for 18 to 29% of the delivered cost and ranged between $8 and $18/dry Mg ($7 and $16/dry ton). Reducing the expected farmer participation rate from 100% to 50% or 25% dramatically raised the marginal costs of feedstock supply in the east and central regions of the state. The analysis demonstrates the need to use geographically-specific information when projecting the potential costs and supplies of biomass feedstock.

  20. 限制设施选址问题的近似算法%Approximation algorithm for limited facility location problem

    Institute of Scientific and Technical Information of China (English)

    刘玉堂; 方奇志

    2013-01-01

    提出了设施选址问题的一个新变体—限制设施选址问题,给出了一个基于随机线性规划舍入的近似算法,并分析了算法的近似度.%The paper presented an approximation algorithm for the Limited Facility Location problem (LFL), which is a new variant of the classical Uncapacitated Facility Location problem(UFL). The algorithm is based on randomized LP rounding, and its approximation ratio was analyzed.

  1. Park Facilities, Park Facility point locations within Iredell County, NC, Published in 2009, 1:2400 (1in=200ft) scale, Iredell County GIS.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Park Facilities dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Orthoimagery information as of 2009. It is described as 'Park...

  2. Fast and accurate hashing via iterative nearest neighbors expansion.

    Science.gov (United States)

    Jin, Zhongming; Zhang, Debing; Hu, Yao; Lin, Shiding; Cai, Deng; He, Xiaofei

    2014-11-01

    Recently, the hashing techniques have been widely applied to approximate the nearest neighbor search problem in many real applications. The basic idea of these approaches is to generate binary codes for data points which can preserve the similarity between any two of them. Given a query, instead of performing a linear scan of the entire data base, the hashing method can perform a linear scan of the points whose hamming distance to the query is not greater than rh , where rh is a constant. However, in order to find the true nearest neighbors, both the locating time and the linear scan time are proportional to O(∑i=0(rh)(c || i)) ( c is the code length), which increase exponentially as rh increases. To address this limitation, we propose a novel algorithm named iterative expanding hashing in this paper, which builds an auxiliary index based on an offline constructed nearest neighbor table to avoid large rh . This auxiliary index can be easily combined with all the traditional hashing methods. Extensive experimental results over various real large-scale datasets demonstrate the superiority of the proposed approach.

  3. Lattice gas with nearest- and next-to-nearest-neighbor exclusion

    NARCIS (Netherlands)

    X. Feng; H.W.J. Blöte; B. Nienhuis

    2011-01-01

    We investigate a hard-square lattice gas on the square lattice by means of transfer-matrix and Monte Carlo methods. The size of the hard squares is equal to two lattice constants, so the simultaneous occupation of nearest-neighbor sites as well as of next-to-nearest-neighbor sites is excluded. Near

  4. Integrating cut-and-solve and semi-Lagrangean based dual ascent for the single-source capacitated facility location problem

    DEFF Research Database (Denmark)

    Gadegaard, Sune Lauth

    This paper describes how the cut-and-solve framework and semi-Lagrangean based dual ascent algorithms can be integrated in two natural ways in order to solve the single source capacitated facility location problem. The first uses the cut-and-solve framework both as a heuristic and as an exact sol...

  5. Branch and bound algorithm for the uncapacitated facility location problem%无容量限制设施选址问题的分支定界法

    Institute of Scientific and Technical Information of China (English)

    李翼; 赵茂先; 李岳佳

    2012-01-01

    设施选址问题是经典的优化问题.一个好的选址方法可以有效节省费用,促进生产和消费的协调与配合,使得设施系统平衡发展.企业的优势和公共设施的盈利能力同样依赖于设施的选址结果.介绍了无容量限制的设施选址问题,给出了该问题的数学模型,提出了解决此问题的一个精确算法———分支定界法,最后通过一个算例说明了算法的有效性.%Facility location problems are classical optimization problems.A good location method can save money efficiently,promote the coordination of production and consumption and obtain the balanced development of facility system.The competitive advantage of firms and the profitability of public facilities depend on the results of these locations.In this paper,uncapacitated facility location problem is introduced.We give a branch and bound method,which is an exact algorithm to solve this problem.Numerical examples illustrate this approach.

  6. Integrating cut-and-solve and semi-Lagrangean based dual ascent for the single-source capacitated facility location problem

    DEFF Research Database (Denmark)

    Gadegaard, Sune Lauth

    This paper describes how the cut-and-solve framework and semi-Lagrangean based dual ascent algorithms can be integrated in two natural ways in order to solve the single source capacitated facility location problem. The first uses the cut-and-solve framework both as a heuristic and as an exact...

  7. Unsupervised K-Nearest Neighbor Regression

    CERN Document Server

    Kramer, Oliver

    2011-01-01

    In many scientific disciplines structures in high-dimensional data have to be found, e.g., in stellar spectra, in genome data, or for face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regression framework for learning of low-dimensional manifolds. Similar to related approaches that are mostly based on kernel methods, unsupervised K-nearest neighbor (UKNN) regression optimizes latent variables w.r.t. the data space reconstruction error employing the K-nearest neighbor heuristic. The problem of optimizing latent neighborhoods is difficult to solve, but the UKNN formulation allows an efficient strategy of iteratively embedding latent points to fixed neighborhood topologies. The approaches will be tested experimentally.

  8. Lectures on the nearest neighbor method

    CERN Document Server

    Biau, Gérard

    2015-01-01

    This text presents a wide-ranging and rigorous overview of nearest neighbor methods, one of the most important paradigms in machine learning. Now in one self-contained volume, this book systematically covers key statistical, probabilistic, combinatorial and geometric ideas for understanding, analyzing and developing nearest neighbor methods. Gérard Biau is a professor at Université Pierre et Marie Curie (Paris). Luc Devroye is a professor at the School of Computer Science at McGill University (Montreal).   .

  9. Approximate Nearest Neighbor Search through Comparisons

    CERN Document Server

    Tschopp, Dominique

    2009-01-01

    This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects. In contrast with most existing approaches, we can only access the ``hidden'' space in which the objects live through a similarity oracle. The oracle, given two reference objects and a query object, returns the reference object closest to the query object. The oracle attempts to model the behavior of human users, capable of making statements about similarity, but not of assigning meaningful numerical values to distances between objects.

  10. The relationship between the location of pediatric intensive care unit facilities and child death from trauma: a county-level ecologic study.

    Science.gov (United States)

    Odetola, Folafoluwa O; Miller, William C; Davis, Matthew M; Bratton, Susan L

    2005-07-01

    To describe the relationship between the location of Pediatric Intensive Care Unit (PICU) facilities and county-level child death from trauma in the contiguous USA. We conducted a cross-sectional ecologic study using county-level data on death due to trauma in children 0 to 14 years of age from 1996 to 1998. These data were linked to 1997 county-level data on availability of PICU facilities. In 1997, PICU facilities were present in 9% of USA counties. There were 18,337 childhood deaths from trauma in the study period. The presence of PICU facilities in a county was associated with lower mortality from trauma (incidence rate ratio [IRR] = 0.72; 95% CI 0.67-0.78) compared to counties without PICU facilities. After controlling for residence in rural and low-income counties, and the presence of adult medicosurgical intensive care units, the presence of PICU facilities in a county remained associated with lower rates of death from trauma (IRR = 0.82; 95% CI 0.75-0.89). The presence of PICU facilities is related to lower mortality rates due to traumatic injuries at the county level. This finding may reflect the concentration of pediatric subspecialty care in counties with PICUs. This association merits further study with individual-level observations.

  11. 3D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure

    DEFF Research Database (Denmark)

    Suhaibah, A.; Uznir, U.; Antón Castro, Francesc/François

    2016-01-01

    , with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our...... findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results...... of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However...

  12. Facilities & Leadership

    Data.gov (United States)

    Department of Veterans Affairs — The facilities web service provides VA facility information. The VA facilities locator is a feature that is available across the enterprise, on any webpage, for the...

  13. NIMBY, CLAMP, and the location of new nuclear-related facilities: U.S. national and 11 site-specific surveys.

    Science.gov (United States)

    Greenberg, Michael R

    2009-09-01

    Public and political opposition have made finding locations for new nuclear power plants, waste management, and nuclear research and development facilities a challenge for the U.S. government and the nuclear industry. U.S. government-owned properties that already have nuclear-related activities and commercial nuclear power generating stations are logical locations. Several studies and utility applications to the Nuclear Regulatory Commission suggest that concentrating locations at major plants (CLAMP) has become an implicit siting policy. We surveyed 2,101 people who lived within 50 miles of 11 existing major nuclear sites and 600 who lived elsewhere in the United States. Thirty-four percent favored CLAMP for new nuclear power plants, 52% for waste management facilities, and 50% for new nuclear laboratories. College educated, relatively affluent male whites were the strongest CLAMP supporters. They disproportionately trusted those responsible for the facilities and were not worried about existing nuclear facilities or other local environmental issues. Notably, they were concerned about continuing coal use. Not surprisingly, CLAMP proponents tended to be familiar with their existing local nuclear site. In short, likely CLAMP sites have a large and politically powerful core group to support a CLAMP policy. The challenge to proponents of nuclear technologies will be to sustain this support and expand the base among those who clearly are less connected and receptive to new nearby sites.

  14. The Central laser facility at the Pierre Auger Observatory

    Energy Technology Data Exchange (ETDEWEB)

    Arqueros, F.; Bellido, J.; Covault, C.; D' Urso, D.; Di Giulio, C.; Facal, P.; Fick, B.; Guarino, F.; Malek, M.; Matthews, J.A.J.; Matthews, J.; Meyhandan, R.; Monasor,; Mostafa, M.; Petrinca, P.; Roberts, M.; Sommers, P.; Travnicek, P.; Valore, L.; Verzi, V.; Wiencke, Lawrence; /Utah U.

    2005-07-01

    The Central Laser Facility is located near the middle of the Pierre Auger Observatory in Argentina. It features a UV laser and optics that direct a beam of calibrated pulsed light into the sky. Light scattered from this beam produces tracks in the Auger optical detectors which normally record nitrogen fluorescence tracks from cosmic ray air showers. The Central Laser Facility provides a ''test beam'' to investigate properties of the atmosphere and the fluorescence detectors. The laser can send light via optical fiber simultaneously to the nearest surface detector tank for hybrid timing analyses. We describe the facility and show some examples of its many uses.

  15. The Central Laser Facility at the Pierre Auger Observatory

    CERN Document Server

    Arqueros, F; Covault, C; D'Urso, D; Giulio, C D; Facal, P; Fick, B; Guarino, F; Malek, M; Matthews, J A J; Matthews, J; Meyhandan, R; Monasor, M; Mostafa, M; Petrinca, P; Roberts, M; Sommers, P; Travnicek, P; Valore, L; Verzi, V; Wiencke, L

    2005-01-01

    The Central Laser Facility is located near the middle of the Pierre Auger Observatory in Argentina. It features a UV laser and optics that direct a beam of calibrated pulsed light into the sky. Light scattered from this beam produces tracks in the Auger optical detectors which normally record nitrogen fluorescence tracks from cosmic ray air showers. The Central Laser Facility provides a "test beam" to investigate properties of the atmosphere and the fluorescence detectors. The laser can send light via optical fiber simultaneously to the nearest surface detector tank for hybrid timing analyses. We describe the facility and show some examples of its many uses.

  16. Combining Facility Location and Routing Decisions in Sustainable Urban Freight Distribution under Horizontal Collaboration: How Can Shippers Be Benefited?

    National Research Council Canada - National Science Library

    Hanan Ouhader; Malika El Kyal

    2017-01-01

      This article investigates the potential economic, environmental, and social effects of combining depot location and vehicle routing decisions in urban road freight transportation under horizontal collaboration...

  17. 停车换乘设施选址研究城市轨道交通%Studies on Park-and-Ride Facility Location for Transit

    Institute of Scientific and Technical Information of China (English)

    王显光; 任伟; 刘振国

    2013-01-01

    From viewpoint of two aspects of location and size of park-and-ride facility for urban rail transit, new and expanded projects shall take them into consideration. By using path-based user equilibrium assignment model and multi-mode assignment method, a model based on minimization of investment at park-and-ride facility location for city outskirts is established.%从选址和规模2方面考虑新建和扩建城市轨道交通停车换乘设施,采用基于路径的用户平衡配流模型和多方式配流方法,建立了基于投资最小化的城市外围停车换乘设施选址模型。

  18. Flow-Interception Facility Location Problem under Competitive Conditions%竞争环境下截流设施选址问题

    Institute of Scientific and Technical Information of China (English)

    申瑞玲; 霍佳震

    2013-01-01

      We consider a facility location model for locating a set of new facilities that compete for customer demand with each other, as well as with some pre-existing facilities both belong to the entity and the competitor , to capture the maximum profit of the entity.According to Huff gravity model, the probability that a customer se-lects a certain facility is proportional to its attractiveness and inversely proportional to the distance to the facility , we suppose the facility construction cost is relevant to its attractiveness , the problem is formulated as a non-linear integer program and solved by greedy algorithm .The numerical analysis indicates that the model and the method are practical.%  研究企业新建设施时,市场上已有设施存在的情况下,使本企业总体利润最大的截流设施选址问题。在一般截留设施选址模型的基础上引入引力模型,消费者到某个设施接受服务的概率与偏离距离及设施的吸引力相关,同时设施的建设费用与设施吸引力正相关,建立非线性整数规划模型并使用贪婪算法进行求解。数值分析表明,该算法求解速度快,模型计算精度较高。

  19. Locating, quantifying and characterising radiation hazards in contaminated nuclear facilities using a novel passive non-electrical polymer based radiation imaging device.

    Science.gov (United States)

    Stanley, S J; Lennox, K; Farfán, E B; Coleman, J R; Adamovics, J; Thomas, A; Oldham, M

    2012-06-01

    This paper provides a summary of recent trials which took place at the US Department of Energy Oak Ridge National Laboratory (ORNL) during December 2010. The overall objective for the trials was to demonstrate that a newly developed technology could be used to locate, quantify and characterise the radiological hazards within two separate ORNL hot cells (B and C). The technology used, known as RadBall(®), is a novel, passive, non-electrical polymer based radiation detection device which provides a 3D visualisation of radiation from areas where effective measurements have not been previously possible due to lack of access. This is particularly useful in the nuclear industry prior to the decommissioning of facilities where the quantity, location and type of contamination are often unknown. For hot cell B, the primary objective of demonstrating that the technology could be used to locate, quantify and characterise three radiological sources was met with 100% success. Despite more challenging conditions in hot cell C, two sources were detected and accurately located. To summarise, the technology performed extremely well with regards to detecting and locating radiation sources and, despite the challenging conditions, moderately well when assessing the relative energy and intensity of those sources. Due to the technology's unique deployability, non-electrical nature and its directional awareness the technology shows significant promise for the future characterisation of radiation hazards prior to and during the decommissioning of contaminated nuclear facilities.

  20. Location for new research facility determined X-ray laser XFEL to be realized in the federal states of Hamburg and Schleswig-Holstein starting in 2006

    CERN Multimedia

    2003-01-01

    "...The site for the XFEL has now been determined by the research center DESY (Deutsches Elektronen-Synchrotron); it was announced today at a press conference in Hamburg. The 3.3-kilometer-long facility is to be located in the federal states of Hamburg and Schleswig-Holstein. It will begin on the DESY site in Hamburg-Bahrenfeld and run in a north-western direction to the town of Schenefeld (district of Pinneberg), which borders on Hamburg" (1 page).

  1. Nonparametric k-nearest-neighbor entropy estimator.

    Science.gov (United States)

    Lombardi, Damiano; Pant, Sanjay

    2016-01-01

    A nonparametric k-nearest-neighbor-based entropy estimator is proposed. It improves on the classical Kozachenko-Leonenko estimator by considering nonuniform probability densities in the region of k-nearest neighbors around each sample point. It aims to improve the classical estimators in three situations: first, when the dimensionality of the random variable is large; second, when near-functional relationships leading to high correlation between components of the random variable are present; and third, when the marginal variances of random variable components vary significantly with respect to each other. Heuristics on the error of the proposed and classical estimators are presented. Finally, the proposed estimator is tested for a variety of distributions in successively increasing dimensions and in the presence of a near-functional relationship. Its performance is compared with a classical estimator, and a significant improvement is demonstrated.

  2. Nearest Neighbor Algorithms for Pattern Classification

    Science.gov (United States)

    Barrios, J. O.

    1972-01-01

    A solution of the discrimination problem is considered by means of the minimum distance classifier, commonly referred to as the nearest neighbor (NN) rule. The NN rule is nonparametric, or distribution free, in the sense that it does not depend on any assumptions about the underlying statistics for its application. The k-NN rule is a procedure that assigns an observation vector z to a category F if most of the k nearby observations x sub i are elements of F. The condensed nearest neighbor (CNN) rule may be used to reduce the size of the training set required categorize The Bayes risk serves merely as a reference-the limit of excellence beyond which it is not possible to go. The NN rule is bounded below by the Bayes risk and above by twice the Bayes risk.

  3. Modified nearest neighbor phase unwrapping algorithm

    Institute of Scientific and Technical Information of China (English)

    CHEN Jia-feng; CHEN Hai-qing; YANG Zhen-gang

    2006-01-01

    Phase unwrapping is so important in interferometry that it determines the veracity of the absolute phase value.Goldstein's branch-cut algorithm performs path-independent algorithm that uses a nearest neighbor heuristic to link and balance the residues based on identifying the residues.A modified nearest neighbor algorithm is presented based on the principle,the mathematic formula of the Goldstein's algorithm and in-depth analysis of the key problem of phase unwrapping.It not only holds the advantage of the Goldstein's algorithm but also solves the problem that the Goldstein's algorithm is incapable to be used at high residue densities.Therefore,it extends the application of the Goldstein's algorithm and enhances the precision of phase unwrapping.

  4. Dimensionality reduction with unsupervised nearest neighbors

    CERN Document Server

    Kramer, Oliver

    2013-01-01

    This book is devoted to a novel approach for dimensionality reduction based on the famous nearest neighbor method that is a powerful classification and regression approach. It starts with an introduction to machine learning concepts and a real-world application from the energy domain. Then, unsupervised nearest neighbors (UNN) is introduced as efficient iterative method for dimensionality reduction. Various UNN models are developed step by step, reaching from a simple iterative strategy for discrete latent spaces to a stochastic kernel-based algorithm for learning submanifolds with independent parameterizations. Extensions that allow the embedding of incomplete and noisy patterns are introduced. Various optimization approaches are compared, from evolutionary to swarm-based heuristics. Experimental comparisons to related methodologies taking into account artificial test data sets and also real-world data demonstrate the behavior of UNN in practical scenarios. The book contains numerous color figures to illustr...

  5. Injury crashes with bicyclists at roundabouts: influence of some location characteristics and the design of cycle facilities.

    Science.gov (United States)

    Daniels, Stijn; Brijs, Tom; Nuyts, Erik; Wets, Geert

    2009-01-01

    Previous research indicated that conversions of intersections into roundabouts appear to increase the number of injury crashes with bicyclists. However, it was assumed that the effectiveness of roundabouts could vary according to some differences in design types of cycle, facilities and other geometrical factors. Regression analyses on effectiveness-indices resulting from a before-and-after study of injury crashes with bicyclists at 90 roundabouts in Flanders, Belgium. Regarding all injury crashes with bicyclists, roundabouts with cycle lanes appear to perform significantly worse compared to three other design types (mixed traffic, separate cycle paths, and grade-separated cycle paths). Nevertheless, an increase of the severest crashes was noticed, regardless of the design type of the cycle facilities. Roundabouts that are replacing signal-controlled intersections seem to have had a worse evolution compared to roundabouts on other types of intersections. The results might affect design guidelines for roundabouts, particularly for the accommodation of bicyclists.

  6. 服务能力受损情景下的应急设施选址模型%Emergency facility location model under service ability damage scenarios

    Institute of Scientific and Technical Information of China (English)

    俞武扬

    2016-01-01

    考虑突发事件造成应急设施服务能力受损的情景,通过最大、最小临界覆盖距离定义应急设施对需求点的应急服务质量,在满足需求点最低服务质量和数量要求条件下,以最大化加权服务质量期望值为目标建立应急设施选址模型。设计了一种基于模拟退火的求解算法,通过对临界覆盖距离、最低服务质量要求、设施服务能力等参数的数值实验,表明了所提出模型与算法可为解决应急设施选址决策提供有益的参考。%Considering the scenarios that emergencies damage the service abilities of some emergency facilities, service quantities are defined, among emergency facilities and demand points, by using the maximum and minimum critical coverage distance. An emergency facility location model is established within the objective to maximizing overall service quality expectation while ensuring the minimum service quality and quantity requirements. In order to solve this model, an efficient algorithm is designed based on the simulated annealing algorithm. Numerical experiments on the number of emergency facilities, the critical coverage range, the minimum service quality are conducted, these results show that the proposed model and algorithm can give a useful reference for the decision of emergency facility location.

  7. Reasons patients leave their nearest healthcare service to attend Karen Park Clinic, Pretoria North

    Directory of Open Access Journals (Sweden)

    Agnes T. Masango- Makgobela

    2013-01-01

    Full Text Available Background: Many patients move from one healthcare provider or facility to another, disturbing the continuity that enhances holistic patient care.Objectives: To investigate the reasons given by patients for attending Karen Park Clinic rather than the clinic nearest to their homes.Methods: A cross-sectional descriptive study was conducted during 2010. Three hundred and fifty patients attending Karen Park Clinic were given questionnaires to complete, with the following variables: place of residence; previous attendance at the clinic nearest their home; services available at their nearest clinic; and their willingness to attend their nearest clinic in future.Results: Respondents were from Soshanguve (153; 43.7%, Mabopane (92; 26.3%, Garankuwa (29; 8.3% and Hebron (20; 5.7% and most were women (271; 77.4% aged 26–45 (177; 50.6%. Eighty per cent (281 of the patients had visited their nearest clinic previously and 54 of these (19.2% said they would not return. The reasons for this were: long waiting time (88; 25.1%; long queues (84; 24%; rude staff (60; 17%; and no medication (39; 11.1%.Conclusion: The majority of patients who had attended their nearest clinic were adamant that they would not return. It is necessary to reduce waiting times, thus reducing long queues. This can be achieved by having adequate, satisfied healthcare providers to render a quality service and by organising training for management. Patients can thus be redirected to their nearest clinic and the health centre’s capacity can be increased by procuring adequate drugs. There is a need to follow up on patients’ complaints about staff attitudes.

  8. Discovery of Nearest Known Brown Dwarf

    Science.gov (United States)

    2003-01-01

    Bright Southern Star Epsilon Indi Has Cool, Substellar Companion [1] Summary A team of European astronomers [2] has discovered a Brown Dwarf object (a 'failed' star) less than 12 light-years from the Sun. It is the nearest yet known. Now designated Epsilon Indi B, it is a companion to a well-known bright star in the southern sky, Epsilon Indi (now "Epsilon Indi A"), previously thought to be single. The binary system is one of the twenty nearest stellar systems to the Sun. The brown dwarf was discovered from the comparatively rapid motion across the sky which it shares with its brighter companion : the pair move a full lunar diameter in less than 400 years. It was first identified using digitised archival photographic plates from the SuperCOSMOS Sky Surveys (SSS) and confirmed using data from the Two Micron All Sky Survey (2MASS). Follow-up observations with the near-infrared sensitive SOFI instrument on the ESO 3.5-m New Technology Telescope (NTT) at the La Silla Observatory confirmed its nature and has allowed measurements of its physical properties. Epsilon Indi B has a mass just 45 times that of Jupiter, the largest planet in the Solar System, and a surface temperature of only 1000 °C. It belongs to the so-called 'T dwarf' category of objects which straddle the domain between stars and giant planets. Epsilon Indi B is the nearest and brightest T dwarf known. Future studies of the new object promise to provide astronomers with important new clues as to the formation and evolution of these exotic celestial bodies, at the same time yielding interesting insights into the border zone between planets and stars. TINY MOVING NEEDLES IN GIANT HAYSTACKS ESO PR Photo 03a/03 ESO PR Photo 03a/03 [Preview - JPEG: 400 x 605 pix - 92k [Normal - JPEG: 1200 x 1815 pix - 1.0M] Caption: PR Photo 03a/03 shows Epsilon Indi A (the bright star at far right) and its newly discovered brown dwarf companion Epsilon Indi B (circled). The upper image comes from one of the SuperCOSMOS Sky

  9. Integrating multi-criteria techniques with geographical information systems in waste facility location to enhance public participation.

    Science.gov (United States)

    Higgs, Gary

    2006-04-01

    Despite recent U.K. Government commitments' to encourage public participation in environmental decision making, those exercises conducted to date have been largely confined to 'traditional' modes of participation such as the dissemination of information and in encouraging feedback on proposals through, for example, questionnaires or surveys. It is the premise of this paper that participative approaches that use IT-based methods, based on combined geographical information systems (GIS) and multi-criteria evaluation techniques that could involve the public in the decision-making process, have the potential to build consensus and reduce disputes and conflicts such as those arising from the siting of different types of waste facilities. The potential of these techniques are documented through a review of the existing literature in order to highlight the opportunities and challenges facing decision makers in increasing the involvement of the public at different stages of the waste facility management process. It is concluded that there are important lessons to be learned by researchers, consultants, managers and decision makers if barriers hindering the wider use of such techniques are to be overcome.

  10. Weighting of the k-Nearest-Neighbors

    DEFF Research Database (Denmark)

    Chernoff, Konstantin; Nielsen, Mads

    2010-01-01

    This paper presents two distribution independent weighting schemes for k-Nearest-Neighbors (kNN). Applying the first scheme in a Leave-One-Out (LOO) setting corresponds to performing complete b-fold cross validation (b-CCV), while applying the second scheme corresponds to performing bootstrapping...... in the limit of infinite iterations. We demonstrate that the soft kNN errors obtained through b-CCV can be obtained by applying the weighted kNN in a LOO setting, and that the proposed weighting schemes can decrease the variance and improve the generalization of kNN in a CV setting....

  11. Weighting of the k-Nearest-Neighbors

    DEFF Research Database (Denmark)

    Chernoff, Konstantin; Nielsen, Mads

    This paper presents two distribution independent weighting schemes for k-Nearest-Neighbors (kNN). Applying the first scheme in a Leave-One-Out (LOO) setting corresponds to performing complete b-fold cross validation (b-CCV), while applying the second scheme corresponds to performing bootstrapping...... in the limit of infinite iterations. We demonstrate that the soft kNN errors obtained through b-CCV can be obtained by applying the weighted kNN in a LOO setting, and that the proposed weighting schemes can decrease the variance and improve the generalization of kNN in a CV setting....

  12. 社区公共体育设施选址规划研究%Research on Facilities Location Planning of Community Sports

    Institute of Scientific and Technical Information of China (English)

    杜长亮; 顾校飞; 李南

    2016-01-01

    社区公共体育设施建设是一项重要的政府民生工程,近年来,“健身圈”建设的提出为各地体育设施的建设提供了指导。“健身圈”设施的公益性,使用需求的连续分布及无明确设施位置候选点,使得设施的选址不同于一般选址问题。基于经济性原则并保持体育设施地点不变,构造公平性和效率性的区位覆盖模型和设施选址组合模型,求解社区需新增最少设施点数量及其位置。运用GIS技术和K‐means划分聚类方法处理连续居民区离散化问题,提取需求点。通过对需求点进行缓冲区分析,优化设施位置候选点,构建设施选址网络。在模型求解方面,结合运用GIS技术和LINGO软件对选址模型进行求解。最后,以无锡市为例,进行应用研究,并以坐标和二维地图形式清晰形象地表达求解结果。%The construction of fitness circle of community sports is a government project .Its public property ,continuous distribution of demand and none‐identified candidate set of facility location make it different from other facility location problem .On the premise of keeping the current sports facilities in original places ,based on principles of economy ,fairness and efficien‐cy ,an improved LSCP model and an combined model were established to acquire the minimal quantity and location of new facilities ,which can fully cover the community residents ’ demand . GIS technology and cluster theory were applied to scatter the continuous demand so as to ex‐tract the discrete demand points .The candidate set of facility location was also obtained by the buffer analysis of demand points using GIS .Finally ,the network of facility location was built , and the LSCP and combined model were solved by GIS technology and LINGO software .After taking Wuxi city for example to research ,the location result was obtained in text and two‐di‐mension map format .

  13. Evolving edited k-nearest neighbor classifiers.

    Science.gov (United States)

    Gil-Pita, Roberto; Yao, Xin

    2008-12-01

    The k-nearest neighbor method is a classifier based on the evaluation of the distances to each pattern in the training set. The edited version of this method consists of the application of this classifier with a subset of the complete training set in which some of the training patterns are excluded, in order to reduce the classification error rate. In recent works, genetic algorithms have been successfully applied to determine which patterns must be included in the edited subset. In this paper we propose a novel implementation of a genetic algorithm for designing edited k-nearest neighbor classifiers. It includes the definition of a novel mean square error based fitness function, a novel clustered crossover technique, and the proposal of a fast smart mutation scheme. In order to evaluate the performance of the proposed method, results using the breast cancer database, the diabetes database and the letter recognition database from the UCI machine learning benchmark repository have been included. Both error rate and computational cost have been considered in the analysis. Obtained results show the improvement achieved by the proposed editing method.

  14. 基于工作负荷均衡的车辆拯救设施选址%Facility Location for Failure Rescuing Vehicles Considering Workload Equilibrium

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    交通事故车辆的拯救设施选址是车辆拯救服务的重要问题,选址不当易造成车辆拯救行业服务效率低下、市场行业的不规范、利益不均等一系列问题。针对这类问题,分析了俱乐部和政府引导两种服务模式下的拯救设施选址特点,并提出了针对车辆拯救的工作负荷概念。在不确定性救援路径行程时间条件下,建立以负荷均衡为目标的车辆拯救设施选址模型,以提高设施站点的运营效率和实现车辆拯救企业间的利益平衡。采用三种染色体形式的混合编码和随机模拟方法,设计基于遗传优化的求解算法。最后,通过仿真实例验证了算法的有效性。%Facility location is critical for failure vehicle rescuing during traffic accidents .Improper location of rescuing facilities may result in low service efficiency , unfair competition , and unequal interests between different service enterprises .Both the club-mode and the government dominated rescuing service modes are analyzed for those problems .Based on the definition of the workload equilibrium of rescuing service , the facility location model of vehicle rescuing is built up with consideration of uncertain travel time .The novel model aims to improve the operational efficiency of the rescuing facilities and balance the profits between enterprises for providing rescuing service .A hybrid coding method with three types of chromosomes and stochastic simulation technology are used , and an optimal algorithm based on genetic algorithm is designed for solving the proposed model .Lastly, a case study is used to show the effectiveness of the model and the corresponding algorithm .

  15. Park Facilities, Boundaries were determined from parcel mapping lines & site specific items, such as shelter locations, were obtained by field GPS observation, Published in 2010, Not Applicable scale, Chippewa County Government.

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — Park Facilities dataset current as of 2010. Boundaries were determined from parcel mapping lines & site specific items, such as shelter locations, were obtained...

  16. Lease Approval and Building Aid for Leased School Buildings and Facilities Located Off School Property (Pursuant to CR 155.8). Instruction Guide for Public School Districts Outside of New York City.

    Science.gov (United States)

    New York State Education Dept., Albany. Office of Facilities Planning.

    State regulations allow public school districts outside of New York City to apply for Building Aid on leasing costs involving instructional facilities for grades Pre-K through 12 located off school district property. This guide explains how the districts should proceed when applying for Building Aid on leased facilities. Attached is the…

  17. Tailoring the photon hopping by nearest and next-nearest-neighbour interaction in photonic arrays

    CERN Document Server

    Caselli, Niccolò; La China, Federico; Gerardino, Annamaria; Li, Lianhe; Linfield, Edmund H; Pagliano, Francesco; Fiore, Andrea; Intonti, Francesca; Gurioli, Massimo

    2015-01-01

    Arrays of photonic cavities are relevant structures for developing large-scale photonic integrated circuits and for investigating basic quantum electrodynamics phenomena, due to the photon hopping between interacting nanoresonators. Here, we investigate, by means of scanning near-field spectroscopy, numerical calculations and an analytical model, the role of different neighboring interactions that give rise to delocalized supermodes in different photonic crystal array configurations. The systems under investigation consist of three nominally identical two-dimensional photonic crystal nanocavities on membrane aligned along the two symmetry axes of the triangular photonic crystal lattice. We find that the nearest and next-nearest-neighbour coupling terms can be of the same relevance. In this case, a non-intuitive picture describes the resonant modes, and the photon hopping between adjacent nano-resonators is strongly affected. Our findings prove that exotic configurations and even post-fabrication engineering o...

  18. Frequency and Correlation of Nearest Neighboring Nucleotides in Human Genome

    Science.gov (United States)

    Jin, Neng-zhi; Liu, Zi-xian; Qiu, Wen-yuan

    2009-02-01

    Zipf's approach in linguistics is utilized to analyze the statistical features of frequency and correlation of 16 nearest neighboring nucleotides (AA, AC, AG, ..., TT) in 12 human chromosomes (Y, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, and 12). It is found that these statistical features of nearest neighboring nucleotides in human genome: (i) the frequency distribution is a linear function, and (ii) the correlation distribution is an inverse function. The coefficients of the linear function and inverse function depend on the GC content. It proposes the correlation distribution of nearest neighboring nucleotides for the first time and extends the descriptor about nearest neighboring nucleotides.

  19. Approximate nearest neighbors via dictionary learning

    Science.gov (United States)

    Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos

    2011-06-01

    Approximate Nearest Neighbors (ANN) in high dimensional vector spaces is a fundamental, yet challenging problem in many areas of computer science, including computer vision, data mining and robotics. In this work, we investigate this problem from the perspective of compressive sensing, especially the dictionary learning aspect. High dimensional feature vectors are seldom seen to be sparse in the feature domain; examples include, but not limited to Scale Invariant Feature Transform (SIFT) descriptors, Histogram Of Gradients, Shape Contexts, etc. Compressive sensing advocates that if a given vector has a dense support in a feature space, then there should exist an alternative high dimensional subspace where the features are sparse. This idea is leveraged by dictionary learning techniques through learning an overcomplete projection from the feature space so that the vectors are sparse in the new space. The learned dictionary aids in refining the search for the nearest neighbors to a query feature vector into the most likely subspace combination indexed by its non-zero active basis elements. Since the size of the dictionary is generally very large, distinct feature vectors are most likely to have distinct non-zero basis. Utilizing this observation, we propose a novel representation of the feature vectors as tuples of non-zero dictionary indices, which then reduces the ANN search problem into hashing the tuples to an index table; thereby dramatically improving the speed of the search. A drawback of this naive approach is that it is very sensitive to feature perturbations. This can be due to two possibilities: (i) the feature vectors are corrupted by noise, (ii) the true data vectors undergo perturbations themselves. Existing dictionary learning methods address the first possibility. In this work we investigate the second possibility and approach it from a robust optimization perspective. This boils down to the problem of learning a dictionary robust to feature

  20. Training a Neural Network Via Large-Eddy Simulation for Autonomous Location and Quantification of CH4 Leaks at Natural Gas Facilities

    Science.gov (United States)

    Sauer, J.; Travis, B. J.; Munoz-Esparza, D.; Dubey, M. K.

    2015-12-01

    Fugitive methane (CH4) leaks from oil and gas production fields are a potential significant source of atmospheric methane. US DOE's ARPA-E MONITOR program is supporting research to locate and quantify fugitive methane leaks at natural gas facilities in order to achieve a 90% reduction in CH4 emissions. LANL, Aeris and Rice University are developing an LDS (leak detection system) that employs a compact laser absorption methane sensor and sonic anemometer coupled to an artificial neural network (ANN)-based source attribution algorithm. LANL's large-eddy simulation model, HIGRAD, provides high-fidelity simulated wind fields and turbulent CH4 plume dispersion data for various scenarios used in training the ANN. Numerous inverse solution methodologies have been applied over the last decade to assessment of greenhouse gas emissions. ANN learning is well suited to problems in which the training and observed data are noisy, or correspond to complex sensor data as is typical of meteorological and sensor data over a site. ANNs have been shown to achieve higher accuracy with more efficiency than other inverse modeling approaches in studies at larger scales, in urban environments, over short time scales, and even at small spatial scales for efficient source localization of indoor airborne contaminants. Our ANN is intended to characterize fugitive leaks rapidly, given site-specific, real-time, wind and CH4 concentration time-series data at multiple sensor locations, leading to a minimum time-to-detection and providing a first order improvement with respect to overall minimization of methane loss. Initial studies with the ANN on a variety of source location, sensor location, and meteorological condition scenarios are presented and discussed.

  1. Efficient nearest neighbors via robust sparse hashing.

    Science.gov (United States)

    Cherian, Anoop; Sra, Suvrit; Morellas, Vassilios; Papanikolopoulos, Nikolaos

    2014-08-01

    This paper presents a new nearest neighbor (NN) retrieval framework: robust sparse hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding. Our key idea is to sparse code the data using a learned dictionary, and then to generate hash codes out of these sparse codes for accurate and fast NN retrieval. But, direct application of sparse coding to NN retrieval poses a technical difficulty: when data are noisy or uncertain (which is the case with most real-world data sets), for a query point, an exact match of the hash code generated from the sparse code seldom happens, thereby breaking the NN retrieval. Borrowing ideas from robust optimization theory, we circumvent this difficulty via our novel robust dictionary learning and sparse coding framework called RSH, by learning dictionaries on the robustified counterparts of the perturbed data points. The algorithm is applied to NN retrieval on both simulated and real-world data. Our results demonstrate that RSH holds significant promise for efficient NN retrieval against the state of the art.

  2. Statistical downscaling using K-nearest neighbors

    Science.gov (United States)

    Gangopadhyay, Subhrendu; Clark, Martyn; Rajagopalan, Balaji

    2005-02-01

    Statistical downscaling provides a technique for deriving local-scale information of precipitation and temperature from numerical weather prediction model output. The K-nearest neighbor (K-nn) is a new analog-type approach that is used in this paper to downscale the National Centers for Environmental Prediction 1998 medium-range forecast model output. The K-nn algorithm queries days similar to a given feature vector in this archive and using empirical orthogonal function analysis identifies a subset of days (K) similar to the feature day. These K days are then weighted using a bisquare weight function and randomly sampled to generate ensembles. A set of 15 medium-range forecast runs was used, and seven ensemble members were generated from each run. The ensemble of 105 members was then used to select the local-scale precipitation and temperature values in four diverse basins across the contiguous United States. These downscaled precipitation and temperature estimates were subsequently analyzed to test the performance of this downscaling approach. The downscaled ensembles were evaluated in terms of bias, the ranked probability skill score as a measure of forecast skill, spatial covariability between stations, temporal persistence, consistency between variables, and conditional bias and to develop spread-skill relationships. Though this approach does not explicitly model the space-time variability of the weather fields at each individual station, the above statistics were extremely well captured. The K-nn method was also compared with a multiple-linear-regression-based downscaling model.

  3. Turmoil in Orion: The Nearest Massive Protostar

    CERN Document Server

    Tan, Jonathan C

    2008-01-01

    I discuss different theories of massive star formation: formation from massive cores, competitive Bondi-Hoyle accretion, and protostellar collisions. I summarize basic features of the Turbulent Core Model (TCM). I then introduce the Orion Kleinmann-Low (KL) region, embedded in the Orion Nebula Cluster (ONC) and one of the nearest regions of massive star formation. The KL region contains three principal radio sources, known as "I", "n" and "BN". BN is known to be a runaway star, almost certainly set in motion by dynamical ejection within the ONC from a multiple system of massive stars, that would leave behind a recoiling, hard, massive, probably eccentric binary. I review the debate about whether this binary is Theta^1C, the most massive star in the ONC, or source "I", and argue that it is most likely to be Theta^1C, since this is now known be a recoiling, hard, massive, eccentric binary, with properties that satisfy the energy and momentum constraints implied by BN's motion. Source "n" is a relatively low-mas...

  4. Nearest shrunken centroids via alternative genewise shrinkages

    Science.gov (United States)

    Choi, Byeong Yeob; Bair, Eric; Lee, Jae Won

    2017-01-01

    Nearest shrunken centroids (NSC) is a popular classification method for microarray data. NSC calculates centroids for each class and “shrinks” the centroids toward 0 using soft thresholding. Future observations are then assigned to the class with the minimum distance between the observation and the (shrunken) centroid. Under certain conditions the soft shrinkage used by NSC is equivalent to a LASSO penalty. However, this penalty can produce biased estimates when the true coefficients are large. In addition, NSC ignores the fact that multiple measures of the same gene are likely to be related to one another. We consider several alternative genewise shrinkage methods to address the aforementioned shortcomings of NSC. Three alternative penalties were considered: the smoothly clipped absolute deviation (SCAD), the adaptive LASSO (ADA), and the minimax concave penalty (MCP). We also showed that NSC can be performed in a genewise manner. Classification methods were derived for each alternative shrinkage method or alternative genewise penalty, and the performance of each new classification method was compared with that of conventional NSC on several simulated and real microarray data sets. Moreover, we applied the geometric mean approach for the alternative penalty functions. In general the alternative (genewise) penalties required fewer genes than NSC. The geometric mean of the class-specific prediction accuracies was improved, as well as the overall predictive accuracy in some cases. These results indicate that these alternative penalties should be considered when using NSC. PMID:28199352

  5. Frog sound identification using extended k-nearest neighbor classifier

    Science.gov (United States)

    Mukahar, Nordiana; Affendi Rosdi, Bakhtiar; Athiar Ramli, Dzati; Jaafar, Haryati

    2017-09-01

    Frog sound identification based on the vocalization becomes important for biological research and environmental monitoring. As a result, different types of feature extractions and classifiers have been employed to evaluate the accuracy of frog sound identification. This paper presents a frog sound identification with Extended k-Nearest Neighbor (EKNN) classifier. The EKNN classifier integrates the nearest neighbors and mutual sharing of neighborhood concepts, with the aims of improving the classification performance. It makes a prediction based on who are the nearest neighbors of the testing sample and who consider the testing sample as their nearest neighbors. In order to evaluate the classification performance in frog sound identification, the EKNN classifier is compared with competing classifier, k -Nearest Neighbor (KNN), Fuzzy k -Nearest Neighbor (FKNN) k - General Nearest Neighbor (KGNN)and Mutual k -Nearest Neighbor (MKNN) on the recorded sounds of 15 frog species obtained in Malaysia forest. The recorded sounds have been segmented using Short Time Energy and Short Time Average Zero Crossing Rate (STE+STAZCR), sinusoidal modeling (SM), manual and the combination of Energy (E) and Zero Crossing Rate (ZCR) (E+ZCR) while the features are extracted by Mel Frequency Cepstrum Coefficient (MFCC). The experimental results have shown that the EKNCN classifier exhibits the best performance in terms of accuracy compared to the competing classifiers, KNN, FKNN, GKNN and MKNN for all cases.

  6. An Affine Invariant $k$-Nearest Neighbor Regression Estimate

    CERN Document Server

    Biau, Gérard; Dujmovic, Vida; Krzyzak, Adam

    2012-01-01

    We design a data-dependent metric in $\\mathbb R^d$ and use it to define the $k$-nearest neighbors of a given point. Our metric is invariant under all affine transformations. We show that, with this metric, the standard $k$-nearest neighbor regression estimate is asymptotically consistent under the usual conditions on $k$, and minimal requirements on the input data.

  7. A Hybrid Approach Using an Artificial Bee Algorithm with Mixed Integer Programming Applied to a Large-Scale Capacitated Facility Location Problem

    Directory of Open Access Journals (Sweden)

    Guillermo Cabrera G.

    2012-01-01

    Full Text Available We present a hybridization of two different approaches applied to the well-known Capacitated Facility Location Problem (CFLP. The Artificial Bee algorithm (BA is used to select a promising subset of locations (warehouses which are solely included in the Mixed Integer Programming (MIP model. Next, the algorithm solves the subproblem by considering the entire set of customers. The hybrid implementation allows us to bypass certain inherited weaknesses of each algorithm, which means that we are able to find an optimal solution in an acceptable computational time. In this paper we demonstrate that BA can be significantly improved by use of the MIP algorithm. At the same time, our hybrid implementation allows the MIP algorithm to reach the optimal solution in a considerably shorter time than is needed to solve the model using the entire dataset directly within the model. Our hybrid approach outperforms the results obtained by each technique separately. It is able to find the optimal solution in a shorter time than each technique on its own, and the results are highly competitive with the state-of-the-art in large-scale optimization. Furthermore, according to our results, combining the BA with a mathematical programming approach appears to be an interesting research area in combinatorial optimization.

  8. Harbor Facility Locations - USACE IENC

    Data.gov (United States)

    Department of Homeland Security — These inland electronic Navigational charts (IENCs) were developed from available data used in maintenance of Navigation channels. Users of these IENCs should be...

  9. Substance Abuse Treatment Facility Locator

    Science.gov (United States)

    ... nbspPersons who have experienced intimate partner violence, domestic violence   Children with serious emotional disturbance (SED)   Persons with serious mental illness (SMI)   Persons with Alzheimer's or dementia  & ...

  10. VA Health Care Facilities Locator

    Science.gov (United States)

    ... Inside the Media Room Public Affairs News Releases Speeches Videos Publications National Observances Veterans Day Memorial Day Celebrating America's Freedoms Special Events Adaptive Sports Program Creative Arts Festival ...

  11. Mooring Facility Locations - USACE IENC

    Data.gov (United States)

    Department of Homeland Security — These inland electronic Navigational charts (IENCs) were developed from available data used in maintenance of Navigation channels. Users of these IENCs should be...

  12. Stratigraphic Profiles for Selected Hanford Site Seismometer Stations and Other Locations

    Energy Technology Data Exchange (ETDEWEB)

    Last, George V.

    2014-02-01

    Stratigraphic profiles were constructed for eight selected Hanford Site seismometer stations, five Hanford Site facility reference locations, and seven regional three-component broadband seismometer stations. These profiles provide interpretations of the subsurface layers to support estimation of ground motions from past earthquakes, and the prediction of ground motions from future earthquakes. In most cases these profiles terminated at the top of the Wanapum Basalt, but at selected sites profiles were extended down to the top of the crystalline basement. The composite one-dimensional stratigraphic profiles were based primarily on previous interpretations from nearby boreholes, and in many cases the nearest deep borehole is located kilometers away.

  13. 3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE

    Directory of Open Access Journals (Sweden)

    A. Suhaibah

    2016-06-01

    Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.

  14. Privacy-Preserving Location-Based Services

    Science.gov (United States)

    Chow, Chi Yin

    2010-01-01

    Location-based services (LBS for short) providers require users' current locations to answer their location-based queries, e.g., range and nearest-neighbor queries. Revealing personal location information to potentially untrusted service providers could create privacy risks for users. To this end, our objective is to design a privacy-preserving…

  15. Privacy-Preserving Location-Based Services

    Science.gov (United States)

    Chow, Chi Yin

    2010-01-01

    Location-based services (LBS for short) providers require users' current locations to answer their location-based queries, e.g., range and nearest-neighbor queries. Revealing personal location information to potentially untrusted service providers could create privacy risks for users. To this end, our objective is to design a privacy-preserving…

  16. Frequency and Correlation of Nearest Neighboring Nucleotides in Human Genome

    Institute of Scientific and Technical Information of China (English)

    Neng-zhi Jin; Zi-xian Liu; Wen-yuan Qiu

    2009-01-01

    Zipf's approach in linguistics is utilized to analyze the statistical features of frequency and mosomes (Y, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, and 12). It is found that these statistical features of nearest neighboring nucleotides in human genome: (ⅰ) the frequency distribution is a linear function, and (ⅱ) the correlation distribution is an inverse function. The coeffi-cients of the linear function and inverse function depend on the GC content. It proposes the correlation distribution of nearest neighboring nucleotides for the first time and extends the descriptor about nearest neighboring nucleotides.

  17. Improving Nearest Neighbour Search in 3D Spatial Access Method

    DEFF Research Database (Denmark)

    Suhaibah, A.; Rahman, A. A.; Uznir, U.

    2016-01-01

    Nearest Neighbour (NN) is one of the important queries and analyses for spatial application. In normal practice, spatial access method structure is used during the Nearest Neighbour query execution to retrieve information from the database. However, most of the spatial access method structures...... large due to its detail geometry and other attached information. In this research, a clustered 3D hierarchical structure is introduced as a 3D spatial access method structure. The structure is expected to improve the retrieval of Nearest Neighbour information for 3D objects. Several tests are performed...

  18. Licensed Healthcare Facilities

    Data.gov (United States)

    California Department of Resources — The Licensed Healthcare Facilities point layer represents the locations of all healthcare facilities licensed by the State of California, Department of Health...

  19. Environmental Toxicology Research Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Fully-equipped facilities for environmental toxicology research The Environmental Toxicology Research Facility (ETRF) located in Vicksburg, MS provides over 8,200 ft...

  20. Licensed Healthcare Facilities

    Data.gov (United States)

    California Department of Resources — The Licensed Healthcare Facilities point layer represents the locations of all healthcare facilities licensed by the State of California, Department of Health...

  1. Duality in constrained location problems

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1987-01-01

    The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated.......The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated....

  2. Duality in constrained location problems

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1987-01-01

    The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated.......The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated....

  3. Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

    DEFF Research Database (Denmark)

    Xuegang, Huang; Jensen, Christian Søndergaard; Saltenis, Simonas

    2006-01-01

    This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries...... for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case...... where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest...

  4. Scalable Nearest Neighbor Algorithms for High Dimensional Data.

    Science.gov (United States)

    Muja, Marius; Lowe, David G

    2014-11-01

    For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbor matches to high dimensional vectors that represent the training data. We propose new algorithms for approximate nearest neighbor matching and evaluate and compare them with previous algorithms. For matching high dimensional features, we find two algorithms to be the most efficient: the randomized k-d forest and a new algorithm proposed in this paper, the priority search k-means tree. We also propose a new algorithm for matching binary features by searching multiple hierarchical clustering trees and show it outperforms methods typically used in the literature. We show that the optimal nearest neighbor algorithm and its parameters depend on the data set characteristics and describe an automated configuration procedure for finding the best algorithm to search a particular data set. In order to scale to very large data sets that would otherwise not fit in the memory of a single machine, we propose a distributed nearest neighbor matching framework that can be used with any of the algorithms described in the paper. All this research has been released as an open source library called fast library for approximate nearest neighbors (FLANN), which has been incorporated into OpenCV and is now one of the most popular libraries for nearest neighbor matching.

  5. A Heuristic Algorithm for Constrained Multi-Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach

    Directory of Open Access Journals (Sweden)

    Jian-Lin Jiang

    2013-01-01

    Full Text Available This paper considers the locations of multiple facilities in the space , with the aim of minimizing the sum of weighted distances between facilities and regional customers, where the proximity between a facility and a regional customer is evaluated by the closest distance. Due to the fact that facilities are usually allowed to be sited in certain restricted areas, some locational constraints are imposed to the facilities of our problem. In addition, since the symmetry of distances is sometimes violated in practical situations, the gauge is employed in this paper instead of the frequently used norms for measuring both the symmetric and asymmetric distances. In the spirit of the Cooper algorithm (Cooper, 1964, a new location-allocation heuristic algorithm is proposed to solve this problem. In the location phase, the single-source subproblem with regional demands is reformulated into an equivalent linear variational inequality (LVI, and then, a projection-contraction (PC method is adopted to find the optimal locations of facilities, whereas in the allocation phase, the regional customers are allocated to facilities according to the nearest center reclassification (NCR. The convergence of the proposed algorithm is proved under mild assumptions. Some preliminary numerical results are reported to show the effectiveness of the new algorithm.

  6. Prediction of cavitation damage on spillway using K-nearest neighbor modeling.

    Science.gov (United States)

    Fadaei Kermani, E; Barani, G A; Ghaeini-Hessaroeyeh, M

    2015-01-01

    Cavitation is a common and destructive process on spillways that threatens the stability of the structure and causes damage. In this study, based on the nearest neighbor model, a method has been presented to predict cavitation damage on spillways. The model was tested using data from the Shahid Abbaspour dam spillway in Iran. The level of spillway cavitation damage was predicted for eight different flow rates, using the nearest neighbor model. Moreover, based on the cavitation index, five damage levels from no damage to major damage have been determined. Results showed that the present model predicted damage locations and levels close to observed damage during past floods. Finally, the efficiency and precision of the model was quantified by statistical coefficients. Appropriate values of the correlation coefficient, root mean square error, mean absolute error and coefficient of residual mass show the present model is suitable and efficient.

  7. Three-state Potts model on triangular lattice with nearest-neighbor and next-nearest-neighbor antiferromagnetic interactions

    Science.gov (United States)

    Murtazaev, Akai K.; Babaev, Albert B.; Magomedov, Magomed A.; Kassan-Ogly, Felix A.; Proshkin, Alexey I.

    2016-11-01

    Using Monte Carlo simulations, we investigated phase transitions and frustrations in the three-state Potts model on a triangular lattice with allowance for antiferromagnetic exchange interactions between nearest-neighbors J1 and next-nearest-neighbors J2. The ratio of the next-nearest-neighbor and nearest-neighbor exchange constants r=J2/J1 is chosen within the range of 0≤r≤2. Based on the analysis of the entropy, specific heat, system state density function, and fourth order Binder cumulants, the phase transitions in the Potts model with interactions J1<0 and J2<0 are shown to be found in value ranges of 0≤r<0.2 and 1.25≤r≤2.0. In an intermediate range of 0.2≤r≤1.0 the phase transition fails and the frustrations are revealed.

  8. The Sizes of the Nearest Young Stars

    Science.gov (United States)

    McCarthy, Kyle; White, Russel J.

    2012-06-01

    We present moderate resolution (R ~ 3575) optical spectra of 19 known or suspected members of the AB Doradus and β Pictoris Moving Groups, obtained with the DeVeny Spectrograph on the 72 inch Perkins telescope at Lowell Observatory. For four of five recently proposed members, signatures of youth such as Li I 6708 Å absorption and Hα emission further strengthen the case for youth and membership. The lack of detected lithium in the proposed β Pic member TYC 2211-1309-1 implies that it is older than all other K-type members and weakens the case for membership. Effective temperatures are determined via line ratio analyses for the 11 F, G, and early-K stars observed, and via spectral comparisons for the eight late-K and M stars observed. We assemble updated candidate membership lists for these moving groups that account for known binarity. Currently, the AB Dor Moving Group contains 127 proposed members and the β Pic Moving Group holds 77 proposed members. We then use temperature, luminosity, and distance estimates to predict angular diameters for these stars; the motivation is to identify stars that can be spatially resolved with long-baseline optical/infrared interferometers in order to improve age estimates for these groups and to constrain evolutionary models at young ages. Considering the portion of the sky accessible to northern hemisphere facilities (decl. > - 30), six stars have diameters large enough to be spatially resolved (θ > 0.4 mas) with the CHARA Array, which currently has the world's longest baseline of 331 m; this subsample includes the low-mass M2.5 member of AB Dor, GJ 393, which is likely to still be pre-main sequence. For southern hemisphere facilities (decl. < + 30), 18 stars have diameters larger than this limiting size, including the low-mass debris disk star AU Mic (0.72 mas). However, the longest baselines of southern hemisphere interferometers (160 m) are only able to resolve the largest of these, the B6 star α Gru (1.17 mas) proposed

  9. 成本与半径优化的设施选址问题%Facility Location Problem with Cost and Radius Optimization

    Institute of Scientific and Technical Information of China (English)

    翁克瑞; 杨超

    2012-01-01

    The facility location problem with cost and radius optimization (FLCRO) has a wide range of applications in emergency response, logistics, maintenance service as well as express delivery. By considering the relationship of response time, service benefits and service costs, the problem seeks a decision on whether the distant customers are brought into the range of service radius or not. Both service cost and service radius are taken into consideration in the model. We construct a mixed 0 — 1 integer programming model for the problem and present a 7. 853 + e-approximation algorithm for FLCRO on a plane. We also provided a heuristic algorithm based on benders' decomposition which is very effective in solving FLCRO.%成本与半径优化的服务设施选址问题(CROFL)广泛应用于应急服务、快递、维修网络等领域,其特点是考虑了响应速度与服务价格、成本之间的关系,根据净收益最大化或者成本最小化的原则自动判断是否将偏远的“需求点”纳入服务半径之内,实现服务成本与服务半径的双重优化.建立了CROFL的混合整数规划模型,构造了求解平面CROFL的7.853+ε-近似算法,并提供了求解一般CROFL的Benders’分解算法,计算实验显示,Benders’分解算法具有非常高的求解效率与求解质量.

  10. Discussion about the Model of Single Facility Location in Subject of Logistics Management%《物流管理》课程中"单设施选址模型"教学探讨

    Institute of Scientific and Technical Information of China (English)

    陈文

    2015-01-01

    设施选址是物流管理的重要环节,其中单设施选址模型是最基本、也是最重要的选址模型. 重心法是求解单设施选址模型的重要方法,因此,本文从重心法原理、重心法计算步骤及重心法的程序实现等环节对"重心法"的教学进行了设计.%Facility location is an important link of logistics management, and the model of single facility location is the most basic and important model in facility Location. The gravity method is an important method to solve the model of single facility loca-tion, so the principle of the gravity method、the calculation steps of the gravity method and the program realization of the gravity method will be discussed to improve teaching methodology in this paper.

  11. Population-based geographic access to parent and satellite National Cancer Institute Cancer Center Facilities.

    Science.gov (United States)

    Onega, Tracy; Alford-Teaster, Jennifer; Wang, Fahui

    2017-09-01

    Satellite facilities of National Cancer Institute (NCI) cancer centers have expanded their regional footprints. This study characterized geographic access to parent and satellite NCI cancer center facilities nationally overall and by sociodemographics. Parent and satellite NCI cancer center facilities, which were geocoded in ArcGIS, were ascertained. Travel times from every census tract in the continental United States and Hawaii to the nearest parent and satellite facilities were calculated. Census-based population attributes were used to characterize measures of geographic access for sociodemographic groups. From the 62 NCI cancer centers providing clinical care in 2014, 76 unique parent locations and 211 satellite locations were mapped. The overall proportion of the population within 60 minutes of a facility was 22% for parent facilities and 32.7% for satellite facilities. When satellites were included for potential access, the proportion of some racial groups for which a satellite was the closest NCI cancer center facility increased notably (Native Americans, 22.6% with parent facilities and 39.7% with satellite facilities; whites, 34.8% with parent facilities and 50.3% with satellite facilities; and Asians, 40.0% with parent facilities and 54.0% with satellite facilities), with less marked increases for Hispanic and black populations. Rural populations of all categories had dramatically low proportions living within 60 minutes of an NCI cancer center facility of any type (1.0%-6.6%). Approximately 14% of the population (n = 43,033,310) lived more than 180 minutes from a parent or satellite facility, and most of these individuals were Native Americans and/or rural residents (37% of Native Americans and 41.7% of isolated rural residents). Racial/ethnic and rural populations showed markedly improved geographic access to NCI cancer center care when satellite facilities were included. Cancer 2017;123:3305-11. © 2017 American Cancer Society. © 2017 American

  12. k-Nearest Neighbors for automated classification of celestial objects

    Institute of Scientific and Technical Information of China (English)

    LI LiLi; ZHANG YanXia; ZHAO YongHeng

    2008-01-01

    The nearest neighbors (NNs) classifiers, especially the k-Nearest Neighbors (kNNs) algorithm, are among the simplest and yet most efficient classification rules and widely used in practice. It is a nonparametric method of pattern recognition. In this paper, k-Nearest Neighbors, one of the most commonly used machine learning methods, work in automatic classification of multi-wavelength astronomical objects. Through the experiment, we conclude that the running speed of the kNN classier is rather fast and the classification accuracy is up to 97.73%. As a result, it is efficient and applicable to discriminate active objects from stars and normal galaxies with this method. The classifiers trained by the kNN method can be used to solve the automated classification problem faced by astronomy and the virtual observatory (VO).

  13. Efficient nearest neighbor searches in N-ABLE.

    Energy Technology Data Exchange (ETDEWEB)

    Mackey, Greg Edward

    2010-07-01

    The nearest neighbor search is a significant problem in transportation modeling and simulation. This paper describes how the nearest neighbor search is implemented efficiently with respect to running time in the NISAC Agent-Based Laboratory for Economics. The paper shows two methods to optimize running time of the nearest neighbor search. The first optimization uses a different distance metric that is more computationally efficient. The concept of a magnitude-comparable distance is described, and the paper gives a specific magnitude-comparable distance that is more computationally efficient than the actual distance function. The paper also shows how the given magnitude-comparable distance can be used to speed up the actual distance calculation. The second optimization reduces the number of points the search examines by using a spatial data structure. The paper concludes with testing of the different techniques discussed and the results.

  14. Western Canada study of animal health effects associated with exposure to emissions from oil and natural gas field facilities. Study design and data collection II. Location of study herds relative to the oil and gas industry in Western Canada.

    Science.gov (United States)

    Waldner, Cheryl L

    2008-01-01

    During the late part of 2000 and early months of 2001, project veterinarians recruited 205 beef herds to participate in a study of the effects of emissions from the upstream oil and gas industry on cattle reproduction and health. Researchers developed herd-selection criteria to optimize the range of exposure to facilities, including oil and gas wells, battery sites, and gas-gathering and gas-processing facilities across the major cattle-producing areas of Western Canada. Herds were initially selected on the basis of a ranking system of exposure potential on the basis of herd-owner reports of the locations of their operations in relation to oil and gas industry facilities. At the end of the study, researchers summarized data obtained from provincial regulatory agencies on facility location and reported flaring and venting volumes for each herd and compared these data to the original rankings of herd-exposure potential. Through this selection process, the researchers were successful in obtaining statistically significant differences in exposure to various types of oil and gas facility types and reported emissions among herds recruited for the study.

  15. Hazardous Material Storage Facilities and Sites, Tier II Reporting locations, Published in 2005, 1:4800 (1in=400ft) scale, Iredell County GIS.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Hazardous Material Storage Facilities and Sites dataset, published at 1:4800 (1in=400ft) scale, was produced all or in part from Field Survey/GPS information...

  16. Prisons and Correctional Facilities, Prison point locations in Iredell County, NC, Published in 2009, 1:2400 (1in=200ft) scale, Iredell County GIS.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Prisons and Correctional Facilities dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Orthoimagery information as of 2009. It is...

  17. Industrial Manufacturing Facilities, Coweta County, Georgia WinPak Location Map, Published in 2004, 1:12000 (1in=1000ft) scale, Chattahoochee-Flint Regional Development.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Industrial Manufacturing Facilities dataset, published at 1:12000 (1in=1000ft) scale, was produced all or in part from Hardcopy Maps information as of 2004. It...

  18. Ambulatory Surgical Facilities, Identify the locations of Ambulatory Surgical Centers, Published in 2012, 1:2400 (1in=200ft) scale, Miami-Dade County, Information Technology Department.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Ambulatory Surgical Facilities dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Other information as of 2012. It is described as...

  19. Park Facilities, County-owned park locations and park boundaries., Published in 2013, 1:12000 (1in=1000ft) scale, Clark County Planning and Zoning Department.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Park Facilities dataset, published at 1:12000 (1in=1000ft) scale, was produced all or in part from Field Observation information as of 2013. It is described as...

  20. Fast agglomerative clustering using a k-nearest neighbor graph.

    Science.gov (United States)

    Fränti, Pasi; Virmajoki, Olli; Hautamäki, Ville

    2006-11-01

    We propose a fast agglomerative clustering method using an approximate nearest neighbor graph for reducing the number of distance calculations. The time complexity of the algorithm is improved from O(tauN2) to O(tauNlogN) at the cost of a slight increase in distortion; here, tau denotes the number of nearest neighbor updates required at each iteration. According to the experiments, a relatively small neighborhood size is sufficient to maintain the quality close to that of the full search.

  1. A Synchrotron-based Facility for Location and In-situ Chemical and Mineralogical Analysis of ~10 mm Particles From Comets and Asteroids Returned to Earth in Aerogel

    Science.gov (United States)

    Flynn, G. J.; Lanzirotti, A.; Sutton, S. R.

    In January 2006, NASA's Stardust spacecraft is expected to deliver to Earth more than 1,000 dust particles collected in aerogel capture cells from the coma of Comet Wild-2. These dust particles, which impacted the aerogel surface at ˜ 6 km/sec, are expected to produce cone-shaped entry tracks, each about 100 to 200 times as long as the particle diameter, with the particle at the end of the track. However, weak particles may fragment during capture, leaving debris along the sides of the entry track. In addition, the impact of numerous sub-micron, carbon-rich particles (like the CHON particles identified by the Giotto and VEGA spacecraft at Comet Halley) may discolor the surface of the aerogel, interfering with the visual location/identification of the captured particles. Extraction of these particles from the aerogel will, eventually, be required in order to perform analyses that cannot be performed in-situ. However, extraction involves the risk of particle contamination or particle loss. For this reason, we have developed techniques to employ a synchrotron-based x-ray microprobe and x-ray diffraction facility on Beamline X26A of the National Synchrotron Light Source (NSLS) at Brookhaven National Laboratory for the in-situ chemical and mineralogical characterization of the Wild-2 particles and particles returned in aerogel capture cells on future space missions. This facility is designed to perform: 3-D particle location by detection of Fe-fluorescence from ˜ 10 μ m particles, in case carbon-rich debris reduces the optical transparency of the aerogel, semi-quantitative x-ray fluorescence chemical analysis on particles ˜ 10 μ m in size for the elements from Ca to Sr, mineral identification by x-ray diffraction on particles ˜ 10 μ m in size, oxidation state characterization by X-ray Absorption Near-Edge Structure (XANES) spectroscopy of Fe, Cr, etc. in ˜ 10 μ m particles, chemical analysis of fragments and vapor deposited along the entry track, to reconstruct

  2. Reliable Connected Facility Location Problem in Emergency Management Based on Failure Scenarios%基于损毁情景的可靠连通应急设施选址问题

    Institute of Scientific and Technical Information of China (English)

    朱建明

    2012-01-01

      Emergency facility location is an important problem in emergency management. In real emergency response situations, resources are always transported among all facilities because of huge demands. At the same time, facilities may be destroyed by the disaster, and services have to cut down. In this paper, considering all facility failure scenarios and transportation time among the facilities, a reliable connected facility location model is formulated, which is a 0-1 integer programming with nonlinear objective functions. Since this model is NP-hard, an efficient algorithm is designed based on the genetic algorithm. Then, comparing with classical facility location models, experiment results show that both the model and algorithm presented in this paper are useful for robust decisions of emergency facility location.%  应急设施选址问题是应急管理中的重要问题,在实际应急处置过程中,常常需要设施两两之间的资源调度,同时灾害可能导致已有设施的损毁,造成设施服务的中断,因此,本文同时考虑设施可能的损毁情景以及设施两两之间的调度时间,建立了可靠连通应急设施选址模型,该模型是带有非线性目标函数的0-1整数规划,属于NP-困难问题,基于遗传算法为模型设计了有效的求解方法,并通过算例与经典选址模型进行比较,说明了本文提出的模型与算法在解决应急设施选址决策鲁棒性方面具有一定的应用价值

  3. 设施选址问题中的基础模型与求解方法比较%A Comparative Research of Facility Location Models and Algorithms

    Institute of Scientific and Technical Information of China (English)

    孟醒; 张景秋; 朱海勇

    2012-01-01

    设施选址问题广泛存在于国民经济的各行业中。通过回顾选址问题的发展,重点比较分析中值选址问题与覆盖选址问题中的两类模型,并对模型在实践应用中的求解方法进行列举和总结比较,梳理设施选址问题的相关研究,以期为选址决策者提供参考。%Facility location is an issue in many industries of national economy. The development of facility location is reviewed, and two classical facility location models, p-media model and covering models, were compared and analyzed. Location problems are common optimization problems, many of which are NP-hard. There have been many algorithms to solve the problems. The solutions are provided and summarized, and relevant researches are sorted for the reference of decision makers to deal with the problem more efficiently.

  4. Dramatic Outburst Reveals Nearest Black Hole

    Science.gov (United States)

    2000-01-01

    can help us decipher just how jets in X-ray binaries work," Remillard said. The VLA is an instrument of the National Radio Astronomy Observatory, a facility of the National Science Foundation operated under cooperative agreement by Associated Universities, Inc. The RXTE is a NASA explorer mission consisting of X-ray instruments built by teams at Goddard Space Flight Center, MIT and the University of California at San Diego.

  5. Anderson localization in one-dimensional quasiperiodic lattice models with nearest- and next-nearest-neighbor hopping

    Energy Technology Data Exchange (ETDEWEB)

    Gong, Longyan, E-mail: lygong@njupt.edu.cn [Information Physics Research Center and Department of Applied Physics, Nanjing University of Posts and Telecommunications, Nanjing, 210003 (China); Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing, 210003 (China); National Laboratory of Solid State Microstructures, Nanjing University, Nanjing 210093 (China); Feng, Yan; Ding, Yougen [Information Physics Research Center and Department of Applied Physics, Nanjing University of Posts and Telecommunications, Nanjing, 210003 (China); Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing, 210003 (China)

    2017-02-12

    Highlights: • Quasiperiodic lattice models with next-nearest-neighbor hopping are studied. • Shannon information entropies are used to reflect state localization properties. • Phase diagrams are obtained for the inverse bronze and golden means, respectively. • Our studies present a more complete picture than existing works. - Abstract: We explore the reduced relative Shannon information entropies SR for a quasiperiodic lattice model with nearest- and next-nearest-neighbor hopping, where an irrational number is in the mathematical expression of incommensurate on-site potentials. Based on SR, we respectively unveil the phase diagrams for two irrationalities, i.e., the inverse bronze mean and the inverse golden mean. The corresponding phase diagrams include regions of purely localized phase, purely delocalized phase, pure critical phase, and regions with mobility edges. The boundaries of different regions depend on the values of irrational number. These studies present a more complete picture than existing works.

  6. Weather Station and Sensor Locations, Prince George's County Earth Networks Owned Weather Stations located on County Facilities, Published in 2005, 1:2400 (1in=200ft) scale, Prince George's County Office of Information Technology and Communications.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Weather Station and Sensor Locations dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Published Reports/Deeds information as of...

  7. Assisted Living Facilities, Locations of Assisted Living Facilities identifed visually and placed on the Medical Multi-Hazard Mitigation layer., Published in 2006, 1:1200 (1in=100ft) scale, Noble County Government.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Assisted Living Facilities dataset, published at 1:1200 (1in=100ft) scale, was produced all or in part from Field Observation information as of 2006. It is...

  8. Ozone Monitoring Using Support Vector Machine and K-Nearest Neighbors Methods

    Directory of Open Access Journals (Sweden)

    FALEH Rabeb

    2017-05-01

    Full Text Available Due to health impacts caused by the pollutant gases, monitoring and controlling air quality is an important field of interest. This paper deals with ozone monitoring in four stations measuring air quality located in many Tunisian cities using numerous measuring instruments and polluting gas analyzers. Prediction of ozone concentrations in two Tunisian cities, Tunis and Sfax is screened based on supervised classification models. The K -Nearest neighbors results reached 98.7 % success rate in the recognition and ozone identification. Support Vector Machines (SVM with the linear, polynomial and RBF kernel were applied to build a classifier and full accuracy (100% was again achieved with the RBF kernel.

  9. Anderson localization in one-dimensional quasiperiodic lattice models with nearest- and next-nearest-neighbor hopping

    Science.gov (United States)

    Gong, Longyan; Feng, Yan; Ding, Yougen

    2017-02-01

    We explore the reduced relative Shannon information entropies SR for a quasiperiodic lattice model with nearest- and next-nearest-neighbor hopping, where an irrational number is in the mathematical expression of incommensurate on-site potentials. Based on SR, we respectively unveil the phase diagrams for two irrationalities, i.e., the inverse bronze mean and the inverse golden mean. The corresponding phase diagrams include regions of purely localized phase, purely delocalized phase, pure critical phase, and regions with mobility edges. The boundaries of different regions depend on the values of irrational number. These studies present a more complete picture than existing works.

  10. Application of a Genetic Algorithm to Nearest Neighbour Classification

    NARCIS (Netherlands)

    Simkin, S.; Verwaart, D.; Vrolijk, H.C.J.

    2005-01-01

    This paper describes the application of a genetic algorithm to nearest-neighbour based imputation of sample data into a census data dataset. The genetic algorithm optimises the selection and weights of variables used for measuring distance. The results show that the measure of fit can be improved by

  11. Nearest lattice point algorithms on semi k-reduced basis

    Institute of Scientific and Technical Information of China (English)

    阚海斌; 沈鸿

    2003-01-01

    In this paper, we firstly generalize the relations among the basis vectors of LLL reduced basis to semi k-reduced basis. Then we analyze the complexities of the nearest plane algorithm and round-off algorithm on semi k-reduced basis, which, compared with L. Babai's results on LLL reduced basis, have better approximate ratios and contain almost the same time complexities.

  12. On a zero-drift nearest-neighbour random walk

    NARCIS (Netherlands)

    Cohen, J.W.

    1996-01-01

    The present study concerns the analysis of the hitting point identity for a nearest-neighbour random walk of which the one-step transition to the $NE$, $SE$, $SW$ and $NW$ are the only transitions with nonzero probabilities. The one-step transition vector has a symmetrical probability distribution w

  13. North Slope, Alaska ESI: FACILITY (Facility Points)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains data for oil field facilities for the North Slope of Alaska. Vector points in this data set represent oil field facility locations. This data...

  14. 救援时间限制下高速公路网应急设施点选址模型%Emergency Facility Location Model of Expressway Network Within Limitation of Rescue Time

    Institute of Scientific and Technical Information of China (English)

    赵琳娜; 戴帅; 巩建国

    2015-01-01

    The emergency facility location is a key problem in the field of expressway emergency man⁃agement. A method of optimizing the emergency facility location on the expressway network by the math⁃ematical modeling was proposed. Firstly, the layout characteristics of emergency facility demand on the expressway network was analyzed, and the emergency demand under the specific traffic accident was de⁃termined in terms of the accident probability, the accident influence scope and the average traffic flow volumes. Secondly, the emergency facility location model was established based on the demand analysis. In the emergency facility location model, the facility points′coverage condition was determined by the rescue time limitation, and the facility points were chosen to build emergency facility within the condi⁃tion of rapid rescue time and sufficient rescue supplies. Finally, the method of the heuristic algorithm based on the Lagrangian Relaxation to solve this model was introduced. The emergency facility location model aimed at emergency demand on the expressway network was verified to be effective and enforce⁃able by a computational experiment, which guaranteed for the rescue time and offered a new idea for the emergency facility location.%应急资源布局问题是高速公路应急管理的关键。通过建立数学模型,提出一种优化高速公路网中应急设施点布局方法。首先,通过分析高速公路网中应急需求的布局特点,依据事故发生概率、事故影响范围和路段平均车流量确定在某个交通事故情形下需求点的应急需求。然后,基于需求分析建立应急设施点选址模型。通过救援时间限制确定设施点的覆盖条件,选择救援时间短、物资供给能力强的待选点建立设施点。最后,采用基于拉格朗日松弛的启发式算法对模型进行求解。通过计算实例验证,该布局方法针对高速公路网的应急需求,保障了应

  15. AN APPROXIMATION ALGORITHM FOR THE SOFT-CAPACITATED DYNAMIC FACILITY LOCATION PROBLEM%软容量约束的动态设施选址问题的近似算法

    Institute of Scientific and Technical Information of China (English)

    姜春艳; 李改弟

    2012-01-01

    考虑软容量约束的动态设施选址问题.假设设施的开放费用及连接费用都与时间有关,而且每一个设施均有容量约束.对此问题给出了第一个近似比为6的原始对偶(组合)算法.运行贪婪增加程序后,近似比进一步改进到3.7052.%The paper considers the soft-capacitated dynamic facility location problem (SCDFLP). It is assumed that the facility open cost and the connection cost are time-dependent, and each facility has a capacity. We present the first primal-dual (combinatorial) approximation algorithm for the problem with approximation ratio 6 . We further improve the approximation ration to 3.7052 using greedy augmentation scheme.

  16. 精伊霍线机务设备选点、布点方案比选%Scheme Comparison for Selection and Arrangement of Locomotive Facility Location in Jinghe-Yili-Korgas Railway

    Institute of Scientific and Technical Information of China (English)

    高林生

    2012-01-01

    精伊霍线是乌鲁木齐铁路局管辖内的第一条电化铁路,由于相邻线既有机务设备均为内燃设备,所以本线机务设备选点、布点不当不仅影响近期使用效率,有可能还会在远期造成大量废弃工程.从客货流预测、相邻线既有机务设备、乌鲁木齐铁路局中长期规划以及自然条件与区域环境等方面进行大量的分析比较,并结合机务选点、布点一般原则形成本线机务设备选点、布点最终方案,为后续同类项目规划设计提供了很好的借鉴.%Jinghe-Yili-Korgas Railway is the first electrified railway under the jurisdiction of Urumqi Railway Administration. Improper selection and arrangement of locomotive facilities location in this railway will not only affect the recent utilization ratio but also result in a lot of waste works in the future because the existing locomotive facilities in adjacent railways are diesel facilities. This paper carries out extensive analysis and comparisons from these respects of prediction of passenger and freight flow, existing locomotive facilities in adjacent railways, medium and long term planning of Urumqi Railway Administration, natural condition and regional environment, etc. The final scheme of the selection and arrangement of locomotive facilities location in this line has been formed according to the general principles of locomotive location selection and arrangement, and it can provide the better reference for the planning and designing of similar projects in the future.

  17. A Research on a GIS-Based Location Planning for“Fitness Circle” Facilities of Community Sports%基于 GIS 的城市社区体育“健身圈”设施选址研究

    Institute of Scientific and Technical Information of China (English)

    顾校飞; 李南; 陆慧玲

    2014-01-01

    社区体育“健身圈”建设是一项政府工程,其设施的公益性,使用需求的连续分布及无明确设施位置候选点使得“健身圈”设施的选址不同于一般选址问题。基于“健身圈”设施选址的公平性和效率性原则,构建改进的区位集覆盖模型,以求解使设施完全有效覆盖居民区的最少设施点数及其位置。并运用GIS技术,将连续居民区离散化提取需求点,以需求点缓冲区优化设施位置候选点,从而构建设施选址网络,求解选址模型。最后,以无锡市为例,进行应用研究,以文字及二维地图形式形象表达求解结果。对政府落实《全民健身条例》,建设城乡社区体育“健身圈”具有重要意义。%The construction of “fitness circle” of community sports is a government project .Its public property , continuous distribution of demand and none-identified candidate set of facility location make it different from other facility location .Based on principles of fairness and efficiency , an improved LSCP model is established to acquire the minimal quantity and location of facilities , which can fully cover the community residents'demand .By applying GIS technology , not only is the continuous demand scattered so as to extract the discrete demand points , the candidate set of facility location is also identified by the buffer of demand points.Finally, a network of facility location is built, and the LSCP model solved by GIS.After taking Wuxi city for example , the location result is obtained via text and two-dimension map format , which is significant for the implement of National Fitness Program as well as the construction of “fitness circle” of community sports .

  18. A Two-stage Robust Optimization Model for Emergency Facility Location Problems under Uncertainties%不确定环境下应急设施选址问题两阶段鲁棒优化模型

    Institute of Scientific and Technical Information of China (English)

    杜博; 周泓

    2016-01-01

    For emergency logistics management,decision making of supply distribution facility location is important. According to the uncertainties in emergencies,a two-stage robust optimization model for emer-gency facility location problems to achieve coordination between“pre-location”and“re-location”is pro-posed. In the first stage when demand,cost and facility disruption is uncertain,in the consideration of dif-ferent needs of pre-disaster planning,post-disaster response and facility re-location,a robust“pre-loca-tion”model is presented based on p-center model. In the second stage,with the acquisition of post-disas-ter information,a“re-location”model for building new facilities is presented based on reactive repairing and adjustment for previous strategies. A numerical study shows the model is more effective than traditional p-center model for emergency facility location.%对于应急物流管理而言,应急物资集散中心选址是一个重要的决策要素。针对应急突发事件的不确定性特征,本文提出了一个应急设施选址问题两阶段鲁棒优化模型,以实现“预选址—重选址”两者的协同优化。第一阶段在需求和成本变动、设施损毁存在不确定因素的情况下,综合考虑选址策略在灾前规划、灾后反应、设施重建阶段的不同需求,建立了一种基于p-center的鲁棒“预选址”模型;第二阶段针对灾后新信息的获得,建立了一种基于反应式修复和调整策略的新建设施“重选址”模型。算例分析表明,本文模型对于应急设施选址问题比传统p-center模型更为合理有效。

  19. k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks

    Institute of Scientific and Technical Information of China (English)

    Hyeong-Il Kim; Jae-Woo Chang

    2013-01-01

    Recent development of wireless communication technologies and the popularity of smart phones are making location-based services (LBS) popular.However,requesting queries to LBS servers with users' exact locations may threat the privacy of users.Therefore,there have been many researches on generating a cloaked query region for user privacy protection.Consequently,an efficient query processing algorithm for a query region is required.So,in this paper,we propose k-nearest neighbor query (k-NN) processing algorithms for a query region in road networks.To efficiently retrieve k-NN points of interest (POIs),we make use of the Island index.We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage.Finally,we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor (kRNN) algorithm in terms of network expansion cost and query processing time.

  20. IPADE: Iterative prototype adjustment for nearest neighbor classification.

    Science.gov (United States)

    Triguero, Isaac; Garcia, Salvador; Herrera, Francisco

    2010-12-01

    Nearest prototype methods are a successful trend of many pattern classification tasks. However, they present several shortcomings such as time response, noise sensitivity, and storage requirements. Data reduction techniques are suitable to alleviate these drawbacks. Prototype generation is an appropriate process for data reduction, which allows the fitting of a dataset for nearest neighbor (NN) classification. This brief presents a methodology to learn iteratively the positioning of prototypes using real parameter optimization procedures. Concretely, we propose an iterative prototype adjustment technique based on differential evolution. The results obtained are contrasted with nonparametric statistical tests and show that our proposal consistently outperforms previously proposed methods, thus becoming a suitable tool in the task of enhancing the performance of the NN classifier.

  1. Fully Retroactive Approximate Range and Nearest Neighbor Searching

    CERN Document Server

    Goodrich, Michael T

    2011-01-01

    We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant $d$, a set of $n$ points in $\\R^d$ indexed by time such that we can perform insertions or deletions at any point in the timeline in $O(\\log n)$ amortized time. We support, for any small constant $\\epsilon>0$, $(1+\\epsilon)$-approximate range reporting queries at any point in the timeline in $O(\\log n + k)$ time, where $k$ is the output size. We also show how to answer $(1+\\epsilon)$-approximate nearest neighbor queries for any point in the past or present in $O(\\log n)$ time.

  2. THE NEAREST BISYMMETRIC SOLUTIONS OF LINEAR MATRIX EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Zhen-yun Peng; Xi-yan Hu; Lei Zhang

    2004-01-01

    The necessary and sufficient conditions for the existence of and the expressions for bismmetric soutions of the matrix equation(Ⅰ)A1X1B1+A2X2B2+…AkXkBk=D,(Ⅱ)A1XB1+A2XB2+…+AkXBk=D and (Ⅲ)(A1XB1,A2XB2,…,AkXBK)=(D1,D2,…,Dk) are derived by using kronecker product and Moore-Penrose generalized inverse of matrices. In addition, in corresponding solution set of the matrix equations, the explicit expression of the nearest matrix to a given matrix in the Frobenius norm is given.Numerical methods and numerical experiments of finding the nearest solutions are also provided.

  3. Partition function of nearest neighbour Ising models: Some new insights

    Indian Academy of Sciences (India)

    G Nandhini; M V Sangaranarayanan

    2009-09-01

    The partition function for one-dimensional nearest neighbour Ising models is estimated by summing all the energy terms in the Hamiltonian for N sites. The algebraic expression for the partition function is then employed to deduce the eigenvalues of the basic 2 × 2 matrix and the corresponding Hermitian Toeplitz matrix is derived using the Discrete Fourier Transform. A new recurrence relation pertaining to the partition function for two-dimensional Ising models in zero magnetic field is also proposed.

  4. Nearest-neighbor Entropy Estimators with Weak Metrics

    CERN Document Server

    Timofeev, Evgeniy

    2012-01-01

    A problem of improving the accuracy of nonparametric entropy estimation for a stationary ergodic process is considered. New weak metrics are introduced and relations between metrics, measures, and entropy are discussed. Based on weak metrics, a new nearest-neighbor entropy estimator is constructed and has a parameter with which the estimator is optimized to reduce its bias. It is shown that estimator's variance is upper-bounded by a nearly optimal Cramer-Rao lower bound.

  5. [Galaxy/quasar classification based on nearest neighbor method].

    Science.gov (United States)

    Li, Xiang-Ru; Lu, Yu; Zhou, Jian-Ming; Wang, Yong-Jun

    2011-09-01

    With the wide application of high-quality CCD in celestial spectrum imagery and the implementation of many large sky survey programs (e. g., Sloan Digital Sky Survey (SDSS), Two-degree-Field Galaxy Redshift Survey (2dF), Spectroscopic Survey Telescope (SST), Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) program and Large Synoptic Survey Telescope (LSST) program, etc.), celestial observational data are coming into the world like torrential rain. Therefore, to utilize them effectively and fully, research on automated processing methods for celestial data is imperative. In the present work, we investigated how to recognizing galaxies and quasars from spectra based on nearest neighbor method. Galaxies and quasars are extragalactic objects, they are far away from earth, and their spectra are usually contaminated by various noise. Therefore, it is a typical problem to recognize these two types of spectra in automatic spectra classification. Furthermore, the utilized method, nearest neighbor, is one of the most typical, classic, mature algorithms in pattern recognition and data mining, and often is used as a benchmark in developing novel algorithm. For applicability in practice, it is shown that the recognition ratio of nearest neighbor method (NN) is comparable to the best results reported in the literature based on more complicated methods, and the superiority of NN is that this method does not need to be trained, which is useful in incremental learning and parallel computation in mass spectral data processing. In conclusion, the results in this work are helpful for studying galaxies and quasars spectra classification.

  6. K-nearest uphill clustering in the protein structure space

    KAUST Repository

    Cui, Xuefeng

    2016-08-26

    The protein structure classification problem, which is to assign a protein structure to a cluster of similar proteins, is one of the most fundamental problems in the construction and application of the protein structure space. Early manually curated protein structure classifications (e.g., SCOP and CATH) are very successful, but recently suffer the slow updating problem because of the increased throughput of newly solved protein structures. Thus, fully automatic methods to cluster proteins in the protein structure space have been designed and developed. In this study, we observed that the SCOP superfamilies are highly consistent with clustering trees representing hierarchical clustering procedures, but the tree cutting is very challenging and becomes the bottleneck of clustering accuracy. To overcome this challenge, we proposed a novel density-based K-nearest uphill clustering method that effectively eliminates noisy pairwise protein structure similarities and identifies density peaks as cluster centers. Specifically, the density peaks are identified based on K-nearest uphills (i.e., proteins with higher densities) and K-nearest neighbors. To our knowledge, this is the first attempt to apply and develop density-based clustering methods in the protein structure space. Our results show that our density-based clustering method outperforms the state-of-the-art clustering methods previously applied to the problem. Moreover, we observed that computational methods and human experts could produce highly similar clusters at high precision values, while computational methods also suggest to split some large superfamilies into smaller clusters. © 2016 Elsevier B.V.

  7. RESIDENCE REASONS AND LOCATION SELECTION OF WELFARE FACILITIES FOR THE ELDERLY IN BEIJING: THE IDEAL WAY TO ALLOCATE WELFARE FACILITIES FOR THE ELDERLY%北京养老服务机构入住理由及位置选择的初探——关于合理布局建设养老服务机构

    Institute of Scientific and Technical Information of China (English)

    戴维; 羚木博志; 长谷川直树

    2012-01-01

    This paper reports the residence reasons and location selection of the welfare facilities for the elderly in Beijing. First, we investigated the current situation of welfare facilities for the elderly in Beijing. Second, we executed the survey to collect the resident's characteristics and reasons for their residence. Then we analyzed the relationship between the locations of the elderly home, their children's home and the facilities. We found that the elderly would like to select the facilities near to their children. According those results, we proposed the ideal way to allocate the welfare facilities for the elderly.%通过对北京市养老服务机构的入住老人进行问卷调研,解析老人的入住理由.老人在机构选择意向中重视“离子女居住地近”的要素,并在实际选择入住时,呈现选择离子女居住地较近机构的趋势.根据该倾向,研究通过整理各功能区特征,为解决北京市养老服务机构入住率分布不均衡的现状,提出各功能区养老机构的规划建设见解.

  8. A Synchrotron-Based Facility for the in-situ Location, Chemical and Mineralogical Characterization of ~10 um Particles Captured in Aerogel

    Energy Technology Data Exchange (ETDEWEB)

    Flynn, G.; Sutton, S; Lanzirotti, A

    2009-01-01

    NASA's Stardust mission collected dust from the coma of Comet Wild-2 on January 2nd, 2004, by direct capture into aerogel cells that flew through the dust coma at 6 km/s. Stardust collected several hundred comet particles >10 {mu}m in size. These comet samples were delivered to Earth on January 15th, 2006. We developed a facility at the National Synchrotron Light Source at Brookhaven National Laboratory (Upton, NY, USA) for the in-situ characterization of 10 {mu}m particles collected in aerogel. These analytical instruments allow us to perform extensive chemical, mineralogical, and size-frequency characterization of particles captured in aerogel. These analyses are conducted without any invasive extraction, minimizing the possibility of contamination or particle loss during preparation. This facility was used to determine the chemical composition, the oxidation state, the mineralogy and to provide an indication of the grain size of the Wild-2 particles before they were removed from the aerogel. This information provides a catalog of particle types, allowing a more reasoned allocation of the particles to subsequent investigators based on a relatively detailed knowledge of the chemical composition and mineralogy of each particle. These measurements allowed a comparison of the chemical and mineralogical properties of the Wild-2 particles with other types of extraterrestrial materials, including interplanetary dust particles and meteorites. The success of in-situ analysis for Wild 2 particles demonstrates that synchrotron-based facilities will be important for the analysis of particles collected in aerogel on future earth-orbiting satellites and spacecraft.

  9. Providing a USSD location based clinic finder in South Africa: did it work?

    Science.gov (United States)

    Parsons, Annie Neo; Timler, Dagmar

    2014-01-01

    A new mHealth service, Clinic Finder, was designed to provide a location-based service for any cellphone user in South Africa dialing a dedicated USSD string to find the nearest public primary health care facility. The service was funded by a European Union grant to Cell-Life to support the National Department of Health. Clinic Finder's aims were to provide a reliable and accurate service, and to assess both the most effective means of advertising the service as well as interest in the service. Users dialing the USSD string are asked to agree to geo-location (Vodacom and MTN users) or asked to enter their province, town and street (virtual network users and those choosing not to geo-locate). The service provider, AAT, sends the data to Cell-Life where an SMS with details of the nearest public primary health care facility is sent to the user by Cell-Life's open-source Communicate platform. The service was advertised on 3 days in 2014 using two different means: a newspaper ad on 20 May 2014 and Please Call Me ads on 30 July 2014 and 14 August 2014. 28.2% of unique users on 20 May 2014, 10.5% of unique users on 30 July 2014 and 92.8% of unique users on 14 August 2014 who agreed to geo-location successfully received SMSs. However, only 4.2%, 0.5%, and 2.4% of unique users responding to each advertisement who did not geo-locate then received an SMS. A small survey of users following the 20 May 2014 newspaper ad found overall interest in the idea of Clinic Finder, though unsuccessful users were more likely to dislike the service. The overall experience of using location based services and USSD for Clinic Finder suggests a need in the field of mHealth for wider availability of data on service usability and effectiveness.

  10. Partition function zeros of a square-lattice homopolymer with nearest- and next-nearest-neighbor interactions.

    Science.gov (United States)

    Lee, Jae Hwan; Kim, Seung-Yeon; Lee, Julian

    2013-05-01

    We study distributions of the partition function zeros in the complex temperature plane for a square-lattice homopolymer with nearest-neighbor (NN) and next-nearest-neighbor (NNN) interactions. The dependence of distributions on the ratio of NN and NNN interaction strengths R is examined. The finite-size scaling of the zeros is performed to obtain the crossover exponent, which is shown to be independent of R within error bars, suggesting that all of these models belong to the same universality class. The transition temperatures are also computed by the zeros to obtain the phase diagram, and the results confirm that the model with stronger NNN interaction exhibits stronger effects of cooperativity.

  11. Risk management study for the retired Hanford Site facilities: Qualitative risk evaluation for the retired Hanford Site facilities. Volume 3

    Energy Technology Data Exchange (ETDEWEB)

    Coles, G.A.; Shultz, M.V.; Taylor, W.E.

    1993-09-01

    This document provides a risk evaluation of the 100 and 200 Area retired, surplus facilities on the Hanford Site. Also included are the related data that were compiled by the risk evaluation team during investigations performed on the facilities. Results are the product of a major effort performed in fiscal year 1993 to produce qualitative information that characterizes certain risks associated with these facilities. The retired facilities investigated for this evaluation are located in the 100 and 200 Areas of the 1,450-km{sup 2} (570-mi{sup 2}) Hanford Site. The Hanford Site is a semiarid tract of land in southeastern Washington State. The nearest population center is Richland, Washington, (population 32,000) 30-km (20 mi) southeast of the 200 Area. During walkdown investigations of these facilities, data on real and potential hazards that threatened human health or safety or created potential environmental release issues were identified by the risk evaluation team. Using these findings, the team categorized the identified hazards by facility and evaluated the risk associated with each hazard. The factors contributing to each risk, and the consequence and likelihood of harm associated with each hazard also are included in this evaluation.

  12. Cold Vacuum Drying Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Located near the K-Basins (see K-Basins link) in Hanford's 100 Area is a facility called the Cold Vacuum Drying Facility (CVDF).Between 2000 and 2004, workers at the...

  13. Integrated Disposal Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Located near the center of the 586-square-mile Hanford Site is the Integrated Disposal Facility, also known as the IDF.This facility is a landfill similar in concept...

  14. Environmental Toxicology Research Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Fully-equipped facilities for environmental toxicology researchThe Environmental Toxicology Research Facility (ETRF) located in Vicksburg, MS provides over 8,200 ft...

  15. A location-specific spreadsheet for estimating Zika risk and timing for Zika vector surveillance, using US military facilities as an example.

    Science.gov (United States)

    Foley, Desmond H; Pecor, David B

    2017-01-01

    Local Zika virus transmission in the United States involving one or both of the known vector species, Aedes aegypti and Ae. albopictus, is of major concern. To assist efforts to anticipate the risks of transmission, we developed an Excel spreadsheet tool that uses vector and virus temperature thresholds, remotely sensed maximum temperature, and habitat suitability models to answer the questions: "is Zika transmission likely here?" and "when should we conduct vector surveillance?" An example spreadsheet, updated regularly and freely available, uses near real-time and forecast temperature data to generate guidance, based on a novel four level Zika risk code, for 733 US military facilities in the 50 states, the District of Columbia, and the territories of Guam and Puerto Rico.

  16. Simulating ensembles of source water quality using a K-nearest neighbor resampling approach.

    Science.gov (United States)

    Towler, Erin; Rajagopalan, Balaji; Seidel, Chad; Summers, R Scott

    2009-03-01

    Climatological, geological, and water management factors can cause significant variability in surface water quality. As drinking water quality standards become more stringent, the ability to quantify the variability of source water quality becomes more important for decision-making and planning in water treatment for regulatory compliance. However, paucity of long-term water quality data makes it challenging to apply traditional simulation techniques. To overcome this limitation, we have developed and applied a robust nonparametric K-nearest neighbor (K-nn) bootstrap approach utilizing the United States Environmental Protection Agency's Information Collection Rule (ICR) data. In this technique, first an appropriate "feature vector" is formed from the best available explanatory variables. The nearest neighbors to the feature vector are identified from the ICR data and are resampled using a weight function. Repetition of this results in water quality ensembles, and consequently the distribution and the quantification of the variability. The main strengths of the approach are its flexibility, simplicity, and the ability to use a large amount of spatial data with limited temporal extent to provide water quality ensembles for any given location. We demonstrate this approach by applying it to simulate monthly ensembles of total organic carbon for two utilities in the U.S. with very different watersheds and to alkalinity and bromide at two other U.S. utilities.

  17. Reason's Nearest Kin Philosophies of Arithmetic from Kant to Carnap

    CERN Document Server

    Potter, Michael

    2000-01-01

    How do we account for the truth of arithmetic? And if it does not depend for its truth on the way the world is, what constrains the world to conform to arithmetic? Reason's Nearest Kin is a critical examination of the astonishing progress made towards answering these questions from the late nineteenth to the mid-twentieth century. In the space of fifty years Frege, Dedekind, Russell, Wittgenstein, Ramsey, Hilbert, and Carnap developed accounts of the content of arithmeticthat were brilliantly original both technically and philosophically. Michael Potter's innovative study presents them all as

  18. Boundary effect correction in k-nearest-neighbor estimation.

    Science.gov (United States)

    Alizad Rahvar, A R; Ardakani, M

    2011-05-01

    The problem of the boundary effect for the k-nearest-neighbor (kNN) estimation is addressed, and a correction method is suggested. The correction is proposed for bounded distributions, but it can be used for any set of bounded samples. We apply the proposed correction to entropy estimation of multidimensional distributions and time series, and this correction reduces considerably the bias and statistical errors in the estimation. For a small sample size or high-dimensional data, the corrected estimator outperforms the uncorrected estimator significantly. This advantage makes the kNN method applicable to more real-life situations, e.g., the analysis of biological and molecular data.

  19. Application of Nearest Neighbor Indices in Persian Oak (Quercus brantii var. persica Coppice Stands of Zagros Forests

    Directory of Open Access Journals (Sweden)

    Y. Erfanifard

    2014-03-01

    Full Text Available The ecological relationship between trees is important in the sustainable management of forests. Studying this relationship in spatial ecology, different indices are applied that are based on distance to nearest neighbor. The aim of this research was introduction of important indices based on nearest neighbor analysis and their application in the investigation of ecological relationship between Persian oak coppice trees in Zagros forests. A 9 ha plot of these forests in Kohgilouye - BoyerAhmad province was selected that was completely homogeneous. This plot was covered with Persian oak coppice trees that their point map was obtained after registering their spatial location. Five nearest neighbor indices of G(r, F(r, J(r, GF(r and CE were then applied to study the spatial pattern and relationship of these trees. The results showed that Persian oak coppice trees were located regularly in the homogeneous plot and they were not dependent ecologically. These trees were independent and did not affect the establishment of each other.

  20. Region 9 NPDES Facilities

    Data.gov (United States)

    U.S. Environmental Protection Agency — Point geospatial dataset representing locations of NPDES Facilities. NPDES (National Pollution Discharge Elimination System) is an EPA permit program that regulates...

  1. Geospatial Data Analysis Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Geospatial application development, location-based services, spatial modeling, and spatial analysis are examples of the many research applications that this facility...

  2. Pavement Testing Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Comprehensive Environmental and Structural Analyses The ERDC Pavement Testing Facility, located on the ERDC Vicksburg campus, was originally constructed to provide...

  3. Pavement Testing Facility

    Data.gov (United States)

    Federal Laboratory Consortium — Comprehensive Environmental and Structural AnalysesThe ERDC Pavement Testing Facility, located on the ERDC Vicksburg campus, was originally constructed to provide an...

  4. An Approximation Algorithm for the Dynamic Facility Location Problem with Penalties%带惩罚的动态设施选址问题的近似算法

    Institute of Scientific and Technical Information of China (English)

    姜春艳; 徐大川

    2009-01-01

    In this paper, we study the dynamic facility location problem with penalties. In this problem, we assume that the facility cost, the service cost, and the demand and penalty of each client maybe different at each time period. At each time period, a client can be served by an opened facility or rejected by paying a penalty. We obtain the first (combinatorial) approximation algorithm with a performance factor of 1.8526 for this problem.%本文研究带惩罚的动态设施选址问题,在该问题中假设不同时段内设施的开放费用、用户的需求及连接费用可以不相同,而且允许用户的需求不被满足,但是要有惩罚.对此问题我们给出了第-个近似比为1.8526的原始对偶(组合)算法.

  5. Nearest neighbour models for local and regional avalanche forecasting

    Directory of Open Access Journals (Sweden)

    M. Gassner

    2002-01-01

    Full Text Available This paper presents two avalanche forecasting applications NXD2000 and NXD-REG which were developed at the Swiss Federal Institute for Snow and Avalanche Re-search (SLF. Even both are based on the nearest neighbour method they are targeted to different scales. NXD2000 is used to forecast avalanches on a local scale. It is operated by avalanche forecasters responsible for snow safety at snow sport areas, villages or cross country roads. The area covered ranges from 10 km2 up to 100 km2 depending on the climatological homogeneity. It provides the forecaster with ten most similar days to a given situation. The observed avalanches of these days are an indication of the actual avalanche danger. NXD-REG is used operationally by the Swiss avalanche warning service for regional avalanche forecasting. The Nearest Neighbour approach is applied to the data sets of 60 observer stations. The results of each station are then compiled into a map of current and future avalanche hazard. Evaluation of the model by cross-validation has shown that the model can reproduce the official SLF avalanche forecasts in about 52% of the days.

  6. Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree

    CERN Document Server

    Marinho, Eraldo Pereira

    2011-01-01

    We present a variant of the hyper-quadtree that divides a multidimensional space according to the hyperplanes associated to the principal components of the data in each hyperquadrant. Each of the $2^\\lambda$ hyper-quadrants is a data partition in a $\\lambda$-dimension subspace, whose intrinsic dimensionality $\\lambda\\leq d$ is reduced from the root dimensionality $d$ by the principal components analysis, which discards the irrelevant eigenvalues of the local covariance matrix. In the present method a component is irrelevant if its length is smaller than, or comparable to, the local inter-data spacing. Thus, the covariance hyper-quadtree is fully adaptive to the local dimensionality. The proposed data-structure is used to compute the anisotropic K nearest neighbors (kNN), supported by the Mahalanobis metric. As an application, we used the present k nearest neighbors method to perform density estimation over a noisy data distribution. Such estimation method can be further incorporated to the smoothed particle h...

  7. Using K-Nearest Neighbor in Optical Character Recognition

    Directory of Open Access Journals (Sweden)

    Veronica Ong

    2016-03-01

    Full Text Available The growth in computer vision technology has aided society with various kinds of tasks. One of these tasks is the ability of recognizing text contained in an image, or usually referred to as Optical Character Recognition (OCR. There are many kinds of algorithms that can be implemented into an OCR. The K-Nearest Neighbor is one such algorithm. This research aims to find out the process behind the OCR mechanism by using K-Nearest Neighbor algorithm; one of the most influential machine learning algorithms. It also aims to find out how precise the algorithm is in an OCR program. To do that, a simple OCR program to classify alphabets of capital letters is made to produce and compare real results. The result of this research yielded a maximum of 76.9% accuracy with 200 training samples per alphabet. A set of reasons are also given as to why the program is able to reach said level of accuracy.

  8. Chloroplasts move towards the nearest anticlinal walls under dark condition.

    Science.gov (United States)

    Tsuboi, Hidenori; Wada, Masamitsu

    2012-03-01

    Chloroplasts change their intracellular positions in response to their light environment. Under darkness, chloroplasts assume special positions that are different from those under light conditions. Here, we analyzed chloroplast dark positioning using Adiantum capillus-veneris gametophyte cells. When chloroplasts were transferred into darkness, during the first 1-5 h, they moved towards the anticlinal cell walls bordering the adjacent cells rather rapidly. Then, they slowed down and accumulated at the anticlinal walls gradually over the following 24-36 h. The chloroplast movements could be roughly classified into two different categories: initial rapid straight movement and later, slow staggering movement. When the chloroplast accumulation response was induced in dark-adapted cells by partial cell irradiation with a microbeam targeted to the center of the cells, chloroplasts moved towards the beam spot from the anticlinal walls. However, when the microbeam was switched off, they moved to the nearest anticlinal walls and not to their original positions if they were not the closest, indicating that they know the direction of the nearest anticlinal wall and do not have particular areas that they migrate to during dark positioning.

  9. Racial disparities in travel time to radiotherapy facilities in the Atlanta metropolitan area.

    Science.gov (United States)

    Peipins, Lucy A; Graham, Shannon; Young, Randall; Lewis, Brian; Flanagan, Barry

    2013-07-01

    Low-income women with breast cancer who rely on public transportation may have difficulty in completing recommended radiation therapy due to inadequate access to radiation facilities. Using a geographic information system (GIS) and network analysis we quantified spatial accessibility to radiation treatment facilities in the Atlanta, Georgia metropolitan area. We built a transportation network model that included all bus and rail routes and stops, system transfers and walk and wait times experienced by public transportation system travelers. We also built a private transportation network to model travel times by automobile. We calculated travel times to radiation therapy facilities via public and private transportation from a population-weighted center of each census tract located within the study area. We broadly grouped the tracts by low, medium and high household access to a private vehicle and by race. Facility service areas were created using the network model to map the extent of areal coverage at specified travel times (30, 45 and 60 min) for both public and private modes of transportation. The median public transportation travel time to the nearest radiotherapy facility was 56 min vs. approximately 8 min by private vehicle. We found that majority black census tracts had longer public transportation travel times than white tracts across all categories of vehicle access and that 39% of women in the study area had longer than 1 h of public transportation travel time to the nearest facility. In addition, service area analyses identified locations where the travel time barriers are the greatest. Spatial inaccessibility, especially for women who must use public transportation, is one of the barriers they face in receiving optimal treatment. Published by Elsevier Ltd.

  10. 基于改进层次分析法的GIS公共服务设施选址%GIS Location of Public Service Facilities Based on Improved AHP

    Institute of Scientific and Technical Information of China (English)

    刘李霞; 毕华兴; 孔宪娟; 李宇飞; 王昆; 许华森; 鲍彪

    2011-01-01

    已有的公共服务设施选址模型较复杂且应用范围受限,无法作为通用模型出现.层次分析法可作为选址的通用模型,但单独使用层次分析法在空间分析方面仍有欠缺,单纯的GIS在复杂指标权重的处理方面存在很大不合理性.该文对层次分析法进行了改进,使之更适用于GIS的数据结构,将改进的层次分析法与GIS技术结合,成为公共服务设施选址更合理的选址模型和方法.以河北省黄骅市中学选址为例验证模型和方法的可用性.%Layout of public service facilities, which is directly related to life quality of the residents,has great influence on the construction and operation of the community. It has become an important task of the urban planning &. Management and the coordination of national and regional sustainable development Though many scholars do a lot of researches on location model of public service facilities, they cannot be a general model for their relatively complex and highly targeted. Location model using AHP has been verified. It can appear as a general location model as it's systematic,flexible,simple,and can deal with the experience of human in a scientific way. GIS as an emerging technology,whose powerful spatial analysis function makes the database location will be more systematic and efficient,and make advantages combined and inferior complementary attribute information attached to the spatial location and forms a complex structure of spatial information. However, using AHP alone is still not entirely satisfactory in the spatial analysis,and using GIS alone is especially irrational for the treatment of the weights of the impact indexes. In this paper,an improved AHP model is raised in order to be fit for GIS data structure. And then,GIS spatial a-nalysis and improved AHP model are combined in order to make a better model and method for locatioa At last, location of Huanghua middle school in Hebei is taken as an example, which shows the

  11. Effects of nearshore evaporation rates on the design of seabed gallery intake systems for SWRO facilities located along the Red Sea shoreline of Saudi Arabia

    KAUST Repository

    Dehwah, Abdullah H.A.

    2015-10-12

    Feed water to seawater reverse osmosis desalination systems should have a constant salinity with minimal variation. Intake systems that extract water from shallow nearshore areas in arid regions can exhibit significant fluctuations in salinity caused by high rates of evaporation and lack of circulation. Such fluctuations in salinity could inhibit the design, construction, and operation of seabed gallery intake systems located in shallow nearshore areas, such as the Red Sea inner shelf. Water depths range from 0 to 2 m between the beach and the edge of the fringing reef in the optimal locations for the development of seabed gallery intakes along the coast of the Red Sea of Saudi Arabia. The evaporation rate in this area is between 2 and 3 m per year. The bottom consists of mostly a marine hardground containing a thin veneer of unlithified sediment and no significant cover of corals or seagrass. The rather barren nature of the bottom suggests that periodic hypersalinity may contribute to the formation of hardgrounds on the bottom by causing supersaturation of the seawater with calcium carbonate and may limit the growth of corals and grasses. To assess the changes in salinity, a conceptual model was developed which assumes that a shallow circulation cell develops between the shoreline and deeper water offshore. Lower salinity seawater should migrate landward to replace water loss caused by evaporation with seaward moving of high-salinity water occurring along the bottom to balance the flow with ultimate mixing before the reef tract. To test this circulation pattern, a series of sensors were deployed to continuously monitor the water temperature, conductivity, and salinity at the surface and at the bottom during several periods of high air temperature. Surprisingly, the results show very little variation in salinity, despite the very high evaporation loss. The water salinity ranged between 39,000 and 40,000 mg/L with no diurnal variations of significance. Based on the

  12. Exact value of the ground state energy of the linear antiferromagnetic Heisenberg chain with nearest and next-nearest neighbour interactions

    NARCIS (Netherlands)

    Broek, van den P.M.

    1980-01-01

    It is shown that the ground state energy of the hamiltonian H = Σ Si · Si+1 + γΣSi · Si+2 for the linear antiferromagnetic Heisenberg chain with nearest and next-nearest neighbour interactions is equal to -3/2 if γ = 1/2.

  13. Estimating Groundwater Concentrations from Mass Releases to the Aquifer at Integrated Disposal Facility and Tank Farm Locations Within the Central Plateau of the Hanford Site

    Energy Technology Data Exchange (ETDEWEB)

    Bergeron, Marcel P.; Freeman, Eugene J.

    2005-06-09

    This report summarizes groundwater-related numerical calculations that will support groundwater flow and transport analyses associated with the scheduled 2005 performance assessment of the Integrated Disposal Facility (IDF) at the Hanford Site. The report also provides potential supporting information to other ongoing Hanford Site risk analyses associated with the closure of single-shell tank farms and related actions. The IDF 2005 performance assessment analysis is using well intercept factors (WIFs), as outlined in the 2001 performance assessment of the IDF. The flow and transport analyses applied to these calculations use both a site-wide regional-scale model and a local-scale model of the area near the IDF. The regional-scale model is used to evaluate flow conditions, groundwater transport, and impacts from the IDF in the central part of the Hanford Site, at the core zone boundary around the 200 East and 200 West Areas, and along the Columbia River. The local-scale model is used to evaluate impacts from transport of contaminants to a hypothetical well 100 m downgradient from the IDF boundaries. Analyses similar to the regional-scale analysis of IDF releases are also provided at individual tank farm areas as additional information. To gain insight on how the WIF approach compares with other approaches for estimating groundwater concentrations from mass releases to the unconfined aquifer, groundwater concentrations were estimated with the WIF approach for two hypothetical release scenarios and compared with similar results using a calculational approach (the convolution approach). One release scenario evaluated with both approaches (WIF and convolution) involved a long-term source release from immobilized low-activity waste glass containing 25,550 Ci of technetium-99 near the IDF; another involved a hypothetical shorter-term release of {approx}0.7 Ci of technetium over 600 years from the S-SX tank farm area. In addition, direct simulation results for both release

  14. An RFID Indoor Positioning Algorithm Based on Bayesian Probability and K-Nearest Neighbor

    Science.gov (United States)

    Ding, Ye; Li, Peng; Wang, Ruchuan; Li, Yizhu

    2017-01-01

    The Global Positioning System (GPS) is widely used in outdoor environmental positioning. However, GPS cannot support indoor positioning because there is no signal for positioning in an indoor environment. Nowadays, there are many situations which require indoor positioning, such as searching for a book in a library, looking for luggage in an airport, emergence navigation for fire alarms, robot location, etc. Many technologies, such as ultrasonic, sensors, Bluetooth, WiFi, magnetic field, Radio Frequency Identification (RFID), etc., are used to perform indoor positioning. Compared with other technologies, RFID used in indoor positioning is more cost and energy efficient. The Traditional RFID indoor positioning algorithm LANDMARC utilizes a Received Signal Strength (RSS) indicator to track objects. However, the RSS value is easily affected by environmental noise and other interference. In this paper, our purpose is to reduce the location fluctuation and error caused by multipath and environmental interference in LANDMARC. We propose a novel indoor positioning algorithm based on Bayesian probability and K-Nearest Neighbor (BKNN). The experimental results show that the Gaussian filter can filter some abnormal RSS values. The proposed BKNN algorithm has the smallest location error compared with the Gaussian-based algorithm, LANDMARC and an improved KNN algorithm. The average error in location estimation is about 15 cm using our method. PMID:28783073

  15. An RFID Indoor Positioning Algorithm Based on Bayesian Probability and K-Nearest Neighbor

    Directory of Open Access Journals (Sweden)

    He Xu

    2017-08-01

    Full Text Available The Global Positioning System (GPS is widely used in outdoor environmental positioning. However, GPS cannot support indoor positioning because there is no signal for positioning in an indoor environment. Nowadays, there are many situations which require indoor positioning, such as searching for a book in a library, looking for luggage in an airport, emergence navigation for fire alarms, robot location, etc. Many technologies, such as ultrasonic, sensors, Bluetooth, WiFi, magnetic field, Radio Frequency Identification (RFID, etc., are used to perform indoor positioning. Compared with other technologies, RFID used in indoor positioning is more cost and energy efficient. The Traditional RFID indoor positioning algorithm LANDMARC utilizes a Received Signal Strength (RSS indicator to track objects. However, the RSS value is easily affected by environmental noise and other interference. In this paper, our purpose is to reduce the location fluctuation and error caused by multipath and environmental interference in LANDMARC. We propose a novel indoor positioning algorithm based on Bayesian probability and K-Nearest Neighbor (BKNN. The experimental results show that the Gaussian filter can filter some abnormal RSS values. The proposed BKNN algorithm has the smallest location error compared with the Gaussian-based algorithm, LANDMARC and an improved KNN algorithm. The average error in location estimation is about 15 cm using our method.

  16. An RFID Indoor Positioning Algorithm Based on Bayesian Probability and K-Nearest Neighbor.

    Science.gov (United States)

    Xu, He; Ding, Ye; Li, Peng; Wang, Ruchuan; Li, Yizhu

    2017-08-05

    The Global Positioning System (GPS) is widely used in outdoor environmental positioning. However, GPS cannot support indoor positioning because there is no signal for positioning in an indoor environment. Nowadays, there are many situations which require indoor positioning, such as searching for a book in a library, looking for luggage in an airport, emergence navigation for fire alarms, robot location, etc. Many technologies, such as ultrasonic, sensors, Bluetooth, WiFi, magnetic field, Radio Frequency Identification (RFID), etc., are used to perform indoor positioning. Compared with other technologies, RFID used in indoor positioning is more cost and energy efficient. The Traditional RFID indoor positioning algorithm LANDMARC utilizes a Received Signal Strength (RSS) indicator to track objects. However, the RSS value is easily affected by environmental noise and other interference. In this paper, our purpose is to reduce the location fluctuation and error caused by multipath and environmental interference in LANDMARC. We propose a novel indoor positioning algorithm based on Bayesian probability and K-Nearest Neighbor (BKNN). The experimental results show that the Gaussian filter can filter some abnormal RSS values. The proposed BKNN algorithm has the smallest location error compared with the Gaussian-based algorithm, LANDMARC and an improved KNN algorithm. The average error in location estimation is about 15 cm using our method.

  17. Risk management study for the Hanford Site facilities: Risk reduction cost comparison for the retired Hanford Site facilities. Volume 4

    Energy Technology Data Exchange (ETDEWEB)

    Coles, G.A.; Egge, R.G.; Senger, E.; Shultz, M.W.; Taylor, W.E.

    1994-02-01

    This document provides a cost-comparison evaluation for implementing certain risk-reduction measures and their effect on the overall risk of the 100 and 200 Area retired, surplus facilities. The evaluation is based on conditions that existed at the time the risk evaluation team performed facility investigations, and does not acknowledge risk-reduction measures that occurred soon after risk identification. This evaluation is one part of an overall risk management study for these facilities. The retired facilities investigated for this evaluation are located in the 100 and 200 Areas of the 1450-km{sup 2} Hanford Site. The Hanford Site is a semiarid tract of land in southeastern Washington State. The nearest population center is Richland, Washington, (population 32,000) 30 km southeast of the 200 Area. This cost-comparison evaluation (1) determines relative costs for reducing risk to acceptable levels; (2) compares the cost of reducing risk using different risk-reduction options; and (3) compares the cost of reducing risks at different facilities. The result is an identification of the cost effective risk-reduction measures. Supporting information required to develop costs of the various risk-reduction options also is included.

  18. Dynamics of Ising spin chains with nearest-neighbour and next-nearest-neighbour interactions in random fields

    Science.gov (United States)

    Ismail, G.; Bannora, K.; Hassan, S.

    2004-12-01

    A one-dimensional system of six coupled random field Ising spins is studied by Glauber dynamics. The nearest-neighbour and next-nearest-neighbour interactions are taken into consideration. Two distributions of random fields (RF) - binary and Gaussian distribution - are investigated. We consider four cases of exchange couplings: ferro-ferromagnetic (F-F), ferro-antiferromagnetic (F-AF), antiferro-ferromagnetic (AF-F) and antiferro-antiferromagnetic (AF-AF). The system is fully frustrated, undergoes a zero-temperature phase transition and has multiple local energy minima in both distributions. The dynamics of the four systems are solved exactly in both distributions of RF. The effects of random fields are discussed. The number of diverging relaxation times is equal to the number of energy minima minus one. The longest relaxation times verify the Arrhenius law with energy barrier determined by the energy needed to invert the ground-state spin configuration. At low temperatures, according to the Arrhenius law, the spectrum of relaxation times shows a double-peak distribution on a logarithmic scale. In the Gaussian distribution of RF the energy-barrier distribution is continuous while it is quasi-discrete in the binary distribution.

  19. Allocation and Location of Transport Logistics Centres

    Directory of Open Access Journals (Sweden)

    D. Mocková

    2010-01-01

    Full Text Available The facility allocation problem sets out to determine the optimal number of facilities to be opened. Based on multiple criteria evaluation, the optimal location of the facilities is usually solved subsequently. Several considerations, e.g. technical parameters, costs and finance must be taken into account. Economic analysis is carried out on the basis of the specific instance of the problem.Let us assume that the number of potentially located facilities is known. Then the problem of the optimal location of a given number of facilities in a network is referred to as the facility location problem. The solution to the problem is a set of facilities optimally located in an area such that this area is fully covered by the required services that the facilities provide. An example of a real-life problem of this type is the location of logistics centers. 

  20. Designing lattice structures with maximal nearest-neighbor entanglement

    Energy Technology Data Exchange (ETDEWEB)

    Navarro-Munoz, J C; Lopez-Sandoval, R [Instituto Potosino de Investigacion CientIfica y Tecnologica, Camino a la presa San Jose 2055, 78216 San Luis Potosi (Mexico); Garcia, M E [Theoretische Physik, FB 18, Universitaet Kassel and Center for Interdisciplinary Nanostructure Science and Technology (CINSaT), Heinrich-Plett-Str.40, 34132 Kassel (Germany)

    2009-08-07

    In this paper, we study the numerical optimization of nearest-neighbor concurrence of bipartite one- and two-dimensional lattices, as well as non-bipartite two-dimensional lattices. These systems are described in the framework of a tight-binding Hamiltonian while the optimization of concurrence was performed using genetic algorithms. Our results show that the concurrence of the optimized lattice structures is considerably higher than that of non-optimized systems. In the case of one-dimensional chains, the concurrence increases dramatically when the system begins to dimerize, i.e., it undergoes a structural phase transition (Peierls distortion). This result is consistent with the idea that entanglement is maximal or shows a singularity near quantum phase transitions. Moreover, the optimization of concurrence in two-dimensional bipartite and non-bipartite lattices is achieved when the structures break into smaller subsystems, which are arranged in geometrically distinguishable configurations.

  1. Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors

    Science.gov (United States)

    Terasawa, Kengo; Tanaka, Yuzuru

    This paper describes a novel algorithm for approximate nearest neighbor searching. For solving this problem especially in high dimensional spaces, one of the best-known algorithm is Locality-Sensitive Hashing (LSH). This paper presents a variant of the LSH algorithm that outperforms previously proposed methods when the dataset consists of vectors normalized to unit length, which is often the case in pattern recognition. The LSH scheme is based on a family of hash functions that preserves the locality of points. This paper points out that for our special case problem we can design efficient hash functions that map a point on the hypersphere into the closest vertex of the randomly rotated regular polytope. The computational analysis confirmed that the proposed method could improve the exponent ρ, the main indicator of the performance of the LSH algorithm. The practical experiments also supported the efficiency of our algorithm both in time and in space.

  2. Nearest Neighbor Estimates of Entropy for Multivariate Circular Distributions

    Directory of Open Access Journals (Sweden)

    Neeraj Misra

    2010-05-01

    Full Text Available In molecular sciences, the estimation of entropies of molecules is important for the understanding of many chemical and biological processes. Motivated by these applications, we consider the problem of estimating the entropies of circular random vectors and introduce non-parametric estimators based on circular distances between n sample points and their k th nearest neighbors (NN, where k (≤ n – 1 is a fixed positive integer. The proposed NN estimators are based on two different circular distances, and are proven to be asymptotically unbiased and consistent. The performance of one of the circular-distance estimators is investigated and compared with that of the already established Euclidean-distance NN estimator using Monte Carlo samples from an analytic distribution of six circular variables of an exactly known entropy and a large sample of seven internal-rotation angles in the molecule of tartaric acid, obtained by a realistic molecular-dynamics simulation.

  3. Floating-Point Arithmetic on Round-to-Nearest Representations

    CERN Document Server

    Kornerup, Peter; Panhaleux, Adrien

    2012-01-01

    Recently we introduced a class of number representations denoted RN-representations, allowing an un-biased rounding-to-nearest to take place by a simple truncation. In this paper we briefly review the binary fixed-point representation in an encoding which is essentially an ordinary 2's complement representation with an appended round-bit. Not only is this rounding a constant time operation, so is also sign inversion, both of which are at best log-time operations on ordinary 2's complement representations. Addition, multiplication and division is defined in such a way that rounding information can be carried along in a meaningful way, at minimal cost. Based on the fixed-point encoding we here define a floating point representation, and describe to some detail a possible implementation of a floating point arithmetic unit employing this representation, including also the directed roundings.

  4. Small components in k-nearest neighbour graphs

    CERN Document Server

    Walters, Mark

    2011-01-01

    Let $G=G_{n,k}$ denote the graph formed by placing points in a square of area $n$ according to a Poisson process of density 1 and joining each point to its $k$ nearest neighbours. Balister, Bollob\\'as, Sarkar and Walters proved that if $k0.5139\\log n$ then the probability that $G$ is connected tends to 1. We prove that, around the threshold for connectivity, all vertices near the boundary of the square are part of the (unique) giant component. This shows that arguments about the connectivity of $G$ do not need to consider `boundary' effects. We also improve the upper bound for the threshold for connectivity of $G$ to $k=0.4125\\log n$.

  5. Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

    Energy Technology Data Exchange (ETDEWEB)

    Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-02-01

    Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

  6. Anomaly Detection with Score functions based on Nearest Neighbor Graphs

    CERN Document Server

    Zhao, Manqi

    2009-01-01

    We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on score functions derived from nearest neighbor graphs on $n$-point nominal data. Anomalies are declared whenever the score of a test sample falls below $\\alpha$, which is supposed to be the desired false alarm level. The resulting anomaly detector is shown to be asymptotically optimal in that it is uniformly most powerful for the specified false alarm level, $\\alpha$, for the case when the anomaly density is a mixture of the nominal and a known density. Our algorithm is computationally efficient, being linear in dimension and quadratic in data size. It does not require choosing complicated tuning parameters or function approximation classes and it can adapt to local structure such as local change in dimensionality. We demonstrate the algorithm on both artificial and real data sets in high dimensional feature spaces.

  7. Statistical analysis of $k$-nearest neighbor collaborative recommendation

    CERN Document Server

    Biau, Gérard; Rouvière, Laurent; 10.1214/09-AOS759

    2010-01-01

    Collaborative recommendation is an information-filtering technique that attempts to present information items that are likely of interest to an Internet user. Traditionally, collaborative systems deal with situations with two types of variables, users and items. In its most common form, the problem is framed as trying to estimate ratings for items that have not yet been consumed by a user. Despite wide-ranging literature, little is known about the statistical properties of recommendation systems. In fact, no clear probabilistic model even exists which would allow us to precisely describe the mathematical forces driving collaborative filtering. To provide an initial contribution to this, we propose to set out a general sequential stochastic model for collaborative recommendation. We offer an in-depth analysis of the so-called cosine-type nearest neighbor collaborative method, which is one of the most widely used algorithms in collaborative filtering, and analyze its asymptotic performance as the number of user...

  8. Approximate aggregate nearest neighbor search on moving objects trajectories

    Institute of Scientific and Technical Information of China (English)

    Mohammad; Reza; Abbasifard; Hassan; Naderi; Zohreh; Fallahnejad; Omid; Isfahani; Alamdari

    2015-01-01

    Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.

  9. Nearest neighbor search algorithm for GBD tree spatial data structure

    Institute of Scientific and Technical Information of China (English)

    Yutaka Ohsawa; Takanobu Kurihara; Ayaka Ohki

    2007-01-01

    This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two- or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.

  10. ENN: Extended Nearest Neighbor Method for Pattern Recognition [Research Frontier

    Science.gov (United States)

    2015-07-16

    dimensional data (i.e., the curse of dimensionality problem). Feature nor- malization and dimensionality reduction methods are able to remedy this issue...2.77 KNOwlEDGE 23.93 ! 4.69 27.11 ! 4.45 12.66 ! 2.45 6.97 ! 2.53 14.42 ! 3.86 VErTEBrAl 35.13 ! 4.83 37.64 ! 5.06 47.93 ! 3.41 36.88 ! 4.83 45.11...Workshops, 2008, pp. 1–6. [29] P. Indyk and R. Motwani, “Approximate nearest neighbors: Towards removing the curse of dimensional- ity,” in Proc. 30th

  11. Location and logistics

    OpenAIRE

    Alumura, Sibel A.; Karab, Bahar Y.; Melo, M. Teresa

    2013-01-01

    Facility location decisions play a critical role in designing logistics networks. This article provides some guidelines on how location decisions and logistics functions can be integrated into a single mathematical model to optimize the configuration of a logistics network. This will be illustrated by two generic models, one supporting the design of a forward logistics network and the other addressing the specific requirements of a reverse logistics network. Several special cases and extensio...

  12. Location and logistics

    OpenAIRE

    Alumura, Sibel A.; Karab, Bahar Y.; Melo, M. Teresa

    2013-01-01

    Facility location decisions play a critical role in designing logistics networks. This article provides some guidelines on how location decisions and logistics functions can be integrated into a single mathematical model to optimize the configuration of a logistics network. This will be illustrated by two generic models, one supporting the design of a forward logistics network and the other addressing the specific requirements of a reverse logistics network. Several special cases and extensio...

  13. Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.

    Science.gov (United States)

    Liu, Xianglong; Deng, Cheng; Lang, Bo; Tao, Dacheng; Li, Xuelong

    2016-02-01

    Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table. However, rare work studies the unified approach to constructing multiple informative hash tables using any type of hashing algorithms. Meanwhile, for multiple table search, it also lacks of a generic query-adaptive and fine-grained ranking scheme that can alleviate the binary quantization loss suffered in the standard hashing techniques. To solve the above problems, in this paper, we first regard the table construction as a selection problem over a set of candidate hash functions. With the graph representation of the function set, we propose an efficient solution that sequentially applies normalized dominant set to finding the most informative and independent hash functions for each table. To further reduce the redundancy between tables, we explore the reciprocal hash tables in a boosting manner, where the hash function graph is updated with high weights emphasized on the misclassified neighbor pairs of previous hash tables. To refine the ranking of the retrieved buckets within a certain Hamming radius from the query, we propose a query-adaptive bitwise weighting scheme to enable fine-grained bucket ranking in each hash table, exploiting the discriminative power of its hash functions and their complement for nearest neighbor search. Moreover, we integrate such scheme into the multiple table search using a fast, yet reciprocal table lookup algorithm within the adaptive weighted Hamming radius. In this paper, both the construction method and the query-adaptive search method are general and compatible with different types of hashing algorithms using different feature spaces and/or parameter settings. Our extensive experiments on several large-scale benchmarks demonstrate that the proposed techniques can significantly outperform both

  14. Sann: solvent accessibility prediction of proteins by nearest neighbor method.

    Science.gov (United States)

    Joo, Keehyoung; Lee, Sung Jong; Lee, Jooyoung

    2012-07-01

    We present a method to predict the solvent accessibility of proteins which is based on a nearest neighbor method applied to the sequence profiles. Using the method, continuous real-value prediction as well as two-state and three-state discrete predictions can be obtained. The method utilizes the z-score value of the distance measure in the feature vector space to estimate the relative contribution among the k-nearest neighbors for prediction of the discrete and continuous solvent accessibility. The Solvent accessibility database is constructed from 5717 proteins extracted from PISCES culling server with the cutoff of 25% sequence identities. Using optimal parameters, the prediction accuracies (for discrete predictions) of 78.38% (two-state prediction with the threshold of 25%), 65.1% (three-state prediction with the thresholds of 9 and 36%), and the Pearson correlation coefficient (between the predicted and true RSA's for continuous prediction) of 0.676 are achieved An independent benchmark test was performed with the CASP8 targets where we find that the proposed method outperforms existing methods. The prediction accuracies are 80.89% (for two state prediction with the threshold of 25%), 67.58% (three-state prediction), and the Pearson correlation coefficient of 0.727 (for continuous prediction) with mean absolute error of 0.148. We have also investigated the effect of increasing database sizes on the prediction accuracy, where additional improvement in the accuracy is observed as the database size increases. The SANN web server is available at http://lee.kias.re.kr/~newton/sann/.

  15. Location Privacy

    Science.gov (United States)

    Meng, Xiaofeng; Chen, Jidong

    With rapid development of sensor and wireless mobile devices, it is easy to access mobile users' location information anytime and anywhere. On one hand, LBS is becoming more and more valuable and important. On the other hand, location privacy issues raised by such applications have also gained more attention. However, due to the specificity of location information, traditional privacy-preserving techniques in data publishing cannot be used. In this chapter, we will introduce location privacy, and analyze the challenges of location privacy-preserving, and give a survey of existing work including the system architecture, location anonymity and query processing.

  16. Highly flexible nearest-neighbor-search associative memory with integrated k nearest neighbor classifier, configurable parallelism and dual-storage space

    Science.gov (United States)

    An, Fengwei; Mihara, Keisuke; Yamasaki, Shogo; Chen, Lei; Jürgen Mattausch, Hans

    2016-04-01

    VLSI-implementations are often applied to solve the high computational cost of pattern matching but have usually low flexibility for satisfying different target applications. In this paper, a digital word-parallel associative memory architecture for k nearest neighbor (KNN) search, which is one of the most basic algorithms in pattern recognition, is reported applying the squared Euclidean distance measure. The reported architecture features reconfigurable parallelism, dual-storage space to achieve a flexible number of reference vectors, and a dedicated majority vote circuit. Programmable switching circuits, located between vector components, enable scalability of the searching parallelism by configuring the reference feature-vector dimensionality. A pipelined storage with dual static-random-access-memory (SRAM) cells for each unit and an intermediate winner control circuit are designed to extend the applicability by improving the flexibility of the reference storage. A test chip in 180 nm CMOS technology, which has 32 rows, 4 elements in each row and 2-parallel 8-bit dual-components in each element, consumes altogether 61.4 mW and in particular only 11.9 mW during the reconfigurable KNN classification (at 45.58 MHz and 1.8 V).

  17. Comparison of three small-break loss-of-coolant accident tests with different break locations using the system-integrated modular advanced reactor-integral test loop facility to estimate the safety of the smart design

    Directory of Open Access Journals (Sweden)

    Hwang Bae

    2017-08-01

    Full Text Available Three small-break loss-of-coolant accident (SBLOCA tests with safety injection pumps were carried out using the integral-effect test loop for SMART (System-integrated Modular Advanced ReacTor, i.e., the SMART-ITL facility. The types of break are a safety injection system line break, shutdown cooling system line break, and pressurizer safety valve line break. The thermal–hydraulic phenomena show a traditional behavior to decrease the temperature and pressure whereas the local phenomena are slightly different during the early stage of the transient after a break simulation. A safety injection using a high-pressure pump effectively cools down and recovers the inventory of a reactor coolant system. The global trends show reproducible results for an SBLOCA scenario with three different break locations. It was confirmed that the safety injection system is robustly safe enough to protect from a core uncovery.

  18. A step by step selection method for the location and the size of a waste-to-energy facility targeting the maximum output energy and minimization of gate fee.

    Science.gov (United States)

    Kyriakis, Efstathios; Psomopoulos, Constantinos; Kokkotis, Panagiotis; Bourtsalas, Athanasios; Themelis, Nikolaos

    2017-06-23

    This study attempts the development of an algorithm in order to present a step by step selection method for the location and the size of a waste-to-energy facility targeting the maximum output energy, also considering the basic obstacle which is in many cases, the gate fee. Various parameters identified and evaluated in order to formulate the proposed decision making method in the form of an algorithm. The principle simulation input is the amount of municipal solid wastes (MSW) available for incineration and along with its net calorific value are the most important factors for the feasibility of the plant. Moreover, the research is focused both on the parameters that could increase the energy production and those that affect the R1 energy efficiency factor. Estimation of the final gate fee is achieved through the economic analysis of the entire project by investigating both expenses and revenues which are expected according to the selected site and outputs of the facility. In this point, a number of commonly revenue methods were included in the algorithm. The developed algorithm has been validated using three case studies in Greece-Athens, Thessaloniki, and Central Greece, where the cities of Larisa and Volos have been selected for the application of the proposed decision making tool. These case studies were selected based on a previous publication made by two of the authors, in which these areas where examined. Results reveal that the development of a «solid» methodological approach in selecting the site and the size of waste-to-energy (WtE) facility can be feasible. However, the maximization of the energy efficiency factor R1 requires high utilization factors while the minimization of the final gate fee requires high R1 and high metals recovery from the bottom ash as well as economic exploitation of recovered raw materials if any.

  19. Complex-Temperature Phase Diagrams of 1D Spin Models with Next-Nearest-Neighbor Couplings

    OpenAIRE

    1997-01-01

    We study the dependence of complex-temperature phase diagrams on details of the Hamiltonian, focusing on the effect of non-nearest-neighbor spin-spin couplings. For this purpose, we consider a simple exactly solvable model, the 1D Ising model with nearest-neighbor (NN) and next-to-nearest-neighbor (NNN) couplings. We work out the exact phase diagrams for various values of $J_{nnn}/J_{nn}$ and compare these with the case of pure nearest-neighbor (NN) couplings. We also give some similar result...

  20. Global 30m Height Above the Nearest Drainage

    Science.gov (United States)

    Donchyts, Gennadii; Winsemius, Hessel; Schellekens, Jaap; Erickson, Tyler; Gao, Hongkai; Savenije, Hubert; van de Giesen, Nick

    2016-04-01

    Variability of the Earth surface is the primary characteristics affecting the flow of surface and subsurface water. Digital elevation models, usually represented as height maps above some well-defined vertical datum, are used a lot to compute hydrologic parameters such as local flow directions, drainage area, drainage network pattern, and many others. Usually, it requires a significant effort to derive these parameters at a global scale. One hydrological characteristic introduced in the last decade is Height Above the Nearest Drainage (HAND): a digital elevation model normalized using nearest drainage. This parameter has been shown to be useful for many hydrological and more general purpose applications, such as landscape hazard mapping, landform classification, remote sensing and rainfall-runoff modeling. One of the essential characteristics of HAND is its ability to capture heterogeneities in local environments, difficult to measure or model otherwise. While many applications of HAND were published in the academic literature, no studies analyze its variability on a global scale, especially, using higher resolution DEMs, such as the new, one arc-second (approximately 30m) resolution version of SRTM. In this work, we will present the first global version of HAND computed using a mosaic of two DEMS: 30m SRTM and Viewfinderpanorama DEM (90m). The lower resolution DEM was used to cover latitudes above 60 degrees north and below 56 degrees south where SRTM is not available. We compute HAND using the unmodified version of the input DEMs to ensure consistency with the original elevation model. We have parallelized processing by generating a homogenized, equal-area version of HydroBASINS catchments. The resulting catchment boundaries were used to perform processing using 30m resolution DEM. To compute HAND, a new version of D8 local drainage directions as well as flow accumulation were calculated. The latter was used to estimate river head by incorporating fixed and

  1. Analyzing short time series data from periodically fluctuating rodent populations by threshold models: A nearest block bootstrap approach

    Institute of Scientific and Technical Information of China (English)

    CHAN Kung-Sik; TONG Howell; STENSETH Nils Chr

    2009-01-01

    The study of the rodent fluctuations of the North was initiated in its modern form with Elton's pioneering work. Many scientific studies have been designed to collect yearly rodent abundance data, but the resulting time series are generally subject to at least two "problems": being short and non-linear. We explore the use of the continuous threshold autoregressive (TAR) models for analyzing such data. In the simplest case, the continuous TAR models are additive autoregressive models, being piecewise linear in one lag, and linear in all other lags. The location of the slope change is called the threshold parameter. The continuous TAR models for rodent abundance data can be derived from a general prey-predator model under some simplifying assumptions. The lag in which the threshold is located sheds important insights on the structure of the prey-predator system. We propose to assess the uncertainty on the location of the threshold via a new bootstrap called the nearest block bootstrap (NBB) which combines the methods of moving block bootstrap and the nearest neighbor bootstrap.The NBB assumes an underlying finite-order time-homogeneous Markov process. Essentially, the NBB bootstraps blocks of random block sizes, with each block being drawn from a non-parametric estimate of the future distribution given the realized past bootstrap series. We illustrate the methods by simulations and on a particular rodent abundance time series from Kilpisjarvi, Northern Finland.

  2. Small Craft Facility Locations - USACE IENC

    Data.gov (United States)

    Department of Homeland Security — These inland electronic Navigational charts (IENCs) were developed from available data used in maintenance of Navigation channels. Users of these IENCs should be...

  3. VT US EPA Regulated Facilities Point Locations

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) The EnvironPollution_ENVPTS2001 data layer is based on the U.S. EPA's Envirofacts point shapefile. The data was provided to VCGI by the Vermont...

  4. Expert group formation using facility location analysis

    NARCIS (Netherlands)

    Neshati, Mahmood; Beigy, Hamid; Hiemstra, Djoerd

    2014-01-01

    In this paper, we propose an optimization framework to retrieve an optimal group of experts to perform a multi-aspect task. While a diverse set of skills are needed to perform a multi-aspect task, the group of assigned experts should be able to collectively cover all these required skills. We consid

  5. Improving Healthcare Facility Locations in Bamyan, Afghanistan

    Science.gov (United States)

    2011-12-01

    inpatient and outpatient physiotherapy for disability. District Hospital (DH) Same as CHCs, and wide range of essential drugs and laboratory services...works.bepress.com/cgi/viewcontent.cgi? article =1023&context=amy_hillier ILOG. (2004). CPLEX 9.0 Solver manual. Retrieved 23 October 2011, from...from ScienceDirect:- Computers and Operations Research: http://www.sciencedirect.com/science/ article /pii/S0305054805002959 Tan, L. J. (2009

  6. Environmental Assessment for the Health Protection Instrument Calibration Facility at the Savannah River Site

    Energy Technology Data Exchange (ETDEWEB)

    1993-08-01

    The purpose of this Environmental Assessment (EA) is to review the possible environmental consequences associated with the construction and operation of a Health Protection Instrument Calibration Facility on the Savannah River Site (SRS). The proposed replacement calibration facility would be located in B Area of SRS and would replace an inadequate existing facility currently located within A Area of SRS (Building 736-A). The new facility would provide laboratories, offices, test equipment and the support space necessary for the SRS Radiation Monitoring Instrument Calibration Program to comply with DOE Orders 5480.4 (Environmental Protection, Safety and Health Protection Standards) and 5480.11 (Radiation Protection for Occupational Workers). The proposed facility would serve as the central site source for the evaluation, selection, inspection, testing, calibration, and maintenance of all SRS radiation monitoring instrumentation. The proposed facility would be constructed on a currently undeveloped portion in B Area of SRS. The exact plot associated with the proposed action is a 1.2 hectare (3 acre) tract of land located on the west side of SRS Road No. 2. The proposed facility would lie approximately 4.4 km (2.75 mi) from the nearest SRS site boundary. The proposed facility would also lie within the confines of the existing B Area, and SRS safeguards and security systems. Archaeological, ecological, and land use reviews have been conducted in connection with the use of this proposed plot of land, and a detailed discussion of these reviews is contained herein. Socioeconomic, operational, and accident analyses were also examined in relation to the proposed project and the findings from these reviews are also contained in this EA.

  7. Library Locations

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Carnegie Library of Pittsburgh locations including address, coordinates, phone number, square footage, and standard operating hours.

  8. 3D Interstellar Extinction Map within the Nearest Kiloparsec

    CERN Document Server

    Gontcharov, George

    2016-01-01

    The product of the previously constructed 3D maps of stellar reddening (Gontcharov 2010) and $R_V$ variations (Gontcharov 2012) has allowed us to produce a 3D interstellar extinction map within the nearest kiloparsec from the Sun with a spatial resolution of 50 pc and an accuracy of $0.2^m$. This map is compared with the 2D reddening map by Schlegel et al. (1998), the 3D extinction map at high latitudes by Jones et al. (2011), and the analytical extinction models by Arenou et al. (1992) and Gontcharov (2009). In all cases, we have found good agreement and show that there are no systematic errors in the new map everywhere except the direction toward the Galactic center. We have found that the map by Schlegel et al. (1998) reaches saturation near the Galactic equator at $E_{(B-V)}>0.8^m$, has a zero-point error and systematic errors gradually increasing with reddening, and among the analytical models those that take into account the extinction in the Gould Belt are more accurate. Our extinction map shows that i...

  9. Variations of the Interstellar Extinction Law within the Nearest Kiloparsec

    CERN Document Server

    Gontcharov, George

    2016-01-01

    Multicolor photometry from the Tycho-2 and 2MASS catalogues for 11 990 OB and 30 671 K-type red giant branch stars is used to detect systematic large-scale variations of the interstellar extinction law within the nearest kiloparsec. The characteristic of the extinction law, the total-to-selective extinction ratio $R_V$, which also characterizes the size and other properties of interstellar dust grains, has been calculated for various regions of space by the extinction law extrapolation method. The results for the two classes of stars agree: the standard deviation of the "red giants minus OB" $R_V$ differences within 500 pc of the Sun is 0.2. The detected $R_V$ variations between 2.2 and 4.4 not only manifest themselves in individual clouds but also span the entire space near the Sun, following Galactic structures. In the Local Bubble within about 100 pc of the Sun, $R_V$ has a minimum. In the inner part of the Gould Belt and at high Galactic latitudes, at a distance of about 150 pc from the Sun, $R_V$ reaches...

  10. A non-uniform distribution of the nearest brown dwarfs

    CERN Document Server

    Bihain, G

    2016-01-01

    The census of solar neighbours is still complemented by new discoveries, mainly of very low-mass, faint dwarfs, close to or within the substellar domain. These discoveries contribute to a better understanding of the field population; its origin in terms of Galactic dynamics and (sub)stellar formation and evolution. Also, the nearest stars and brown dwarfs at any given age allow the most precise direct characterization, including the search for planetary companions. We aim to further assess the substellar census on the Galactic plane. We projected the 136 stars and 26 brown dwarfs known at <6.5 pc on the Galactic plane and evaluated their distributions. Stars present a uniform- and brown dwarfs a non-uniform distribution, with 21 objects behind the Sun and only five ahead relative to the direction of rotation of the Galaxy. This substellar configuration has a probability of 0.098$^{+10.878}_{-0.098}$% relative to uniformity. The helio- and geocentric nature of the distribution suggests it might result in pa...

  11. A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm

    CERN Document Server

    Dubiner, Moshe

    2008-01-01

    We consider the problem of finding high dimensional approximate nearest neighbors. Suppose there are d independent rare features, each having its own independent statistics. A point x will have x_{i}=0 denote the absence of feature i, and x_{i}=1 its existence. Sparsity means that usually x_{i}=0. Distance between points is a variant of the Hamming distance. Dimensional reduction converts the sparse heterogeneous problem into a lower dimensional full homogeneous problem. However we will see that the converted problem can be much harder to solve than the original problem. Instead we suggest a direct approach. It consists of T tries. In try t we rearrange the coordinates in decreasing order of (1-r_{t,i})\\frac{p_{i,11}}{p_{i,01}+p_{i,10}} \\ln\\frac{1}{p_{i,1*}} where 0

  12. Local Naive Bayes Nearest Neighbor for Image Classification

    CERN Document Server

    McCann, Sancho

    2011-01-01

    We present Local Naive Bayes Nearest Neighbor, an improvement to the NBNN image classification algorithm that increases classification accuracy and improves its ability to scale to large numbers of object classes. The key observation is that only the classes represented in the local neighborhood of a descriptor contribute significantly and reliably to their posterior probability estimates. Instead of maintaining a separate search structure for each class, we merge all of the reference data together into one search structure, allowing quick identification of a descriptor's local neighborhood. We show an increase in classification accuracy when we ignore adjustments to the more distant classes and show that the run time grows with the log of the number of classes rather than linearly in the number of classes as did the original. This gives a 100 times speed-up over the original method on the Caltech 256 dataset. We also provide the first head-to-head comparison of NBNN against spatial pyramid methods using a co...

  13. Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search.

    Science.gov (United States)

    Liu, Xianglong; Li, Zhujin; Deng, Cheng; Tao, Dacheng

    2017-11-01

    Hashing has been proved an attractive technique for fast nearest neighbor search over big data. Compared with the projection based hashing methods, prototype-based ones own stronger power to generate discriminative binary codes for the data with complex intrinsic structure. However, existing prototype-based methods, such as spherical hashing and K-means hashing, still suffer from the ineffective coding that utilizes the complete binary codes in a hypercube. To address this problem, we propose an adaptive binary quantization (ABQ) method that learns a discriminative hash function with prototypes associated with small unique binary codes. Our alternating optimization adaptively discovers the prototype set and the code set of a varying size in an efficient way, which together robustly approximate the data relations. Our method can be naturally generalized to the product space for long hash codes, and enjoys the fast training linear to the number of the training data. We further devise a distributed framework for the large-scale learning, which can significantly speed up the training of ABQ in the distributed environment that has been widely deployed in many areas nowadays. The extensive experiments on four large-scale (up to 80 million) data sets demonstrate that our method significantly outperforms state-of-the-art hashing methods, with up to 58.84% performance gains relatively.

  14. The Nearest OB Association: Scorpius-Centaurus (Sco OB2)

    CERN Document Server

    Preibisch, Thomas

    2008-01-01

    We summarize observational results on the stellar population and star formation history of the Scorpius-Centaurus OB Association (Sco OB2), the nearest region of recent massive star formation. It consists of three subgroups, Upper Scorpius (US), Upper Centaurus-Lupus (UCL), and Lower Centaurus-Crux (LCC) which have ages of about 5, 17, and 16 Myr. In Upper Scorpius, numerous studies have recently revealed hundreds of low-mass association members, including dozens of brown dwarfs. The empirical mass function could be established over the full stellar mass range from 0.1 M_sun up to 20 M_sun, and was found to be consistent with recent determinations of the field initial mass function. A narrow range of ages around 5 Myr was found for the low-mass stars, the same age as had previously (and independently) been derived for the high-mass members. This supports earlier indications that the star formation process in US was triggered, and agrees with previous conjectures that the triggering event was a supernova- and ...

  15. Nearest neighbor interaction in the Path Integral Renormalization Group method

    Science.gov (United States)

    de Silva, Wasanthi; Clay, R. Torsten

    2014-03-01

    The Path Integral Renormalization Group (PIRG) method is an efficient numerical algorithm for studying ground state properties of strongly correlated electron systems. The many-body ground state wave function is approximated by an optimized linear combination of Slater determinants which satisfies the variational principle. A major advantage of PIRG is that is does not suffer the Fermion sign problem of quantum Monte Carlo. Results are exact in the noninteracting limit and can be enhanced using space and spin symmetries. Many observables can be calculated using Wick's theorem. PIRG has been used predominantly for the Hubbard model with a single on-site Coulomb interaction U. We describe an extension of PIRG to the extended Hubbard model (EHM) including U and a nearest-neighbor interaction V. The EHM is particularly important in models of charge-transfer solids (organic superconductors) and at 1/4-filling drives a charge-ordered state. The presence of lattice frustration also makes studying these systems difficult. We test the method with comparisons to small clusters and long one dimensional chains, and show preliminary results for a coupled-chain model for the (TMTTF)2X materials. This work was supported by DOE grant DE-FG02-06ER46315.

  16. Alpha centauri unveiling the secrets of our nearest stellar neighbor

    CERN Document Server

    Beech, Martin

    2015-01-01

    As our closest stellar companion and composed of two Sun-like stars and a third small dwarf star, Alpha Centauri is an ideal testing ground of astrophysical models and has played a central role in the history and development of modern astronomy—from the first guesses at stellar distances to understanding how our own star, the Sun, might have evolved. It is also the host of the nearest known exoplanet, an ultra-hot, Earth-like planet recently discovered. Just 4.4 light years away Alpha Centauri is also the most obvious target for humanity’s first directed interstellar space probe. Such a mission could reveal the small-scale structure of a new planetary system and also represent the first step in what must surely be humanity’s greatest future adventure—exploration of the Milky Way Galaxy itself. For all of its closeness, α Centauri continues to tantalize astronomers with many unresolved mysteries, such as how did it form, how many planets does it contain and where are they, and how might we view its ex...

  17. Approximate aggregate nearest neighbor search on moving objects trajectories

    Institute of Scientific and Technical Information of China (English)

    Mohammad Reza Abbasifard; Hassan Naderi; Zohreh Fallahnejad; Omid Isfahani Alamdari

    2015-01-01

    Aggregate nearest neighbor (ANN) search retrieves for two spatial datasetsT andQ, segment(s) of one or more trajectories from the setT having minimum aggregate distance to points inQ. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index (SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.

  18. River Flow Prediction Using the Nearest Neighbor Probabilistic Ensemble Method

    Directory of Open Access Journals (Sweden)

    H. Sanikhani

    2016-02-01

    Full Text Available Introduction: In the recent years, researchers interested on probabilistic forecasting of hydrologic variables such river flow.A probabilistic approach aims at quantifying the prediction reliability through a probability distribution function or a prediction interval for the unknown future value. The evaluation of the uncertainty associated to the forecast is seen as a fundamental information, not only to correctly assess the prediction, but also to compare forecasts from different methods and to evaluate actions and decisions conditionally on the expected values. Several probabilistic approaches have been proposed in the literature, including (1 methods that use resampling techniques to assess parameter and model uncertainty, such as the Metropolis algorithm or the Generalized Likelihood Uncertainty Estimation (GLUE methodology for an application to runoff prediction, (2 methods based on processing the forecast errors of past data to produce the probability distributions of future values and (3 methods that evaluate how the uncertainty propagates from the rainfall forecast to the river discharge prediction, as the Bayesian forecasting system. Materials and Methods: In this study, two different probabilistic methods are used for river flow prediction.Then the uncertainty related to the forecast is quantified. One approach is based on linear predictors and in the other, nearest neighbor was used. The nonlinear probabilistic ensemble can be used for nonlinear time series analysis using locally linear predictors, while NNPE utilize a method adapted for one step ahead nearest neighbor methods. In this regard, daily river discharge (twelve years of Dizaj and Mashin Stations on Baranduz-Chay basin in west Azerbijan and Zard-River basin in Khouzestan provinces were used, respectively. The first six years of data was applied for fitting the model. The next three years was used to calibration and the remained three yeas utilized for testing the models

  19. k-Nearest Neighbors Algorithm in Profiling Power Analysis Attacks

    Directory of Open Access Journals (Sweden)

    Z. Martinasek

    2016-06-01

    Full Text Available Power analysis presents the typical example of successful attacks against trusted cryptographic devices such as RFID (Radio-Frequency IDentifications and contact smart cards. In recent years, the cryptographic community has explored new approaches in power analysis based on machine learning models such as Support Vector Machine (SVM, RF (Random Forest and Multi-Layer Perceptron (MLP. In this paper, we made an extensive comparison of machine learning algorithms in the power analysis. For this purpose, we implemented a verification program that always chooses the optimal settings of individual machine learning models in order to obtain the best classification accuracy. In our research, we used three datasets, the first containing the power traces of an unprotected AES (Advanced Encryption Standard implementation. The second and third datasets are created independently from public available power traces corresponding to a masked AES implementation (DPA Contest v4. The obtained results revealed some interesting facts, namely, an elementary k-NN (k-Nearest Neighbors algorithm, which has not been commonly used in power analysis yet, shows great application potential in practice.

  20. Post-T Tauri Stars in the Nearest OB Association

    CERN Document Server

    Mamajek, E E; Liebert, J; Mamajek, Eric E.; Meyer, Michael R.; Liebert, James

    2002-01-01

    We present results of a spectroscopic survey of X-ray- and proper motion-selected samples of late-type stars in the Lower Cen-Cru (LCC) and Upper Cen-Lup (UCL) subgroups of the nearest OB association: Sco-Cen. The primary goals of the survey are to determine the star-formation history of the OB subgroups, and to assess the frequency of accreting stars in a sample dominated by ``post-T Tauri'' pre-MS stars. We investigate two samples: (1) ACT and TRC proper motion candidates with X-ray counterparts in the ROSAT All-Sky Survey BSC, and (2) G and K-type Hipparcos candidate members (de Zeeuw et al. 1999). We obtained optical spectra of 130 candidates with the MSSSO 2.3-m DBS. Pre-MS stars were identified by (1) strong Li 6707A absorption, (2) subgiant surface gravities, (3) proper motions consistent with Sco-Cen membership, and (4) HRD positions consistent with being pre-MS. We demonstrate that measuring the gravity-sensitive band-ratio of Sr II 4077A to Fe I 4071A is a valuable means of discriminating pre-MS and...

  1. Hazardous Material Storage Facilities and Sites, DSHWPOPermittedUsedOilFacilities-Location in Utah of all Used Oil Facilities: Marketers, Porcessoors, Transfer, Transport and Off-specification Permitted by UDEQ Division of Hazardous Waste (DSHW) - Used Oil Section. Federal Fiscal Year 2006. Dataset Upda, Published in 2006, 1:100000 (1in=8333ft) scale, State of Utah Automated Geographic Reference Center.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Hazardous Material Storage Facilities and Sites dataset, published at 1:100000 (1in=8333ft) scale, was produced all or in part from Hardcopy Maps information...

  2. VT School Locations - K-12

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) FacilitiesSchools_PTSCHOOL is designed to provide point locations of every Vermont School along with the established school ID (PSID) for...

  3. Allegheny County Public Building Locations

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — This dataset contains the locations of municipal facilities in Allegheny County. If viewing this description on the Western Pennsylvania Regional Data Center’s...

  4. Allegheny County Public Building Locations

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — This dataset contains the locations of municipal facilities in Allegheny County. If viewing this description on the Western Pennsylvania Regional Data Center’s open...

  5. Status of the GRANIT facility

    CERN Document Server

    Roulier, Damien; Baessler, Stefan; Clément, Benoît; Morton, Daniel; Nesvizhevsky, Valery; Pignol, Guillaume; Rebreyend, Dominique

    2014-01-01

    The GRANIT facility is a follow-up project, which is motivated by the recent discovery of gravitational quantum states of ultracold neutrons. The goal of the project is to approach the ultimate accuracy in measuring parameters of such quantum states and also to apply this phenomenon and related experimental techniques to a broad range of applications in particle physics as well as in surface and nanoscience studies. We overview the current status of this facility, the recent test measurements and the nearest prospects.

  6. Structures, Mixed Types - Oil & Gas Locations

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — An Oil and Gas Location is a DEP primary facility type related to the Oil & Gas Program. The sub-facility types related to Oil and Gas that are included in this...

  7. Underground Storage Tanks - Storage Tank Locations

    Data.gov (United States)

    NSGIC Education | GIS Inventory — A Storage Tank Location is a DEP primary facility type, and its sole sub-facility is the storage tank itself. Storage tanks are aboveground or underground, and are...

  8. Topological phase transitions driven by next-nearest-neighbor hopping in two-dimensional lattices

    NARCIS (Netherlands)

    Beugeling, W.; Everts, J.C.; de Morais Smith, C.

    2012-01-01

    For two-dimensional lattices in a tight-binding description, the intrinsic spin-orbit coupling, acting as a complex next-nearest-neighbor hopping, opens gaps that exhibit the quantum spin Hall effect. In this paper, we study the effect of a real next-nearest-neighbor hopping term on the band structu

  9. Natural language text classification and filtering with trigrams and evolutionary nearest neighbour classifiers

    NARCIS (Netherlands)

    Langdon, W.B.

    2000-01-01

    N~grams offer fast language independent multi-class text categorization. Text is reduced in a single pass to ngram vectors. These are assigned to one of several classes by a) nearest neighbour (KNN) and b) genetic algorithm operating on weights in a nearest neighbour classifier. 91 accuracy is found

  10. 废弃物处理站选址问题的和谐搜索算法%Harmony Search Algorithm for End-of-Life Items Disposal Facilities' Location Problem

    Institute of Scientific and Technical Information of China (English)

    韩毅; 蔡建湖; 周根贵; 李延来; 宋平

    2011-01-01

    近年来,随着人们环保意识的增强和环保法规力度的加大,逆向物流逐渐受到人们的关注与重视.废弃物处理站的选址问题(end-of-life items disposal facilities'location problem,EIDFLP)是逆向物流研究领域的关键问题,该问题能否有效解决直接关系到人们的日常生活环境能否得到有效改善.针对文献中的具有多个目标的EIDFLP,首先将问题转化为单目标问题,之后采用一种新颖的和谐搜索优化算法(harmony search algorithm,HSA)对问题进行了求解.计算结果显示:1)本算法的最优解与文献中的最优解相同;2)本算法的计算时间明显少于文献中算法的计算时间;3)原文献中的一个解存在错误之处.%In recent years, with the enforcement of people's environmental protection awareness and the improvement of environmental protection regulation, more and more focuses and importance are attached on reverse logistics.End-of-life items disposal facilities' location problem (EIDFLP) is a key research direction in reverse logistics research.Whether the EIDFLP can be effectively solved is directly related to the degree of improvement on people's daily life.In this paper, for solving a multi-objective EIDFLP from literature, the multi-objective EIDFLP was transformed into a single-objective problem and then a novel harmony search algorithm (HSA) was proposed.Through the computational results,we found that the best result of HSA is the same as that in literature, the computational time is much less than that of algorithm in literature and there are some errors in a reported solution.

  11. Quality and efficiency in high dimensional Nearest neighbor search

    KAUST Repository

    Tao, Yufei

    2009-01-01

    Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational database, and (ii) its query cost should grow sub-linearly with the dataset size, regardless of the data and query distributions. Despite the bulk of NN literature, no solution fulfills both requirements, except locality sensitive hashing (LSH). The existing LSH implementations are either rigorous or adhoc. Rigorous-LSH ensures good quality of query results, but requires expensive space and query cost. Although adhoc-LSH is more efficient, it abandons quality control, i.e., the neighbor it outputs can be arbitrarily bad. As a result, currently no method is able to ensure both quality and efficiency simultaneously in practice. Motivated by this, we propose a new access method called the locality sensitive B-tree (LSB-tree) that enables fast highdimensional NN search with excellent quality. The combination of several LSB-trees leads to a structure called the LSB-forest that ensures the same result quality as rigorous-LSH, but reduces its space and query cost dramatically. The LSB-forest also outperforms adhoc-LSH, even though the latter has no quality guarantee. Besides its appealing theoretical properties, the LSB-tree itself also serves as an effective index that consumes linear space, and supports efficient updates. Our extensive experiments confirm that the LSB-tree is faster than (i) the state of the art of exact NN search by two orders of magnitude, and (ii) the best (linear-space) method of approximate retrieval by an order of magnitude, and at the same time, returns neighbors with much better quality. © 2009 ACM.

  12. Use of GIS and ancillary variables to predict volatile organic compound and nitrogen dioxide levels at unmonitored locations

    Science.gov (United States)

    Smith, Luther; Mukerjee, Shaibal; Gonzales, Melissa; Stallings, Casson; Neas, Lucas; Norris, Gary; Özkaynak, Halûk

    In late 1999, passive air sampling of nitrogen dioxide (NO 2) and volatile organic compounds was conducted at 22 school locations and two intensive sites in El Paso, Texas. Our goal was to predict concentrations of NO 2 and benzene, toluene, ethylbenzene, o-xylene, and m, p-xylene at a total of 55 schools. The predictive equations were developed by regressing the passive monitor measurements at the 22 monitored schools on land-use variables derived from a geographic information system (GIS). These GIS-based ancillary variables included distance to the nearest border crossing, elevation, population density, distance to roads with specified traffic volumes, traffic intensity around the schools, and distance to the nearest petroleum facility. The reliability of the predictive equations was assessed at the two intensive monitoring sites. For all pollutants, the most useful predictive ancillary variables were elevation, population density, distance to a border crossing, and distance to a petroleum facility. For estimating NO 2, traffic intensity was also important.

  13. EPA Facility Registry Service (FRS): Facility Interests Dataset - Intranet Download

    Data.gov (United States)

    U.S. Environmental Protection Agency — This downloadable data package consists of location and facility identification information from EPA's Facility Registry Service (FRS) for all sites that are...

  14. EPA Facility Registry Service (FRS): Facility Interests Dataset - Intranet

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service consists of location and facility identification information from EPA's Facility Registry Service (FRS) for all sites that are available in...

  15. EPA Facility Registry Service (FRS): Facility Interests Dataset Download

    Data.gov (United States)

    U.S. Environmental Protection Agency — This downloadable data package consists of location and facility identification information from EPA's Facility Registry Service (FRS) for all sites that are...

  16. EPA Facility Registry Service (FRS): Facility Interests Dataset

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service consists of location and facility identification information from EPA's Facility Registry Service (FRS) for all sites that are available in...

  17. Geographic access to family planning facilities and the risk of unintended and teenage pregnancy.

    Science.gov (United States)

    Goodman, David C; Klerman, Lorraine V; Johnson, Kay A; Chang, Chiang-Hua; Marth, Nancy

    2007-03-01

    This study tested the hypotheses that greater geographic access to family planning facilities is associated with lower rates of unintended and teenage pregnancies. State Pregnancy Risk Assessment Monitoring System (PRAMS) and natality files in four states were used to locate unintended and teenage births, respectively. Geographic availability was measured by cohort travel time to the nearest family planning facility, the presence of a family planning facility in a ZIP area, and the supply of primary care physicians and obstetric-gynecologists. 83% of the PRAMS cohort and 80% of teenagers lived within 15 min or less of a facility and virtually none lived more than 30 min. Adjusted odds ratios did not demonstrate a statistically significant trend to a higher risk of unintended pregnancies with longer travel time. Similarly there was no association with unintended pregnancy and the presence of a family planning facility within the ZIP area of maternal residence, or with the supply of physicians capable of providing family planning services. Both crude and adjusted relative rates of teenage pregnancies were significantly lower with further distance from family planning sites and with the absence of a facility in the ZIP area of residence. In adjusted models, the supply of obstetricians-gynecologists and primary care physicians was not significantly associated with decreased teen pregnancies. This study found no relationship between greater geographic availability of family planning facilities and a risk of unintended pregnancies. Greater geographic availability of family planning services was associated with a higher risk of teenage pregnancy, although these results may be confounded by facilities locating in areas with greater family planning needs.

  18. Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection

    Directory of Open Access Journals (Sweden)

    Suman Saha

    2016-03-01

    Full Text Available The objective of this article is to bridge the gap between two important research directions: (1 nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2 complex network analysis, which deals with large real graphs but is generally studied via graph theoretic analysis or spectral analysis. In this article, we have studied the nearest neighbor search problem in a complex network by the development of a suitable notion of nearness. The computation of efficient nearest neighbor search among the nodes of a complex network using the metric tree and locality sensitive hashing (LSH are also studied and experimented. For evaluation of the proposed nearest neighbor search in a complex network, we applied it to a network community detection problem. Experiments are performed to verify the usefulness of nearness measures for the complex networks, the role of metric tree and LSH to compute fast and approximate node nearness and the the efficiency of community detection using nearest neighbor search. We observed that nearest neighbor between network nodes is a very efficient tool to explore better the community structure of the real networks. Several efficient approximation schemes are very useful for large networks, which hardly made any degradation of results, whereas they save lot of computational times, and nearest neighbor based community detection approach is very competitive in terms of efficiency and time.

  19. A Distributed Approach to Continuous Monitoring of Constrained k-Nearest Neighbor Queries in Road Networks

    Directory of Open Access Journals (Sweden)

    Hyung-Ju Cho

    2012-01-01

    Full Text Available Given two positive parameters k and r, a constrained k-nearest neighbor (CkNN query returns the k closest objects within a network distance r of the query location in road networks. In terms of the scalability of monitoring these CkNN queries, existing solutions based on central processing at a server suffer from a sudden and sharp rise in server load as well as messaging cost as the number of queries increases. In this paper, we propose a distributed and scalable scheme called DAEMON for the continuous monitoring of CkNN queries in road networks. Our query processing is distributed among clients (query objects and server. Specifically, the server evaluates CkNN queries issued at intersections of road segments, retrieves the objects on the road segments between neighboring intersections, and sends responses to the query objects. Finally, each client makes its own query result using this server response. As a result, our distributed scheme achieves close-to-optimal communication costs and scales well to large numbers of monitoring queries. Exhaustive experimental results demonstrate that our scheme substantially outperforms its competitor in terms of query processing time and messaging cost.

  20. RINGED SUBSTRUCTURE AND A GAP AT 1 au IN THE NEAREST PROTOPLANETARY DISK

    Energy Technology Data Exchange (ETDEWEB)

    Andrews, Sean M.; Wilner, David J.; Bai, Xue-Ning; Öberg, Karin I.; Ricci, Luca [Harvard-Smithsonian Center for Astrophysics, 60 Garden Street, Cambridge, MA 02138 (United States); Zhu, Zhaohuan [Department of Astrophysical Sciences, Princeton University, 4 Ivy Lane, Peyton Hall, Princeton, NJ 08544 (United States); Birnstiel, Tilman [Max-Planck-Institut für Astronomie, Königstuhl 17, D-69117 Heidelberg (Germany); Carpenter, John M. [Joint ALMA Observatory (JAO), Alonso de Cordova 3107, Vitacura-Santiago de Chile (Chile); Pérez, Laura M. [Max-Planck-Institut für Radioastronomie, Auf dem Hügel 69, D-53121 Bonn (Germany); Hughes, A. Meredith [Department of Astronomy, Wesleyan University, Van Vleck Observatory, 96 Foss Hill Drive, Middletown, CT 06457 (United States); Isella, Andrea, E-mail: sandrews@cfa.harvard.edu [Department of Physics and Astronomy, Rice University, 6100 Main Street, Houston, TX 77005 (United States)

    2016-04-01

    We present long baseline Atacama Large Millimeter/submillimeter Array (ALMA) observations of the 870 μm continuum emission from the nearest gas-rich protoplanetary disk, around TW Hya, that trace millimeter-sized particles down to spatial scales as small as 1 au (20 mas). These data reveal a series of concentric ring-shaped substructures in the form of bright zones and narrow dark annuli (1–6 au) with modest contrasts (5%–30%). We associate these features with concentrations of solids that have had their inward radial drift slowed or stopped, presumably at local gas pressure maxima. No significant non-axisymmetric structures are detected. Some of the observed features occur near temperatures that may be associated with the condensation fronts of major volatile species, but the relatively small brightness contrasts may also be a consequence of magnetized disk evolution (the so-called zonal flows). Other features, particularly a narrow dark annulus located only 1 au from the star, could indicate interactions between the disk and young planets. These data signal that ordered substructures on ∼au scales can be common, fundamental factors in disk evolution and that high-resolution microwave imaging can help characterize them during the epoch of planet formation.

  1. Ringed Substructure and a Gap at 1 AU in the Nearest Protoplanetary Disk

    CERN Document Server

    Andrews, Sean M; Zhu, Zhaohuan; Birnstiel, Tilman; Carpenter, John M; Perez, Laura M; Bai, Xue-Ning; Oberg, Karin I; Hughes, A Meredith; Isella, Andrea; Ricci, Luca

    2016-01-01

    We present long-baseline Atacama Large Millimeter/submillimeter Array (ALMA) observations of the 870 micron continuum emission from the nearest gas-rich protoplanetary disk, around TW Hya, that trace millimeter-sized particles down to spatial scales as small as 1 AU (20 mas). These data reveal a series of concentric ring-shaped substructures in the form of bright zones and narrow dark annuli (1-6 AU) with modest contrasts (5-30%). We associate these features with concentrations of solids that have had their inward radial drift slowed or stopped, presumably at local gas pressure maxima. No significant non-axisymmetric structures are detected. Some of the observed features occur near temperatures that may be associated with the condensation fronts of major volatile species, but the relatively small brightness contrasts may also be a consequence of magnetized disk evolution (the so-called zonal flows). Other features, particularly a narrow dark annulus located only 1 AU from the star, could indicate interactions...

  2. EPA Facility Registry Service (FRS): RADINFO

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  3. EPA Facility Registry Service (FRS): NCDB

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  4. EPA Facility Registry Service (FRS): BIA

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  5. EPA Facility Registry System (FRS): NEPT

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry System (FRS) for the subset of facilities that link...

  6. EPA Facility Registry Service (FRS): BRAC

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  7. EPA Facility Registry Service (FRS): ICIS

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  8. EPA Facility Registry Service (FRS): RBLC

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  9. EPA Facility Registry Service (FRS): RMP

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  10. EPA Facility Registry System (FRS): NCES

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry System (FRS) for the subset of facilities that link...

  11. EPA Facility Registry Service (FRS): TRI

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  12. EPA Facility Registry Service (FRS): NEI

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  13. EPA Facility Registry Service (FRS): CAMDBS

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  14. EPA Facility Registry Service (FRS): OIL

    Data.gov (United States)

    U.S. Environmental Protection Agency — This dataset contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link to the Oil...

  15. EPA Facility Registry Service (FRS): SDWIS

    Data.gov (United States)

    U.S. Environmental Protection Agency — This web feature service contains location and facility identification information from EPA's Facility Registry Service (FRS) for the subset of facilities that link...

  16. Aviation Flight Support Facility

    Data.gov (United States)

    Federal Laboratory Consortium — This facility consists of a 75' x 200' hanger with two adjacent helicopter pads located at Felker Army Airfield on Fort Eustis. A staff of Government and contractor...

  17. VT Telecommunication Facilities

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) The UtilityTelecom_TELEFAC data layer contains points which are intended to represent the location of telecommunications facilities (towers and/or...

  18. Waste Water Facilities

    Data.gov (United States)

    Vermont Center for Geographic Information — This dataset contains the locations of municipal and industrial direct discharge wastewater treatment facilities throughout the state of Vermont. Spatial data is not...

  19. Liquid Effluent Retention Facility

    Data.gov (United States)

    Federal Laboratory Consortium — The Liquid Effluent Retention Facility (LERF) is located in the central part of the Hanford Site. LERF is permitted by the State of Washington and has three liquid...

  20. Field Research Facility

    Data.gov (United States)

    Federal Laboratory Consortium — The Field Research Facility (FRF) located in Duck, N.C. was established in 1977 to support the U.S. Army Corps of Engineers' coastal engineering mission. The FRF is...

  1. Efficient kNN Classification With Different Numbers of Nearest Neighbors.

    Science.gov (United States)

    Zhang, Shichao; Li, Xuelong; Zong, Ming; Zhu, Xiaofeng; Wang, Ruili

    2017-04-12

    k nearest neighbor (kNN) method is a popular classification method in data mining and statistics because of its simple implementation and significant classification performance. However, it is impractical for traditional kNN methods to assign a fixed k value (even though set by experts) to all test samples. Previous solutions assign different k values to different test samples by the cross validation method but are usually time-consuming. This paper proposes a kTree method to learn different optimal k values for different test/new samples, by involving a training stage in the kNN classification. Specifically, in the training stage, kTree method first learns optimal k values for all training samples by a new sparse reconstruction model, and then constructs a decision tree (namely, kTree) using training samples and the learned optimal k values. In the test stage, the kTree fast outputs the optimal k value for each test sample, and then, the kNN classification can be conducted using the learned optimal k value and all training samples. As a result, the proposed kTree method has a similar running cost but higher classification accuracy, compared with traditional kNN methods, which assign a fixed k value to all test samples. Moreover, the proposed kTree method needs less running cost but achieves similar classification accuracy, compared with the newly kNN methods, which assign different k values to different test samples. This paper further proposes an improvement version of kTree method (namely, k*Tree method) to speed its test stage by extra storing the information of the training samples in the leaf nodes of kTree, such as the training samples located in the leaf nodes, their kNNs, and the nearest neighbor of these kNNs. We call the resulting decision tree as k*Tree, which enables to conduct kNN classification using a subset of the training samples in the leaf nodes rather than all training samples used in the newly kNN methods. This actually reduces running cost of

  2. Fast construction of k-nearest neighbor graphs for point clouds.

    Science.gov (United States)

    Connor, Michael; Kumar, Piyush

    2010-01-01

    We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existing methods: 1) faster construction of k-nearest neighbor graphs in practice on multicore machines, 2) less space usage, 3) better cache efficiency, 4) ability to handle large data sets, and 5) ease of parallelization and implementation. If the point set has a bounded expansion constant, our algorithm requires one-comparison-based parallel sort of points, according to Morton order plus near-linear additional steps to output the k-nearest neighbor graph.

  3. Region 9 NPDES Facilities 2012

    Data.gov (United States)

    U.S. Environmental Protection Agency — Point geospatial dataset representing locations of NPDES Facilities. NPDES (National Pollution Discharge Elimination System) is an EPA permit program that regulates...

  4. Region 9 NPDES 2011 Facilities

    Data.gov (United States)

    U.S. Environmental Protection Agency — Point geospatial dataset representing locations of NPDES Facilities. NPDES (National Pollution Discharge Elimination System) is an EPA permit program that regulates...

  5. The Islands Approach to Nearest Neighbor Querying in Spatial Networks

    DEFF Research Database (Denmark)

    Huang, Xuegang; Jensen, Christian Søndergaard; Saltenis, Simonas

    2005-01-01

    Much research has recently been devoted to the data management foundations of location-based mobile services. In one important scenario, the service users are constrained to a transportation network. As a result, query processing in spatial road networks is of interest. We propose a versatile app...

  6. Detection and localization of myocardial infarction using K-nearest neighbor classifier.

    Science.gov (United States)

    Arif, Muhammad; Malagore, Ijaz A; Afsar, Fayyaz A

    2012-02-01

    This paper presents automatic detection and localization of myocardial infarction (MI) using K-nearest neighbor (KNN) classifier. Time domain features of each beat in the ECG signal such as T wave amplitude, Q wave and ST level deviation, which are indicative of MI, are extracted from 12 leads ECG. Detection of MI aims to classify normal subjects without myocardial infarction and subjects suffering from Myocardial Infarction. For further investigation, Localization of MI is done to specify the region of infarction of the heart. Total 20,160 ECG beats from PTB database available on Physio-bank is used to investigate the performance of extracted features with KNN classifier. In the case of MI detection, sensitivity and specificity of KNN is found to be 99.9% using half of the randomly selected beats as training set and rest of the beats for testing. Moreover, Arif-Fayyaz pruning algorithm is used to prune the data which will reduce the storage requirement and computational cost of search. After pruning, sensitivity and specificity are dropped to 97% and 99.6% respectively but training is reduced by 93%. Myocardial Infarction beats are divided into ten classes based on the location of the infarction along with one class of normal subjects. Sensitivity and Specificity of above 90% is achieved for all eleven classes with overall classification accuracy of 98.8%. Some of the ECG beats are misclassified but interestingly these are misclassified to those classes whose location of infarction is near to the true classes of the ECG beats. Pruning is done on the training set for eleven classes and training set is reduced by 70% and overall classification accuracy of 98.3% is achieved. The proposed method due to its simplicity and high accuracy over the PTB database can be very helpful in correct diagnosis of MI in a practical scenario.

  7. Statistical Downscaling: A Comparison of Multiple Linear Regression and k-Nearest Neighbor Approaches

    Science.gov (United States)

    Gangopadhyay, S.; Clark, M. P.; Rajagopalan, B.

    2002-12-01

    The success of short term (days to fortnight) streamflow forecasting largely depends on the skill of surface climate (e.g., precipitation and temperature) forecasts at local scales in the individual river basins. The surface climate forecasts are used to drive the hydrologic models for streamflow forecasting. Typically, Medium Range Forecast (MRF) models provide forecasts of large scale circulation variables (e.g. pressures, wind speed, relative humidity etc.) at different levels in the atmosphere on a regular grid - which are then used to "downscale" to the surface climate at locations within the model grid box. Several statistical and dynamical methods are available for downscaling. This paper compares the utility of two statistical downscaling methodologies: (1) multiple linear regression (MLR) and (2) a nonparametric approach based on k-nearest neighbor (k-NN) bootstrap method, in providing local-scale information of precipitation and temperature at a network of stations in the Upper Colorado River Basin. Downscaling to the stations is based on output of large scale circulation variables (i.e. predictors) from the NCEP Medium Range Forecast (MRF) database. Fourteen-day six hourly forecasts are developed using these two approaches, and their forecast skill evaluated. A stepwise regression is performed at each location to select the predictors for the MLR. The k-NN bootstrap technique resamples historical data based on their "nearness" to the current pattern in the predictor space. Prior to resampling a Principal Component Analysis (PCA) is performed on the predictor set to identify a small subset of predictors. Preliminary results using the MLR technique indicate a significant value in the downscaled MRF output in predicting runoff in the Upper Colorado Basin. It is expected that the k-NN approach will match the skill of the MLR approach at individual stations, and will have the added advantage of preserving the spatial co-variability between stations, capturing

  8. The dual of a generalized minimax location problem

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1992-01-01

    This paper develops the dual formulation of a generalized minimax facility location problem which has distance and linear constraints......This paper develops the dual formulation of a generalized minimax facility location problem which has distance and linear constraints...

  9. The dual of a generalized minimax location problem

    DEFF Research Database (Denmark)

    Juel, Henrik; Love, Robert F.

    1992-01-01

    This paper develops the dual formulation of a generalized minimax facility location problem which has distance and linear constraints......This paper develops the dual formulation of a generalized minimax facility location problem which has distance and linear constraints...

  10. Continuous K-Nearest Neighbor Processing Based on Speed and Direction of Moving Objects in a Road Network.

    Science.gov (United States)

    Li, Guohui; Fan, Ping; Yuan, Ling

    2014-03-01

    Recent research has focused on Continuous K-Nearest Neighbor (CKNN) query over moving objects in road networks. A CKNN query is to find among all moving objects the K-Nearest Neighbors (KNNs) of a moving query point within a given time interval. As the data objects move frequently and arbitrarily in road networks, the frequent updates of object locations make it complicated to process CKNN accurately and efficiently. In this paper, according to the relative moving situation between the moving objects and the query point, a Moving State of Object (MSO) model is presented to indicate the relative moving state of the object to the query point. With the help of this model, we propose a novel Object Candidate Processing (OCP) algorithm to highly reduce the repetitive query cost with pruning phase and refining phase. In the pruning phase, the data objects which cannot be the KNN query results are excluded within the given time interval. In the refining phase, the time subintervals of the given time interval are determined where the certain KNN query results are obtained. Comprehensive experiments are conducted and the results verify the effectiveness of the proposed methods.

  11. Analyzing short time series data from periodically fluctuating rodent populations by threshold models:A nearest block bootstrap approach

    Institute of Scientific and Technical Information of China (English)

    CHAN; Kung-Sik; TONG; Howell; STENSETH; Nils; Chr

    2009-01-01

    The study of the rodent fluctuations of the North was initiated in its modern form with Elton’s pioneering work.Many scientific studies have been designed to collect yearly rodent abundance data,but the resulting time series are generally subject to at least two "problems":being short and non-linear.We explore the use of the continuous threshold autoregressive(TAR) models for analyzing such data.In the simplest case,the continuous TAR models are additive autoregressive models,being piecewise linear in one lag,and linear in all other lags.The location of the slope change is called the threshold parameter.The continuous TAR models for rodent abundance data can be derived from a general prey-predator model under some simplifying assumptions.The lag in which the threshold is located sheds important insights on the structure of the prey-predator system.We propose to assess the uncertainty on the location of the threshold via a new bootstrap called the nearest block bootstrap(NBB) which combines the methods of moving block bootstrap and the nearest neighbor bootstrap.The NBB assumes an underlying finite-order time-homogeneous Markov process.Essentially,the NBB bootstraps blocks of random block sizes,with each block being drawn from a non-parametric estimate of the future distribution given the realized past bootstrap series.We illustrate the methods by simulations and on a particular rodent abundance time series from Kilpisjrvi,Northern Finland.

  12. Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps

    CERN Document Server

    Zhang, Zhongzhi; Sheng, Yibin

    2015-01-01

    Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less for this dynamical process. In this paper, we present a study of mixed random walks in a family of fractal scale-free networks, where both nearest-neighbor and next-nearest-neighbor jumps are included. We focus on trapping problem in the network family, which is a particular case of random walks with a perfect trap fixed at the central high-degree node. We derive analytical expressions for the average trapping time (ATT), a quantitative indicator measuring the efficiency of the trapping process, by using two different methods, the results of which are consistent with each other. Furthermore, we analytically determine all the eigenvalues and their multiplicities for the fundamental matrix characterizing the dynamical process. Our results show that although next-nearest-neighb...

  13. Fast exact nearest patch matching for patch-based image editing and processing.

    Science.gov (United States)

    Xiao, Chunxia; Liu, Meng; Nie, Yongwei; Dong, Zhao

    2011-08-01

    This paper presents an efficient exact nearest patch matching algorithm which can accurately find the most similar patch-pairs between source and target image. Traditional match matching algorithms treat each pixel/patch as an independent sample and build a hierarchical data structure, such as kd-tree, to accelerate nearest patch finding. However, most of these approaches can only find approximate nearest patch and do not explore the sequential overlap between patches. Hence, they are neither accurate in quality nor optimal in speed. By eliminating redundant similarity computation of sequential overlap between patches, our method finds the exact nearest patch in brute-force style but reduces its running time complexity to be linear on the patch size. Furthermore, relying on recent multicore graphics hardware, our method can be further accelerated by at least an order of magnitude (≥10×). This greatly improves performance and ensures that our method can be efficiently applied in an interactive editing framework for moderate-sized image even video. To our knowledge, this approach is the fastest exact nearest patch matching method for high-dimensional patch and also its extra memory requirement is minimal. Comparisons with the popular nearest patch matching methods in the experimental results demonstrate the merits of our algorithm. © 2011 IEEE

  14. Finger vein identification using fuzzy-based k-nearest centroid neighbor classifier

    Science.gov (United States)

    Rosdi, Bakhtiar Affendi; Jaafar, Haryati; Ramli, Dzati Athiar

    2015-02-01

    In this paper, a new approach for personal identification using finger vein image is presented. Finger vein is an emerging type of biometrics that attracts attention of researchers in biometrics area. As compared to other biometric traits such as face, fingerprint and iris, finger vein is more secured and hard to counterfeit since the features are inside the human body. So far, most of the researchers focus on how to extract robust features from the captured vein images. Not much research was conducted on the classification of the extracted features. In this paper, a new classifier called fuzzy-based k-nearest centroid neighbor (FkNCN) is applied to classify the finger vein image. The proposed FkNCN employs a surrounding rule to obtain the k-nearest centroid neighbors based on the spatial distributions of the training images and their distance to the test image. Then, the fuzzy membership function is utilized to assign the test image to the class which is frequently represented by the k-nearest centroid neighbors. Experimental evaluation using our own database which was collected from 492 fingers shows that the proposed FkNCN has better performance than the k-nearest neighbor, k-nearest-centroid neighbor and fuzzy-based-k-nearest neighbor classifiers. This shows that the proposed classifier is able to identify the finger vein image effectively.

  15. [The urgency of the application of the medical sanitary passport in the system for chemical safety in the areas of location of high-risk chemical facilities in the Russian Federation].

    Science.gov (United States)

    Kombarova, M Iu; Radilov, A S; Dulov, S A

    2012-01-01

    The main provisions concerning the need for a creation of medical and sanitary passport for territories in the protective measures zones (PMZ) of storage facilities and facilities for the destruction of chemical weapons (FDCW) are presented in the article. The assessment of results of certification of the territory of PMZ and FDCW in "Maradykovsky" in the Kirov region has been done.

  16. Predicting viral protein subcellular localization with Chou's pseudo amino acid composition and imbalance-weighted multi-label K-nearest neighbor algorithm.

    Science.gov (United States)

    Cao, Jun-Zhe; Liu, Wen-Qi; Gu, Hong

    2012-11-01

    Machine learning is a kind of reliable technology for automated subcellular localization of viral proteins within a host cell or virus-infected cell. One challenge is that the viral protein samples are not only with multiple location sites, but also class-imbalanced. The imbalanced dataset often decreases the prediction performance. In order to accomplish this challenge, this paper proposes a novel approach named imbalance-weighted multi-label K-nearest neighbor to predict viral protein subcellular location with multiple sites. The experimental results by jackknife test indicate that the presented algorithm achieves a better performance than the existing methods and has great potentials in protein science.

  17. Evidence for non-existential readings of locative indefinites

    NARCIS (Netherlands)

    Poortman, Eva; Grimm, Robert; Lee, Choonkyu; Winter, Yoad

    2014-01-01

    We report on experimental results which show that sentences involving locative indefinites can give rise to non-existential readings. We are far from a gas station, for example, was judged as false by about two thirds of our subjects in situations where we are close to the nearest gas station, yet t

  18. Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level

    Directory of Open Access Journals (Sweden)

    Carrie Ka Yuk Lin

    2014-01-01

    Full Text Available Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units, satisfying the response time requirement, is analysed. The problem is formulated as a stochastic mixed integer program. A simulation-based hybrid heuristic is developed to solve the dynamic problem under different response time service level. An initial solution is obtained from solving static location-allocation models, followed by iterative improvement of the three levels of decisions by ejection, reinsertion procedure with memory of feasible and infeasible service regions. Results indicate that a higher response time service level could be achieved by allocating a given resource under an appropriate decentralized policy. Given a response time requirement, the general trend is that the minimum total capacity initially decreases with more facilities. During this stage, variability in travel time has more impact on capacity than variability in demand arrivals. Thereafter, the total capacity remains stable and then gradually increases. When service level requirement is high, the dynamic dispatch based on first-come-first-serve rule requires smaller capacity than the one by nearest-neighbour rule.

  19. 40 CFR 265.18 - Location standards.

    Science.gov (United States)

    2010-07-01

    ... FACILITIES General Facility Standards § 265.18 Location standards. The placement of any hazardous waste in a... 40 Protection of Environment 25 2010-07-01 2010-07-01 false Location standards. 265.18 Section 265.18 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) SOLID WASTES...

  20. EPA Facility Registry Service (FRS): ER_FRP

    Data.gov (United States)

    U.S. Environmental Protection Agency — This dataset contains location and facility identification information from EPA's Facility Registry System (FRS) for the subset of facilities that link to Facility...

  1. A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data

    Directory of Open Access Journals (Sweden)

    Ruzzo Walter L

    2006-03-01

    Full Text Available Abstract Background As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heterogeneous data sources. Methods In this paper, we address this issue by proposing a general framework for gene function prediction based on the k-nearest-neighbor (KNN algorithm. The choice of KNN is motivated by its simplicity, flexibility to incorporate different data types and adaptability to irregular feature spaces. A weakness of traditional KNN methods, especially when handling heterogeneous data, is that performance is subject to the often ad hoc choice of similarity metric. To address this weakness, we apply regression methods to infer a similarity metric as a weighted combination of a set of base similarity measures, which helps to locate the neighbors that are most likely to be in the same class as the target gene. We also suggest a novel voting scheme to generate confidence scores that estimate the accuracy of predictions. The method gracefully extends to multi-way classification problems. Results We apply this technique to gene function prediction according to three well-known Escherichia coli classification schemes suggested by biologists, using information derived from microarray and genome sequencing data. We demonstrate that our algorithm dramatically outperforms the naive KNN methods and is competitive with support vector machine (SVM algorithms for integrating heterogenous data. We also show that by combining different data sources, prediction accuracy can improve significantly. Conclusion Our extension of KNN with automatic feature weighting, multi-class prediction, and probabilistic inference, enhance prediction accuracy significantly while remaining efficient, intuitive and flexible. This general framework can also be applied to similar classification problems involving heterogeneous datasets.

  2. A regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data.

    Science.gov (United States)

    Yao, Zizhen; Ruzzo, Walter L

    2006-03-20

    As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heterogeneous data sources. In this paper, we address this issue by proposing a general framework for gene function prediction based on the k-nearest-neighbor (KNN) algorithm. The choice of KNN is motivated by its simplicity, flexibility to incorporate different data types and adaptability to irregular feature spaces. A weakness of traditional KNN methods, especially when handling heterogeneous data, is that performance is subject to the often ad hoc choice of similarity metric. To address this weakness, we apply regression methods to infer a similarity metric as a weighted combination of a set of base similarity measures, which helps to locate the neighbors that are most likely to be in the same class as the target gene. We also suggest a novel voting scheme to generate confidence scores that estimate the accuracy of predictions. The method gracefully extends to multi-way classification problems. We apply this technique to gene function prediction according to three well-known Escherichia coli classification schemes suggested by biologists, using information derived from microarray and genome sequencing data. We demonstrate that our algorithm dramatically outperforms the naive KNN methods and is competitive with support vector machine (SVM) algorithms for integrating heterogenous data. We also show that by combining different data sources, prediction accuracy can improve significantly Our extension of KNN with automatic feature weighting, multi-class prediction, and probabilistic inference, enhance prediction accuracy significantly while remaining efficient, intuitive and flexible. This general framework can also be applied to similar classification problems involving heterogeneous datasets.

  3. Searching for the Nearest Extragalactic Binary Black Hole: A Spectroscopic Study of NGC 4736

    Science.gov (United States)

    Gustafsson, Annika; Kwan, Teiler J.; Fisher, Robert Scott; Mason, Rachel

    2016-01-01

    In 1995 and 1996, Maoz et al. concluded that the nearby galaxy NGC 4736 (d=16 million light years) is in the late stages of a merger event. After further investigation, in 2005, Maoz et al. observed UV variability in the nuclear region of NGC 4736, revealing a second unknown source in the nucleus. Since late stage mergers are an ideal location to search for binary black holes (BBH), members of our team hypothesized that the second source could be a second black hole, making this a potential BBH system. This is important since observational evidence for their existence remains sparse, even though BBH are predicted by many theories and potentially play an important role in galaxy evolution. In January of 2008, NGC 4736 was observed with the GMOS-N instrument on Gemini North. Optical longslit spectra of the nuclear region were obtained with spatial resolution of 0.1454''/pixel and a spectral resolution of R~1700. At this resolution, the two nuclear sources are spatially resolved at a projected separation of 2.5''. As a result, we can classify the nature of the second source by looking at the optical line ratios following Ho et al. (1997). High signal-to-noise spectra of the unknown source displayed strong emission of [SII] and [NII], but an extremely weak [OIII] emission line. The unknown source has a calculated [NII]/[Hα] ratio of 1.37 and an upper limit of 0.6 for the [OIII]/[Hβ] ratio. Placing the unknown source on the BPT-NII diagram (Baldwin et al., 1981), we tentatively conclude that it is a low-luminosity second black hole potentially making NGC 4736 the nearest BBH system. The result will enable future high-spectral and spatial resolution observations of a low-luminosity system in extremely late stages of merging, which will be a significant step forward in validating models of galaxy mergers and AGN activity.

  4. Atmospheric mercury dispersion modelling from two nearest hypothetical point sources

    Energy Technology Data Exchange (ETDEWEB)

    Al Razi, Khandakar Md Habib; Hiroshi, Moritomi; Shinji, Kambara [Environmental and Renewable Energy System (ERES), Graduate School of Engineering, Gifu University, Yanagido, Gifu City, 501-1193 (Japan)

    2012-07-01

    concentration distribution in the vicinity of industrial facilities.

  5. Atmospheric mercury dispersion modelling from two nearest hypothetical point sources

    Directory of Open Access Journals (Sweden)

    Khandakar Md Habib Al Razi, Moritomi Hiroshi, Kambara Shinji

    2012-01-01

    atmospheric concentration distribution in the vicinity of industrial facilities.

  6. Assisted Living Facilities, To identify the location of all Daycare centers in Miami-Dade County., Published in 2012, 1:600 (1in=50ft) scale, Miami-Dade County, Information Technology Department.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Assisted Living Facilities dataset, published at 1:600 (1in=50ft) scale, was produced all or in part from Other information as of 2012. It is described as 'To...

  7. Assisted Living Facilities, To identify the Adult Living facilites location within Miami-Dade County, Published in 2012, 1:2400 (1in=200ft) scale, Miami-Dade County, Information Technology Department.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Assisted Living Facilities dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Other information as of 2012. It is described as 'To...

  8. Park Facilities, This layer shows the approximate location of park and other recreational amenties in the County of Polk, Wisconsin., Published in 2007, 1:2400 (1in=200ft) scale, Polk County, Wisconsin.

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — This Park Facilities dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Orthoimagery information as of 2007. It is described as 'This...

  9. Biochemistry Facility

    Data.gov (United States)

    Federal Laboratory Consortium — The Biochemistry Facility provides expert services and consultation in biochemical enzyme assays and protein purification. The facility currently features 1) Liquid...

  10. Improved locality-sensitive hashing method for the approximate nearest neighbor problem

    Science.gov (United States)

    Lu, Ying-Hua; Ma, Ting-Huai; Zhong, Shui-Ming; Cao, Jie; Wang, Xin; Abdullah, Al-Dhelaan

    2014-08-01

    In recent years, the nearest neighbor search (NNS) problem has been widely used in various interesting applications. Locality-sensitive hashing (LSH), a popular algorithm for the approximate nearest neighbor problem, is proved to be an efficient method to solve the NNS problem in the high-dimensional and large-scale databases. Based on the scheme of p-stable LSH, this paper introduces a novel improvement algorithm called randomness-based locality-sensitive hashing (RLSH) based on p-stable LSH. Our proposed algorithm modifies the query strategy that it randomly selects a certain hash table to project the query point instead of mapping the query point into all hash tables in the period of the nearest neighbor query and reconstructs the candidate points for finding the nearest neighbors. This improvement strategy ensures that RLSH spends less time searching for the nearest neighbors than the p-stable LSH algorithm to keep a high recall. Besides, this strategy is proved to promote the diversity of the candidate points even with fewer hash tables. Experiments are executed on the synthetic dataset and open dataset. The results show that our method can cost less time consumption and less space requirements than the p-stable LSH while balancing the same recall.

  11. Earthquake Declustering via a Nearest-Neighbor Approach in Space-Time-Magnitude Domain

    Science.gov (United States)

    Zaliapin, I. V.; Ben-Zion, Y.

    2016-12-01

    We propose a new method for earthquake declustering based on nearest-neighbor analysis of earthquakes in space-time-magnitude domain. The nearest-neighbor approach was recently applied to a variety of seismological problems that validate the general utility of the technique and reveal the existence of several different robust types of earthquake clusters. Notably, it was demonstrated that clustering associated with the largest earthquakes is statistically different from that of small-to-medium events. In particular, the characteristic bimodality of the nearest-neighbor distances that helps separating clustered and background events is often violated after the largest earthquakes in their vicinity, which is dominated by triggered events. This prevents using a simple threshold between the two modes of the nearest-neighbor distance distribution for declustering. The current study resolves this problem hence extending the nearest-neighbor approach to the problem of earthquake declustering. The proposed technique is applied to seismicity of different areas in California (San Jacinto, Coso, Salton Sea, Parkfield, Ventura, Mojave, etc.), as well as to the global seismicity, to demonstrate its stability and efficiency in treating various clustering types. The results are compared with those of alternative declustering methods.

  12. Monte Carlo study of a ferrimagnetic mixed-spin (2, 5/2) system with the nearest and next-nearest neighbors exchange couplings

    Science.gov (United States)

    Bi, Jiang-lin; Wang, Wei; Li, Qi

    2017-07-01

    In this paper, the effects of the next-nearest neighbors exchange couplings on the magnetic and thermal properties of the ferrimagnetic mixed-spin (2, 5/2) Ising model on a 3D honeycomb lattice have been investigated by the use of Monte Carlo simulation. In particular, the influences of exchange couplings (Ja, Jb, Jan) and the single-ion anisotropy(Da) on the phase diagrams, the total magnetization, the sublattice magnetization, the total susceptibility, the internal energy and the specific heat have been discussed in detail. The results clearly show that the system can express the critical and compensation behavior within the next-nearest neighbors exchange coupling. Great deals of the M curves such as N-, Q-, P- and L-types have been discovered, owing to the competition between the exchange coupling and the temperature. Compared with other theoretical and experimental works, our results have an excellent consistency with theirs.

  13. Nearest-Neighbor and Non-Nearest-Neighbor Interactions between Substituents in the Benzene Ring. Experimental and Theoretical Study of Functionally Substituted Benzamides.

    Science.gov (United States)

    Verevkin, Sergey P; Emel'yanenko, Vladimir N; Nagrimanov, Ruslan N

    2016-12-15

    Standard molar enthalpies of formation of 2- and 4-hydroxybenzamides were measured by combustion calorimetry. Vapor pressures of benzamide and 2-hydroxybenzamide were derived by the transpiration method. Standard molar enthalpies of sublimation or vaporization of these compounds at 298 K were obtained from vapor pressure temperature dependence. Thermochemical data on benzamides with hydroxyl, methyl, methoxy, amino, and amide substituents were collected, evaluated, and tested for internal consistency. The high-level G4 quantum-chemical method was used for mutual validation of the experimental and theoretical gas-phase enthalpies of formation. Sets of nearest-neighbor and non-nearest-neighbor interactions between substituents in the benzene ring have been evaluated. A simple incremental procedure has been suggested for a quick appraisal of the vaporization and gas-phase formation enthalpies of the substituted benzamides.

  14. Phase diagram and critical behavior of the square-lattice Ising model with competing nearest- and next-nearest-neighbor interactions

    Science.gov (United States)

    Yin, Junqi; Landau, David

    2010-03-01

    Using the parallel tempering algorithm and GPU accelerated techniques, we have performed large-scale Monte Carlo simulations of the Ising (lattice gas) model on a square lattice with antiferromagnetic (repulsive) nearest-neighbor and next-nearest-neighbor interactions of the same strength and subject to a uniform magnetic field. Possibility of the XY-like transition is examined and both transitions from the (2x1) and row-shifted (2x2) ordered phases to the paramagnetic phase turn out to be continuous. From our data analysis, reentrance behavior of the (2x1) critical line and a bicritical point which separates the two ordered phases at T=0 are confirmed. Based on the non-universal critical exponents we obtained along the phase boundary, Suzuki's weak universality seems to hold.

  15. Linear perturbation renormalization group for the two-dimensional Ising model with nearest- and next-nearest-neighbor interactions in a field

    Science.gov (United States)

    Sznajd, J.

    2016-12-01

    The linear perturbation renormalization group (LPRG) is used to study the phase transition of the weakly coupled Ising chains with intrachain (J ) and interchain nearest-neighbor (J1) and next-nearest-neighbor (J2) interactions forming the triangular and rectangular lattices in a field. The phase diagrams with the frustration point at J2=-J1/2 for a rectangular lattice and J2=-J1 for a triangular lattice have been found. The LPRG calculations support the idea that the phase transition is always continuous except for the frustration point and is accompanied by a divergence of the specific heat. For the antiferromagnetic chains, the external field does not change substantially the shape of the phase diagram. The critical temperature is suppressed to zero according to the power law when approaching the frustration point with an exponent dependent on the value of the field.

  16. Linear perturbation renormalization group for the two-dimensional Ising model with nearest- and next-nearest-neighbor interactions in a field.

    Science.gov (United States)

    Sznajd, J

    2016-12-01

    The linear perturbation renormalization group (LPRG) is used to study the phase transition of the weakly coupled Ising chains with intrachain (J) and interchain nearest-neighbor (J_{1}) and next-nearest-neighbor (J_{2}) interactions forming the triangular and rectangular lattices in a field. The phase diagrams with the frustration point at J_{2}=-J_{1}/2 for a rectangular lattice and J_{2}=-J_{1} for a triangular lattice have been found. The LPRG calculations support the idea that the phase transition is always continuous except for the frustration point and is accompanied by a divergence of the specific heat. For the antiferromagnetic chains, the external field does not change substantially the shape of the phase diagram. The critical temperature is suppressed to zero according to the power law when approaching the frustration point with an exponent dependent on the value of the field.

  17. Location-routing problems

    Energy Technology Data Exchange (ETDEWEB)

    Laporte, G.

    1987-01-01

    Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.

  18. Tunnel personnel positioning method based on TOA and modified location-fingerprint positioning

    Institute of Scientific and Technical Information of China (English)

    Sun Jiping; Li Chenxin

    2016-01-01

    To position personnel in mines, the study discussed in this paper built on the tunnel personnel positioning method on the basis of both TOA and location-finger print (LFP) positioning. Given non-line of sight (NLOS) time delay in signal transmission caused by facilities and equipment shielding in tunnels and TOA measurement errors in both LFP database data and real-time data, this paper puts forth a database data de-noising algorithm based on distance threshold limitation and modified mean filtering (MMF), as well as a real-time data suppression algorithm based on speed threshold limitation and MMF. On this basis, a nearest neighboring data matching algorithm based on historical location and the speed threshold limitation is used to estimate personnel location and realize accurate personnel positioning. The results from both simulation and the experiment suggest that:compared with the basic LFP position-ing method and the method that only suppresses real-time data error, the tunnel personnel positioning methods based on TOA and modified LFP positioning permits effectively eliminating error in TOA mea-surement, making the measured data close to the true positional data, and dropping the positioning error:the maximal positioning error in measurements from experiment drops by 9 and 3 m, respectively, and the positioning accuracy of 3 m is achievable in the condition used in the experiment.

  19. A fast approximate nearest neighbor search algorithm in the Hamming space.

    Science.gov (United States)

    Esmaeili, Mani Malek; Ward, Rabab Kreidieh; Fatourechi, Mehrdad

    2012-12-01

    A fast approximate nearest neighbor search algorithm for the (binary) Hamming space is proposed. The proposed Error Weighted Hashing (EWH) algorithm is up to 20 times faster than the popular locality sensitive hashing (LSH) algorithm and works well even for large nearest neighbor distances where LSH fails. EWH significantly reduces the number of candidate nearest neighbors by weighing them based on the difference between their hash vectors. EWH can be used for multimedia retrieval and copy detection systems that are based on binary fingerprinting. On a fingerprint database with more than 1,000 videos, for a specific detection accuracy, we demonstrate that EWH is more than 10 times faster than LSH. For the same retrieval time, we show that EWH has a significantly better detection accuracy with a 15 times lower error rate.

  20. Superconductivity in an attractive two-band Hubbard model with second nearest neighbors

    Science.gov (United States)

    Peraza-Salcedo, D. A.; Rodríguez-Núñez, J. J.; Bonalde, I.; Schmidt, A. A.

    2017-04-01

    This work extends the calculations performed by G. Litak, T. Örd, K. Rägo, and A. Vargunin, Physica C 483, 30 (2012), by including second nearest neighbors in an attractive two-orbital Hubbard model. We assumed that both the intra-orbital (Ui, i, with i = 1 , 2) and the inter-orbital Hubbard correlations (Ui, j, with i ≠ j) are negative; namely, Ui, j ≤ 0, ∀(i, j). We calculated the T - n phase diagram in the mean-field approximation. For a finite chemical potential ξ10 and a certain second nearest-neighbor parameter t2 superconductivity develops in two dome-like regions, each of which has its own energy gap. Notoriously, for t2 / |t1 | = 0.70 and ξ10 / |t1 | = 3 , where t1 is the nearest-neighbor parameter, Tc becomes zero around n = 2.5 .

  1. A Novel Preferential Diffusion Recommendation Algorithm Based on User’s Nearest Neighbors

    Directory of Open Access Journals (Sweden)

    Fuguo Zhang

    2017-01-01

    Full Text Available Recommender system is a very efficient way to deal with the problem of information overload for online users. In recent years, network based recommendation algorithms have demonstrated much better performance than the standard collaborative filtering methods. However, most of network based algorithms do not give a high enough weight to the influence of the target user’s nearest neighbors in the resource diffusion process, while a user or an object with high degree will obtain larger influence in the standard mass diffusion algorithm. In this paper, we propose a novel preferential diffusion recommendation algorithm considering the significance of the target user’s nearest neighbors and evaluate it in the three real-world data sets: MovieLens 100k, MovieLens 1M, and Epinions. Experiments results demonstrate that the novel preferential diffusion recommendation algorithm based on user’s nearest neighbors can significantly improve the recommendation accuracy and diversity.

  2. Experimental simulation of next-nearest-neighbor Heisenberg chain with photonic crystal waveguide array

    CERN Document Server

    Qi, F; Ma, Q Y; Qi, A Y; Xu, P; Zhu, S N; Zheng, W H

    2016-01-01

    Next-nearest-neighbor Heisenberg chain plays important roles in solid state physics, such as predicting exotic electric properties of two-dimensional materials or magnetic properties of organic compounds. Direct experimental studies of the many-body electron systems or spin systems associating to these materials are challenging tasks, while optical simulation provides an effective and economical way for immediate observation. Comparing with bulk optics, integrated optics are more of fascinating for steady, large scale and long-time evolution simulations. Photonic crystal is an artificial microstructure material with multiple methods to tune the propagation properties, which are essential for various simulation tasks. Here we report for the first time an experimental simulation of next-nearest-neighbor Heisenberg chain with an integrated optical chip of photonic crystal waveguide array. The use of photonic crystal enhances evanescent field thus allows coupling between next-nearest-neighbor waveguides in such a...

  3. A nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix

    Institute of Scientific and Technical Information of China (English)

    李文法

    2016-01-01

    Problems existin similarity measurement and index tree construction which affect the perform-ance of nearest neighbor search of high-dimensional data .The equidistance problem is solved using NPsim function to calculate similarity .And a sequential NPsim matrix is built to improve indexing performance .To sum up the above innovations , a nearest neighbor search algorithm of high-dimen-sional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set .Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others .In addition , the slow construction speed of sequential NPsim matrix can be increased by using parallel computing .

  4. An Efficient Bayesian Nearest Neighbor Search Using Marginal Object Weight Ranking Scheme in Spatial Databases

    Directory of Open Access Journals (Sweden)

    K. Duraiswamy

    2012-01-01

    Full Text Available Problem statement: A database that is optimized to store and query data that is related to objects in space, including points, lines and polygons is called spatial database. Identifying nearest neighbor object search is a vital part of spatial database. Many nearest neighbor search techniques such as Authenticated Multi-step NN (AMNN, Superseding Nearest Neighbor (SNN search, Bayesian Nearest Neighbor (BNN and so on are available. But they had some difficulties while performing NN in uncertain spatial database. AMNN does not process the queries from distributed server and it accesses the queries only from single server. In SNN, the high dimensional data structure could not be used in NN search and it accesses only low dimensional data for NN search. Approach: The previous works described the process of NN using SNN with marginal object weight ranking. The downside over the previous work is that the performance is poor when compared to another work which performed NN using BNN. To improve the NN search in spatial databases using BNN, we are going to present a new technique as BNN search using marginal object weight ranking. Based on events occurring in the nearest object, BNN starts its search using MOW. The MOW is done by computing the weight of each NN objects and rank each object based on its frequency and distance of NN object for an efficient NN search in spatial databases. Results: Marginal Object Weight (MOW is introduced to all nearest neighbor object identified using BNN for any relevant query point. It processes the queries from distributed server using MOW. Conclusion: The proposed BNN using MOW framework is experimented with real data sets to show the performance improvement with the previous MOW using SNN in terms of execution time, memory consumption and query result accuracy.

  5. th-Nearest neighbour distribution functions of a binary fluid mixture

    Indian Academy of Sciences (India)

    P Sur; B Bhattacharjee

    2009-09-01

    For obtaining microscopic structural information in binary mixtures, often partial pair correlation functions are used. In the present study, a general approach is presented for obtaining the neighbourhood structural information for binary mixtures in terms of nth nearest neighbour distribution (NND) functions (for = 1, 2, 3, ...$\\ldots$). These functions are derived from the partial pair correlation functions in a hierarchical manner, based on the approach adopted earlier by us for single component fluids. Comparison of the results with MD simulation for Lennard-Jones binary mixtures is also presented. NND functions show reasonable matching for smaller n values particularly at higher density. The average th nearest neighbour distance shows interesting feature.

  6. Segmenting Multiple Sclerosis Lesions Using a Spatially Constrained K-Nearest Neighbour Approach

    DEFF Research Database (Denmark)

    Lyksborg, Mark; Larsen, Rasmus; Sørensen, Per Soelberg;

    2012-01-01

    We propose a method for the segmentation of Multiple Sclerosis lesions. The method is based on probability maps derived from a K-Nearest Neighbours classification. These are used as a non parametric likelihood in a Bayesian formulation with a prior that assumes connectivity of neighbouring voxels......, the diffusion MRI measures of Fractional Anisotropy (FA), Mean Diffusivity (MD) and several spatial features. Results show a benefit from the inclusion of diffusion primarily to the most difficult cases. Results shows that combining probabilistic K-Nearest Neighbour with a Markov Random Field formulation leads...... to a slight improvement of segmentations....

  7. Estimating the posterior probabilities using the k-nearest neighbor rule.

    Science.gov (United States)

    Atiya, Amir F

    2005-03-01

    In many pattern classification problems, an estimate of the posterior probabilities (rather than only a classification) is required. This is usually the case when some confidence measure in the classification is needed. In this article, we propose a new posterior probability estimator. The proposed estimator considers the K-nearest neighbors. It attaches a weight to each neighbor that contributes in an additive fashion to the posterior probability estimate. The weights corresponding to the K-nearest-neighbors (which add to 1) are estimated from the data using a maximum likelihood approach. Simulation studies confirm the effectiveness of the proposed estimator.

  8. A Quantum Cellular Automata architecture with nearest neighbor interactions using one quantum gate type

    CERN Document Server

    Ntalaperas, D

    2016-01-01

    We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single qubit operations and continuing with two qubit ones. The effectiveness of the model is tested and valuated by developing a quantum circuit implementing the Quantum Fourier Transform. The important outcome of this validation was that the operations are performed in a local and controlled manner thus reducing the error rate of each computational step.

  9. Lattice Green's Function for Infinite Square Lattice in the Second Nearest-Neighbour Interaction Approximation

    Institute of Scientific and Technical Information of China (English)

    FAN Hong-Yi; LIN Jing-Xian

    2001-01-01

    In dealing with the square lattice model,we replace the traditionally needed Born-Von Karmann periodic boundary condition with additional Hamiltonian terms to make up a ring lattice.In doing so,the lattice Green's function of an infinite square lattice in the second nearest-neighbour interaction approximation can be derived by means of the matrix Green's function method.It is shown that the density of states may change when the second nearest-neighbour interaction is turned on.``

  10. Locating a circle on a sphere

    DEFF Research Database (Denmark)

    Brimberg, Jack; Juel, Henrik; Schöbel, Anita

    2007-01-01

    We consider the problem of locating a spherical circle with respect to existing facilities on a sphere, such that the sum of distances between the circle and the facilities is minimized or such that the maximum distance is minimized. The problem properties are analyzed, and we give solution...... procedures. When the circle to be located is restricted to be a great circle, some simplifications are possible. The models may be used in preliminary studies on the location of large linear facilities on the earth's surface, such as superhighways, pipelines, and transmission lines, or in totally different...

  11. Location Based Services and Applications

    Directory of Open Access Journals (Sweden)

    Elenis Gorrita Michel

    2012-05-01

    Full Text Available Location Based Services (LBS continue to grow in popularity, effectiveness and reliability, to the extent that applications are designed and implemented taking into account the facilities of the user location information. In this work, some of the main applications are addressed, in order to make an assessment of the current importance of the LBS, as a branch of technology in full swing. In addition, the main techniques for location estimation are studied, essential information to the LBS. Because of this it is a highly topical issue, the ongoing works and researches are also discussed.

  12. FRS (Facility Registration System) Sites, Geographic NAD83, EPA (2007) [facility_registration_system_sites_LA_EPA_2007

    Data.gov (United States)

    Louisiana Geographic Information Center — This dataset contains locations of Facility Registry System (FRS) sites which were pulled from a centrally managed database that identifies facilities, sites or...

  13. 30 CFR 816.181 - Support facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 3 2010-07-01 2010-07-01 false Support facilities. 816.181 Section 816.181... § 816.181 Support facilities. (a) Support facilities shall be operated in accordance with a permit... results. (b) In addition to the other provisions of this part, support facilities shall be located...

  14. 30 CFR 57.20008 - Toilet facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Toilet facilities. 57.20008 Section 57.20008....20008 Toilet facilities. (a) Toilet facilities shall be provided at locations that are compatible with the mine operations and that are readily accessible to mine personnel. (b) The facilities shall be...

  15. 30 CFR 56.20008 - Toilet facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Toilet facilities. 56.20008 Section 56.20008... Toilet facilities. (a) Toilet facilities shall be provided at locations that are compatible with the mine operations and that are readily accessible to mine personnel. (b) The facilities shall be kept clean and...

  16. 30 CFR 817.181 - Support facilities.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 3 2010-07-01 2010-07-01 false Support facilities. 817.181 Section 817.181... ACTIVITIES § 817.181 Support facilities. (a) Support facilities shall be operated in accordance with a permit.... (b) In addition to the other provisions of this part, support facilities shall be located, maintained...

  17. Mapping change of older forest with nearest-neighbor imputation and Landsat time-series

    Science.gov (United States)

    Janet L. Ohmann; Matthew J. Gregory; Heather M. Roberts; Warren B. Cohen; Robert E. Kennedy; Zhiqiang. Yang

    2012-01-01

    The Northwest Forest Plan (NWFP), which aims to conserve late-successional and old-growth forests (older forests) and associated species, established new policies on federal lands in the Pacific Northwest USA. As part of monitoring for the NWFP, we tested nearest-neighbor imputation for mapping change in older forest, defined by threshold values for forest attributes...

  18. Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

    DEFF Research Database (Denmark)

    Sturm, Bob L.; Daudet, Laurent

    2011-01-01

    We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...

  19. Latching chains in K-nearest-neighbor and modular small-world networks.

    Science.gov (United States)

    Song, Sanming; Yao, Hongxun; Simonov, Alexander Yurievich

    2015-01-01

    Latching dynamics retrieve pattern sequences successively by neural adaption and pattern correlation. We have previously proposed a modular latching chain model in Song et al. (2014) to better accommodate the structured transitions in the brain. Different cortical areas have different network structures. To explore how structural parameters like rewiring probability, threshold, noise and feedback connections affect the latching dynamics, two different connection schemes, K-nearest-neighbor network and modular network both having modular structure are considered. Latching chains are measured using two proposed measures characterizing length of intra-modular latching chains and sequential inter-modular association transitions. Our main findings include: (1) With decreasing threshold coefficient and rewiring probability, both the K-nearest-neighbor network and the modular network experience quantitatively similar phase change processes. (2) The modular network exhibits selectively enhanced latching in the small-world range of connectivity. (3) The K-nearest-neighbor network is more robust to changes in rewiring probability, while the modular network is more robust to the presence of noise pattern pairs and to changes in the strength of feedback connections. According to our findings, the relationships between latching chains in K-nearest-neighbor and modular networks and different forms of cognition and information processing emerging in the brain are discussed.

  20. Text Categorization Based on K-Nearest Neighbor Approach for Web Site Classification.

    Science.gov (United States)

    Kwon, Oh-Woog; Lee, Jong-Hyeok

    2003-01-01

    Discusses text categorization and Web site classification and proposes a three-step classification system that includes the use of Web pages linked with the home page. Highlights include the k-nearest neighbor (k-NN) approach; improving performance with a feature selection method and a term weighting scheme using HTML tags; and similarity…