Die 2^(k – 1) Typen der ungeordneten Zahlpartitionen mit k Parts (k-Partitionen) werden hier mit Hilfe der geordneten Partitionen von k definiert. Für jeden Typ gibt es eine erzeugende Funktion der geschlossenen Form mit eindeutiger Nummerierung. Die bekannte erzeugende Funktion der k-Partitionen ist die Summe dieser 2^(k – 1) typspezifischen erzeugenden Funktionen. Die Expansion dieser typspezifischen erzeugenden Funktionen in (unendlich lange) Potenzreihen ist rekursiv möglich. Untersucht werden Zerlegungen von erzeugenden Funktionen der einfachen Typen in erzeugende Funktionen anderer Typen. Damit lassen sich Bijektionen zwischen den Partitionen verschiedener Typen aufspüren. Die typspezifischen Betrachtungen werden auf die geordneten Partitionen und auf ihre erzeugenden Funktionen ausgeweitet.:1. Kurze Vorbetrachtung 2. Die Typen der ungeordneten k-Partitionen 3. Konstruktion einer typspezifischen GF (generating function) 4. Nummerierung und Symbolik für typspezifische GF’s 5. Die Summe aller typspezifischen GF’s 6. Multiplizieren elementarer Potenzreihen, Erzeugungsformeln 7. Rekursives Expandieren typspezifischer GF’s 8. Zahlen, die in k-Partitionen aller 2^(k – 1) Typen zerlegbar sind 9. Die Konjugierten der typspezifischen k-Partitionen 10. GF-Zerlegungen 10.1 Zerlegung der GF des Typs r = 2 10.2 Zerlegung der GF des Typs r = 3 11. Die typspezifischen GF’s der geordneten Partitionen 12. Literaturverzeichnis 13. Nachwort

The Domain Name System (DNS) oversees the internet's architecture, providing pointers to both internal and external services. Consequently, enterprises increase their attack surface while simultaneously increasing their exposure to potential cyber threats. Subdomain takeovers happen when a subdomain leads to a website that no longer exists. As a result, the subdomain will be in control of an attacker. A compromised subdomain may be the access point to many attacks like information threats, phishing attacks, infrastructure intrusion and many more. Subdomain takeover attacks are one of the overlooked attack surfaces related to cyber security. This thesis aims to investigate the subdomain takeover attacks, how the attacks happen, the attack methodology by an attacker and drawbacks in the current strategies and tools, which are countermeasures for subdomain takeover attacks. The research focuses on resolving an intrusion from happening within the perspective of an enterprise standpoint. A new custom framework which resolves the subdomain takeover attacks was developed. A comparative study of the newly developed framework and the existing open-source tools and their response to an attack scenario too is made. Also, a comparison of the leading cloud platforms was conducted and their existing security features and mitigation measures for similar attacks and threats.

Jede ungeordnete Zahlpartition mit k Parts (k-Partiton) hat einen Typ, der mittels einer geordneten Partition von k definiert werden kann. Es können somit 2^(k - 1) Typen definiert werden. Pro Typ gibt es eine eindeutig nummerierbare erzeugende Funktion der geschlossenen Form. Mit Rekursionen können diese Funktionen in (unendlich lange) Potenzreihen expandiert werden. Mit diesen erzeugenden Funktionen lassen sich Bijektionen zwischen den Partitionsmengen verschiedener Typen aufspüren.:1. Kurze Vorbetrachtung 2. Typen der ungeordneten k-Partitionen 3. Konstruktion der GF (generating function) des allgemeinen Typs 4. Nummerierung der konstruierten GF 5. Weitere Analysen zur konstruierten GF 6. Die konjugierten der typspezifischen k-Partitionen 7. Vereinfachte GF-Symbolik 8. Eine programmierbare Basis-GF 9. Dekomposition von Q(x, k) in typspezifische GF''s 10. Rekursives Expandieren typspezifischer GF''s 11. GF-Zerlegungen und Bijektionen 12. Zahlen, die in k-Partitionen aller Typen zerlegbar sind 13. Referenzen

Dans cette thèse, nous abordons deux problèmes de théorie des graphes liés à deux problèmes biologiques de symbiose (deux organismes vivent en symbiose s'ils ont une interaction étroite et à long terme). Le premier problème est lié au phénomène de l'Incompatibilité cytoplasmique (IC) induit par certaines bactéries parasites chez leurs hôtes. L'IC se traduit par l'impossibilité de donner naissance à une progéniture saine lorsqu'un mâle infecté s'accouple avec une femelle non infectée. En termes de graphe ce problème peut s'interpréter comme la recherche d'une couverture minimum par des "sous-graphes des chaînes" d'un graphe biparti. Un graphe des chaînes est un graphe biparti dont les noeuds peuvent être ordonnés selon leur voisinage.En terme biologique, la taille minimale représente le nombre de facteurs génétiques impliqués dans le phénomène de l'IC. Dans la première moitié de la thèse, nous abordons trois problèmes connexes à ce modèle de la théorie des graphes. Le premier est l'énumération de tous les graphes des chaînes maximaux arêtes induits d'un graphe biparti G, pour lequel nous fournissons un algorithme en delai polynomial avec un retard de O(n^2m) où n est le nombre de noeuds et m le nombre d'arêtes de G. Dans la même section, nous montrons que (n/2)! et 2^(\sqrt{m}\log m) bornent le nombre de sous-graphes de chaînes maximales de G et nous les utilisons pour établir la complexité "input-sensitive" de notre algorithme. Le deuxième problème que nous traitons est de trouver le nombre minimum de graphes des chaînes nécessaires pour couvrir tous les bords d'un graphe biparti.Pour résoudre ce problème NP-hard, en combinant notre algorithme avec la technique d'inclusion-exclusion, nous fournissons un algorithme exponentiel exact en O^*((2+c)^m), pour chaque c > 0 (par O^* on entend la notation O standard mais en omettant les facteurs polynomiaux). Le troisième problème est l'énumération de toutes les couvertures minimales par des sous-graphes des chaînes. Nous montrons qu'il est possible d'énumérer toutes les couvertures minimales de G en temps O([(M + 1) |S|] ^ [\ log ((M + 1) |S|)]) où S est le nombre de couvertures minimales de G et M le nombre maximum des sous-graphes des chaînes dans une couverture minimale. Nous présentons ensuite la relation entre le second problème et le calcul de la dimension intervallaire d'un poset biparti. Nous donnons une interprétation de nos résultats dans le contexte de la dimension d'ordre / In this thesis, we address two graph theoretical problems connected to two different biological problems both related to symbiosis (two organisms live in symbiosis if they have a close and long term interaction). The first problem is related to the size of a minimum cover by "chain subgraphs" of a bipartite graph. A chain graph is a bipartite graph whose nodes can be ordered by neighbourhood inclusion. In biological terms, the size of a minimum cover by chain subgraphs represents the number of genetic factors involved in the phenomenon of Cytoplasmic Incompatibility (CI) induced by some parasitic bacteria in their insect hosts. CI results in the impossibility to give birth to an healthy offspring when an infected male mates with an uninfected female. In the first half of the thesis we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph G, for which we provide a polynomial delay algorithm with a delay of O(n^2m) where n is the number of nodes and m the number of edges of G. Furthermore, we show that (n/2)! and 2^(\sqrt{m} \log m) bound the number of maximal chain subgraphs of G and use them to establish the input-sensitive complexity of the algorithm. The second problem we treat is finding the minimum number of chain subgraphs needed to cover all the edges of a bipartite graph. To solve this NP-hard problem, we provide an exact exponential algorithm which runs in time O^*((2+c)^m), for every c>0, by a procedure which uses our algorithm and an inclusion-exclusion technique (by O^* we denote standard big O notation but omitting polynomial factors). Notice that, since a cover by chain subgraphs is a family of subsets of edges, the existence of an algorithm whose complexity is close to 2^m is not obvious. Indeed, the basic search space would have size 2^(2^m), which corresponds to all families of subsets of edges of a graph on $m$ edges. The third problem is the enumeration of all minimal covers by chain sugbgraphs. We show that it is possible to enumerate all such minimal covers of G in time O([(M+1)|S|]^[\log((M+1)|S|)]) where S is the number of minimal covers of G and M the maximum number of chain graphs in a minimal cover. We then present the relation between the second problem and the computation of the interval order dimension of a bipartite poset. We give an interpretation of our results in the context of poset and interval poset dimension... [etc]

A Monte Carlo simulation study on class enumeration with latent class regression models. / Latent class regression (LCR) is a statistical method used to identify qualitatively different groups or latent classes within a heterogeneous population and commonly used in the behavioural, health, and social sciences. Despite the vast applications, an agreed fit index to correctly determine the number of latent classes is hotly debated. To add, there are also conflicting views on whether covariates should or should not be included into the class enumeration process. We conduct a simulation study to determine the impact of covariates on the class enumeration accuracy as well as study the performance of several commonly used fit indices under different population models and modelling conditions. Our results indicate that of the eight fit indices considered, the aBIC and BLRT proved to be the best performing fit indices for class enumeration. Furthermore, we found that covariates should not be included into the enumeration procedure. Our results illustrate that an unconditional LCA model can enumerate equivalently as well as a conditional LCA model with its true covariate specification. Even with the presence of large covariate effects in the population, the unconditional model is capable of enumerating with high accuracy. As noted by Nylund and Gibson (2016), a misspecified covariate specification can easily lead to an overestimation of latent classes. Therefore, we recommend to perform class enumeration without covariates and determine a set of candidate latent class models with the aBIC. Once that is determined, the BLRT can be utilized on the set of candidate models and confirm whether results obtained by the BLRT match the results of the aBIC. By separating the enumeration procedure of the BLRT, it still allows one to use the BLRT but reduce the heavy computational burden that is associated with this fit index. Subsequent analysis can then be pursued accordingly after the number of latent classes is determined. / Thesis / Master of Science (MSc)

The effect of shared enemies between invasive and native species has been argued to facilitate biological invasions (i.e., the apparent competition hypothesis or ACH). This study investigated a previously untested possibility: whether granivorous small mammals facilitate cheatgrass (Bromus tectorum) invasion by driving food-mediated apparent competition between cheatgrass and native grasses. Specifically, we tested three predictions that must be true if such apparent competition occurs. First, cheatgrass invasion augments total seeds available to granivorous small mammals. Second, density of granivorous small mammals increases in response to increased seed availability (simulated with experimental additions of cheatgrass seeds). Third, granivorous small mammals prefer seeds from native grasses over cheatgrass seeds. We tested these predictions in the Great Basin Desert of Utah, USA. Cheatgrass invasion augmented total yearly seed production. Granivorous small mammals preferred native seeds over cheatgrass seeds. However, neither abundance, richness, nor diversity of granivorous small mammals increased in response to experimental additions of cheatgrass seed. We therefore conclude that granivorous small mammals did not drive food-mediated apparent competition during the study period. The lack of support for the ACH in this study may suggest that the role of small mammal-driven apparent competition is either unimportant in the Great Basin, or that the appropriate indirect interactions between small mammals, cheatgrass, and native grasses have yet to be evaluated. Testing the third prediction required the separation of seeds from the soil matrix. We employed a chemical flotation methodology to recover target seeds from soil, and developed a novel method of decanting target material from the flotation solution. We compared the utility of the novel method to that of a traditional decantation method. Specifically, we compared effectiveness (the proportion of seeds recovered from a known sample), rapidity (the time required to decant that sample), efficiency (the number of seeds decanted per second), and recovery bias (the effect of relative density on seed recovery) between methods. Our proposed method was more effective, more rapid, more efficient, and less biased than the traditional method. Therefore, any future work relying on flotation to analyze seed banks should clearly describe how samples are decanted and should consider the proposed method as a potential means of enhancing the efficiency of chemical flotation.

[pt] A avaliação probabilística da confiabilidade de um sistema elétrico de potên-cia visa quantificar, em índices, as estatísticas do risco do mesmo não atender seus clientes em plenitude. Na prática, os critérios determinísticos (e.g., N-1) são ainda os mais empregados. Na literatura, porém, a análise probabilística é uma área ex-tensa de pesquisa, podendo ser dividida em duas vertentes: as baseadas em simula-ção Monte Carlo (SMC) e aquelas fundamentadas na enumeração de estados (EE). Apesar de ser reconhecidamente inferior, a técnica EE é a que se assemelha mais aos critérios determinísticos, e, muito provavelmente por esta razão, possui extensa gama de trabalhos relacionados. Contudo, tais trabalhos apresentam limitações, pois, ou se restringem a sistemas de pequeno porte, ou desconsideram contingências de maior ordem quando abordam sistemas reais (médio-grande porte). De qualquer maneira, existe um grande apego do setor elétrico por técnicas de confiabilidade que se assemelhem às práticas dos operadores e planejadores. Isso motivou o de-senvolvimento de um método baseado em EE, o qual seja capaz de avaliar a confi-abilidade de sistemas de geração e transmissão com desempenho comparável ao da SMC. De forma heterodoxa, os conceitos de amostragem por importância (IS - Im-portance Sampling), uma técnica de redução de variância (VRT - Variance Reduc-tion Techniques) tipicamente empregada na SMC, serviram de inspiração para apri-morar a EE. Assim, o método proposto nesta dissertação é o resultado da combina-ção de uma ferramenta do tipo IS-VRT com técnicas de EE. Para análise e validação do método proposto, são utilizados dois sistemas teste comumente empregados neste tópico de pesquisa, sendo um deles de médio porte e capaz de reproduzir caracterís-ticas típicas de sistemas reais. / [en] The probabilistic reliability assessment of an electric power system aims to quantify, in terms of risk indices, its inability to fully serve its customers. In prac-tice, deterministic criteria (e.g., N-1) are still the most widely used. In the literature, however, probabilistic analysis is an extensive area of research, which can be di-vided into two evaluation categories: those based on Monte Carlo simulation (MCS) and those based on the state enumeration (SE). Despite being admittedly inferior, the SE technique is the one that most closely resembles the deterministic criteria, and, most likely for this reason, has a wide range of technical publications. How-ever, such works have limitations, because they are either restricted to small sys-tems, or they disregard higher contingency orders, when addressing real systems (medium-large). In any case, there is a strong attachment of the electric sector to reliability techniques that are similar to the practices of operators and planners. This motivated the development of a method based on SE, which is capable of assessing the reliability of generation and transmission systems with performance comparable to that of MCS. In a heterodox way, importance sampling (IS) concepts used in variance reduction techniques (VRT), typically employed by MCS, have served as inspiration to improve SE. Thus, the method proposed in this dissertation is the combination result of an IS-VRT type tool with SE techniques. For the analysis and validation of the proposed method, two test systems commonly used in this research topic are used, one of which is medium-sized and capable of reproducing typical characteristics of real systems.

No description available.

<p dir="ltr">Managing transient heat loads has become more challenging with the increasing electrification of ground, air, and marine vehicles. Doing so requires novel designs of thermal management systems, or in some cases, novel retrofits of legacy TMSs to accommodate the addition of more electrified subsystems. However, design tools that are well suited for examining and optimizing the dynamic response of TMS over candidate operation or mission profiles are limited. In this thesis, a principled methodology and associated tools for the enumeration and dynamic optimization of all feasible architectures of an air cycle machine are presented. Graph-based modeling is pivotal for exploring and optimizing ACM architectures, providing a structured representation of system components and interactions. By modeling the ACM as a graph, with vertices and edges representing components and interactions, respectively, various component configurations and performance metrics can be systematically analyzed. This approach enables efficient exploration of design alternatives and consideration of dynamic boundary conditions (representing, for example, a complex mission profile) during optimization. Another unique contribution of this thesis is a novel application of a multi-state graph-based modeling approach for developing dynamic models of turbomachinery components. By representing multiple states within each control volume or component and connecting them through power flows, this approach accurately captures both first and second law dynamics, enabling the computation of dynamic entropy generation rates. A detailed case study demonstrates the optimization of ACM architectures based on entropy generation minimization and dynamic bleed air flow rate minimization. This study highlights the trade-offs between different optimization criteria and the potential for generalizing the tool to more complex thermofluid systems in thermal management applications. The results underscore the importance of entropy-based analysis in comparing the thermodynamic losses across various system architectures.</p>

Responsive analytics are rapidly taking over the traditional data analytics dominated by the post-fact approaches in traditional data warehousing. Recent advancements in analytics demand placing analytical engines at the forefront of the system to react to updates occurring at high speed and detect patterns, trends and anomalies. These kinds of solutions find applications in Financial Systems, Industrial Control Systems, Business Intelligence and on-line Machine Learning among others. These applications are usually associated with Big Data and require the ability to react to constantly changing data in order to obtain timely insights and take proactive measures. Generally, these systems specify the analytical results or their basic elements in a query language, where the main task then is to maintain these results under frequent updates efficiently. The task of reacting to updates and analyzing changing data has been addressed in two ways in the literature: traditional business intelligence (BI) solutions focus on historical data analysis where the data is refreshed periodically and in batches, and stream processing solutions process streams of data from transient sources as flow (or set of flows) of data items. Both kinds of systems share the niche of reacting to updates (known as dynamic evaluation); however, they differ in architecture, query languages, and processing mechanisms. In this thesis, we investigate the possibility of a reactive and unified framework to model queries that appear in both kinds of systems. In traditional BI solutions, evaluating queries under updates has been studied under the umbrella of incremental evaluation of updates that is based on relational incremental view maintenance model and mostly focus on queries that feature equi-joins. Streaming systems, in contrast, generally follow the automaton based models to evaluate queries under updates, and they generally process queries that mostly feature comparisons of temporal attributes (e.g., timestamp attributes) along-with comparisons of non-temporal attributes over streams of bounded sizes. Temporal comparisons constitute inequality constraints, while non-temporal comparisons can either be equality or inequality constraints, hence these systems mostly process inequality joins. As starting point, we postulate the thesis that queries in streaming systems can also be evaluated efficiently based on the paradigm of incremental evaluation just like in BI systems in a main-memory model. The efficiency of such a model is measured in terms of runtime memory footprint and the update processing cost. To this end, the existing approaches of dynamic evaluation in both kind of systems present a trade-off between memory footprint and the update processing cost. More specifically, systems that avoid materialization of query (sub) results incur high update latency and systems that materialize (sub) results incur high memory footprint. We are interested in investigating the possibility to build a model that can address this trade-off. In particular, we overcome this trade-off by investigating the possibility of practical dynamic evaluation algorithm for queries that appear in both kinds of systems, and present a main-memory data representation that allows to enumerate query (sub) results without materialization and can be maintained efficiently under updates. We call this representation the Dynamic Constant Delay Linear Representation (DCLR). We devise DCLRs with the following properties: 1) they allow, without materialization, enumeration of query results with bounded-delay (and with constant delay for a sub-class of queries); 2) they allow tuple lookup in query results with logarithmic delay (and with constant delay for conjunctive queries with equi-joins only); 3) they take space linear in the size of the database; 4) they can be maintained efficiently under updates. We first study the DCLRs with the above-described properties for the class of acyclic conjunctive queries featuring equi-joins with projections and present the dynamic evaluation algorithm. Then, we present the generalization of thiw algorithm to the class of acyclic queries featuring multi-way theta-joins with projections. We devise DCLRs with the above properties for acyclic conjunctive queries, and the working of dynamic algorithms over DCLRs is based on a particular variant of join trees, called the Generalized Join Trees (GJTs) that guarantee the above-described properties of DCLRs. We define GJTs and present the algorithms to test a conjunctive query featuring theta-joins for acyclicity and to generate GJTs for such queries. To do this, we extend the classical GYO algorithm from testing a conjunctive query with equalities for acyclicity to test a conjunctive query featuring multi-way theta-joins with projections for acyclicity. We further extend the GYO algorithm to generate GJTs for queries that are acyclic. We implemented our algorithms in a query compiler that takes as input the SQL queries and generates Scala executable code – a trigger program to process queries and maintain under updates. We tested our approach against state of the art main-memory BI and CEP systems. Our evaluation results have shown that our DCLRs based approach is over an order of magnitude efficient than existing systems for both memory footprint and update processing cost. We have also shown that the enumeration of query results without materialization in DCLRs is comparable (and in some cases efficient) as compared to enumerating from materialized query results.