A5012948179- Optimization and Search Problems
- Modular Robots and Swarm Intelligence
- Algorithms and Data Compression
- Distributed systems and fault tolerance
- Cooperative Communication and Network Coding
- Mobile Ad Hoc Networks
- semigroups and automata theory
- Advanced Graph Theory Research
- Robotic Path Planning Algorithms
- Interconnection Networks and Systems
- Natural Language Processing Techniques
- Complexity and Algorithms in Graphs
- Robotics and Sensor-Based Localization
- DNA and Biological Computing
- Cellular Automata and Applications
- Machine Learning and Algorithms
- Advanced Data Compression Techniques
- Computational Geometry and Mesh Generation
- Opportunistic and Delay-Tolerant Networks
- Wireless Networks and Protocols
- Advanced Image and Video Retrieval Techniques
- Computational Drug Discovery Methods
- Advanced Optical Network Technologies
- Transportation and Mobility Innovations
- Distributed Control Multi-Agent Systems
Indira Gandhi Institute of Technology
2024
Rutgers, The State University of New Jersey
2008-2021
Université de Sherbrooke
2019
Rutgers Sexual and Reproductive Health and Rights
2016-2018
University of Nebraska–Lincoln
1992-2002
Northern Illinois University
2002
New York University
2002
George Washington University
2002
Institute of Electrical and Electronics Engineers
1996
University of Pennsylvania
1988-1992
Background: Low-cost, high-throughput in vitro bioassays have potential as alternatives to animal models for toxicity testing. However, incorporating into chemical evaluations such read-across requires significant data curation and analysis based on knowledge of relevant mechanisms, lowering the enthusiasm using massive amount unstructured public data. Objective: We aimed develop a computational method automatically extract useful bioassay from repository (i.e., PubChem) assess its ability...
Though most image coding techniques use a raster scan to order pixels prior coding, Hilbert and other scans have been proposed as having better performance due their superior locality preserving properties. However, general understanding of the merits various has lacking. This paper develops an approach for quantitatively analyzing effect pixel context-based, predictive lossless compression uses it compare raster, Hilbert, random hierarchical scans. Specifically, quantized-Gaussian model...
Abstract Summary We have developed a public Chemical In vitro–In vivo Profiling (CIIPro) portal, which can automatically extract in vitro biological data from resources (i.e. PubChem) for user-supplied compounds. For compounds with target activity (e.g. animal toxicity testing results), the integrated cheminformatics algorithm will optimize extracted using vitro–in correlations. The resulting be used read-across risk assessment of Additionally, CIIPro portal identify most similar based on...
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting from origin, robots are required to find a target at unknown location. The can move with maximum speed 1 and communicate in wireless mode among themselves. However, robots, there f that exhibit byzantine faults. A faulty robot fail report even after reaching it, or it make malicious claims about having found when fact has not. Given presence such for only be concluded non-faulty have...
Digitalizing complex nanostructures into data structures suitable for machine learning modeling without losing nanostructure information has been a major challenge. Deep frameworks, particularly convolutional neural networks (CNNs), are especially adept at handling multidimensional and inputs. In this study, CNNs were applied the of nanoparticle activities exclusively from nanostructures. The represented by virtual molecular projections, digitalization nanostructures, used as input to train...
We study the barrier coverage problem using relocatable sensor nodes. assume each can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on and move along barrier. The goal is to find final for sensors so that entire covered. In recent years, has been studied extensively in centralized setting. this paper, we distributed repeatedly executes a Look-Compute-Move cycle: based what it sees vicinity, makes decision where move, moves next...
Assume that n sensors with identical range r = f(n)⁄2n, for some f(n) ≥ 1 all n, are thrown randomly and independently the uniform distribution in unit interval [0, 1]. They required to move new positions so as cover entire sense every point is within of a sensor. We obtain tradeoffs between expected sum maximum displacements their accomplish this task. In particular, when -- total displacement shown be Θ(√n). For senors larger ranges we present two algorithms prove upper bound drops sharply...
Queen Daniela of Sardinia is asleep at the center a round room top tower in her castle. She accompanied by faithful servant, Eva. Suddenly, they are awakened cries Fire. The pitch black and disoriented. There exactly one exit from somewhere along its boundary. They must find it as quickly possible order to save life queen. It known that with two people searching while moving maximum speed 1 anywhere room, can be evacuated (i.e., both exiting) $1 + \frac{2\pi}{3} \sqrt{3} \approx 4.8264$ time...
The circadian clock controls daily activities at the cellular and organismic level, allowing an organism to anticipate incoming stresses use resources accordingly. has therefore been considered a fitness trait in multiple organisms. However, mechanism of how variation influences organismal reproductive is still not well understood. Here we describe habitat-specific (HSCV) asexual reproduction Neurospora discreta, species that adapted 2 different habitats, under or above tree bark. African...
General point-to-point communication among processors in the classical two-dimensional n*n square mesh architecture necessarily takes at least 2n-2 time steps. The authors investigate problem of routing arbitrary permutations on an enhanced with separate broadcast buses along each its rows and columns. They prove that any packet algorithm this Theta (2n/3) Further, they demonstrate a simple which, for chosen 2/n<or= <or=1/2, routes packets (7n/6+O( n)) steps local queue-size most (3/ +5).<<ETX>>
We provide randomized rendezvous algorithms for two synchronous robots in a bi-directional ring of length n (n is real number): the are equipped with identical chronometers, execute algorithms, but have different speeds u, 1 (where u > 1). In general, neither aware their own speed some cases they may be either magnitude or quantity time that depends on n. The start by choosing direction uniformly and independently at random. Given integer k ≥ 0, we design alternate + rounds between random...