Miracle-dz/UniFAR-FTUs huggingface dataset:
Emergent Abilities of Large Language Models

Scaling up language models has been shown to predictably improve performance and sample efficiency on a wide range of downstream tasks. This paper instead discusses an unpredictable phenomenon that we refer to as emergent abilities of large language models. We consider an ability to be emergent if it is not present in smaller models but is present in larger models. Thus, emergent abilities cannot be predicted simply by extrapolating the performance of smaller models. The existence of such emergence implies that additional scaling could further expand the range of capabilities of language models.
PCRAFT: Capacity Planning for Dependable Stateless Services

—Fault-tolerance techniques depend on replication to enhance availability, albeit at the cost of increased infrastructure costs. This results in a fundamental trade-off: Fault-tolerant services must satisfy given availability and performance constraints while minimising the number of replicated resources. These constraints pose capacity planning challenges for the service operators to minimise replication costs without negatively impacting availability . To this end, we present PCRAFT, 1 a system to enable capacity planning of dependable services. PCRAFT’s capacity planning is based on a hybrid approach that combines empirical performance measurements with probabilistic modelling of availability based on fault injection. In particular, we integrate traditional service-level availability mechanisms (active route anywhere and passive failover) and deployment schemes (cloud and on-premises) to quantify the number of nodes needed to satisfy the given availability and performance constraints.Our evaluation based on real-world applications shows that cloud deployment requires fewer nodes than on-premises deployments. Additionally, when considering on-premises deployments, we show how passive failover requires fewer nodes than active route anywhere. Furthermore, our evaluation quantify the quality enhancement given by additional integrity mechanisms and how this affects the number of nodes needed.
A Survey of Detection Methods for Die Attachment and Wire Bonding Defects in Integrated Circuit Manufacturing

Defect detection plays a vital role in the manufacturing process of integrated circuits (ICs). Die attachment and wire bonding are two steps of the manufacturing process that determine the power and signal transmission quality and dependability in an IC. This paper presents a survey or literature review of the methods used for detecting these defects based on different sensing modalities used including optical, radiological, acoustical, and infrared thermography. A discussion of the detection methods used is provided in this survey. Both conventional and deep learning approaches for detecting die attachment and wire bonding defects are considered along with challenges and future research directions.
High-fidelity quantitative differential phase contrast deconvolution using dark-field sparse prior

Differential Phase Contrast (DPC) imaging plays an important role in the family of quantitative phase measurement. However, the reconstruction algorithm for quantitative DPC (qDPC) imaging is not yet optimized, as it does not incorporate the inborn properties of qDPC imaging. In this research, we propose a simple but effective image prior, the Dark-field Sparse Prior (DSP), to facilitate the phase reconstruction quality for all DPC-based phase reconstruction algorithms. The DSP is based on the key observation that most pixel values for an idea differential phase contrast image are zeros since the subtraction of two images under anti-symmetric illumination cancels all background components. With this DSP prior, we formed a new cost function in which L0-norm was used to represent the DSP. Further, we developed the algorithm based on the Half Quadratic Splitting to solve this NP-hard L0-norm problem. We tested our new model on both simulated and experimental data and compare it against State-Of-The-Art (SOTA) methods including L2-norm and total variation regularizations. Results show that our proposed model is superior in terms of phase reconstruction quality and implementation efficiency, which significantly increases the experimental robustness, while maintaining the data fidelity. In general, the DSP supports high-fidelity qDPC reconstruction without any modification of the optical system, which simplifies the system complexity and benefit all qDPC applications.
Multi-scale Analysis of Nitrogen Loss Mitigation in the US Corn Belt

Reducing the size of the hypoxic zone in the Gulf of Mexico has proven to be a challenging task. A variety of mitigation options have been proposed, each likely to produce markedly diﬀerent patterns of mitigation with widely varying consequences for the economy. The general consensus is that no single measure alone is suﬃcient to achieve the EPA Task Force goal for reducing the Gulf hypoxic zone and it appears that a combination of management practices must be employed. However, absent a highly resolved, multi-scale framework for assessing these policy combinations, it has been unclear what pattern of mitigation is likely to emerge from diﬀerent policies and what the consequences would be for local, regional and national land use, food prices and farm returns. We address this research gap by utilizing a novel multi-scale framework for evaluating alternative N loss management policies in the Mississippi River basin. This combines ﬁne-scale agro-ecosystem responses with an economic model capturing domestic and international market and price linkages. We ﬁnd that wetland restoration combined with improved N use eﬃciency, along with a leaching tax could reduce the Mississippi River N load by 30-53% while only modestly increasing corn prices. This study underscores the value of ﬁne-resolution analysis and the potential of combined economic and ecological instruments in tackling nonpoint source nitrate pollution.
Dust polarization spectral dependence from Planck HFI data. Turning point for cosmic microwave background polarization-foreground modeling

The search for the primordial B-modes of the cosmic microwave background (CMB) relies on the separation from the brighter foreground dust signal. In this context, the characterisation of the spectral energy distribution (SED) of thermal dust in polarization has become a critical subject of study. We present a power-spectra analysis of Planck data, which improves on previous studies by using the newly released SRoll2 maps that correct residual data systematics, and by extending the analysis to regions near the Galactic plane. Our analysis focuses on the lowest multipoles between l=4 and 32, and three sky areas with sky fractions of fsky = 80%, 90%, and 97%. The mean dust SED for polarization and the 353 GHz Q and U maps are used to compute residual maps at 100, 143 and 217 GHz, highlighting spatial variations of the dust polarization SED. Residuals are detected at the three frequencies for the three sky areas. We show that models based on total intensity data are underestimating by a significant factor the complexity of dust polarized CMB foreground. Our analysis emphasizes the need to include variations of polarization angles of the dust polarized CMB foreground. The frequency dependence of the EE and BB power spectra of the residual maps yields further insight. We find that the moments expansion to the first order of the modified black-body (MBB) spectrum provides a good fit to the EE power-spectra. This result suggests that the residuals could follow mainly from variations of dust MBB spectral parameters. However, this conclusion is challenged by cross-spectra showing that the residuals maps at the three frequencies are not fully correlated, and the fact that the BB power-spectra do not match the first order moment expansion of a MBB SED. This work sets new requirements for simulations of the dust polarized foreground and component separation methods (abridged)
A rigorous derivation of the Hamiltonian structure for the Vlasov equation

Abstract We consider the Vlasov equation in any spatial dimension, which has long been known [ZI76, Mor80, Gib81, MW82] to be an infinite-dimensional Hamiltonian system whose bracket structure is of Lie–Poisson type. In parallel, it is classical that the Vlasov equation is a mean-field limit for a pairwise interacting Newtonian system. Motivated by this knowledge, we provide a rigorous derivation of the Hamiltonian structure of the Vlasov equation, both the Hamiltonian functional and Poisson bracket, directly from the many-body problem. One may view this work as a classical counterpart to [MNP+20], which provided a rigorous derivation of the Hamiltonian structure of the cubic nonlinear Schrödinger equation from the many-body problem for interacting bosons in a certain infinite particle number limit, the first result of its kind. In particular, our work settles a question of Marsden, Morrison and Weinstein [MMW84] on providing a ‘statistical basis’ for the bracket structure of the Vlasov equation.
DiffWire: Inductive Graph Rewiring via the Lovász Bound

Graph Neural Networks (GNNs) have been shown to achieve competitive results to tackle graph-related tasks, such as node and graph classification, link prediction and node and graph clustering in a variety of domains. Most GNNs use a message passing framework and hence are called MPNNs. Despite their promising results, MPNNs have been reported to suffer from over-smoothing, over-squashing and under-reaching. Graph rewiring and graph pooling have been proposed in the literature as solutions to address these limitations. However, most state-of-the-art graph rewiring methods fail to preserve the global topology of the graph, are neither differentiable nor inductive, and require the tuning of hyper-parameters. In this paper, we propose DiffWire, a novel framework for graph rewiring in MPNNs that is principled, fully differentiable and parameter-free by leveraging the Lov\'asz bound. The proposed approach provides a unified theory for graph rewiring by proposing two new, complementary layers in MPNNs: CT-Layer, a layer that learns the commute times and uses them as a relevance function for edge re-weighting; and GAP-Layer, a layer to optimize the spectral gap, depending on the nature of the network and the task at hand. We empirically validate the value of each of these layers separately with benchmark datasets for graph classification. We also perform preliminary studies on the use of CT-Layer for homophilic and heterophilic node classification tasks. DiffWire brings together the learnability of commute times to related definitions of curvature, opening the door to creating more expressive MPNNs.
Beyond Grounding: Extracting Fine-Grained Event Hierarchies across Modalities

Events describe happenings in our world that are of importance. Naturally, understanding events mentioned in multimedia content and how they are related forms an important way of comprehending our world. Existing literature can infer if events across textual and visual (video) domains are identical (via grounding) and thus, on the same semantic level. However, grounding fails to capture the intricate cross-event relations that exist due to the same events being referred to on many semantic levels. For example, the abstract event of "war'' manifests at a lower semantic level through subevents "tanks firing'' (in video) and airplane "shot'' (in text), leading to a hierarchical, multimodal relationship between the events. In this paper, we propose the task of extracting event hierarchies from multimodal (video and text) data to capture how the same event manifests itself in different modalities at different semantic levels. This reveals the structure of events and is critical to understanding them. To support research on this task, we introduce the Multimodal Hierarchical Events (MultiHiEve) dataset. Unlike prior video-language datasets, MultiHiEve is composed of news video-article pairs, which makes it rich in event hierarchies. We densely annotate a part of the dataset to construct the test benchmark. We show the limitations of state-of-the-art unimodal and multimodal baselines on this task. Further, we address these limitations via a new weakly supervised model, leveraging only unannotated video-article pairs from MultiHiEve. We perform a thorough evaluation of our proposed method which demonstrates improved performance on this task and highlight opportunities for future research. Data: https://github.com/hayyubi/multihieve
BaIT: Barometer for Information Trustworthiness

This paper presents a new approach to the FNC-1 fake news classification task which involves employing pre-trained encoder models from similar NLP tasks, namely sentence similarity and natural language inference, and two neural network architectures using this approach are proposed. Methods in data augmentation are explored as a means of tackling class imbalance in the dataset, employing common pre-existing methods and proposing a method for sample generation in the under-represented class using a novel sentence negation algorithm. Comparable overall performance with existing baselines is achieved, while significantly increasing accuracy on an under-represented but nonetheless important class for FNC-1.
Born for Auto-Tagging: Faster and better with new objective functions

Keyword extraction is a task of text mining. It is applied to increase search volume in SEO and ads. Implemented in auto-tagging, it makes tagging on a mass scale of online articles and photos efficiently and accurately. BAT is invented for auto-tagging which served as awoo's AI marketing platform (AMP). awoo AMP not only provides service as a customized recommender system but also increases the converting rate in E-commerce. The strength of BAT converges faster and better than other SOTA models, as its 4-layer structure achieves the best F scores at 50 epochs. In other words, it performs better than other models which require deeper layers at 100 epochs. To generate rich and clean tags, awoo creates new objective functions to maintain similar ${\rm F_1}$ scores with cross-entropy while enhancing ${\rm F_2}$ scores simultaneously. To assure the even better performance of F scores awoo revamps the learning rate strategy proposed by Transformer \cite{Transformer} to increase ${\rm F_1}$ and ${\rm F_2}$ scores at the same time.
Deep-Based Film Grain Removal and Synthesis

In this paper, deep learning-based techniques for film grain removal and synthesis that can be applied in video coding are proposed. Film grain is inherent in analog film content because of the physical process of capturing images and video on film. It can also be present in digital content where it is purposely added to reflect the era of analog film and to evoke certain emotions in the viewer or enhance the perceived quality. In the context of video coding, the random nature of film grain makes it both difficult to preserve and very expensive to compress. To better preserve it while compressing the content efficiently, film grain is removed and modeled before video encoding and then restored after video decoding. In this paper, a film grain removal model based on an encoder-decoder architecture and a film grain synthesis model based on a conditional generative adversarial network (cGAN) are proposed. Both models are trained on a large dataset of pairs of clean (grain-free) and grainy images. Quantitative and qualitative evaluations of the developed solutions were conducted and showed that the proposed film grain removal model is effective in filtering film grain at different intensity levels using two configurations: 1) a non-blind configuration where the film grain level of the grainy input is known and provided as input; and 2) a blind configuration where the film grain level is unknown. As for the film grain synthesis task, the experimental results show that the proposed model is able to reproduce realistic film grain with a controllable intensity level specified as input.
Intelligence Originating from Human Beings and Expanding in Industry— A View on the Development of Artificial Intelligence

: Artificial Intelligence (AI) aims to simulate information storage and processing mechanisms and other intelligent behaviors of a human brain, so that the machine has a certain level of intelligence. With the rapid development of the new generation of information technology, such as the Internet, big data, cloud computing, and deep learning, researches and applications of AI have made and are making important progresses. In this paper, the historical integration and evolution of computer science, control science, brain-inspired intelligence, human brain intelligence, and other disciplines or fields closely related to AI are analyzed in depth; then it is pointed out that the research results on the structure and functional mechanism of brain from neuroscience, brain science and cognitive science provide some important inspirations for the construction of an intelligent computing model. Moreover, the drives and developments of AI are discussed from the aspects of logic model and system, neuron network model, visual nerve hierarchy mechanism, etc. Finally, the development trend of AI is prospected from the following five aspects: the computational theory of the
Near-Exact Recovery for Tomographic Inverse Problems via Deep Learning

This work is concerned with the following fundamental question in scientific machine learning: Can deep-learning-based methods solve noise-free inverse problems to near-perfect accuracy? Positive evidence is provided for the first time, focusing on a prototypical computed tomography (CT) setup. We demonstrate that an iterative end-to-end network scheme enables reconstructions close to numerical precision, comparable to classical compressed sensing strategies. Our results build on our winning submission to the recent AAPM DL-Sparse-View CT Challenge. Its goal was to identify the state-of-the-art in solving the sparse-view CT inverse problem with data-driven techniques. A specific difficulty of the challenge setup was that the precise forward model remained unknown to the participants. Therefore, a key feature of our approach was to initially estimate the unknown fanbeam geometry in a data-driven calibration step. Apart from an in-depth analysis of our methodology, we also demonstrate its state-of-the-art performance on the open-access real-world dataset LoDoPaB CT.
Edge Security: Challenges and Issues

—Edge computing is a paradigm that shifts data processing services to the network edge, where data are generated. While such an architecture provides faster processing and response, among other beneﬁts, it also raises critical security issues and challenges that must be addressed. This paper discusses the security threats and vulnerabilities emerging from the edge network architecture spanning from the hardware layer to the system layer. We further discuss privacy and regulatory compliance challenges in such networks. Finally, we argue the need for a holistic approach to analyze edge network security posture, which must consider knowledge from each layer.
Closed-Form Approximation for Performance Bound of Finite Blocklength Massive MIMO Transmission

It is supposed that ultra-reliable low latency communication (uRLLC) would continue to evolve in the future sixth generation (6G) network, to provide enhanced capability towards extreme connectivity, with the aid of well established multiple-input multiple-output (MIMO) technology. Since the latency constraint can be represented equivalently by the blocklength of a codeword, channel coding theory at a finite blocklength plays an important role in theoretic analysis of uRLLC. Based on Polyanskiy’s and Yang’s asymptotic results on maximal achievable rate, we first derive the proximate closed-form expressions for the expectation and variance of channel dispersion. Then, the upper bound of average maximal achievable rate is obtained for massive MIMO systems under ideal independent and identically distributed fading channels. Since almost all the fundamental parameters, including the spatial degree-of-freedom (DoF), are considered, this expression can be viewed as a performance bound of the spatiotemporal two-dimension channel coding to some extent. Moreover, it is shown by simulation and analysis, as the DoF goes to infinity, MIMO systems reveal a nature of deterministic transmission, since the average maximal achievable coding rate per antenna can be achieved at each transmission. In this case, the inversely proportional law observed therein implies that the blocklength in the time domain can be further shortened at the expense of spatial DoF. This exchangeability of space and time, to support a given coding rate, paves a solid and feasible road for us to further reduce latency in 6G uRLLC.
From Outcome-Based to Language-Based Preferences

We review the literature on models that try to explain human behavior in social interactions described by normal-form games with monetary payoffs. We start by covering social and moral preferences. We then focus on the growing body of research showing that people react to the language with which actions are described, especially when it activates moral concerns. We conclude by arguing that behavioral economics is in the midst of a paradigm shift toward language-based preferences, which will require an exploration of new models and experimental setups. (JEL C70, C90, D11, D90, Z13)
Intelligent analysis of EEG signals to assess consumer decisions: A Study on Neuromarketing

Neuromarketing is an emerging field that combines neuroscience and marketing to understand the factors that influence consumer decisions better. The study proposes a method to understand consumers’ positive and negative reactions to advertisements (ads) and products by analysing electroencephalogram (EEG) signals. These signals are recorded using a low-cost single electrode headset from volunteers belonging to the ages 18-22. A detailed subject dependent (SD) and subject independent (SI) analysis was performed employing machine learning methods like Naive Bayes (NB), Support Vector Machine (SVM), k-nearest neighbour and Decision Tree and the proposed deep learning (DL) model. SVM and NB yielded an accuracy (Acc.) of 0.63 for the SD analysis. In SI analysis, SVM performed better for the advertisement, product and gender-based analysis. Furthermore, the performance of the DL model was on par with that of SVM, especially, in product and ads-based analysis.
Region-enhanced Deep Graph Convolutional Networks for Rumor Detection

Social media has been rapidly developing in the public sphere due to its ease of spreading new information, which leads to the circulation of rumors. However, detecting rumors from such a massive amount of information is becoming an increasingly arduous challenge. Previous work generally obtained valuable features from propagation information. It should be noted that most methods only target the propagation structure while ignoring the rumor transmission pattern. This limited focus severely restricts the collection of spread data. To solve this problem, the authors of the present study are motivated to explore the regionalized propagation patterns of rumors. Specifically, a novel region-enhanced deep graph convolutional network (RDGCN) that enhances the propagation features of rumors by learning regionalized propagation patterns and trains to learn the propagation patterns by unsupervised learning is proposed. In addition, a source-enhanced residual graph convolution layer (SRGCL) is designed to improve the graph neural network (GNN) oversmoothness and increase the depth limit of the rumor detection methods-based GNN. Experiments on Twitter15 and Twitter16 show that the proposed model performs better than the baseline approach on rumor detection and early rumor detection.