Gotowe bibliografie tematyczne / Matching

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Matching”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Matching”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Matching"

1

CHENG, EDDIE, and SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES." Parallel Processing Letters 22, no. 02 (2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In thi
Style APA, Harvard, Vancouver, ISO itp.
2

MAO, YAPING, and EDDIE CHENG. "A Concise Survey of Matching Preclusion in Interconnection Networks." Journal of Interconnection Networks 19, no. 03 (2019): 1940006. http://dx.doi.org/10.1142/s0219265919400061.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.
Style APA, Harvard, Vancouver, ISO itp.
3

Chen, Ciping. "Matchings and matching extensions in graphs." Discrete Mathematics 186, no. 1-3 (1998): 95–103. http://dx.doi.org/10.1016/s0012-365x(97)00182-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

LÜ, HUAZHONG, and TINGZENG WU. "Fractional Matching Preclusion for Restricted Hypercube-Like Graphs." Journal of Interconnection Networks 19, no. 03 (2019): 1940010. http://dx.doi.org/10.1142/s0219265919400103.

Pełny tekst źródła
Streszczenie:
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion number of restricted hypercube-like graphs, whic
Style APA, Harvard, Vancouver, ISO itp.
5

Echenique, Federico, SangMok Lee, Matthew Shum, and M. Bumin Yenmez. "Stability and Median Rationalizability for Aggregate Matchings." Games 12, no. 2 (2021): 33. http://dx.doi.org/10.3390/g12020033.

Pełny tekst źródła
Streszczenie:
We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching data in revealed preference theory. We present a result on rationalizing a matching data as the median stable matching.
Style APA, Harvard, Vancouver, ISO itp.
6

Cannas, Massimo, and Emiliano Sironi. "Optimal Matching with Matching Priority." Analytics 3, no. 1 (2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.

Pełny tekst źródła
Streszczenie:
Matching algorithms are commonly used to build comparable subsets (matchings) in observational studies. When a complete matching is not possible, some units must necessarily be excluded from the final matching. This may bias the final estimates comparing the two populations, and thus it is important to reduce the number of drops to avoid unsatisfactory results. Greedy matching algorithms may not reach the maximum matching size, thus dropping more units than necessary. Optimal matching algorithms do ensure a maximum matching size, but they implicitly assume that all units have the same matching
Style APA, Harvard, Vancouver, ISO itp.
7

Wang, Xia, Tianlong Ma, Jun Yin, and Chengfu Ye. "Fractional matching preclusion for radix triangular mesh." Discrete Mathematics, Algorithms and Applications 11, no. 04 (2019): 1950048. http://dx.doi.org/10.1142/s1793830919500484.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong matching preclusion number (FSMP number) of [Formula: see text], denoted by
Style APA, Harvard, Vancouver, ISO itp.
8

Anantapantula, Sai, Christopher Melekian, and Eddie Cheng. "Matching Preclusion for the Shuffle-Cubes." Parallel Processing Letters 28, no. 03 (2018): 1850012. http://dx.doi.org/10.1142/s0129626418500123.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
Style APA, Harvard, Vancouver, ISO itp.
9

CHENG, EDDIE, RANDY JIA, and DAVID LU. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES." Journal of Interconnection Networks 11, no. 01n02 (2010): 35–60. http://dx.doi.org/10.1142/s0219265910002726.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In t
Style APA, Harvard, Vancouver, ISO itp.
10

Ma, Tianlong, Yaping Mao, Eddie Cheng, and Jinling Wang. "Fractional Matching Preclusion for (n, k)-Star Graphs." Parallel Processing Letters 28, no. 04 (2018): 1850017. http://dx.doi.org/10.1142/s0129626418500172.

Pełny tekst źródła
Streszczenie:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Matching"

1

Ranger, Martin. "Matching issues." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2690.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005.<br>Thesis research directed by: Economics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Style APA, Harvard, Vancouver, ISO itp.
2

Prakash, Piyush Martin Alain J. "Slack matching /." Diss., Pasadena, Calif. : California Institute of Technology, 2005. http://resolver.caltech.edu/CaltechETD:etd-05272005-134017.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Jin, Wei. "GRAPH PATTERN MATCHING, APPROXIMATE MATCHING AND DYNAMIC GRAPH INDEXING." Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1307547974.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Tam, Siu-lung. "Linear-size indexes for approximate pattern matching and dictionary matching." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B44205326.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Tam, Siu-lung, and 譚小龍. "Linear-size indexes for approximate pattern matching and dictionary matching." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44205326.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Ko, E. Soon. "Product Matching through Multimodal Image and Text Combined Similarity Matching." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301306.

Pełny tekst źródła
Streszczenie:
Product matching in e-commerce is an area that faces more and more challenges with growth in the e-commerce marketplace as well as variation in the quality of data available online for each product. Product matching for e-commerce provides competitive possibilities for vendors and flexibility for customers by identifying identical products from different sources. Traditional methods in product matching are often conducted through rule-based methods and methods tackling the issue through machine learning usually do so through unimodal systems. Moreover, existing methods would tackle the issue t
Style APA, Harvard, Vancouver, ISO itp.
7

Karichery, Sureshan. "Sequential matching problem." [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=971627754.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Michalis, Konstantinos. "Background matching camouflage." Thesis, University of Bristol, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723478.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Neou, Both Emerite. "Permutation pattern matching." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1239/document.

Pełny tekst źródła
Streszczenie:
Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En parti
Style APA, Harvard, Vancouver, ISO itp.
10

Modi, Amit. "Matching Based Diversity." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306866934.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Matching"

1

Istar, Schwager, Siede George, and Preis Donna, eds. Matching. Evans Bros., 1994.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Siede, George. Matching. Publications International, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

(Firm), Clever Factory, and Cuddly Duck Productions, eds. Turn & learn matching. Clever Factory, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lovász, László. Matching theory. Akadémiai Kiadó, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lovász, L. Matching theory. North-Holland, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Vosselman, G. Relational matching. Springer-Verlag, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Mortensen, Dale. Island matching. National Bureau of Economic Research, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

D'Orazio, Marcello, Marco Di Zio, and Mauro Scanu. Statistical Matching. John Wiley & Sons, Ltd, 2006. http://dx.doi.org/10.1002/0470023554.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Rässler, Susanne. Statistical Matching. Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0053-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Vosselman, G., ed. Relational Matching. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55798-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Matching"

1

Kleinbaum, David G., Kevin M. Sullivan, and Nancy D. Barker. "Matching." In ActivEpi Companion Textbook. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-5428-1_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Gerth, Christian. "Matching." In Business Process Models. Change Management. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38604-6_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Kozen, Dexter C. "Matching." In The Design and Analysis of Algorithms. Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

French, Michael J. "Matching." In Conceptual Design for Engineers. Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-3627-9_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Eglese, Richard W. "Matching." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_589.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Allen, Peter K. "Matching." In The Kluwer International Series in Engineering and Computer Science. Springer US, 1987. http://dx.doi.org/10.1007/978-1-4613-2005-0_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Davison, Michael. "Matching." In Encyclopedia of the Sciences of Learning. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4419-1428-6_484.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Hochstättler, Winfried, and Alexander Schliep. "Matching." In CATBox. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03822-8_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Nemhauser, George, and Laurence Wolsey. "Matching." In Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118627372.ch15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Weik, Martin H. "matching." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11157.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Matching"

1

Huo, Jiayu, Ruiqiang Xiao, Haotian Zheng, Yang Liu, Sébastien Ourselin, and Rachel Sparks. "MatchSeg: Towards Better Segmentation via Reference Image Matching." In 2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2024. https://doi.org/10.1109/bibm62325.2024.10822622.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Rafa Islam, Khandoker N., Xin Zan, and David J. Perreault. "Controllable Transformation Matching Networks for Efficient RF Impedance Matching." In 2024 IEEE Workshop on Control and Modeling for Power Electronics (COMPEL). IEEE, 2024. http://dx.doi.org/10.1109/compel57542.2024.10613972.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Bacso, Gabor, Anita Keszler, and Zsolt Tuza. "Matching Matchings." In 2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems (ECBS-EERC). IEEE, 2013. http://dx.doi.org/10.1109/ecbs-eerc.2013.19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Jandaghi, Pegah, and Jay Pujara. "Identifying Quantifiably Verifiable Statements from Text." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Baek, Jinheon, Alham Aji, and Amir Saffari. "Knowledge-Augmented Language Model Prompting for Zero-Shot Knowledge Graph Question Answering." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Schumacher, Elliot, James Mayfield, and Mark Dredze. "On the Surprising Effectiveness of Name Matching Alone in Autoregressive Entity Linking." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ramanan, Karthik. "Corpus-Based Task-Specific Relation Discovery." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Yuan, Jiaqing, Michele Merler, Mihir Choudhury, Raju Pavuluri, Munindar Singh, and Maja Vukovic. "CoSiNES: Contrastive Siamese Network for Entity Standardization." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Wold, Sondre, Lilja Øvrelid, and Erik Velldal. "Text-To-KG Alignment: Comparing Current Methods on Classification Tasks." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Chen, Lihu, Simon Razniewski, and Gerhard Weikum. "Knowledge Base Completion for Long-Tail Entities." In Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Matching"

1

Mortensen, Dale. Island Matching. National Bureau of Economic Research, 2007. http://dx.doi.org/10.3386/w13287.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Margolius, Barbara. Derivative Matching Game. The MAA Mathematical Sciences Digital Library, 2008. http://dx.doi.org/10.4169/loci002651.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dauth, Wolfgang, Sebastian Findeisen, Enrico Moretti, and Jens Suedekum. Matching in Cities. National Bureau of Economic Research, 2018. http://dx.doi.org/10.3386/w25227.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Schwarz, Michael, and M. Bumin Yenmez. Median Stable Matching. National Bureau of Economic Research, 2009. http://dx.doi.org/10.3386/w14689.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lange, Fabian, and Theodore Papageorgiou. Beyond Cobb-Douglas: Flexibly Estimating Matching Functions with Unobserved Matching Efficiency. National Bureau of Economic Research, 2020. http://dx.doi.org/10.3386/w26972.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Duffie, Darrell, Lei Qiao, and Yeneng Sun. Dynamic Directed Random Matching. National Bureau of Economic Research, 2015. http://dx.doi.org/10.3386/w21731.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Diamond, Peter, and Ayşegül Şahin. Disaggregating the Matching Function. National Bureau of Economic Research, 2016. http://dx.doi.org/10.3386/w22965.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Marriner, John, and /Fermilab. Phase Space Matching Errors. Office of Scientific and Technical Information (OSTI), 1994. http://dx.doi.org/10.2172/984595.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Phillips, A., and M. Davis. Matching of Language Tags. RFC Editor, 2006. http://dx.doi.org/10.17487/rfc4647.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Tsoukalas, L. DOE Matching Grant Program. Office of Scientific and Technical Information (OSTI), 2002. http://dx.doi.org/10.2172/836053.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Matching” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii