To see the other types of publications on this topic, follow the link: Intensional programming.
Journal articles on the topic 'Intensional programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 30 journal articles for your research on the topic 'Intensional programming.'
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
van Otterlo, Martijn. "Intensional dynamic programming. A Rosetta stone for structured dynamic programming." Journal of Algorithms 64, no. 4 (October 2009): 169–91. http://dx.doi.org/10.1016/j.jalgor.2009.04.004.
Full text
2
Galanaki, Chrysida, Christos Nomikos, and Panos Rondogiannis. "Game semantics for non-monotonic intensional logic programming." Annals of Pure and Applied Logic 168, no. 2 (February 2017): 234–53. http://dx.doi.org/10.1016/j.apal.2016.10.005.
Full text
3
Orgun, Mehmet A., and William W. Wadge. "Towards a unified theory of intensional logic programming." Journal of Logic Programming 13, no. 4 (August 1992): 413–40. http://dx.doi.org/10.1016/0743-1066(92)90055-8.
Full text
4
Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.091627.
Full text
5
Majkić, Zoran, and Bhanu Prasad. "Intensional FOL for reasoning about probabilities and probabilistic logic programming." International Journal of Intelligent Information and Database Systems 11, no. 1 (2018): 79. http://dx.doi.org/10.1504/ijiids.2018.10012745.
Full text
6
Cimiano, Philipp, Sebastian Rudolph, and Helena Hartfiel. "Computing intensional answers to questions – An inductive logic programming approach." Data & Knowledge Engineering 69, no. 3 (March 2010): 261–78. http://dx.doi.org/10.1016/j.datak.2009.10.008.
Full text
7
Plaice, John, Blanca Mancilla, and Gabriel Ditu. "From Lucid to TransLucid: Iteration, Dataflow, Intensional and Cartesian Programming." Mathematics in Computer Science 2, no. 1 (November 2008): 37–61. http://dx.doi.org/10.1007/s11786-008-0043-9.
Full text
8
HARRISON, AMELIA, and VLADIMIR LIFSCHITZ. "Stable models for infinitary formulas with extensional atoms." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 771–86. http://dx.doi.org/10.1017/s1471068416000314.
Full textAbstract:
AbstractThe definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions.
9
Balbiani, Philippe. "A Modal Semantics of Negation in Logic Programming." Fundamenta Informaticae 16, no. 3-4 (May 1, 1992): 231–62. http://dx.doi.org/10.3233/fi-1992-163-403.
Full textAbstract:
The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.
10
CABALAR, PEDRO, JORGE FANDINNO, LUIS FARIÑAS DEL CERRO, and DAVID PEARCE. "Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 390–405. http://dx.doi.org/10.1017/s1471068418000169.
Full textAbstract:
AbstractIn this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count,sum,maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the${\rm QEL}^=_{\cal F}$interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to definesumin terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the${\cal A}\mathit{log}$language, when we restrict to that syntactic fragment.
11
Fourtounis, Georgios, Nikolaos Papaspyrou, and Panagiotis Theofilopoulos. "Modular polymorphic defunctionalization." Computer Science and Information Systems 11, no. 4 (2014): 1417–34. http://dx.doi.org/10.2298/csis130923030f.
Full textAbstract:
Defunctionalization is generally considered a whole-program transformation and thus incompatible with separate compilation. In this paper, we formalize a modular variant of defunctionalization which can support separate compilation for a functional programming language with parametric polymorphism. Our technique allows modules in a Haskell-like language to be separately defunctionalized and compiled, then linked together to generate an executable program. We provide a prototype implementation of our modular defunctionalization technique and we discuss the experiences of its application in compiling a large subset of Haskell to low-level C code, based on the intensional transformation.
12
TRIVELLATO, DANIEL, NICOLA ZANNONE, and SANDRO ETALLE. "GEM: A distributed goal evaluation algorithm for trust management." Theory and Practice of Logic Programming 14, no. 3 (December 3, 2012): 293–337. http://dx.doi.org/10.1017/s1471068412000397.
Full textAbstract:
AbstractTrust management is an approach to access control in distributed systems where access decisions are based on policy statements issued by multiple principals and stored in a distributed manner. In trust management, the policy statements of a principal can refer to other principals' statements; thus, the process of evaluating an access request (i.e., a goal) consists of finding a “chain” of policy statements that allows the access to the requested resource. Most existing goal evaluation algorithms for trust management either rely on a centralized evaluation strategy, which consists of collecting all the relevant policy statements in a single location (and therefore they do not guarantee the confidentiality of intensional policies), or do not detect the termination of the computation (i.e., when all the answers of a goal are computed). In this paper, we present GEM, a distributed goal evaluation algorithm for trust management systems that relies on function-free logic programming for the specification of policy statements. GEM detects termination in a completely distributed way without disclosing intensional policies, thereby preserving their confidentiality. We demonstrate that the algorithm terminates and is sound and complete with respect to the standard semantics for logic programs.
13
DUNG, PHAN MINH, DO DUC HANH, and PHAN MINH THANG. "Stabilization of cooperative information agents in unpredictable environment: a logic programming approach." Theory and Practice of Logic Programming 6, no. 1-2 (January 2006): 1–22. http://dx.doi.org/10.1017/s1471068405002553.
Full textAbstract:
An information agent is viewed as a deductive database consisting of three parts: an observation database containing the facts the agent has observed or sensed from its surrounding environment;an input database containing the information the agent has obtained from other agents;an intensional database which is a set of rules for computing derived information from the information stored in the observation and input databases.Stabilization of a system of information agents represents a capability of the agents to eventually get correct information about their surrounding despite unpredictable environment changes and the incapability of many agents to sense such changes causing them to have temporary incorrect information. We argue that the stabilization of a system of cooperative information agents could be understood as the convergence of the behavior of the whole system toward the behavior of a “superagent”, who has the sensing and computing capabilities of all agents combined. We show that unfortunately, stabilization is not guaranteed in general, even if the agents are fully cooperative and do not hide any information from each other. We give sufficient conditions for stabilization. We discuss the consequences of our results.
14
NADATHUR, GOPALAN. "A treatment of higher-order features in logic programming." Theory and Practice of Logic Programming 5, no. 3 (May 2005): 305–54. http://dx.doi.org/10.1017/s1471068404002297.
Full textAbstract:
The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form of unification for probing their structures. These additions have important meta-programming applications but they also pose non-trivial implementation problems. One issue concerns the machine representation of lambda terms suitable to their intended use: an adequate encoding must facilitate comparison operations over terms in addition to supporting the usual reduction computation. Another aspect relates to the treatment of a unification operation that has a branching character and that sometimes calls for the delaying of the solution of unification problems. A final issue concerns the execution of goals whose structures become apparent only in the course of computation. These various problems are exposed in this paper and solutions to them are described. A satisfactory representation for lambda terms is developed by exploiting the nameless notation of de Bruijn as well as explicit encodings of substitutions. Special mechanisms are molded into the structure of traditional Prolog implementations to support branching in unification and carrying of unification problems over other computation steps; a premium is placed in this context on exploiting determinism and on emulating usual first-order behaviour. An extended compilation model is presented that treats higher-order unification and also handles dynamically emergent goals. The ideas described here have been employed in the Teyjus implementation of the $\lambda$Prolog language, a fact that is used to obtain a preliminary assessment of their efficacy.
15
Japaridze, Giorgi. "Arithmetics based on computability logic." Logical Investigations 25, no. 2 (December 23, 2019): 61–74. http://dx.doi.org/10.21146/2074-1472-2019-25-2-61-74.
Full textAbstract:
This paper is a brief survey of number theories based on em computability logic (CoL) a game-semantically conceived logic of computational tasks of resources. Such theories, termed em clarithmetics, are conservative extensions of first-order Peano arithmetic.
The first section of the paper lays out the conceptual basis of CoL and describes the relevant fragment of its formal language, with so called parallel connectives, choice connectives and quantifiers, and blind quantifiers. Both syntactically and semantically, this is a conservative generalization of the language of classical logic.
Clarithmetics, based on the corresponding fragment of CoL in the same sense as Peano
arithmetic is based on classical logic, are discussed in the second section. The axioms and inference rules of the system of clarithmetic named ${\bf CLA11}$ are presented, and the main results on this system are stated: constructive soundness, extensional completeness, and intensional completeness.
In the final section two potential applications of clarithmetics are addressed: clarithmetics as declarative programming languages in an extreme sense, and as tools for separating computational complexity classes. When clarithmetics or similar CoL-based theories are viewed as programming languages, programming reduces to proof-search, as programs can be mechanically extracted from proofs; such programs also serves as their own formal verifications, thus fully neutralizing the notorious (and generally undecidable) program verification problem. The second application reduces the problem of separating various computational complexity classes to separating the corresponding versions of clarithmetic, the potential benefits of which stem from the belief that separating theories should generally be easier than separating complexity classes directly.
16
MØGELBERG, RASMUS E., and MARCO PAVIOTTI. "Denotational semantics of recursive types in synthetic guarded domain theory." Mathematical Structures in Computer Science 29, no. 3 (May 15, 2018): 465–510. http://dx.doi.org/10.1017/s0960129518000087.
Full textAbstract:
Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging. This paper is part of a project on formulating denotational semantics in type theories with guarded recursion. This should have the benefit of not only giving simpler semantics and proofs of properties such as adequacy, but also hopefully in the future to scale to languages with advanced features, such as general references, outside the reach of traditional domain theoretic techniques.Working inGuarded Dependent Type Theory(GDTT), we develop denotational semantics for Fixed Point Calculus (FPC), the simply typed lambda calculus extended with recursive types, modelling the recursive types of FPC using the guarded recursive types ofGDTT. We prove soundness and computational adequacy of the model inGDTTusing a logical relation between syntax and semantics constructed also using guarded recursive types. The denotational semantics is intensional in the sense that it counts the number of unfold-fold reductions needed to compute the value of a term, but we construct a relation relating the denotations of extensionally equal terms, i.e., pairs of terms that compute the same value in a different number of steps. Finally, we show how the denotational semantics of terms can be executed inside type theory and prove that executing the denotation of a boolean term computes the same value as the operational semantics of FPC.
17
CHAPMAN, JAMES, TARMO UUSTALU, and NICCOLÒ VELTRI. "Quotienting the delay monad by weak bisimilarity." Mathematical Structures in Computer Science 29, no. 1 (October 17, 2017): 67–92. http://dx.doi.org/10.1017/s0960129517000184.
Full textAbstract:
The delay datatype was introduced by Capretta (Logical Methods in Computer Science, 1(2), article 1, 2005) as a means to deal with partial functions (as in computability theory) in Martin-Löf type theory. The delay datatype is a monad. It is often desirable to consider two delayed computations equal, if they terminate with equal values, whenever one of them terminates. The equivalence relation underlying this identification is called weak bisimilarity. In type theory, one commonly replaces quotients with setoids. In this approach, the delay datatype quotiented by weak bisimilarity is still a monad–a constructive alternative to the maybe monad. In this paper, we consider the alternative approach of Hofmann (Extensional Constructs in Intensional Type Theory, Springer, London, 1997) of extending type theory with inductive-like quotient types. In this setting, it is difficult to define the intended monad multiplication for the quotiented datatype. We give a solution where we postulate some principles, crucially proposition extensionality and the (semi-classical) axiom of countable choice. With the aid of these principles, we also prove that the quotiented delay datatype delivers free ω-complete pointed partial orders (ωcppos).Altenkirch et al. (Lecture Notes in Computer Science, vol. 10203, Springer, Heidelberg, 534–549, 2017) demonstrated that, in homotopy type theory, a certain higher inductive–inductive type is the free ωcppo on a type X essentially by definition; this allowed them to obtain a monad of free ωcppos without recourse to a choice principle. We notice that, by a similar construction, a simpler ordinary higher inductive type gives the free countably complete join semilattice on the unit type 1. This type suffices for constructing a monad, which is isomorphic to the one of Altenkirch et al. We have fully formalized our results in the Agda dependently typed programming language.
18
Duží, Marie. "Negation and presupposition, truth and falsity." Studies in Logic, Grammar and Rhetoric 54, no. 1 (June 1, 2018): 15–46. http://dx.doi.org/10.2478/slgr-2018-0014.
Full textAbstract:
Abstract There are many kinds of negation and denial. Perhaps the most common is the Boolean negation not that applies to propositions-in-extension, i.e. truth-values. The others are, inter alia, the property of propositions of not being true which applies to propositions; the complement function which applies to sets; privation which applies to properties; negation as failure applied in logic programming; negation as argumentation ad absurdum, and many others. The goal of this paper is neither to provide a complete list, nor to analyse all of them. Rather, I am going to deal with negation of propositions that come attached with a presupposition that is entailed by the positive as well as negated form of a given proposition. However, there are two kinds of negation, namely internal and external negation. I am going to prove that while the former is presupposition-preserving, the latter is presupposition-denying. This issue has much in common with the difference between topic and focus articulation within a sentence. Whereas articulating the topic of a sentence activates a presupposition, articulating the focus frequently yields merely an entailment. The main contribution of this paper is the proof that the two kinds of negation are not equivalent. While the Russellian wide-scope (external) negation gets the truthconditions of a sentence right for a subject occurring as a focus, Strawsonian narrow-scope (internal) negation is validly applicable for a subject occurring as the topic. I also deal with other kinds of presupposition triggers, in particular factive attitudes and prerequisites of a given property. My background theory is Transparent Intensional Logic (TIL). TIL is an expressive logic apt for the analysis of sentences with presuppositions, because in TIL we work with partial functions, in particular with propositions with truth-value gaps. Moreover, the procedural semantics of TIL make it possible to uncover the hidden semantic features of sentences, make them explicit and logically tractable.
19
Wang, Shuang Li, Cheng Jun Xie, Su Yan, Shu Ying Zhang, and Yue Gao. "Philosophical Perspective of Object-Oriented Programming." Applied Mechanics and Materials 543-547 (March 2014): 3141–45. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3141.
Full textAbstract:
Object-oriented method has been carried on the deep philosophical thinking, starting from thinking mode in combination with the real things, so the mapping relationship between real things and Object-oriented Programming is expounded, the essential feature of Object-oriented Programming is revealed. The objectivity, adaptation, complexity and emergent property of Object-oriented Programming whose intension and extension are enlarged are investigated, at this time, its own development direction is specified. The paper explores Object-oriented Programming from the epistemological and methodological perspective, establishes a theoretical foundation for its scientific practice activities.
20
Wang, Huai Yu, and Shu Gui Liu. "A Collision Detection Algorithm Using AABB and Octree Space Division." Advanced Materials Research 989-994 (July 2014): 2389–92. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2389.
Full textAbstract:
NC lathe controls the action of the lathe through program control system, while programming mistakes may lead to collisions between NC lathe cutters and workpieces or fixtures. A collision detection system judge whether there are collisions ahead of time by means of reading the information of shape and pose of objects in processing environment, building a space model using CSG and acquring the movement intension of objects. Dividing the modeling space into space nodes using octree, building AABBs of objects to be tested and locating them at certain space nodes, only objects at the same node or the same father node need to be tested, thus testing speed is raised.
21
Lee, Jong-Hyun, Javad Rahimipour Anaraki, Chang Wook Ahn, and Jinung An. "Efficient classification system based on Fuzzy–Rough Feature Selection and Multitree Genetic Programming for intension pattern recognition using brain signal." Expert Systems with Applications 42, no. 3 (February 2015): 1644–51. http://dx.doi.org/10.1016/j.eswa.2014.09.048.
Full text
22
Bulíček, Josef. "Timetable synchronisation: Urban public transport in busy hubs of long-distance transport." MATEC Web of Conferences 239 (2018): 02001. http://dx.doi.org/10.1051/matecconf/201823902001.
Full textAbstract:
The article is focused on timetable synchronization problem. Interconnection of urban public transport and long-distance transport in busy hubs is researched. Intension is to find adequate time positions of urban public transport arrivals and departures with an effort to minimize passengers’ time loss related to this interchange. Timetable of long distance transport is considered as constant (given). Timetable of urban public transport is result of optimization (and presupposed to be periodic). Nonlinear integer mathematical programming model is formulated. Model is implemented in Microsoft Excel Solver. Parallel way based on exhaustive-search algorithm is introduced as well. This algorithm provides extended set of output data able to be used in transport planning. Two different criterions are proposed. Each interchange (pair of vehicles) has the same weight in the case of uniform approach. Intensity approach considers interchanges as weighted by numbers of interchanging passengers. Some additional modifications of proposed model are mentioned for possibility to regard some important technological aspects and to reach more individualized solution. Model is illustrated by the case study located to Pardubice main station as a hub of passenger railway transport. Interface with urban public transport is mentioned as an illustrational example of synchronization.
23
B.K, Anish, Niranjan Devkota, Nabaraj Gautam, and Niraj Paija. "Industry Willingness to Pay for Adequate Electricity Supply: A Discourse on Sustainable Industrial Development." Quest Journal of Management and Social Sciences 1, no. 2 (December 31, 2019): 251–59. http://dx.doi.org/10.3126/qjmss.v1i2.27443.
Full textAbstract:
Background: Hopefully, if rest of things work as expected, the adequate supply of electricity, as one of the major industrial energy inputs, plays vital role in determining the industrial production, at large. In this paper, the present researchers assumed that the present state of scarcity of electricity may reveal their higher level of willingness to pay for higher energy efficient ratio as a pay-off of their improved industrial productivity. It is a proven fact that as one of the dominant indicators of national economic development and prosperity, effective electricity management procedures for industry increases significantly the productivity and operational efficiency.
Objectives: The present paper attempts to explore the willingness of industrialists to pay more for adequate electricity supply for the industrial purpose in the present context of Nepal.
Methods: Extensive desk review was carried out with a directed intension to develop insights on effective management of energy supply-related activities in industrial sector by analyzing the advances and trends as well as synergies in different intervention areas.
Findings: A large number of academic and professional research works are carried out by different researchers on electricity management, with focus on identification of energy management models, corresponding to the industrial sector that shows individual attributes, social contexts, as well as participation and knowledge, which can have cumulative effect on WTP.WTP for adequate electricity is one of the key measures for sustainable economic growth for reliable and sensible management of forecasted energy demand.
Conclusions: In spite of plethora of literature on electricity management and WTP, the solutions presented by different researchers are limited in scope. Still many researchers are working on tool contributions, but most of them are only providing solutions for specific regions and communities. There is a need to develop a generic electricity management system with tracing the industrialists’ willingness to pay for adequate electricity supply in a customized manner as a generic solution. The present researcher is hopeful that this work accomplishes this need.
Implications: Required strict policy regulations at governing level and effective programming at implementation at industry level.
24
Zhong, Hui, Weili Bao, Yunfeng Liu, and Karina Yazdanbakhsh. "Inflammation Response Cytokines IFN-γ and IL-10 Regulate Monocyte Subset Differentiation." Blood 134, Supplement_1 (November 13, 2019): 3586. http://dx.doi.org/10.1182/blood-2019-129515.
Full textAbstract:
Circulating monocytes comprise of a heterogeneous and functionally-diverse cell population which based on surface markers can be divided into three subsets: classical (CMo), intermediate (IMo), and non-classical monocytes/patrolling monocytes (PMo). The frequency/number, gene expression profile and activity of IMo and PMo significantly change in a variety of inflammatory diseases with the changes associated with disease risk and severity as well as response to treatment. While it is believed that CMo differentiate into IMo and that IMo further differentiate into PMo, there is paucity of data on the mechanisms that alter CMo to IMo/PMo differentiation profiles in these conditions. In addition, factors which induce human and mouse IMo and PMo differentiation have yet to be identified. To screen cytokine/chemokine candidates affecting IMo/PMo differentiation, human monocytes were isolated from healthy donors (HD) and cultured with candidates (22 cytokines/chemokines) for 3 days. On day 3, IMo/PMo marker expression was examined by flow cytometry focusing on candidate molecules that led to increased expression of markers (CD16, CX3CR1, CD11c, HO-1, HLA-DR) whose levels are normally found to be higher in IMo/PMo and to decrease in expression of markers (CD14, CD36, CCR2) which are expressed at higher level in CMo as measured by mean fluorescence intension (MFI). We found that of all molecules tested, only two , IFN-γ and IL-10, had significant effects: IFN-γ (10ng/ml) increased expression of CX3CR1 (20 fold), CD16 (60%), HLADR (15%) and inhibited CD36 (42% inhibition) and CD14 expression (45% inhibition) while IL-10 (10ng/ml) increased CD16 (3.3 fold), CD11c (45%), HO-1 (59%) and CX3CR1 (6 fold) expression and inhibited CCR2 (60% inhibition) expression. These data suggest that IFN-γ and IL-10, two key cytokines involved in sterile and infectious inflammation, induce IMo and PMo differentiation. To test whether the effect of IFN-γ and IL-10 in human in vitro cultures can be replicated in vivo, wildtype B6 mice were I.V. injected with IFN-γ or IL-10 for 3 days: IFN-γ, IL-10, or the same volume of PBS. The frequencies of monocyte subsets in blood (gated on CD45+Ly6G-CD11bhighCD115+ for total monocyte population and CMo/IMo/PMo based on Ly6C expression level) on day 4 were analyzed by flow cytometry. We found that IFN-γ (2.5μg/injection/mice twice/day) significantly increased IMo frequencies (from 12% to 35%) but decreased PMo frequencies (from 38% to 26%) while IL-10 (0.25μg/injection/mice twice/day) significantly induced PMo differentiation (from 38% to 63%) without effect on IMo frequencies. The data suggest that IFN-γ increases IMo frequency by simultaneously inducing CMo differentiation into IMo and inhibiting IMo differentiation into PMo. We have previously reported lower PMo frequency in patients with sickle cell disease (SCD), considered an inflammatory disease with altered immune profiles. To test whether altered differentiation programming of IMo/PMo may contribute to reduced PMo frequency in SCD, we analyzed the frequency of CMo/IMo/PMo at baseline and after IFN-γ or IL-10 injection to mimic an inflammatory response in AA mice (expressing normal human hemoglobin) and SS mice (expressing human SCD hemoglobin). We found significantly lower IMo frequency before treatment (AA vs SS:15.0% vs 9.2%) but also lower induction of IMo following IFN-γ treatment in SS mice (18%) relative to AA mice (35%), suggesting that IFN-γ inhibition of IMo differentiation into PMo in SCD is impaired. Furthermore, IL-10 was less effective in inducing PMo in SS as compared to AA mice (SS vs AA: 40% vs 60%). These data suggest that IFN-γ or IL-10-mediated monocyte differentiation in SCD is altered. Altogether, these data have unraveled a novel role for IFN-γ or IL-10, two key cytokines known to be induced during an inflammatory response, in monocyte differentiation, and suggest that IMo/PMo differentiation in a chronic inflammatory disease such as SCD may be defective due to altered response to IFN-γ and IL-10, opening up the potential for identification of novel therapeutic targets for IMo/PMo associated diseases including SCD. Disclosures No relevant conflicts of interest to declare.
25
Lappin, Shalom. "Intensions as Computable Functions." Linguistic Issues in Language Technology 9 (January 1, 2014). http://dx.doi.org/10.33011/lilt.v9i.1323.
Full textAbstract:
Classical intensional semantic frameworks, like Montague’s Intensional Logic (IL), identify intensional identity with logical equivalence. This criterion of co-intensionality is excessively coarse-grained, and it gives rise to several well-known difficulties. Theories of fine-grained intensionality have been been proposed to avoid this problem. Several of these provide a formal solution to the problem, but they do not ground this solution in a substantive account of intensional difference. Applying the distinction between operational and denotational meaning, developed for the semantics of programming languages, to the interpretation of natural language expressions, offers the basis for such an account. It permits us to escape some of the complications generated by the traditional modal characterization of intensions.
26
Yamada, Norihiro, and Samson Abramsky. "Dynamic game semantics." Mathematical Structures in Computer Science, December 18, 2020, 1–60. http://dx.doi.org/10.1017/s0960129520000250.
Full textAbstract:
Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms an instance of a bicategorical generalisation of the standard interpretation of functional programming languages in cartesian closed categories. This work is intended to be a step towards a mathematical foundation of intensional and dynamic aspects of logic and computation; it should be applicable to a wide range of logics and computations.
27
HILLERSTRÖM, DANIEL, SAM LINDLEY, and ROBERT ATKEY. "Effect handlers via generalised continuations." Journal of Functional Programming 30 (2020). http://dx.doi.org/10.1017/s0956796820000040.
Full textAbstract:
Abstract Plotkin and Pretnar’s effect handlers offer a versatile abstraction for modular programming with user-defined effects. This paper focuses on foundations for implementing effect handlers, for the three different kinds of effect handlers that have been proposed in the literature: deep, shallow, and parameterised. Traditional deep handlers are defined by folds over computation trees and are the original construct proposed by Plotkin and Pretnar. Shallow handlers are defined by case splits (rather than folds) over computation trees. Parameterised handlers are deep handlers extended with a state value that is threaded through the folds over computation trees. We formulate the extensions both directly and via encodings in terms of deep handlers and illustrate how the direct implementations avoid the generation of unnecessary closures. We give two distinct foundational implementations of all the kinds of handlers we consider: a continuation-passing style (CPS) transformation and a CEK-style abstract machine. In both cases, the key ingredient is a generalisation of the notion of continuation to accommodate stacks of effect handlers. We obtain our CPS translation through a series of refinements as follows. We begin with a first-order CPS translation into untyped lambda calculus which manages a stack of continuations and handlers as a curried sequence of arguments. We then refine the initial CPS translation by uncurrying it to yield a properly tail-recursive translation and then moving towards more and more intensional representations of continuations in order to support different kinds of effect handlers. Finally, we make the translation higher order in order to contract administrative redexes at translation time. Our abstract machine design then uses the same generalised continuation representation as the CPS translation. We have implemented both the abstract machine and the CPS transformation (plus extensions) as backends for the Links web programming language.
28
Meshalkin, V. P., and V. I. Bobkov. "Power and Resourse Efficient Envoronmentally Safe Technology for Processing Dumps of Technogenic Waste From Ore-Dressing and Processing Enterprises." KnE Materials Science, December 31, 2020. http://dx.doi.org/10.18502/kms.v6i1.8098.
Full textAbstract:
This research proposes a systematic approach for the analysis of volumes, physicochemical, granulometric, lithologic and thermal characteristics of waste from ore-dressing and processing enterprises stored in the dumps (tailing dumps) of ore-dressing and processing plants to assess the economic potential of its use in the system of complex power and resource efficient environmentally safe processing including palletizing machines, conveyor indurating machines and ore–thermal furnaces. The obtained results allow the authors to formulate the basic engineering, technological, economic and environmental requirements for complex chemical and power engineering systems of processing technogenic waste from ore-dressing and processing plants, these results make it also possible to define the degree of variability for the characteristics of the waste lots from various dumps. The paper describes the developed intensional and mathematical formulations for the multiscale problem of optimizing chemical and power engineering processes of technogenic raw materials processing in a complex chemical and power engineering system as a problem for discrete dynamic programming. The distinctive feature of this problem is to take into account the spatio-temporal multistage processing in a moving multilayer mass of pelletized raw material, the intensity of the process of internal moisture transfer and the variables for the control flow of the heat carrier gas. It allows increasing power efficiency by intensifying heat and mass transfer processes of multilayer drying, calcination and sintering. The criterion of the efficiency is the minimum cost of electric and thermal energy spent on processing. The obtained results were used to calculate power efficient environmentally safe processing of technogenic waste from ore-dressing and processing enterprises dumps. It was defined that heat and mass transfer processes are intensified, power consumption is reduced and the quality of the finished product is increased in the conditions of optimal power and resource efficient operation for the processing system.
Keywords: tecnhogenic waste, waste processing, ore-dressing and processing plant, power and resource efficiency, optimization, system analysis, environmentally safety
29
"Leaf Disease Detection using Labview Imaq Vision." Regular 9, no. 3 (September 30, 2020): 481–92. http://dx.doi.org/10.35940/ijrte.c4574.099320.
Full textAbstract:
The intension of our project is to design a system which can identify the good leaves from the diseased ones. Image processing is a powerful tool capable of many applications. Image processing combined with Machine Vision can simulate and execute real time projects. In this project we have used LabVIEW along with IMAQ Vision to acquire real time images and process them. LabVIEW IMAQ Vision is potentially useful for agricultural products since it combines the merits of both LabVIEW and IMAQ Vision, which have graphical programming environment and rich image processing functions. The project aims to provide a brief introduction into the IMAQ vision components like Image Acquisition, Calibration, Defect detection. Major leaf diseases’ symptoms include spots or discolouration of leaves. The presence or absence of macro and micro nutrients, bug infestation and other diseases can be identified through leaves. In this project we have obtained the images through LabVIEW IMAQ vision pallet. Further on two procedures were followed – one based on colour of the leaves and other is based on spots and patterns present on the leaves. For the discolouration we first split the image into its constituent planes- RGB and CMYK, here we used Green, Cyan and Yellow planes. Then on we decided a threshold based on sample data using Linear Regression based prediction model of Machine Learning to classify the data into three states – safe, risk and high risk.The second method was detecting spots. First, we split the images into its constituent planes to convert the RGB image to Greyscale and increase the contrast using the Colour Plane Extraction tool then use the Look up table tool to further enhance the contrast. Then on locate the bright objects and then using dilation from the Morphology tool box we increase the size of the spots to increase detection rate. Using Advanced Morphology tool box we removed the boundary objects to isolate the spots. Then using the shape detection or circle detection algorithm we can detect the spots. Several samples were obtained and are successfully classified. Finally, current limitations and likely future development trends are discussed. Combining LabVIEW along with different programming algorithms can help in raising the accuracy of the system.
30
"Software Test Case Generation and it’s curtail using G-Genetic Algorithm." International Journal of Recent Technology and Engineering 8, no. 2 (July 30, 2019): 852–55. http://dx.doi.org/10.35940/ijrte.a3400.078219.
Full textAbstract:
Project is a collection of similar activities that are going to be executed in certain order. Among the phases of project management testing show business crucial role. The intension of testing is not to prove the correctness; it is the process of verifying and validation. Software Testing is the most challenging job among all the peers of the industry. Exhaustive software Testing is never possible only Optimized software testing is possible. Hence Software Testing can be viewed as optimization problem as it fall under NP complete. Because of the extensive number of experiments that are required to perform adequate testing of the ideal programming application; the different strategies to decrease the test suite is required. One of the normal contemplated strategies is evacuating the repetitive experiments; the reason is insignificant number of experiments and greatest number of mistakes seclusion or revealing. In this exploration work consider is directed to address the usage and viability of G-hereditary calculation so as to decrease the quantity of experiments that don't included unmistakable incentive in the mean of test inclusion or where the experiments can't separate blunders. Hereditary calculation is used in this work to help in limiting the experiments or streamlining the experiments, where the hereditary calculation creates the primer populace arbitrarily, computes the wellness esteem utilizing inclusion measurements, and after that particular the posterity in back to back ages utilizing hereditary tasks choice, traverse and transformation. The hereditary displaying activities are explicit and dependent on the task may fluctuate to ordinary Genetic calculation. This procedure of age is rehashed until there is no adjustment in the wellness esteems for two successive ages, when there is no adjustment in the information age for two emphases so union accomplished or a minimized test case is achieved. The results of study demonstrate that, genetic algorithms can significantly reduce the size of the test cases