Reviewerly/exHarmony huggingface dataset:
User Experience Study of Live Streaming News with a Second Screen on a Mobile Device

With the increasing use of mobile devices, users in recent years tend to use their smart mobile phones or tablets to obtain instant information. While staying at home, users may also like to watch live streaming news on TV and utilize their mobile devices as a second screen to interact with the news in order to share feedbacks to friends or obtain more detailed information pertinent to that particular news. The purpose of this study is to investigate the user experience (UX) when users watch live streaming news on TV and use their smart mobile devices as a second screen for various social interaction requirements. It is hoped users will have more opportunities to share their viewpoints and search for more information regarding that particular news to the public, and their voices can easily be heard.
Evolution of Hierarchical Structure and Reuse in iGEM Synthetic DNA Sequences

Many complex systems, both in technology and nature, exhibit hierarchical modularity: smaller modules, each of them providing a certain function, are used within larger modules that perform more complex functions. Previously, we have proposed a modeling framework, referred to as Evo-Lexis [21], that provides insight to some fundamental questions about evolving hierarchical systems. The predictions of the Evo-Lexis model should be tested using real data from evolving systems in which the outputs can be well represented by sequences. In this paper, we investigate the time series of iGEM synthetic DNA dataset sequences, and whether the resulting iGEM hierarchies exhibit the qualitative properties predicted by the Evo-Lexis framework. Contrary to Evo-Lexis, in iGEM the amount of reuse decreases during the timeline of the dataset. Although this results in development of less cost-efficient and less deep Lexis-DAGs, the dataset exhibits a bias in reusing specific nodes more often than others. This results in the Lexis-DAGs to take the shape of an hourglass with relatively high H-score values and stable set of core nodes. Despite the reuse bias and stability of the core set, the dataset presents a high amount of diversity among the targets which is in line with modeling of Evo-Lexis.
ViVid

We present ViVid, a mobile app for iOS that empowers users to express dynamics in stylized Live Photos. This app uses state-of-the-art computer-vision techniques based on convolutional neural networks to estimate motion in the video footage that is captured together with a photo. Based on this analysis and best practices of contemporary art, photos can be stylized as a pencil drawing or cartoon look that includes design elements to visually suggest motion, such as ghosts, motion lines and halos. Its interactive parameterizations enable users to filter and art-direct composition variables, such as color, size and opacity. ViVid is based on Apple's CoreML, Metal and PhotoKit APIs for optimized on-device processing. Thus, the motion estimation is scheduled to utilize the dedicated neural engine, while shading-based image stylization is able to process the video footage in real-time on the GPU. This way, the app provides a unique tool for creating lively photo stylizations with ease.
A gender identification of text author in mixture of Russian multi-genre texts with distortions on base of data-driven approach using machine learning models

In this work we investigate a wide set of machine learning models of data-driven approaches (Long Short-Term Memory networks, Convolutional neural networks, multilayer perceptrons, Random Forest Classifiers, Logistic Regression and Gradient Boosting Classifiers with different sets of features) to identify the gender of author in Russian multi-genre texts in the case of existing style distortions and gender deceptions in training and testing sets. We consider and evaluate accuracy for the following situations: the influence of style distortions and gender deceptions in training texts for different genre, and the case when such deception is present only in test results. A comparison with known literature data is presented.The set of data corpora includes: one collected by a crowdsourcing platform, essays of Russian students (RusPersonality), Gender Imitation corpus, and the corpora used at Forum for Information Retrieval Evaluation 2017 (FIRE), containing texts from Facebook, Twitter and Reviews. We present the analysis of numerical experiments based on different features (morphological data, vector of character n-gram frequencies, LIWC and others) of input texts along with various machine learning models. The presented results, obtained on a wide set of data-driven models, establish the accuracy level for the task to identify gender of an author of a Russian text in the multi-genre case and analyzed the effect of the presence of deception in the test and training sets.
Hole-Free Partially Directed Animals

We consider the class of hole-free partially directed animals. This is the class of all polyominoes P such that every cell of P can be reached from any cell in the first column of P with a path (inside P) which makes only North, South and East steps, and such that there is not a finite region of empty unitary squares which is surrounded by cells belonging to P. We provide a generation algorithm that allows us to enumerate in constant amortized time using O(n) space.
Traces of hypergraphs

Let Tr ( n , m , k ) denote the largest number of distinct projections onto k coordinates guaranteed in any family of m binary vectors of length n. The classical Sauer–Perles–Shelah Lemma implies that Tr ( n , n r , k ) = 2 k for k ⩽ r . Although determining Tr ( n , m , k ) precisely for general k and m seems hopeless, estimating it remains a widely open problem with connections to important questions in computer science and combinatorics. For example, an influential result of Kahn–Kalai–Linial gives non-trivial bounds on Tr ( n , m , k ) for k = Θ ( n ) and m = Θ ( 2 n ) . Here, we prove that, for r , α − 1 ⩽ n o ( 1 ) , it holds that Tr ( n , n r , α n ) = n μ ( 1 + o ( 1 ) ) with μ = r + 1 − log ( 1 + α ) 2 − log ( 1 + α ) . Thus, we (essentially) determine Tr ( n , m , k ) for k = Θ ( n ) and all m up to 2 n o ( 1 ) . For the proof, we establish a ‘sparse’ version of another classical result, the Kruskal–Katona Theorem, which gives a stronger guarantee when the hypergraph does not induce dense sub-hypergraphs. Furthermore, we prove that the parameters in our sparse Kruskal–Katona theorem are essentially best possible. Finally, we mention two simple applications which may be of independent interest.
User-Oriented Augmented Reality Content Delivery and Management for Ubiquitous Manufacturing

Abstract Ubiquitous manufacturing provides users with advanced control over the physical manufacturing environment. Ubiquitous augmented reality (UAR) interface enables direct manipulation in an environment containing smart objects. This paper describes a framework for implementing augmented reality (AR) in a ubiquitous manufacturing environment. The proposed system makes use of real-time data captured from client machines to update and manage AR contents. Ubiquitous augmented reality is utilized as a user interface for the client users to receive instructions and guidance from the system and to update the system on task parameters. A review of related work, and the framework, methodology, and implementation of the proposed system, and a case study are presented in this paper to demonstrate the UAR content delivery and update.
Computational Representation of Paninian Rules of Sanskrit Grammar for Dictionary-Independent Machine Translation

Since the beginning of computational linguistics machine translation is being one of the holy grail of natural language processing. With the advancement of world wide web and emergence of data driven methods the machine translation has received a jolt of new activity and more visibility. Still the visible lack of accuracy in machine translation shows that the much work remains to be done in concern of human identical translation. The approaches of machine translation uses the dictionary meaning of the target language as a heart of translation process. Dictionary based machine translation system continuously requires the intervention from the human expert. Unlike other languages Sanskrit is having a standalone procedure for developing new words and defining its meaning as well. Maharshi Panini developed a complete set of grammatical rules that defines the whole procedure to process the input language. The paper presents the computer simulation of Paninian rules of Sanskrit grammar focuses on the generation of meaning of unknown word using most elementary component of a language - dhAtu. We have used the direct machine translation approach for achieving dictionary-independent machine translation.
Design of Remote Expert Evaluation System in Remote Mountainous Area Based on Cloud Service Platform

Faced with limited technical strength and resource protection requirements in remote mountainous areas, a remote expert evaluation system was designed based on a cloud service platform. On the basis of the analysis of system users, the remote expert evaluation system was structured, and then the cloud platform service architecture and the system functions were designed. This cloud platform construction could enhance the informatization level of the planning review process and improve the efficiency and the scientific nature of the review process.
Robust Angular Local Descriptor Learning

In recent years, the learned local descriptors have outperformed handcrafted ones by a large margin, due to the powerful deep convolutional neural network architectures such as L2-Net [1] and triplet based metric learning [2]. However, there are two problems in the current methods, which hinders the overall performance. Firstly, the widely-used margin loss is sensitive to incorrect correspondences, which are prevalent in the existing local descriptor learning datasets. Second, the L2 distance ignores the fact that the feature vectors have been normalized to unit norm. To tackle these two problems and further boost the performance, we propose a robust angular loss which (1) uses cosine similarity instead of L2 distance to compare descriptors and (2) relies on a robust loss function that gives smaller penalty to triplets with negative relative similarity. The resulting descriptor shows robustness on different datasets, reaching the state-of-the-art result on Brown dataset, as well as demonstrating excellent generalization ability on the Hpatches dataset and a Wide Baseline Stereo dataset.
Automatic white-box testing of first-order logic ontologies

Abstract Formal ontologies are axiomatizations in a logic-based formalism. The development of formal ontologies is generating considerable research on the use of automated reasoning techniques and tools that help in ontology engineering. One of the main aims is to refine and to improve axiomatizations for enabling automated reasoning tools to efficiently infer reliable information. Defects in the axiomatization cannot only cause wrong inferences, but can also hinder the inference of expected information, either by increasing the computational cost of or even preventing the inference. In this paper, we introduce a novel, fully automatic white-box testing framework for first-order logic (FOL) ontologies. Our methodology is based on the detection of inference-based redundancies in the given axiomatization. The application of the proposed testing method is fully automatic since (i) the automated generation of tests is guided only by the syntax of axioms and (ii) the evaluation of tests is performed by automated theorem provers (ATPs). Our proposal enables the detection of defects and serves to certify the grade of suitability—for reasoning purposes—of every axiom. We formally define the set of tests that are (automatically) generated from any axiom and prove that every test is logically related to redundancies in the axiom from which the test has been generated. We have implemented our method and used this implementation to automatically detect several non-trivial defects that were hidden in various FOL ontologies. Throughout the paper we provide illustrative examples of these defects, explain how they were found and how each proof—given by an ATP—provides useful hints on the nature of each defect. Additionally, by correcting all the detected defects, we have obtained an improved version of one of the tested ontologies: Adimen-SUMO.
Web Covert Timing Channels Detection based on Entropy

Todays analyzing web weaknesses and vulnerabilities in order to find security attacks has become more urgent. In case there is a communication contrary to the system security policies, a covert channel has been created. The attacker can easily disclosure information from the victim's system with just one public access permission. Covert timing channels, unlike covert storage channels, do not have memory storage and they draw less attention. Different methods have been proposed for their identification, which generally benefit from the shape of traffic and the channel's regularity. In this article, an entropy-based detection method is designed and implemented. The attacker can adjust the amount of channel entropy by controlling measures such as changing the channel's level or creating noise on the channel to protect from the analyst's detection. As a result, the entropy threshold is not always constant for detection. By comparing the entropy from different levels of the channel and the analyst, we conclude that the analyst must investigate traffic at all possible levels.
Depth estimation using modified cost function for occlusion handling

This paper presents a novel approach to the occlusion handling problem in depth estimation using three views. A solution based on modification of similarity cost function is proposed. During the depth estimation via optimization algorithms, like Graph Cuts, the similarity metric is constantly updated so that only non-occluded fragments in the side views are considered. At each iteration of the algorithm, non-occluded fragments are detected based on side view virtual depth maps synthesized from currently the best estimated depth map of the center view. Then, the similarity metric is updated for correspondence search only in non-occluded regions of the side views. The experimental results, conducted on well-known 3D video test sequences, show that the depth maps estimated with the proposed approach provide about 1.25 dB virtual view quality improvement in comparison with the virtual view synthesized based on depth maps generated with the use of the state-of-the-art MPEG Depth Estimation Reference Software.
A New Probabilistic Tree Expression for Probabilistic Model Building Genetic Programming

Kumoyama, Daichi Hanada, Yoshiko Ono, KeikoThis paper proposes a new expression of probabilistic tree for probabilistic model building GPs (PMBGP). Tree-structured PMBGPs estimate the probability of appearance of symbols at each node of the tree from past search information, and decide the symbol based on the probability at each node in generating a solution. The probabilistic tree is a key component of PMBGPs to keep appearance frequencies of symbols at each node by probabilistic tables, and the probabilistic prototype tree (PPT) expressed as a perfect tree has been often employed in order to include any breadth of trees. The depth of PPT is an important parameter that involves trade-off between the search accuracy and the computational cost. The appropriate depth depends on problems and is difficult to be estimated in advance. Our proposed probabilistic tree is constructed by a union operator between probabilistic trees, and its depth and breadth are extendable, so that the depth of the probabilistic tree is not required as a parameter and it needs not necessarily be a perfect tree. Through numerical experiments, we show the effectiveness of the proposed probabilistic tree by incorporating it to a local search-based crossover in symbolic regression problems.
ModGuard : Identifying Integrity &amp; Confidentiality Violations in Java Modules

With version 9, Java has been given the new module system Jigsaw. Major goals were to simplify maintainability of the JDK and improve its security by encapsulating modules' internal types. While the module system successfully limits the visibility of internal types, it does not prevent sensitive data from escaping. Since the module system reasons about types only, objects are allowed to escape even if that module declares the type as internal. Finding such unintended escapes is important, as they may violate a module's integrity and confidentiality, but is a complex task as it requires one to reason about pointers and type hierarchy. We thus present ModGuard, a novel static analysis based on Doop which complements the Java module system with an analysis to automatically identify instances that escape their declaring module. Along with ModGuard we contribute a complete formal definition of a module's entrypoints, i.e., the method implementations that a module actually allows other modules to directly invoke. We further make available a novel micro-benchmark suite MIC9Bench to show the effectiveness but also current shortcomings of ModGuard, and to enable comparative studies in the future. Finally, we describe a case study that we conducted using Apache Tomcat, which shows that a migration of applications towards Jigsaw modules does not prevent sensitive instances from escaping, yet also shows that ModGuard is an effective aid in identifying integrity and confidentiality violations of sensitive instances.
The improved protocol based on the Bennett 92 protocol

In this paper, we propose a quantum key distribution (QKD) protocol based on the protocol of Bennett in 1992 (Phys Rev Lett, 68 3121, 1992) which utilized the pulse position modulation (PPM) and the orbital angular momentum (OAM) to improve the key rate and increase secure transmission distance. In our protocol, we apply PPM technology to B92 protocol (PPM-B92) to increase the key rate. In general, for an optical pulse with the average photon number μ = 0.1, we know that the empty photons is as high as 90.48%. In our protocol, there is only one time slot with photon pulses, and the photons in the pulses carry the log2 M bit information, so the key rate is improved. Bob only modulates the legal time slots to improve the efficiency of the protocol. Secondly, we apply orbital angular momentum (OAM) to the PPM-B92 protocol (PPM-OAM-B92) to increase secure transmission. OAM has rotation invariance, which solves the dependence of base. Through the MATLAB simulation results, we can see that the key rate of the PPM-B92 protocol is always higher than B92's. The PPM-OAM-B92 protocol can accommodate channel transmission loss up to 29dB.
Effects of atmospheric turbulence and misalignment-induced fading on the secrecy performance of IM/DD free-space CV-QKD systems using a Gaussian beam

This paper explores the secrecy performance of the recently proposed intensity modulation/direct detection (IM/DD) terrestrial free-space quantum key distribution (QKD) system, by using a Gaussian-beam propagation model and considering the combined effects of atmospheric turbulence and legitimate transceivers’ misalignment. Secrecy performance metrics including quantum bit error rate (QBER) and ergodic secret-key rate are newly derived in closedform expressions, taking into account all combined effects of turbulence- and misalignment-induced fading channels, the eavesdropper’s location relative to the legitimate receiver, and receiver noises. To satisfy security constraints, the system designs based on the intensity modulation depth and beam waist of the Gaussian beam at the transmitter, and dualthreshold (D-T) selection at the receiver, are comprehensively discussed under turbulence and misalignment conditions as well as different eavesdropper’s locations. Monte-Carlo (M-C) simulations are also implemented to verify the analytical results. Remarkably, this paper also offers the first framework in the literature to evaluate the secrecy performance of free-space optical (FSO) systems considering the eavesdropper’s location under the effect of misalignment between legitimate transceivers.
Introducing Arithmetic Failures to Accelerate QC-MDPC Code-Based Cryptography

In this work, we optimize the performance of QC-MDPC code-based cryptosystems through the insertion of configurable failure rates in their arithmetic procedures. We present constant time algorithms with a configurable failure rate for multiplication and inversion over binary polynomials, the two most expensive subroutines used in QC-MDPC implementations. Using a failure rate negligible compared to the security level ( $$2^{-128}$$ ), our multiplication is 2 times faster than NTL on sparse polynomials and 1.6 times faster than a naive constant-time sparse polynomial multiplication. Our inversion algorithm, based on Wu et al., is 2 times faster than the original algorithm and 12 times faster than Itoh-Tsujii using the same modulus polynomial ( $$x^{32749} - 1$$ ). By inserting these algorithms in a version of QcBits at the 128-bit quantum security level, we were able to achieve a speedup of 1.9 on the key generation and up to 1.4 on the decryption time. Comparing with variant 2 of the BIKE suite, which also implements the Niederreiter Cryptosystem using QC-MDPC codes, our final version of QcBits performs the uniform decryption 2.7 times faster.
Flash, Storm, and Mistral: Hardware-Friendly and High Quality Tone Mapping

While high dynamic range (HDR) images are being used ever more widely, the majority of display devices are able to properly handle only low dynamic range (LDR) images. Tone mapping operators (TMOs) solve this problem by compressing the dynamic range of HDR images so that they can be displayed as LDR images. The problem with many state-of-the-art TMOs is that despite giving high quality results they are often too complex to be used for simple hardware implementations. In this paper several new TMOs formed around the perceptually based Naka-Rushton equation are proposed with the main goal being hardware-friendliness. The proposed TMOs are of gradually increasing complexity, which allows choosing the most appropriate trade-off between quality and complexity, and all of them are designed to have O(1) per-pixel complexity. The results are presented and discussed and it is shown that the proposed TMOs outperform most well-known publicly available TMOs in terms of quality and speed. The source codes of the proposed TMOs written in C++, Matlab, Python, Java, and HTML+JavaScript are available at http://www.fer.unizg.hr/ipg/resources/color_constancy/ .