Abstract

We show that there exists endotactic and strongly endotactic dynamical systems that are not weakly reversible and possess infinitely many steady states. We provide a few examples in two dimensions and an example in three dimensions that satisfy this property. In addition, we prove for some of these systems that there exist no weakly reversible mass-action systems that are dynamically equivalent to mass-action systems generated by these networks.

Abstract

Digital representations of 3D objects are increasingly being used for engineering, entertainment, education, etc. Efforts to search and retrieve digital 3D models from a collection have not attracted sufficient attention, unlike digital representations of documents, images, etc. Supervised methods are not feasible to solve this problem as a large collection of labelled 3D objects is difficult to create. This paper presents a self-supervised method to learn efficient embeddings of 3D mesh objects for ranked retrieval of similar objects. We propose a simple representation of mesh objects and an encoder-decoder architecture to learn the embedding. Extensive experiments show that our method is competitive with methods that need supervision while being more scalable to different object collections.

Abstract

Encrypted data is susceptible to side-channel attacks like usage and access analysis. Techniques like Oblivious-RAM (ORAM) and privacy information retrieval and writing aim to hide clients’ access pattern while accessing encrypted data on a distrusted server. However, current techniques are constructed for a single server model making them unsuitable and inefficient for contemporary distributed architectures. In our work, we address this problem and provide a solution to private information update using packed secret sharing. Our protocol, named “Private Information Update for Distributed Infrastructure” PIUDI, aims to mitigate the attacks to which PIR-Writing protocols are more susceptible in a distributed environment. Our scheme is secure in presence of up to t + k − 1 compromised parties where k is the size of the data set. We also provide an analysis of our protocol for computational efficiency and gas cost in blockchains.

Abstract

Speech is produced by exciting time-varying vocal tract with time-varying impulse-like excitations called epochs. In the literature, epoch extraction methods performed well on clean speech, but, detecting epoch locations from the band-limited signal like telephonic speech is difficult due to loss of information at low frequencies. This paper proposes a Stockwell transform (S-Transform)-based method that can find epochs accurately from the telephonic speech. The frequency-dependent Gaussian window and localization capabilities of S-Transform will reduce the effect of the bandpass nature of the telephonic channel. The telephonic channel is simulated using a 300–3400 Hz bandpass filter. The proposed method is evaluated on five speakers data, namely BDL, SLT, JMK, KED, and RAB, from CMU arctic database. The results are compared with the state-of-the-art methods for both clean speech and telephonic speech. The proposed method produced comparable results with existing methods on clean speech but has shown an improvement of 4.68over state-of-the-art methods.

Abstract

With the rapid growth of Wikipedia, regular maintenance of its content requires correspond- ing growth in the laborious work of Wikipedi- ans. We present a system that filters out most of the content and recommends reliable and wor- thy information that is a strong candidate for Wikipedia updation. Preliminary results show that our model achieves close to 98% sensitivity.

Abstract

Urbanization, driven by technological advancements, has brought about improved connectivity and efficiency, especially with the rise of Internet of Things (IoT) devices. Smart cities use these innovations to manage resources better and enhance resident’s quality of life. However, implementing smart city initiatives comes with challenges like monitoring, maintaining, and testing urban infrastructure. Digital Twin (DT) entails the connection of physical facilities or devices with their digital counterparts, facilitating real-time monitoring, manipulation, and predictive analysis of their behavior. This concept offers a virtual replica of assets, processes, and systems, enabling insights into their real-time performance and predictive behaviors. By simulating real-world scenarios, DT aids in planning maintenance activities and conducting comprehensive testing, thereby enhancing the resilience and efficiency of smart city systems. Particularly in the context of managing water networks, DT technology holds significant promise. Visualization capabilities provide intuitive insights into the system’s behavior, facilitating informed decision-making. This visualization, coupled with actuation capabilities, enables control actions based on predictive analytics and optimization algorithms, allowing for proactive management of water resources and infrastructure. To this end, in this paper, we present the architecture of WaterTwin, a DT developed for water quality networks in smart city systems. We demonstrate our approach through the use of a water quality network at the smart city living lab, IIIT Hyderabad campus.

Abstract

Risk assessment is vital for comprehending and managing river water quality control. By ensuring a systematic approach for evaluating potential risks, it encourages the adoption of efficient management strategies, the use of informed decision-making, and maintaining of river ecosystems. An effective framework is developed by integrating the empirical based approach with Gumbel-Copula function to estimate the river water quality risk under high water temperatures and low flow rates. Based on Akaike Information Criterion (AIC) among Copula based Gumbel, Gaussian, t, and Clay-ton functions, the Gumbel-Copula function was utilized in the study. The percentiles ranging from 5 to 95 with 5 percentile interval of Stream Flows (SF) and reverse order percentiles of Water Temperatures (WT) are employed in the estimation of risk of river water quality. The current risk quantification approach was implemented using observed datasets on Yamuna (2000 to 2015) and Bhadra (2006 to 2017) river systems. The results reveal that at 50 percentile (SF=380 m3/s and WT=27.38 ℃) the join risk is about 75.29% for Yamuna River and similarly for Bhadra river the risk is about 77.62% (SF=7.20 m3/s and WT=25 ℃).

Abstract

Proof-of-Stake(PoS) based blockchain protocols have gained popularity due to their higher throughput and low carbon footprint when compared with Proof-of-Work blockchain protocols. The two major parts of blockchain protocols are the selection of the next block proposer and the selection of the longest chain. In PoS the block publishers are selected based on their relative stake. However, PoS-based blockchain protocols may face vulnerability against Fully Adaptive Corruptions. This paper proposes a novel PoS-based blockchain protocol, QuickSync, to achieve security against Fully Adaptive Corruptions while improving performance. Towards this, we propose a metric for each block: block power. We compute the chain power of a chain as the sum of block powers of all the blocks comprising the chain. The chain selection rule selects the chain with the highest chain power as the valid chain. Since the block proposer is not selected upfront, this scheme is resilient to fully adaptive corruptions, which we also show formally. We also ensure that our block power mechanism is resistant to Sybil attacks. We prove the security of QuickSync by showing that it satisfies the common prefix, chain growth, and chain quality properties. Our analysis demonstrates that QuickSync performs better than Bitcoin by order of magnitude on both transactions per second and time to finality.

Abstract

Computational drug discovery is intrinsically interdisciplinary and has to deal with the multifarious factors which are often dependent on the type of disease. Molecular Property Diagnostic Suite (MPDS) is a Galaxy based web portal which was conceived and developed as a disease specific web portal, originally developed for tuberculosis (MPDSTB). As specific computational tools are often required for a given disease, developing a disease specific web portal is highly desirable. This paper emphasises on the development of the customised web portal for COVID-19 infection and is referred to as MPDSCOVID-19. Expectedly, the MPDS suites of programs have modules which are essentially independent of a given disease, whereas some modules are specific to a particular disease. In the MPDSCOVID-19 portal, there are modules which are specific to COVID-19, and these are clubbed in SARS-COV-2 disease library. Further, the new additions and/or significant improvements were made to the disease independent modules, besides the addition of tools from galaxy toolshed. This manuscript provides a latest update on the disease independent modules of MPDS after almost 6 years, as well as provide the contemporary information and tool-shed necessary to engage in the drug discovery research of COVID-19. The disease independent modules include file format converter and descriptor calculation under the data processing module; QSAR, pharmacophore, scaffold analysis, active site analysis, docking, screening, drug repurposing tool, virtual screening, visualisation, sequence alignment, phylogenetic analysis under the data analysis module; and various machine learning packages, algorithms and in-house developed machine learning antiviral prediction model are available. The MPDS suite of programs are expected to bring a paradigm shift in computational drug discovery, especially in the academic community, guided through a transparent and open innovation approach. The MPDSCOVID-19 can be accessed at http://mpds.neist.res.in:8085.

Abstract

Gauging the knowledge of Pretrained Language Models (PLMs) about facts in niche domains is an important step towards making them better in those domains. In this paper, we aim at evaluating multiple PLMs for their knowledge about world Geography. We contribute (i) a sufficiently sized dataset of masked Geography sentences to probe PLMs on masked token prediction and generation tasks, (ii) benchmark the performance of multiple PLMs on the dataset. We also provide a detailed analysis of the performance of the PLMs on different Geography facts.