Relevant bibliographies by topics / Set covering

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Set covering'

Author: Grafiati
Published: 4 June 2021
Last updated: 22 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Set covering.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Set covering"

1

Jones, Lenny, and Daniel White. "On primitive covering numbers." International Journal of Number Theory 13, no. 01 (November 16, 2016): 27–37. http://dx.doi.org/10.1142/s1793042117500038.

Full text
Abstract:
In 2007, Zhi-Wei Sun defined a covering number to be a positive integer [Formula: see text] such that there exists a covering system of the integers where the moduli are distinct divisors of [Formula: see text] greater than 1. A covering number [Formula: see text] is called primitive if no proper divisor of [Formula: see text] is a covering number. Sun constructed an infinite set [Formula: see text] of primitive covering numbers, and he conjectured that every primitive covering number must satisfy a certain condition. In this paper, for a given [Formula: see text], we derive a formula that gives the exact number of coverings that have [Formula: see text] as the least common multiple of the set [Formula: see text] of moduli, under certain restrictions on [Formula: see text]. Additionally, we disprove Sun’s conjecture by constructing an infinite set of primitive covering numbers that do not satisfy his primitive covering number condition.
APA, Harvard, Vancouver, ISO, and other styles
2

Lombardi, Michele. "Minimal covering set solutions." Social Choice and Welfare 32, no. 4 (December 20, 2008): 687–95. http://dx.doi.org/10.1007/s00355-008-0361-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lefkovitch, L. P. "Entropy and set covering." Information Sciences 36, no. 3 (September 1985): 283–94. http://dx.doi.org/10.1016/0020-0255(85)90058-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

ZIMMERMANN, KAREL. "FUZZY SET COVERING PROBLEM." International Journal of General Systems 20, no. 1 (December 1991): 127–31. http://dx.doi.org/10.1080/03081079108945020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Havrda, Jan. "Projection and covering in a set with orthogonality." Časopis pro pěstování matematiky 112, no. 3 (1987): 245–48. http://dx.doi.org/10.21136/cpm.1987.118319.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ma, Zhengyu, Kedong Yan, Kwangsoo Kim, and Hong Seo Ryoo. "Set Covering-based Feature Selection of Large-scale Omics Data." Journal of the Korean Operations Research and Management Science Society 39, no. 4 (November 30, 2014): 75–84. http://dx.doi.org/10.7737/jkorms.2014.39.4.075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chang, H. C., and N. Prabhu. "Set covering number for a finite set." Bulletin of the Australian Mathematical Society 53, no. 2 (April 1996): 267–69. http://dx.doi.org/10.1017/s0004972700016981.

Full text
Abstract:
Given a finite set S of cardinality N, the minimum number of j-subsets of S needed to cover all the r-subsets of S is called the covering number C(N, j, r). While Erdös and Hanani's conjecture that was proved by Rödl, no nontrivial upper bound for C(N, j, r) was known for finite N. In this note we obtain a nontrivial upper bound by showing that for finite N,
APA, Harvard, Vancouver, ISO, and other styles
8

Beraldi, Patrizia, and Andrzej Ruszczyński. "The Probabilistic Set-Covering Problem." Operations Research 50, no. 6 (December 2002): 956–67. http://dx.doi.org/10.1287/opre.50.6.956.345.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ahmed, Shabbir, and Dimitri J. Papageorgiou. "Probabilistic Set Covering with Correlations." Operations Research 61, no. 2 (April 2013): 438–52. http://dx.doi.org/10.1287/opre.1120.1135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brandt, Felix, and Felix Fischer. "Computing the minimal covering set." Mathematical Social Sciences 56, no. 2 (September 2008): 254–68. http://dx.doi.org/10.1016/j.mathsocsci.2008.04.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Set covering"

1

Umetani, Shunji, Mutsunori Yagiura, and 睦憲 柳浦. "RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM." 日本オペレーションズ・リサーチ学会, 2007. http://hdl.handle.net/2237/11724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Parrish, Edna L. "Generalized total and partial set covering problems." Thesis, Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/91140.

Full text
Abstract:
This thesis is concerned with the development of two generalized set covering models. The first model is formulated for the total set covering problem where cost is minimized subject to the constraint that each customer must be served by at least one facility. The second model is constructed for the partial set covering problem in which customer coverage is maximized subject to a budget constraint. The conventional formulations of both the total set covering and partial set covering problems are shown to be special cases of the two generalized models that arc developed. Appropriate solution strategies arc discussed for each generalized model. A specialized algorithm for a particular case of the partial covering problem is constructed and computational results are presented.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
3

Lambie-Hanson, Christopher. "Covering Matrices, Squares, Scales, and Stationary Reflection." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/368.

Full text
Abstract:
In this thesis, we present a number of results in set theory, particularly in the areas of forcing, large cardinals, and combinatorial set theory. Chapter 2 concerns covering matrices, combinatorial structures introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of this proof and subsequent work with Sharon, Viale isolated two reflection principles, CP and S, which can hold of covering matrices. We investigate covering matrices for which CP and S fail and prove some results about the connections between such covering matrices and various square principles. In Chapter 3, motivated by the results of Chapter 2, we introduce a number of square principles intermediate between the classical and (+). We provide a detailed picture of the implications and independence results which exist between these principles when is regular. In Chapter 4, we address three questions raised by Cummings and Foreman regarding a model of Gitik and Sharon. We first analyze the PCF-theoretic structure of the Gitik-Sharon model, determining the extent of good and bad scales. We then classify the bad points of the bad scales existing in both the Gitik-Sharon model and various other models containing bad scales. Finally, we investigate the ideal of subsets of singular cardinals of countable cofinality carrying good scales. In Chapter 5, we prove that, assuming large cardinals, it is consistent that there are many singular cardinals such that every stationary subset of + reflects but there are stationary subsets of + that do not reflect at ordinals of arbitrarily high cofinality. This answers a question raised by Todd Eisworth and is joint work with James Cummings. In Chapter 6, we extend a result of Gitik, Kanovei, and Koepke regarding intermediate models of Prikry-generic forcing extensions to Radin generic forcing extensions. Specifically, we characterize intermediate models of forcing extensions by Radin forcing at a large cardinal using measure sequences of length less than. In the final brief chapter, we prove some results about iterations of w1-Cohen forcing with w1-support, answering a question of Justin Moore.
APA, Harvard, Vancouver, ISO, and other styles
4

Feng, Jinghua. "Redundancy in nonlinear systems, a set covering approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0010/MQ52546.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Djannaty, Farhad. "Network based heuristics for the set covering problem." Thesis, Brunel University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rosas, José Humberto Ablanedo. "Algorithms for very large scale set covering problems /." Full text available from ProQuest UM Digital Dissertations, 2007. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1609001671&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1244747021&clientId=22256.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Annen, Oliver. "Das Partial set covering problem und Erweiterungen Modellierung und Lösungsverfahren /." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969854226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chang, Engder. "Neural computing for minimum set covering and gate-packing problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

El-Darzi, E. "Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms." Thesis, Brunel University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381678.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Maltais, Elizabeth Jane. "Graph-dependent Covering Arrays and LYM Inequalities." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34434.

Full text
Abstract:
The problems we study in this thesis are all related to covering arrays. Covering arrays are combinatorial designs, widely used as templates for efficient interaction-testing suites. They have connections to many areas including extremal set theory, design theory, and graph theory. We define and study several generalizations of covering arrays, and we develop a method which produces an infinite family of LYM inequalities for graph-intersecting collections. A common theme throughout is the dependence of these problems on graphs. Our main contribution is an extremal method yielding LYM inequalities for $H$-intersecting collections, for every undirected graph $H$. Briefly, an $H$-intersecting collection is a collection of packings (or partitions) of an $n$-set in which the classes of every two distinct packings in the collection intersect according to the edges of $H$. We define ``$F$-following" collections which, by definition, satisfy a LYM-like inequality that depends on the arcs of a ``follow" digraph $F$ and a permutation-counting technique. We fully characterize the correspondence between ``$F$-following" and ``$H$-intersecting" collections. This enables us to apply our inequalities to $H$-intersecting collections. For each graph $H$, the corresponding inequality inherently bounds the maximum number of columns in a covering array with alphabet graph $H$. We use this feature to derive bounds for covering arrays with the alphabet graphs $S_3$ (the star on three vertices) and $\kvloop{3}$ ($K_3$ with loops). The latter improves a known bound for classical covering arrays of strength two. We define covering arrays on column graphs and alphabet graphs which generalize covering arrays on graphs. The column graph encodes which pairs of columns must be $H$-intersecting, where $H$ is a given alphabet graph. Optimizing covering arrays on column graphs and alphabet graphs is equivalent to a graph-homomorphism problem to a suitable family of targets which generalize qualitative independence graphs. When $H$ is the two-vertex tournament, we give constructions and bounds for covering arrays on directed column graphs. FOR arrays are the broadest generalization of covering arrays that we consider. We define FOR arrays to encompass testing applications where constraints must be considered, leading to forbidden, optional, and required interactions of any strength. We model these testing problems using a hypergraph. We investigate the existence of FOR arrays, the compatibility of their required interactions, critical systems, and binary relational systems that model the problem using homomorphisms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Set covering"

1

Canada, Canada Agriculture, ed. Optimal set covering for biological classification. Ottawa: Agriculture Canada, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kedia, Pradeep. Optimal solution of set covering problems using dual heuristics. West Lafayette, Ind: Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

El-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Taylor, J. A. The British Computer Society industry structure model: A set of performance standards covering all aspects of work carried out by professionals in the information technology industry. London: BCS, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Instytut Matematyczny (Polska Akademia Nauk), ed. Measure-additive coverings and measurable selectors. Warszawa: Państwowe Wydawn. Naukowe, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Taylor, J. A. The British Computer Society industry structure model: An extract. A set of performance standards covering all functional areas of work carried out by professionals both in and allied to the field of information systems engineering. 2nd ed. London: BCS, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fat man in a middle seat: Forty years of covering politics. New York: Random House, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ballgame!: A decade covering the Texas Rangers from the best seat in the house. Chicago, Ill: Triumph Books, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

service), SpringerLink (Online, ed. Understanding High-Dimensional Spaces. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Said, Edward W. Covering Islam: How the media and the experts determine how we see the rest of the world. New York: Vintage Books, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Set covering"

1

Puppe, Frank. "Set-Covering Classification." In Systematic Introduction to Expert Systems, 156–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-77971-8_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mitchell, William J. "The Covering Lemma." In Handbook of Set Theory, 1497–594. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-1-4020-5764-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schindler, Ralf. "$$0^{\#}$$ 0 # and Jensen’s Covering Lemma." In Set Theory, 235–78. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06725-4_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schmid, Florian, Ludwig Lausser, and Hans A. Kestler. "Three Transductive Set Covering Machines." In Studies in Classification, Data Analysis, and Knowledge Organization, 303–11. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01595-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mitchell, W. J. "A Hollow Shell: Covering Lemmas without a Core." In Set Theory, 183–98. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-015-8988-8_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Miller, Arnold W. "Covering number of an ideal." In Descriptive Set Theory and Forcing, 64–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-21773-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Lijuan, Xibei Yang, and Chen Wu. "Multi-covering Based Rough Set Model." In Lecture Notes in Computer Science, 236–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41218-9_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Germain, Pascal, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette, and Claude-Guy Quimper. "A Pseudo-Boolean Set Covering Machine." In Lecture Notes in Computer Science, 916–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33558-7_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dingjun, Chen, Li Han, Li Li, and Wu Kaiteng. "Variable Precision Induced Covering Rough Set." In Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009), 823–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-11276-8_109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dingjun, Chen, Li Li, and Wu Kaiteng. "Degree Induced Covering Rough Set Model." In Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009), 829–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-11276-8_110.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Set covering"

1

Alizadeh, R., and T. Nishi. "Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem." In 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2019. http://dx.doi.org/10.1109/ieem44572.2019.8978601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jin, Qiu, Lingqiang Li, and Shoubin Sun. "On covering generalized rough set: Covering rough membership function." In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE, 2012. http://dx.doi.org/10.1109/fskd.2012.6233953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grandoni, Fabrizio, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, and Mohit Singh. "Set Covering with our Eyes Closed." In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 2008. http://dx.doi.org/10.1109/focs.2008.31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bashiri, Mahdi, and Fateme Fotuhi. "A cost-based set-covering location-allocation problem with unknown covering radius." In 2009 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2009. http://dx.doi.org/10.1109/ieem.2009.5372949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sen, Sandip. "Minimal cost set covering using probabilistic methods." In the 1993 ACM/SIGAPP symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/162754.162852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, William, and Fei-Yue Wang. "A New Type of Covering Rough Set." In 2006 3rd International IEEE Conference Intelligent Systems. IEEE, 2006. http://dx.doi.org/10.1109/is.2006.348460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hu, Jun, Guoyin Wang, and Qinghua Zhang. "Uncertainty Measure of Covering Generated Rough Set." In 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops. IEEE, 2006. http://dx.doi.org/10.1109/wi-iatw.2006.139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dingjun Chen, Liu Yi, Kaiteng Wu, and Keyun Qin. "New operators in covering rough set theory." In 2008 3rd International Conference on Intelligent System and Knowledge Engineering (ISKE 2008). IEEE, 2008. http://dx.doi.org/10.1109/iske.2008.4731060.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Changzhong, and Wenju Du. "On Covering Rough Set Based Attribute Reduction." In 2010 Second Global Congress on Intelligent Systems (GCIS). IEEE, 2010. http://dx.doi.org/10.1109/gcis.2010.133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ye, Ping, and Jiyi Wang. "A new covering rough fuzzy set model." In 2011 IEEE International Conference on Granular Computing (GrC-2011). IEEE, 2011. http://dx.doi.org/10.1109/grc.2011.6122695.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Set covering"

1

Awoniyi, Samuel, and Lester Frair. A Generalized Set-Covering Method for Surveillance Maintenance. Fort Belvoir, VA: Defense Technical Information Center, March 1991. http://dx.doi.org/10.21236/ada236855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Balas, Egon, and Maria C. Carrera. A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,. Fort Belvoir, VA: Defense Technical Information Center, May 1992. http://dx.doi.org/10.21236/ada257416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Balas, Egon, and Shu M. Ng. On the Set Covering Polytope. 2. Lifting the Facets with Coefficients in (0,1,2). Revision. Fort Belvoir, VA: Defense Technical Information Center, March 1988. http://dx.doi.org/10.21236/ada196237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Roantree, Barra, Bertrand Maître, Alyvia McTague, and Ivan Privalko. Poverty, income inequality and living standards in Ireland. ESRI and The Community Foundation for Ireland, May 2021. http://dx.doi.org/10.26504/bkmnext412.

Full text
Abstract:
This report – funded by the Community Foundation for Ireland – brings together data from household surveys collected by the ESRI and the Central Statistics Office to create the first harmonised set of indicators on incomes, income inequality and poverty covering the period 1987 to 2019. These will be published on the ESRI website and can be used by policymakers, academics, journalists and the wider public to inform discussions around income inequality, poverty and deprivation.
APA, Harvard, Vancouver, ISO, and other styles
5

Desai, Jairaj, Jijo K. Mathew, Howell Li, Rahul Sakhare, Deborah Horton, and Darcy M. Bullock. National Mobility Analysis for All Interstate Routes in the United States. Purdue University, 2023. http://dx.doi.org/10.5703/1288284317585.

Full text
Abstract:
In November 2022, Wejo Data Services Inc. provided Purdue with a national data set comprised of approximately 470 billion connected vehicle records covering all 50 states for the month of August 2022. The goal of the evaluation data set was to create a series of summary graphics to evaluate the scalability of work zone analytics graphics and electric/hybrid vehicle counts at a national level. This report illustrates several performance measures developed using this dataset for all interstate routes, both state wise and cross-country. State wise graphics are organized with 50 subdirectories containing graphics for each interstate in the 50 states. There are also a series of multi-state graphics for I-5, I-10, I-15, I-35, I-55, I-65, I-75, I-80, I-90, and I-95. Performance measures include absolute and normalized trip counts classified by type of trip (electric vehicle or hybrid vehicle or internal combustion engine vehicle), weekly heatmaps based on vehicle speed overlaid with hard-braking events and finally, speed profiles by interstate mile markers. Additional details on the directories and how to interpret these performance measures can found inside the document (after extracting the .zip file) titled “National_Mobility_Analysis_README.pdf”.
APA, Harvard, Vancouver, ISO, and other styles
6

Desai, Jairaj, Jijo K. Mathew, Howell Li, Rahul Suryakant Sakhare, Deborah Horton, and Darcy M. Bullock. National Mobility Report for All Interstates–December 2022. Purdue University, 2023. http://dx.doi.org/10.5703/1288284317591.

Full text
Abstract:
In January 2023, Wejo Data Services Inc. provided Purdue with a national data set comprised of approximately 503 billion connected vehicle records covering all 50 states for the month of December 2022. The goal of the evaluation data set was to create a series of summary graphics to evaluate the scalability of work zone/winter weather analytics graphics and electric/hybrid vehicle counts at a national level as well as visualize the mobility impacts of winter weather activity on the national interstate network. This report illustrates several performance measures developed using this dataset for all interstate routes, both state wise and cross-country. Statewide graphics are presented for each interstate in the 50 states. There are also a series of multi-state graphics for I-5, I-10, I-15, I-35, I-55, I-65, I-75, I-80, I-90, and I-95 and selected other routes that witnessed winter storm impacts. Performance measures include absolute and normalized trip counts classified by type of trip (electric vehicle or hybrid vehicle or internal combustion engine vehicle), weekly heatmaps based on vehicle speed (for the two-week period from December 12-25, 2022) and finally, speed profiles by interstate mile markers. Traffic tickers depicting miles of congestion as well as mile-hours of congestion for the national interstate network and selected multi-state routes are also included to provide a unified visual of nationwide mobility impact of recurring congestion as well as non-recurring congestion caused by winter weather. The generated performance measures can be found in the supplemental files.
APA, Harvard, Vancouver, ISO, and other styles
7

Werle, D. Radar remote sensing for application in forestry: a literature review for investigators and potential users of SAR data in Canada. Natural Resources Canada/CMSS/Information Management, 1989. http://dx.doi.org/10.4095/329188.

Full text
Abstract:
Information provided in this document allows potential users of synthetic aperture radar (SAR) imagery as well as investigators participating in the Canadian Radar Data Development Program (RDDP) to obtain an overview of achievements, limitations and future potential of radar remote sensing for application in forestry, as portrayed in the published literature. Investigations concerned with radar remote sensing and its potential for application in forestry are reviewed. The main focus of these studies was the determination of microwave backscatter characteristics of forestry targets using different radar parameters, such as frequency, polarizations and incidence angle. Examples of selected targets include the following: coniferous and deciduous tree species, stands of different structure, age, tree height, clearcuts, or forestry environments in general as they change with the seasons. More than 75 studies based on airborne imaging radar, spaceborne radar as well as scatterometer data have been considered. Previous reviews which summarize information available in western Europe and North America are briefly introduced. Then, recent investigations covering the time period from the early 1980's onward are portrayed and discussed. The main results are summarized in a set of conclusions, followed by list of selected references and a list of Canadian institutions and organizations currently involved in radar remote sensing R&D for application in forestry.
APA, Harvard, Vancouver, ISO, and other styles
8

Jokinen, Pauli, Pentti Pirinen, Juho-Pekka Kaukoranta, Antti Kangas, Pekka Alenius, Patrick Eriksson, Milla Johansson, and Sofia Wilkman. Climatological and oceanographic statistics of Finland 1991–2020. Finnish Meteorological Institute, October 2021. http://dx.doi.org/10.35614/isbn.9789523361485.

Full text
Abstract:
This report consists of climate statistics for air pressure, temperature, relative humidity, precipitation, snow depth, wind, sunshine and global radiation for the normal period covering the years 1991–2020. In addition for the first time oceanographic statistics for sea water level, sea water temperature and sea ice are included. Based on the station and gridded data the new 1991–2020 normal period is approximately 0.6 °C warmer in Finland compared to the previous 1981–2010 period. The new normal period is approximately 1.3 °C warmer when compared to the 1961–1990 period. Climate and oceanographic statistics can be used for example when anomalies for current conditions need to be calculated and put in a historical context. In addition they help in decision-making when it is needed to approximate conditions months into the future. And lastly normal periods provide a way to monitor the progression of climate change. The calculation of the normal period statistics have been carried out following the World Meteorological Organization (WMO) guidelines. Like with previous normal periods, some stricter guidelines were followed nationally, for example in the way missing observations were handled. The period 1991–2020 is both nationally and internationally the official normal period before the next one covering 2001–2030 is taken into use.
APA, Harvard, Vancouver, ISO, and other styles
9

Nilsson Lewis, Astrid, Kaidi Kaaret, Eileen Torres Morales, Evelin Piirsalu, and Katarina Axelsson. Accelerating green public procurement for decarbonization of the construction and road transport sectors in the EU. Stockholm Environment Institute, February 2023. http://dx.doi.org/10.51414/sei2023.007.

Full text
Abstract:
Public procurement of goods and services contributes to about 15% of global greenhouse gas emissions. In the EU, public purchasing represents 15% of its GDP, acting as a major influencer on the market through the products and services acquired by governments from the local to national levels. The public sector has a role to play in leveraging this purchasing power to achieve the best societal value for money, particularly as we scramble to bend the curve of our planet’s warming. Globally, the construction and transport sectors each represent about 12% of government procurements’ GHG emissions. Furthermore, these sectors’ decarbonization efforts demand profound and disruptive technological shifts. Hence, prioritizing these sectors can make the greatest impact towards reducing the environmental footprint of the public sector and support faster decarbonization of key emitting industries. Meanwhile, the EU committed to achieving 55% reduction in GHG emissions by 2030 compared to 1990 levels. Drastic emissions reductions are needed at an unprecedented speed and scale to achieve this goal. Green Public Procurement (GPP) is the practice of purchasing goods and services using environmental requirements, with the aim of cutting carbon emissions and mitigating environmental harm throughout the life cycle of the product or service. While the EU and many of its Member States alike have recognized GPP as an important tool to meet climate goals, the formalization of GPP requirements at the EU level or among local and national governments has been fragmented. We call for harmonization to achieve the consistency, scale and focus required to make GPP practices a powerful decarbonization tool. We surveyed the landscape of GPP in the EU, with a focus on construction and road transport. Through interviews and policy research, we compiled case studies of eight Member States with different profiles: Sweden, the Netherlands, France, Germany, Estonia, Poland, Spain and Italy. We used this information to identify solutions and best practices, and to set forth recommendations on how the EU and its countries can harmonize and strengthen their GPP policies on the path toward cutting their contributions to climate change. What we found was a scattered approach to GPP across the board, with few binding requirements, little oversight and scant connective tissue from national to local practices or across different Member States, making it difficult to evaluate progress or compare practices. Interviewees, including policy makers, procurement experts and procurement officers from the featured Member States, highlighted the lack of time or resources to adopt progressive GPP practices, with no real incentive to pursue it. Furthermore, we found a need for more awareness and clear guidance on how to leverage GPP for impactful societal outcomes. Doing so requires better harmonized processes, data, and ways to track the impact and progress achieved. That is not to say it is entirely neglected. Most Member States studied highlight GPP in various national plans and have set targets accordingly. Countries, regions, and cities such as the Netherlands, Catalonia and Berlin serve as beacons of GPP with robust goals and higher ambition. They lead the way in showing how GPP can help mitigate climate change. For example, the Netherlands is one of the few countries that monitors the effects of GPP, and showed that public procurement for eight product groups in 2015 and 2016 led to at least 4.9 metric tons of avoided GHG emissions. Similarly, a monitoring report from 2017 showed that the State of Berlin managed to cut its GHG emissions by 47% through GPP in 15 product groups. Spain’s Catalonia region set a goal of 50% of procurements using GPP by 2025, an all-electric in public vehicle fleet and 100% renewable energy powering public buildings by 2030. Drawing from these findings, we developed recommendations on how to bolster GPP and scale it to its full potential. In governance, policies, monitoring, implementation and uptake, some common themes exist. The need for: • Better-coordinated policies • Common metrics for measuring progress and evaluating tenders • Increased resources such as time, funding and support mechanisms • Greater collaboration and knowledge exchange among procurers and businesses • Clearer incentives, binding requirements and enforcement mechanisms, covering operational and embedded emissions With a concerted and unified movement toward GPP, the EU and its Member States can send strong market signals to the companies that depend on them for business, accelerating the decarbonization process that our planet requires.
APA, Harvard, Vancouver, ISO, and other styles
10

Kramer, K. Status Quo of PVT Characterization. Edited by Korbinian Kramer,. IEA SHC Task 60, September 2020. http://dx.doi.org/10.18777/ieashc-task60-2020-0004.

Full text
Abstract:
Report B1: This report therefore aims at displaying the Status Quo of PVT Characterization in order to support PVT technology in its further development and applications. The report is hence of interest for researchers as well as public and private sector stakeholders. A key finding is that the reliability and durability of PVT modules are especially challenged at elevated temperatures and higher humidity loads. The test methods available from the IEC and ISO standards are covering the specifics of PV and ST module’s, most of which are similar for PVT modules, too.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Set covering' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography