Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Degree sum“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Degree sum" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Degree sum"
Boregowda, H. S., und R. B. Jummannaver. „Neighbors degree sum energy of graphs“. Journal of Applied Mathematics and Computing 67, Nr. 1-2 (20.01.2021): 579–603. http://dx.doi.org/10.1007/s12190-020-01480-y.
Der volle Inhalt der QuelleLiu, Ze-meng, und Li-ming Xiong. „Degree sum conditions for hamiltonian index“. Applied Mathematics-A Journal of Chinese Universities 36, Nr. 3 (September 2021): 403–11. http://dx.doi.org/10.1007/s11766-021-3885-4.
Der volle Inhalt der QuelleMacHale, Desmond. „Degree Sum Deficiency in Finite Groups“. Mathematical Proceedings of the Royal Irish Academy 115A, Nr. 1 (2015): 1–11. http://dx.doi.org/10.1353/mpr.2015.0007.
Der volle Inhalt der QuelleFlandrin, E., H. A. Jung und H. Li. „Hamiltonism, degree sum and neighborhood intersections“. Discrete Mathematics 90, Nr. 1 (Juni 1991): 41–52. http://dx.doi.org/10.1016/0012-365x(91)90094-i.
Der volle Inhalt der QuelleStephen Buckley, Desmond MacHale und Áine Ní Shé. „Degree Sum Deficiency in Finite Groups“. Mathematical Proceedings of the Royal Irish Academy 115A, Nr. 1 (2015): 1. http://dx.doi.org/10.3318/pria.2015.115.6.
Der volle Inhalt der QuelleMohammed, K. Saleel, und Raji Pilakkat. „Minimum inclusive degree sum dominating set“. Malaya Journal of Matematik 8, Nr. 4 (2020): 1885–89. http://dx.doi.org/10.26637/mjm0804/0091.
Der volle Inhalt der QuelleFaudree, Jill, Ralph J. Faudree, Ronald J. Gould, Paul Horn und Michael S. Jacobson. „Degree sum and vertex dominating paths“. Journal of Graph Theory 89, Nr. 3 (20.04.2018): 250–65. http://dx.doi.org/10.1002/jgt.22249.
Der volle Inhalt der QuelleHu, Zhi-quan, und Feng Tian. „On k-ordered Graphs Involved Degree Sum“. Acta Mathematicae Applicatae Sinica, English Series 19, Nr. 1 (März 2003): 97–106. http://dx.doi.org/10.1007/s10255-003-0085-3.
Der volle Inhalt der QuelleFerrara, Michael, Michael Jacobson und Jeffrey Powell. „Characterizing degree-sum maximal nonhamiltonian bipartite graphs“. Discrete Mathematics 312, Nr. 2 (Januar 2012): 459–61. http://dx.doi.org/10.1016/j.disc.2011.08.029.
Der volle Inhalt der QuelleLiu, Jianping, Aimei Yu, Keke Wang und Hong-Jian Lai. „Degree sum and hamiltonian-connected line graphs“. Discrete Mathematics 341, Nr. 5 (Mai 2018): 1363–79. http://dx.doi.org/10.1016/j.disc.2018.02.008.
Der volle Inhalt der QuelleDissertationen zum Thema "Degree sum"
Steelman, Andrea Elizabeth. „Degree sum ensuring hamiltonicity“. [Pensacola, Fla.] : University of West Florida, 2007. http://purl.fcla.edu/fcla/etd/WFE0000012.
Der volle Inhalt der QuelleDai, Tianjiao. „Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs“. Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG067.
Der volle Inhalt der QuelleThe decomposition of graphs refers to the process of breaking down a complex graph into simpler, smaller components, often with the goal of analysing or solving problems related to the graph. It is an important tool to display the global structure and properties in a more fine-grained manner, and also useful in solving problems that involve finding specific structures in a graph. There are several common types of graph decomposition techniques that are widely used in graph theory and related fields, including tree decomposition, block decomposition, modular decomposition, hierarchical decomposition, etc. This thesis studies two kinds of vertex decomposition of a graph: proper colourings (decomposition into independent sets) and Hamilton-connectivity (decomposition into internally-disjoint paths between two sets where the paths cover all the vertices of graphs)
Oinas, J. (Janne). „The degree theory and the index of a critical point for mappings of the type (S+)“. Doctoral thesis, University of Oulu, 2007. http://urn.fi/urn:isbn:9789514284878.
Der volle Inhalt der QuelleTorres-Olave, Blanca Minerva. „STEM Employment in the New Economy: A Labor Market Segmentation Approach“. Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/305866.
Der volle Inhalt der QuelleChan, Si-man, und 陳詩敏. „A case study of a sub-degree programme's development potential“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/198872.
Der volle Inhalt der Quellepublished_or_final_version
Education
Master
Master of Education
Tibhirt, Amel. „Mitigation of Cross-link Interference for MIMO TDD Dynamic Systems in 5G+ Networks“. Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS017.pdf.
Der volle Inhalt der QuelleDynamic Time Division Duplexing (DynTDD) is pivotal in 5th generation (5G) networks, adapting resources to diverse needs. It enhances Spectral Efficiency (SE) by dynamically allocating time slots for Uplink (UL) and Downlink (DL) transmissions based on traffic demand and channel conditions. This dynamic frequency allocation ensures efficient spectrum use and supports massive connectivity, low latency, and Quality-of-Service (QoS) requirements. Its role in carrier aggregation maximizes data rates and capacity, highlighting its importance in advanced wireless communication technologies.However, DynTDD faces a significant challenge: cross-link interference (CLI). CLI occurs when UL and DL transmissions share the same frequency bands, leading to interference.CLI comprises base station to base station (BS-to-BS) or downlink to uplink (DL-to-UL) interference and user equipment to user equipment (UE-to-UE) or uplink to downlink (UL-to-DL) interference. In DL-to-UL interference, DL transmissions spill into UL bands, degrading UL communication. Conversely, UL-to-DL interference occurs when UL transmissions interfere with DL reception.Effectively managing CLI is crucial for DynTDD's performance and reliability.This thesis aims to unleash the full potential of DynTDD by overcoming CLI challenges through rigorous analysis and innovative methodologies. The research not only advances DynTDD technology but also pioneers solutions applicable to various communication contexts, driving innovative interference alignment strategies across diverse scenarios.The study in this thesis is divided into multiple segments. The first part establishes the foundation with the problem definition and essential theoretical concepts. The second part delves into the conditions determining the feasibility of interference alignment. These conditions are expressed in terms of the problem dimension and establish the achievable Degree of Freedom (DoF), representing the number of data streams. It explores interference alignment in centralized scenarios, considering both full-rank and reduced-rank Multiple-Input Multiple-Output (MIMO) Interference Broadcast Multiple Access Channel-Interference Channel (IBMAC-IC), addressing real-world complexities. Additionally, it extends the exploration to a distributed scenario, providing a realistic understanding of communication complexities. The third part focuses on optimization techniques, specifically beamforming. It introduces Zero Forcing (ZF) beamforming for both DL and UL User Equipment (UE)s to align CLI in DynTDD systems. It emphasizes the impact of UE-to-UE interference and presents improvements brought by the Weighted Minimum Mean Square Error (WMMSE) algorithms. Furthermore, it explores power allocation optimization using the water-filling algorithm
Sharma, Ajit. „CMOS systems and circuits for sub-degree per hour MEMS gyroscopes“. Diss., Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/26636.
Der volle Inhalt der QuelleCommittee Chair: Farrokh Ayazi; Committee Member: Jennifer Michaels; Committee Member: Levent Degertekin; Committee Member: Paul Hasler; Committee Member: W. Marshall Leach. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Reys-Nickel, Lynsey. „Predictors of Associate's Degree Completion in Engineering and Engineering Technologies“. Scholar Commons, 2016. http://scholarcommons.usf.edu/etd/6574.
Der volle Inhalt der QuelleSun, Zeliang, und Peng Shao. „Assessing the degree of customer satisfaction in grocery stores - a study on ICA“. Thesis, Högskolan i Gävle, Avdelningen för ekonomi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-13156.
Der volle Inhalt der QuelleArroyave-Tobón, Santiago. „Polyhedral models reduction in geometric tolerance analysis“. Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0720/document.
Der volle Inhalt der QuelleThe cumulative stack-up of geometric variations in mechanical systems can be modelled summing and intersecting sets of constraints. These constraints derive from tolerance zones or from contact restrictions between parts. The degrees of freedom (DOF) of jointsgenerate unbounded sets (i.e. polyhedra) which are difficult to deal with. L. Homri presented in 2014 a solution based on the setting of fictitious limits (called cap constraints) to each DOFto obtain bounded 6D sets (i.e. polytopes). These additional constraints, however, increase the complexity of the models, and therefore, of the computations. In response to this situation,we defined a derived strategy to control the effects of the propagation of the fictitious limits by tracing and simplifying the generated, new cap constraints. We proposed a second strategy based on the decomposition of polyhedra into the sum of a polytope and a set of straight lines.The strategy consists in isolating the straight lines (associated to the DOF) and summing the polytopes in the smallest sub-space. After solving an industrial case, we concluded that tracing caps constraints during the operations allows reducing the models complexity and,consequently, the computational time; however, it still involves working in 6d even in caseswhere this is not necessary. In contrast, the strategy based on the operands decompositionis more efficient due to the dimension reduction. This study allowed us to conclude that the management of mechanisms’ mobility is a crucial aspect in tolerance simulations. The gain on efficiency resulting from the developed strategies opens up the possibility for doing statistical treatment of tolerances and tolerance synthesis
Bücher zum Thema "Degree sum"
Walter, Brunner. Die Promotio sub auspiciis. 2. Aufl. Wien: Bundesministerium für Wissenschaft und Forschung, 1990.
Den vollen Inhalt der Quelle findenWalter, Brunner. Die Promotio sub auspiciis. Wien: Bundesministerium für Wissenschaft und Forschung, 1988.
Den vollen Inhalt der Quelle findenIlorin, University of. Academic programmes: Undergraduate & sub-degree, 2003-2006. Ilorin, Nigeria]: Senate Committee on Review of Academic Programme, 2003.
Den vollen Inhalt der Quelle findenOkidi, John. The degree of socially sub-optimal individual behavior in collective resource management. Kampala, Uganda: Economic Policy Research Center, 1999.
Den vollen Inhalt der Quelle findenTwo or three degrees off plumb: Sam Venable's unique look at life. Knoxville, Tenn: Knoxville News-Sentinel Co., 1988.
Den vollen Inhalt der Quelle findenPetersen, A. Willi. ICT practitioner skills and training: Solutions at sub-degree and vocational level in Europe : guidelines for ICT training and curriculum development. Luxembourg: Office for Official Publications of the European Communities, 2004.
Den vollen Inhalt der Quelle findenSunder, S. XPS, XRD and SEM study of oxidation of UO2 by air in gamma radiation at 150 [degrees] C. Pinawa, Man: Whiteshell Laboratories, 1995.
Den vollen Inhalt der Quelle findenTechnology), International Planning Conference on Establishing Sub-regional Centres for the Masters Degree in Insect Science in Africa (1991 Jomo Kenyatta University College of Agriculture and. Proceedings, International Planning Conference on Establishing Sub-regional Centres for the Masters Degree in Insect Science in Africa: Jomo Kenyatta University College of Agriculture and Technology, Juja Nairobi, 5-7 August 1991. Nairobi: ICIPE Science Press, 1991.
Den vollen Inhalt der Quelle findenMishenin, Sergey. Information and analytical work. ru: INFRA-M Academic Publishing LLC., 2019. http://dx.doi.org/10.12737/987953.
Der volle Inhalt der QuelleArnold, J. Douglas. Nintendo 64: Survival Guide Volume Two. Lahaina, Maui, HI: Sandwich Islands Publishing Company, 1998.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Degree sum"
Patel, Mitesh J., und G. V. Ghodasara. „Some Results on Degree Sum Energy of a Graph“. In Recent Advancements in Graph Theory, 353–59. Boca Raton : CRC Press, 2020. | Series: Mathematical engineering, manufacturing, and management sciences: CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-29.
Der volle Inhalt der Quelled'Orsi, Tommaso, Rajai Nasser, Gleb Novikov und David Steurer. „Higher degree sum-of-squares relaxations robust against oblivious outliers“. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3513–50. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch134.
Der volle Inhalt der QuelleChauhan, Ruchi, und P. N. Agrawal. „Degree of Approximation by Generalized Boolean Sum of $$\lambda $$-Bernstein Operators“. In Springer Proceedings in Mathematics & Statistics, 95–109. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1153-0_9.
Der volle Inhalt der QuelleMastrolilli, Monaldo. „High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts“. In Integer Programming and Combinatorial Optimization, 405–16. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59250-3_33.
Der volle Inhalt der QuelleEstrada, Francisco. „Climate Catastrophes as a Sum of Known Risks“. In Climate of the Middle, 33–42. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-85322-8_4.
Der volle Inhalt der QuelleBarak, Boaz, Zvika Brakerski, Ilan Komargodski und Pravesh K. Kothari. „Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)“. In Advances in Cryptology – EUROCRYPT 2018, 649–79. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-78375-8_21.
Der volle Inhalt der QuelleKünnemann, Marvin, und André Nusser. „Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union“. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3181–201. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2022. http://dx.doi.org/10.1137/1.9781611977073.124.
Der volle Inhalt der QuelleCorneliussen, Hilde G. „Gender Patterns, Equality Paradoxes, and Lessons for an Inclusive Digital Future“. In Reconstructions of Gender and Information Technology, 95–117. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-5187-1_6.
Der volle Inhalt der QuelleChareton, Christophe, Sébastien Bardin, François Bobot, Valentin Perrelle und Benoît Valiron. „An Automated Deductive Verification Framework for Circuit-building Quantum Programs“. In Programming Languages and Systems, 148–77. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_6.
Der volle Inhalt der QuellePillonetto, Gianluigi, Tianshi Chen, Alessandro Chiuso, Giuseppe De Nicolao und Lennart Ljung. „Bayesian Interpretation of Regularization“. In Regularized System Identification, 95–134. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95860-2_4.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Degree sum"
Mohanty, Sidhanth, Prasad Raghavendra und Jeff Xu. „Lifting sum-of-squares lower bounds: degree-2 to degree-4“. In STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3357713.3384319.
Der volle Inhalt der QuelleJang, Min, Jin Whan Kang und Sang-Hyo Kim. „Design of irregular LDPC codes with degree-set and degree-sum distributions“. In 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC 2012). IEEE, 2012. http://dx.doi.org/10.1109/pimrc.2012.6362668.
Der volle Inhalt der QuelleQiu, Baojian, Jihui Wang, Yan Liu und Zhenyu Xu. „Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Degree and Maximum Average Degree“. In 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC). IEEE, 2017. http://dx.doi.org/10.1109/cse-euc.2017.182.
Der volle Inhalt der QuelleBhattad, Kapil, Vishwambhar Rathi und Ruediger Urbanke. „Degree Optimization and Stability Condition for the Min-Sum Decoder“. In 2007 IEEE Information Theory Workshop. IEEE, 2007. http://dx.doi.org/10.1109/itw.2007.4313072.
Der volle Inhalt der QuelleWu, Ruizhen, Lin Wang, Tao Yuan und Hua Feng. „A sectional degree match approximate Min-sum decoding algorithm for LDPC“. In 2019 IEEE 2nd 5G World Forum (5GWF). IEEE, 2019. http://dx.doi.org/10.1109/5gwf.2019.8911623.
Der volle Inhalt der QuelleViola, Emanuele. „The Sum of d Small-Bias Generators Fools Polynomials of Degree d“. In 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.16.
Der volle Inhalt der QuelleHopkins, Samuel B., Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra und Tselil Schramm. „On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique“. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch76.
Der volle Inhalt der QuelleZhang, Shiyuan, Shan Lu, Jing Guo, Chen Xu und Licheng Liu. „Modified Gaussian Sum Mixed-Degree CKF for Relative Motion Estimation of Noncooperative Spacecraft“. In 2022 China Automation Congress (CAC). IEEE, 2022. http://dx.doi.org/10.1109/cac57257.2022.10055613.
Der volle Inhalt der QuelleIwazaki, Sho, und Koichi Ichige. „Sum and difference composite co-array: An extended array configuration toward higher degree of freedom“. In 2016 International Conference on Advances in Electrical, Electronic and Systems Engineering (ICAEES). IEEE, 2016. http://dx.doi.org/10.1109/icaees.2016.7888064.
Der volle Inhalt der QuelleRosa-Jiménez, Carlos, Nuria Nebot und Alberto E. García-Moreno. „An innovative cooperative model for Master Degree Project of Architecture. Overcoming the traditional system.“ In Third International Conference on Higher Education Advances. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/head17.2017.5590.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Degree sum"
Leemans, W. P., P. Volfbeyn und M. Zolotorev. Laser based sub-picosecond electron bunch characterization using 90{degree} Thomson scattering. Office of Scientific and Technical Information (OSTI), Mai 1997. http://dx.doi.org/10.2172/505356.
Der volle Inhalt der QuelleBurrell, Robert, und John Collision. GNSI Decision Brief: Creating Sun Tsu: Instituting a Master’s Degree in Irregular Warfare. Tampa, FL: Global and National Security Institute, März 2024. http://dx.doi.org/10.5038/nuws6742.
Der volle Inhalt der QuelleBirtcher, R. C., J. W. Jr Richardson und M. H. Mueller. Neutron diffraction study of radiation damage in U{sub 3}Si at 30{degrees}C and 350{degrees}C. Office of Scientific and Technical Information (OSTI), November 1994. http://dx.doi.org/10.2172/10104668.
Der volle Inhalt der QuellePescatore, C. Free energy of formation of U/sub 3/O/sub 7/ in the temperature range 25 to 400/degree/C. Office of Scientific and Technical Information (OSTI), Oktober 1988. http://dx.doi.org/10.2172/6506641.
Der volle Inhalt der QuelleSwanson, David. Tree investigations in the Noatak National Preserve, Alaska, 2011?2022: Old-growth and new forests. National Park Service, 2023. http://dx.doi.org/10.36967/2301700.
Der volle Inhalt der QuelleMcKee, Anna, und Ann Couch. Land use and dog park associations with Escherichia coli in the Chattahoochee River National Recreation Area watershed. National Park Service, 2024. http://dx.doi.org/10.36967/2302755.
Der volle Inhalt der QuelleLee, W. Y., D. P. Stinton und D. L. Joslin. Interaction of low-expansion NZP ceramics with Na{sub 2}SO{sub 4} at 1000{degrees}C. Office of Scientific and Technical Information (OSTI), Juni 1996. http://dx.doi.org/10.2172/450752.
Der volle Inhalt der QuelleSwenson, D., T. G. Nieh und J. H. Fournelle. The CaO-TiO{sub 2}-ZrO{sub 2} system at 1,200{degree}C and the solubilities of Hf and Gd in zirconolite. Office of Scientific and Technical Information (OSTI), Dezember 1995. http://dx.doi.org/10.2172/231352.
Der volle Inhalt der QuelleVedula, K. Degradation of Fe-25Cr, Fe-25Cr-20Ni and Fe-25Cr-6A1 alloys in H/sub 2//H/sub 2/O/H/sub 2/S environments at 700/degree/C. Office of Scientific and Technical Information (OSTI), März 1989. http://dx.doi.org/10.2172/6194380.
Der volle Inhalt der QuelleSeitz, J. C., J. G. Blencoe, D. B. Joyce und R. J. Bodnar. Volumetric properties of CO{sub 2}-CH{sub 4}-N{sub 2} fluids at 200{degree}C and 1000 bars: A comparison of equations of state and experimental data. Chapter 4. Office of Scientific and Technical Information (OSTI), Dezember 1994. http://dx.doi.org/10.2172/93671.
Der volle Inhalt der Quelle