To see the other types of publications on this topic, follow the link: Complexité combinatoire.
Journal articles on the topic 'Complexité combinatoire'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 43 journal articles for your research on the topic 'Complexité combinatoire.'
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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Hamon, Philippe. "Le littéraire, la littérature, le social et la valeur." Cahiers de recherche sociologique, no. 12 (April 18, 2011): 21–33. http://dx.doi.org/10.7202/1002055ar.
Full textAbstract:
Le texte littéraire constitue toujours, plus ou moins, une combinatoire des évaluations et des normes. C’est cette sorte d’algèbre que l’on voudra montrer en insistant sur la complexité de l’enchevêtrement normatif, sur les rôles et les qualifications des évaluateurs, sur les discordances des évaluations, sur la place qu’occupe le narrateur dans ce montage normatif.
2
Ferenczi, Sébastien. "Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$." Bulletin de la Société mathématique de France 123, no. 2 (1995): 271–92. http://dx.doi.org/10.24033/bsmf.2260.
Full text
3
Estève, Isabelle, and Agnès Millet. "Contacts de Langues et Multimodalite chez des locuteurs sourds : concepts et outils méthodologiques pour Llanalyse." Journal of Language Contact 2, no. 2 (2009): 111–31. http://dx.doi.org/10.1163/000000009792497823.
Full textAbstract:
AbstractCette contribution propose des outils de transcription et d'analyse des pratiques langagières de locuteurs sourds, dont les discours sont inscrits le plus souvent dans le bilinguisme, le contact de langues et la bimodalité. Réalisée sous le logiciel ELAN®, la grille hiérarchique que nous proposons et dont nous détaillons tous les niveaux d'analyse autorise des approches qualitatives et quantifiées des observables. Elle permet de rendre compte de la diversité des moyens utilisés (verbal/non verbal ; vocal/gestuel), de leur combinatoire et de leurs interactions. Elle permet également d'envisager des indices de complexité syntaxique et discursive, qui se construisent dans cette bilingualité particulière ancrée d'entrée de jeu dans la bimodalité. Les visées sont théoriques et descriptives et doivent trouver des prolongements psycholinguistiques et didactiques.
4
Statman, Rick. "On the complexity of alpha conversion." Journal of Symbolic Logic 72, no. 4 (December 2007): 1197–203. http://dx.doi.org/10.2178/jsl/1203350781.
Full textAbstract:
AbstractWe consider three problems concerning alpha conversion of closed terms (combinators).(1) Given a combinator M find the an alpha convert of M with a smallest number of distinct variables.(2) Given two alpha convertible combinators M and N find a shortest alpha conversion of M to N.(3) Given two alpha convertible combinators M and N find an alpha conversion of M to N which uses the smallest number of variables possible along the way.We obtain the following results.(1) There is a polynomial time algorithm for solving problem (1). It is reducible to vertex coloring of chordal graphs.(2) Problem (2) is co-NP complete (in recognition form). The general feedback vertex set problem for digraphs is reducible to problem (2).(3) At most one variable besides those occurring in both M and N is necessary. This appears to be the folklore but the proof is not familiar. A polynomial time algorithm for the alpha conversion of M to N using at most one extra variable is given.There is a tradeoff between solutions to problem (2) and problem (3) which we do not fully understand.
5
Bergier, Hugolin. "How Combinatory Logic Can Limit Computing Complexity." EPJ Web of Conferences 244 (2020): 01009. http://dx.doi.org/10.1051/epjconf/202024401009.
Full textAbstract:
As computing capabilities are extending, the amount of source code to manage is inevitably becoming larger and more complex. No matter how hard we try, the bewildering complexity of the source code always ends up overwhelming its own creator, to the point of giving the appearance of chaos. As a solution to the cognitive complexity of source code, we are proposing to use the framework of Combinatory Logic to construct complex computational concepts that will provide a model of description of the code that is easy and intuitive to grasp. Combinatory Logic is already known as a model of computation but what we are proposing here is to use a logic of combinators and operators to reverse engineer more and more complex computational concept up from the source code. Through the two key notions of computational concept and abstract operator, we will show that this model offers a new, meaningful and simple way of expressing what the intricate code is about.
6
Williams, Lance R. "Programs as Polypeptides." Artificial Life 22, no. 4 (November 2016): 451–82. http://dx.doi.org/10.1162/artl_a_00213.
Full textAbstract:
Object-oriented combinator chemistry (OOCC) is an artificial chemistry with composition devices borrowed from object-oriented and functional programming languages. Actors in OOCC are embedded in space and subject to diffusion; since they are neither created nor destroyed, their mass is conserved. Actors use programs constructed from combinators to asynchronously update their own states and the states of other actors in their neighborhoods. The fact that programs and combinators are themselves reified as actors makes it possible to build programs that build programs from combinators of a few primitive types using asynchronous spatial processes that resemble chemistry as much as computation. To demonstrate this, OOCC is used to define a parallel, asynchronous, spatially distributed self-replicating system modeled in part on the living cell. Since interactions among its parts result in the construction of more of these same parts, the system is strongly constructive. The system's high normalized complexity is contrasted with that of a simple composome.
7
Kaboré, Idrissa, and Théodore Tapsoba. "Combinatoire de mots récurrents de complexitén+2." RAIRO - Theoretical Informatics and Applications 41, no. 4 (September 25, 2007): 425–46. http://dx.doi.org/10.1051/ita:2007027.
Full text
8
Redmond, Brian F. "Bounded Combinatory Logic and lower complexity." Information and Computation 248 (June 2016): 215–26. http://dx.doi.org/10.1016/j.ic.2015.12.013.
Full text
9
Hirokawa, Sachio. "Complexity of the combinator reduction machine." Theoretical Computer Science 41 (1985): 289–303. http://dx.doi.org/10.1016/0304-3975(85)90076-3.
Full text
10
Krishnamurthy, E. V., and B. P. Vickers. "Compact numeral representation with combinators." Journal of Symbolic Logic 52, no. 2 (June 1987): 519–25. http://dx.doi.org/10.2307/2274398.
Full textAbstract:
AbstractThis paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.
11
Wasilkowski, G. W., and H. Woźniakowski. "There Exists a Linear Problem with Infinite Combinatory Complexity." Journal of Complexity 9, no. 2 (June 1993): 326–37. http://dx.doi.org/10.1006/jcom.1993.1021.
Full text
12
Kuhlmann, Marco, and Giorgio Satta. "A New Parsing Algorithm for Combinatory Categorial Grammar." Transactions of the Association for Computational Linguistics 2 (December 2014): 405–18. http://dx.doi.org/10.1162/tacl_a_00192.
Full textAbstract:
We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O( n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.
13
Kuhlmann, Marco, Giorgio Satta, and Peter Jonsson. "On the Complexity of CCG Parsing." Computational Linguistics 44, no. 3 (September 2018): 447–82. http://dx.doi.org/10.1162/coli_a_00324.
Full textAbstract:
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir ( 1994 ). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when the size of the grammar, and not only the length of the input sentence, is included in the analysis. This sets the formalism of Vijay-Shanker and Weir ( 1994 ) apart from weakly equivalent formalisms such as Tree Adjoining Grammar, for which parsing can be performed in time polynomial in the combined size of grammar and input sentence. Our results contribute to a refined understanding of the class of mildly context-sensitive grammars, and inform the search for new, mildly context-sensitive versions of CCG.
14
Caron, Pascal, Jean-Gabriel Luque, Ludovic Mignot, and Bruno Patrou. "State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach." International Journal of Foundations of Computer Science 27, no. 06 (September 2016): 675–703. http://dx.doi.org/10.1142/s0129054116500234.
Full textAbstract:
We study the state complexity of catenation combined with symmetric difference. First, an upper bound is computed using some combinatoric tools. Then, this bound is shown to be tight by giving a witness for it. Moreover, we relate this work with the study of state complexity for two other combinations: catenation with union and catenation with intersection. We extract a unified approach which allows to obtain the state complexity of any combination involving catenation and a binary boolean operation.
15
Miatselski, Mikalai. "Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications." Technical Sciences 1, no. 21 (November 6, 2017): 37–47. http://dx.doi.org/10.31648/ts.2715.
Full textAbstract:
A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.
16
DONNELLY, KEVIN, and MATTHEW FLUET. "Transactional events." Journal of Functional Programming 18, no. 5-6 (September 2008): 649–706. http://dx.doi.org/10.1017/s0956796808006916.
Full textAbstract:
AbstractConcurrent programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed transactional events, which combines first-class synchronous message passing events with all-or-nothing transactions. This combination enables simple solutions to interesting problems in concurrent programming. For example, guarded synchronous receive can be implemented as an abstract transactional event, whereas in other languages it requires a non-abstract, non-modular protocol. As another example, three-way rendezvous can be implemented as an abstract transactional event, which is impossible using first-class events alone. Both solutions are easy to code and easy to reason about.The expressive power of transactional events arises from a sequencing combinator whose semantics enforces an all-or-nothing transactional property – either both of the constituent events synchronize in sequence or neither of them synchronizes. This sequencing combinator, along with a non-deterministic choice combinator, gives transactional events the compositional structure of a monad-with-plus. We provide a formal semantics for transactional events and give a detailed account of an implementation.
17
Fiore, Stephen M., Samantha F. Warta, Andrew Best, Olivia Newton, and Joseph J. LaViola. "Developing A Theoretical Framework of Task Complexity for Research on Visualization in Support of Decision Making Under Uncertainty." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 61, no. 1 (September 2017): 1193–97. http://dx.doi.org/10.1177/1541931213601781.
Full textAbstract:
This paper describes initial validation of a theoretical framework to support research on the visualization of uncertainty. Two experiments replicated and extended this framework, illustrating how the manipulation of task complexity produces differences in performance. Additionally, using a combinatory metric of workload and performance, this framework provides a new metric for assessing uncertainty visualization. We describe how this work acts as a theoretical scaffold for examining differing forms of visualizations of uncertainty by providing a means for systematic variations in task context.
18
Asif, Muhammad, Wuyang Zhou, Muhammad Ajmal, Zain ul Abiden Akhtar, and Nauman Ali Khan. "A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach." Wireless Communications and Mobile Computing 2019 (February 3, 2019): 1–10. http://dx.doi.org/10.1155/2019/7468792.
Full textAbstract:
This correspondence presents a construction of quasicyclic (QC) low-density parity-check (LDPC) codes based on a special type of combinatorial designs known as block disjoint difference families (BDDFs). The proposed construction of QC-LDPC codes gives parity-check matrices with column weight three and Tanner graphs having a girth lower-bounded by 6. The proposed QC-LDPC codes provide an excellent performance with iterative decoding over an additive white Gaussian-noise (AWGN) channel. Performance analysis shows that the proposed short and moderate length QC-LDPC codes perform as well as their competitors in the lower signal-to-noise ratio (SNR) region but outperform in the higher SNR region. Also, the codes constructed are quasicyclic in nature, so the encoding can be done with simple shift-register circuits with linear complexity.
19
Nawel, Bani. "The exhibition design in the face of complexity: For a semio-pragmatic approach of enunciation." Global Journal of Arts Education 9, no. 2 (August 31, 2019): 43–47. http://dx.doi.org/10.18844/gjae.v9i2.3996.
Full textAbstract:
The exposition always allows us to ‘see’ and ‘know’ as much as it explains through the installation how to ‘interact’ and ‘make signify’ its combinatory. It invites the visitor to venture into a process-based experience of constant scavenge into the depths of the meaning to finally lead him, throughout the meeting, to discover its semantic code. The exhibition is, therefore, perceived as a spatial-media engineering work; a spatial rhetoric where the communication's efficiency is reliant on the attractive and expressive performance of the processes and mediums, by which, it condenses its statements, forges its phrases and includes its visitor-reader. Speech setting, course setting, editing games, articulation, situations, signification and interaction, evocation and provocation, etc., will thus be perceived as instruments and materials of a particular language as well as tools of spatial-media strategies.
Keywords: Exhibition, complexity, design process, spatio-media, enunciation.
20
Araúzo, José Alberto, Ricardo Del Olmo, and Juan José Laviós. "Subasta combinatoria para la programación dinámica en sistemas de fabricación distribuidos." Dirección y Organización, no. 51 (December 1, 2013): 55–64. http://dx.doi.org/10.37610/dyo.v0i51.438.
Full textAbstract:
Los métodos de programación de operaciones tradicionales, estáticos y basados en arquitecturas centralizadas o jerárquicas, no son suficientemente flexibles para adaptarse al dinamismo y complejidad de los sistemas de fabricación actuales. Por ello, la investigación en técnicas dinámicas de programación y control on-line está creciendo rápidamente. En este ar tículo se presenta una técnica de programación dinámica on-line basada en modelos de mercado e implementada sobre un sistema multiagente. Esta propuesta, además de dinámica, es distribuida no jerárquica, lo que aporta al sistema las características deseadas.Palabras claves: programación y control de la producción, programación on-line, sistemas de fabricación basados en agentes, subastas combinatorias.Combinatorial auction for dynamic scheduling in distributed manufacturing systemsAbstract: The traditional static scheduling methods, based on hierarchical and centralized architectures, are not flexible enough to self-adapt to the dynamism and complexity of today’s manufacturing systems. For this reason, new proposals to improve the scheduling and control of agile manufacturing systems constantly appear. The auction based allocation methods as well as the software paradigm of multiagent systems, which offers new techniques to face complex unsolved problems, can help to find promising solutions in manufacturing systems. Traditionally, scheduling problems have been solved offline by a centralized decision-maker that use a global optimisation model. We propose to include in the system several decision-makers modelled as agents instead. We consider two kinds of agents: order agents and machines agents. Each order agent represents a product that is characterized by its operations, precedence relationships and due date. The goal of each order agent is to find machines that can perform the required operations and hence completing successfully the order. Each production order creates its own schedule (local schedule). An auction mechanism ensures that local schedules are nearly compatible (several orders don’t use the same machine at the same moment) and globally efficient. Every agent in the system can communicate with other agents through the exchange of messages. The interaction mechanism is ruled by means of a combinatorial auction where a theoretical basis is provided for structuring message sequencing, bid evaluation, and price updating. Our research contributes to the auction technique in manufacturing scheduling and control in two basic aspects: (1) we apply the auction mechanism for a routing flexible environment (an operation can be performed in several machines with a differing efficiency), (2) we propose an implementation that can schedule online, updating real-time information: planning horizon, changes in orders, changes in machine availability and capabilities. We include explicitly the option of reallocate resources in real time when a new order arrives to the system. In order to test the features of this approach we display some computational results. Preliminary results show efficient performance in dynamic scenarios, but there are still many matters to investigate. Future works will be devoted to test the proposed approach on more case studies or even on real cases. We can add complexity to the structure of the system, and we must improve some aspects of the auction mechanism such as convergence and stability.Keywords: manufacturing programming and control, on-line scheduling, agent based manufacturing systems, combinatorial auctions.
21
MEIJER, ERIK. "Server side web scripting in Haskell." Journal of Functional Programming 10, no. 1 (January 2000): 1–18. http://dx.doi.org/10.1017/s0956796899003561.
Full textAbstract:
The Common Gateway Interface (CGI) for generating dynamic documents on web servers imposes much accidental complexity on the programmer. The Haskell/CGI library documented in this paper hides all this unpleasantness by using the common sense ‘design pattern’ of separating model and presentation. Low-level query string requests are represented by association lists, and primitive HTTP responses are easily constructed using a set of HTML generating combinators. The CGI programmer only needs to write a worker function that maps an abstract request into an abstract response. A (higher-order) wrapper function then transmutes the worker into a real low-level CGI script that deals with the exact format of concrete requests and responses as required by the CGI standard.
22
Hayashi, Misato. "Perspectives on object manipulation and action grammar for percussive actions in primates." Philosophical Transactions of the Royal Society B: Biological Sciences 370, no. 1682 (November 19, 2015): 20140350. http://dx.doi.org/10.1098/rstb.2014.0350.
Full textAbstract:
The skill of object manipulation is a common feature of primates including humans, although there are species-typical patterns of manipulation. Object manipulation can be used as a comparative scale of cognitive development, focusing on its complexity. Nut cracking in chimpanzees has the highest hierarchical complexity of tool use reported in non-human primates. An analysis of the patterns of object manipulation in naive chimpanzees after nut-cracking demonstrations revealed the cause of difficulties in learning nut-cracking behaviour. Various types of behaviours exhibited within a nut-cracking context can be examined in terms of the application of problem-solving strategies, focusing on their basis in causal understanding or insightful intentionality. Captive chimpanzees also exhibit complex forms of combinatory manipulation, which is the precursor of tool use. A new notation system of object manipulation was invented to assess grammatical rules in manipulative actions. The notation system of action grammar enabled direct comparisons to be made between primates including humans in a variety of object-manipulation tasks, including percussive-tool use.
23
Klepac, Goran. "Particle Swarm Optimization Algorithm as a Tool for Profile Optimization." International Journal of Natural Computing Research 5, no. 4 (October 2015): 1–23. http://dx.doi.org/10.4018/ijncr.2015100101.
Full textAbstract:
Complex analytical environment is challenging environment for finding customer profiles. In situation where predictive model exists like Bayesian networks challenge became even bigger regarding combinatory explosion. Complex analytical environment can be caused by multiple modality of output variable, fact that each node of Bayesian network can potetnitaly be target variable for profiling, as well as from big data environment, which cause data complexity in way of data quantity. As an illustration of presented concept particle swarm optimization algorithm will be used as a tool, which will find profiles from developed predictive model of Bayesian network. This paper will show how partical swarm optimization algorithm can be powerfull tool for finding optimal customer profiles given target conditions as evidences within Bayesian networks.
24
Voppel, Alban, Janna de Boer, Fleur Slegers, Hugo Schnack, and Iris Sommer. "S136. CLASSIFYING SCHIZOPHRENIA USING PHONOLOGICAL, SEMANTIC AND SYNTACTIC FEATURES OF LANGUAGE; A COMBINATORY MACHINE LEARNING APPROACH." Schizophrenia Bulletin 46, Supplement_1 (April 2020): S87. http://dx.doi.org/10.1093/schbul/sbaa031.202.
Full textAbstract:
Abstract Background The diagnosis of schizophrenia is currently based on anamnesis and psychiatric examination only. Language biomarkers may be useful to provide a quantitative and reproducible risk estimate for this spectrum of disorders. While people with schizophrenia spectrum disorders may show one or more language abnormalities, such as incoherence, affective flattening, failure of reference as well as changes in sentence length and complexity, the clinical picture can vary largely between individuals and language abnormalities will reflect this heterogeneity. Computational linguistics can be used to quantify these features of language. Because of the heterogeneous character of the various symptoms present in schizophrenia spectrum subjects, we expect some subjects to show semantic incoherence, while others may have more affective symptoms such as monotonous speech. Here, we combine phonological, semantic and syntactic features of semi-spontaneous language with machine learning algorithms for classification in order to develop a biomarker sensitive to the broad spectrum of schizophrenia. Methods Semi-spontaneous natural language samples were collected from 50 subjects with schizophrenia spectrum disorders and 50 age, gender and parental education matched controls, using recorded neutral-topic, open-ended interviews. The audio samples were speaker coded; audio belonging to the subject was extracted and transcribed. Phonological features were extracted using OpenSMILE; semantic features were calculated using a word2vec model using a moving windows of coherence approach, and finally syntactic aspects were calculated using the T-scan tool. Feature reduction was applied to each of the domains. To distinguish groups, results from machine learning classifiers trained using leave-one-out cross-validation on each of these aspects were combined, incorporating a voting mechanism. Results The machine-learning classifier approach obtained 75–78% accuracy for the semantic, syntactic and phonological domains individually. As most distinguishing features of their respective domain, we found reduced timbre and intonation for the phonological domain, increased variance of coherence for the semantic domain and decreased complexity of speech in the syntactic domain. The combined approach, using a voting algorithm across the domains, achieved an accuracy of 83% and a precision score of 89%. No significant differences in age, gender or parental education between healthy controls and subjects with schizophrenia spectrum disorders was found. Discussion In this study we demonstrated that computational features derived from different linguistic domains capture aspects of symptomatic language of schizophrenia spectrum disorder subjects. The combination of these features was useful to improve classification for this heterogeneous disorder, as we showed high accuracy and precision from the language parameters in distinguishing schizophrenia patients from healthy controls. These values are better than those obtained with imaging or blood analyses, while language is a more easily obtained and cheaper measure than those derived from other methods. Validation in an independent sample is required, and further features of differentiation should be extracted for their respective domains. Our positive results in using language abnormalities to automatically detect schizophrenia show that computational linguistics is a promising method in the search for reliable markers in psychiatry.
25
Dangel, Jacqueline. "Lucretius." Linguistic Approaches to Poetry 15 (December 31, 2001): 87–102. http://dx.doi.org/10.1075/bjl.15.07dan.
Full textAbstract:
Lucretius wanted his poetry to convey the scientific truths of Epicurean doctrine. In addition, he thought that one single generative and organic principle unites atomistic physics and the combinatory production of meaning. Thanks to the interplay between its “outer metric” (the distribution of dactylic/spondaic feet and caesuras) and its “inner metric” (the collocation of metrical word-types), the Latin hexameter allowed him to create intricate networks of similarities and differences, aimed at expressing the central tenets of the Epicurean system in such a way that they acquire the “evidence” of sensory impressions. As shown by the detailed analysis of two excerpts (II, 308-332; I, 1-20), systematic choices operating at the level of both “outer” and “inner” metrics provide a mimetic representation of the very essence of Epicurean reality, whose constant change and movement produce order and complexity based on the functional properties of its pro-forms.
26
Ettcheto, Miren, Oriol Busquets, Triana Espinosa-Jiménez, Ester Verdaguer, Carme Auladell, and Antoni Camins. "A Chronological Review of Potential Disease-Modifying Therapeutic Strategies for Alzheimer's Disease." Current Pharmaceutical Design 26, no. 12 (May 6, 2020): 1286–99. http://dx.doi.org/10.2174/1381612826666200211121416.
Full textAbstract:
: Late-onset Alzheimer’s disease (LOAD) is a neurodegenerative disorder that has become a worldwide health problem. This pathology has been classically characterized for its affectation on cognitive function and the presence of depositions of extracellular amyloid β-protein (Aβ) and intracellular neurofibrillary tangles (NFT) composed of hyperphosphorylated Tau protein. To this day, no effective treatment has been developed. : Multiple strategies have been proposed over the years with the aim of finding new therapeutic approaches, such as the sequestration of Aβ in plasma or the administration of anti-inflammatory drugs. Also, given the significant role of the insulin receptor in the brain in the proper maintenance of cognitive function, drugs focused on the amelioration of insulin resistance have been proposed as potentially useful and effective in the treatment of AD. In the present review, taking into account the molecular complexity of the disease, it has been proposed that the most appropriate therapeutic strategy is a combinatory treatment of several drugs that will regulate a wide spectrum of the described altered pathological pathways.
27
Cohen, Shay B., and Daniel Gildea. "Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication." Computational Linguistics 42, no. 3 (September 2016): 421–55. http://dx.doi.org/10.1162/coli_a_00254.
Full textAbstract:
We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(mω) is the running time for m × m matrix multiplication and d is the “contact rank” of the LCFRS—the maximal number of combination and non-combination points that appear in the grammar rules. We also show that this algorithm can be used as a subroutine to obtain a recognition algorithm for general binary LCFRS with running time O(nωd+1). The currently best known ω is smaller than 2.38. Our result provides another proof for the best known result for parsing mildly context-sensitive formalisms such as combinatory categorial grammars, head grammars, linear indexed grammars, and tree-adjoining grammars, which can be parsed in time O(n4.76). It also shows that inversion transduction grammars can be parsed in time O(n5.76). In addition, binary LCFRS subsumes many other formalisms and types of grammars, for some of which we also improve the asymptotic complexity of parsing.
28
Chapman, Alison Georgina. "Apple Pips, Fruit Stains, and Clammy Juice." Nineteenth-Century Literature 75, no. 3 (December 2020): 372–98. http://dx.doi.org/10.1525/ncl.2020.75.3.372.
Full textAbstract:
Alison Georgina Chapman, “Apple Pips, Fruit Stains, and Clammy Juice: Nature’s Ornaments and the Aesthetics of Preservation in Thomas Hardy's The Woodlanders” (pp. 372–398) This paper explores Thomas Hardy’s representation of the natural world as ornamental in The Woodlanders (1887). Previous critics have pointed to the ornate and artificial descriptions of the environment to argue that nature is strangely absent in The Woodlanders. However, I argue that Hardy sees ornamental aesthetics as uniquely capable of representing ecology. As a mode that appeals to the senses while resisting interpretation, ornament captures how nature can be simultaneously overbearing in its influence over, and remote as a source of consolation to, its human interlopers. Moreover, ornament’s formal openness—specifically its capacity for endless embellishments—is better suited to nature’s mutability and inherent complexity. This adaptive, combinatory capacity proves to be a central aesthetic value for Hardy. In his architectural writing, the author argues that old buildings must be preserved from renovators who would replace these monuments’ eccentric, bric-a-brac histories with simplified, formally coherent structures. Hardy’s concern here is not only aesthetic but also ecocritical, as the author notes that such renovations often entail massive amounts of waste. Ornamental complexity and its capacity for adaptation, repurposing, and reuse thus yoke together Hardy’s interests in historic preservation, aesthetics, and ecology. By reading The Woodlanders as an ornamental novel, this essay shows how Hardy’s decorous style is part of a broader ecological and ethical project.
29
Chapman, Alison Georgina. "Apple Pips, Fruit Stains, and Clammy Juice." Nineteenth-Century Literature 75, no. 3 (December 2020): 372–98. http://dx.doi.org/10.1525/ncl.2020.75.3.372.
Full textAbstract:
Alison Georgina Chapman, “Apple Pips, Fruit Stains, and Clammy Juice: Nature’s Ornaments and the Aesthetics of Preservation in Thomas Hardy's The Woodlanders” (pp. 372–398) This paper explores Thomas Hardy’s representation of the natural world as ornamental in The Woodlanders (1887). Previous critics have pointed to the ornate and artificial descriptions of the environment to argue that nature is strangely absent in The Woodlanders. However, I argue that Hardy sees ornamental aesthetics as uniquely capable of representing ecology. As a mode that appeals to the senses while resisting interpretation, ornament captures how nature can be simultaneously overbearing in its influence over, and remote as a source of consolation to, its human interlopers. Moreover, ornament’s formal openness—specifically its capacity for endless embellishments—is better suited to nature’s mutability and inherent complexity. This adaptive, combinatory capacity proves to be a central aesthetic value for Hardy. In his architectural writing, the author argues that old buildings must be preserved from renovators who would replace these monuments’ eccentric, bric-a-brac histories with simplified, formally coherent structures. Hardy’s concern here is not only aesthetic but also ecocritical, as the author notes that such renovations often entail massive amounts of waste. Ornamental complexity and its capacity for adaptation, repurposing, and reuse thus yoke together Hardy’s interests in historic preservation, aesthetics, and ecology. By reading The Woodlanders as an ornamental novel, this essay shows how Hardy’s decorous style is part of a broader ecological and ethical project.
30
Chrétien, Sebastian, Ioannis Zerdes, Jonas Bergh, Alexios Matikas, and Theodoros Foukakis. "Beyond PD-1/PD-L1 Inhibition: What the Future Holds for Breast Cancer Immunotherapy." Cancers 11, no. 5 (May 5, 2019): 628. http://dx.doi.org/10.3390/cancers11050628.
Full textAbstract:
Cancer immunotherapy has altered the management of human malignancies, improving outcomes in an expanding list of diseases. Breast cancer - presumably due to its perceived low immunogenicity - is a late addition to this list. Furthermore, most of the focus has been on the triple negative subtype because of its higher tumor mutational load and lymphocyte-enriched stroma, although emerging data show promise on the other breast cancer subtypes as well. To this point the clinical use of immunotherapy is limited to the inhibition of two immune checkpoints, Programmed Cell Death Protein 1 (PD-1) and Cytotoxic T-lymphocyte-associated Protein 4 (CTLA-4). Consistent with the complexity of the regulation of the tumor – host interactions and their lack of reliance on a single regulatory pathway, combinatory approaches have shown improved efficacy albeit at the cost of increased toxicity. Beyond those two checkpoints though, a large number of co-stimulatory or co-inhibitory molecules play major roles on tumor evasion from immunosurveillance. These molecules likely represent future targets of immunotherapy provided that the promise shown in early data is translated into improved patient survival in randomized trials. The biological role, prognostic and predictive implications regarding breast cancer and early clinical efforts on exploiting these immune-related therapeutic targets are herein reviewed.
31
PAULEVÉ, LOÏC, MORGAN MAGNIN, and OLIVIER ROUX. "Static analysis of Biological Regulatory Networks dynamics using abstract interpretation." Mathematical Structures in Computer Science 22, no. 4 (May 8, 2012): 651–85. http://dx.doi.org/10.1017/s0960129511000739.
Full textAbstract:
The analysis of the dynamics of Biological Regulatory Networks (BRNs) requires innovative methods to cope with the state-space explosion. This paper settles an original approach for deciding reachability properties based onProcess Hitting, which is a framework suitable for modelling dynamical complex systems. In particular, Process Hitting has been shown to be of interest in providing compact models of the dynamics of BRNs with discrete values. Process Hitting splits a finite number of processes into so-called sorts and describes the way each process is able to act upon (that is, to ‘hit’) another one (or itself) in order to ‘bounce’ it as another process of the same sort with further actions.By using complementary abstract interpretations of the succession of actions in Process Hitting, we build a very efficient static analysis to over- and under-approximate reachability properties, which avoids the need to build the underlying states graph. The analysis is proved to have a low theoretical complexity, in particular when the number of processes per sorts is limited, while a very large number of sorts can be managed.This makes such an approach very promising for the scalable analysis of abstract complex systems. We illustrate this through the analysis of a large BRN of 94 components. Our method replies quasi-instantaneously to reachability questions, while standard model-checking techniques regularly fail because of the combinatoric explosion of behaviours.
32
Nonami, Atsushi, Chen Zhao, Liu Qingsong, Kristen Cowens, Amanda L. Christie, Yongfei Chen, Martin Sattler, et al. "Identification of Wee1 and IGF-1R As Novel Therapeutic Targets for Mutant RAS-Driven Acute Leukemia By Combinatory Chemical Screens." Blood 124, no. 21 (December 6, 2014): 3502. http://dx.doi.org/10.1182/blood.v124.21.3502.3502.
Full textAbstract:
Abstract RAS mutations, especially in NRAS, are common in AML, identified in over 10% of the patients. The mutations lead to constitutive RAS activation and activation of multiple signaling pathways, including RAF/MAPK, PI3K-AKT/mTOR, and others. Many efforts to directly target RAS itself with small molecules have been unsuccessful. Thus, efforts have been directed at targeting canonical downstream effectors of RAS, such as RAF, MEK, and others. The complexity of RAS signaling, including redundancy and activation of compensatory pathways, makes it difficult to predict clinical effects. For example, RAF inhibitors increase proliferation of RAS-transformed cells by paradoxically increasing activation of MEK. In an effort to identify new therapeutic targets related to RAS, we designed a novel chemical screen to identify agents capable of potentiating the activity of the MEK inhibitor, AZD6244 (A), or the mTOR inhibitor, Torin1 (B). As a cell line to be used in the screen, BaF/3 cells were transformed with G12D mutants of NRAS or KRAS (Ba/F3-NRAS or Ba/F3-KRAS cells, respectively) and were shown to be exquisitely dependent on each oncogene for viability. Screen A: We identified the IGF-1R inhibitor, GSK1904529A, as able to selectively potentiate the effects of AZD6244 against mutant RAS-positive leukemia. GSK1904529A and AZD6244 synergized against mutant NRAS-expressing cell lines, OCI-AML3 and HL60, as well as active KRAS-expressing and -dependent cell lines, NOMO-1, NB4, and SKM-1, but not against wild-type (wt) RAS-expressing HEL or MOLM14 cells, or normal mononuclear cells. This result was confirmed with an additional IGF-1R inhibitor, NVP-AEW541, which exhibits 100-fold more selectivity toward IGF-1R than the insulin receptor (IR), and the specificity of IGF-1R as the target of these inhibitors was validated by knockdown (KD) of IGF-1R by shRNA. Mechanistically, IGF-1R protein expression/activity was substantially increased in mutant RAS-expressing cells, and suppression of RAS led to a decrease in IGF-1R. It is hypothesized that the increased IGF-1R levels observed in mutant RAS-expressing cells may contribute significantly to RAS transformation of hematopoietic cells. The synergy between MEK and IGF-1R inhibitors correlated with induction of apoptosis, inhibition of cell cycle progression, and decreased phospho-S6 and phospho-4E-BP1. In vivo, NSG mice tail vein-injected with OCI-AML3-luc+ cells showed significantly lower tumor burden following one week of daily oral administration of 50 mg/kg NVP-AEW541 combined with 25 mg/kg AZD6244, as compared to mice treated with either agent alone, and the combination was more toxic to mutant NRAS-expressing primary AML patient cells, compared to either agent alone. Screen B: We identified the Wee1 kinase inhibitor, MK-1775, which was unexpectedly found to potentiate mTOR inhibition of mutant RAS- leukemia. Wee1 is a protein kinase and inhibitory regulator of the G2/M checkpoint that prevents cells from going through mitosis by inhibiting the activity of CDK1. In response to DNA damage, Wee1 inactivates CDK1, thus leading to G2 arrest; this allows transformed cells the time needed for repair of damaged DNA and thus confers a survival advantage. The synergy was observed in both mutant NRAS- and mutant KRAS-positive AML cell lines and primary patient samples. The observed synergy enhanced dephosphorylation of AKT, 4E-BP1 and S6K, and correlated with increased apoptosis. The specificity of Wee1 as the target of MK-1775 was validated by Wee1 KD, as well as partial reversal of drug combination-induced apoptosis by inhibition of CDK1 by the CDK1 inhibitor, RO-3306. In a mouse in vivo xenotransplantation model, the combination treatment (10 mg/kg MK-1775 combined with 10 mg/kg Torin2) was more effective than single agents at suppressing the growth of NB4-luc cells that were tail vein-injected to NSG mice. The present studies suggest that combinations of drugs that simultaneously inhibit IGF-1R and MEK, or that inhibit Wee1 and mTOR, represent novel targeted therapeutic strategies for mutant RAS-positive leukemias. Disclosures No relevant conflicts of interest to declare.
33
HUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (March 2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.
Full textAbstract:
There is both a great unity and a great diversity in presentations of logic. The diversity is staggering indeed – propositional logic, first-order logic, higher-order logic belong to one classification; linear logic, intuitionistic logic, classical logic, modal and temporal logics belong to another one. Logical deduction may be presented as a Hilbert style of combinators, as a natural deduction system, as sequent calculus, as proof nets of one variety or other, etc. Logic, originally a field of philosophy, turned into algebra with Boole, and more generally into meta-mathematics with Frege and Heyting. Professional logicians such as Gödel and later Tarski studied mathematical models, consistency and completeness, computability and complexity issues, set theory and foundations, etc. Logic became a very technical area of mathematical research in the last half century, with fine-grained analysis of expressiveness of subtheories of arithmetic or set theory, detailed analysis of well-foundedness through ordinal notations, logical complexity, etc. Meanwhile, computer modelling developed a need for concrete uses of logic, first for the design of computer circuits, then more widely for increasing the reliability of sofware through the use of formal specifications and proofs of correctness of computer programs. This gave rise to more exotic logics, such as dynamic logic, Hoare-style logic of axiomatic semantics, logics of partial values (such as Scott's denotational semantics and Plotkin's domain theory) or of partial terms (such as Feferman's free logic), etc. The first actual attempts at mechanisation of logical reasoning through the resolution principle (automated theorem proving) had been disappointing, but their shortcomings gave rise to a considerable body of research, developing detailed knowledge about equational reasoning through canonical simplification (rewriting theory) and proofs by induction (following Boyer and Moore successful integration of primitive recursive arithmetic within the LISP programming language). The special case of Horn clauses gave rise to a new paradigm of non-deterministic programming, called Logic Programming, developing later into Constraint Programming, blurring further the scope of logic. In order to study knowledge acquisition, researchers in artificial intelligence and computational linguistics studied exotic versions of modal logics such as Montague intentional logic, epistemic logic, dynamic logic or hybrid logic. Some others tried to capture common sense, and modeled the revision of beliefs with so-called non-monotonic logics. For the careful crafstmen of mathematical logic, this was the final outrage, and Girard gave his anathema to such “montres à moutardes”.
34
Prokopov, Artem, Viktor Prokhorov, Tetiana Kalashnikova, Tetiana Golovko, and Hanna Bohomazova. "Constructing a model for the automated operative planning of local operations at railroad technical stations." Eastern-European Journal of Enterprise Technologies 3, no. 3 (111) (June 30, 2021): 32–41. http://dx.doi.org/10.15587/1729-4061.2021.233673.
Full textAbstract:
This paper has investigated the technology of forwarding local wagons at railroad technical stations and established the need to improve it given the extra downtime of local wagons. The main issue relates to the considerable combinatorial complexity of the tasks of operational planning. Another problem is that as part of the conventional approach, planning a station operation and planning a local operation at it is considered separately. Another planning issue is the lack of high-quality models for the preparation of initial data, in particular, data on the duration of technological operations, such as, for example, shunting operations involving local wagons forwarding. To resolve these issues, a new approach has been proposed, under which the tasks of operative planning of a technical station’s operation and its subsystem of local operations are tackled simultaneously, based on a single model. To this end, a mathematical model of vector combinatoric optimization has been built, which uses the criteria of total operating costs and wagon-hours spent at a station when forwarding local wagon flows, in the form of separate objective functions. Within this model, a predictive model was constructed in the form of a fuzzy inference system. This model is designed to determine the duration of shunting half-runs when executing the spotting/picking operations for delivering local wagons to enterprises’ goods sheds. The model provides for the accuracy level that would suffice at planning, in contrast to classical methods. A procedure has been devised for optimizing the planning model, which employs the modern genetic algorithm of vector optimization NSGA-III. This procedure is implemented in the form of software that makes it possible to build a rational operative plan for the operation of a technical station, including a subsystem of local operations, in graphic form, thereby reducing the operating costs by 5 % and the duration of maintenance of a local wagon by 8 %. The resulting effect could reduce the turnover time of a freight car in general on the railroad network, speed up the delivery of goods, and reduce the cost of transportation
35
Scully, Ziv, Tian-Yi Jiang, and Yan Zhang. "Firing Patterns in the Parallel Chip-Firing Game." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AT,..., Proceedings (January 1, 2014). http://dx.doi.org/10.46298/dmtcs.2421.
Full textAbstract:
International audience The $\textit{parallel chip-firing game}$ is an automaton on graphs in which vertices "fire'' chips to their neighbors. This simple model, analogous to sandpiles forming and collapsing, contains much emergent complexity and has connections to different areas of mathematics including self-organized criticality and the study of the sandpile group. In this work, we study $\textit{firing sequences}$, which describe each vertex's interaction with its neighbors in this game. Our main contribution is a complete characterization of the periodic firing sequences that can occur in a game, which have a surprisingly simple combinatorial description. We also obtain other results about local behavior of the game after introducing the concept of $\textit{motors}$. Le $\textit{parallel chip-firing game}$, c’est une automate sur les graphiques, dans lequel les sommets “tirent” des jetons à leurs voisins. Ce modèle simple, semblable aux tas de sable qui forment et s’affaissent, contient beaucoup de complexité émergente et a des connections avec différents domaines de mathématiques, incluant le $\textit{self-organized criticality}$ et l’étude du $\textit{sandpile group}$. Dans ce projet, on étudie les $\textit{firing sequences}$, qui décrivent les interactions de chaque sommet avec ses voisins dans le jeu. Notre contribution principale est une caractérisation complète des séquences de tir qui peuvent arriver dans une jeu, qui ont une description combinatoire assez simple. Nous obtenonsaussi d'autres résultats sur le conduite locale du jeu après l’introduction du concept des $\textit{motors}$.
36
Giuffrida, Tanguy, Eric Céret, Sophie Dupuy-Chessa, and Jean-Philippe Poli. "Fuzzy4U : un moteur d’adaptation en logique floue pour l’accessibilité des interfaces utilisateurs." Journal d'Interaction Personne-Système Volume 8, Issue 1, Special... (December 8, 2019). http://dx.doi.org/10.46298/jips.5957.
Full textAbstract:
International audience With the massive spread of Internet use, the accessibility of user interfaces (UI) is an ever more pressing need. Much work has been developed on this subject in order to define generic or situational accessibility recommendations and to propose tools for user interface adaptation. However, difficulties remain, particularly related to the complexity of possible contexts of use, such as the multiplicity of characteristics of the context of use, the imprecision of the values assigned to these characteristics and the combination of multiple adaptation rules. This article shows how a dynamic adaptation engine based on fuzzy logic can be used to implement accessibility recommendations. We show how this approach makes it possible to overcome these difficulties through fuzzy logic with the capacity to manage combinatorial rules, making it possible to take into account potentially complex contexts of use. This approach is illustrated with a concrete example. Avec la diffusion massive de l'utilisation d'Internet, l'accessibilité des interfaces est un besoin toujours plus prégnant. De nombreux travaux se sont penchés sur ce sujet afin de définir des recommandations d'accessibilité génériques ou situationnelles, et proposer des outils d'adaptation des interfaces utilisateurs. Cependant, des difficultés, notamment liées à la complexité des contextes d'usage possibles, demeurent tels que la multiplicité des caractéristiques du contexte d'usage, l'imprécision des valeurs attribuées à ces caractéristiques et la combinaison de multiples règles d'adaptation. Cet article montre comment un moteur d'adaptation dynamique basé sur la logique floue peut être utilisé pour implémenter les préconisations en accessibilité. Il montre comment cette approche permet de dépasser ces verrous grâce à la logique floue et sa gestion de la combinatoire des règles, permettant de prendre en compte un contexte d'usage potentiellement complexe que nous illustrons avec un exemple concret.
37
Frandsen, Gudmund Skovbjerg, and Carl Sturtivant. "What is an Efficient Implementation of the lambda-calculus?" DAIMI Report Series 20, no. 344 (February 1, 1991). http://dx.doi.org/10.7146/dpb.v20i344.6574.
Full textAbstract:
We propose to measure the efficiency of any implementation of the lambda-calculus as a function of a new parameter mu, that is itself a function of any lambda-expression. Complexity is expressed here as a function of nu just as runtime is expressed as a function of the input size n in ordinary analysis of algorithms. This enables implementations to be compared for worst case efficiency. We argue that any implementation must have complexity Omega(nu), i.e. a linear lower bound. Furthermore, we show that implementations based upon Turner Combinators of Hughes Super-combinators have complexities 2Omega(nu), i.e. an exponential lower bound. It is open whether any implementation of polynomial complexity, nu^0(1), exists, although some implementations have been implicitly claimed to have this complexity.
38
Bredikhin, B. A. "THE ASSESSMENT OF COMPLEXITY OF COMBINATORY METHOD OF NUMBERS’ FACTORIZATION." Polythematic Online Scientific Journal of Kuban State Agrarian University, December 29, 2017. http://dx.doi.org/10.21515/1990-4665-134-006.
Full text
39
"On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic." Reports on Mathematical Logic, no. 53 (2018). http://dx.doi.org/10.4467/20842589rm.18.002.8835.
Full text
40
Jeßberger, Nadja, Viktoria M. Krey, Corinna Rademacher, Maria-Elisabeth Böhm, Ann-Katrin Mohr, Monika Ehling-Schulz, Siegfried Scherer, and Erwin Märtlbauer. "From genome to toxicity: a combinatory approach highlights the complexity of enterotoxin production in Bacillus cereus." Frontiers in Microbiology 6 (June 10, 2015). http://dx.doi.org/10.3389/fmicb.2015.00560.
Full text
41
Haug, Dag. "Syntactic discontinuities in Latin – A treebank-based study." Bergen Language and Linguistics Studies 8, no. 1 (November 23, 2017). http://dx.doi.org/10.15845/bells.v8i1.1337.
Full textAbstract:
Syntactic discontinuities are very frequent in classical Latin and yet this data was never considered in debates on how expressive grammar formalisms need to be to capture natural languages. In this paper I show with treebank data that Latin frequently displays syntactic discontinuities that cannot be captured in standard mildly context-sensitive frameworks such as Tree-Adjoining Grammars or Combinatory Categorial Grammars. I then argue that there is no principled bound on Latin discontinuities but that they display a broadly Zipfian distribution where frequency drops quickly for the more complex patterns. Lexical-Functional Grammar can capture these discontinuities in a way that closely reflects their complexity and frequency distributions.
42
d'Antonio, Giacomo, and Emanuele Delucchi. "Combinatorial Topology of Toric arrangements." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AS,..., Proceedings (January 1, 2013). http://dx.doi.org/10.46298/dmtcs.2374.
Full textAbstract:
International audience We prove that the complement of a complexified toric arrangement has the homotopy type of a minimal CW-complex, and thus its homology is torsion-free. To this end, we consider the toric Salvetti complex, a combinatorial model for the arrangement's complement. Using diagrams of acyclic categories we obtain a stratification of this combinatorial model that explicitly associates generators in homology to the "local no-broken-circuit sets'' defined in terms of the incidence relations of the arrangement. Then we apply a suitably generalized form of Discrete Morse Theory to describe a sequence of elementary collapses leading from the full model to a minimal complex. On démontre que l’espace complémentaire d’un arrangement torique complexifié a le type d’homotopie d’un complexe CW minimal, donc que ses groupes d’homologie sont libres. On considère d’abord un modèle combinatoire du complémentaire de l’arrangement: le complexe de Salvetti torique. On obtient une stratification de ce complexe qui fait correspondre explicitement les générateurs d’homologie aux “circuits-non-rompus locaux” associés aux relations d’incidence de l’arrangement. On applique une forme généralisée de la théorie de Morse discrète pour obtenir une suite de collapsements élémentaires qui conduit à un complexe minimal.
43
Bos, Johan. "Is there a place for logic in recognizing textual entailment?" Linguistic Issues in Language Technology 9 (January 1, 2014). http://dx.doi.org/10.33011/lilt.v9i.1315.
Full textAbstract:
From a purely theoretical point of view, it makes sense to approach recognizing textual entailment (RTE) with the help of logic. After all, entailment matters are all about logic. In practice, only few RTE systems follow the bumpy road from words to logic. This is probably because it requires a combination of robust, deep semantic analysis and logical inference—and why develop something with this complexity if you perhaps can get away with something simpler? In this article, with the help of an RTE system based on Combinatory Categorial Grammar, Discourse Representation Theory, and first-order theorem proving, we make an empirical assessment of the logic-based approach. High precision paired with low recall is a key characteristic of this system. The bottleneck in achieving high recall is the lack of a systematic way to produce relevant background knowledge. There is a place for logic in RTE, but it is (still) overshadowed by the knowledge acquisition problem.