Miracle-dz/UniFAR-FTUs huggingface dataset:
Analysis of Recent Trends in Face Recognition Systems

With the tremendous advancements in face recognition technology, face modality has been widely recognized as a significant biometric identifier in establishing a person's identity rather than any other biometric trait like fingerprints that require contact sensors. However, due to inter-class similarities and intra-class variations, face recognition systems generate false match and false non-match errors respectively. Recent research focuses on improving the robustness of extracted features and the pre-processing algorithms to enhance recognition accuracy. Since face recognition has been extensively used for several applications ranging from law enforcement to surveillance systems, the accuracy and performance of face recognition must be the finest. In this paper various face recognition systems are discussed and analysed like RPRV, LWKPCA, SVM Model, LTrP based SPM and a deep learning framework for recognising images from CCTV. All these face recognition methods, their implementations and performance evaluations are compared to derive the best outcome for future developmental works.
ChatGPT in Computer Science Curriculum Assessment: An analysis of Its Successes and Shortcomings

The application of Artificial intelligence for teaching and learning in the academic sphere is a trending subject of interest in computing education. ChatGPT, as an AI-based tool, provides various advantages, such as heightened student involvement, cooperation, accessibility, and availability. This paper addresses the prospects and obstacles associated with utilizing ChatGPT as a tool for learning and assessment in undergraduate Computer Science curriculum in particular to teaching and learning fundamental programming courses. Students having completed the course work for a Data Structures and Algorithms (a sophomore-level course) participated in this study. Two groups of students were given programming challenges to solve within a short period of time. The control group (group A) had access to textbooks and notes of programming courses, however, no Internet access was provided. Group B students were given access to ChatGPT and were encouraged to use it to help solve the programming challenges. The challenge was conducted in a computer lab environment using Programming Contest Control (PC2) environment which is widely used in ACM International Collegiate Programming Contest (ICPC). Each team of students addresses the problem by writing executable code that satisfies a certain number of test cases. Student teams were scored based on their performance in terms of the number of successfully passed test cases. Results show that students using ChatGPT had an advantage in terms of earned scores, however, there were inconsistencies and inaccuracies in the submitted code consequently affecting the overall performance. After a thorough analysis, the paper’s findings indicate that incorporating AI in higher education brings about various opportunities and challenges. Nonetheless, universities can efficiently manage these apprehensions by adopting a proactive and ethical stance toward the implementation of such tools.
Evaluating ChatGPT's Information Extraction Capabilities: An Assessment of Performance, Explainability, Calibration, and Faithfulness

The capability of Large Language Models (LLMs) like ChatGPT to comprehend user intent and provide reasonable responses has made them extremely popular lately. In this paper, we focus on assessing the overall ability of ChatGPT using 7 fine-grained information extraction (IE) tasks. Specially, we present the systematically analysis by measuring ChatGPT's performance, explainability, calibration, and faithfulness, and resulting in 15 keys from either the ChatGPT or domain experts. Our findings reveal that ChatGPT's performance in Standard-IE setting is poor, but it surprisingly exhibits excellent performance in the OpenIE setting, as evidenced by human evaluation. In addition, our research indicates that ChatGPT provides high-quality and trustworthy explanations for its decisions. However, there is an issue of ChatGPT being overconfident in its predictions, which resulting in low calibration. Furthermore, ChatGPT demonstrates a high level of faithfulness to the original text in the majority of cases. We manually annotate and release the test sets of 7 fine-grained IE tasks contains 14 datasets to further promote the research. The datasets and code are available at https://github.com/pkuserc/ChatGPT_for_IE.
Patterson-Sullivan measures for transverse subgroups

We study Patterson-Sullivan measures for a class of discrete subgroups of higher rank semisimple Lie groups, called transverse groups, whose limit set is well-defined and transverse in a partial flag variety. This class of groups includes both Anosov and relatively Anosov groups, as well as all discrete subgroups of rank one Lie groups. We prove an analogue of the Hopf-Tsuji-Sullivan dichotomy and then use this dichotomy to prove a variant of Burger's Manhattan curve theorem. We also use the Patterson-Sullivan measures to obtain conditions for when a subgroup has critical exponent strictly less than the original transverse group. These gap results are new even for Anosov groups.
Optimal Vehicle Charging in Bilevel Power-Traffic Networks via Charging Demand Function

Electric vehicle (EV) charging couples the operation of power and traffic networks. Specifically, the power network determines the charging price at various locations, while EVs on the traffic network optimize the charging power given the price, acting as price-takers. We model such decision-making processes by a bilevel program, with the power network at the upper-level and the traffic network at the lower-level. However, since the two networks are managed by separate entities and the charging expense term, calculated as the product of charging price and charging demand, is nonlinear. Solving the bilevel program is nontrivial. To overcome these challenges, we derive the charging demand function using multiparametric programming theory. This function establishes a piecewise linear relationship between the charging price and the optimal charging power, enabling the power network operator to manage EV charging power independently while accounting for the coupling between the two networks. With the derived function, we are also able to replace the nonlinear charging expense term with a piecewise quadratic one, thus guaranteeing solution optimality. Our numerical studies demonstrate that different traffic demands can have an impact on charging patterns and the power network can effectively incentivize charging at low-price nodes through price setting.
Hierarchical bubble size distributions in coarsening wet liquid foams

Significance Coarsening is a ubiquitous phenomenon in phase separations. It is widely observed in alloys, polymers, emulsions, foams, and even in biological systems. However, coarsening of materials where the two phases have comparable volume fractions is still poorly understood. To fill this gap, we performed coarsening experiments on aqueous foams in microgravity—free from gravity-driven destabilization. We discovered that coarsening naturally produces, besides large jammed bubbles, a significant proportion of small roaming bubbles. This hierarchical size distribution is surprising but could be general and exist in other coarsening systems. Foaming being a generic method to produce solid cellular materials with many applications, making use of these roaming bubbles opens up a new way of designing hierarchical materials.
On the lifting and reconstruction of nonlinear systems with multiple attractors ∗

The Koopman operator provides a linear perspective on non-linear dynamics by focusing on the evolution of observables in an invariant subspace. Observables of interest are typically linearly re-constructed from the Koopman eigenfunctions. Despite the broad use of Koopman operators over the past few years, there exist some misconceptions about the applicability of Koopman operators to dynamical systems with more than one fixed point. In this work, an explanation is provided for the mechanism of lifting for the Koopman operator of nonlinear systems with multiple attractors. Considering the example of the Duffing oscillator, we show that by exploiting the inherent symmetry between the basins of attraction, a linear reconstruction with three degrees of freedom in the Koopman observable space is sufficient to globally linearize the system.
Quantum transport theory of hybrid superconducting systems

We present a quantum transport theory for hybrid superconducting systems based on our exact master equation approach. The total transient transport current is decomposed into components that describe coherent transports through different paths of particle and hole channels. We show that the coherent transports are resultant interferences of numerous repeated tunneling processes and cannot be rendered as a simple normal transmission or Andreev reflection as usually described quantum transport involving superconductivity. As a practical application, we find that the coherent transport currents passing through a pair of well-separated Majorana zero modes vanish due to the totally destructive interference between the particle and hole channels.
Spectral Sensitivity Estimation Without a Camera

A number of problems in computer vision and related fields would be mitigated if camera spectral sensitivities were known. As consumer cameras are not designed for high-precision visual tasks, manufacturers do not disclose spectral sensitivities. Their estimation requires a costly optical setup, which triggered researchers to come up with numerous indirect methods that aim to lower cost and complexity by using color targets. However, the use of color targets gives rise to new complications that make the estimation more difficult, and consequently, there currently exists no simple, low-cost, robust go-to method for spectral sensitivity estimation that non-specialized research labs can adopt. Furthermore, even if not limited by hardware or cost, researchers frequently work with imagery from multiple cameras that they do not have in their possession. To provide a practical solution to this problem, we propose a framework for spectral sensitivity estimation that not only does not require any hardware (including a color target), but also does not require physical access to the camera itself. Similar to other work, we formulate an optimization problem that minimizes a two-term objective function: a camera-specific term from a system of equations, and a universal term that bounds the solution space. Different than other work, we utilize publicly available high-quality calibration data to construct both terms. We use the colorimetric mapping matrices provided by the Adobe DNG Converter to formulate the camera-specific system of equations, and constrain the solutions using an autoencoder trained on a database of ground-truth curves. On average, we achieve reconstruction errors as low as those that can arise due to manufacturing imperfections between two copies of the same camera. We provide our code and predicted sensitivities for 1, 000+ cameras at https://github.com/COLOR-Lab-Eilat/Spectral-sensitivity-estimation, and discuss which tasks can become trivial when camera responses are available.
Unsupervised Machine Learning to Classify the Confinement of Waves in Periodic Superstructures

We propose a rigorous method to classify the dimensionality of wave confinement by utilizing unsupervised machine learning to enhance the accuracy of our recently presented scaling method [Phys. Rev. Lett.129, 176401 (2022)10.1103/PhysRevLett.129. 176401]. We apply the standard k-means++ algorithm as well as our own model-based algorithm to 3D superlattices of resonant cavities embedded in a 3D inverse woodpile photonic band gap crystal with a range of design parameters. We compare their results against each other and against the direct usage of the scaling method without clustering. Since the clustering algorithms require the set of confinement dimensionalities present in the system as an input, we investigate cluster validity indices (CVIs) as a means to find these values. We conclude that the most accurate outcome is obtained by first applying direct scaling to find the correct set of confinement dimensionalities, and subsequently utilizing our model-based clustering algorithm to refine the results.
Closing the Door on the"Puzzle of Decoherence'' of Annihilation Quanta

In para-positronium annihilation, exploration of the polarization correlations of the emerging gamma quanta has gained interest, since it offers a possibility to improve signal-to-background in medical imaging using positron emission tomography. The annihilation quanta, which are predicted to be in an entangled state, have orthogonal polarizations and this property may be exploited to discriminate them from two uncorrelated gamma photons contributing to the background. Recent experimental studies of polarization correlations of the annihilation quanta after a decoherence process induced by a prior Compton scattering of one of them, had rather different conclusions regarding the strength of the correlation after the decoherence, showing its puzzling nature. In the present work, we perform for the first time, a study of the polarization correlations of annihilation quanta after decoherence via Compton scattering in the angular range $0^\circ-50^\circ$ using single-layer gamma ray polarimeters. In addition, we compare the measured polarization correlations after Compton scattering at $30^\circ$ with an active and a passive scatterer element. The results indicate that the correlation, expressed in terms of the polarimetric modulation factor, shows no significant difference at small scattering angles ($0^\circ-30^\circ$) compared to the correlation measured for direct photons, while lower modulation was observed for $50^\circ$ scattering angle.
LLM+P: Empowering Large Language Models with Optimal Planning Proficiency

Large language models (LLMs) have demonstrated remarkable zero-shot generalization abilities: state-of-the-art chatbots can provide plausible answers to many common questions that arise in daily life. However, so far, LLMs cannot reliably solve long-horizon planning problems. By contrast, classical planners, once a problem is given in a formatted way, can use efficient search algorithms to quickly identify correct, or even optimal, plans. In an effort to get the best of both worlds, this paper introduces LLM+P, the first framework that incorporates the strengths of classical planners into LLMs. LLM+P takes in a natural language description of a planning problem, then returns a correct (or optimal) plan for solving that problem in natural language. LLM+P does so by first converting the language description into a file written in the planning domain definition language (PDDL), then leveraging classical planners to quickly find a solution, and then translating the found solution back into natural language. Along with LLM+P, we define a diverse set of different benchmark problems taken from common planning scenarios. Via a comprehensive set of experiments on these benchmark problems, we find that LLM+P is able to provide optimal solutions for most problems, while LLMs fail to provide even feasible plans for most problems. \footnote{The code and results are publicly available at https://github.com/Cranial-XIX/llm-pddl.git.
Self-supervised Learning by View Synthesis

We present view-synthesis autoencoders (VSA) in this paper, which is a self-supervised learning framework designed for vision transformers. Different from traditional 2D pretraining methods, VSA can be pre-trained with multi-view data. In each iteration, the input to VSA is one view (or multiple views) of a 3D object and the output is a synthesized image in another target pose. The decoder of VSA has several cross-attention blocks, which use the source view as value, source pose as key, and target pose as query. They achieve cross-attention to synthesize the target view. This simple approach realizes large-angle view synthesis and learns spatial invariant representation, where the latter is decent initialization for transformers on downstream tasks, such as 3D classification on ModelNet40, ShapeNet Core55, and ScanObjectNN. VSA outperforms existing methods significantly for linear probing and is competitive for fine-tuning. The code will be made publicly available.
Branching Exponents of Synthetic Vascular Trees Under Different Optimality Principles

Objective: The branching behavior of vascular trees is often characterized using Murray's law. We investigate its validity using synthetic vascular trees generated under global optimization criteria. Methods: Our synthetic tree model does not incorporate Murray's law explicitly. Instead, we show that its validity depends on properties of the optimization model and investigate the effects of different physical constraints and optimization goals on the branching exponent that is now allowed to vary locally. In particular, we include variable blood viscosity due to the Fåhræus–Lindqvist effect and enforce an equal pressure drop between inflow and the micro-circulation. Using our global optimization framework, we generate vascular trees with over one million terminal vessels and compare them against a detailed corrosion cast of the portal venous tree of a human liver. Results: Murray's law is fulfilled when no additional constraints are enforced, indicating its validity in this setting. Variable blood viscosity or equal pressure drop lead to different optima but with the branching exponent inside the experimentally predicted range between 2.0 and 3.0. The validation against the corrosion cast shows good agreement from the portal vein down to the venules. Conclusion: Not enforcing Murray's law increases the predictive capabilities of synthetic vascular trees, and in addition reduces the computational cost. Significance: The ability to study optimal branching exponents across different scales can improve the functional assessment of organs.
Is ChatGPT the Ultimate Programming Assistant - How far is it?

Recently, the ChatGPT LLM has received great attention: it can be used as a bot for discussing source code, prompting it to suggest changes, provide descriptions or even generate code. Typical demonstrations generally focus on existing benchmarks, which may have been used in model training (i.e., data leakage). To assess the feasibility of using an LLM as a useful assistant bot for programmers, we must assess its realistic capabilities on unseen problems as well as its capabilities on various tasks. In this paper, we present an empirical study of ChatGPT's potential as a fully automated programming assistant, focusing on the tasks of code generation, program repair, and code summariziation. The study investigates ChatGPT's performance on common programming problems and compares it with state-of-the-art approaches on two benchmarks. Among several findings, our study shows that ChatGPT is effective in dealing with common programming problems. However, our experiments also reveal limitations in terms of its attention span: detailed descriptions will constrain the focus of ChatGPT and prevent it from leveraging its vast knowledge to solve the actual problem. Surprisingly, we have identified the ability of ChatGPT to reason the original intention of the code. We expect future work to build on this insight for dealing with the open question of the oracle problem. Our findings contribute interesting insights to the development of LLMs for programming assistance, notably by demonstrating the importance of prompt engineering, and providing a better understanding of ChatGPT's practical applications for software engineering.
Fast MRI Reconstruction via Edge Attention

Fast and accurate MRI reconstruction is a key concern in modern clinical practice. Recently, numerous Deep-Learning methods have been proposed for MRI reconstruction, however, they usually fail to reconstruct sharp details from the subsampled k-space data. To solve this problem, we propose a lightweight and accurate Edge Attention MRI Reconstruction Network (EAMRI) to reconstruct images with edge guidance. Specifically, we design an efficient Edge Prediction Network to directly predict accurate edges from the blurred image. Meanwhile, we propose a novel Edge Attention Module (EAM) to guide the image reconstruction utilizing the extracted edge priors, as inspired by the popular self-attention mechanism. EAM first projects the input image and edges into Q_image, K_edge, and V_image, respectively. Then EAM pairs the Q_image with K_edge along the channel dimension, such that 1) it can search globally for the high-frequency image features that are activated by the edge priors; 2) the overall computation burdens are largely reduced compared with the traditional spatial-wise attention. With the help of EAM, the predicted edge priors can effectively guide the model to reconstruct high-quality MR images with accurate edges. Extensive experiments show that our proposed EAMRI outperforms other methods with fewer parameters and can recover more accurate edges.
Estimation of sparse linear regression coefficients under $L$-subexponential covariates

We tackle estimating sparse coefficients in a linear regression when the covariates are sampled from an $L$-subexponential random vector. This vector belongs to a class of distributions that exhibit heavier tails than Gaussian random vector. Previous studies have established error bounds similar to those derived for Gaussian random vectors. However, these methods require stronger conditions than those used for Gaussian random vectors to derive the error bounds. In this study, we present an error bound identical to the one obtained for Gaussian random vectors up to constant factors without imposing stronger conditions, when the covariates are drawn from an $L$-subexponential random vector. Interestingly, we employ an $\ell_1$-penalized Huber regression, which is known for its robustness against heavy-tailed random noises rather than covariates. We believe that this study uncovers a new aspect of the $\ell_1$-penalized Huber regression method.
Transformer-Based Language Model Surprisal Predicts Human Reading Times Best with About Two Billion Training Tokens

Recent psycholinguistic studies have drawn conflicting conclusions about the relationship between the quality of a language model and the ability of its surprisal estimates to predict human reading times, which has been speculated to be due to the large gap in both the amount of training data and model capacity across studies. The current work aims to consolidate these findings by evaluating surprisal estimates from Transformer-based language model variants that vary systematically in the amount of training data and model capacity on their ability to predict human reading times. The results show that surprisal estimates from most variants with contemporary model capacities provide the best fit after seeing about two billion training tokens, after which they begin to diverge from humanlike expectations. Additionally, newly-trained smaller model variants reveal a 'tipping point' at convergence, after which the decrease in language model perplexity begins to result in poorer fits to human reading times. These results suggest that the massive amount of training data is mainly responsible for the poorer fit achieved by surprisal from larger pre-trained language models, and that a certain degree of model capacity is necessary for Transformer-based language models to capture humanlike expectations.