- Semiconductor Quantum Structures and Devices
- Semiconductor Lasers and Optical Devices
- Laser Design and Applications
- Solid State Laser Technologies
- Advanced Semiconductor Detectors and Materials
- Point processes and geometric inequalities
- Genetic and phenotypic traits in livestock
- Soil Geostatistics and Mapping
- Structural Health Monitoring Techniques
- GaN-based semiconductor devices and materials
- Spectroscopy and Laser Applications
- Matrix Theory and Algorithms
- Advanced Optical Sensing Technologies
- Economic and Environmental Valuation
- Advanced Optimization Algorithms Research
- Probabilistic and Robust Engineering Design
- Electron and X-Ray Spectroscopy Techniques
- History and advancements in chemistry
- Photonic and Optical Devices
- Electromagnetic Scattering and Analysis
- Advanced Data Compression Techniques
- Animal Nutrition and Physiology
- Morphological variations and asymmetry
- Spatial and Panel Data Analysis
- Digital Filter Design and Implementation
Curtin University
2017-2023
University of Burdwan
2022
Burdwan Medical College & Hospital
2021
Australian Export Grains Innovation Centre
2020
Indian Institute of Technology Kharagpur
1982-2019
Indian Institute of Technology Indore
1978-1984
University of Calcutta
1969-1974
University College of Technology
1971
Institute of Radiophysics and Electronics
1971
Statistical methodology for analysing patterns of points on a network lines, such as road traffic accident locations, often assumes that the underlying point process is “stationary” or “correlation‐stationary.” However, processes appear to be rare. In this paper, popular procedures constructing are adapted linear networks: many resulting models no longer stationary when distance measured by shortest path in network. This undermines rationale statistical methods K ‐function and pair...
Summary We propose a computationally efficient and statistically principled method for kernel smoothing of point pattern data on linear network. The locations, the network itself, are convolved with two‐dimensional then combined into an intensity function This can be computed rapidly using fast Fourier transform, even large networks bandwidths, is robust against errors in geometry. estimator consistent, its statistical efficiency only slightly suboptimal. discuss bias, variance, asymptotics,...
On-farm experimentation (OFE) is a farmer-centric process that can enhance the adoption of digital agriculture technologies and improve farm profitability sustainability. Farmers work with consultants or researchers to design implement experiments using their own machinery test management practices at field scale. Analysis data from OFE challenging because large spatial variation influenced by autocorrelation not due treatment being tested often much larger than effects. In addition,...
We describe efficient algorithms and open-source code for the second-order statistical analysis of point events on a linear network. Typical summary statistics are adaptations Ripley's K-function pair correlation function to case network, with distance measured by shortest path in Simple implementations consume substantial time memory. For an implementation, data structure representing network must be economical its use memory, but also enable rapid searches made. have developed such...
Abstract Metabolite identification is the greatest challenge when analysing metabolomics data, as only a small proportion of metabolite reference standards exist. Clustering MS/MS spectra common method to identify similar compounds, however interrogation underlying signature fragmentation patterns within clusters can be problematic. Previously published high-resolution LC-MS/MS data from bioluminescent beetle ( Photinus pyralis ) provided an opportunity mine new specialized metabolites in...
The spectral intensity distribution of the spontaneous emission from n-type GaAs excited by an electron beam is calculated theory recombination statistics injected carriers assuming arbitrary values diffusion length minority and using optical absorption data as reportert in literature. exact value then shown to be accurately determined comparing curves with spectra experimentally observed elsewhere. accuracy determination procedure suggested here expected very high. Die spektrale...
Summary Motivated by the analysis of a comprehensive database road traffic accidents, we investigate methods variable selection for spatial point process models on linear network. The original data may include explanatory covariates, such as curvature, and ‘mark’ variables attributed to individual accident severity. treatment mark is new. Variable applied canonical which covariate effects, effects mark‐covariate interactions. We approximate likelihood model that generalised model, in way...
Traditional kernel methods for estimating the spatially-varying density of points in a spatial point pattern may exhibit unrealistic artefacts, addition to familiar problems bias and over- or under-smoothing. Performance can be improved by using diffusion smoothing, which smoothing is heat on domain. This paper develops into practical statistical methodology two-dimensional data. We clarify advantages disadvantages over Gaussian smoothing. Adaptive where bandwidth spatially-varying,...
In this research, we propose probabilistic approaches to identify pairwise patterns of species co-occurrence by using presence-absence maps only. particular, the two-by-two contingency table constructed from a map two would be sufficient compute test statistics and perform statistical tests proposed in article. Some previous studies have investigated through incidence data different survey sites. We focus on for specific study plot instead. The methods are assessed thorough simulation...
The structured partial quadratic inverse eigenvalue problem (SPQIEP) is to construct the matrix polynomial using eigendata. structures arising in physical applications include symmetry, band (tridiagonal, diagonal, pentagonal) etc. construction of most difficult aspect this and research on rare. In paper, symmetric (SBPQIEP) for damped mass spring system considered. This concerns finding matrices M∈Rn×n, K∈Rn×n C ∈Rn×n with bandwidth p from m ( 1≤m≤2n) prescribed eigenpairs so that...