Search

Hierarchically structured cellular solids have attracted increasing attention for their superior mass-specific mechanical properties. Using a remeshing-based continuum finite element (FE) framework, we reveal that two-scale metallic hierarchical solids exhibit a distinct, localized deformation mode that involves necking and fracture of microscale tension members even at small global compressive strains (3-5%). The tensile failure is always preceded by plastic buckling of a complementary compression member. This combined necking-buckling (NB) mode critically underlies the collapse of hexagon-triangle (HTH) hierarchical lattices over a wide range of relative densities and length-scale ratios and is also seen in diamond-triangle (DTH) lattices. In lattices with very slender microscale members, necking is prevented by a competing failure mode that involves coordinated buckling (CB) of multiple members. Our custom remeshing FE framework is critical to resolve the localized large plastic strains, ductile failure, and complex local modes of deformation (including cusp formation) that are characteristic of the NB mode. A theoretical buckling analysis supports the inevitability of the NB and CB modes in HTH lattices. The occurrence of the NB mode has consequences for energy absorption by two-scale hierarchical solids, and hence influences their design.

Brain-inspired algorithms are attractive and emerging alternatives to classical deep learning methods for use in various machine learning applications. Brain-inspired systems can feature local learning rules, both unsupervised/semi-supervised learning and different types of plasticity (structural/synaptic), allowing them to potentially be faster and more energy-efficient than traditional machine learning alternatives. Among the more salient brain-inspired algorithms are Bayesian Confidence Propagation Neural Networks (BCPNNs). BCPNN is an important tool for both machine learning and computational neuroscience research, and recent work shows that BCPNN can reach state-of-the-art performance in tasks such as learning and memory recall compared to other models. Unfortunately, BCPNN is primarily executed on slow general-purpose processors (CPUs) or power-hungry graphics processing units (GPUs), reducing the applicability of using BCPNN in (among others) Edge systems. In this work, we design a custom stream-based accelerator for BCPNN using Field-Programmable Gate Arrays (FPGA) using Xilinx Vitis High-Level Synthesis (HLS) flow. Furthermore, we model our accelerator's performance using first principles, and we empirically show that our proposed accelerator is between 1.3x - 5.3x faster than an Nvidia A100 GPU while at the same time consuming between 2.62x - 3.19x less power and 5.8x - 16.5x less energy without any degradation in performance.

Let $P(z)$ be a polynomial of degree $n$. In $2004$, Aziz and Rather \cite{aziz2004some} investigated the dependence of \[\bigg|P(Rz)-\alpha P(z)+\beta\biggl\{\biggl(\frac{R+1}{2}\biggr)^n-|\alpha|\biggr\}P(z)\bigg|, \ \text{for} \ z \in B(\mathbb{D}),\] on $\max_{z\in B(\mathbb{D})}|P(z)|$, for every real and complex number $\alpha, \beta$ satisfying $|\alpha| \leq 1$, $|\beta| \leq 1$, and $R \geq 1$. This paper presents a compact generalization of several well-known polynomial inequalities using modified Smirnov operator, demonstrating that the operator preserves inequalities between polynomials., Comment: 10 pages

Principal Component Analysis (PCA) is a widely used method for dimensionality reduction, but it often overlooks fairness, especially when working with data that includes demographic characteristics. This can lead to biased representations that disproportionately affect certain groups. To address this issue, our approach incorporates Joint Eigenvalue Decomposition (JEVD), a technique that enables the simultaneous diagonalization of multiple matrices, ensuring fair and efficient representations. We formally show that the optimal solution of JEVD leads to a fair PCA solution. By integrating JEVD with PCA, we strike an optimal balance between preserving data structure and promoting fairness across diverse groups. We demonstrate that our method outperforms existing baseline approaches in fairness and representational quality on various datasets. It retains the core advantages of PCA while ensuring that sensitive demographic attributes do not create disparities in the reduced representation.

Federated Learning (FL) emerged as a learning method to enable the server to train models over data distributed among various clients. These clients are protective about their data being leaked to the server, any other client, or an external adversary, and hence, locally train the model and share it with the server rather than sharing the data. The introduction of sophisticated inferencing attacks enabled the leakage of information about data through access to model parameters. To tackle this challenge, privacy-preserving federated learning aims to achieve differential privacy through learning algorithms like DP-SGD. However, such methods involve adding noise to the model, data, or gradients, reducing the model's performance. This work provides a theoretical analysis of the tradeoff between model performance and communication complexity of the FL system. We formally prove that training for one local epoch per global round of training gives optimal performance while preserving the same privacy budget. We also investigate the change of utility (tied to privacy) of FL models with a change in the number of clients and observe that when clients are training using DP-SGD and argue that for the same privacy budget, the utility improved with increased clients. We validate our findings through experiments on real-world datasets. The results from this paper aim to improve the performance of privacy-preserving federated learning systems.

Many real-world systems can be modeled as dynamic graphs, where nodes and edges evolve over time, requiring specialized models to capture their evolving dynamics in risk-sensitive applications effectively. Temporal graph neural networks (GNNs) are one such category of specialized models. For the first time, our approach integrates a reject option strategy within the framework of GNNs for continuous-time dynamic graphs. This allows the model to strategically abstain from making predictions when the uncertainty is high and confidence is low, thus minimizing the risk of critical misclassification and enhancing the results and reliability. We propose a coverage-based abstention prediction model to implement the reject option that maximizes prediction within a specified coverage. It improves the prediction score for link prediction and node classification tasks. Temporal GNNs deal with extremely skewed datasets for the next state prediction or node classification task. In the case of class imbalance, our method can be further tuned to provide a higher weightage to the minority class. Exhaustive experiments are presented on four datasets for dynamic link prediction and two datasets for dynamic node classification tasks. This demonstrates the effectiveness of our approach in improving the reliability and area under the curve (AUC)/ average precision (AP) scores for predictions in dynamic graph scenarios. The results highlight our model's ability to efficiently handle the trade-offs between prediction confidence and coverage, making it a dependable solution for applications requiring high precision in dynamic and uncertain environments.

The rapid rise of large language models (LLMs) has unlocked many applications but also underscores the challenge of aligning them with diverse values and preferences. Direct Preference Optimization (DPO) is central to alignment but constrained by fixed divergences and limited feature transformations. We propose DPO-Kernels, which integrates kernel methods to address these issues through four key contributions: (i) Kernelized Representations with polynomial, RBF, Mahalanobis, and spectral kernels for richer transformations, plus a hybrid loss combining embedding-based and probability-based objectives; (ii) Divergence Alternatives (Jensen-Shannon, Hellinger, Renyi, Bhattacharyya, Wasserstein, and f-divergences) for greater stability; (iii) Data-Driven Selection metrics that automatically choose the best kernel-divergence pair; and (iv) a Hierarchical Mixture of Kernels for both local precision and global modeling. Evaluations on 12 datasets demonstrate state-of-the-art performance in factuality, safety, reasoning, and instruction following. Grounded in Heavy-Tailed Self-Regularization, DPO-Kernels maintains robust generalization for LLMs, offering a comprehensive resource for further alignment research.

Images generated by text-to-image (T2I) models often exhibit visual biases and stereotypes of concepts such as culture and profession. Existing quantitative measures of stereotypes are based on statistical parity that does not align with the sociological definition of stereotypes and, therefore, incorrectly categorizes biases as stereotypes. Instead of oversimplifying stereotypes as biases, we propose a quantitative measure of stereotypes that aligns with its sociological definition. We then propose OASIS to measure the stereotypes in a generated dataset and understand their origins within the T2I model. OASIS includes two scores to measure stereotypes from a generated image dataset: (M1) Stereotype Score to measure the distributional violation of stereotypical attributes, and (M2) WALS to measure spectral variance in the images along a stereotypical attribute. OASIS also includes two methods to understand the origins of stereotypes in T2I models: (U1) StOP to discover attributes that the T2I model internally associates with a given concept, and (U2) SPI to quantify the emergence of stereotypical attributes in the latent space of the T2I model during image generation. Despite the considerable progress in image fidelity, using OASIS, we conclude that newer T2I models such as FLUX.1 and SDv3 contain strong stereotypical predispositions about concepts and still generate images with widespread stereotypical attributes. Additionally, the quantity of stereotypes worsens for nationalities with lower Internet footprints., Comment: Accepted as a Spotlight paper at ICLR 2025

The increasing integration of artificial intelligence (AI) within cybersecurity has necessitated stronger encryption methods to ensure data security. This paper presents a comparative analysis of symmetric (SE) and asymmetric encryption (AE) algorithms, focusing on their role in securing sensitive information in AI-driven environments. Through an in-depth study of various encryption algorithms such as AES, RSA, and others, this research evaluates the efficiency, complexity, and security of these algorithms within modern cybersecurity frameworks. Utilizing both qualitative and quantitative analysis, this research explores the historical evolution of encryption algorithms and their growing relevance in AI applications. The comparison of SE and AE algorithms focuses on key factors such as processing speed, scalability, and security resilience in the face of evolving threats. Special attention is given to how these algorithms are integrated into AI systems and how they manage the challenges posed by large-scale data processing in multi-agent environments. Our results highlight that while SE algorithms demonstrate high-speed performance and lower computational demands, AE algorithms provide superior security, particularly in scenarios requiring enhanced encryption for AI-based networks. The paper concludes by addressing the security concerns that encryption algorithms must tackle in the age of AI and outlines future research directions aimed at enhancing encryption techniques for cybersecurity., Comment: 18 pages, 3 figures

Document comparison typically relies on optical character recognition (OCR) as its core technology. However, OCR requires the selection of appropriate language models for each document and the performance of multilingual or hybrid models remains limited. To overcome these challenges, we propose text change detection (TCD) using an image comparison model tailored for multilingual documents. Unlike OCR-based approaches, our method employs word-level text image-to-image comparison to detect changes. Our model generates bidirectional change segmentation maps between the source and target documents. To enhance performance without requiring explicit text alignment or scaling preprocessing, we employ correlations among multi-scale attention features. We also construct a benchmark dataset comprising actual printed and scanned word pairs in various languages to evaluate our model. We validate our approach using our benchmark dataset and public benchmarks Distorted Document Images and the LRDE Document Binarization Dataset. We compare our model against state-of-the-art semantic segmentation and change detection models, as well as to conventional OCR-based models., Comment: 15pages, 11figures 6tables, wacv2025 accepted

One of the key tasks in graph learning is node classification. While Graph neural networks have been used for various applications, their adaptivity to reject option setting is not previously explored. In this paper, we propose NCwR, a novel approach to node classification in Graph Neural Networks (GNNs) with an integrated reject option, which allows the model to abstain from making predictions when uncertainty is high. We propose both cost-based and coverage-based methods for classification with abstention in node classification setting using GNNs. We perform experiments using our method on three standard citation network datasets Cora, Citeseer and Pubmed and compare with relevant baselines. We also model the Legal judgment prediction problem on ILDC dataset as a node classification problem where nodes represent legal cases and edges represent citations. We further interpret the model by analyzing the cases that the model abstains from predicting by visualizing which part of the input features influenced this decision.

Long video understanding presents challenges due to the inherent high computational complexity and redundant temporal information. An effective representation for long videos must process such redundancy efficiently while preserving essential contents for downstream tasks. This paper introduces SEmantic Attention Learning (SEAL), a novel unified representation for long videos. To reduce computational complexity, long videos are decomposed into three distinct types of semantic entities: scenes, objects, and actions, allowing models to operate on a handful of entities rather than a large number of frames or pixels. To further address redundancy, we propose an attention learning module that balances token relevance with diversity formulated as a subset selection optimization problem. Our representation is versatile, enabling applications across various long video understanding tasks. Extensive experiments show that SEAL significantly outperforms state-of-the-art methods in video question answering and temporal grounding tasks and benchmarks including LVBench, MovieChat-1K, and Ego4D.

Latest developments in Large Multimodal Models (LMMs) have broadened their capabilities to include video understanding. Specifically, Text-to-video (T2V) models have made significant progress in quality, comprehension, and duration, excelling at creating videos from simple textual prompts. Yet, they still frequently produce hallucinated content that clearly signals the video is AI-generated. We introduce ViBe: a large-scale Text-to-Video Benchmark of hallucinated videos from T2V models. We identify five major types of hallucination: Vanishing Subject, Numeric Variability, Temporal Dysmorphia, Omission Error, and Physical Incongruity. Using 10 open-source T2V models, we developed the first large-scale dataset of hallucinated videos, comprising 3,782 videos annotated by humans into these five categories. ViBe offers a unique resource for evaluating the reliability of T2V models and provides a foundation for improving hallucination detection and mitigation in video generation. We establish classification as a baseline and present various ensemble classifier configurations, with the TimeSFormer + CNN combination yielding the best performance, achieving 0.345 accuracy and 0.342 F1 score. This benchmark aims to drive the development of robust T2V models that produce videos more accurately aligned with input prompts.

In the usual statistical inference problem, we estimate an unknown parameter of a statistical model using the information in the random sample. A priori information about the parameter is also known in several real-life situations. One such information is order restriction between the parameters. This prior formation improves the estimation quality. In this paper, we deal with the component-wise estimation of location parameters of two exponential distributions studied with ordered scale parameters under a bowl-shaped affine invariant loss function and generalized Pitman closeness criterion. We have shown that several benchmark estimators, such as maximum likelihood estimators (MLE), uniformly minimum variance unbiased estimators (UMVUE), and best affine equivariant estimators (BAEE), are inadmissible. We have given sufficient conditions under which the dominating estimators are derived. Under the generalized Pitman closeness criterion, a Stein-type improved estimator is proposed. As an application, we have considered special sampling schemes such as type-II censoring, progressive type-II censoring, and record values. Finally, we perform a simulation study to compare the risk performance of the improved estimators

It is well known that locally defined marginally outer trapped surface (MOTS) is null and coincident with the event horizon of an unperturbed static Schwarzschild black hole. This is however not true for an accreting black hole for which MOTS separates out and turns spacelike. In this letter, we obtain the necessary and sufficient condition for MOTS to remain null and coincident with the event horizon even when matter is continuously accreting on. This also has an important bearing on the quantum Hawking radiation which is supposed to emanate from the MOTS, and it cannot propagate out to infinity unless MOTS is null. The condition is, infalling timelike Type I fluid should turn null or Type II, as it falls on the horizon. This transition from timelike to null is caused by the tidal deformation of the infalling fluid, and that produces an outward directed heat flux giving rise to Vaidya radiation emanating out of the boundary of accreting zone. We thus predict a remarkable new phenomena that accreting black hole radiates classical Vaidya radiation that paves the way for the Hawking radiation., Comment: 5 pages, Revtex4

In the contemporary world of dynamic digital solutions and services, the significance of effective and stable cloud solutions cannot be overestimated. The cloud adaptation is becoming more popular due to mobile advantages, including flexibility, cheaper costs and scalability. However, creating a fail-proof architecture that can accommodate scale-up and enable high data availability and security is not an easy task. In this paper, a discussion will be made regarding significant measures required in designing contexts inside the cloud environment. It explores the need for replicate servers, fault tolerance, disaster backup and load balancing for high availability. Further, the paper also discusses the optimum strategy for designing cloud infrastructures such as microservices, containerization, and serverless. Based on the literature review, we analyze various approaches that are used to improve cloud reliability and elasticity. The paper also provides a best practice guide for designing a cloud infrastructure for these requirements concerning cases. The results and discussion section outlines the improvement in business continuity and operational efficiency when using the proposed architecture. This paper concludes with recommendations for future studies and the successful application of the elaborated matters.

The use of social media applications, hate speech engagement, and public debates among teenagers, primarily by university and college students, is growing day by day. The feelings of tremendous stress, anxiety, and depression via social media among our youths have a direct impact on their daily lives and personal workspace apart from delayed sleep, social media addictions, and memory loss. The use of NO phone times and NO phone zones is now popular in workplaces and family cultures. The use of hate speech, negotiations, and toxic words can lead to verbal abuse and cybercrime. Growing concern of mobile device security, cyberbullying, ransomware attacks, and mental health issues are another serious impact of social media among university students. The future challenges including health issues of social media use and hate speech has a serious impact on livelihood, freedom, and diverse communities of university students. Our case study is related to social media use and hate speech related to public debates over university students. We have presented the analysis and impact of social media and hate speech with several conclusions, cybercrimes, and components. The use of questionnaires for collecting primary data over university students help in the analysis of case study. The conclusion of case study and future scope of the research is extremely important to counter negative impacts., Comment: 12 pages, 7 figures

The financial sector's dependence on digital infrastructure increases its vulnerability to cybersecurity threats, requiring strong IT security protocols with other entities. This collaboration, however, is often identified as the most vulnerable link in the chain of cybersecurity. Adopting both symbolic and substantive measures lessens the impact of IT security spending on decreasing the frequency of data security breaches in the long run. The Protection Motivation Theory clarifies actions triggered by data sharing with other organizations, and the Institutional theory aids in comprehending the intricate relationship between transparency and organizational conduct. We investigate how things like regulatory pressure, teamwork among institutions, and people's motivations to protect themselves influence cybersecurity. By using simple theories to understand these factors, this research aims to provide insights that can help financial institutions make better decisions to protect. We have also included the discussion, conclusion, and future directions in regard to collaboration in financial sector cybersecurity for exploring impact of resource sharing., Comment: 8 pages, 2 figures

Automating end-to-end Exploratory Data Analysis (AutoEDA) is a challenging open problem, often tackled through Reinforcement Learning (RL) by learning to predict a sequence of analysis operations (FILTER, GROUP, etc). Defining rewards for each operation is a challenging task and existing methods rely on various \emph{interestingness measures} to craft reward functions to capture the importance of each operation. In this work, we argue that not all of the essential features of what makes an operation important can be accurately captured mathematically using rewards. We propose an AutoEDA model trained through imitation learning from expert EDA sessions, bypassing the need for manually defined interestingness measures. Our method, based on generative adversarial imitation learning (GAIL), generalizes well across datasets, even with limited expert data. We also introduce a novel approach for generating synthetic EDA demonstrations for training. Our method outperforms the existing state-of-the-art end-to-end EDA approach on benchmarks by upto 3x, showing strong performance and generalization, while naturally capturing diverse interestingness measures in generated EDA sessions., Comment: Accepted at AIMLSystems '24

Robustness towards adversarial attacks is a vital property for classifiers in several applications such as autonomous driving, medical diagnosis, etc. Also, in such scenarios, where the cost of misclassification is very high, knowing when to abstain from prediction becomes crucial. A natural question is which surrogates can be used to ensure learning in scenarios where the input points are adversarially perturbed and the classifier can abstain from prediction? This paper aims to characterize and design surrogates calibrated in "Adversarial Robust Reject Option" setting. First, we propose an adversarial robust reject option loss $\ell_{d}^{\gamma}$ and analyze it for the hypothesis set of linear classifiers ($\mathcal{H}_{\textrm{lin}}$). Next, we provide a complete characterization result for any surrogate to be $(\ell_{d}^{\gamma},\mathcal{H}_{\textrm{lin}})$- calibrated. To demonstrate the difficulty in designing surrogates to $\ell_{d}^{\gamma}$, we show negative calibration results for convex surrogates and quasi-concave conditional risk cases (these gave positive calibration in adversarial setting without reject option). We also empirically argue that Shifted Double Ramp Loss (DRL) and Shifted Double Sigmoid Loss (DSL) satisfy the calibration conditions. Finally, we demonstrate the robustness of shifted DRL and shifted DSL against adversarial perturbations on a synthetically generated dataset., Comment: Accepted at Asian Conference on Machine Learning (ACML) , 2024

The ubiquitous deployment of deep learning systems on resource-constrained Edge devices is hindered by their high computational complexity coupled with their fragility to out-of-distribution (OOD) data, especially to naturally occurring common corruptions. Current solutions rely on the Cloud to train and compress models before deploying to the Edge. This incurs high energy and latency costs in transmitting locally acquired field data to the Cloud while also raising privacy concerns. We propose GEARnn (Growing Efficient, Accurate, and Robust neural networks) to grow and train robust networks in-situ, i.e., completely on the Edge device. Starting with a low-complexity initial backbone network, GEARnn employs One-Shot Growth (OSG) to grow a network satisfying the memory constraints of the Edge device using clean data, and robustifies the network using Efficient Robust Augmentation (ERA) to obtain the final network. We demonstrate results on a NVIDIA Jetson Xavier NX, and analyze the trade-offs between accuracy, robustness, model size, energy consumption, and training time. Our results demonstrate the construction of efficient, accurate, and robust networks entirely on an Edge device., Comment: 10 pages

In the current legal environment, it is essential to prioritize the protection and reliability of data to promote trust and effectiveness. This study examines how blockchain technology in the form of blockLAW can be applicable to investigate its effects on legal automation, cybersecurity, and ethical concerns. The decentralized ledger and unchangeable characteristics of Blockchain provide opportunities to simplify legal procedures, automate contract execution with smart contracts, and improve transparency in legal transactions. Blockchain is seen as a crucial instrument for updating legal processes while maintaining ethical standards, tackling issues like scalability, regulatory adherence, and ethical dilemmas such as privacy and fairness. The study examines recent developments and evaluates blockchain impact on legal structures, offering perspectives on its potential to enhance legal procedures and guarantee transparency in legal systems. It further emphasizes blockchain ability to redefine how legal professionals handle and protect sensitive information, leading to stronger, more effective, and reliable legal procedures. We have also discussed the technological considerations when it comes to blockchain integration into legal systems like integration planning, implementation strategies, innovations, advancements, trends with Blockchain Integration Framework for legal systems., Comment: 14 pages, 2 figures

In today's digitally driven landscape, robust Information Technology (IT) risk assessment practices are essential for safeguarding systems, digital communication, and data. This paper introduces 'AssessITS', an actionable method designed to provide organizations with comprehensive guidelines for conducting IT and cybersecurity risk assessments. Drawing extensively from NIST 800-30 Rev 1, COBIT 5, and ISO 31000, 'AssessITS' bridges the gap between high-level theoretical standards and practical implementation challenges. The paper outlines a step-by-step methodology that organizations can simply adopt to systematically identify, analyze, and mitigate IT risks. By simplifying complex principles into actionable procedures, this framework equips practitioners with the tools needed to perform risk assessments independently, without too much reliance on external vendors. The guidelines are developed to be straightforward, integrating practical evaluation metrics that allow for the precise quantification of asset values, threat levels, vulnerabilities, and impacts on confidentiality, integrity, and availability. This approach ensures that the risk assessment process is not only comprehensive but also accessible, enabling decision-makers to implement effective risk mitigation strategies customized to their unique operational contexts. 'AssessITS' aims to enable organizations to enhance their IT security strength through practical, actionable guidance based on internationally recognized standards., Comment: 25 pages, 8 figures, 7 tables

On the 29th of May 2023, the LIGO-Virgo-KAGRA Collaboration observed a compact binary coalescence event consistent with a neutron star-black hole merger, though the heavier object of mass 2.5-4.5 $M_\odot$ would fall into the purported lower mass gap. An alternative explanation for apparent observations of events in this mass range has been suggested as strongly gravitationally lensed binary neutron stars. In this scenario, magnification would lead to the source appearing closer and heavier than it really is. Here, we investigate the chances and possible consequences for the GW230529 event to be gravitationally lensed. We find this would require high magnifications and we obtain low rates for observing such an event, with a relative fraction of lensed versus unlensed observed events of $2 \times 10^{-3}$ at most. When comparing the lensed and unlensed hypotheses accounting for the latest rates and population model, we find a 1/58 chance of lensing, disfavoring this option. Moreover, when the magnification is assumed to be strong enough to bring the mass of the heavier binary component below the standard limits on neutron star masses, we find high probability for the lighter object to have a sub-solar mass, making the binary even more exotic than a mass-gap neutron star-black hole system. Even when the secondary is not sub-solar, its tidal deformability would likely be measurable, which is not the case for GW230529. Finally, we do not find evidence for extra lensing signatures such as the arrival of additional lensed images, type-II image dephasing, or microlensing. Therefore, we conclude it is unlikely for GW230529 to be a strongly gravitationally lensed binary neutron star signal., Comment: 15 pages, 11 figures

Empirical likelihood (EL) and its extension via the jackknife empirical likelihood (JEL) method provide robust alternatives to parametric approaches, in the contexts with uncertain data distributions. This paper explores the theoretical foundations and practical applications of JEL in the context of multivariate sample-based U-statistics. In this study we develop the JEL method for multivariate U-statistics with three (or more) samples. This study enhance the JEL methods capability to handle complex data structures while preserving the computation efficiency of the empirical likelihood method. To demonstrate the applications of the JEL method, we compute confidence intervals for differences in VUS measurements which have potential applications in classification problems. Monte Carlo simulation studies are conducted to evaluate the efficiency of the JEL, Normal approximation and Kernel based confidence intervals. These studies validate the superior performance of the JEL approach in terms of coverage probability and computational efficiency compared to other two methods. Additionally, a real data application illustrates the practical utility of the approach. The JEL method developed here has potential applications in dealing with complex data structures.

In this work, for the first time, a density functional theory (DFT) based comprehensive theoretical study is performed on the surface electronic properties of Bi2Se3 nanosheet in the presence of a surface capping layer as well as mechanical strain. The study systematically introduces a biaxial compressive and tensile strain up to 5% in natural, Sb2Se3 surface capped, and SbBiSe3 surface capped Bi2Se3, and the subsequent effects on the electronic properties are assessed from the surface energy band (E-k) structure, the density of states (DOS), band edge energy and bandgap variations, surface conducting state localization, and Fermi surface spin-textures. The key findings of this work are systematically analyzed from conducting surface state hybridization through bulk in the presence of surface capping layers and applied biaxial strain. The result demonstrates that the interplay of surface capping and strain can simultaneously tune the surface electronic structure, spin-momentum locking results from change in electronic localization and interactions. In essence, this work presents an extensive theoretical and design-level insight into the surface capping and biaxial strain co-engineering in Bi2Se3, which can potentially facilitate different topological transport for modern optoelectronics, spintronics, valleytronics, bulk photovoltaics applications of engineered nanostructured topological materials in the future.

The diversity of type Ia supernovae (SNe Ia) has become increasingly apparent with the rapid growth in observational data. Understanding the explosion mechanism of SNe Ia is crucial for their cosmological calibration and for advancing our knowledge of stellar physics. The estimation of $^{56}$Ni mass produced in these events is key to elucidating their explosion mechanism. This study compares two methods of $^{56}$Ni mass estimation. We first examine the relationship between peak luminosity and the second maximum in near-infrared (NIR) bands using observations of 18 nearby SNe Ia. Based on this relationship, we estimate the Ni mass for a set of nine well-observed SNe Ia using the Arnett rule. Additionally, we estimate the $^{56}$Ni mass using bolometric light curves of these SNe through energy conservation arguments. A comparison of these two estimation methods using Student's t-test reveals no statistically significant differences between the estimates. This finding suggests that both methods provide robust estimates of Ni mass in SNe Ia.

A recent report by Barik et al. [Nature Chemistry 14, 1098, 2022] on ambient-light-induced intermolecular Coulombic decay (ICD) in unbound pyridine monomers proposes the formation of a pyridine cation via intermolecular Coulombic decay following a three-body association/collision, wherein all the three pyridine molecules are in the excited state. The collision-free conditions of the free-jet expansion, an abysmally low probability of finding three independently excited pyridine molecules in the vicinity of each other, and extremely low excited state lifetimes negate the possibility of ICD in unbound pyridine monomers. An alternate mechanism, wherein the pyridine monomer cation originates from the dissociative ionization of pyridine dimers following a three-photon absorption process, based on the translational energy measurements of pyridine cation is proposed.

This research investigates flight delay trends by examining factors such as departure time, airline, and airport. It employs regression machine learning methods to predict the contributions of various sources to delays. Time-series models, including LSTM, Hybrid LSTM, and Bi-LSTM, are compared with baseline regression models such as Multiple Regression, Decision Tree Regression, Random Forest Regression, and Neural Network. Despite considerable errors in the baseline models, the study aims to identify influential features in delay prediction, potentially informing flight planning strategies. Unlike previous work, this research focuses on regression tasks and explores the use of time-series models for predicting flight delays. It offers insights into aviation operations by independently analyzing each delay component (e.g., security, weather)., Comment: 10 pages, 11 figures, 6 tables

Computer vision systems have witnessed rapid progress over the past two decades due to multiple advances in the field. As these systems are increasingly being deployed in high-stakes real-world applications, there is a dire need to ensure that they do not propagate or amplify any discriminatory tendencies in historical or human-curated data or inadvertently learn biases from spurious correlations. This paper presents a comprehensive survey on fairness that summarizes and sheds light on ongoing trends and successes in the context of computer vision. The topics we discuss include 1) The origin and technical definitions of fairness drawn from the wider fair machine learning literature and adjacent disciplines. 2) Work that sought to discover and analyze biases in computer vision systems. 3) A summary of methods proposed to mitigate bias in computer vision systems in recent years. 4) A comprehensive summary of resources and datasets produced by researchers to measure, analyze, and mitigate bias and enhance fairness. 5) Discussion of the field's success, continuing trends in the context of multimodal foundation and generative models, and gaps that still need to be addressed. The presented characterization should help researchers understand the importance of identifying and mitigating bias in computer vision and the state of the field and identify potential directions for future research., Comment: 20 pages, 4 figures

Social Engineering is the act of manipulating individuals to perform actions or reveal information. Social engineering tactics are widely recognized as a significant risk to information security. The increasing digital environment has increased the prevalence of social engineering attacks, bringing huge threats to both people and organizations. This paper explores current deception techniques used during social engineering attacks to understand emerging trends and discuss effective countermeasures. It is always a good idea to have knowledge of counter measures and risks from these increasing cyber threats. We have also explored the types of deception attacks and role of social engineering in Advanced Persistent Threats. Today major concern for cybersecurity and other web related attacks is due to social engineering attacks that is also the driving force of increasing cybercrimes worldwide. By uncovering emerging trends and analyzing the psychological underpinnings of these attacks this paper highlights the known deception techniques, emerging trends and counter measures of social engineering attacks., Comment: 10 pages, 3 figures

Several types of cyber-attacks on automobiles and business firms keep on rising as we are preparing to counter cybercrimes with several new technologies and defense models. Cyber defense (also, counter intelligence) is a computer network defense mechanism that involves response to activities, critical infrastructure protection, and information assurance for corporations, government bodies, and other conceivable networks. Cyber defense focuses on preventing, detecting, and responding to assaults or threats in a timely manner so that no infrastructure or information is compromised. With the increasing volume and complexity of cyber threats, most companies need cyber defense to protect sensitive information and assets. We can control attacker actions by utilizing firewalls at different levels, an intrusion detection system (IDS), with the intrusion prevention system (IPS) which can be installed independently or in combination with other protection approaches. Tesla is an American clean energy and automotive company in Austin, Texas, USA. The recent data breach at Tesla affected over 75,000 individuals as the company pinpoints two former employees as the offender revealing more than 23,000 internal files from 2015 to 2022. In this work, we will emphasize data modeling and data analysis using cyber defense model and python with a survey of the Tesla company. We have proposed a defense model, DefTesPY, with enhanced data modeling and data analysis based on the encountered cyber-attacks and cybercrimes for Tesla company till date., Comment: 11 pages, 4 figures

In the past decade, lithium niobate (LiNbO3 or LN) photonics, thanks to its heat-free and fast electro-optical modulation, second-order non-linearities and low loss, has been extensively investigated. Despite numerous demonstrations of high-performance LN photonics, processing lithium niobate remains challenging and suffers from incompatibilities with standard complementary metal-oxide semiconductor (CMOS) fabrication lines, limiting its scalability. Silicon carbide (SiC) is an emerging material platform with a high refractive index, a large non-linear Kerr coefficient, and a promising candidate for heterogeneous integration with LN photonics. Current approaches of SiC/LN integration require transfer-bonding techniques, which are time-consuming, expensive, and lack precision in layer thickness. Here we show that amorphous silicon carbide (a-SiC), deposited using inductively coupled plasma enhanced chemical vapor deposition (ICPCVD) at low temperatures (< 165 C), can be conveniently integrated with LiNbO3 and processed to form high-performance photonics. Most importantly, the fabrication only involves a standard, silicon-compatible, reactive ion etching step and leaves the LiNbO3 intact, hence its compatibility with standard foundry processes. As a proof-of-principle, we fabricated waveguides and ring resonators on the developed a-SiC/LN platform and achieved intrinsic quality factors higher than 106,000 and resonance electro-optic tunability of 3.4 pm/V with 3 mm tuning length. We showcase the possibility of dense integration by fabricating and testing ring resonators with 40um radius without a noticeable loss penalty. Our platform offers a CMOS-compatible and scalable approach for implementation of future fast electro-optic modulators and reconfigurable photonic circuits as well as nonlinear processes which can benefit from involving both second and third-order nonlinearities., Comment: 9 pages, 4 figures

Integrated photonic circuits have transformed data communication, biosensing, and light detection and ranging, and hold wide-ranging potential for optical computing, optical imaging and signal processing. These applications often require tunable and reconfigurable photonic components, most commonly accomplished through the thermo-optic effect. However, the resulting tuning window is limited for standard optical materials such as silicon dioxide and silicon nitride. Most importantly, bidirectional thermal tuning on a single platform has not been realized. For the first time, we show that by tuning and optimizing the deposition conditions in inductively-coupled plasma chemical vapor deposition (ICPCVD) of silicon dioxide, this material can be used to deterministically tune the thermo-optic properties of optical devices without introducing significant losses. We demonstrate that we can deterministically integrate positive and negative wavelength shifts on a single chip, validated on amorphous silicon carbide (a-SiC), silicon nitride (SiN) and silicon-on-insulator (SOI) platforms. We observe up to a 10-fold improvement of the thermo-optic tunability and, in addition, demonstrate athermal ring resonators with shifts as low as 1.5 pm/{\deg}C. This enables the fabrication of a novel tunable coupled ring optical waveguide (CROW) requiring only a single heater. In addition, the low-temperature deposition of our silicon dioxide cladding can be combined with lift-off to isolate the optical devices resulting in a decrease in thermal crosstalk by at least two orders of magnitude. Our method paves the way for novel photonic architectures incorporating bidirectional thermo-optic tunability.