Miracle-dz/UniFAR-FTUs huggingface dataset:
The Weights Can Be Harmful: Pareto Search versus Weighted Search in Multi-objective Search-based Software Engineering

In presence of multiple objectives to be optimized in Search-Based Software Engineering (SBSE), Pareto search has been commonly adopted. It searches for a good approximation of the problem’s Pareto-optimal solutions, from which the stakeholders choose the most preferred solution according to their preferences. However, when clear preferences of the stakeholders (e.g., a set of weights that reflect relative importance between objectives) are available prior to the search, weighted search is believed to be the first choice, since it simplifies the search via converting the original multi-objective problem into a single-objective one and enables the search to focus on what only the stakeholders are interested in. This article questions such a “weighted search first” belief. We show that the weights can, in fact, be harmful to the search process even in the presence of clear preferences. Specifically, we conduct a large-scale empirical study that consists of 38 systems/projects from three representative SBSE problems, together with two types of search budget and nine sets of weights, leading to 604 cases of comparisons. Our key finding is that weighted search reaches a certain level of solution quality by consuming relatively less resources at the early stage of the search; however, Pareto search is significantly better than its weighted counterpart the majority of the time (up to 77% of the cases), as long as we allow a sufficient, but not unrealistic search budget. This is a beneficial result, as it discovers a potentially new “rule-of-thumb” for the SBSE community: Even when clear preferences are available, it is recommended to always consider Pareto search by default for multi-objective SBSE problems, provided that solution quality is more important. Weighted search, in contrast, should only be preferred when the resource/search budget is limited, especially for expensive SBSE problems. This, together with other findings and actionable suggestions in the article, allows us to codify pragmatic and comprehensive guidance on choosing weighted and Pareto search for SBSE under the circumstance that clear preferences are available. All code and data can be accessed at https://github.com/ideas-labo/pareto-vs-weight-for-sbse.
Influence maximization under limited network information: seeding high-degree neighbors

The diffusion of information, norms, and practices across a social network can be initiated by compelling a small number of seed individuals to adopt first. Strategies proposed in previous work either assume full network information or a large degree of control over what information is collected. However, privacy settings on the Internet and high non-response in surveys often severely limit available connectivity information. Here we propose a seeding strategy for scenarios with limited network information: Only the degrees and connections of some random nodes are known. This new strategy is a modification of ‘random neighbor sampling’ (or ‘one-hop’) and seeds the highest-degree neighbors of randomly selected nodes. Simulating a fractional threshold model, we find that this new strategy excels in networks with heavy tailed degree distributions such as scale-free networks and large online social networks. It outperforms the conventional one-hop strategy even though the latter can seed 50% more nodes, and other seeding possibilities including pure high-degree seeding and clustered seeding.
BIQ2021: a large-scale blind image quality assessment database

Abstract. Perceptual quality assessment of digital images is becoming increasingly important due to widespread use of digital multimedia devices. Smartphones and high-speed internet are among the technologies that have increased the amount of multimedia content by several folds. Availability of a representative dataset, required for objective quality assessment training, is therefore an important challenge. We present a blind image quality assessment database (BIQ2021). The dataset addresses the challenge of representative images for no-reference image quality assessment by selecting images with naturally occurring distortions and reliable labeling. The dataset contains three set of images: images captured without intention of their use in image quality assessment, images obtained with intentional introduced natural distortions, and images collected from an open-source image sharing platform. Ensuring that the database contains a mix of images from different devices, containing different type of objects, and having varying degree of foreground and background information has been tried. The subjective scoring of these images is carried out in a laboratory environment through single-stimulus method to obtain reliable scores. The database provides details of subjective scoring, statistics of the human subjects, and the standard deviation of each image. The mean opinion scores (MOSs) provided with the dataset make it useful for assessment of visual quality. Moreover, existing blind image quality assessment approaches are tested on the proposed database, and the scores are analyzed using Pearson and Spearman’s correlation coefficients. The image database and the MOS along with relevant statistics are freely available for use and benchmarking.
Random Gegenbauer Features for Scalable Kernel Methods

We propose efficient random features for approximating a new and rich class of kernel functions that we refer to as Generalized Zonal Kernels (GZK). Our proposed GZK family, generalizes the zonal kernels (i.e., dot-product kernels on the unit sphere) by introducing radial factors in their Gegenbauer series expansion, and includes a wide range of ubiquitous kernel functions such as the entirety of dot-product kernels as well as the Gaussian and the recently introduced Neural Tangent kernels. Interestingly, by exploiting the reproducing property of the Gegenbauer polynomials, we can construct efficient random features for the GZK family based on randomly oriented Gegenbauer kernels. We prove subspace embedding guarantees for our Gegenbauer features which ensures that our features can be used for approximately solving learning problems such as kernel k-means clustering, kernel ridge regression, etc. Empirical results show that our proposed features outperform recent kernel approximation methods.
Blockchain-based Digital Twin for Supply Chain Management: A Literature Review and Future Research Directions

Supply chain management plays an essential role in our economy, as evidenced by recent COVID-19-induced supply chain challenges. Traditional supply chain management faces security and efficiency issues, but they can be addressed by leveraging digital twins and blockchain technology. The integration of blockchain technology can benefit the digital twins through improved security, traceability, transparency, and efficiency of digital twin data processing. A digital twin is an exact virtual representation of a physical asset, system, or process to synchronise data for the monitoring, simulation, and prediction of performance. Thus, the combination of blockchain and digital twins can refine the concepts of both technologies and reform supply chain management to advance into Industry 4.0. In this literature survey, we provide a comprehensive literature review of the blockchain-based digital twin solutions to optimise the processes of data management, data storage, and data sharing. We also investigate the key benefits of the integration of blockchain and digital twins and study their potential implementation in various processes of supply chains, including smart manufacturing, intelligent maintenance, and blockchain-based digital twin shop floor, warehouse, and logistics. This paper has implications for research and practice, which we detail in future research opportunities.
Multilevel Delayed Acceptance MCMC

We develop a novel Markov chain Monte Carlo (MCMC) method that exploits a hierarchy of models of increasing complexity to efficiently generate samples from an unnormalized target distribution. Broadly, the method rewrites the Multilevel MCMC approach of Dodwell et al. (2015) in terms of the Delayed Acceptance (DA) MCMC of Christen&Fox (2005). In particular, DA is extended to use a hierarchy of models of arbitrary depth, and allow subchains of arbitrary length. We show that the algorithm satisfies detailed balance, hence is ergodic for the target distribution. Furthermore, multilevel variance reduction is derived that exploits the multiple levels and subchains, and an adaptive multilevel correction to coarse-level biases is developed. Three numerical examples of Bayesian inverse problems are presented that demonstrate the advantages of these novel methods. The software and examples are available in PyMC3.
Bingham Policy Parameterization for 3D Rotations in Reinforcement Learning

We propose a new policy parameterization for representing 3D rotations during reinforcement learning. Today in the continuous control reinforcement learning literature, many stochastic policy parameterizations are Gaussian. We argue that universally applying a Gaussian policy parameterization is not always desirable for all environments. One such case in particular where this is true are tasks that involve predicting a 3D rotation output, either in isolation, or coupled with translation as part of a full 6D pose output. Our proposed Bingham Policy Parameterization (BPP) models the Bingham distribution and allows for better rotation (quaternion) prediction over a Gaussian policy parameterization in a range of reinforcement learning tasks. We evaluate BPP on the rotation Wahba problem task, as well as a set of vision-based next-best pose robot manipulation tasks from RLBench. We hope that this paper encourages more research into developing other policy parameterization that are more suited for particular environments, rather than always assuming Gaussian.
An Exact Method for the Daily Package Shipment Problem with Outsourcing

The package shipment problem requires to optimally co-design paths for both packages and a heterogeneous fleet in a transit center network (TCN). Instances arising from the package delivery industry in China usually involve more than ten thousand origin-destination (OD) pairs and have to be solved daily within an hour. Motivated by the fact that there is no interaction among different origin centers due to their competitive relationship, we propose a novel two-layer localized package shipment on a TCN (LPS-TCN) model that exploits outsourcing for cost saving. Consequently, the original problem breaks into a set of much smaller shipment problems, each of which has hundreds of OD pairs and is subsequently modelled as a mixed integer program (MIP). Since the LPS-TCN model is proved to be Strongly NP-hard and contains tens of thousands of feasible paths, an off-the-shelf MIP solver cannot produce a reliable solution in a practically acceptable amount of time. We develop a column generation based algorithm that iteratively adds"profitable"paths and further enhance it by problem-specific cutting planes and variable bound tightening techniques. Computational experiments on realistic instances from a major Chinese package express company demonstrate that the LPS-TCN model can yield solutions that bring daily economic cost reduction up to 1 million CNY for the whole TCN. In addition, our proposed algorithm solves the LPS-TCN model substantially faster than CPLEX, one of the state-of-the-art commercial MIP solvers.
Nanoscale electromagnetism with the boundary element method

In Yang et al. [Nature 576, 248 (2019)], the authors introduced a general theoretical framework for nanoscale electromagnetism based on Feibelman parameters. Here quantum effects of the optically excited electrons at the interface between two materials are lumped into two complexvalued and frequency-dependent parameters, which can be incorporated into modified boundary conditions for Maxwell’s equations, the so-called mesoscopic boundary conditions. These modifications can in principle be implemeted in any Maxwell solver, although the technicalities can be subtle and depend on the chosen computational approach. In this paper we show how to implement the mesoscopic boundary conditions in a boundary element method approach, based on a Galerkin scheme with Raviart-Thomas shape elements for the representation of the tangential electromagnetic fields at the boundary. We demonstrate that the results of our simulations are in perfect agreement with Mie theory including Feibelman parameters, and that for typical simulation scenarios the computational overhead is usually small. ∗E-mail ulrich.hohenester@uni-graz.at. 1 ar X iv :2 20 2. 03 90 2v 1 [ co nd -m at . m es -h al l] 8 F eb 2 02 2
Robotic Grasping from Classical to Modern: A Survey

Robotic Grasping has always been an active topic in robotics since grasping is one of the fundamental but most challenging skills of robots. It demands the coordination of robotic perception, planning, and control for robustness and intelligence. However, current solutions are still far behind humans, especially when confronting unstructured scenarios. In this paper, we survey the advances of robotic grasping, starting from the classical formulations and solutions to the modern ones. By reviewing the history of robotic grasping, we want to provide a complete view of this community, and perhaps inspire the combination and fusion of different ideas, which we think would be helpful to touch and explore the essence of robotic grasping problems. In detail, we firstly give an overview of the analytic methods for robotic grasping. After that, we provide a discussion on the recent state-of-the-art data-driven grasping approaches rising in recent years. With the development of computer vision, semantic grasping is being widely investigated and can be the basis of intelligent manipulation and skill learning for autonomous robotic systems in the future. Therefore, in our survey, we also briefly review the recent progress in this topic. Finally, we discuss the open problems and the future research directions that may be important for the human-level robustness, autonomy, and intelligence of robots.
New Bounds on the Size of Binary Codes with Large Minimum Distance

Let A(n, d) denote the maximum number of code-words in a binary code of length n and minimum Hamming distance d. Deriving upper and lower bounds on A(n, d) has been a subject for extensive research in coding theory. In this paper, we examine upper and lower bounds on A(n, d) in the high-minimum distance regime, in particular, when $d = n/2 - \Theta (\sqrt n )$. We will first provide a lower bound based on a cyclic construction for codes of length n = 2m − 1 and show that $A\left({n,d = n/2 - {2^{c - 1}}\sqrt n }\right) \geq {n^c}$, where c is an integer with 1 ⩽ c ⩽ m/2 − 1. With a Fourier-analytic view of Delsarte’s linear program, novel upper bounds on $A(n,n/2 - \sqrt n ){\text{ and }}A(n,n/2 - 2\sqrt n )$ are obtained, and, to the best of the authors’ knowledge, are the first upper bounds scaling polynomially in n for the regime with $d = n/2 - \Theta (\sqrt n )$.
Metal Artifact Reduction with Intra-Oral Scan Data for 3D Low Dose Maxillofacial CBCT Modeling

Low-dose dental cone beam computed tomography (CBCT) has been increasingly used for maxillofacial modeling. However, the presence of metallic inserts, such as implants, crowns, and dental filling, causes severe streaking and shading artifacts in a CBCT image and loss of the morphological structures of the teeth, which consequently prevents accurate segmentation of bones. A two-stage metal artifact reduction method is proposed for accurate 3D low-dose maxillofacial CBCT modeling, where a key idea is to utilize explicit tooth shape prior information from intra-oral scan data whose acquisition does not require any extra radiation exposure. In the first stage, an image-to-image deep learning network is employed to mitigate metal-related artifacts. To improve the learning ability, the proposed network is designed to take advantage of the intra-oral scan data as side-inputs and perform multi-task learning of auxiliary tooth segmentation. In the second stage, a 3D maxillofacial model is constructed by segmenting the bones from the dental CBCT image corrected in the first stage. For accurate bone segmentation, weighted thresholding is applied, wherein the weighting region is determined depending on the geometry of the intra-oral scan data. Because acquiring a paired training dataset of metal-artifact-free and metal artifact-affected dental CBCT images is challenging in clinical practice, an automatic method of generating a realistic dataset according to the CBCT physics model is introduced. Numerical simulations and clinical experiments show the feasibility of the proposed method, which takes advantage of tooth surface information from intra-oral scan data in 3D low dose maxillofacial CBCT modeling.
PACSan: Enforcing Memory Safety Based on ARM PA

Memory safety is a key security property that stops memory corruption vulnerabilities. Existing sanitizers enforce checks and catch such bugs during development and testing. However, they either provide partial memory safety or have overwhelmingly high performance overheads. Our novel sanitizer PACSan enforces spatial and temporal memory safety with no false positives at low performance overheads. PACSan removes the majority of the overheads involved in pointer tracking by sealing metadata in pointers through ARM PA (Pointer Authentication), and performing the memory safety checks when pointers are dereferenced. We have developed a prototype of PACSan and systematically evaluated its security and performance on the Magma, Juliet, Nginx, and SPEC CPU2017 test suites, respectively. In our evaluation, PACSan shows no false positives together with negligible false negatives, while introducing stronger security guarantees and lower performance overheads than state-of-the-art sanitizers, including HWASan, ASan, SoftBound+CETS, Memcheck, LowFat, and PTAuth. Specifically, PACSan has 0.84x runtime overhead and 1.92x memory overhead on average. Compared to the widely deployed ASan, PACSan has no false positives and much fewer false negatives and reduces 7.172% runtime overheads and 89.063%memory overheads.
Practical Application of Multidisciplinary Optimization to Structural Design of Next Generation Supersonic Transport

The application of multi-disciplinary optimizations on the next generation supersonic transport airplane plays an important role in determining the proper structural designs and material systems for the airplane. This manuscript describes the key components in the MDO process, including the benefit of utilizing parametric meshable geometry to enable additional trade studies. This manuscript will show how the configurations are updated throughout the execution of the contract, and how the MDO process enable more configurations to be studied within a given amount of time compared to the previous process. The report will also show that improvements that need to be made to further enhance the MDO process and design of the supersonic vehicle.
GB6 J2113+1121: A Multiwavelength Flaring γ-Ray Blazar Temporally and Spatially Coincident with the Neutrino Event IceCube-191001A

A radio-emitting tidal disruption event (AT2019dsg) is proposed as a likely counterpart to the IceCube neutrino event IC 191001A. In this work, we have revisited the Fermi-LAT data in the direction of the neutrino and confirmed no signal at the site of AT2019dsg. Instead, at the edge of the 90% confidence level error region of this neutrino, there is a γ-ray transient source associated with the blazar GB6 J2113+1121. In 2019 May, GB6 J2113+1121 was undergoing a γ-ray flare that is unprecedented since the start of the Fermi-LAT operation, with a variability amplitude of about 20 fold. Similar violent flares of GB6 J2113+1121, unobserved before, have also been detected in the optical bands. Moreover, the blazar remained in a high-flux state in the infrared bands when IC 191001A arrived, though the blazar ‘s γ-ray and optical activities have temporarily ceased. Motivated by this spatial and temporal coincidence, we suggest that GB6 J2113+1121 is a candidate to be the counterpart to IC 191001A. The jet properties of GB6 J2113+1121 are investigated, which are found to be comparable with that of neutrino-emitting blazars (candidates). A specific analysis of archival IceCube data in this direction and future observations would put further constraints on the origin of the neutrino.
The role of Blockchain in DDoS attacks mitigation: techniques, open challenges and future directions

With the proliferation of new technologies such as Internet of Things (IOT) and Software-Defined Networking(SDN) in the recent years, the distributed denial of service (DDoS)attack vector has broadened and opened new opportunities for more sophisticated DDoS attacks on the targeted victims. The new attack vector includes unsecured and vulnerable IoT devices connected to the internet, denial of service vulnerabilities like southbound channel saturation in the SDN architecture. Given the high-volume and pervasive nature of these attacks, it is beneficial for stakeholders to collaborate in detecting and mitigating the denial of service attacks in a timely manner. The blockchain technology is considered to improve the security aspects owing to the decentralized design, secured distributed storage and privacy. A thorough exploration and classification of blockchain techniques used for DDoS attack mitigation is not explored in the prior art. This paper reviews and categorizes the existed state-of-the-art DDoS mitigation solutions based on blockchain technology. The DDoS mitigation techniques are classified based on the solution deployment location i.e. network based, near attacker location, near victim location and hybrid solutions in the network architecture with emphasis on the IoT and SDN architectures. Additionally, based on our study, the research challenges and future directions to implement the blockchain based DDoS mitigation solutions are discussed. We believe that this paper could serve as a starting point and reference resource for future researchers working on denial of service attacks detection and mitigation using blockchain technology.
Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution

Deep neural networks (DNNs) have shown great success in many machine learning tasks. Their training is challenging since the loss surface of the network architecture is generally non-convex, or even non-smooth. How and under what assumptions is guaranteed convergence to a \textit{global} minimum possible? We propose a reformulation of the minimization problem allowing for a new recursive algorithmic framework. By using bounded style assumptions, we prove convergence to an $\varepsilon$-(global) minimum using $\mathcal{\tilde{O}}(1/\varepsilon^3)$ gradient computations. Our theoretical foundation motivates further study, implementation, and optimization of the new algorithmic framework and further investigation of its non-standard bounded style assumptions. This new direction broadens our understanding of why and under what circumstances training of a DNN converges to a global minimum.