Reviewerly/exHarmony huggingface dataset:
Modeling for Non-Markovian Quantum Systems

This brief presents an augmented Markovian system framework that can be applied to model non-Markovian quantum systems. In this augmented system model, ancillary systems are designed to play the role of internal modes of the non-Markovian environment converting white noise to colored noise. To capture the non-classical mutual influence between a quantum system and non-Markovian environments, direct interactions between a principal system and the ancillary system are introduced. Consequently, we showed that the augmented Markovian formulation can be used to theoretically model the environment for observed non-Markovian behavior in a recent experiment on quantum dots.
Semidefinite Tests for Latent Causal Structures

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures where all correlations between observed quantities are solely due to the influence from latent variables. We show that each model of this type imposes a certain signature on the observable covariance matrix in terms of a particular decomposition into positive semidefinite components. This signature, and thus the underlying hypothetical latent structure, can be tested in a computationally efficient manner via semidefinite programming. This stands in stark contrast with the algebraic geometric tools required if the full observable probability distribution is taken into account. The semidefinite test is compared with tests based on entropic inequalities.
Joint Spectral Clustering based on Optimal Graph and Feature Selection

Redundant features and outliers (noise) included in the data points for a machine learning clustering model heavily influences the discovery of more distinguished features for clustering. To solve this issue, we propose a spectral new clustering method to consider the feature selection with the $$L_{2,1}$$ -norm regularization as well as simultaneously learns orthogonal representations for each sample to preserve the local structures of data points. Our model also solves the issue of out-of-sample, where the training process does not output an explicit model to predict unseen data points, along with providing an efficient optimization method for the proposed objective function. Experimental results showed that our method on twelve data sets achieves the best performance compared with other similar models.
Modeling the optimal diversification opportunities: the case of crypto portfolios and equity portfolios

Purpose This study aims to compare the diversification risk of the crypto portfolio with those of equity portfolios. For this purpose, the hypothetical index was constructed with 20 cryptocurrencies that hold the highest market capitalization in the Coin Market Cap database, named as the Crypto-Index 20. Design/methodology/approach The portfolio diversification techniques were used to identify risk linked with the six largest European equity indexes and compared with the Crypto-Index 20. Indexes were considered as an independent portfolio while analysis was completed separately for each of them. Data concerning stock prices and their trade volume were collected from the Thomson Reuters Eikon database while crypto prices and their trade volume from the Coin Market Cap database. The diversification risk of the stock indexes was measured separately for each portfolio with the same risk techniques and the same methodological process. Findings Research results indicate that Crypto-Index 20 on average was 76 times riskier than FTSE 100, 55 times riskier than FTSE MIB, 44 times riskier than IBEX 35, 10 times riskier than CAC 40 and 9 times riskier than DAX and MDAX. Crypto-Index 20 comprises a stronger positive correlation and is exposed to higher volatility than six selected European equity indexes. Originality/value This research provides practical implications for the investors on the diversification benefits and risks attached to the cryptocurrencies portfolio by comparing it with the traditional equity portfolios. From a policy perspective, regulators might obtain information on the risk properties involved into cryptocurrencies and the possibility of creating an optimal portfolio.
Dynamic IoT Choreographies

The Internet of Things is growing at a dramatic rate and extending into various application domains. We have designed, implemented, and evaluated a resilient and decentralized system to enable dynamic IoT choreographies. We applied it to maintaining the functionality of building automation systems so that new devices can appear and vanish on-the-fly.
Generalization of machine learning for problem reduction: a case study on travelling salesman problems

Combinatorial optimization plays an important role in real-world problem solving. In the big data era, the dimensionality of a combinatorial optimization problem is usually very large, which poses a significant challenge to existing solution methods. In this paper, we examine the generalization capability of a machine learning model for problem reduction on the classic travelling salesman problems (TSP). We demonstrate that our method can greedily remove decision variables from an optimization problem that are predicted not to be part of an optimal solution. More specifically, we investigate our model's capability to generalize on test instances that have not been seen during the training phase. We consider three scenarios where training and test instances are different in terms of: 1) problem characteristics; 2) problem sizes; and 3) problem types. Our experiments show that this machine learning based technique can generalize reasonably well over a wide range of TSP test instances with different characteristics or sizes. While the accuracy of predicting unused variables naturally deteriorates as a test instance is further away from the training set, we observe that even when tested on a different TSP problem variant, the machine learning model still makes useful predictions about which variables can be eliminated without significantly impacting solution quality.
CaSA: End-to-end Quantitative Security Analysis of Randomly Mapped Caches

It is well known that there are micro-architectural vulnerabilities that enable an attacker to use caches to exfiltrate secrets from a victim. These vulnerabilities exploit the fact that the attacker can detect cache lines that were accessed by the victim. Therefore, architects have looked at different forms of randomization to thwart the attacker's ability to communicate using the cache. The security analysis of those randomly mapped caches is based upon the increased difficulty for the attacker to determine the addresses that touch the same cache line that the victim has accessed. In this paper, we show that the analyses used to evaluate those schemes were incomplete in various ways. For example, they were incomplete because they only focused on one of the steps used in the exfiltration of secrets. Specifically, the step that the attacker uses to determine the set of addresses that can monitor the cache lines used by the transmitter address. Instead, we broaden the analysis of micro-architecture side channels by providing an overall view of the communication process. This allows us to identify the existence of other communication steps that can also affect the security of randomly mapped caches, but have been ignored by prior work. We design an analysis framework, CaSA, to comprehensively and quantitatively analyze the security of these randomly mapped caches. We comprehensively consider the end-to-end communication steps and study the statistical relationship between different steps. In addition, to perform quantitative analysis, we leverage the concepts from the field of telecommunications to formulate the security analysis into a statistical problem. We use CaSA to evaluate a wide range of attack strategies and cache configurations. Our result shows that the randomization mechanisms used in the state-of-the-art randomly mapped caches are insecure.
QoS Constrained Large Scale Web Service Composition Using Abstraction Refinement

Efficient service composition in real time while providing necessary Quality of Service (QoS) guarantees has been a challenging research problem with ever growing complexity. Several heuristic based approaches with diverse proposals for taming the scale and complexity of web service composition, have been proposed in literature. In this paper, we present a new approach for efficient service composition based on abstraction refinement. Instead of considering individual services during composition, we propose several abstractions to form service groups and the composition is done on these abstract services. Abstraction reduces the search space significantly and thereby can be done reasonably fast. While this can expedite solution construction to a great extent, this also entails a possibility that it may fail to generate any solution satisfying the QoS constraints, though the individual services construct a valid solution. Hence, we propose to refine an abstraction to generate the composite solution with desired QoS values. A QoS satisfying solution, if one exists, can be constructed with multiple iterations of abstraction refinement. While in the worst case, this approach may end up exploring the complete composition graph constructed on individual services, on an average, the solution can be achieved on the abstract graph. The abstraction refinement techniques give a significant speed-up compared to the traditional composition techniques. Experimental results on real benchmarks show the efficiency of our proposed mechanism in terms of time and the number of services considered for composition.
Workload-aware reviewer recommendation using a multi-objective search-based approach

Reviewer recommendation approaches have been proposed to provide automated support in finding suitable reviewers to review a given patch. However, they mainly focused on reviewer experience, and did not take into account the review workload, which is another important factor for a reviewer to decide if they will accept a review invitation. We set out to empirically investigate the feasibility of automatically recommending reviewers while considering the review workload amongst other factors. We develop a novel approach that leverages a multi-objective meta-heuristic algorithm to search for reviewers guided by two objectives, i.e., (1) maximizing the chance of participating in a review, and (2) minimizing the skewness of the review workload distribution among reviewers. Through an empirical study of 230,090 patches with 7,431 reviewers spread across four open source projects, we find that our approach can recommend reviewers who are potentially suitable for a newly-submitted patch with 19% - 260% higher F-measure than the five benchmarks. Our empirical results demonstrate that the review workload and other important information should be taken into consideration in find-ing reviewers who are potentially suitable for a newly-submitted patch. In addition, the results show the effectiveness of realizing this approach using a multi-objective search-based approach.
Dense coding capacity of a quantum channel

We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.
Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes

Among the predictive hidden Markov models that describe a given stochastic process, the {\epsilon}-machine is strongly minimal in that it minimizes every R\'enyi-based memory measure. Quantum models can be smaller still. In contrast with the {\epsilon}-machine's unique role in the classical setting, however, among the class of processes described by pure-state hidden quantum Markov models, there are those for which there does not exist any strongly minimal model. Quantum memory optimization then depends on which memory measure best matches a given problem circumstance.
Generating Adversarial Examples Against Machine Learning-Based Intrusion Detector in Industrial Control Systems

Deploying machine learning (ML)-based intrusion detection systems (IDS) is an effective way to improve the security of industrial control systems (ICS). However, ML models themselves are vulnerable to adversarial examples, generated by deliberately adding subtle perturbation to the input sample that some people are not aware of, causing the model to give a false output with high confidence. In this article, our goal is to investigate the possibility of stealthy cyber attacks towards IDS, including injection attack, function code attack and reconnaissance attack, and enhance its robustness to adversarial attack. However, adversarial algorithms are subject to communication protocol and legal range of data in ICS, unlike only limited by the distance between original samples and newly generated samples in image domain. We propose two strategies - optimal solution attack and GAN attack - oriented to flexibility and volume of data, formulating an optimization problem to find stealthy attacks, where the former is appropriate for not too large and more flexible samples while the latter provides a more efficient solution for larger and not too flexible samples. Finally, we conduct experiments on a semi-physical ICS testbed with a high detection performance ensemble ML-based detector to show the effectiveness of our attacks. The results indicate that new samples of reconnaissance and function code attack produced by both optimal solution and GAN algorithm possess 80 percent higher probability to evade the detector, still maintaining the same attack effect. In the meantime, we adopt adversarial training as a method to defend against adversarial attack. After training on the mixture of orginal dataset and newly generated samples, the detector becomes more robust to adversarial examples.
Implementing smooth functions of a Hermitian matrix on a quantum computer

Abstract We consider methods for implementing smooth functions f ( A ) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has advantages of simplicity and resource consumption in some cases. Our construction uses the linear combination of unitaries method with Chebyshev polynomial approximations. The query complexity we obtain is <?CDATA ${ \mathcal O }\left(\mathrm{log}\tfrac{C}{\epsilon }\right)$?> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mi mathvariant="italic"></mml:mi> <mml:mrow> <mml:mfenced close=")" open="("> <mml:mrow> <mml:mi>log</mml:mi> <mml:mstyle displaystyle="false"> <mml:mfrac> <mml:mrow> <mml:mi>C</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>ϵ</mml:mi> </mml:mrow> </mml:mfrac> </mml:mstyle> </mml:mrow> </mml:mfenced> </mml:mrow> </mml:math> where ϵ is the approximation precision, and C &gt; 0 is an upper bound on the magnitudes of the derivatives of the function f over the domain of interest. The success probability depends on the 1-norm of the Taylor series coefficients of f , the sparsity d of the matrix, and inversely on the smallest singular value of the target matrix f ( A ).
WITHDRAWN: Text classification using Naïve Bayes classifier

This article has been withdrawn: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/about/our-business/policies/article-withdrawal). This article has been withdrawn as part of the withdrawal of the Proceedings of the International Conference on Emerging Trends in Materials Science, Technology and Engineering (ICMSTE2K21). Subsequent to acceptance of these Proceedings papers by the responsible Guest Editors, Dr S. Sakthivel, Dr S. Karthikeyan and Dr I. A. Palani, several serious concerns arose regarding the integrity and veracity of the conference organisation and peer-review process. After a thorough investigation, the peer-review process was confirmed to fall beneath the high standards expected by Materials Today: Proceedings. The veracity of the conference also remains subject to serious doubt and therefore the entire Proceedings has been withdrawn in order to correct the scholarly record.
Design Considerations for Building Credible Security Testbeds: Perspectives from Industrial Control System Use Cases

This paper presents a mapping framework for design factors and an implementation process for building credible Industrial Control Systems (ICS) security testbeds. The security and resilience of ICSs has become a critical concern to operators and governments following widely publicised cyber security events. The inability to apply conventional Information Technology security practice to ICSs further compounds challenges in adequately securing critical systems. To overcome these challenges, and do so without impacting live environments, testbeds are widely used for the exploration, development, and evaluation of security controls. However, how a testbed is designed and its attributes, can directly impact not only its viability but also its credibility. Combining systematic and thematic analysis, and the mapping of identified ICS security testbed design attributes, we propose a novel relationship map of credibility-supporting design factors (and their associated attributes) and a process implementation flow structure for ICS security testbeds. The framework and implementation process highlight the significance of demonstrating some design factors such as user/experimenter expertise, clearly defined testbed design objectives, simulation implementation approach, covered architectural components, core structural and functional characteristics covered, and evaluations to enhance confidence, trustworthiness and acceptance of ICS security testbeds as credible. These can streamline testbed requirement definition, improve design consistency and quality while reducing implementation costs.
A convex variational method for super resolution of SAR image with speckle noise

Super resolution (SR) is an attractive issue in image processing. In the synthetic aperture radar (SAR) image, speckle noise is a crucial problem that is multiplicative. Therefore, numerous custom SR methods considering additive Gaussian noise cannot respond to this image degradation model. The main contribution of this paper is to propose a novel variational convex optimization model for the single SAR image SR reconstruction with speckle noise that is one of the first works in this field. Employing maximum a posteriori (MAP) estimator and proposing an effective regularization based on combination of sparse representation, total variation (TV) and a novel feature space based soft projection tool to use merits of them is the main idea. To solve the proposed model, the split Bregman algorithm is employed efficiently. Experimental results for the multiple synthetic and realistic SAR images show the effectiveness of proposed method in terms of both fidelity and visual perception.
Superadiabatic thermalization of a quantum oscillator by engineered dephasing

Fast nonadiabatic control protocols known as shortcuts to adiabaticity have found a plethora of applications, but their use has been severely limited to speeding up the dynamics of isolated quantum systems. We introduce shortcuts for open quantum processes that make possible the fast control of Gaussian states in non-unitary processes. Specifically, we provide the time modulation of the trap frequency and dephasing strength that allow preparing an arbitrary thermal state in a finite time. Experimental implementation can be done via stochastic parametric driving or continuous measurements, readily accessible in a variety of platforms.
iSeeBetter: Spatio-temporal video super-resolution using recurrent generative back-projection networks

Recently, learning-based models have enhanced the performance of single-image super-resolution (SISR). However, applying SISR successively to each video frame leads to a lack of temporal coherency. Convolutional neural networks (CNNs) outperform traditional approaches in terms of image quality metrics such as peak signal to noise ratio (PSNR) and structural similarity (SSIM). However, generative adversarial networks (GANs) offer a competitive advantage by being able to mitigate the issue of a lack of finer texture details, usually seen with CNNs when super-resolving at large upscaling factors. We present iSeeBetter, a novel GAN-based spatio-temporal approach to video super-resolution (VSR) that renders temporally consistent super-resolution videos. iSeeBetter extracts spatial and temporal information from the current and neighboring frames using the concept of recurrent back-projection networks as its generator. Furthermore, to improve the "naturality" of the super-resolved image while eliminating artifacts seen with traditional algorithms, we utilize the discriminator from super-resolution generative adversarial network (SRGAN). Although mean squared error (MSE) as a primary loss-minimization objective improves PSNR/SSIM, these metrics may not capture fine details in the image resulting in misrepresentation of perceptual quality. To address this, we use a four-fold (MSE, perceptual, adversarial, and total-variation (TV)) loss function. Our results demonstrate that iSeeBetter offers superior VSR fidelity and surpasses state-of-the-art performance.
A Novel Intelligent Recommendation Algorithm Based on Mass Diffusion

Social recommendation algorithm is a common tool for recommending interesting or potentially useful items to users amidst the sea of online information. The users usually have various relationships, each of which has its unique impact on the recommendation results. It is unlikely to make accurate recommendations solely based on one relationship. Based on user-item bipartite graph, this paper establishes a multisubnet composited complex network (MSCCN) of multiple user relationships and then extends the mass diffusion (MD) algorithm into a novel intelligent recommendation algorithm. Two public online datasets, namely, Epinions and FilmTrust, were selected to verify the effect of the proposed algorithm. The results show that the proposed intelligent recommendation algorithm with two types of relationships made much more accurate recommendations than that with a single relationship and the traditional MD algorithm.