Search

Your search keyword '"Praveen, M."' showing total 1,059 results
Start Over Author "Praveen, M."
1,059 results on '"Praveen, M."'

4. Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol

Author

Praveen, M., Ramesh, Raghavendra, and Doidge, Isaac

Subjects
Computer Science - Logic in Computer Science, C.2.2, F.4.1
Abstract

Decentralized Finance (DeFi) has emerged as a contemporary competitive as well as complementary to traditional centralized finance systems. As of 23rd January 2024, per Defillama approximately USD 55 billion is the total value locked on the DeFi applications on all blockchains put together. A Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocol, popularly known as the consensus protocol, is the central component of a blockchain. If forks are possible in a consensus protocol, they can be misused to carry out double spending attacks and can be catastrophic given high volumes of finance that are transacted on blockchains. Formal verification of the safety of consensus protocols is the golden standard for guaranteeing that forks are not possible. However, it is considered complex and challenging to do. This is reflected by the fact that not many complex consensus protocols are formally verified except for Tendermint and QBFT. We focus on Supra's Pipelined Moonshot consensus protocol. Similar to Tendermint's formal verification, we too model Pipelined Moonshot using IVy and formally prove that for all network sizes, as long as the number of Byzantine validators is less than one thirds, the protocol does not allow forks, thus proving that Pipelined Moonshot is safe and double spending cannot be done using forks. The IVy model and proof of safety is available on Github.

Published
2024

13. Correlation Between SPT Indexes of Soils to Pressing Pile Load and Settlement of Concrete Piles: An Experimental Study in Bac Giang, Vietnam

Author

Tang, Van Tai, Vu, Tran Khoa, Huded, Praveen M., Nguyen, Thuy Lan Chi, di Prisco, Marco, Series Editor, Chen, Sheng-Hong, Series Editor, Vayas, Ioannis, Series Editor, Kumar Shukla, Sanjay, Series Editor, Sharma, Anuj, Series Editor, Kumar, Nagesh, Series Editor, Wang, Chien Ming, Series Editor, Cui, Zhen-Dong, Series Editor, Duc Long, Phung, editor, and Dung, Nguyen Tien, editor

Published
2024
Full Text
View/download PDF

15. On the Piecewise Complexity of Words and Periodic Words

Author

Praveen, M., Schnoebelen, Ph., Veron, J., Vialard, I., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Fernau, Henning, editor, Gaspers, Serge, editor, and Klasing, Ralf, editor

Published
2024
Full Text
View/download PDF

16. Big Data Challenges in the Supply Chain Management: Perspective from Data Envelopment Analysis

Author

Pote, Saurabh Anil, Gokhale, Prayag, Kulkarni, Praveen M., Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Tan, Kay Chen, Series Editor, Shetty, N. R., editor, Prasad, N. H., editor, and Nalini, N., editor

Published
2024
Full Text
View/download PDF

17. Adoption of Artificial Intelligence for Manufacturing Companies

Author

Lakshminarayana, K., Kulkarni, Praveen M., Gokhale, Prayag, Appasaba, L. V., Tigadi, Basavaraj S., Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Tan, Kay Chen, Series Editor, Shetty, N. R., editor, Prasad, N. H., editor, and Nalini, N., editor

Published
2024
Full Text
View/download PDF

18. Window Expressions for Stream Data Processing

Author

Praveen, M. and Hitarth, S.

Subjects
Computer Science - Formal Languages and Automata Theory
Abstract

Traditional ways of storing and querying data do not work well in scenarios where data is being generated continuously and quick decisions need to be taken. For example, in hospital intensive care units, signals from multiple devices need to be monitored and the occurrence of any anomaly should raise alarms immediately. A typical design would take the average from a window of say 10 seconds (time-based) or 10 successive (count-based) readings and look for sudden deviations. Existing stream processing systems either restrict the windows to time or count-based windows or let users define customized windows in imperative programming languages. These are subject to the implementers' interpretation of what is desired and hard to understand for others. We introduce a formalism for specifying windows based on Monadic Second Order logic. It offers several advantages over ad-hoc definitions written in imperative languages. We demonstrate four such advantages. First, we illustrate how practical streaming data queries can be easily written with precise semantics. Second, we can get different but expressively equivalent formalisms for defining windows. We use one of them (regular expressions) to design an end-user-friendly language for defining windows. Third, we use another expressively equivalent formalism (automata) to design a processor that automatically generates windows according to specifications. The fourth advantage we demonstrate is more sophisticated. Some window definitions have the problem of too many windows overlapping with each other, overwhelming the processing engine. This is handled in different ways by different engines, but all the options are about what to do when this happens at runtime. We study this as a static analysis question and prove that it is undecidable to check whether such a scenario can ever arise for a given window definition. We identify a decidable fragment...

Published
2022

19. Realizability Problem for Constraint LTL

Author

Bhaskar, Ashwin and Praveen, M.

Subjects
Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, Mathematics - Logic, F.4.1
Abstract

Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on sequences of valuations of variables over an infinite domain. The atomic formulas are interpreted as constraints on the valuations. The atomic formulas can constrain valuations over a range of positions along a sequence, with the range being bounded by a parameter depending on the formula. The satisfiability and model checking problems for CLTL have been studied by Demri and D'Souza. We consider the realizability problem for CLTL. The set of variables is partitioned into two parts, with each part controlled by a player. Players take turns to choose valuations for their variables, generating a sequence of valuations. The winning condition is specified by a CLTL formula -- the first player wins if the sequence of valuations satisfies the specified formula. We study the decidability of checking whether the first player has a winning strategy in the realizability game for a given CLTL formula. We prove that it is decidable in the case where the domain satisfies the completion property, a property introduced by Balbiani and Condotta in the context of satisfiability. We prove that it is undecidable over $(\mathbb{Z},<,=)$, the domain of integers with order and equality. We prove that over $(\mathbb{Z},<,=)$, it is decidable if the atomic constraints in the formula can only constrain the current valuations of variables belonging to the second player, but there are no such restrictions for the variables belonging to the first player. We call this single-sided games., Comment: 26 pages

Published
2022

23. Complement-Coagulation Cross-talk: Factor H-mediated regulation of the Complement Classical Pathway activation by fibrin clots

Author

Yu-Hoi Kang, Praveen M. Varghese, Ahmad Al Aiyan, Kirsten Pondman, Uday Kishore, and Robert B. Sim

Subjects
complement, coagulation, classical pathway, C1q, factor H, regulation, Immunologic diseases. Allergy, RC581-607
Abstract

The classical pathway of the complement system is activated by the binding of C1q in the C1 complex to the target activator, including immune complexes. Factor H is regarded as the key downregulatory protein of the complement alternative pathway. However, both C1q and factor H bind to target surfaces via charge distribution patterns. For a few targets, C1q and factor H compete for binding to common or overlapping sites. Factor H, therefore, can effectively regulate the classical pathway activation through such targets, in addition to its previously characterized role in the alternative pathway. Both C1q and factor H are known to recognize foreign or altered-self materials, e.g., bacteria, viruses, and apoptotic/necrotic cells. Clots, formed by the coagulation system, are an example of altered self. Factor H is present abundantly in platelets and is a well-known substrate for FXIIIa. Here, we investigated whether clots activate the complement classical pathway and whether this is regulated by factor H. We show here that both C1q and factor H bind to the fibrin formed in microtiter plates and the fibrin clots formed under in vitro physiological conditions. Both C1q and factor H become covalently bound to fibrin clots, and this is mediated via FXIIIa. We also show that fibrin clots activate the classical pathway of complement, as demonstrated by C4 consumption and membrane attack complex detection assays. Thus, factor H downregulates the activation of the classical pathway induced by fibrin clots. These results elucidate the intricate molecular mechanisms through which the complement and coagulation pathways intersect and have regulatory consequences.

Published
2024
Full Text
View/download PDF

24. Study of tribological performance and corrosion resistance of aluminum alloy 6063 composites enhanced with a combination of silicon carbide and tungsten disulfide particles

Author

Vijayasarathi Prabakaran, Palani R, Praveen M, and Kamod kumar S

Subjects
Metal matrix composites, Stir casting, Taguchi's techniques, Friction analysis, Wear behaviour, Corrosion resistance, Industrial electrochemistry, TP250-261
Abstract

This research explores the effects of wear on a 6063 aluminum alloy matrix combined with silicon carbide (SiC) and tungsten disulfide (WS2) particulates. Dry friction wear tests were conducted on three materials: pure 6063 aluminum alloy, a composite with 4 wt% SiC and 4 wt% WS2 reinforcement, and another composite with 6 wt% SiC and 4 wt% WS2 reinforcement. These materials were tested against AISI410 stainless steel discs under varying loads (10N, 20N, and 30N) and sliding rates (0.5, 1.0, and 1.5 ms−1) following a Taguchi L27 orthogonal experimental plan. Main effect graphs (S/N ratios) and ANOVA analysis were utilized to determine optimal parameter combinations, and confirmation tests were carried out to validate the Taguchi results. Scanning electron microscope (SEM) images of wear areas showed that incorporating SiC and WS2 significantly enhanced the wear resistance of the aluminum alloy. This indicates that incorporating SiC and WS2 reinforcement has the potential to enhance the wear resistance of aluminum alloys, making them suitable for applications such as piston rings in internal combustion engines, which is in line with the requirements of engine performance. Furthermore, potentiodynamic polarization studies evaluated the corrosion resistance of the Metal Matrix Composites AA6063 in 3.5% NaCl. Results indicated that the AA6063 + 6 wt% SiC + 4 wt% WS2 composite exhibited superior corrosion resistance compared to AA6063 alone.

Published
2024
Full Text
View/download PDF

29. Enhancing Transaction Scalability of Blockchain Network Using Sharding Technique

Author

Dhulavvagol, Praveen M., Totad, S. G., Pratheek, P., Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Ranganathan, G., editor, EL Allioui, Youssouf, editor, and Piramuthu, Selwyn, editor

Published
2023
Full Text
View/download PDF

31. Artificial Intelligence and Machine Learning for Foundry Industry—A Case Study of Belagavi Foundry Industry

Author

Kulkarni, Praveen M., Gokhale, Prayag, Appasaba, L. V., Lakshminarayana, K., Tigadi, Basavaraj S., Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Hirche, Sandra, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Möller, Sebastian, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Shetty, N. R., editor, Patnaik, L. M., editor, and Prasad, N. H., editor

Published
2023
Full Text
View/download PDF

32. Toward Managing Technology Challenges for Agriculture Technology Start-ups

Author

Kulkarni, Praveen M., Gokhale, Prayag, Appasaba, L. V., Lakshminarayana, K., Tigadi, Basavaraj S., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Tuba, Milan, editor, Akashe, Shyam, editor, and Joshi, Amit, editor

Published
2023
Full Text
View/download PDF

39. What You Must Remember When Transforming Datawords

Author

Praveen, M.

Subjects
Computer Science - Formal Languages and Automata Theory
Abstract

Streaming Data String Transducers (SDSTs) were introduced to model a class of imperative and a class of functional programs, manipulating lists of data items. These can be used to write commonly used routines such as insert, delete and reverse. SDSTs can handle data values from a potentially infinite data domain. The model of Streaming String Transducers (SSTs) is the fragment of SDSTs where the infinite data domain is dropped and only finite alphabets are considered. SSTs have been much studied from a language theoretical point of view. We introduce data back into SSTs, just like data was introduced to finite state automata to get register automata. The result is Streaming String Register Transducers (SSRTs), which is a subclass of SDSTs. SDSTs can compare data values using a linear order on the data domain, which can not be done by SSRTs. We give a machine independent characterization of SSRTs with origin semantics, along the lines of Myhill-Nerode theorem. Machine independent characterizations for similar models have formed the basis of learning algorithms and enabled us to understand fragments of the models. Origin semantics of transducers track which positions of the output originate from which positions of the input. Although a restriction, using origin semantics is well justified and known to simplify many problems related to transducers. We use origin semantics as a technical building block, in addition to characterizations of deterministic register automata. However, we need to build more on top of these to overcome some challenges unique to SSRTs.

Published
2020

41. Query Preserving Watermarking Schemes for Locally Treelike Databases

Author

Chattopadhyay, Agnishom and Praveen, M.

Subjects
Computer Science - Logic in Computer Science, Computer Science - Databases
Abstract

Watermarking is a way of embedding information in digital documents. Much research has been done on techniques for watermarking relational databases and XML documents, where the process of embedding information shouldn't distort query outputs too much. Recently, techniques have been proposed to watermark some classes of relational structures preserving first-order and monadic second order queries. For relational structures whose Gaifman graphs have bounded degree, watermarking can be done preserving first-order queries. We extend this line of work and study watermarking schemes for other classes of structures. We prove that for relational structures whose Gaifman graphs belong to a class of graphs that have locally bounded tree-width and is closed under minors, watermarking schemes exist that preserve first-order queries. We use previously known properties of logical formulas and graphs, and build on them with some technical work to make them work in our context. This constitutes a part of the first steps to understand the extent to which techniques from algorithm design and computational learning theory can be adapted for watermarking.

Published
2019

42. Verification of Flat FIFO Systems

Author

Finkel, Alain and Praveen, M.

Subjects
Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, Theory of computation - Parallel computing models
Abstract

The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single loop or a single bounded expression). We prove, by establishing reductions between properties, and by reducing SAT to a subset of these properties that many verification problems like reachability, non-termination, unboundedness are NP-complete for flat FIFO machines, generalizing similar existing results for flat counter machines. We also show that reachability is NP-complete for flat lossy FIFO machines and for flat front-lossy FIFO machines. We construct a trace-flattable system of many counter machines communicating via rendez-vous that is bisimilar to a given flat FIFO machine, which allows to model-check the original flat FIFO machine. Our results lay the theoretical foundations and open the way to build a verification tool for (general) FIFO machines based on analysis of flat sub-machines.

Published
2019
Full Text
View/download PDF

43. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

Author

Leroux, J., Praveen, M., Schnoebelen, Ph., and Sutre, G.

Subjects
Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science
Abstract

We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions $F_\alpha$ for $\alpha<\omega^\omega$, hence they are computationally more powerful than standard vector addition systems. On the other hand they cannot weakly compute the inverses $F_\alpha^{-1}$ or indeed any sublinear function. The proof relies on a pumping lemma for runs of GVASes that is of independent interest.

Published
2019
Full Text
View/download PDF

46. Performance Analysis of Classification Algorithm Using Stacking and Ensemble Techniques

Author

Dhulavvagol, Praveen M., Totad, S. G., Shirodkar, Ashwin, Hiremath, Amulya, Bansode, Apoorva, Divya, J., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Jacob, I. Jeena, editor, Kolandapalayam Shanmugam, Selvanayaki, editor, and Bestak, Robert, editor

Published
2022
Full Text
View/download PDF

47. Efficient Data Partitioning and Retrieval Using Modified ReDDE Technique

Author

Dhulavvagol, Praveen M., Totad, S. G., Bhandage, Nandan, Bilagi, Pradyumna, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Jacob, I. Jeena, editor, Kolandapalayam Shanmugam, Selvanayaki, editor, and Bestak, Robert, editor

Published
2022
Full Text
View/download PDF

48. Opinion System of Real-Time Emotions from Human Interaction Incorporated in Class Using Deep Learning

Author

Bindhu, M., Asha, S., Praveen, M., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Rathore, Vijay Singh, editor, Sharma, Subhash Chander, editor, Tavares, Joao Manuel R.S., editor, Moreira, Catarina, editor, and Surendiran, B., editor

Published
2022
Full Text
View/download PDF

50. Suitability of Hybrid Aluminium Metal Matrix Composite Material to Replace Cast Iron in Automobile Components

Author

Habibullah, Mohammad, Manikanta, N. V. V., Varun, A., Praveen, M., Cavas-Martínez, Francisco, Series Editor, Chaari, Fakher, Series Editor, di Mare, Francesca, Series Editor, Gherardini, Francesco, Series Editor, Haddar, Mohamed, Series Editor, Ivanov, Vitalii, Series Editor, Kwon, Young W., Series Editor, Trojanowska, Justyna, Series Editor, Deepak, B. B. V. L., editor, Parhi, D.R.K., editor, Biswal, B.B., editor, and Jena, Pankaj C., editor

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results