Reviewerly/exHarmony huggingface dataset:
Digital Image Anti-counterfeiting Technology

There are many trademarks and logos around the world. Every trademark or logo represents its own brand or intellectual property. However, some people who are interested will benefit from counterfeiting trademarks or logos. As the number of counterfeit cases has increased, the technology of anti-counterfeiting has gradually been taken. Watermark is the protection method of today’s trademarks. Since the naked eye cannot guarantee the recognition rate, this study uses scientific and technical testing methods to distinguish the authenticity of the trademark. Through the method of this study combined with watermarking technology, not only the problem of misjudgment is improved, but also the location and area where the image has been tampered with can be accurately determined. It also enhances image recovery and image quality in tamper areas.
지역사회 연계 모의의회 참여 고등학생의 SSI(Socio-Scientific Issues) 논증활동 분석

The Socio-Scientific Issues (SSI) education is a process centered on controversial topics that reveal the social and ethical aspects of science, and aims to cultivate the knowledge as a citizen through the recognition and moral development of students. This study sought the possibility of using SSI education based on the agenda submitted by high school students who participated in the high school simulated assembly contest held by the Jeju Special Selfgoverning Council and the discussion data. The simulated council contest is held from the first convention in 2013 to the 6th convention in 2018, and a total of 132 agendas were submitted during this period. Among them, 40 SSI-related items accounted for 30% of the total, and a wide range of items such as the activation of electric vehicles for carbonfree islands, the protection of Jeju intertidal zone and the regulation of landfill of shared waterfront, the installation of companion animal crematoriums, and the ordinance on the acceptance of refugees in Jeju were submitted. In particular, 23 SSI-related issues were extracted from 2016 to 2018 in the last three years, and the argumentation activities on these agendas were analyzed through discourse elements and discourse cluster analysis framework focusing on how the argumentation activities in the SSI context unfolded. In the analysis of discourse elements, students were exchanging opinions on agenda through reasoning based on evidence in the structure of approval and opposition, and they were arguing in the direction of collecting opinions from each other and strengthening opinions so that agendas could be passed in a better direction. High school students’ argumentation about social issues related to science in the actual community is meaningful in that they have the experience of understanding the problems of the community themselves and deriving a plan for solving the problems. If the program related to the community is used more actively in connection with SSI education in the future, students will be able to directly experience the process of understanding various issues of the region and collecting opinions through discussions.
Search and Substitution of Web Services Operations: Composition and Matching Techniques

Measuring the similarity between web services operations is a very effective solution for both the research and the substitution. But, unfortunately, cannot often be the case. It is therefore recommended to use other means such as a composition. The composition consists of grouping the limited functionalities of the operations (respectively web services) in order to obtain more complex ones, in general, responding to a complex request. In this article, we focus on both the composition (e.g. compound operations meeting the substitution or the user’s needs) and on the matching technique (similar operations considering relations between both inputs and outputs parameters) to ensure the research and the substitution. The proposed approach is validated by an experimental study, conducted on real web services, belonging to different domains.
A study on splay trees

We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be easier to prove. This approach may be useful to establish dynamic optimality.
Improving side-channel attacks against pairing-based cryptography

Side-channel attacks are a serious threat against secret data involved in cryptographic calculations, as, for instance, pairing-based cryptography which is a promising tool for the IoT. We focus our work on correlation power analysis (CPA) attack against a pairing implementation. We improve a vertical side-channel analysis attack and propose the first horizontal attack against a pairing implementation. First, we present a characterization of the multiplication that allows us to reduce by a factor of ten the number of side-channel traces required in order to perform a CPA attack against an implementation of Ate pairing. Secondly, we successfully attack the same implementation with only one trace by using the first horizontal attack path against pairing-based cryptography.
MPMFFT based DCA-DBT integrated probabilistic model for face expression classification

Face Expression is the visible feature mask to concede person's behaviour, intension or reaction. The paper has dealt out a qualified data mining model for expression recognition called MPMFFT (Multiple Pattern Multiple Feature based Feature Transformation) integrated model. This proposed model transformed the facial information in 22 aggregative features. These features include textural, geometrical, mathematical and structural characteristics. The characteristics are captured in the entire facial region and expression sensitive selected facial segment. To acquire the features, three local region extraction models are used on both broad and responsive facial areas. This complete featured composition formed a set of 132 features. This transformed data form is treated under the danger theory. At First, DCA (Dendric Cell algorithm) is ready to generate feature patterns to identify safe and danger qualified features. After this, each cell group is processed under DBT (Dempster Belief Theory) for integrated feature weight assignment based on mapping to the expression class. This weighted and cell formed data set is finally processed under probabilistic implementation using Bayesian nets. The experiment is applied on JAFFE, CMU and CK datasets. The experimental observations are compiled for individual expressions against decision tree, SVM and KNN methods. The comparative results signify that the model improved the accuracy of each of distinctive facial expression.
Constructions of S-boxes with uniform sharing

In this paper we focus on S-box constructions. We consider the uniformity property of an S-box which plays an important role in Threshold Implementations (TI). Most papers so far have studied TI sharings for given S-boxes. We proceed in the opposite way: starting from n-bit S-boxes with known sharings we construct new (n + 1)-bit S-boxes from them with the desired sharings. In addition, we investigate the self-equivalency of S-boxes and show some interesting properties.
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics

Covering alignment problems arise from recent developments in genomics; so called pan-genome graphs are replacing reference genomes, and advances in haplotyping enable full content of diploid genomes to be used as basis of sequence analysis. In this paper, we show that the computational complexity will change for natural extensions of alignments to pan-genome representations and to diploid genomes. More broadly, our approach can also be seen as a minimal extension of sequence alignment to labelled directed acyclic graphs (labeled DAGs). Namely, we show that finding a covering alignment of two labeled DAGs is NP-hard even on binary alphabets. A covering alignment asks for two paths R1 (red) and G1 (green) in DAG D1 and two paths R2 (red) and G2 (green) in DAG D2 that cover the nodes of the graphs and maximize the sum of the global alignment scores: as(sp(R1),sp(R2))+as(sp(G1),sp(G2)), where sp(P) is the concatenation of labels on the path P. Pair-wise alignment of haplotype sequences forming a diploid chromosome can be converted to a two-path coverable labelled DAG, and then the covering alignment models the similarity of two diploids over arbitrary recombinations. We also give a reduction to the other direction, to show that such a recombination-oblivious diploid alignment is NP-hard on alphabets of size 3.
Discrete scaling based on operator theory

Signal scaling is a fundamental operation of practical importance in which a signal is made wider or narrower along the coordinate direction(s). Scaling, also referred to as magnification or zooming, is complicated for signals of a discrete variable since it cannot be accomplished simply by moving the signal values to new coordinate points. Most practical approaches to discrete scaling involve interpolation. We propose a new approach based on hyperdifferential operator theory that does not involve conventional interpolation. This approach provides a self-consistent and pure definition of discrete scaling that is fully consistent with discrete Fourier transform theory. It can potentially be applied to other problems in signal theory and analysis such as transform designs. Apart from its theoretical elegance, it also provides a basis for numerical implementation.
Infinite lattice models by an expansion with a non-Gaussian initial approximation

Recently, a convergent series employing a non-Gaussian initial approximation was constructed and shown to be an effective computational tool for the finite size lattice models with a polynomial interaction. Here we show that the Borel summability is a sufficient condition for the correctness of the convergent series applied to infinite lattice models. We test the numerical workability of the convergent series method by examining one- and two-dimensional ϕ4-infinite lattice models. The comparison of the convergent series computations and the infinite lattice extrapolations of the Monte Carlo simulations reveals an agreement between two approaches.
A Product Line Systems Engineering Process for Variability Identification and Reduction

Software product line engineering has attracted attention in the last two decades due to its promising capabilities to reduce costs and time to market through the reuse of requirements and components. In practice, developing system level product lines in a large-scale company is not an easy task as there may be thousands of variants and multiple disciplines involved. The manual reuse of legacy system models at domain engineering to build reusable system libraries and configurations of variants to derive target products can be infeasible. To tackle this challenge, a product line systems engineering process is proposed. Specifically, the process extends research in the system orthogonal variability model to support hierarchical variability modeling with formal definitions; utilizes systems engineering concepts and legacy system models to build the hierarchy for the variability model and to identify essential relations between variants; and finally, analyzes the identified relations to reduce the number of variation points. The process, which is automated by computational algorithms, is demonstrated through an illustrative example on generalized Rolls-Royce aircraft engine control systems. To evaluate the effectiveness of the process in the reduction of variation points, it is further applied to case studies in different engineering domains at different levels of complexity. Subjected to system model availability, reduction of 14%-40% in the number of variation points is demonstrated in the case studies.
Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times

We consider the fundamental problem of constructing fast circuits for the carry bit computation in binary addition. Up to a small additive constant, the carry bit computation reduces to computing an \aop, i.e., a formula of type $t_0 \land (t_1 \lor (t_2 \land ( \dots t_{m-1}) \dots )$ or $t_0 \lor (t_1 \land (t_2 \lor ( \dots t_{m-1}) \dots )$. We present an algorithm that computes the fastest known Boolean circuit for an \aop~ with given arrival times $a(t_0), \dotsc, a(t_{m-1})$ for the input signals. Our objective function is delay, a natural generalization of depth with respect to arrival times. The maximum delay of the circuit we compute is $\log_2 W + \log_2 \log_2 m + \log_2 \log_2 \log_2 m + 4.3$, where $W := \sum_{i = 0}^{m-1} 2^{a(t_i)}$. Note that $\lceil \log_2 W \rceil$ is a lower bound on the delay of any circuit depending on inputs $t_0, \dotsc, t_{m-1}$ with prescribed arrival times. Our method yields the fastest circuits for \aop s, carry bit computation and adders in terms of delay known so far.
Using Standard Typing Algorithms Incrementally

Modern languages are equipped with static type checking/inference that helps programmers to keep a clean programming style and to reduce errors. However, the ever-growing size of programs and their continuous evolution require building fast and efficient analysers. A promising solution is incrementality, aiming at only re-typing the diffs, i.e. those parts of the program that change or are inserted, rather than the entire codebase. We propose an algorithmic schema that drives an incremental usage of existing, standard typing algorithms with no changes. Ours is a grey-box approach: just the shape of the input, that of the results and some domain-specific knowledge are needed to instantiate our schema. Here, we present the foundations of our approach and the conditions for its correctness. We show it at work to derive two different incremental typing algorithms. The first type checks an imperative language to detect information flow and non-interference, and the second infers types for a functional language. We assessed our proposal on a prototypical implementation of an incremental type checker. Our experiments show that using the type checker incrementally is (almost) always rewarding.
Single-photon characteristics of superposed weak coherent states

We study a superposed weak coherent state that can fundamentally mimic an ideal single photon not only with respect to the number of photons but also in terms of an indeterminate phase. It is close to the single-photon state with high fidelity and exhibits fundamental features of single photons such as antibunching and Hong-Ou-Mandel interference. The emergence and vanishing of single-photon characteristics can be directly observed by changing two parameters, i.e., the mean photon number and number of phases. Our result shows that the uncertainty between the photon number and phase indeed constitutes the characteristics of single photons. Finally, we apply the superposed weak coherent state to quantum key distribution and demonstrate that it outperforms the typical approach using phase-randomized weak coherent states.
Phase transition in iterated quantum protocols for noisy inputs

Quantum information processing exploits all the features quantum mechanics offers. Among them there is the possibility to induce nonlinear maps on a quantum system by involving two or more identical copies of the given system in the same state. Such maps play a central role in distillation protocols used for quantum key distribution. We determine that such protocols may exhibit sensitive, quasi-chaotic evolution not only for pure initial states but also for mixed states, i.e. the complex dynamical behavior is not destroyed by small initial uncertainty. We show that the appearance of sensitive, complex dynamics associated with a fractal structure in the parameter space of the system has the character of a first order phase transition. The purity of the initial state plays the role of the control parameter and the dimension of the fractal structure is independent of the purity value after passing the phase transition point. The critical purity coincides with the purity of a repelling fixed point of the dynamics and we show that all the pre-images of states from the close neighborhood of pure chaotic initial states have purity larger than this. Initial states from this set can be considered as quasi-chaotic.
13. On the reconstruction of static and dynamic discrete structures

We study inverse problems of reconstructing static and dynamic discrete structures from tomographic data (with a special focus on the “classical” task of reconstructing finite point sets in ℝd). The main emphasis is on recent mathematical developments and new applications, which emerge in scientific areas such as physics and materials science, but also in inner mathematical fields such as number theory, optimization, and imaging. Along with a concise introduction to the field of discrete tomography, we give pointers to related aspects of computerized tomography in order to contrast the worlds of continuous and discrete inverse problems.
Introducing Noise in Decentralized Training of Neural Networks

It has been shown that injecting noise into the neural network weights during the training process leads to a better generalization of the resulting model. Noise injection in the distributed setup is a straightforward technique and it represents a promising approach to improve the locally trained models. We investigate the effects of noise injection into the neural networks during a decentralized training process. We show both theoretically and empirically that noise injection has no positive effect in expectation on linear models, though. However for non-linear neural networks we empirically show that noise injection substantially improves model quality helping to reach a generalization ability of a local model close to the serial baseline.
Rigid Motions in the Cubic Grid: A Discussion on Topological Issues

Rigid motions on 2D digital images were recently investigated with the purpose of preserving geometric and topological properties. From the application point of view, such properties are crucial in image processing tasks, for instance image registration. The known ideas behind preserving geometry and topology rely on connections between the 2D continuous and 2D digital geometries that were established via various notions of regularity on digital and continuous sets. We start by recalling these results; then we discuss the difficulties that arise when extending them from $$\mathbb {Z}^2$$ to $$\mathbb {Z}^3$$ . On the one hand, we aim to provide a discussion on strategies that prove to be successful in $$\mathbb {Z}^2$$ and remain valid in $$\mathbb {Z}^3$$ ; on the other hand, we explain why certain strategies cannot be extended to the 3D framework of digitized rigid motions. We also emphasize the relationships that may exist between specific concepts initially proposed in $$\mathbb {Z}^2$$ . Overall, our objective is to initiate an investigation about the most promising approaches for extending the 2D results to higher dimensions.
An algorithm for reversible information hiding of encrypted medical images in homomorphic encrypted domain

At present, in reversible information hiding algorithm of image, the difference expansion idea is used. After the carrier image encryption, in encrypted image, information bits are embedded in the low value, resulting in the fact that in the image embedded with watermarking information, a part of the boundary pixel value has flipped. After being extracted, the carrier image cannot be recovered completely that is not only a large quantity of calculation, and the image quality has also been some damage. A algorithm for reversible information hiding of encrypted the medical image in the homomorphic encryption domain is proposed. Combining wavelet and fast fuzzy algorithm, the image edge is extracted from the high frequency and low frequency parts of medical image, and the medical image is reconstructed in the compressed boundary part. Combined with the thought of block compressed sensing and block edge pixels, the reconstructed medical image is divided to multiple non-overlapping blocks. The pixel in the right lower edge of the block is made homomorphic encryption operation, the remaining pixels are made compressed sensing operation, and the two parts are combined to a ciphertext to be sent to the owner of the channel According to the information hiding key the secret information is embedded into the ciphertext by the channel owners. The receiver can extract the information and restore the original image based on the encryption key and the information hiding key. The experimental results show that the proposed algorithm has high embedding capacity, the image quality after recovery is high, and the computational complexity is low.
Protection of Logical Qubits via Optimal State Transfers

In quantum computing, symmetry plays a central role in protecting qubits from errors. This work develops an efficient approach to creating decoherence-free subspaces for logical qubits, by optimally transferring the states of physical qubits via concatenated dynamical decoupling. This method bears a distinct superiority for many-qubit systems, owing to its polynomial speedup over previous approaches, which makes it promising for generating a higher-dimensional decoherence-free subspace to encode more protected logical qubits for fault-tolerant quantum computation.
Use of Virtual and Augmented Reality as Tools for Visualization of Information: A Systematic Review

Visualization of Information aims to present methodologies to optimize the cognition of the agent that seeks to identify, segment and learn from information that can be presented in various forms. Based on that, this study aims to identify the availability of information through virtual environments with a focus on Virtual Reality and Augmented Reality as a support for Visualization of Information. Thus, a Systematic Literature Review (SLR) at IEEE Xplore, ScienceDirect and ACM Digital Library databases, from September 20, 2016 to November 18, 2016. Of the 174 studies surveyed, 22 met the inclusion criteria. As an analysis, this article briefly presents the contributions of each of the articles, and a discussion is made of the applicability and research opportunities that can still be made in this area.
A Blockchain Implementation of an Attendance Management System

An attendance management system (AMS) is a useful system for personal management in organizations. The existing AMSs include traditional manual method, smart-card identification, fingerprint recognition, face recognition and so on. An awkward problem with these systems is that the recorded data could be forged by malicious users. Fortunately, the blockchain is emerging which can be used to decentralize management and protect sensitive data. In this paper, we present a blockchain architecture for the AMS and its implementation in detail.