Academic literature on the topic 'Hybrid complete/incomplete approaches'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hybrid complete/incomplete approaches.'

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 "Hybrid complete/incomplete approaches":

1

LETOMBE, FLORIAN, and JOAO MARQUES-SILVA. "HYBRID INCREMENTAL ALGORITHMS FOR BOOLEAN SATISFIABILITY." International Journal on Artificial Intelligence Tools 21, no. 06 (December 2012): 1250025. http://dx.doi.org/10.1142/s021821301250025x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Boolean Satisfiability (SAT) solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. SAT solvers are also the building block of more sophisticated decision procedures, including Satisfiability Modulo Theory (SMT) solvers. The large number of applications of SAT yields ever more challenging problem instances, and motivate the development of more efficient algorithms. Recent work studied hybrid approaches for SAT, which involves integrating incomplete and complete SAT solvers. This paper proposes a number of improvements to hybrid SAT solvers. Experimental results demonstrate that the proposed optimizations are effective. The resulting algorithms in general perform better and, more importantly, are significantly more robust.
2

Trivellone, Valeria, Yanghui Cao, and Christopher H. Dietrich. "Comparison of Traditional and Next-Generation Approaches for Uncovering Phytoplasma Diversity, with Discovery of New Groups, Subgroups and Potential Vectors." Biology 11, no. 7 (June 28, 2022): 977. http://dx.doi.org/10.3390/biology11070977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Despite several decades’ effort to detect and identify phytoplasmas (Mollicutes) using PCR and Sanger sequencing focusing on diseased plants, knowledge of phytoplasma biodiversity and vector associations remains highly incomplete. To improve protocols for documenting phytoplasma diversity and ecology, we used DNA extracted from phloem-feeding insects and compared traditional Sanger sequencing with a next-generation sequencing method, Anchored Hybrid Enrichment (AHE) for detecting and characterizing phytoplasmas. Among 22 of 180 leafhopper samples that initially tested positive for phytoplasmas using qPCR, AHE yielded phytoplasma 16Sr sequences for 20 (19 complete and 1 partial sequence) while Sanger sequencing yielded sequences for 16 (11 complete and 5 partial). AHE yielded phytoplasma sequences for an additional 7 samples (3 complete and 4 partial) that did not meet the qPCR threshold for phytoplasma positivity or yielded non-phytoplasma sequences using Sanger sequencing. This suggests that AHE is more efficient for obtaining phytoplasma sequences. Twenty-three samples with sufficient data were classified into eight 16Sr subgroups (16SrI-B, I-F, I-AO, III-U, V-C, IX-J, XI-C, XXXVII-A), three new subgroups (designated as 16SrVI-L, XV-D, XI-G) and three possible new groups. Our results suggest that screening phloem-feeding insects using qPCR and AHE sequencing may be the most efficient method for discovering new phytoplasmas.
3

Jamil, Muhammad, Farkhanda Afzal, Ali Akgül, Saleem Abdullah, Ayesha Maqbool, Abdul Razzaque, Muhammad Bilal Riaz, and Jan Awrejcewicz. "Einstein Aggregation Operators under Bipolar Neutrosophic Environment with Applications in Multi-Criteria Decision-Making." Applied Sciences 12, no. 19 (October 6, 2022): 10045. http://dx.doi.org/10.3390/app121910045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In this article, we introduce bipolar neutrosophic (BN) aggregation operators (AOs) as a revolutionary notion in aggregation operators (AOs) by applying Einstein operations to bipolar neutrosophic aggregation operators (AOs), with its application related to a real-life problem. The neutrosophic set is able to drawout the incomplete, inconsistent and indeterminate information pretty efficiently. Initially, we present essential definitions along with operations correlated to the neutrosophic set (NS) and its generalization, the bipolar neutrosophic set (BNS). The Einstein aggregation operators are our primary targets, such asthe BN Einstein weighted average (BNEWA), BN Einstein ordered weighted average (BNEOWA), BN Einstein hybrid average (BNEHA), BN Einstein weighted geometric (BNEWG), BN Einstein ordered weighted geometric (BNEOWG) and BN Einstein hybrid geometric (BNEHG), as well as their required properties. The most important benefit of using the suggested approaches is that they provide decision-makers with complete sight of the issue. These techniques, when compared to other methods, provide complete, progressive and precise findings. Lastly, by means of diverse types of newly introduced aggregation operators and a numerical illustration by an example, we suggest an innovative method to be used for multi-criteria community decision-making (DM). This illustrates the utility and applicability of this new strategy when facing real-world problems.
4

Amin, Faiza, Muhammad Amber Fareed, Muhammad Sohail Zafar, Zohaib Khurshid, Paulo J. Palma, and Naresh Kumar. "Degradation and Stabilization of Resin-Dentine Interfaces in Polymeric Dental Adhesives: An Updated Review." Coatings 12, no. 8 (August 1, 2022): 1094. http://dx.doi.org/10.3390/coatings12081094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Instability of the dentine-resin interface is owed to the partial/incomplete penetration of the resin adhesives in the collagen fibrils. However, interfacial hydrolysis of the resin-matrix hybrid layer complex activates the collagenolytic and esterase enzymes that cause the degradation of the hybrid layer. Adequate hybridization is often prevented due to the water trapped between the interfibrillar spaces of the collagen network. Cyclic fatigue rupture and denaturation of the exposed collagen fibrils have been observed on repeated application of masticatory forces. To prevent interfacial microstructure, various approaches have been explored. Techniques that stabilize the resin–dentine bond have utilized endogenous proteases inhibitors, cross linking agents’ incorporation in the exposed collagen fibrils, an adhesive system free of water, and methods to increase the monomer penetration into the adhesives interface. Therefore, it is important to discover and analyze the causes of interfacial degradation and discover methods to stabilize the hybrid layer to execute new technique and materials. To achieve a predictable and durable adhesive resin, restoration is a solution to the many clinical problems arising due to microleakage, loss of integrity of the restoration, secondary caries, and postoperative sensitivity. To enhance the longevity of the resin-dentine bond strength, several experimental strategies have been carried out to improve the resistance to enzymatic degradation by inhibiting intrinsic collagenolytic activity. In addition, biomimetic remineralization research has advanced considerably to contemporary approaches of both intrafibrillar and extrafibrillar remineralization of dental hard tissues. Thus, in the presence of biomimetic analog complete remineralization of collagen, fibers are identified.
5

Jiang, Jiamin, and Rami M. Younis. "Hybrid Coupled Discrete-Fracture/Matrix and Multicontinuum Models for Unconventional-Reservoir Simulation." SPE Journal 21, no. 03 (June 15, 2016): 1009–27. http://dx.doi.org/10.2118/178430-pa.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Summary Unconventional reservoirs are the focus of considerable attention as a primary energy source. Numerical simulation is a core kernel of reservoir-engineering work flows for reservoir evaluation, optimization, and management. Accurate and efficient numerical simulation of unconventional reservoirs is challenging. There is substantial physical complexity involving a number of tightly coupled mechanisms in the modeling of these reservoirs. The complexity is further amplified by the multicontinuum nature of the stimulated formation, and the complex fracture networks with a wide range of fracture-length scales and topologies. To adequately capture the effects of the multiscaled fracture system, we develop two alternative hybrid approaches that are aimed at combining the advantages of multicontinuum and discrete-fracture/matrix (DFM) representations. During the development of unconventional resources, geological and geophysical information may be available in some cases to suggest a prior characterization, whereas in many other cases, this prior model may be incomplete and limited to hydraulic fractures. The two hybrid approaches could be used for different applications depending on the available characterization data and different requirements for efficiency and accuracy considerations. The first hybrid model couples an embedded-discrete-fracture model (EDFM) with multiple interacting continua (MINC) into EDFM/MINC, which simulates the fracture network characterized by stimulated-reservoir-volume (SRV) concept. This optimized model can reduce the computational cost that is associated with the widely applied logarithmically spaced/locally refined (LS/LR) DFM technique, while improving the flexibility to model the complex geometry of hydraulic fractures. The MINC concept allows the hybrid model to handle the extreme contrast in conductivity between the small-scale fracture network and the ultratight matrix that results in steep potential gradients. For the second class of hybrid model (unstructured DFM/continuum), the primary fractures are described by use of DFM with unstructured gridding, and the small-scale fractures are simulated by continuum-type approaches in a fully coupled manner. Optimized local-grid refinement is used to accurately handle the transient-flow regime around primary fractures. An upscaling technique that applies EDFM on the detailed realization of the discrete-fracture network by use of the target unstructured grid to generate an appropriate dual-permeability model is also developed. The upscaling technique is suitable for cases where a detailed prior model for the complete fracture network is available. Simulation studies demonstrate the applicability of the developed hybrid-fracture models. Model verification is conducted against several reference solutions.
6

Kirkbride, Ryan C., Jie Lu, Changqing Zhang, Rebecca A. Mosher, David C. Baulcombe, and Z. Jeffrey Chen. "Maternal small RNAs mediate spatial-temporal regulation of gene expression, imprinting, and seed development in Arabidopsis." Proceedings of the National Academy of Sciences 116, no. 7 (January 28, 2019): 2761–66. http://dx.doi.org/10.1073/pnas.1807621116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Arabidopsis seed development involves maternal small interfering RNAs (siRNAs) that induce RNA-directed DNA methylation (RdDM) through the NRPD1-mediated pathway. To investigate their biological functions, we characterized siRNAs in the endosperm and seed coat that were separated by laser-capture microdissection (LCM) in reciprocal genetic crosses with an nrpd1 mutant. We also monitored the spatial-temporal activity of the NRPD1-mediated pathway on seed development using the AGO4:GFP::AGO4 (promoter:GFP::protein) reporter and promoter:GUS sensors of siRNA-mediated silencing. From these approaches, we identified four distinct groups of siRNA loci dependent on or independent of the maternal NRPD1 allele in the endosperm or seed coat. A group of maternally expressed NRPD1-siRNA loci targets endosperm-preferred genes, including those encoding AGAMOUS-LIKE (AGL) transcription factors. Using translational promoter:AGL::GUS constructs as sensors, we demonstrate that spatial and temporal expression patterns of these genes in the endosperm are regulated by the NRPD1-mediated pathway irrespective of complete silencing (AGL91) or incomplete silencing (AGL40) of these target genes. Moreover, altered expression of these siRNA-targeted genes affects seed size. We propose that the corresponding maternal siRNAs could account for parent-of-origin effects on the endosperm in interploidy and hybrid crosses. These analyses reconcile previous studies on siRNAs and imprinted gene expression during seed development.
7

Ansótegui, Carlos, Felip Manyà, Jesus Ojeda, Josep M. Salvia, and Eduard Torres. "Incomplete MaxSAT approaches for combinatorial testing." Journal of Heuristics 28, no. 4 (August 2022): 377–431. http://dx.doi.org/10.1007/s10732-022-09495-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
AbstractWe present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum Satisfiability (MaxSAT) technology by describing efficient encodings for different classes of complete and incomplete MaxSAT solvers to compute optimal and suboptimal solutions, respectively. Similarly, we show how to solve through MaxSAT technology a closely related problem, the Tuple Number problem, which we extend to incorporate constraints. For this problem, we additionally provide a new MaxSAT-based incomplete algorithm. The extensive experimental evaluation we carry out on the available Mixed Covering Arrays with Constraints benchmarks and the comparison with state-of-the-art tools confirm the good performance of our approaches.
8

Davletov, F. A., K. P. Gainullina, А. М. Dmitriev, and E. V. Badamshina. "Inheritance features of productivity traits in pea hybrids F<sub>1</sub> and F<sub>2</sub>." Grain Economy of Russia, no. 3 (July 6, 2023): 21–28. http://dx.doi.org/10.31367/2079-8725-2023-86-3-21-28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The main reserve for improving of pea grain production is the development of new highly productive varieties. In this case, intraspecific hybridization is the main tool, but the patterns of inheritance by hybrids of several economically valuable traits are still insufficiently studied. The purpose of the current work was to establish the inheritance nature of productivity traits in pea hybrids. The trials were carried out in 2020–2022. The objects of the study were 8 pea hybrid combinations F1 and F2. The estimation of the collection and hybrid material was carried out in accordance with the Methodology of the State Variety Testing (2019). Segregation analysis in F1 pea hybrids has revealed different types of inheritance of the studied quantitative traits, from hybrid depression to overdominance. According to ‘plant height’, the dominance degree (hp) varied from 0 to 3.00. According to ‘number of pods per plant’ it varied from –0.50 to 3.00. According to ‘number of beans per pod’ it varied from 1.67 to 4.00. According to ‘1000-seed weight’ it varied from 0.20 to 0.44. Hybridological analysis of F2 pea plants based on ‘plant height’ in 4 hybrid combinations has revealed incomplete negative dominance (hp from –0.20 to –0.43), in 4 hybrid combinations it was incomplete dominance (hp from 0.60 to 0.69). According to ‘number of pods per plant’, two hybrid combinations have shown complete dominance (hp = 1.00), one hybrid combination has shown incomplete dominance (hp = 0.35), five hybrid combinations have shown incomplete negative dominance (hp from –0.50 to –0, 71). The trait ‘1000-seed weight’ in all hybrid combinations was inherited according to the type of incomplete dominance (hp from 0.10 to 0.16). According to ‘number of beans per pod’, four hybrid combinations have shown incomplete dominance (hp from 0.67 to 0.83); one hybrid combination has shown incomplete negative dominance (hp = –0.50); three hybrid combinations have shown complete negative dominance (hp = –1.00).
9

Auchmuty, Rosemary. "Feminist Approaches to Sexuality and Law Scholarship." Legal Information Management 15, no. 1 (March 2015): 4–7. http://dx.doi.org/10.1017/s1472669615000055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
AbstractSexuality and Law scholarship is a new and developing field but, like most legal scholarship, it is dominated by masculine concerns and methodologies. This article, by Rosemary Auchmuty, explains why research that ignores feminist concerns and methodologies will be incomplete and inaccurate, and suggests questions that should be asked of resources to ensure a complete and accurate coverage of the topic.
10

Levshina, Natalia. "Semantic maps of causation: New hybrid approaches based on corpora and grammar descriptions." Zeitschrift für Sprachwissenschaft 41, no. 1 (June 1, 2022): 179–205. http://dx.doi.org/10.1515/zfs-2021-2043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Abstract The present paper discusses connectivity and proximity maps of causative constructions and combines them with different types of typological data. In the first case study, I show how one can create a connectivity map based on a parallel corpus. This allows us to solve many problems, such as incomplete descriptions, inconsistent terminology and the problem of determining the semantic nodes. The second part focuses on proximity maps based on Multidimensional Scaling and compares the most important semantic distinctions, which are inferred from a parallel corpus of film subtitles and from grammar descriptions. The results suggest that corpus-based maps of tokens are more sensitive to cultural and genre-related differences in the prominence of specific causation scenarios than maps based on constructional types, which are described in reference grammars. The grammar-based maps also reveal a less clear structure, which can be due to incomplete semantic descriptions in grammars. Therefore, each approach has its shortcomings, which researchers need to be aware of.

Dissertations / Theses on the topic "Hybrid complete/incomplete approaches":

1

Tran, Trong Hieu. "Méthodes d'optimisation hybrides pour des problèmes de routages avec profits." Electronic Thesis or Diss., Toulouse 3, 2023. http://www.theses.fr/2023TOU30367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
L'optimisation combinatoire est une branche de l'optimisation mathématique qui se concentre sur la recherche de solutions optimales parmi un ensemble fini de combinaisons possibles, tout en respectant un ensemble de contraintes et en maximisant ou minimisant une fonction objectif. Pour résoudre ces problèmes, les méthodes incomplètes sont souvent utilisées en pratique, car ces dernières peuvent produire rapidement des solutions de haute qualité, ce qui est un point critique dans de nombreuses applications. Dans cette thèse, nous nous intéressons au développement d'approches hybrides qui permettent d'améliorer la recherche incomplète en exploitant les méthodes complètes. Pour traiter en cas pratique, nous considérons ici le problème de tournées de véhicules avec profits, dont l'objectif est de sélectionner un sous-ensemble de clients à visiter par des véhicules de manière à maximiser la somme des profits associés aux clients visités. Plus précisément, nous visons tout d'abord à améliorer les algorithmes de recherche incomplets en exploitant les connaissances acquises dans le passé. L'idée centrale est de: (i) apprendre des conflits (combinaisons de décisions qui conduisent à une violation de certaines contraintes ou à une sous-optimalité des solutions) et les utiliser pour éviter de réexaminer les mêmes solutions et guider la recherche, et (ii) exploiter les bonnes caractéristiques de solutions élites afin de produire de nouvelles solutions ayant une meilleure qualité. En outre, nous étudions le développement d'un solveur générique pour des problèmes de routage complexes pouvant impliquer des clients optionnels, des véhicules multiples, des fenêtres temporelles multiples, des contraintes supplémentaires, et/ou des temps de transition dépendant du temps. Le solveur générique proposé exploite des sous-problèmes pour lesquels des méthodes de raisonnement dédiées sont disponibles. L'efficacité des approches proposées est évaluée par diverses expérimentations sur des instances classiques et sur des données réelles liées à un problème d'ordonnancement pour des satellites d'observation de la Terre, qui inclut éventuellement des profits incertains
Combinatorial optimization is an essential branch of computer science and mathematical optimization that deals with problems involving a discrete and finite set of decision variables. In such problems, the main objective is to find an assignment that satisfies a set of specific constraints and optimizes a given objective function. One of the main challenges is that these problems can be hard to solve in practice. In many cases, incomplete methods are preferred to complete methods since the latter may have difficulties in solving large-scale problems within a limited amount of time. On the other hand, incomplete methods can quickly produce high-quality solutions, which is a critical point in numerous applications. In this thesis, we investigate hybrid approaches that enhance incomplete search by exploiting complete search techniques. For this, we deal with a concrete case study, which is the vehicle routing problem with profits. In particular, we aim to boost incomplete search algorithms by extracting some knowledge during the search process and reasoning with the knowledge acquired in the past. The core idea is two-fold: (i) to learn conflicting solutions (that violate some constraints or that are suboptimal) and exploit them to avoid reconsidering the same solutions and guide search, and (ii) to exploit good features of elite solutions in order to hopefully generate new solutions having a higher quality. Furthermore, we investigate the development of a generic framework by decomposing and exchanging information between sub-modules to efficiently solve complex routing problems possibly involving optional customers, multiple vehicles, multiple time windows, multiple side constraints, and/or time-dependent transition times. The effectiveness of the approaches proposed is shown by various experiments on both standard benchmarks (e.g., the Orienteering Problem and its variants) and real-life datasets from the aerospace domain (e.g., the Earth Observation Satellite scheduling problem), and possibly involving uncertain profits
2

Maximin, Grégory. "Les formes organisationnelles hybrides dans le secteur des télécommunications et des nouvelles technologies." Thesis, Antilles, 2022. http://www.theses.fr/2022ANTI0734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Le but des travaux est de montrer par quels moyens et procédés stratégiques et organisationnels les firmes des secteurs intensifs en nouvelles technologies et en innovation font face à la spécificité des actifs et aux dynamiques propres à la mondialisation de l’économie. La Nouvelle économie institutionnelle guide nos travaux à travers l’approche de la firme utilisée qui est d’essence contractualiste et qui s’appuie sur les travaux de l’Economie des Coûts de transaction et de la Théorie des Contrats incomplets. Cependant d’autres approches de la firme sont abordées afin de pallier aux écueils identifiés au sein de l’approche contractualiste et d’enrichir la portée académique des travaux. De surcroît, la notion d’alliance stratégique est très importante dans nos travaux et nous permet d’opérer une articulation entre les concepts d’Organisation et de Marché afin de mettre en lumière certaines dynamiques propres à la firme dans une économie de marché. Par ailleurs la thèse aborde également les alliances stratégiques sous les deux autres angles suivants : à la fois celui de la multinationalisation des firmes innovantes, ainsi que sur celui de la réponse organisationnelle que constituent les alliances stratégiques face aux spécificités propres aux secteurs innovants. La Théorie des jeux et le concept d’équilibre de Nash peuvent nous aider à modéliser ou à décrire la dynamique des firmes du secteur des télécommunications. La dynamique de d’autres secteurs innovants est étudiée à travers la notion d’alliance stratégique. L’influence des décisions et politiques publiques en matière de règlementation des télécommunications et d’impulsion de l’innovation est aussi évoquée. L’influence des politiques publiques peut se voir notamment en matière de concurrence lorsque le régulateur public autorise dans les secteurs innovants des firmes concurrentes à coopérer en amont en matière de recherche et développement. D’ailleurs des modèles de recherche et développement seront présentés. Il est à noter que les travaux de thèse intègrent des données empiriques faisant état du poids des secteurs intensifs en recherche et développement et donc de l’innovation dans l’économie. Le champ géographique couvert par ces données empiriques est continental et/ou international.La thèse permet donc à partir de la notion d’alliance stratégique de détailler des procédés organisationnels et des stratégies comportementales (modèle de jeux) encourageant : l’innovation, le maintien d’une forte spécificité des actifs et la réactivité nécessaire aux firmes dans une économie mondialisée. Nous donnons les formes organisationnelles les mieux adaptées pour faire face à une forte spécificité des actifs dans le secteur des télécommunications. Il s’agit de la firme (post-fusion) et de la joint-venture relationnelle concernant cette dernière nous démontrons que la présence de contrats relationnels permet de réduire la volonté de renégociation et est une protection contre l’opportunisme contractuel
The aim of the thesis is to show what are the means and strategic and organizational processes the firms of the sectors highly intense in new IT and innovation use to cope with to asset specificity and to the dynamics of the globalisation of the economy. The New Institutional Economics (NIE) leads our work thanks to the conception of the firm used which is based essentially on a contractualist approach which uses the works of the transaction cost economics and of theory of the incomplete contracts; however other approaches of the firms are evocated in order to enrich the academical view of our thesis. Moreover, the notion of strategic alliance is very important for our work, and it allows us to operate an articulation between the concepts of Organization and the Market for put in the light some firm’s dynamics in a market economy. Furthermore, the thesis concerns the strategic alliances under two other following perspectives: the first one is the multinationalization of the innovative firms, and the second one concerns the organizational response that establish the strategic alliances to cope with the specificities of the innovative sectors. The game theory and the concept of Nash equilibrium can help us to model ou describe the dynamic of the firms belonging the sector of telecommunications. The dynamic of other innovative sectors is studied through the notion of strategic alliance. The influence of the decisions and the public policies concerning the telecommunication regulation and the impulse of the innovation is evocated too. The influence of public policies can be seen particularly concerning the competition when the public regulator allows in the innovative sectors the competing firms to cooperate in upstream (for example research and development joined). Some research and developments models are presented in the thesis. It is important to note that the thesis has empirical data highlighting the weight of the sectors highly intense in research and development and so showing the weight of the innovation in the economy. The geographical field covers by these data is international The thesis thanks to the notion of strategic alliance enables to retail the organizational processes and the behavioral strategies (models of game) strengthening the innovation, enabling to cope with to a strong asset specificity and explaining the firms’ responses in a globalized economy. We finish in providing the organizational forms the most adapted for cope with to the strong specificity of the sector of telecommunications. There are the firm (post-merger) and the relational joint venture concerning this latter we demonstrate that the presence of relational contracts enables to reduce the will to renege and is a protection against the contractual opportunism

Books on the topic "Hybrid complete/incomplete approaches":

1

Zagare, Frank C., and Branislav L. Slantchev. Game Theory and Other Modeling Approaches. Oxford University Press, 2018. http://dx.doi.org/10.1093/acrefore/9780190846626.013.401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Game theory is the science of interactive decision making. It has been used in the field of international relations (IR) for over 50 years. Almost all of the early applications of game theory in international relations drew upon the theory of zero-sum games, but the first generation of applications was also developed during the most intense period of the Cold War. The theoretical foundations for the second wave of the game theory literature in international relations were laid by a mathematician, John Nash, a co-recipient of the 1994 Nobel Prize in economics. His major achievement was to generalize the minimax solution which emerged from the first wave. The result is the now famous Nash equilibrium—the accepted measure of rational behavior in strategic form games. During the third wave, from roughly the early to mid-1980s to the mid-1990s, there was a distinct move away from static strategic form games toward dynamic games depicted in extensive form. The assumption of complete information also fell by the wayside; games of incomplete information became the norm. Technical refinements of Nash’s equilibrium concept both encouraged and facilitated these important developments. In the fourth and final wave, which can be dated, roughly, from around the middle of the 1990s, extensive form games of incomplete information appeared regularly in the strategic literature. The fourth wave is a period in which game theory was no longer considered a niche methodology, having finally emerged as a mainstream theoretical tool.

Book chapters on the topic "Hybrid complete/incomplete approaches":

1

Prestwich, Steven. "The Relation Between Complete and Incomplete Search." In Hybrid Metaheuristics, 63–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78295-7_3.

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

Metta, Ravindra, Raveendra Kumar Medicherla, and Hrishikesh Karmarkar. "VeriFuzz: Good Seeds for Fuzzing (Competition Contribution)." In Fundamental Approaches to Software Engineering, 341–46. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99429-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
AbstractWe present VeriFuzz 1.2 with two new enhancements: (1) unroll the given program to a short depth and use BMC to produce incomplete test inputs, which are extended into complete inputs, and (2) if BMC fails for this short unrolling, automatically identify the reason and rerun BMC with a corresponding remedial strategy.
3

Ehsani, Sepehr. "New Horizons in Studying the Cellular Mechanisms of Alzheimer’s Disease." In Future of Business and Finance, 51–88. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99838-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
AbstractFollowing an analysis of the state of investigations and clinical outcomes in the Alzheimer’s research field, I argue that the widely accepted ‘amyloid cascade’ mechanistic explanation of Alzheimer’s disease appears to be fundamentally incomplete. In this context, I propose that a framework termed ‘principled mechanism’ (PM) can help remedy this problem. First, using a series of five ‘tests’, PM systematically compares different components of a given mechanistic explanation against a paradigmatic set of criteria and hints at various ways of making the mechanistic explanation more ‘complete’. I will demonstrate these steps using the amyloid explanation, highlighting its missing or problematic mechanistic elements. Second, PM makes an appeal for the discovery and application of ‘biological principles’ that approximate ceteris paribus generalisations or laws and are operative at the level of a biological cell. Although thermodynamic, evolutionary, ecological and other laws or principles from chemistry and the broader life sciences could inform them, biological principles should be considered ontologically unique. These principles could augment different facets of the mechanistic explanation but also allow further independent nomological explanation of the phenomenon. Whilst this overall strategy can be complementary to certain ‘new mechanist’ approaches, an important distinction of the PM framework is its equal attention to the explanatory utility of biological principles. Lastly, I detail two hypothetical biological principles and show how they could each inform and improve the potentially incomplete mechanistic aspects of the amyloid explanation and how they could provide independent explanations for the cellular features associated with Alzheimer’s disease.
4

Wu, QingE, and Weidong Yang. "A Local Approach and Comparison with Other Data Mining Approaches in Software Application." In Examining Information Retrieval and Image Processing Paradigms in Multidisciplinary Contexts, 1–26. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-1884-6.ch001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In order to complete an online, real-time and effective aging detection to software, this paper studies a local approach that is also called a fuzzy incomplete and a statistical data mining approaches, and gives their algorithm implementation in the software system fault diagnosis. The application comparison of the two data mining approaches with four classical data mining approaches in software system fault diagnosis is discussed. The performance of each approach is evaluated from the sensitivity, specificity, accuracy rate, error classified rate, missed classified rate, and run-time. An optimum approach is chosen from several approaches to do comparative study. On the data of 1020 samples, the operating results show that the fuzzy incomplete approach has the highest sensitivity, the forecast accuracy that are 96.13% and 94.71%, respectively, which is higher than those of other approaches. It has also the relatively less error classified rate is or so 4.12%, the least missed classified rate is or so 1.18%, and the least runtime is 0.35s, which all are less than those of the other approaches. After the performance, indices are all evaluated and synthesized, the results indicate the performance of the fuzzy incomplete approach is best. Moreover, from the test analysis known, the fuzzy incomplete approach has also some advantages, such as it has the faster detection speed, the lower storage capacity, and does not need any prior information in addition to data processing. These results indicate that the mining approach is more effective and feasible than the old data mining approaches in software aging detection.
5

Ghosh, Tarun Kumar, and Sanjoy Das. "Solving Job Scheduling Problem in Computational Grid Systems Using a Hybrid Algorithm." In Exploring Critical Approaches of Evolutionary Computation, 310–24. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-5832-3.ch015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Grid computing is a high performance distributed computing system that consists of different types of resources such as computing, storage, and communication. The main function of the job scheduling problem is to schedule the resource-intensive user jobs to available grid resources efficiently to achieve high system throughput and to satisfy user requirements. The job scheduling problem has become more challenging with the ever-increasing size of grid systems. The optimal job scheduling is an NP-complete problem which can easily be solved by using meta-heuristic techniques. This chapter presents a hybrid algorithm for job scheduling using genetic algorithm (GA) and cuckoo search algorithm (CSA) for efficiently allocating jobs to resources in a grid system so that makespan, flowtime, and job failure rate are minimized. This proposed algorithm combines the advantages of both GA and CSA. The results have been compared with standard GA, CSA, and ant colony optimization (ACO) to show the importance of the proposed algorithm.
6

Loganathan, Pushparaj, and Swaminathan Shanmugan. "SILSESQUIOXANES: SYNTHESIS, REACTIVITY AND APPLICATIONS IN MATERIALS CHEMISTRY." In Futuristic Trends in Chemical Material Sciences & Nano Technology Volume 3 Book 22, 266–87. Iterative International Publishers, Selfypage Developers Pvt Ltd, 2024. http://dx.doi.org/10.58532/v3becs22p2ch5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The study of the chemistry of silsesquioxanes comprising Si–O bonds has been primarily applied in field of inorganic silica and organosiloxane in which the repeating RSiO1.5 unit governs. Silsesquioxane has various benefits such as thermal, chemical stability and optical transparency from inorganic silica and solubility, ease of functionalization of organic groups to achieve the desired properties, ease of processing, less toxicity and biocompatibility from organosiloxanes. Silsesquioxanes are typically subdivided into two classes such as completely condensed silsesquioxanes and incompletely condensed silsesquioxanes. Polyhedral oligomeric silsesquioxanes are nanoscale building blocks that have been employed in template-free methods leading to the development of hybrid materials through “bottom-up” approaches. The construction of hierarchical structures by that unique functionalization followed by self-assembling of POSS molecules performs a significant role in materials chemistry. Hierarchical superstructures formed by POSS derivatives can be used in applications related to oil/water separations and flame retardant materials.
7

Fletcher, Kenneth K. "A Method for Aggregating Ranked Services for Personal Preference Based Selection." In Research Anthology on Reliability and Safety in Aviation Systems, Spacecraft, and Air Transport, 1373–97. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-5357-2.ch057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Typically, users' service requests, which are similar with varying preferences on non-functional attributes, may result in ranked lists of services that partially meet their needs due to conflicting non-functional attributes. The resultant multiple ranked lists of services that partially satisfies the user's request makes it challenging for the user to choose an optimal service, based on his/her preference. This work proposes a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user. Two algorithms are proposed; 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Examples using real-world airline services to evaluate both algorithms show that the results from both proposed algorithms closely represent the sets of ranked lists better than using alternative approaches. Experiments were also carried out to validate their performance.
8

Ma, Ning. "Complex Chinese Word Segmentation Method Based on Hybrid Deep Learning Technology." In Advances in Transdisciplinary Engineering. IOS Press, 2024. http://dx.doi.org/10.3233/atde231294.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Aiming at the problems of incomplete semantic understanding and insufficient word position information in complex Chinese word segmentation, a large-scale multilingual database Chinese word segmentation method based on hybrid deep learning technology is proposed. In this scheme, the bidirectional context information is effectively used through the bidirectional threshold circulation unit, and the long-distance dependency information is effectively modeled by the BiLSTM model. At the same time, the dependency between the output tags can be considered through the CRF layer. Then a double byte query method is proposed to expand the CRF model, and the whole process is realized by machine learning and training. The simulation results show that the hybrid model makes full use of the advantages that BiLSTM can extract local information by using long-distance information and CNN, and it can complete the task of Chinese word segmentation more efficiently and accurately. Under the same experimental conditions, the performance is improved by about 30% compared with similar methods.
9

Cochez, Michael, Dimitrios Alivanistos, Erik Arakelyan, Max Berrendorf, Daniel Daza, Mikhail Galkin, Pasquale Minervini, Mathias Niepert, and Hongyu Ren. "Chapter 17. Approximate Answering of Graph Queries." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Knowledge graphs (KGs) are inherently incomplete because of incomplete world knowledge and bias in what is the input to the KG. Additionally, world knowledge constantly expands and evolves, making existing facts deprecated or introducing new ones. However, we would still want to be able to answer queries as if the graph were complete. In this chapter, we will give an overview of several methods which have been proposed to answer queries in such a setting. We will first provide an overview of the different query types which can be supported by these methods and datasets typically used for evaluation, as well as an insight into their limitations. Then, we give an overview of the different approaches and describe them in terms of expressiveness, supported graph types, and inference capabilities.
10

Ferrier, Simon, Daniel P. Faith, Anni Arponen, and Michael Drielsma. "Community-Level Approaches to Spatial Conservation Prioritization." In Spatial Conservation Prioritization, 94–109. Oxford University PressOxford, 2009. http://dx.doi.org/10.1093/oso/9780199547760.003.0007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Abstract Quantitative approaches to spatial conservation prioritization require information on the distribution of biodiversity, often at relatively fine spatial resolutions across large geographical areas (Margules and Sarkar 2007; see also Chapter 1). Yet there is no region anywhere in the world for which there exists even a complete list of species (including all invertebrates, lower plants, and microbes) occurring within that region, let alone adequate spatial information on the distribution of these species (Rodrigues and Brooks 2007). In the face of such incomplete knowledge, conservation assessment is commonly based on two major types of surrogate: (a) species-level surrogates that employ mapped (or modelled) distributions of individual species from better-studied biological groups as indicators of spatial pattern in the distribution of biodiversity as a whole (see Chapter 6); and (b) community-level surrogates that work with spatial descriptors, or correlates, of emergent patterns in the distribution of biodiversity at the level of whole ecological communities or ecosystems (Ferrier 2002). Community-level surrogates can take many different forms – for example, mapped vegetation types, abiotic environmental classifications, or continuous surfaces of modelled richness or compositional turnover (see Section 7.3 for a comprehensive overview of options). Species-level and community-level surrogates are best viewed not as competing alternatives, but rather as highly complementary strategies for making best use of sparse biodiversity information in conservation assessment.

Conference papers on the topic "Hybrid complete/incomplete approaches":

1

Ghosh, Pronob K. "Complete and incomplete PMU observablity for hybrid state estimation." In 2017 International Conference on Computation of Power, Energy Information and Commuincation (ICCPEIC). IEEE, 2017. http://dx.doi.org/10.1109/iccpeic.2017.8290487.

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

Odekerken, Daphne, Tuomo Lehtonen, AnneMarie Borg, Johannes P. Wallner, and Matti Järvisalo. "Argumentative Reasoning in ASPIC+ under Incomplete Information." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Reasoning under incomplete information is an important research direction in AI argumentation. Most computational advances in this direction have so-far focused on abstract argumentation frameworks. Development of computational approaches to reasoning under incomplete information in structured formalisms remains to-date to a large extent a challenge. We address this challenge by studying the so-called stability and relevance problems---with the aim of analyzing aspects of resilience of acceptance statuses in light of new information---in the central structured formalism of ASPIC+. Focusing on the case of the grounded semantics and an ASPIC+ fragment motivated through application scenarios, we develop exact ASP-based algorithms for stability and relevance in incomplete ASPIC+ theories, and pinpoint the complexity of reasoning about stability (coNP-complete) and relevance (Sigma_2^P-complete), further justifying our ASP-based approaches. Empirically, the algorithms exhibit promising scalability, outperforming even a recent inexact approach to stability, with our ASP-based iterative approach being the first algorithm proposed for reasoning about relevance in ASPIC+.
3

Yang, Yang, De-Chuan Zhan, Xiang-Rong Sheng, and Yuan Jiang. "Semi-Supervised Multi-Modal Learning with Incomplete Modalities." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In real world applications, data are often with multiple modalities. Researchers proposed the multi-modal learning approaches for integrating the information from different modalities. Most of the previous multi-modal methods assume that training examples are with complete modalities. However, due to the failures of data collection, self-deficiencies and other various reasons, multi-modal examples are usually with incomplete feature representation in real applications. In this paper, the incomplete feature representation issues in multi-modal learning are named as incomplete modalities, and we propose a semi-supervised multi-modal learning method aimed at this incomplete modal issue (SLIM). SLIM can utilize the extrinsic information from unlabeled data against the insufficiencies brought by the incomplete modal issues in a semi-supervised scenario. Besides, the proposed SLIM forms the problem into a unified framework which can be treated as a classifier or clustering learner, and integrate the intrinsic consistencies and extrinsic unlabeled information. As SLIM can extract the most discriminative predictors for each modality, experiments on 15 real world multi-modal datasets validate the effectiveness of our method.
4

Tena Cucala, David J., Bernardo Cuenca Grau, and Boris Motik. "Faithful Approaches to Rule Learning." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Rule learning involves developing machine learning models that can be applied to a set of logical facts to predict additional facts, as well as providing methods for extracting from the learned model a set of logical rules that explain symbolically the model's predictions. Existing such approaches, however, do not describe formally the relationship between the model's predictions and the derivations of the extracted rules; rather, it is often claimed without justification that the extracted rules `approximate' or `explain' the model, and rule quality is evaluated by manual inspection. In this paper, we study the formal properties of Neural-LP--a prominent rule learning approach. We show that the rules extracted from Neural-LP models can be both unsound and incomplete: on the same input dataset, the extracted rules can derive facts not predicted by the model, and the model can make predictions not derived by the extracted rules. We also propose a modification to the Neural-LP model that ensures that the extracted rules are always sound and complete. Finally, we show that, on several prominent benchmarks, the classification performance of our modified model is comparable to that of the standard Neural-LP model. Thus, faithful learning of rules is feasible from both a theoretical and practical point of view.
5

Eichhoff, Julian R., Felix Baumann, and Dieter Roller. "Two Approaches to the Induction of Graph-Rewriting Rules for Function-Based Design Synthesis." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In this paper we demonstrate and compare two complementary approaches to the automatic generation of production rules from a set of given graphs representing sample designs. The first approach generates a complete rule set from scratch by means of frequent subgraph discovery. Whereas the second approach is intended to learn additional rules that fit an existing, yet incomplete, rule set using genetic programming. Both approaches have been developed and tested in the context of an application for automated conceptual engineering design, more specifically functional decomposition. They can be considered feasible, complementary approaches to the automatic inference of graph rewriting rules for conceptual design applications.
6

Suo, Qiuling, Weida Zhong, Fenglong Ma, Ye Yuan, Jing Gao, and Aidong Zhang. "Metric Learning on Healthcare Data with Incomplete Modalities." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/490.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Utilizing multiple modalities to learn a good distance metric is of vital importance for various clinical applications. However, it is common that modalities are incomplete for some patients due to various technical and practical reasons in healthcare datasets. Existing metric learning methods cannot directly learn the distance metric on such data with missing modalities. Nevertheless, the incomplete data contains valuable information to characterize patient similarity and modality relationships, and they should not be ignored during the learning process. To tackle the aforementioned challenges, we propose a metric learning framework to perform missing modality completion and multi-modal metric learning simultaneously. Employing the generative adversarial networks, we incorporate both complete and incomplete data to learn the mapping relationship between modalities. After completing the missing modalities, we use the nonlinear representations extracted by the discriminator to learn the distance metric among patients. Through jointly training the adversarial generation part and metric learning, the similarity among patients can be learned on data with missing modalities. Experimental results show that the proposed framework learns more accurate distance metric on real-world healthcare datasets with incomplete modalities, comparing with the state-of-the-art approaches. Meanwhile, the quality of the generated modalities can be preserved.
7

Bao, Zhenshan, Yuezhang Wang, and Wenbo Zhang. "Low-Resource Named Entity Recognition without Human Annotation." In 2nd International Conference on Machine Learning Techniques and NLP (MLNLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111427.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Most existing approaches to named entity recognition (NER) rely on a large amount of highquality annotations or a more complete specific entity lists. However, in practice, it is very expensive to obtain manually annotated data, and the list of entities that can be used is often not comprehensive. Using the entity list to automatically annotate data is a common annotation method, but the automatically annotated data is usually not perfect under low-resource conditions, including incomplete annotation data or non-annotated data. In this paper, we propose a NER system for complex data processing, which could use an entity list containing only a few entities to obtain incomplete annotation data, and train the NER model without human annotation. Our system extracts semantic features from a small number of samples by introducing a pre-trained language model. Based on the incomplete annotations model, we relabel the data using a cross-iteration approach. We use the data filtering method to filter the training data used in the iteration process, and re-annotate the incomplete data through multiple iterations to obtain high-quality data. Each iteration will do corresponding grouping and processing according to different types of annotations, which can improve the model performance faster and reduce the number of iterations. The experimental results demonstrate that our proposed system can effectively perform low-resource NER tasks without human annotation.
8

Pinto Prieto, Daira, Ronald de Haan, and Aybüke Özgün. "A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
One problem to solve in the context of information fusion, decision-making, and other artificial intelligence challenges is to compute justified beliefs based on evidence. In real-life examples, this evidence may be inconsistent, incomplete, or uncertain, making the problem of evidence fusion highly non-trivial. In this paper, we propose a new model for measuring degrees of beliefs based on possibly inconsistent, incomplete, and uncertain evidence, by combining tools from Dempster-Shafer Theory and Topological Models of Evidence. Our belief model is more general than the aforementioned approaches in two important ways: (1) it can reproduce them when appropriate constraints are imposed, and, more notably, (2) it is flexible enough to compute beliefs according to various standards that represent agents' evidential demands. The latter novelty allows the users of our model to employ it to compute an agent's (possibly) distinct degrees of belief, based on the same evidence, in situations when, e.g, the agent prioritizes avoiding false negatives and when it prioritizes avoiding false positives. Finally, we show that computing degree of belief with this model is #P-complete in general.
9

Adami, P., F. Martelli, and V. Michelassi. "Three-Dimensional Investigations for Axial Turbines by an Implicit Unstructured Multi-Block Flow Solver." In ASME Turbo Expo 2000: Power for Land, Sea, and Air. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/2000-gt-0636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
An unstructured 3D implicit approach (HybFlow) is briefly described for gas turbine applications. The numerical approach is based in an upwind finite volume scheme with an implicit time marching algorithm. The linear solver is GMRES with right preconditioning obtained by the ILU(0) incomplete factorization. A two k-w turbulence model is considered for viscous flows. The new multiblock extension of the code is here considered for improving the computational efficiency of the basic procedure in view of the application to complex 3D geometries. Particular concern has been placed in the new approach for memory saving while keeping at the same time a great geometrical flexibility and grid transparency. The strategy developed is therefore described considering the whole process and all phases required in the solution of internal flows. Both memory and CPU time costs are addressed to verify the performances of the multiblock scheme as also computational accuracy for 2D tests. The flow conditions investigated range from the low speed regime up to the transonic one to prove the accuracy of the approach using hybrid unstructured configurations. Finally the application to the transonic cooled annular IGV blade row is considered to assess the multiblock strategy for a 3D case.
10

Pappa, Alessio, Laurent Bricteux, and Ward De Paepe. "Fast Prediction of Combustor Stability Limits in Humidified Micro Gas Turbines Using Hybrid 0D/1D Model." In ASME Turbo Expo 2023: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/gt2023-103904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Abstract Cycle humidification is considered as an interesting route to enhance the micro Gas Turbine (mGT) operational flexibility, ensuring a place for mGTs in future small-scale decentralized power production. Indeed, humidifying the mGT cycle when there is no heat demand increases the electrical efficiency of the cycle, and thus the operational flexibility of the unit. However, the rather small operating range of the mGT combustor under these diluted conditions remains the main limitation, restricting the humidification rate, and thus the potential cycle improvement. Therefore, a complete characterization of the combustor performances for a range of operating conditions in combination with an increasing water-to-air ratio allows quantifying the operability limit of the engine under these unconventional diluted conditions. To improve the mGT cycle further, the limits to reach stable, complete, and low emissions combustion are assessed using a hybrid 0D/1D model of the combustor of typical mGT, namely the Turbec T100 mGT, for different humidification pathways (steam or water injection, saturation tower, ...). This model combines 0D Chemical Reactor Networks with 1D unstretched laminar flame calculations. The results of this computationally fast and flexible model are experimentally validated for both dry and wet cycle operation. For moderate water fractions, the simulation results show that complete combustion with low CO emissions, but at reduced temperature, could be achieved at a constant equivalence ratio compared to the dry reference case. At increased water fraction, stable and complete combustion at similar CO emission levels could still be achieved by increasing the equivalence ratio, compensating for the reduced temperature in the combustion chamber. Finally, at high water fractions, the results show unacceptably high CO levels, as a result of incomplete combustion due to the too-low temperature or too-low flame speed. With these simulations, we were able to assess the influence of humidified conditions on the combustion stability as well as to determine the operating limit helping so future cycle improvements.

Reports on the topic "Hybrid complete/incomplete approaches":

1

Baader, Franz, and Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a finite prefix of a trace. The task is then to check whether all continuations of this prefix to a trace satisfy (violate) the formula. More precisely, one wants to construct a monitor, i.e., a finite automaton that receives the finite prefix as input and then gives the right answer based on the state currently reached. In this paper, we extend the known approaches to LTL runtime verification in two directions. First, instead of propositional LTL we use the more expressive temporal logic ALC-LTL, which can use axioms of the Description Logic (DL) ALC instead of propositional variables to describe properties of single states of the system. Second, instead of assuming that the observed system behaviour provides us with complete information about the states of the system, we assume that states are described in an incomplete way by ALC-knowledge bases. We show that also in this setting monitors can effectively be constructed. The (double-exponential) size of the constructed monitors is in fact optimal, and not higher than in the propositional case. As an auxiliary result, we show how to construct Büchi automata for ALC-LTL-formulae, which yields alternative proofs for the known upper bounds of deciding satisfiability in ALC-LTL.
2

Dolja, Valerian V., Amit Gal-On, and Victor Gaba. Suppression of Potyvirus Infection by a Closterovirus Protein. United States Department of Agriculture, March 2002. http://dx.doi.org/10.32747/2002.7580682.bard.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The plant virus family Polyviridae is the largest and most destructive of all plant viruses. Despite the continuous effort to develop resistant plant varieties, there is a desperate need for novel approaches conferring wide-range potyvirus resistance. Based on experiments with the tobacco etch potyvirus (TEV)-derived gene expression vector, we suggested approach for screening of the candidate resistance genes. This approach relies on insertion of the genes into a virus vector and evaluation of the phenotypes of the resulting recombinant viruses. The genes which suppress infection by the recombinant virus are selected as candidates for engineering transgenic resistance. Our analysis of the TEV variants expressing proteins of the beet yellows closterovirus (BYV) revealed that one of those, the leader proteinase (L-Pro), strongly and specifically interfered with the hybrid TEV infection. Since closterovirus L-Pro is evolutionary related to potyviral helper component-proteinase (HC-Pro), we suggested that the L-Pro interfered with HC-Pro function via a trans-dominant inhibitory effect. Based on these findings, we proposed to test two major hypotheses. First, we suggested that L-Pro-mediated suppression of potyvirus infection is a general phenomenon effective against a range of potyviruses. The second hypothesis stated that the suppression effect can be reproduced in transgenic plants expressing L-Pro, and can be utilized for generation of resistance to potyviruses. In accord with these hypotheses, we developed two original objectives of our proposal: A) to determine the range of the closterovirus-derived suppression of potyviral infection, and B) to try and utilize the L-Pro-mediated suppression for the development of transgenic resistance to potyviruses. In the first phase of the project, we have developed all major tools and technologies required for successful completion of the proposed research. These included TEV and ZYMV vectors engineered to express several closteroviral L-Pro variants, and generation of the large collection of transgenic plants. To our satisfaction, characterization of the infection phenotypes exhibited by chimeric TEV and ZYMV variants confirmed our first hypothesis. For instance, similar to TEV-L- Pro(BYV) chimera, ZYMV-L-Pro(LIYV) chimera was debilitated in its systemic spread. In contrast, ZYMV-GUS chimera (positive control) was competent in establishing vigorous systemic infection. These and other results with chimeric viruses indicated that several closteroviral proteinases inhibit long-distance movement of the potyviruses upon co-expression in infected plants. In order to complete the second objective, we have generated ~90 tobacco lines transformed with closteroviral L-Pro variants, as well as ~100 lines transformed with BYV Hsp70-homolog (Hsp70h; a negative control). The presence and expression of the trans gene in each line was initially confirmed using RT-PCR and RNA preparations isolated from plants. However, since detection of the trans gene-specific RNA can not guarantee production of the corresponding protein, we have also generated L-Pro- and Hsp70h-specific antisera using corresponding synthetic peptides. These antisera allowed us to confirm that the transgenic plant lines produced detectable, although highly variable levels of the closterovirus antigens. In a final phase of the project, we tested susceptibility of the transgenic lines to TEV infection. To this end, we determined that the minimal dilution of the TEV inoculum that is still capable of infecting 100% of nontransgenic plants was 1:20, and used 10 plants per line (in total, ~2,000 plants). Unfortunately, none of the lines exhibited statistically significant reduction in susceptibility. Although discouraging, this outcome prompted us to expand our experimental plan and conduct additional experiments. Our aim was to test if closteroviral proteinases are capable of functioning in trans. We have developed agroinfection protocol for BYV, and tested if co- expression of the L-Pro is capable of rescuing corresponding null-mutant. The clear-cut, negative results of these experiments demonstrated that L-Pro acts only in cis, thus explaining the lack of resistance in our transgenic plants. We have also characterized a collection of the L-Pro alanine- scanning mutants and found direct genetic evidence of the requirement for L-Pro in virus systemic spread. To conclude, our research supported by BARD confirmed one but not another of our original hypotheses. Moreover, it provided an important insight into functional specialization of the viral proteinases and generated set of tools and data with which we will be able to address the molecular mechanisms by which these proteins provide a variety of critical functions during virus life cycle.

To the bibliography