China
Africa
Explore chapters and articles related to this topic
Introduction
Published in Randall L. Eubank, Ana Kupresanin, Statistical Computing in C++ and R, 2011
Randall L. Eubank, Ana Kupresanin
Again, the function will inherit from the STL binary_function class with its first template parameter being type g5, a second parameter of type string and a bool return type. The problem is that the function is a binary function and a unary function is what find_if requires.
Fragments of quasi-Nelson: residuation
Published in Journal of Applied Non-Classical Logics, 2023
4. The recent paper by Busaniche et al. (2022) introduces a very general twist construction based on the notion of Nelson conucleus, which allows one to obtain virtually all the known examples in the literature as special cases. The main idea is that the various twist representations may be obtained uniformly by employing a unary function that realises, on every algebra, a special interior operator (a conucleus). In many of the known cases, the conucleus is term definable from the basic algebraic operations (for instance on Nelson algebras it may be given by the map ), but (Busaniche et al., 2022) consider in general enriched algebras where the conucleus is explicitly added as primitive. This approach is extended to quasi-Nelson and other non-necessarily involutive algebras in Busaniche and Rivieccio (202x), suggesting that it might be successfully applied also to the setting of subreducts considered in the present paper.
DPL-based novel CMOS 1-Trit Ternary Full-Adder
Published in International Journal of Electronics, 2021
Aloke Saha, Rakesh Kumar Singh, Pragya Gupta, Dipankar Pal
The aforesaid idea as presented for T-AND (Figure 5) has been adopted to design CKT-I, CKT-II and CKT-III of Figure 6. The proposed DPL-based circuit for CKT-I (Z = 0) is shown in Figure 8. The circuit presented in Figure 8 has been divided into 6-segments (denoted by ‘Sg.’ as before) for the ease of structural analyses. Sg.-1 and Sg.-2 in Figure 8 are used to generate output corresponding to first column (X = 0) and first row (Y = 0) of Figure 7(b) respectively. Following identical procedure the segments 3, 4, 5 and 6 in Figure 8 generate outputs for (X = 1, Y = 1), (X = 2, Y = 1), (X = 1, Y = 2) and (X = 2, Y = 2) of Figure 7 respectively. The I/O relation of Unary function XU1 and XU1C is presented in Table 4 where ‘X’ represents the ternary input. Here, XU1C represents the STI of XU1. Both XU1 and XU1C are integral parts for segments 3, 4 and 5 in Figure 8. The proposed DPL-based circuit for XU1 and XU1C is shown in Figure 9. In Figure 9 the ternary input is ‘X’ and STI of ‘X’ is represented by‘X1’.
Reconstructor: a computer program that uses three-valued logics to represent lack of information in empirical scientific contexts
Published in Journal of Applied Non-Classical Logics, 2020
Going into the reconstruction of DM, its language can be defined as follows: Let ℒDM = ⟨B, T, ⇐, CL, q, v⟩ be a formal language such that B and T are set-symbols, ⇐ and CL are binary relations, q is a unary function and v is a binary function. Their intended interpretations (which are not part of the reconstruction, but I still give for clarity’s sake) are: B will denote a set of bodies (for example {b1, b2, b3}); T will denote a set of time instants (for instance {t1, t2}); ⇐ will denote an ordering of time instants; CL informs of the collisions that take place (for instance ⟨{b1, b2}, t1⟩ ∈ CL will mean that b1 and b2 collide immediately after t1); q is the volume function for bodies (e.g. q(b1) = 2 means that the volume of b1 is 2; for simplicity’s sake, I will assume volume always remains constant, so there is no need to give a time instant as argument to q); and v is the velocity function for a body at a given time (e.g. v(b1, t1) = 5).