Relevant bibliographies by topics / Degree sum

Academic literature on the topic 'Degree sum'

Author: Grafiati
Published: 25 May 2024

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

Select a source type:

Contents

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

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 "Degree sum"

1

Boregowda, H. S., and R. B. Jummannaver. "Neighbors degree sum energy of graphs." Journal of Applied Mathematics and Computing 67, no. 1-2 (January 20, 2021): 579–603. http://dx.doi.org/10.1007/s12190-020-01480-y.

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

Liu, Ze-meng, and Li-ming Xiong. "Degree sum conditions for hamiltonian index." Applied Mathematics-A Journal of Chinese Universities 36, no. 3 (September 2021): 403–11. http://dx.doi.org/10.1007/s11766-021-3885-4.

Full text
Abstract:
AbstractIn this note, we show a sharp lower bound of $$\min \left\{{\sum\nolimits_{i = 1}^k {{d_G}({u_i}):{u_1}{u_2} \ldots {u_k}}} \right.$$ min { ∑ i = 1 k d G ( u i ) : u 1 u 2 … u k is a path of (2-)connected G on its order such that (k-1)-iterated line graphs Lk−1(G) are hamiltonian.
APA, Harvard, Vancouver, ISO, and other styles
3

MacHale, Desmond. "Degree Sum Deficiency in Finite Groups." Mathematical Proceedings of the Royal Irish Academy 115A, no. 1 (2015): 1–11. http://dx.doi.org/10.1353/mpr.2015.0007.

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

Flandrin, E., H. A. Jung, and H. Li. "Hamiltonism, degree sum and neighborhood intersections." Discrete Mathematics 90, no. 1 (June 1991): 41–52. http://dx.doi.org/10.1016/0012-365x(91)90094-i.

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

Stephen Buckley, Desmond MacHale, and Áine Ní Shé. "Degree Sum Deficiency in Finite Groups." Mathematical Proceedings of the Royal Irish Academy 115A, no. 1 (2015): 1. http://dx.doi.org/10.3318/pria.2015.115.6.

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

Mohammed, K. Saleel, and Raji Pilakkat. "Minimum inclusive degree sum dominating set." Malaya Journal of Matematik 8, no. 4 (2020): 1885–89. http://dx.doi.org/10.26637/mjm0804/0091.

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

Faudree, Jill, Ralph J. Faudree, Ronald J. Gould, Paul Horn, and Michael S. Jacobson. "Degree sum and vertex dominating paths." Journal of Graph Theory 89, no. 3 (April 20, 2018): 250–65. http://dx.doi.org/10.1002/jgt.22249.

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

Hu, Zhi-quan, and Feng Tian. "On k-ordered Graphs Involved Degree Sum." Acta Mathematicae Applicatae Sinica, English Series 19, no. 1 (March 2003): 97–106. http://dx.doi.org/10.1007/s10255-003-0085-3.

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

Ferrara, Michael, Michael Jacobson, and Jeffrey Powell. "Characterizing degree-sum maximal nonhamiltonian bipartite graphs." Discrete Mathematics 312, no. 2 (January 2012): 459–61. http://dx.doi.org/10.1016/j.disc.2011.08.029.

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

Liu, Jianping, Aimei Yu, Keke Wang, and Hong-Jian Lai. "Degree sum and hamiltonian-connected line graphs." Discrete Mathematics 341, no. 5 (May 2018): 1363–79. http://dx.doi.org/10.1016/j.disc.2018.02.008.

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

Dissertations / Theses on the topic "Degree sum"

1

Steelman, Andrea Elizabeth. "Degree sum ensuring hamiltonicity." [Pensacola, Fla.] : University of West Florida, 2007. http://purl.fcla.edu/fcla/etd/WFE0000012.

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

Dai, 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.

Full text
Abstract:
La décomposition des graphes fait référence au processus de décomposer un graphe complexe en composantes plus simples et plus petites, souvent dans le but d'analyser ou de résoudre des problèmes liés au graphe. Il s'agit d'un outil important pour représenter la structure globale et les propriétés d'une manière plus détaillée. Il est aussi également utile pour résoudre des problèmes impliquant la recherche de structures spécifiques dans un graphe. Il existe plusieurs types courants de techniques de décomposition de graphe largement utilisées en théorie des graphes et dans des domaines connexes, notamment la décomposition en arbres, la décomposition en blocs, la décomposition modulaire, la décomposition hiérarchique, etc. Cette thèse étudie deux types de décomposition de sommets d'un graphe : les colorations propres (décomposition en ensembles indépendants) et la Hamilton-connectivité (décomposition en chemins internement disjoints entre deux ensembles où les chemins couvrent tous les sommets du graphe)
The 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)
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
Abstract The dissertation considers a degree theory and the index of a critical point of demi-continuous, everywhere defined mappings of the monotone type. A topological degree is derived for mappings from a Banach space to its dual space. The mappings satisfy the condition (S+), and it is shown that the derived degree has the classical properties of a degree function. A formula for the calculation of the index of a critical point of a mapping A : X→X* satisfying the condition (S+) is derived without the separability of X and the boundedness of A. For the calculation of the index, we need an everywhere defined linear mapping A' : X→X* that approximates A in a certain set. As in the earlier results, A' is quasi-monotone, but our situation differs from the earlier results because A' does not have to be the Frechet or Gateaux derivative of A at the critical point. The theorem for the calculation of the index requires a construction of a compact operator T = (A' + Γ)-1Γ with the aid of linear mappings Γ : X→X and A'. In earlier results, Γ is compact, but here it need only be quasi-monotone. Two counter-examples show that certain assumptions are essential for the calculation of the index of a critical point.
APA, Harvard, Vancouver, ISO, and other styles
4

Torres-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.

Full text
Abstract:
The present study examined the extent to which the U.S. STEM labor market is stratified in terms of quality of employment. Through a series of cluster analyses and Chi-square tests on data drawn from the 2008 Survey of Income Program Participation (SIPP), the study found evidence of segmentation in the highly-skilled STEM and non-STEM samples, which included workers with a subbaccalaureate diploma or above. The cluster analyses show a pattern consistent with Labor Market Segmentation theory: Higher wages are associated with other primary employment characteristics, including health insurance and pension benefits, as well as full-time employment. In turn, lower wages showed a tendency to cluster with secondary employment characteristics, such as part-time employment, multiple employment, and restricted access to health insurance and pension benefits. The findings also suggest that women have a higher likelihood of being employed in STEM jobs with secondary characteristics. The findings reveal a far more variegated employment landscape than is usually presented in national reports of the STEM workforce. There is evidence that, while STEM employment may be more resilient than non-STEM employment to labor restructuring trends in the new economy, the former is far from immune to secondary labor characteristics. There is a need for ongoing dialogue between STEM education (at all levels), employers, policymakers, and other stakeholders to truly understand not only the barriers to equity in employment relations, but also the mechanisms that create and maintain segmentation and how they may impact women, underrepresented minorities, and the foreign-born.
APA, Harvard, Vancouver, ISO, and other styles
5

Chan, Si-man, and 陳詩敏. "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.

Full text
Abstract:
The sub-degree sector is expanding rapidly after the announcement of the Policy Address in 2000 by the former Chief Executive Mr. Tung Chee-hwa. Sub-degree is introduced in Hong Kong in order to build a diversified and flexible higher education system. Since then more and higher education institutions offer self-financing sub-degree programmes. It seems that sub-degree programmes are oversupplied in the market; and there is uncertainty in articulation and employment of the sub-degree graduates. This issue has stirred up much controversy among the community and causes for our greatest concern. In recent years, the number of full-time accredited self-financing local 4-year degree programmes offered by private institutions grows tremendously. With the recent growth of this new qualification, the average intakes of sub-degree programmes would somewhat be affected. HKU SPACE Community College has been selected as a case study of this research. Students and staff in the Community College have been surveyed and interviewed. The study examines their views on the sub-degree programmes offered by the community colleges and the self-financing local 4-year degree programmes offered by the private institutions. From the findings of the research, it is evident that sub-degree is a valuable educational attainment in term of articulation and employment; and sub-degrees still have the development potential and will not be replaced by the self-financing local 4-year degrees offered by the private institutions.
published_or_final_version
Education
Master
Master of Education
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
Le TDD dynamique joue un rôle crucial dans les réseaux 5G, adaptant les ressources aux besoins variés. Il améliore l'efficacité spectrale en allouant dynamiquement des créneaux horaires pour les transmissions montantes et descendantes en fonction de la demande de trafic et des conditions de canal. Cette allocation dynamique de fréquence assure une utilisation efficace du spectre et prend en charge une connectivité massive, une latence faible et les exigences de la qualité de service. Son rôle dans l'agrégation de porteuses maximise les débits de données et la capacité du réseau, soulignant son importance dans les technologies de communication sans fil avancées.Cependant, le TDD dynamique est confronté à un défi majeur : l'Interférence des liens croisés. Ce type d'interférence se produit lorsque les transmissions montantes et descendantes partagent les mêmes bandes de fréquences, provoquant des interférences.Cette interférence comprend l'interférence de Station de Base à Station de Base (BS-to-BS) ou du lien descendant au lien montant (DL-to-UL) ainsi que l'interférence d'Équipement Utilisateur à Équipement Utilisateur (UE-to-UE) ou du lien montant vers le lien descendant (UL- to-DL). Dans l'interférence DL-to-UL, les transmissions descendantes débordent dans les bandes des transmissions montantes, dégradant la communication montante. À l'inverse, l'interférence UL-to-DL se produit lorsque les transmissions montantes interfèrent avec la réception des transmissions descendantes.Gérer efficacement ces interférences est crucial pour la performance et la fiabilité d'un système TDD dynamique.Ce mémoire vise à libérer tout le potentiel du TDD dynamique en surmontant les défis posés par les interférences des liens croisés grâce à une analyse rigoureuse et des méthodologies innovantes. La recherche ne se contente pas de faire progresser la technologie TDD dynamique, elle pionnière des solutions applicables à divers contextes de communication, stimulant des stratégies innovantes d'alignement d'interférence dans des scénarios variés.Le mémoire se divise en plusieurs parties. La première pose les bases avec la définition du problème et les concepts théoriques essentiels. La deuxième partie examine les conditions de faisabilité de l'alignement des interférences. Ces conditions sont exprimées en fonction de la dimension du problème et établissent le degré de liberté (DoF) atteignable, représentant le nombre de flux de données possibles. Elle explore l'alignement d'interférence dans des scénarios centralisés, en considérant à la fois les canaux MIMO en rang complet et réduit, et aborde des complexités du monde réel. De plus, elle étend l'exploration à un scénario distribué, offrant une compréhension réaliste des complexités de la communication. La troisième partie se concentre sur les techniques d'optimisation, en particulier le beamforming. Elle introduit le Zero Forcing (ZF) beamforming pour les utilisateurs, alignant l'interférence dans les systèmes TDD dynamique. Elle met l'accent sur l'impact de l'interférence des liens croisés entre utilisateurs et présente les améliorations apportées par les algorithmes WMMSE. De plus, elle explore l'optimisation de l'allocation de puissance en utilisant l'algorithme Water-Filling, évaluant la performance du Zero Forcing Beamforming et de l'algorithme WMMSE en fonction de cette approche d'optimisation de puissance
Dynamic 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
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.
Committee 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.
APA, Harvard, Vancouver, ISO, and other styles
8

Reys-Nickel, Lynsey. "Predictors of Associate's Degree Completion in Engineering and Engineering Technologies." Scholar Commons, 2016. http://scholarcommons.usf.edu/etd/6574.

Full text
Abstract:
The purpose of this ex post facto study was to describe completers and non-completers of associate’s degree programs in engineering and engineering technologies and determine whether and to what extent completion in these programs is a function of selected student-related variables and institutional variables. Data from the 2004/2009 Beginning Postsecondary Students Longitudinal Study (BPS: 04/09) of associate’s degree completers and non-completers in engineering and engineering technologies were accessed and analyzed through PowerStats, a web-based data analysis tool from National Center for Education Statistics (NCES). Descriptive data indicated that, proportionally, engineering and engineering technologies completers were mostly White, married, middle income, employed part-time, enrolled full-time, did not hold a high school diploma or certificate, completed Trigonometry/Algebra II, had a father who’s highest education level was an associate’s degree, but did not know their mother’s highest level of education, completed remedial coursework, and started college with the goal of earning an associate’s degree. While more males enrolled in the programs, males and females demonstrated similar completion rates, proportionally- with females showing a slightly higher percentage of completion. Results from the logistic regression further indicated that the variables significant to completion in associate’s degree programs in engineering and engineering technologies were gender and enrollment size. Findings suggested that female students were more likely to earn the degree, and that the larger the institution, the more likely the student would become a completer. However, since a major limitation of the study was the small weighted sample size, the results of the study are inconclusive in terms of the extent to which the findings can be generalized to the population of students in associate’s degree programs in engineering and engineering technologies. This study fills a gap in the literature of what is known about engineering and engineering technician students. It also contributes to the body of research on an understudied STEM educational and professional pathway, the associate’s degree in engineering and engineering technologies.
APA, Harvard, Vancouver, ISO, and other styles
9

Sun, Zeliang, and 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.

Full text
Abstract:
Aim:   It  has  been  demonstrated  that  customer  satisfaction  is  critically  important  to  the performance of grocery stores (Bamford and Xystouri, 2005). In Gävle, there is heavy competition among the three big brands - ICA, Willy:s and Coop. Therefore, the study of  customer  satisfaction  in grocery  stores  in  Gävle  is  worth  researching.  This  paper aims to establish major attributes that underlie sub-attributes, to examine which pose the  most  dynamic  influences  on  the  degree  of  customer  satisfaction  in  the  different store formats.  Method:  The  method  framework  consists  of  analysis  of  three  samples  of  customers who purchase in the three store formats of ICA, Maxi ICA, ICA Sätra Store and ICA Nära. Following  a  weighted  mean  calculation  of  the  15  sub-attributes,  thus  the  result  can show  us  the  influence  of  the  identified  attributes  and  sub-attributes  on  customer satisfaction.  Result & Conclusions:  The  degree  of  customer  satisfaction  in  Maxi  ICA  is  highest,  followed  by  Sätra  ICA and  ICA  Nära.  The  attributes,  such  as  additional  service,  store  location,  and  store environment exert greatest influence on customer satisfaction in the three  formats of   stores.  The  principal  sub-attributes,  such  as  opportunity  to  meet  friends,  attractive price,  convenient  car  parking,  location,  wide  range  of  food  and  helpful  staff act dramatically.  It is concluded that additional service and location satisfy customers most. The degree of customer satisfaction in grocery stores in Gävle, as different formats of stores can meet customers' different needs and requirements.  Suggestions for future research:   Four  suggestions  for  future  study  are  introduced.  Firstly,  researching  in  other  cities, such as Stockholm or Malmo, is advisable, as both of them differentiate from Gavle in terms  of  size  of  city  and  geographic  context.  Secondly,  research  on  comparison among ICA and its competitors is also advisable to be conducted as it can investigate Swedish retailing industry from a different aspect. Thirdly, Uutialo (2001)’s result appears  to  be  against  yours, the  gap  between  Uutialo’s and  ours  is  advised  to  be examine  further.  Lastly,  the  future  researchers  are  also  advised  to  concern  about  the relationship between traditional retailing industry and e-commerce.  Contribution of the thesis:  This work contributes to extant literature by assessing differences in the main factors that contribute to satisfaction in grocery stores in Gävle, depending on different store formats,  as  customer  satisfaction  is  commonly  linked  with  service  marketing. Moreover, the field of grocery market in Gävle has not studied before the way we did, so this thesis has its original value.
APA, Harvard, Vancouver, ISO, and other styles
10

Arroyave-Tobón, Santiago. "Polyhedral models reduction in geometric tolerance analysis." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0720/document.

Full text
Abstract:
L’analyse de tolérances par des ensembles de contraintes repose sur la détermination de l’accumulation de variations géométriques par des sommes et intersections d’ensembles opérandes 6d. Les degrés de liberté des liaisons et les degrés d’invariance des surfaces génèrent des opérandes non-bornés (polyèdres), posant des problèmes de simulation. En 2014, L. Homria proposé une méthode pour résoudre ce problème, consistant à ajouter des limites artificielles(contraintes bouchon) sur les déplacements non-bornés. Même si cette méthode permet la manipulation d’objets bornés (polytopes), les contraintes bouchon augmentent la complexité des simulations. En réponse à cette difficulté, une méthode dérivée est proposée dans cette thèse.Cette méthode consiste à tracer et simplifier les contraintes bouchon au travers des opérations.Puis une seconde stratégie basée sur la décomposition d’un polyèdre en une somme d’un polytope et de lignes droites (associées aux déplacements non-bornés). Cette stratégie consiste à simuler d’une part les sommes de droites, et d’autre part, à déterminer la somme de polytopes dans un sous-espace de dimension inférieur à 6. Ces trois stratégies sont comparées au travers d’une application industrielle. Cela montre que la traçabilité des contraintes bouchons est un aspect fondamental pour contrôler leur propagation et pour réduire le temps de calcul des simulations. Toutefois, cette méthode exige encore de déterminer les limites des déplacements non-bornés. La deuxième méthode, adaptant systématiquement la dimension de l’espace de calcul, elle permet de diminuer davantage le temps de calcul. Ce travail permet d’envisager la mise en oeuvre de cette méthode selon des formulations statistiques avec la prise en compte des défauts de forme des surfaces
The 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
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Degree sum"

1

Walter, Brunner. Die Promotio sub auspiciis. 2nd ed. Wien: Bundesministerium für Wissenschaft und Forschung, 1990.

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

Walter, Brunner. Die Promotio sub auspiciis. Wien: Bundesministerium für Wissenschaft und Forschung, 1988.

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

Ilorin, University of. Academic programmes: Undergraduate & sub-degree, 2003-2006. Ilorin, Nigeria]: Senate Committee on Review of Academic Programme, 2003.

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

Okidi, John. The degree of socially sub-optimal individual behavior in collective resource management. Kampala, Uganda: Economic Policy Research Center, 1999.

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

Two or three degrees off plumb: Sam Venable's unique look at life. Knoxville, Tenn: Knoxville News-Sentinel Co., 1988.

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

Petersen, 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.

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

Sunder, S. XPS, XRD and SEM study of oxidation of UO2 by air in gamma radiation at 150 [degrees] C. Pinawa, Man: Whiteshell Laboratories, 1995.

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

Technology), 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.

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

Mishenin, Sergey. Information and analytical work. ru: INFRA-M Academic Publishing LLC., 2019. http://dx.doi.org/10.12737/987953.

Full text
Abstract:
In the textbook the basic concepts concerning the organization and technology of information work of the student-historian are considered. It includes four sections: the first determines the place of the course's problems in the process of historical knowledge; the second tracks the principal features of facts, sources and research, which can potentially be the sphere of historical research; the third introduces the reader to the principles, conceptual apparatus, laws, methods and judgments as means of knowledge.; the fourth introduces the experience of constructing the text of the study, which sums up a certain result of the work done and allows you to " translate the process of learning a new state of relative knowledge." Meets the requirements of the Federal state educational standards of higher education of the last generation. It is intended for undergraduate students studying the discipline "Information and analytical work". It can be useful to persons preparing for admission to the master's degree in the areas of training "History" and "International relations", as well as all those interested in working with documents and other media.
APA, Harvard, Vancouver, ISO, and other styles
10

Arnold, J. Douglas. Nintendo 64: Survival Guide Volume Two. Lahaina, Maui, HI: Sandwich Islands Publishing Company, 1998.

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

Book chapters on the topic "Degree sum"

1

Patel, Mitesh J., and 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.

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

d'Orsi, Tommaso, Rajai Nasser, Gleb Novikov, and 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.

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

Chauhan, Ruchi, and 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.

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

Mastrolilli, 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.

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

Estrada, 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.

Full text
Abstract:
AbstractAn ever-increasing body of research has warned for decades about the impacts of climate change on agriculture, health, flooding, economy, among many others and provided information about when and where these impacts could be larger. Are societies prepared for these expected ‘white-swans’, particularly in the context of a high degree of interconnectedness in Nature and in society? I borrow from the development of the Covid-19 pandemic to illustrate this view. Influenza pandemics have been foreseen decades before, but the characteristics of the virus and the socioeconomic links have made it into the global crisis that it had become in 2020.
APA, Harvard, Vancouver, ISO, and other styles
6

Barak, Boaz, Zvika Brakerski, Ilan Komargodski, and 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.

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

Künnemann, Marvin, and 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.

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

Corneliussen, 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.

Full text
Abstract:
AbstractThe aim of this book was to answer the question: what makes women enter fields of IT? This final chapter will sum up the lessons from studying the women’s chronological pathways, space invader experiences, and reconstructions of IT, discussing the implications they might have for women, educational environments, and researchers. Learning points from barriers as well as turning points, and reconstructions that supported the women’s entries into a university degree in IT, can become guidelines for an ecosystem of supporters interested in making a more gender-inclusive digital future. This involves a discussion of how this field is riddled with a gender equality paradox and a counter-productive postfeminist reaction that results in a non-performative gender equality norm.
APA, Harvard, Vancouver, ISO, and other styles
9

Chareton, Christophe, Sébastien Bardin, François Bobot, Valentin Perrelle, and 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.

Full text
Abstract:
AbstractWhile recent progress in quantum hardware open the door for significant speedup in certain key areas, quantum algorithms are still hard to implement right, and the validation of such quantum programs is a challenge. In this paper we propose Qbricks, a formal verification environment for circuit-building quantum programs, featuring both parametric specifications and a high degree of proof automation. We propose a logical framework based on first-order logic, and develop the main tool we rely upon for achieving the automation of proofs of quantum specification: PPS, a parametric extension of the recently developed path sum semantics. To back-up our claims, we implement and verify parametric versions of several famous and non-trivial quantum algorithms, including the quantum parts of Shor’s integer factoring, quantum phase estimation (QPE) and Grover’s search.
APA, Harvard, Vancouver, ISO, and other styles
10

Pillonetto, Gianluigi, Tianshi Chen, Alessandro Chiuso, Giuseppe De Nicolao, and 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.

Full text
Abstract:
AbstractIn the previous chapter, it has been shown that the regularization approach is particularly useful when information contained in the data is not sufficient to obtain a precise estimate of the unknown parameter vector and standard methods, such as least squares, yield poor solutions. The fact itself that an estimate is regarded as poor suggests the existence of some form of prior knowledge on the degree of acceptability of candidate solutions. It is this knowledge that guides the choice of the regularization penalty that is added as a corrective term to the usual sum of squared residuals. In the previous chapters, this design process has been described in a deterministic setting where only the measurement noises are random. In this chapter, we will see that an alternative formalization of prior information is obtained if a subjective/Bayesian estimation paradigm is adopted. The major difference is that the parameters, rather than being regarded as deterministic, are now treated as a random vector. This stochastic setting permits the definition of new powerful tools for both priors selection, e.g., through the maximum entropy principle, and for regularization parameters tuning, e.g., through the empirical Bayes approach and its connection with the concept of equivalent degrees of freedom.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Degree sum"

1

Mohanty, Sidhanth, Prasad Raghavendra, and 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.

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

Jang, Min, Jin Whan Kang, and 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.

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

Qiu, Baojian, Jihui Wang, Yan Liu, and 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.

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

Bhattad, Kapil, Vishwambhar Rathi, and 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.

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

Wu, Ruizhen, Lin Wang, Tao Yuan, and 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.

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

Viola, 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.

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

Hopkins, Samuel B., Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, and 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.

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

Zhang, Shiyuan, Shan Lu, Jing Guo, Chen Xu, and 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.

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

Iwazaki, Sho, and 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.

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

Rosa-Jiménez, Carlos, Nuria Nebot, and 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.

Full text
Abstract:
Although the Bologna’s process has highlighted the need to develop deep and structural changes in the educational institutions, there is a scarce bibliography on innovation projects in Master Degree Projects, specifically in the field of Architecture. This paper is part of a educational innovative reaserch project that is proposing a cooperative process-and-product model-based for MDP. The model is developed in three stages, from collaborative learning action groups to indivual project. At the end of the process the student has developed three documents: a presentation, a product and a daily-portfolio. Finally, MDP assessment is the sum of three evaluations
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Degree sum"

1

Leemans, W. P., P. Volfbeyn, and M. Zolotorev. Laser based sub-picosecond electron bunch characterization using 90{degree} Thomson scattering. Office of Scientific and Technical Information (OSTI), May 1997. http://dx.doi.org/10.2172/505356.

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

Burrell, Robert, and John Collision. GNSI Decision Brief: Creating Sun Tsu: Instituting a Master’s Degree in Irregular Warfare. Tampa, FL: Global and National Security Institute, March 2024. http://dx.doi.org/10.5038/nuws6742.

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

Birtcher, R. C., J. W. Jr Richardson, and 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.

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

Pescatore, 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), October 1988. http://dx.doi.org/10.2172/6506641.

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

Swanson, 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.

Full text
Abstract:
Tree rings in the Noatak National Preserve provide information about the growth of trees at the cold limit of tree survival in northwestern North America. The present study was based on cores and other tree measurements (tree basal area, height, and number per unit area) of white spruce (Picea glauca) and balsam poplar (Populus balsamifera) trees taken from 39 permanent monitoring plots (34 with coreable trees) at three locations in the Preserve. The tree rings widths were measured and then normalized using a 50-year smoothing spline to remove the effects of growth variations through the life cycles of the trees. Old-growth white spruce forests, which here include numerous trees over 200 years old and some that are more than 300 years old, form open stands on well-drained slopes. Stands of younger trees that became established in the 1900s are present near elevational tree-line, and in small groves on tussock tundra. These younger stands are interpreted primarily as the result of forest expansion due to climate warming, though re-establishment of trees after wildfire is also possible in the tussock tundra. On river floodplains and terraces, stands of both white spruce and balsam poplar were also initiated in the 1900s, but here the youth of the trees is probably due to colonization of new areas exposed by river channel migration. Both the old-growth and younger forests showed continuing growth (as expressed by an increase in stand basal area) between our initial visit in 2011 and re-visit in 2021 or 2022, with the greatest increases occurring on floodplains. Tree rings showed much year-to-year variation in width, but the effect of individual cold summers was surprisingly weak. Some of the major global climate perturbations due to volcanic eruptions were visible in the tree ring record, but the resulting ring growth was generally no worse than other bad growth years within a few decades of the volcanic event. Tree ring width was statistically correlated more closely with the average warmth of several preceding growing seasons (as expressed by the annual sum of thaw degree-days) than with the current year?s or the previous year?s warmth alone. This is probably due to the cumulative effect of several years? warmth (or cold) on the conditions in the tree rooting zone, on the amount of foliage available for photosynthesis, and the level of stored reserves in the tree.
APA, Harvard, Vancouver, ISO, and other styles
6

McKee, Anna, and 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.

Full text
Abstract:
A recent study in the Chattahoochee River National Recreation Area (CHAT) indicated that dogs were a primary source of fecal contamination in the Chattahoochee River and that at least some of the contamination in the river was coming from locations outside of CHAT. The study herein sought to determine if dog parks in the CHAT watershed were sources of dog fecal contamination in streams within the watershed. Escherichia coli (E. coli) data were compiled from the Chattahoochee Riverkeeper Neighborhood Water Watch (NWW) program for sites within the CHAT watershed. Information about dog park locations within the Atlanta metropolitan area was compiled through online searches. Wilcoxon rank-sum tests, forward stepwise linear regression, and Spearman rank correlations were used to investigate the relations between seasonal E. coli levels (E. coli concentration and the proportion of samples that exceeded the U.S. Environmental Protection Agency beach action value [BAV]) and dog parks within the drainage basins. NWW sites with dog parks within the drainage basins had higher E. coli concentrations in the summer and winter, and samples exceeded the BAV more frequently in the winter than sites without dog parks within the drainage basins. Escherichia coli levels in the summer and winter were positively correlated with the number of dog parks within the drainage basins, indicating that E. coli concentrations and the frequency of BAV exceedances were seasonally higher at sites with more dog parks than at sites with fewer dog parks within the drainage basins. Escherichia coli concentrations in the summer were negatively correlated with distance to the nearest dog park in the drainage basin, indicating that sites with at least one dog park in close proximity had higher E. coli concentrations in the summer than sites for which the closest dog park was more distantly located. However, results of this study may have been influenced by the high degree of spatial autocorrelation in the data caused by overlapping drainage basins. Additionally, E. coli occurs in the gut systems of many species, so concentrations of E. coli may not represent levels of dog fecal contamination. Dog waste in residential yards and neighborhoods is a possible source of contamination in the watershed that could be investigated in future studies on sources of fecal contamination in the CHAT watershed. Utilizing dog-specific genetic markers in future studies would help reduce ambiguity in data interpretation.
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, W. Y., D. P. Stinton, and 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), June 1996. http://dx.doi.org/10.2172/450752.

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

Swenson, D., T. G. Nieh, and 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), December 1995. http://dx.doi.org/10.2172/231352.

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

Vedula, 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), March 1989. http://dx.doi.org/10.2172/6194380.

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

Seitz, J. C., J. G. Blencoe, D. B. Joyce, and 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), December 1994. http://dx.doi.org/10.2172/93671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Degree sum' 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