Reviewerly/exHarmony huggingface dataset:
Defining Stable Touch Area Based on a Large-Screen Smart Device in 3D-Touch Interface

&lt;p&gt;&lt;span lang="EN-US"&gt;&lt;span style="font-family: Gulim; font-size: medium;"&gt;Touch interface technologies for mobile devices are essentially in use. The purpose of such touch interfaces is to run an application by touching a screen with a user’s finger or to implement various functions on the device. When the user has an attempt to use the touch interface, users tend to grab the mobile device with one hand. Because of the existence of untouchable areas to which the user cannot reach with the user’s fingers, it is possible to occur for a case where the user is not able to touch a specific area on the screen accurately. This results in some issues that the mobile device does not carry out the user’s desired function and the execution time is delayed due to the wrong implementation. Therefore, there is a need to distinguish the area where the user can stably input the touch interface from the area where the users cannot and to overcome the problems of the unstable touch area. Furthermore, when the size of the screen increases, these issues will become more serious because of an increase in the unstable touch areas. Especially, an interface that receives position and force data like 3D-touch requires the stable area setting different from the conventional 2D-touch. In this paper, we search and analyze the stable touch areas on the large screen where the user can do 3D-touch inputs.&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
Целостность авторского сознания как признак главного дискурсивного плана в лирическом стихотворении

Lyrical poem is normally split in two parts, one of which presents some experience, and another comprises discovery of an important, usually general truth. It is the latter one which is foregrounded in lyrical discourse, while the former one serves to prepare the relevant discovery. The paper is concerned with one characteristic property of the foreground in lyrical poetry, which is high integrity of the author’s conscience. A quantitative test for such an integrity is proposed, and text counts are presented, which show how significantly foreground tends to differ from background in this respect. In conclusion, some promising perspectives of further research are outlined.
Rationals vs Byzantines in Consensus-based Blockchains

In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee coordination game. Our first contribution is to offer a game-theoretical methodology to analyse equilibrium interactions between Byzantine and rational committee members in Byzantine Fault Tolerant blockchains. Byzantine processes seek to inflict maximum damage to the system, while rational processes best-respond to maximise their expected net gains. Our second contribution is to derive conditions under which consensus properties are satisfied or not in equilibrium. When the majority threshold is lower than the proportion of Byzantine processes, invalid blocks are accepted in equilibrium. When the majority threshold is large, equilibrium can involve coordination failures , in which no block is ever accepted. However, when the cost of accepting invalid blocks is large, there exists an equilibrium in which blocks are accepted iff they are valid.
Eye Direction Based Safety Navigation System for Physically Challenged Person

This research papers include the eye direction based safety automated navigation system that implemented for the elderly and physically challenged people.The purpose of this navigation system is to avoid the assist required for the physically challenged people.This systems control the motorized wheelchair navigation depends on the eye pupil detection.By the image processing technique (CNN), the sequential images have been capture via Bluetooth specs glass.The system navigate the user to desired directions such as move towards left, move towards right, move forward and stop.Additionally sensors are fixed in front of wheelchair to detect the objects to avoid the faulty navigation.A centralized wireless detector device is also made available in wheelchair for an emergency purpose.A raspberry pi model B is high speed detection kit controls the whole system.Another technique used in this navigation system speech to text conversion.Speech convert to text and then a connection established to raspberry pi model kit.So the system automatically moves by the users given the instruction.
Role of Knowledge Processes as a Mediator Variable in Relationship between Strategic Management of Human Resources and Achieving Competitive Advantage in Banks Operating in Jordan

This research is concerned with studying direct and indirect relationship between strategic management of human resources and achieving competitive advantage through knowledge processes as a mediator variable in banks operating in Jordan. To achieve this, a sample of 348 managers, assistant managers, heads of departments and their assistants in significant departments, which have direct relation with this study. Study results showed that there is a significant relationship between applying strategic management of human resources in banks operating in Jordan and achieving competitive advantage (lowest cost, quality, creativity). In addition, the existence of a significant relationship between applying strategic management of human resources in banks operating in Jordan in question and knowledge processes (knowledge generation, knowledge sharing, and knowledge application). The existence of a significant relationship between practicing knowledge processes and achieving competitive advantage (lowest cost, quality, creativity)as well as the existence of a significant indirect relationship between applying strategic management of human resources in banks operating in Jordan in question and achieving competitive advantage through knowledge processes as a mediator variable
Single Scan Granulometry Estimation from an Asymmetric Distance Map

Granulometry, by characterizing the distribution of object sizes, is a powerful tool for the analysis of binary images. It may, for example, extract pertinent features in the context of texture classification. The granulometry is similar to a sieving process that filters image details of increasing sizes. Its computation classically relies on morphological openings, i.e. the sequence of an erosion followed by a dilation for each ball radius. It is well known that a distance map can be described as an “erosion transform” that summarizes the erosions with the balls of all radii. Using a Steiner formula, we show how a vector of parameters measured on an eroded contour can be extrapolated to the measures of the dilation. Instead of completing the openings from the distance map by computing a dilation for each ball size, we can estimate their cardinality from the area, perimeter and Euler-Poincaré characteristic of each erosion. We extract these measures for all radii at once from an asymmetric distance map. The result is a fast streaming algorithm that provides an estimate of the granulometry distribution, in a single scan of the image and with very limited memory footprint.
RANCANG BANGUN SISTEM ADMINISTRASI PERIZINAN KURSUS UNTUK MENINGKATKAN PELAYANAN MASYARAKAT PADA PUSAT PEMERINTAHAN

The One Stop Integrated Services Investment Office (DPMPTSP) is one part of the Regency / City Government Center that serves licensing, one of which is the course. In practice, some regencies / cities actually have an online licensing system, besides that DPMPTSP also has its own website for course licensing but in practice both application systems are rarely used by people who want to take care of permits for various reasons, including administrative requirements that are difficult, access constraints that are sometimes problematic, the length of response time is compared to direct dating and so on. The purpose of this study is to find out the process of licensing the course, create an effective and efficient licensing system concept, and create a concept of a fast and accurate licensing system course. So the authors get alternative solutions to the problem that the public must be familiar with the online system and procedures in licensing the course should not be too long so that the community is easier to manage permits, besides the proposed system, is expected to be a companion to the existing licensing system dealing with dating directly.
Concepción de la evaluación del aprendizaje en el aula virtual

The article proposes a theoretical - methodological conception of the evaluation of the learning in the virtual classroom that reveals the nexuses between the existent theory regarding the evaluation and the potentialities of the interactive platforms for its implementation. The proposal is based on essential theoretical foundations and the determination of a system of basic concepts that constitute the conceptual framework; the functions of the evaluation are contextualized and didactic requirements are established for the evaluation of learning in the virtual classroom. It is proposed a methodological procedure that constitutes a guide for the teacher, by incorporating the evaluative resources of the interactive platforms, to the process of evaluation of learning. This result is the product of educational research.
Introduction to Machine Learning

This chapter provides a basic explanation of the concept of machine learning (ML) along with information about its applications, types of ML, how it works, and why we need it. Even if you are a novice to the concept, this chapter should help you with the information you need to get started with ML. It is a fun chapter, with lots of pictures and examples to help you understand the text.
Deep Multi-scale Discriminative Networks for Double JPEG Compression Forensics

As JPEG is the most widely used image format, the importance of tampering detection for JPEG images in blind forensics is self-evident. In this area, extracting effective statistical characteristics from a JPEG image for classification remains a challenge. Effective features are designed manually in traditional methods, suggesting that extensive labor-consuming research and derivation is required. In this paper, we propose a novel image tampering detection method based on deep multi-scale discriminative networks (MSD-Nets). The multi-scale module is designed to automatically extract multiple features from the discrete cosine transform (DCT) coefficient histograms of the JPEG image. This module can capture the characteristic information in different scale spaces. In addition, a discriminative module is also utilized to improve the detection effect of the networks in those difficult situations when the first compression quality (QF1) is higher than the second one (QF2). A special network in this module is designed to distinguish the small statistical difference between authentic and tampered regions in these cases. Finally, a probability map can be obtained and the specific tampering area is located using the last classification results. Extensive experiments demonstrate the superiority of our proposed method in both quantitative and qualitative metrics when compared with state-of-the-art approaches.
Rapidly Adapting Moment Estimation.

Adaptive gradient methods such as Adam have been shown to be very effective for training deep neural networks (DNNs) by tracking the second moment of gradients to compute the individual learning rates. Differently from existing methods, we make use of the most recent first moment of gradients to compute the individual learning rates per iteration. The motivation behind it is that the dynamic variation of the first moment of gradients may provide useful information to obtain the learning rates. We refer to the new method as the rapidly adapting moment estimation (RAME). The theoretical convergence of deterministic RAME is studied by using an analysis similar to the one used in [1] for Adam. Experimental results for training a number of DNNs show promising performance of RAME w.r.t. the convergence speed and generalization performance compared to the stochastic heavy-ball (SHB) method, Adam, and RMSprop.
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We can ask the same question modulo prime-powers $p^k$. The irreducible factors of $f\bmod p^k$ blow up exponentially in number; making it hard to describe them. Can we count those irreducible factors $\bmod~p^k$ that remain irreducible mod $p$? These are called {\em basic-irreducible}. A simple example is in $f=x^2+px \bmod p^2$; it has $p$ many basic-irreducible factors. Also note that, $x^2+p \bmod p^2$ is irreducible but not basic-irreducible! We give an algorithm to count the number of basic-irreducible factors of $f\bmod p^k$ in deterministic poly(deg$(f),k\log p$)-time. This solves the open questions posed in (Cheng et al, ANTS'18 \& Kopp et al, Math.Comp.'19). In particular, we are counting roots $\bmod p^k$; which gives the first deterministic poly-time algorithm to compute Igusa zeta function of $f$. Also, our algorithm efficiently partitions the set of all basic-irreducible factors (possibly exponential) into merely deg$(f)$-many disjoint sets, using a compact tree data structure and {\em split} ideals.
Celebrating the first year of Internet Technology Letters

Internet Technology LettersVolume 2, Issue 2 e90 EDITORIAL Celebrating the first year of Internet Technology Letters Alfredo L. Grieco, Alfredo L. Grieco DEI - Politecnico di Bari, Bari, ItalySearch for more papers by this author Alfredo L. Grieco, Alfredo L. Grieco DEI - Politecnico di Bari, Bari, ItalySearch for more papers by this author First published: 25 February 2019 https://doi.org/10.1002/itl2.90Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat No abstract is available for this article. Volume2, Issue2March/April 2019e90 RelatedInformation
A Collision-Free Path Planning Approach for Multiple Robots Under Warehouse Scenarios

Coordinating the motion of multi-robot is one of the fundamental problems in robotics, and how to find collision-free paths efficiently is an open issue. The high time complexity in existing methods severely hinders the applications of multi-robot in practice, especially in an overloaded warehouse scenario. To overcome this difficulty, we propose a collision-free search algorithm based on Jump point search (JPS) to improve the searching efficiency, where a reverse search path is employed to estimate the distance from the current position of one robot to the target position during traversing the root node. The experimental results show that the proposed method can achieve a higher efficiency compared with the traditional methods.
Hands-on Cybersecurity Exercises that are Easy to Access

The critical shortage of cyber security professionals has driven faculty interest in adding this to the curriculum, and it was added to the ACM/ IEEE Model Curriculum of 2013. This is a subject that demands hands-on exercises. There has been a modest increase in the number of such exercises, but the limit is usability. Most faculty do not have the time to create their own exercises, modify and install VMs, and set up assessment mechanisms. EDURange is a framework for accessing, developing and assessing interactive cybersecurity exercises. It has a range of exercises from introductory to advanced. We will demo an introductory exercise about using the command line and an advanced exercise about network scanning. We want to reach and engage as many faculty as possible, so that they can develop their own exercises. EDURange uses VMs in the cloud. Students only need an ssh-client. We have built tools to give faculty detailed information on how students are doing. This allows instructors to more easily see when students are stuck or heading in the wrong direction. The exercises we have created have manuals that instructors can use. Information about EDURange can be found at https://edurange.org.
Quantum security of hash functions and property-preservation of iterated hashing

This work contains two major parts: comprehensively studying the security notions of cryptographic hash functions against quantum attacks and the relationships between them; and revisiting whether Merkle-Damgard and related iterated hash constructions preserve the security properties of the compression function in the quantum setting. Specifically, we adapt the seven notions in Rogaway and Shrimpton (FSE'04) to the quantum setting and prove that the seemingly stronger attack model where an adversary accesses a challenger in quantum superposition does not make a difference. We confirm the implications and separations between the seven properties in the quantum setting, and in addition we construct explicit examples separating an inherently quantum notion called collapsing from several proposed properties. Finally, we pin down the properties that are preserved under several iterated hash schemes. In particular, we prove that the ROX construction in Andreeva et al. (Asiacrypt'07) preserves the seven properties in the quantum random oracle model.
About CYRAIL project – CYRail project

Added Value Facts and Figures Final recommendations The main technical objectives of CYRAIL are: To select security analysis frameworks capable of assessing the most critical railway services,…
Properties of the stochastic ordering for discrete distributions and their applications to the renewal sequence generated by a nonhomogeneous Markov chain

The generalized stochastic ordering is studied for which the dominating sequence is not necessarily a probability distribution so that its total mass may exceed unity. We study the stochastic ordering for sums as well as random sums of independent as well as dependent random variables. A stochastic ordering is constructed for the renewal sequence generated by a nonhomogeneous Markov chain. The consideration is restricted to the case of discrete random variables.
10. Information structure and truth conditional semantics

I discuss the relation between information structure and truth conditional semantics, concentrating on the question of whether there is any direct interaction between the various information structural dimensions and operators such as quantified DPs and quantificational adverbs. Concerning the focus-background dimension, we will see that in most cases truth-conditional effects do not result from direct focus sensitivity of the involved operators, but rather come about as indirect effects of the need to resolve a free variable that is present in the denotation of these operators on the basis of contextual information - with the notable exception of exclusives such as only. Concerning the topic-comment dimension, in cases where a quantificational DP functions as the aboutness topic of a sentence, the need to interpret the comment as a predicate that can be applied to the topic has truthconditional effects in the presence of either another quantificational DP, a quantificational adverb or generic tense. In cases where a quantificational DP is marked as a contrastive topic, on the other hand, truth-conditional effects come about indirectly. Finally, concerning the given-new dimension, there is also no evidence for a direct influence on the truth conditions of sentences, but only for indirect effects.
VPN IS SECURE THEN OTHER PROXIES FOR INTERNET FILTARATION

The purpose of using both VPN and proxy servers is to conceal the users identity, or to spoof a certain geo-location (so for example geo-locked services such as many TV streaming websites may be watched outside their country of origin). Many VPN Providers, in addition to offering VPN also provide some kind of proxy service, and there are also many public proxy servers which can be used for free. So the question is ‘what is the difference between a proxy and a VPN?’ Although performing a similar function, the actual processes involved are very different, and therefore have very different consequences. The subject is further complicated by the fact that there are a number of different types of proxy services available.
Migrating Library Data: A Practical Manual

"Migrating Library Data: A Practical Manual." Cataloging & Classification Quarterly, 57(2-3), pp. 184–185
Code Crafting Curriculum

This reprise of a highly successful SIGCSE 2018 workshop provides a novel perspective on: skills that are often labeled 'women's work' are the foundational principles of computer science developed from textile crafts. The 'Code Crafters' curriculum, which expands Andrea Mayer's Snap-based TurtleStitch embroidery programming project, is being successfully taught in 3 ways: as a full semester undergraduate course, as a weeklong summer workshop for middle and high school students, and as a half day event. The SIGCSE workshop will introduce participants to potential adaptations of this curriculum, report on its use as both a CS 0, and CS 1 course, and give participants hands-on experience in designing and rendering a machine embroidery pattern in TurtleStitch and Processing Stitch (Java). Key concepts from the full semester curriculum will be demonstrated: (1) crocheting as a vehicle for learning about primitive operations instruction codes for process control, and reading and writing patterns (algorithms); (2) programing machine embroidery provides exposure to agile design; (3) contrasting embroidery with quilting provides experience in abstraction and reuse; (4) weaving and tapestry provide concrete illustrations of manipulating two dimensional data structures; (5) studying embroidery machine file formats demonstrates how language translation takes place; (6) sharing a limited resource (a $500 programmable, single thread machine) provides concrete experience in scheduling, and product testing; (7) collaborative crochet and quilted projects provide experience in team dynamics. Participants in this workshop will be invited to join an online community of mutual support.
Irreducibility Criteria for the Sum of Two Relatively Prime Multivariate Polynomials

We provide irreducibility criteria for multivariate polynomials over a field K, of the form $$f+p^{k}g$$ , where $$f,g\in K[X_{1},\dots ,X_{r}]$$ , $$\deg _{r}f<\deg _{r}g$$ , $$p\in K[X_{1},\dots ,X_{r-1}]$$ is irreducible over $$K(X_{1},\dots ,X_{r-2})$$ , and $$k\ge 1$$ is an integer prime to $$\deg _{r}g$$ . More precisely, we prove that if f and g regarded as polynomials in $$X_{r}$$ with coefficients in $$K[X_{1},\dots ,X_{r-1}]$$ are relatively prime over $$K(X_{1},\dots ,X_{r-1})$$ , k is prime to $$\deg _{r}g$$ , and $$\deg _{r-1}p$$ is sufficiently large, then the polynomial $$f+p^{k}g$$ is irreducible over $$K(X_{1},\dots ,X_{r-1})$$ . This complements some previous results where k was assumed to be prime to $$\deg _{r}g-\deg _{r}f$$ .