354 research outputs found
Tractable Reasoning In Knowledge Representation Systems
No full textThis dissertation addresses some problems raised by the well-known intractability of deductive reasoning in even moderately expressive knowledge representation systems. Starting from boolean constraint propagation (BCP), a previously known linear-time incomplete reasoner for clausal propositional theories, we develop fact propagation (FP) to deal with non-clausal theories, after motivating the need for such an extension. FP is specified using a confluent rewriting systems, for which we present an algorithm that has quadratic-time complexity in general, but is still linear-time for clausal theories. FP is the only known tractable extension of BCP to non-clausal theories; we prove that it performs strictly more inferences than CNF-BCP, a previously-proposed extension of BCP to non-clausal theories.
We generalize a refutation reasoner based on FP to a family of sound and tractable reasoners that are increasingly complete" for propositional theories. These can be used for anytime reasoning, i.e., they provide partial answers even if they are stopped prematurely, and the completeness" of the answer improves with the time used in computing it. A fixpoint construction based on FP gives an alternate characterization of the reasoners in this family, and is used to define a transformation of arbitrary theories into logically-equivalent vivid" theories | ones for which our FP algorithm ii is complete.
Our final contribution is to the description of tractable classes of reasoning problems. Based on FP, we develop a new property, called bounded intricacy, which is shared by a variety of tractable classes that were previously presented, for example, in the areas of propositional satisfiability, constraint satisfaction, and OR-databases. Although proving bounded intricacy for these classes requires domain-specific techniques (which are based on the original tractability proofs), bounded intricacy is one more tool available for showing that a family of problems arising in some application is tractable. As we demonstrate in the case of constraint satisfaction and disjunctive logic programs, bounded intricacy can also be used to uncover new tractable classes.Technical report DCS-TR-32
Study of structural and magnetic properties of cobalt ferrite nanoparticles sintered at different temperature
No full text
Optimization of Xylanase Production from Bacillus Sp. Pkd-9 under Solid State Fermentation, Partial Characterization and Application
No full textThis Dissertation / Report is the outcome of investigation carried out by the creator(s) / author(s) at the department/division of Central Food Technological Research Institute (CFTRI), Mysore mentioned below in this page
Glucoamylase from Bacillus sp. CAM-21: Production, immobilization and its application in food/agro waste saccharification.
No full textThis Dissertation / Report is the outcome of investigation carried out by the creator(s) / author(s) at the department/division of Central Food Technological Research Institute (CFTRI), Mysore mentioned below in this page
Studies on production and immobilization of mannanase from Bacillus sp.CAM-21 and preparation of β- Carotene nanoemulsions.
No full textThis Dissertation / Report is the outcome of investigation carried out by the creator(s) / author(s) at the department/division of Central Food Technological Research Institute (CFTRI), Mysore mentioned below in this page
Glucoamylase Production From Bacillus sp. CAM-21 Under Solid State Fermentation (SSF) and its Partial Biochemical Characterization.
No full textThis Dissertation / Report is the outcome of investigation carried out by the creator(s) / author(s) at the department/division of Central Food Technological Research Institute (CFTRI), Mysore mentioned below in this page
Collected Papers (on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics), Volume XI
No full textThis eleventh volume of Collected Papers includes 90 papers comprising 988 pages on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics, written between 2001-2022 by the author alone or in collaboration with the following 84 co-authors (alphabetically ordered) from 19 countries: Abhijit Saha, Abu Sufian, Jack Allen, Shahbaz Ali, Ali Safaa Sadiq, Aliya Fahmi, Atiqa Fakhar, Atiqa Firdous, Sukanto Bhattacharya, Robert N. Boyd, Victor Chang, Victor Christianto, V. Christy, Dao The Son, Debjit Dutta, Azeddine Elhassouny, Fazal Ghani, Fazli Amin, Anirudha Ghosha, Nasruddin Hassan, Hoang Viet Long, Jhulaneswar Baidya, Jin Kim, Jun Ye, Darjan Karabašević, Vasilios N. Katsikis, Ieva Meidutė-Kavaliauskienė, F. Kaymarm, Nour Eldeen M. Khalifa, Madad Khan, Qaisar Khan, M. Khoshnevisan, Kifayat Ullah,, Volodymyr Krasnoholovets, Mukesh Kumar, Le Hoang Son, Luong Thi Hong Lan, Tahir Mahmood, Mahmoud Ismail, Mohamed Abdel-Basset, Siti Nurul Fitriah Mohamad, Mohamed Loey, Mai Mohamed, K. Mohana, Kalyan Mondal, Muhammad Gulfam, Muhammad Khalid Mahmood, Muhammad Jamil, Muhammad Yaqub Khan, Muhammad Riaz, Nguyen Dinh Hoa, Cu Nguyen Giap, Nguyen Tho Thong, Peide Liu, Pham Huy Thong, Gabrijela Popović, Surapati Pramanik, Dmitri Rabounski, Roslan Hasni, Rumi Roy, Tapan Kumar Roy, Said Broumi, Saleem Abdullah, Muzafer Saračević, Ganeshsree Selvachandran, Shariful Alam, Shyamal Dalapati, Housila P. Singh, R. Singh, Rajesh Singh, Predrag S. Stanimirović, Kasan Susilo, Dragiša Stanujkić, Alexandra Şandru, Ovidiu Ilie Şandru, Zenonas Turskis, Yunita Umniyati, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Binyamin Yusoff, Edmundas Kazimieras Zavadskas, Zhao Loon Wang.
A Continuous Model for States in CSMA/CA-Based Wireless Local Networks Derived from State Transition Diagrams
No full textThe effectiveness of wireless local area networks significantly depends on the method of access to the common physical environment. The main access method that is used today in wireless local area networks is Carrier Sense Multiple Access with
Collision Avoidance (CSMA/CA), managing the efficient distribution
of the common environment between active stations.
In this paper as a topic of research we consider the state transition diagram of a CSMA/CA - based network, and we describe the by a system of differential equations. Analytical expressions or the probabilities of being in one of the possible states of a network station are derived
Creating a Decentralized Communication Protocol for SMART Manufacturing Units Within Industry 4.0
No full textCommunication protocols drive the flow of data between machines in a manufacturing setting. The speed of data flow is one of the factors that determines the speed of production. With the dawn of Industry 4.0, machines are set to become mobile, flexible and intelligent beyond previous standards. These new traits, that are set to be part of the factory setting of Industry 4.0, put greater emphasis on decentralized communication for SMART manufacturing units. Studies show that the research into developing a decentralized communication protocol have been slow and lacking in key aspects which advocate the use of existing communication protocols. This article looks at creating a decentralized protocol for a real-time application and comparing its performance with existing communication protocols along factors such as latency, error checking, real-time and decentralized operation. The article is structured such that initially, it gives an introduction to Industry 4.0 and SMART manufacturing. Secondly, the article details the case study used this study, and then it looks at the methodology used in creating the decentralized protocol. Finally, the results of the study are compared with existing communication protocols.</p
- …
