To see the other types of publications on this topic, follow the link: Common Boolean Logic (CBL).
Journal articles on the topic 'Common Boolean Logic (CBL)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Common Boolean Logic (CBL).'
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
PinnikaVenkateswarlu and Kalpana Ragutla. "An Efficient SQRT Architecture of Carry Select Adder Design by HA and Common Boolean Logic." SSRG International Journal of Electronics and Communication Engineering 1, no. 8 (2014): 36–41. https://doi.org/10.5281/zenodo.33082.
Full textAbstract:
As we are aware that carry select adder is the fastest one amongdata processing element, on the other hand due to having pairs of ripple carry adder structure traditional carry select adder consumes more area. So proposed scheme is to developa low power and low area half adder based (CSLA) using simple using common Boolean logic (CBL), where it employs one half adders to perform the summation operation for the common Boolean logic (CBL) and carry zero respectively. Half adder and CBL have to be designed where half adder requires one XOR gate, one AND gate where CBL requires only one NOT as well as one OR gate. Here also architecures like 8-bit, 16-bit, 32-bit, 64-bit square root carry select adder (SQRT CSLA) is compared with regular one and modified also. The results show there is a great reduction in area and power consumption. Our work shows the better performance in case of minimized delay, less area and low power.The obtained results from the simulation clearly proves our proposed CSLAscheme is dominates the regular SQRT CSLA.
2
Priya, Meshram, Mahendra Mithilesh, and Jawarkar Parag. "Designed Implementation of Modified Area Efficient Enhanced Square Root Carry Select Adder." International Journal for Research in Emerging Science and Technology 2, no. 5 (2015): 96–99. https://doi.org/10.5281/zenodo.33092.
Full textAbstract:
In the design of Integrated Circuits, area occupancy plays a vital role because of increasing the necessity of portable systems. Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. In this paper, an area-efficient carry select adder by sharing the common Boolean logic term (CBL) with BEC is proposed. After logic simplification and sharing partial circuit, only one XOR gate and one inverter gate in each summation operation as well as one AND gate and one inverter gate in each carry-out operation are needed. Based on this modification a new modified 32-Bit Square-root CSLA (SQRT CSLA) architecture has been developed. The modified architecture has been developed using Common Boolean Logic(CBL). The proposed architecture has reduced area, power and delay.
3
Syed, Mustafaa M., M. Sathish, S. Nivedha, Magribatul Noora A. K. Mohammed, and Sifana T. Safrin. "Design of Carry Select Adder using BEC and Common Boolean Logic." Indian Journal of VLSI Design (IJVLSID) 1, no. 3 (2022): 5–9. https://doi.org/10.54105/ijvlsid.C1205.031322.
Full textAbstract:
Carry Select Adder (CSLA) is known to be the fastest adder among the conventional adder structure, which uses multiple narrow adders. CSLA has a great scope of reducing area, power consumption, speed and delay. From the structure of regular CSLA using RCA, it consumes large area and power. This proposed work uses a simple and dynamic Gate Level Implementation which reduces the area, delay, power and speed of the regular CSLA. Based on a modified CSLA using BEC the implementation of 8-b, 16-b, 32-b square root CSLA (SQRT CSLA) architecture have been developed. In order to reduce the area and power consumptionin a great way we proposed a design using binary to excess 1 converter (BEC). This paper proposes an dynamic method which replaces a BEC using Common Boolean Logic.
4
Priya, Meshram, and Sarode Prof.Mamta. "Designing of Modified Area Efficient Square Root Carry Select Adder(SQRT CSLA)." Journal of Emerging Technologies and Innovative Research 2, no. 3 (2015): 530–33. https://doi.org/10.5281/zenodo.33087.
Full textAbstract:
In the design of Integrated Circuits, The necessity of portable systems is increasing an area occupancy plays a vital role. Square Root Carry Select Adder (SQRT CSLA) is one of the fastest adders which is used in this data-processing processor to perform fast arithmetic functions. In this paper, an area-efficient square root carry select adder(SQRT CSLA design) by sharing Common Boolean logic term (CBL) is proposed The modified architecture has been developed using Binary to Excess-1 converter (BEC). Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed by using CBl. The proposed design has reduced area as well as power,but in this we study only for area with a slight increase in the delay.
5
Priya, Meshram, and Sarode Prof.Mamta. "Design of Modified Area Efficient Square Root Carry Select Adder (SQRT CSLA)." International Journal of Industrial Electronics and Electrical Engineering, no. 4 (June 17, 2015): 216–19. https://doi.org/10.5281/zenodo.33098.
Full textAbstract:
In the design of Integrated Circuits, The necessity of portable systems is increasing an area occupancy plays a vital role. Square Root Carry Select Adder (SQRT CSLA) is one of the fastest adders which is used in this data-processing processor to perform fast arithmetic functions. In this paper, an area-efficient square root carry select adder(SQRT CSLA design) by sharing Common Boolean logic term (CBL) is proposed The modified architecture has been developed using Binary to Excess-1 converter (BEC). Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed by using CBl. The proposed design has reduced area as well as power,but in this we study only for area with a slight increase in the delay.
6
A., Mounika, and Srinivasa Reddy K. "Designing and Performance Evaluation of Carry Select Adder." International Journal of VLSI System Design and Communication systems 3, no. 5 (2015): 0754–57. https://doi.org/10.5281/zenodo.48670.
Full textAbstract:
In electronics, adder is a digital circuit that performs addition of numbers. To perform fast arithmetic operations, carry select adder (CSA) is one of the fastest adder in processor architectures. This paper presents a modified carry select adder(CSA) that operates at low power and proves more area and delay efficient. Validation of the logic is done through extensive simulations for measuring the power and delay. Simple and efficient gate level modification is used in order to reduce the area, delay and power of CSA.The result analysis shows that the proposed structure(CSA CBL) is better than the conventional CSA and CSA with BEC.
7
Saini, Vikas K., Shamim Akhter, and Tanuj Chauhan. "Implementation, Test Pattern Generation, and Comparative Analysis of Different Adder Circuits." VLSI Design 2016 (June 8, 2016): 1–8. http://dx.doi.org/10.1155/2016/1260879.
Full textAbstract:
Addition usually affects the overall performance of digital systems and an arithmetic function. Adders are most widely used in applications like multipliers, DSP (i.e., FFT, FIR, and IIR). In digital adders, the speed of addition is constrained by the time required to propagate a carry through the adder. Various techniques have been proposed to design fast adders. We have derived architectures for carry-select adder (CSA), Common Boolean Logic (CBL) based adders, ripple carry adder (RCA), and Carry Look-Ahead Adder (CLA) for 8-, 16-, 32-, and 64-bit length. In this work we have done comparative analysis of different types of adders in Synopsis Design Compiler using different standard cell libraries at 32/28 nm. Also, the designs are analyzed for the stuck at faults (s-a-0, s-a-1) using Synopsis TetraMAX.
8
Wright, Adam, Skye Aaron, Allison B. McCoy, et al. "Algorithmic Detection of Boolean Logic Errors in Clinical Decision Support Statements." Applied Clinical Informatics 12, no. 01 (2021): 182–89. http://dx.doi.org/10.1055/s-0041-1722918.
Full textAbstract:
Abstract Objective Clinical decision support (CDS) can contribute to quality and safety. Prior work has shown that errors in CDS systems are common and can lead to unintended consequences. Many CDS systems use Boolean logic, which can be difficult for CDS analysts to specify accurately. We set out to determine the prevalence of certain types of Boolean logic errors in CDS statements. Methods Nine health care organizations extracted Boolean logic statements from their Epic electronic health record (EHR). We developed an open-source software tool, which implemented the Espresso logic minimization algorithm, to identify three classes of logic errors. Results Participating organizations submitted 260,698 logic statements, of which 44,890 were minimized by Espresso. We found errors in 209 of them. Every participating organization had at least two errors, and all organizations reported that they would act on the feedback. Discussion An automated algorithm can readily detect specific categories of Boolean CDS logic errors. These errors represent a minority of CDS errors, but very likely require correction to avoid patient safety issues. This process found only a few errors at each site, but the problem appears to be widespread, affecting all participating organizations. Conclusion Both CDS implementers and EHR vendors should consider implementing similar algorithms as part of the CDS authoring process to reduce the number of errors in their CDS interventions.
9
De Nijs, Roderick Sebastiaan, Christian Landsiedel, Dirk Wollherr, and Martin Buss. "Quadratization and Roof Duality of Markov Logic Networks." Journal of Artificial Intelligence Research 55 (March 25, 2016): 685–714. http://dx.doi.org/10.1613/jair.5023.
Full textAbstract:
This article discusses the quadratization of Markov Logic Networks, which enables efficient approximate MAP computation by means of maximum flows. The procedure relies on a pseudo-Boolean representation of the model, and allows handling models of any order. The employed pseudo-Boolean representation can be used to identify problems that are guaranteed to be solvable in low polynomial-time. Results on common benchmark problems show that the proposed approach finds optimal assignments for most variables in excellent computational time and approximate solutions that match the quality of ILP-based solvers.
10
Nandam, Krishna Sravani, K. Jamal, Anil Kumar Budati, Kiran Mannem, and Manchalla O. V. P. Kumar. "Design and analysis of Dadda multiplier with Common Boolean Logic." Materials Today: Proceedings 33 (2020): 4833–36. http://dx.doi.org/10.1016/j.matpr.2020.08.392.
Full text
11
Jain, Nikita, Jitendra Jain, and Krishna Kant. "Area Efficient High Speed Vedic Multiplier using Common Boolean Logic." International Journal of Computer Applications 132, no. 2 (2015): 46–48. http://dx.doi.org/10.5120/ijca2015907308.
Full text
12
McElhaney, Kevin W. "Activities for Students: Demonstrating Boolean Logic Using Simple Electrical Circuits." Mathematics Teacher 97, no. 2 (2004): 126–34. http://dx.doi.org/10.5951/mt.97.2.0126.
Full textAbstract:
The honors geometry classes at parkway North High School in Creve Coeur, Missouri, typically do a unit on Boolean logic operators as a precursor to the formal thinking required for geometric proofs. To provide a more direct and tangible connection of logic with a real-world application, I developed this enrichment activity. The activity uses simple electric circuits to model the basic logic operators AND and OR, thus allowing students to physically visualize the true-or-false patterns of compound logic statements, make conceptual connections between logical operators and the physics of electrical circuits, and gain an appreciation for the design of common electronic products.
13
S., Nithin, and Ramesh K.B. "Design of High Speed Carry Select Adder Using Kogge-Stone and Carry-Lookahead Adders." Recent Trends in Analog Design and Digital Devices 7, no. 3 (2024): 23–33. https://doi.org/10.5281/zenodo.13709580.
Full textAbstract:
<em>The adder is acknowledged as the fundamental component in various arithmetic and logical operations. In efforts to enhance operational efficiency, the Carry Select Adder (CSLA) has been devised. By integrating multiple high-speed adder logics within a conventional CSLA framework, operational speed is further enhanced. This study presents the design of a hybrid CSLA that amalgamates the advantages of both Kogge Stone Adder and Look Ahead Adder (CLA) methodologies to achieve superior performance. Kogge Stone Adder, distinguished for its rapid carry generation, is incorporated to bolster speed. Concurrently, Look Ahead Adders are strategically deployed in the initial stages of the enhanced adder to capitalize on their computational prowess, particularly beneficial for smaller bit numbers. A 64-bit hybrid CSLA is realized on the Xilinx Spartan 6 FPGA development board. The resultant modified hybrid carry select adder demonstrates notable improvements in speed and energy efficiency, surpassing conventional carry select adder implementations.</em>
14
M, Syed Mustafaa, Sathish M, Nivedha S, Magribatul Noora A K, and Safrin Sifana T. "Design of Carry Select Adder using BEC and Common Boolean Logic." Indian Journal of VLSI Design 1, no. 3 (2022): 5–9. http://dx.doi.org/10.54105/ijvlsid.c1205.031322.
Full textAbstract:
Carry Select Adder (CSLA) is known to be the fastest adder among the conventional adder structure, which uses multiple narrow adders. CSLA has a great scope of reducing area, power consumption, speed and delay. From the structure of regular CSLA using RCA, it consumes large area and power. This proposed work uses a simple and dynamic Gate Level Implementation which reduces the area, delay, power and speed of the regular CSLA. Based on a modified CSLA using BEC the implementation of 8-b, 16-b, 32-b square root CSLA (SQRT CSLA) architecture have been developed. In order to reduce the area and power consumption in a great way we proposed a design using binary to excess 1 converter (BEC). This paper proposes an dynamic method which replaces a BEC using Common Boolean Logic.
15
Zhang, Jinjin, Xiaoxia Zhou, Yan Zhang, and Lixing Tan. "Fuzzy Epistemic Logic: Fuzzy Logic of Doxastic Attitudes." Mathematics 13, no. 7 (2025): 1105. https://doi.org/10.3390/math13071105.
Full textAbstract:
In traditional epistemic logic—particularly modal logic—agents are often assumed to have complete and certain knowledge, which is unrealistic in real-world scenarios where uncertainty, imprecision, and the incompleteness of information are common. This study proposes an extension of the logic of doxastic attitudes to a fuzzy setting, representing beliefs or knowledge as continuous values in the interval [0, 1] rather than binary Boolean values. This approach offers a more nuanced and realistic modeling of belief states, capturing the inherent uncertainty and vagueness in human reasoning. We introduce a set of axioms for the fuzzy logic of doxastic attitudes, formalizing how agents reason with regard to uncertain beliefs. The theoretical foundations of this logic are established through proofs of soundness and completeness. To demonstrate practical utility, we present a concrete example, illustrating how the fuzzy logic of doxastic attitudes can model uncertain preferences and beliefs.
16
Yi, Xueli. "Application of CBL Teaching Method in Clinical Microbiology Laboratory Training for Residents." Contemporary Education Frontiers 3, no. 3 (2025): 75–79. https://doi.org/10.18063/cef.v3i3.802.
Full textAbstract:
Clinical microbiology laboratory training for residents has long faced the limitations of traditional Lecture-Based Learning (LBL), which is characterized by an overemphasis on technical operations, inadequate cultivation of clinical thinking, and a disconnection between testing and diagnosis, and treatment. In this study, a case-sharing teaching model based on Case-Based Learning (CBL) was introduced, and a hierarchical and progressive teaching framework was constructed. Using common clinical infection cases as a carrier, the study implemented case screening, data collection, analysis, and reporting, stepped problem discussion, and multidimensional evaluation feedback in stages. Teaching practice has shown that the CBL model significantly improves trainees’ clinical interpretation skills of test results, antimicrobial drug decision-making logic, and multispecialty collaboration awareness, while strengthening autonomous learning and evidence-based thinking skills.
17
PEARCE, DAVID, HANS TOMPITS, and STEFAN WOLTRAN. "Characterising equilibrium logic and nested logic programs: Reductions and complexity,." Theory and Practice of Logic Programming 9, no. 05 (2009): 565–616. http://dx.doi.org/10.1017/s147106840999010x.
Full textAbstract:
AbstractEquilibrium logic is an approach to non-monotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case ofnested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs intoquantified propositional logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted. Thus, quantified propositional logic is a fragment of second-order logic, and its formulas are usually referred to asquantified Boolean formulas(QBFs). We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some QBF such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are theconsistency problem,brave reasoningandskeptical reasoning. Additionally, we also provide encodings for testing equivalence of theories or programs under different notions of equivalence, viz.ordinary,stronganduniform equivalence. For all considered reasoning tasks, we analyse their computational complexity and give strict complexity bounds. Hereby, our encodings yield upper bounds in a direct manner. Besides this useful feature, our approach has the following benefits: First, our encodings yield auniform axiomatisationfor a variety of problems in a common language. Second, extant solvers for QBFs can be used as back-end inference engines to realise implementations of the encoded task in a rapid prototyping manner. Third, our axiomatisations also allow us to straightforwardly relate equilibrium logic with circumscription.
18
Chajda, Ivan, and Helmut Länger. "Basic semirings." Mathematica Slovaca 69, no. 3 (2019): 533–40. http://dx.doi.org/10.1515/ms-2017-0245.
Full textAbstract:
Abstract Basic algebras were introduced by Chajda, Halaš and Kühr as a common generalization of MV-algebras and orthomodular lattices, i.e. algebras used for formalization of non-classical logics, in particular the logic of quantum mechanics. These algebras were represented by means of lattices with section involutions. On the other hand, classical logic was formalized by means of Boolean algebras which can be converted into Boolean rings. A natural question arises if a similar representation exists also for basic algebras. Several attempts were already realized by the authors, see the references. Now we show that if a basic algebra is commutative then there exists a representation via certain semirings with involution similarly as it was done for MV-algebras by Belluce, Di Nola and Ferraioli. These so-called basic semirings, their ideals and congruences are studied in the paper.
19
Peterson, Douglas. "Cardinal functions on ultra products of Boolean algebras." Journal of Symbolic Logic 62, no. 1 (1997): 43–59. http://dx.doi.org/10.2307/2275731.
Full textAbstract:
This article is concerned with functions k assigning a cardinal number to each infinite Boolean algebra (BA), and the behaviour of such functions under ultraproducts. For some common functions k we havefor others we have ≤ instead, under suitable assumptions. For the function π character we go into more detail. More specifically, ≥ holds when F is regular, for cellularity, length, irredundance, spread, and incomparability. ≤ holds for π. ≥ holds under GCH for F regular, for depth, π, πχ, χ, h-cof, tightness, hL, and hd. These results show that ≥ can consistently hold in ZFC since if V = L holds then all uniform ultrafilters are regular. For π-character we prove two more results: (1) If F is regular and ess , then(2) It is relatively consistent to have , where A is the denumerable atomless BA.A thorough analysis of what happens without the assumption that F is regular can be found in Rosłanowski, Shelah [8] and Magidor, Shelah [5]. Those papers also mention open problems concerning the above two possible inequalities.
20
Solomko, Mykhailo. "Development of a non-standard system for simplifying boolean functions." Mathematics and Cybernetics - applied aspects 3, no. 4 (129) (2024): 6–34. http://dx.doi.org/10.15587/1729-4061.2024.305826.
Full textAbstract:
The object of this study is models of low-power digital logic circuits. The problem being solved is the effectiveness of the technique for simplifying Boolean functions to obtain optimal structures of logic circuits. A new theorem of a non-standard system of simplification of Boolean functions has been formulated, according to which in order to obtain a minimal function it will suffice to perform all non-redundant operations of simple and/or super-gluing of variables, which ultimately provides a minimal function in the main basis without using an implicant table. Thus, the problem of simplifying Boolean functions to the simplest normal equivalent is solved in one step. The interpretation of the result is that the properties of 2-(n, b)-design combinatorial systems make it possible to reproduce the definition of logical operations of super-gluing variables, to represent logical operations in a different way, and vice versa. This, in turn, ensures the establishment of the locations of equivalent transformations on the binary structure of the truth table and the implication of a systematic procedure for simplifying Boolean functions by an analytical method. Special feature of the results is that unambiguous identification of the locations of equivalent transformations is possible even when different intervals of the Boolean space containing the 2-(n, b)-design systems have common modules. It has been experimentally confirmed that the non-standard system improves the efficiency of simplifying Boolean functions, including partially defined ones, by 200–300 % compared to analogs. In terms of application, a non-standard system for simplifying Boolean functions will ensure the transfer of innovations to material production: from conducting fundamental research, expanding the capabilities of digital component design technology to organizing serial or mass production of novelties
21
Zia, Razia, Muzaffar Rao, Arshad Aziz, and Pervez Akhtar. "Efficient Utilization of FPGA Using LUT-6 Architecture." Applied Mechanics and Materials 241-244 (December 2012): 2548–54. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2548.
Full textAbstract:
Field Programmable gate array (FPGA) technology is continuously gaining market share and becoming essential part of the today’s modern embedded systems. The most common FPGA architecture consists of an array of logic blocks called Configurable Logic Block (CLB), I/O pads, and routing channels. In general, a logic block (CLB) consists of logical cells called Slices and other dedicated resources. A typical cell consists of LUTs (Look up table). In modern FPGAs, there are 6-input LUTs instead of 4-input LUTs. In this paper we present the use of 6-input LUT architecture for some Boolean functions (Mux8, Mux16, Mux32, Mux64, SOP64, OR40 and AND40).we show our results in terms of LUTs and Slices and these results are much better as compare to previously reported results that based on 4-input LUTs.
22
Chajda, Ivan. "Basic algebras, logics, trends and applications." Asian-European Journal of Mathematics 08, no. 03 (2015): 1550040. http://dx.doi.org/10.1142/s1793557115500400.
Full textAbstract:
The classical logic was axiomatized algebraically by means of Boolean algebras in 19th century by George Boole. Similar attempts went on 20th century for algebraic axiomatization of non-classical logics, e.g. intuitionistic logics (Brouwer and Heyting algebras), many-valued logics (Łukasiewicz, Chang’s MV-algebras, Post algebras), the logic of quantum mechanics (orthomodular lattices and posets) and fuzzy logics (residuated lattices). In this paper, we are focused in a common generalization of MV-algebras and orthomodular lattices. The resulting algebras, called basic algebras, have surprisingly strong and interesting properties and they can be investigated in their own. The aim of the paper is to get an overview of results reached during the last decade.
23
Kowalski, Tomasz, Francesco Paoli, and Matthew Spinks. "Quasi-subtractive varieties." Journal of Symbolic Logic 76, no. 4 (2011): 1261–86. http://dx.doi.org/10.2178/jsl/1318338848.
Full textAbstract:
AbstractVarieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras. Abstract algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every member A of a τ-regular variety the lattice of congruences of A is isomorphic to the lattice of deductive filters on A of the τ-assertional logic of . Moreover, if has a constant 1 in its type and is 1-subtractive, the deductive filters on A ∈ of the 1-assertional logic of coincide with the -ideals of A in the sense of Gumm and Ursini, for which we have a manageable concept of ideal generation.However, there are isomorphism theorems, for example, in the theories of residuated lattices, pseudointerior algebras and quasi-MV algebras that cannot be subsumed by these general results. The aim of the present paper is to appropriately generalise the concepts of subtractivity and τ-regularity in such a way as to shed some light on the deep reason behind such theorems. The tools and concepts we develop hereby provide a common umbrella for the algebraic investigation of several families of logics, including substructural logics, modal logics, quantum logics, and logics of constructive mathematics.
24
Ou, Qiao-Feng, Bang-Shu Xiong, Lei Yu, Jing Wen, Lei Wang, and Yi Tong. "In-Memory Logic Operations and Neuromorphic Computing in Non-Volatile Random Access Memory." Materials 13, no. 16 (2020): 3532. http://dx.doi.org/10.3390/ma13163532.
Full textAbstract:
Recent progress in the development of artificial intelligence technologies, aided by deep learning algorithms, has led to an unprecedented revolution in neuromorphic circuits, bringing us ever closer to brain-like computers. However, the vast majority of advanced algorithms still have to run on conventional computers. Thus, their capacities are limited by what is known as the von-Neumann bottleneck, where the central processing unit for data computation and the main memory for data storage are separated. Emerging forms of non-volatile random access memory, such as ferroelectric random access memory, phase-change random access memory, magnetic random access memory, and resistive random access memory, are widely considered to offer the best prospect of circumventing the von-Neumann bottleneck. This is due to their ability to merge storage and computational operations, such as Boolean logic. This paper reviews the most common kinds of non-volatile random access memory and their physical principles, together with their relative pros and cons when compared with conventional CMOS-based circuits (Complementary Metal Oxide Semiconductor). Their potential application to Boolean logic computation is then considered in terms of their working mechanism, circuit design and performance metrics. The paper concludes by envisaging the prospects offered by non-volatile devices for future brain-inspired and neuromorphic computation.
25
Eliawa, Ali i. "Using Geological and Topographic Maps in Site Selection of Solid Waste Disposal." Al-Mukhtar Journal of Sciences 37, no. 1 (2022): 29–40. http://dx.doi.org/10.54172/mjsc.v37i1.446.
Full textAbstract:
Currently, land shortage for solid waste in most urban areas is a significant and growing potential problem. Although some efforts are made to decrease and recover the waste, landfill is still the most common process for waste disposal. Site selection of solid waste dumping in urban areas is a serious subject because of its huge effect on the economy, ecology, and environmental health. Consequently, several criteria must be created because of the difficulty of the parameters to select the process for combination in social, environmental and technical parameters. In this research, the most appropriate sites for locating dumping garbage are determined using the Geographical Information System (GIS) by implementing both methods Boolean logic model and Index overlay model. Based on several objectives, a provided spatial data set consisting of several maps in the form of layers, such as land use, geological distribution, landslides, etc., were used in the modeling process to choose the best site to dump the garbage of Chinchina city that used as a case in this application. The findings show that the Boolean logic model identified only two areas that met the criteria, whereas the Index overlay model identified three important classes through weight; unsuitable, moderate and suitable regions for construction waste disposal.
26
Daeuk, Kim, Nessie Sobina Chiang Yu Maria, Rhay Vicerra Ryan, N.G. Naguib Raouf, and Concepcion II Ronnie. "Mathematical realization of diagnosing COVID-19 using Boolean Algebra on an array of colds-related symptoms." International Research Journal of Science, Technology, Education, and Management 2, no. 1 (2022): 1–14. https://doi.org/10.5281/zenodo.6496731.
Full textAbstract:
COVID-19 has caused countless deaths across the globe. In developing countries like the Philippines, limited access to health services like ICU beds and PCR tests contributed more to COVID-19 related deaths. It is for this reason that the researchers developed a simple COVID-19 diagnostic tool using basic logic gates to determine whether one has COVID-19 or other related illnesses like flu, colds, and allergy. The researchers first collected information regarding the common symptoms of COVID-19 and similar diseases. The identified symptoms cough, fever, fatigue, loss of taste, and smell were used as the inputs for the circuit, while CODI-19 and other related diseases served as the output. The classification of symptoms was divided into often, sometimes, rarely, and never. In order to generate binary digits, often and sometimes were considered positive symptoms (1) while rarely and never were considered negative (0). Minterms were determined through the truth table of the conceptualized circuit. Furthermore, these are used to generate the Karnaugh map. Consequently, simplifying the Boolean expression for each output variable. This is a mathematical realization through Boolean algebra. Through the logic circuit created from Boolean expression, the researchers were able to successfully predict the expected disease based on the existence of symptoms. Furthermore, the researchers were able to translate the circuit into its complementary metal-oxide-semiconductor (CMOS) counterpart. While the designed tool is affordable and can be easily implemented, however, it still possesses a limitation as other COVID-19 positive patients are asymptomatic. Furthermore, the diagnostic tool was not tested on real-world data. Hence, the accuracy of the tool is based on theoretical experiments only.
27
Fraser, C. J., and J. R. Thorpe. "Spreadsheet Applications for Modelling and Analysis in Mechanical Engineering." International Journal of Mechanical Engineering Education 24, no. 2 (1996): 124–36. http://dx.doi.org/10.1177/030641909602400206.
Full textAbstract:
This paper outlines a number of different applications of spreadsheet solutions to mechanical engineering problems involving ideal fluid flow, two-dimensional heat transfer, plate bending and torsion of non-circular sections. The general utility of a spreadsheet in handling finite difference equations is further illustrated in an application to simulate the dynamic response of a DC voltage controlled servo-motor. Finally, since most spreadsheets also incorporate the common logical operators then any arbitrary Boolean function can be manipulated with any range of input logic states. Details are therefore included in the paper on the application of a spreadsheet to simulate and test the operation of a prototype digital logic circuit. The educational advantages in using a spreadsheet are highlighted in the variety of engineering problems which can be solved without having to resort to the specialist and generally more expensive finite element software packages.
28
Michael, Emmett Brady. "Keynes, a Connoisseur of Boolean uncertainty and the limits of precise numbers." ISRG Journal of Economics, Business & Management (ISRGJEBM) II, no. I (2024): 62–66. https://doi.org/10.5281/zenodo.10653731.
Full textAbstract:
<em>Unfortunately, Jackson Lears’ June, 2023 article and 2023 book on Keynes’s applications and assessment of uncertainty and animal spirits, respectively, are based on the erroneous work of the Post Keynesian school of economics on uncertainty and animal spirits ,the foundation of which is the severely deficient work of F P Ramsey, I J Good ,R .Skidelsky ,G L S Shackle and Terrence Hutchison’s Pseudo Keynesians(Joan Robinson ,Austin Robinson, Richard Kahn, Roy Harrod). The many, many errors in Ramsey’s two reviews of 1922 and 1926 or in I J Good’s published work on Keynes between 1950-1990, concerning Keynes’ s logical theory of probability ,or in any article published by a Post Keynesian or heterodox economist , on Keynes’s 1921 A Treatise on Probability, are easily identified by any reader of Keynes’s A Treatise on Probability .Of course, this requires the reader to have been familiar with Keynes’s use of (a) Boole’s formal, mathematical, symbolic , relational ,propositional logic, introduced in chapters I and II of the A Treatise on Probability ,and which permeates Keynes’s A Treatise on Probability,(b) Keynes’s imprecise view of probability ,based on Boole’s lower and upper ,interval valued probability ,and (c) Keynes’s views on animal spirits ,which follow directly from Keynes’s understanding of Boole’s treatment of this topic in his The Laws of Thought.</em> <em>The main problem with all heterodox accounts of Keynes’s approach in his A Treatise on Probability /General Theory is their complete and total ignorance of Keynes’s Boolean based approach that Boole put forth in 1854 in his The Laws of Thought. Keynes always, in general, rejected mathematical expectations as unreasonable ,but he never ,ever propounded the Post Keynesian and Heterodox claims about basing decision making on comparative or ordinal probability. Keynes’s emphasis was on inexact measurement and approximation through the use of interval valued probability and/or decision weights, such as his conventional coefficient ,c. We can call Keynes’s approach to expectations “Logical “ or “Boolean “ expectations. Until this fundamental, basis fact is acknowledged by Post Keynesians and Heterodox economists, it will impossible for them be able to grasp what Hishiyama </em><em>termed ,in 1969,Keynes’s “new logic of uncertainty.” ,which has nothing to do with the Carabelli-Dow dual of an ordinary ,common, discourse logic and the Skidelsky-Moggridge-Lawson-Carabelli-O’Donnell clams about ordinal probability .Keynes’s logical expectations has everything to do with Boole’s formal, mathematical, symbolic relational, propositional logic and interval valued probabilities. Of course , this will not happen ,given the failure of Heterodox -Post Keynesian economists to read The Laws of Thought and A Treatise on Probability.</em>
29
Manuj, P., and B. Ramesh K. "Analysis of an Efficient Approach to Tolerate Soft Errors in Combinational Circuits." Journal of Control System and its Recent Developments 4, no. 3 (2022): 1–14. https://doi.org/10.5281/zenodo.6347706.
Full textAbstract:
<em>In recent years, soft errors happen in the combinational logic circuits that genuinely impact the action of digital frameworks. Hence, the soft error has ended up a matter of great concern for unwavering quality issues at show. To extend the soft error tolerance, this paper proposes a modern method that will diminish the failure rate of the combinational circuits. A method has been introduced which is able discover out the foremost common minterms of Boolean polynomial math. And these minterms are secured by different cubes to maximize the logical veiling probability, which reduces the failure rate of a combinational circuit. The experimental study appears how the probability of circuit failure is diminished for a given combinational circuit.</em>
30
Toffano, Zeno, and François Dubois. "Interpolating Binary and Multivalued Logical Quantum Gates." Proceedings 2, no. 4 (2017): 152. http://dx.doi.org/10.3390/ecea-4-05006.
Full textAbstract:
A method for synthesizing quantum gates is presented based on interpolation methods applied to operators in Hilbert space. Starting from the diagonal forms of specific generating seed operators with non-degenerate eigenvalue spectrum one obtains for arity-one a complete family of logical operators corresponding to all the one-argument logical connectives. Scaling-up to n-arity gates is obtained by using the Kronecker product and unitary transformations. The quantum version of the Fourier transform of Boolean functions is presented and a Reed-Muller decomposition for quantum logical gates is derived. The common control gates can be easily obtained by considering the logical correspondence between the control logic operator and the binary logic operator. A new polynomial and exponential formulation of the Toffoli gate is presented. The method has parallels to quantum gate-T optimization methods using powers of multilinear operator polynomials. The method is then applied naturally to alphabets greater than two for multi-valued logical gates used for quantum Fourier transform, min-max decision circuits and multivalued adders.
31
Artale, A., D. Calvanese, R. Kontchakov, and M. Zakharyaschev. "The DL-Lite Family and Relations." Journal of Artificial Intelligence Research 36 (October 15, 2009): 1–69. http://dx.doi.org/10.1613/jair.2820.
Full textAbstract:
The recently introduced series of description logics under the common moniker `DL-Lite' has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes: by (i) adding the Boolean connectives and (ii) number restrictions to concept constructs, (iii) allowing role hierarchies, (iv) allowing role disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity constraints, and (v) adopting or dropping the unique same assumption. We analyze the combined complexity of satisfiability for the resulting logics, as well as the data complexity of instance checking and answering positive existential queries. Our approach is based on embedding DL-Lite logics in suitable fragments of the one-variable first-order logic, which provides useful insights into their properties and, in particular, computational behavior.
32
Khan, Wilayat, Farrukh Aslam Khan, Abdelouahid Derhab, and Adi Alhudhaif. "CoCEC: An Automatic Combinational Circuit Equivalence Checker Based on the Interactive Theorem Prover." Complexity 2021 (May 25, 2021): 1–12. http://dx.doi.org/10.1155/2021/5525539.
Full textAbstract:
Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required. The most common approaches to equivalence checking are based on simulation and model checking, which are constrained due to the popular memory and state explosion problems. Furthermore, such tools are often not user-friendly, thereby making it tedious to check the equivalence of large formulas or circuits. An alternative is to use mathematical tools, called interactive theorem provers, to prove the equivalence of two circuits; however, this requires human effort and expertise to write multiple output functions and carry out interactive proof of their equivalence. In this paper, we (1) define two simple, one formal and the other informal, gate-level hardware description languages, (2) design and develop a formal automatic combinational circuit equivalence checker (CoCEC) tool, and (3) test and evaluate our tool. The tool CoCEC is based on human-assisted theorem prover Coq, yet it checks the equivalence of circuit descriptions purely automatically through a human-friendly user interface. It either returns a machine-readable proof (term) of circuits’ equivalence or a counterexample of their inequality. The interface enables users to enter or load two circuit descriptions written in an easy and natural style. It automatically proves, in few seconds, the equivalence of circuits with as many as 45 variables (3.5 × 10 13 states). CoCEC has a mathematical foundation, and it is reliable, quick, and easy to use. The tool is intended to be used by digital logic circuit designers, logicians, students, and faculty during the digital logic design course.
33
Liu, Jianxin, Yijun Li, Yongwei Yang, and Juntao Wang. "On Implicative Derivations of MTL-Algebras." Axioms 11, no. 7 (2022): 340. http://dx.doi.org/10.3390/axioms11070340.
Full textAbstract:
This paper introduces the implicative derivations and gives some of their characterizations on MTL-algebras. Furthermore, we provide some representation of MTL-algebras by implicative derivations and obtain some representation of Boolean algebra via the algebra of all implicative derivations. Finally, we explore the relationship between implicative derivation and other operators on MTL-algebras and show that there exists a bijection between the sets of multiplier and implicative derivations on IMTL-algebras. The results of this paper can provide the common properties of implicative derivations in the t-norm-based fuzzy logical algebras.
34
Cantone, Domenico, Marianna Nicolosi-Asmundo та Daniele Francesco Santamaria. "A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×". Fundamenta Informaticae 176, № 3-4 (2020): 349–84. http://dx.doi.org/10.3233/fi-2020-1977.
Full textAbstract:
In this paper we consider the most common TBox and ABox reasoning services for the description logic 𝒟ℒ〈4LQSR,x〉(D) ( 𝒟 ℒ D 4,× , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQSR. 𝒟 ℒ D 4,× is a very expressive description logic. It combines the high scalability and efficiency of rule languages such as the SemanticWeb Rule Language (SWRL) with the expressivity of description logics. In fact, among other features, it supports Boolean operations on concepts and roles, role constructs such as the product of concepts and role chains on the left-hand side of inclusion axioms, role properties such as transitivity, symmetry, reflexivity, and irreflexivity, and data types. We further provide a KE-tableau-based procedure that allows one to reason on the main TBox and ABox reasoning tasks for the description logic 𝒟 ℒ D 4,× . Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KEγ-tableau, turns out to be an improvement of the system introduced in [1] and of standard first-order KE-tableaux [2]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KEγ-tableau-based reasoner are up to about 400% better than the ones of the other two systems.
35
Douglas, Joy W., Jeannine C. Lawrence, and Adam P. Knowlden. "The use of fortified foods to treat malnutrition among older adults: a systematic review." Quality in Ageing and Older Adults 18, no. 2 (2017): 104–19. http://dx.doi.org/10.1108/qaoa-05-2016-0018.
Full textAbstract:
Purpose Food fortification with common kitchen ingredients has been suggested to improve nutritional intake. The purpose of this paper was to systematically review the efficacy of food fortification on calorie and protein intake among older adults. Design/methodology/approach A systematic search was conducted using Boolean search logic and seven research databases to identify interventions using fortified foods to increase calorie and protein intake among older adults. Ten studies published in English since 1996 were eligible for inclusion. Study quality was evaluated using an adapted Modified Jadad Questionnaire. Findings Food fortification was associated with increased calorie intake in eight studies, increased protein intake in five studies, and increased body weight in three studies. However, studies were limited by lack of rigor in methodology and small sample sizes. Originality/value Food fortification may improve calorie and protein intake, but results are limited by study weaknesses. Additionally, it is unclear whether improved intake results in improved clinical outcomes.
36
Duží, Marie. "Negation and presupposition, truth and falsity." Studies in Logic, Grammar and Rhetoric 54, no. 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.
37
Mengistu, Dechasa Adare, Addisu Alemu, Abdi Amin Abdukadir, Ahmed Mohammed Husen, Fila Ahmed, and Baredin Mohammed. "Incidence of Urinary Tract Infection Among Patients: Systematic Review and Meta-Analysis." INQUIRY: The Journal of Health Care Organization, Provision, and Financing 60 (January 2023): 004695802311687. http://dx.doi.org/10.1177/00469580231168746.
Full textAbstract:
Healthcare-associated infection is one of the most common and severe threats to patients’ health and remains a significant challenge for healthcare providers. Among healthcare-associated infections, urinary tract infection (UTI) is one of the most common infections. This study aimed to determine the global incidence of UTI among patients. The Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) guideline was used to perform this systematic review and meta-analysis. The articles were searched from April 4 to August 5, 2022, from electronic databases (Scopus, PubMed, Web of Science, Google Scholar, DOAJ, and MedNar) using Boolean logic operators, MeSH terms, and keywords. The quality of the study was assessed using the JBI Critical Assessment tool. One thousand nine ninety three articles were retrieved from the electronic databases, of which 38 articles conducted on 981 221 patients were included in the current study. The study found the global pooled incidence of UTI accounted for 1.6%. Based on the subgroup analysis by survey period and WHO region, the highest incidence of UTI was reported in the African Region [3.6%] and among studies conducted between 1996 and 2001 [3.7%]. This study revealed the overall pooled incidence of UTI was 1.6%. The highest incidence of UTI (3.6%) was reported in the African region. This indicates that there is a need to implement safety measures.
38
Grulke, Christopher M., Michael-Rock Goldsmith, and Daniel A. Vallero. "Toward a Blended Ontology: Applying Knowledge Systems to Compare Therapeutic and Toxicological Nanoscale Domains." Journal of Biomedicine and Biotechnology 2012 (2012): 1–9. http://dx.doi.org/10.1155/2012/308381.
Full textAbstract:
Bionanomedicine and environmental research share need common terms and ontologies. This study applied knowledge systems, data mining, and bibliometrics used in nano-scale ADME research from 1991 to 2011. The prominence of nano-ADME in environmental research began to exceed the publication rate in medical research in 2006. That trend appears to continue as a result of the growing products in commerce using nanotechnology, that is, 5-fold growth in number of countries with nanomaterials research centers. Funding for this research virtually did not exist prior to 2002, whereas today both medical and environmental research is funded globally. Key nanoparticle research began with pharmacology and therapeutic drug-delivery and contrasting agents, but the advances have found utility in the environmental research community. As evidence ultrafine aerosols and aquatic colloids research increased 6-fold, indicating a new emphasis on environmental nanotoxicology. User-directed expert elicitation from the engineering and chemical/ADME domains can be combined with appropriate Boolean logic and queries to define the corpus of nanoparticle interest. The study combined pharmacological expertise and informatics to identify the corpus by building logical conclusions and observations. Publication records informatics can lead to an enhanced understanding the connectivity between fields, as well as overcoming the differences in ontology between the fields.
39
Ye, Qing, and Nancy Lan Guo. "Inferencing Bulk Tumor and Single-Cell Multi-Omics Regulatory Networks for Discovery of Biomarkers and Therapeutic Targets." Cells 12, no. 1 (2022): 101. http://dx.doi.org/10.3390/cells12010101.
Full textAbstract:
There are insufficient accurate biomarkers and effective therapeutic targets in current cancer treatment. Multi-omics regulatory networks in patient bulk tumors and single cells can shed light on molecular disease mechanisms. Integration of multi-omics data with large-scale patient electronic medical records (EMRs) can lead to the discovery of biomarkers and therapeutic targets. In this review, multi-omics data harmonization methods were introduced, and common approaches to molecular network inference were summarized. Our Prediction Logic Boolean Implication Networks (PLBINs) have advantages over other methods in constructing genome-scale multi-omics networks in bulk tumors and single cells in terms of computational efficiency, scalability, and accuracy. Based on the constructed multi-modal regulatory networks, graph theory network centrality metrics can be used in the prioritization of candidates for discovering biomarkers and therapeutic targets. Our approach to integrating multi-omics profiles in a patient cohort with large-scale patient EMRs such as the SEER-Medicare cancer registry combined with extensive external validation can identify potential biomarkers applicable in large patient populations. These methodologies form a conceptually innovative framework to analyze various available information from research laboratories and healthcare systems, accelerating the discovery of biomarkers and therapeutic targets to ultimately improve cancer patient survival outcomes.
40
Kanyepi, Morley, and Abubaker Qutieshat Dr. "A Brief Literature Review Paper on the Effect of Corporate Governance and Corporate Social Responsibility on Firm Performance." A Brief Literature Review Paper on the Effect of Corporate Governance and Corporate Social Responsibility on Firm Performance 9, no. 1 (2024): 10. https://doi.org/10.5281/zenodo.10521669.
Full textAbstract:
The purpose of the paper is to review and critically analyse existing literature on the effect of corporate governance (CG) and corporate social responsibility (CSR) on firm performance. A rigorous electronic search of the Google Scholar engine was conducted using the application of Boolean logic to search for relevant articles from 2013–2023. The literature included peer reviewed journals for reliability, abstracts ,articles that studied the relationship between CG, CSR, and firm performance, and research papers that discussed the effect of either CG or CSR on performance. Findings established that the common CG variables employed by researchers are the size of the board, independence of the board, proportion of independent board members, and gender diversity in the board. Most researchers identified Tobin’s Q, Return on Assets (ROA), and Return on Equity (ROE) as the dimensions for firm performance. It was also found that the majority of the research done after 2013 has noted a significant positive effect of CG on performance. The research concluded that there is need to focus on the wholesome effect of CG on firm performance and therefore come up with a comprehensive CG index for emerging economies. Keywords:- Corporate Social Responsibility, CG, Firm Performance, Board Structure.
41
Kokilavani, V., K. Preethi, and P. Balasubramanian. "FPGA-Based Synthesis of High-Speed Hybrid Carry Select Adders." Advances in Electronics 2015 (May 27, 2015): 1–13. http://dx.doi.org/10.1155/2015/713843.
Full textAbstract:
Carry select adder is a square-root time high-speed adder. In this paper, FPGA-based synthesis of conventional and hybrid carry select adders are described with a focus on high speed. Conventionally, carry select adders are realized using the following: (i) full adders and 2 : 1 multiplexers, (ii) full adders, binary to excess 1 code converters, and 2 : 1 multiplexers, and (iii) sharing of common Boolean logic. On the other hand, hybrid carry select adders involve a combination of carry select and carry lookahead adders with/without the use of binary to excess 1 code converters. In this work, two new hybrid carry select adders are proposed involving the carry select and section-carry based carry lookahead subadders with/without binary to excess 1 converters. Seven different carry select adders were implemented in Verilog HDL and their performances were analyzed under two scenarios, dual-operand addition and multioperand addition, where individual operands are of sizes 32 and 64-bits. In the case of dual-operand additions, the hybrid carry select adder comprising the proposed carry select and section-carry based carry lookahead configurations is the fastest. With respect to multioperand additions, the hybrid carry select adder containing the carry select and conventional carry lookahead or section-carry based carry lookahead structures produce similar optimized performance.
42
Kepning, Ngoruw, Sr Sajitha Moothedan, and Sherin Susan Thomas. "Adherence to Exercise among COPD (Chronic Obstructive Pulmonary Disease) Patient- Barriers and Facilitators." International Journal of Science and Healthcare Research 9, no. 1 (2024): 136–42. http://dx.doi.org/10.52403/ijshr.20240118.
Full textAbstract:
Chronic obstructive pulmonary disease is a common inflammatory lung disease characterized by persistent respiratory symptoms and airflow limitation. There is compelling evidence that regular exercise can lower the chance of developing several chronic diseases. Although it helps in reducing COPD symptoms and improve quality of life, which is highly beneficial for COPD patients, there are still several reasons for barriers to adherence to exercise in COPD patients which further affects their health. Most COPD patients are typically compelled to minimize exercise and adopt sedentary lifestyles due to decrease activity related dyspnea and exercise tolerance. Relevant literature was obtained from platforms such as Google Scholar and PubMed. For thorough retrieval, the Boolean logic operators “AND, OR NOT” were applied. All pertinent keywords, mesh terms, and other index terms were searched for in relation to “barriers,” “facilitators,” “chronic obstructive pulmonary disease” and “exercise” which were then utilized to build the search strategy. This review found that exercise improved dyspnea, quality of life, lessened depression, enhanced cognitive and neurobehavioral function in COPD patients, and shortened hospital stays and COPD exacerbations. Many factors act as barriers of adherence to exercise among COPD patients, such as self, environment, health and psychosocial. While numerous factors such as positive feedback, support from family, self-initiation, etc. act as a facilitator of adherence to exercise among COPD patients. Keywords: Chronic Obstructive Pulmonary Disease, barriers, facilitators, benefits of exercise.
43
Kloda, Lorie Andrea. "Undergraduate students do not understand some library jargon typically used in library instruction." Evidence Based Library and Information Practice 1, no. 1 (2006): 83. http://dx.doi.org/10.18438/b8qp4p.
Full textAbstract:
A review of: 
 
 Hutcherson, Norman B. “Library Jargon: Student Recognition of Terms and Concepts Commonly Used by Librarians in the Classroom.” College and Research Libraries 65.4 (July 2004): 349-54.
 
 Objective – To determine students’ level of recognition for 28 commonly used terms in library instruction.
 
 Design – Survey, multiple-choice questionnaire.
 
 Setting – Large state university library in the United States (this is assumed from the author’s current affiliation).
 
 Subjects – 300 first- and second-year university students enrolled in a library skills course between September 2000 and June 2003.
 
 Methods – Two 15-question multiple-choice questionnaires were created to verify students’ understanding of 28 terms commonly used in library instruction, or “library jargon”. Each questionnaire included 12 unique terms and, in order to ensure consistency between questionnaire results, three common terms. For each question, a definition was provided and four terms, including the correct one, were offered as possible answers. Four variants of each survey were developed with varied question and answer order. Students who completed a seven-week library skills lab received one of the two questionnaires. Lab instructors explained the objective of the survey and the students completed them in 10 to 15 minutes during class time. Of the 300 students enrolled in the lab between September 2000 and June 2003, 297 returned completed questionnaires. The researcher used Microsoft Excel to calculate descriptive statistics, including the mean, median, and standard deviation for individual questionnaires as well as combined results. No demographic data were collected.
 
 Main results – The mean score for both questionnaires was 62.31% (n=297). That is, on average, students answered 9.35 out of 15 questions correctly, with a standard deviation of +-4.12. Students were able to recognize library-related terms to varying degrees. Terms identified correctly most often included: plagiarism (100%), reference services (94.60%), research (94.00%), copyright (91.58%), and table of contents (90.50%). Terms identified correctly the least often included: Boolean logic (8.10%), bibliography (14.90%), controlled vocabulary (18.10%), truncation (27.70%), and precision (31.80%). For the three terms used in both questionnaires, results were similar. 
 
 Conclusion – The results of this study demonstrate that terms used more widely (e.g. plagiarism, copyright) are more often recognized by students compared with terms used less frequently (e.g. Boolean logic, truncation). Also, terms whose meanings are well-understood in everyday language, such as citation and authority, may be misunderstood in the context of library instruction. For this reason, it can be assumed that students may be confused when faced with this unfamiliar terminology. The study makes recommendations for librarians to take measures to prevent misunderstandings during library instruction such as defining terms used and reducing the use of library jargon.
44
Mengistu, Dechasa Adare, Sina Temesgen Tolera, and Yohannes Mulugeta Demmu. "Worldwide Prevalence of Occupational Exposure to Needle Stick Injury among Healthcare Workers: A Systematic Review and Meta-Analysis." Canadian Journal of Infectious Diseases and Medical Microbiology 2021 (January 29, 2021): 1–10. http://dx.doi.org/10.1155/2021/9019534.
Full textAbstract:
Background. Healthcare workers are at high risk of occupational exposure to needle stick injury worldwide. Occupational exposure to needle stick injury represents the most common sources of infection such as hepatitis B virus, hepatitis C virus, and human immunodeficiency virus. Thus, this review aimed to determine the career time and previous one-year global pooled prevalence of occupational exposure to needle stick injury among healthcare workers. Methods. The review considered articles written in English language and published from 2012 to 2020. The articles were searched using nine electronic databases (PubMed, Google Scholar, CINAHL, MEDLINE, Cochrane library, Web of Science, SCOPUS, MedNar, and ScienceDirect) using a combination of Boolean logic operators (AND, OR, and NOT), Medical Subject Headings, and keywords. Quality assessment was performed to determine the relevance of the articles using Joanna Briggs Institute critical appraisal tools. Several steps of assessment and evaluation were taken to select and analyze the relevant articles. Results. The worldwide pooled prevalence of needle stick injuries among healthcare workers during career time and previous one year was 56.2% (95% CI: 47.1, 64.9) and 32.4% (95% CI: 22.0, 44.8), respectively. The career time pooled prevalence of needle stick injuries based on the socioeconomic development and study area was 54.8% and 55.1%, respectively, and one-year pooled prevalence of needle stick injury was 26.0% and 20.9%. Conclusion. The review found a high prevalence of occupational exposure to needle stick injury among healthcare workers and suggests the need to improve occupational health and safety services in the healthcare systems.
45
Ovsyak, V. K., O. V. Ovsyak, and J. V. Petruszka. "ORDER AND ORDERING IN DISCRETE MATHEMATICS AND INFORMATICS." Ukrainian Journal of Information Technology 3, no. 1 (2021): 37–43. http://dx.doi.org/10.23939/ujit2021.03.037.
Full textAbstract:
The available means of ordering and sorting in some important sections of discrete mathematics and computer science are studied, namely: in the set theory, classical mathematical logic, proof theory, graph theory, POST method, system of algorithmic algebras, algorithmic languages of object-oriented and assembly programming. The Cartesian product of sets, ordered pairs and ordered n-s, the description by means of set theory of an ordered pair, which are performed by Wiener, Hausdorff and Kuratowski, are presented. The requirements as for the relations that order sets are described. The importance of ordering in classical mathematical logic and proof theory is illustrated by the examples of calculations of the truth values of logical formulas and formal derivation of a formula on the basis of inference rules and substitution rules. Ordering in graph theory is shown by the example of a block diagram of the Euclidean algorithm, designed to find the greatest common divisor of two natural numbers. The ordering and sorting of both the instructions formed by two, three and four ordered fields and the existing ordering of instructions in the program of Post method are described. It is shown that the program is formed by the numbered instructions with unique instruction numbers and the presence of the single instruction with number 1. The means of the system of algorithmic algebras, which are used to perform the ordering and sorting in the algorithm theory, are illustrated. The operations of the system of algorithmic algebras are presented, which include Boolean algebra operations generalized to the three-digit alphabet and operator operations of operator algebra. The properties of the composition operation are described, which is intended to describe the orderings of the operators of the operator algebra in the system of algorithmic algebras. The orderings executed by means of algorithmic programming languages are demonstrated by the hypothetical application of the modern object-oriented programming language C#. The program must contain only one method Main () from which the program execution begins. The ARM microprocessor assembly program must have only one ENTRY directive from which the program execution begins.
46
Azlia, Demara, Yedhi, Laily Annisa Kusumastuti, and Daffa Abhista Wicaksana. "GLYCOLYTIC 2-DEOXY-D-GLUCOSE PERIOCULAR INHIBITOR SEBAGAI TERAPI ADJUVANT PADA RETINOBLASTOMA." Al-Iqra Medical Journal : Jurnal Berkala Ilmiah Kedokteran 1, no. 2 (2018): 48–54. http://dx.doi.org/10.26618/aimj.v1i2.2750.
Full textAbstract:
Retinoblastoma is the most common intraocular tumor in children. Retinoblastoma tumors consist of areas with high angiogenic activity and other areas with low oxygen pressure conditions. Tumor cells that survive in this hypoxic region have been shown to be resistant to chemotherapy and radiation, namely standard retinoblastoma therapy which selectively targets rapidly dividing cell populations, so that therapy is needed that can reach up to the hypoxic cells. 2-deoxy-D-glucose (2-DG) has been shown to be effective in reducing hypoxic areas in tumors, reducing tumor buds, and inhibiting angiogenesis. to discuss the glycolytic 2-DG inhibitors as adjuvant therapy in retinoblastoma. The authors searched for medical articles in the PubMed and ResearchGate literature databases with the keywords treatment, 2-deoxy-D-glucose, 2-DG, retinoblastoma, and cancer. The words are combined with OR or AND using Boolean logic. Based on the selection according to the inclusion and exclusion criteria, 4 articles were used as the main reference for writing this review literature. 2-DG will disregulate (inhibit) the process of angiogenesis through upregulation of Estrogen Receptor 1 Nuclear (ESR 1), ubiquitin, jun activation domain binding protein 1 (JAB1), G-protein alpha S, and CAPER in the apical part of the tumor and B3GNT1 upregulation , CEPT1, PABPC1, myotrophin, HAX1 in the postero-lateral part of the tumor. H3, DTX1, RPL12, and bone morphogenic (BMP) histones are also upregulated so that hypoxia can be inhibited. With this mechanism, the tumor burden can be suppressed. Glycolytic 2-DG inhibitors with anti-angiogenesis and anti-hypoxic abilities can be developed as adjuvant therapy for advanced retinoblastoma patients.
47
Traversa, Fabio L., Pietro Cicotti, Forrest Sheldon, and Massimiliano Di Ventra. "Evidence of Exponential Speed-Up in the Solution of Hard Optimization Problems." Complexity 2018 (July 3, 2018): 1–13. http://dx.doi.org/10.1155/2018/7982851.
Full textAbstract:
Optimization problems pervade essentially every scientific discipline and industry. A common form requires identifying a solution satisfying the maximum number among a set of many conflicting constraints. Often, these problems are particularly difficult to solve, requiring resources that grow exponentially with the size of the problem. Over the past decades, research has focused on developing heuristic approaches that attempt to find an approximation to the solution. However, despite numerous research efforts, in many cases even approximations to the optimal solution are hard to find, as the computational time for further refining a candidate solution also grows exponentially with input size. In this paper, we show a noncombinatorial approach to hard optimization problems that achieves an exponential speed-up and finds better approximations than the current state of the art. First, we map the optimization problem into a Boolean circuit made of specially designed, self-organizing logic gates, which can be built with (nonquantum) electronic elements with memory. The equilibrium points of the circuit represent the approximation to the problem at hand. Then, we solve its associated nonlinear ordinary differential equations numerically, towards the equilibrium points. We demonstrate this exponential gain by comparing a sequential MATLAB implementation of our solver with the winners of the 2016 Max-SAT competition on a variety of hard optimization instances. We show empirical evidence that our solver scales linearly with the size of the problem, both in time and memory, and argue that this property derives from the collective behavior of the simulated physical circuit. Our approach can be applied to other types of optimization problems, and the results presented here have far-reaching consequences in many fields.
48
Cracknell, M. J., and A. L. Cowood. "Construction and analysis of Hydrogeological Landscape units using Self-Organising Maps." Soil Research 54, no. 3 (2016): 328. http://dx.doi.org/10.1071/sr15016.
Full textAbstract:
The Hydrogeological Landscape (HGL) framework divides geographic space into regions with similar landscape characteristics. HGL regions or units are used to facilitate appropriate management actions tailored to individual HGL units for specific applications such as dryland salinity and climate-change hazard assessment. HGL units are typically constructed by integrating data including geology, regolith, soils, rainfall, vegetation and landscape morphology, and manually defining boundaries in a GIS environment. In this study, we automatically construct spatially contiguous regions from standard HGL data using Self-Organising Maps (SOM), an unsupervised statistical learning algorithm. We compare the resulting SOM-HGL units with manually interpreted HGL units in terms of their spatial distributions and attribute characteristics. Our results show that multiple SOM-HGL units successfully emulate the spatial distributions of individual HGL units. SOM-HGL units are shown to define subregions of larger HGL units, indicating subtle variations in attribute characteristics and representing landscape complexities not mapped during manual interpretation. We also show that SOM-HGL units with similar attributes can be selected using Boolean logic. Selected SOM-HGL units form regions that closely conform to multiple HGL units not necessarily connected in geographic space. These SOM-HGL units can be used to establish generalised land management strategies for areas with common physical characteristics. The use of SOM for the construction of HGL units reduces the subjectivity with which these units are defined and will be especially useful over large and/or inaccessible regions, where conducting field-based validation is either logistically or economically impractical. The methodology presented here has the potential to contribute significantly to land-management decision-support systems based on the HGL framework.
49
Березіна, С. І., О. І. Солонець, Кювон Лі, and М. В. Борцова. "An information technique for segmentation of military assets in conditions of uncertainty of initial data." Системи обробки інформації, no. 4(167) (December 26, 2021): 6–18. http://dx.doi.org/10.30748/soi.2021.167.01.
Full textAbstract:
To solve the applied task of detecting military assets in aerospace images the presented paper investigates the processes of constructing segmented maps of the images. The goal is to develop an information technique for detecting military assets in conditions of uncertainty of initial data. To achieve the goal, the following tasks were formulated: 1) to analyze usability of the existing segmentation methods for automatic detection of military assets in the images; 2) if the existing methods are inapplicable, to develop a new algorithm to solve the problem. In the paper the following methods are used: the methods of digital image processing, the methods of Boolean algebra and fuzzy sets, the methods of statistical analysis. The following results are received. Analysis of the known segmentation methods showed that due to camouflage coloring of the military assets, similarity of their color characteristics to those of underlying surfaces and due to the presence of large number of textured fragments in the images those methods provide segmented maps of poor quality. Among the common problems arising when conventional methods are used there are wrong segmentation, when the received contours do not coincide with the borders of the objects of interest; oversegmentation, when there are a lot of minor segments which produce "litter" objects; undersegmentation, when potentially possible segments are missed etc. As the conventional methods are inapplicable, in the paper it is suggested using the fuzzy logic systems. For each pixel the probability of the fact that the pixel belongs to the object or to the background is calculated. For making decision whether a pixel belongs to the object the production rules based on the chosen most significant factors (probabilistic values of spectral sub-bands, belonging of the neighboring pixels to the object, jumps of brightness in spectral sub-bands on the object's borders) are constructed. Conclusion. The suggested technique ensures high-quality definition of objects' borders, thus considerably increasing the reliability of military assets recognition.
50
Penchalaiah, U., and Siva Kumar VG. "Survey: Performance Analysis of FIR Filter Design Using Modified Truncation Multiplier with SQRT based Carry Select Adder." International Journal of Engineering & Technology 7, no. 2.32 (2018): 243. http://dx.doi.org/10.14419/ijet.v7i2.32.13519.
Full textAbstract:
A recent years of technology development in Signal processing application a FIR (Finite impulse response) filter design will have a highly compactable with high performance and low power in all digital signal processing application, such as audio processing, signal processing, software define radio and so on. Now a days in our environment will have more signal noises, and fluctuation due to technology development, here the Filter design is mainly configuring the priority to reduce the signal noises and fluctuation in all type of gadgets. In this project, the design contains Transpose form of high performance and high speed filter design using finite impulse response (FIR) filter with technique of pipelined inherently and supported multiple constant multiplication (MCM) in significant with saving power computation. In digital signal processing, the multiplier is a highly required thing, the example of parallel multiplier provide a high-speed and highly reliable method for multiplication, but this parallel multiplier will take large area and also power consumption. In the FIR filter design, multiplier and adders is the maximum priority will take to give the performance, but this MCM multiplier and Adders tree architecture will take large area and maximum power consumption in signal processing. So our Proposed approach of this work, will have replace the MCM multiplier to Truncated Multiplier and using the technique of Truncated based both Signed and Unsigned Operation with SQRT based Carry Select Adder (CSLA), and also replace the normal adders in FIR Filter to SQRT based Carry Select Adder (CSLA). In the proposed system of FIR Filter design results to be analysis with signed and unsigned Truncation using modified technique of HSCG-SCS based SQRT-CSLA and hence proved its more efficient than existing design, such as FIR filter for Truncation multiplier with SQRT-CSLA based Adders, FIR filter for Truncation multiplier with BEC based Adders, FIR filter for Truncation multiplier with RCA, and FIR filter for Truncation multiplier with Common Boolean logic based RCA, and finally implemented this design on VHDL with help of Xilinx FPGA-S6LX9 and shown the performance of proposed design in terms of delay, area, and power.