Reviewerly/exHarmony huggingface dataset:
Error reduction of quantum algorithms

We present a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent executions of an algorithm. Denoting by $\ensuremath{\rho}$ an upper bound of this probability (wlog; assume $\ensuremath{\rho}\ensuremath{\le}\frac{1}{2}$), classical techniques require $O(\frac{\ensuremath{\rho}}{{[(1\ensuremath{-}\ensuremath{\rho})\ensuremath{-}\ensuremath{\rho}]}^{2}})$ executions to reduce the error to a negligible constant. We investigate when and how quantum algorithmic techniques like amplitude amplification and estimation may reduce the number of executions. On one hand, the former idea does not directly benefit algorithms that can err on both yes and no answers and the number of executions in the latter approach is $O(\frac{1}{(1\ensuremath{-}\ensuremath{\rho})\ensuremath{-}\ensuremath{\rho}})$. We propose a quantum approach called amplitude separation that combines both these approaches and achieves $O(\frac{1}{\sqrt{1\ensuremath{-}\ensuremath{\rho}}\ensuremath{-}\sqrt{\ensuremath{\rho}}})$ executions, which betters existing approaches when the errors are high. In the multiple-weight decision problem, the input is an $n$-bit Boolean function $f(\phantom{\rule{0.16em}{0ex}})$ given as a black box and the objective is to determine the number of $x$ for which $f(x)=1$, denoted $wt(f)$, given some possible values ${{w}_{1},...,{w}_{k}}$ for $wt(f)$. When our technique is applied to this problem, we obtain the correct answer, maybe with a negligible error, using $O({log}_{2}k\sqrt{{2}^{n}})$ calls to $f(\phantom{\rule{0.16em}{0ex}})$, which shows a quadratic speedup over classical approaches and currently known quantum algorithms.
Effectiveness of Virtual Reality Technology to teach Gen Z students about Construction Safety: A Pilot Study

This pilot study was conducted to investigate the effectiveness of using Virtual Reality (VR) technologies to teach the "Generation Z" (GenZ) students about construction safety as part of the Construction Science and Management (CSM) program at Tuskegee University. Research shows that the "Technology Generation" or GenZ students are not satisfied with the traditional pedagogical methodology; rather they demand new hands-on tech-heavy immersive learning experience. In this direction, Virtual Reality is propelling profound technological renovation within the practice of Architecture, Engineering, and Construction (A/E/C) industry allowing for a new pedagogical approach. In this approach, students learn from a 3D dimensional smart environment to help identify the construction safety challenges, instead of going to the potentially dangerous construction sites. This approach has been proven to positively influence construction education in many ways, including enhanced awareness and hazards recognition, in general. This research aimed to test this theory to teach GenZ students enrolled at the CSM program at Tuskegee University. For this study, GenZ students were first exposed to traditional 2D teaching aid demonstrating construction hazards and then the multiple Virtual Reality (VR) serious games. Their response was recorded through written reports, oral interviews and a survey followed by a comparative analysis between 2D visual aid and VR technologies to test the theory as mentioned earlier. These results indicated that the GenZ students greatly welcomed VR Construction Safety exercises more than traditional 2D visual aids and were interested in exploring more.
Vaught’s Two-Cardinal Theorem and Notions of Minimality in Continuous Logic

streamline treatments of the interpretability orders * κ of Shelah, the key new notion being that of pseudosaturation.In Chapter 4, we uniformize many ultrafilter constructions in Keisler's order.As a particular application, we prove that for all 3 ≤ k < k , T k+1,k T k +1,k , where T n,k is the theory of the random k-ary n-clique free hypergraph.This improves the previous result of Malliaris and Shelah that T k+1,k T k +1,k for all k < k -1.Borel complexity is a pre-order on sentences of L 1 measuring the complexity of countable models.In Chapter 5, we describe joint work with Richard Rast and Chris Laskowski on this order.They key idea is the following: suppose Φ is a sentence of L 1 .Define css(Φ)ptl to be the set of all sentences φ ∈ L∞ , such that in some forcing extension V[G], φ becomes the canonical Scott sentence of some model of Φ. Define Φ to be the cardinality of css(Φ)ptl (possibly ∞).We show that if Φ ≤B Ψ then this induces an injection from css(Φ)ptl to css(Ψ)ptl, whence Φ ≤ Ψ .This is a potent new method for proving nonreducibilities in ≤B , and we give several applications, including the first example of a complete first order theory T with non-Borel isomorphism relation, but which is not Borel complete.In Chapter 6, we introduce the notion of thickness.The motivation is as follows: suppose Φ is a sentence of L 1 with Φ = ∞; we wish to still be able to apply counting arguments to css(Φ)ptl.The thickness spectrum (Φ, κ) of Φ accomplishes this; roughly, (Φ, κ) ≈ |CSS(Φ)ptl ∩ V κ + |, although care must be taken to ensure that thickness is a ≤B -reducibility invariant.We present several applications of the notion of thickness; in particular, we show that all the Friedman-Stanley jumps of torsion abelian groups are non-Borel complete.We also show that if Φ has the Schr öder-Bernstein property (that is, whenever two countable models of Φ are biembeddable, then they are isomorphic), then under large cardinals, Φ is not Borel complete.In Chapter 7, we describe joint work with Saharon Shelah on the complexity of countable torsion-free abelian groups.In particular, we show that if certain large cardinals fail, then torsion-free abelian groups are aΔ 1 2 -complete, where ≤ aΔ 1 2 is a well-known coarsening of ≤B .
Klasifikasi Channel Youtube Indonesia Menggunakan Algoritma C4.5

In the current era, social media is very influential in our lives whether from Instagram, Twitter, Youtube, or others. One of them is social media Youtube which has a very important role for the public, even though public figures. Youtube provides very interesting content for those who have a channel because they have an assessment of Video Upload, Subscriber, Video Viewers. Even Youtube provides an opportunity for Youtube channels that install Google AdSense to be paid to the owner of the Channel. Youtube Channel ratings can be rated from Video Upload, Subscriber, Video Viewers. From the Youtube data processing data can be done. One data processing technique that can be used in the process is classification. Classification is a data processing technique that divides objects into classes according to the desired number of classes. And using the C4.5 algorithm in the classification process. Who can determine the Youtube Channel especially Indonesia with a Very Good or Good ratio
Towards a More Efficient Representation of Functions in Quantum and Reversible Computing

Many practical problems necessitate faster and faster computations.Simple physical estimates show that eventually, to move beyond a limit caused by the speed of light restrictions on communication speed, we will need to use quantum -or, more generally, reversible -computing.Thus, we need to be able to transform the existing algorithms into a reversible form.Such transformation schemes exist.However, such schemes are not very efficient.Indeed, in general, when we write an algorithm, we composed it of several pre-existing modules.It would be nice to be able to similarly compose a reversible version of our algorithm from reversible versions of these moduli -but the existing transformation schemes cannot do it, they require that we, in effect, program everything "from scratch".It is therefore desirable to come up with alternative transformations, transformation that transform compositions into compositions and thus, transform a modular program in an efficient way -by utilizing transformed moduli.Such transformations are proposed in this paper.
Exact information ratios for secret sharing on small graphs with girth at least 5

Abstract In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it. The efficiency of the scheme is measured by the amount of information the most heavily loaded participant must remember. This amount is called information ratio, and one of the most interesting problems of this topic is to calculate the exact information ratio of given structures. In this paper, the information ratios of all but one graph-based schemes on 8 or 9 vertices with a girth at least 5 and all graph-based schemes on 10 vertices and 10 edges with a girth at least 5 are determined using two polyhedral combinatoric tools: the entropy method and covering with stars. Beyond the investigation of new graphs, the paper contains a few improvements and corrections of recent results on graphs with 9 vertices. Furthermore, we determine the exact information ratio of a large class of generalized sunlet graphs consisting of some pendant paths attached to a cycle of length at least 5.
Tecnologias da Web Semântica na arquitetura da informação

The researches of Information Architecture and Semantic Web are increasingly necessary, due to the need to have an understanding of the context of the information, both from the perspective of human users and non-humans/machines users. These two study fields contribute to improving the way informational content is presented and used in digital environments. Thus, this paper identified and analyzed the relationships between Information Architecture systems and Semantic Web resources, presenting how each Information Architecture system can benefit from the incorporation of Semantic Web technologies. For this, a qualitative methodology was used, with a descriptive and exploratory approach, relating the five systems of Information Architecture with the concepts, technologies and applications of the Semantic Web. As results, it was possible to verify that all systems of Information Architecture can be enriched with Semantic Web technologies. In this way, it was concluded that the application of Semantic Web technologies in Information Architecture systems contributes to a semantic structure of digital information environments.
Gesture based Virtual Reality Implementation for Car Racing Game employing an Improved Neural Network

This paper explores the formation of a smart human-computer interfacing system for computer gaming using Microsoft's Kinect sensor.Gesture based monitoring is chosen as the most prominent modality to continue the car racing game.Angle based features are extracted from skeletal images obtained from the sensor.Levenberg-Marquardt optimization technique is used for weight adaptation for a feed-forward neural network using back-propagation learning algorithm.A gesture based console for Asphalt 8: Airborne game is implemented.Experimental results reveal that the proposed method outperforms the state-of-the-art training methods of neural network.
Analysis of drawing characteristics for reproducing traditional hand-made stippling

We contribute an in-depth analysis of the characteristics of traditional stippling and relate these to common practices in non-photorealistic stippling as well as to the abilities and limitations of existing printing and display technologies. Based on the properties of traditional stipple dots which depend on the used pens and paper types, we focus on a perceptual study of digital stippling that further informs our discussion and work toward an understanding of the requirements for the reproduction of hand-made stippling. To allow artists and illustrators to replicate the stippling process faithfully in the digital domain, we thus extract guidelines from the study results such as that the characteristics of real dots must be reproduced because they are perceived and that the results must be adjusted to the different properties of output devices.
The Implementation of QR-Code Technology on Bulak Fish Center Information System

The technology that is currently developing is the use of QR-Code. QR-Code can convey information quickly with the acquisition of fast responses as well. QR-Code can be used on smartphones. Some media and companies widely use the QR-Code in Indonesia. QR-Code is not only used as an application identity but is also used as a means of effective, simple and modern business promotion. Making information systems for Sentra Ikan Bulak Surabaya is done by using QR-Code technology as a means of product promotion in the sales process. Research that has been done can run well and can support and be useful in improving the means of promotion. Traders find it easier to collect data on existing systems. Buyers can access the site and see reviews from other buyers so buyers will feel interested in buying the product.
Intelligent scheduling with deep fusion of hardware-software energy-saving principles for greening stochastic nonlinear heterogeneous super-systems

Green computing of stochastic nonlinear heterogeneous super-systems, represented by the cloud, is a new demand for sustainable human developments. However, the scheduling middleware is now in urgent need of a series of theoretical breakthroughs from homogeneity to heterogeneity, linearity to non-linearity, and even fuzzy decision-making to scientific decision-making based on mathematical model. Focusing on deep fusion of hardware-software energy-saving principles, an energy-aware intelligent scheduling model and algorithm are proposed in this paper; throughout the stages of model preparation, composition and algorithm designs, three features and innovations are included, which are formalizing hardware energy-saving principles via nonlinear regression quantization, a comprehensive evaluation model of adaptive green scheduling for stochastic nonlinear heterogeneous super-systems, and a scheduling algorithm with distributed evolutionary intelligence. Extensive simulator and simulation experiments highlight obvious superiorities in the proposed scheduler such as higher efficacy and better scalability, which fully considers nonlinear diversities of heterogeneous super-systems whether for data or computing intensive stochastic tasks.
White Box Implementations Using Non-Commutative Cryptography

In this paper, we present a method to create a safe arithmetic that can be used to obfuscate implementations that require operations over commutative groups. The method is based on the structure of the endomorphisms of certain extensions of the original commutative group. The endomorphisms of a commutative group are non-commutative (in general), thus we can use a non-commutative group to emulate the arithmetic of a commutative one. The techniques presented in this paper are very flexible and the programmer has a wide variety of options to obfuscate the algorithms. The system can be parameterized using conjugations, thus it is possible to generate a different arithmetic for each instance of the program with a change in the security parameters, even in cases in which this number is huge (for example, in IoT applications). The security of this method is based not only on the difficulty of the conjugacy search problem (in a harder version because only partial information about the groups is known by the attacker), but also in a number of extra options that can be chosen by the programmer. The paper explains the general method, analyzes its algebraic properties and provides detailed examples based on the vector spaces over F 2 and XOR operators.
The Development Of Family Self-Determination Of Student’s Youth

The problem of research consists in search of ways, methods and technologies of organization of psychology- pedagogical support for process of family self-determination of students youth in the conditions of university educational environment. The purpose of the study: to identify psychology-pedagogical conditions for family support of self-determination of student’s youth and to develop the program of development of family self-determination of young men and girls in the educational environment of the university. The program of a subject matter "Psychology of Family Self-Determination" is characterized and is presented by the following system characteristics: purpose, tasks, methodological approaches, principles, components, areas of work, technologies, criteria of efficiency, summary of thematic occupations. Some experimental study was organized and conducted for an assessment of efficiency of this proposed program. There were Used the method of semantic differential, developed by Charles Egerton Osgood, the questionnaire “A Value and Availability Ratio in Various Vital Spheres Technique” by E.B. Fantalova, a projective technique "Incomplete Sentences", “A Purpose-in-Life Test” by D.A. Leontiev, mathematical-statistical methods of data processing, including calculation of descriptive statistics, Shapiro–Wilk test calculation, Students t-test for dependent samples, non-parametric Wilcoxon Signed Rank Test. Positive dynamics in such indicators as values of marriage and family relations making an image as I -a family man, motives of marriage, idea of temporary prospect testifies that psychology - pedagogical support within studying of the presented course contributes to the development of family self-determination of students youth.
Breaking the Curse of Visual Data Exploration: Improving Analyses by Building Bridges between Data World and Real World

Visual data exploration is a useful means to extract relevant information from large sets of data.The visual analytics pipeline processes data recorded from the real world to extract knowledge from gathered data.Subsequently, the resulting knowledge is associated with the real world and applied to it.However, the considered data for the analysis is usually only a small fraction of the actual real-world data and lacks above all in context information.It can easily happen that crucial context information is disregarded, leading to false conclusions about the real world.Therefore, conclusions and reasoning based on the analysis of this data pertain to the world represented by the data, and may not be valid for the real world.The purpose of this paper is to raise awareness of this discrepancy between the data world and the real world which has a high impact on the validity of analysis results in the real world.We propose two strategies which help to identify and remove specific differences between the data world and the real world.The usefulness and applicability of our strategies are demonstrated via several use cases.
Ensuring Privacy Protection in Location-based Services through Integration of Cache and Dummies

Location-Based Services (LBS) have recently gained much attention from the research community due to the openness of wireless networks and the daily development of mobile devices.However, using LBS is not risk free.Location privacy protection is a major issue that concerns users.Since users utilize their real location to get the benefits of the LBS, this gives an attacker the chance to track their real location and collect sensitive and personal information about the user.If the attacker is the LBS server itself, privacy issues may reach dangerous levels because all information related to the user's activities are stored and accessible on the LBS server.In this paper, we propose a novel location privacy protection method called the Safe Cycle-Based Approach (SCBA).Specifically, the SCBA ensures location privacy by generating strong dummy locations that are far away from each other and belong to different sub-areas at the same time.This ensures robustness against advanced inference attacks such as location homogeneity attacks and semantic location attacks.To achieve location privacy protection, as well as high performance, we integrate the SCBA approach with a cache.The key performance enhancement is storing the responses of historical queries to answer future ones using a bloom filter-based search technique.Compared to well-known approaches, namely the ReDS, RaDS, and HMC approaches, experimental results showed that the proposed SCBA approach produces better outputs in terms of privacy protection level, robustness against inference attacks, communication cost, cache hit ratio, and response time.
Guest Editors’ Introduction: Special Issue on Big Data Systems on Emerging Architectures

The papers in this special section focus on Big Data systems and emerging architectures. Big data has become a buzz word in recent years. Among various big-data challenges, high performance is a must, not an option. We are facing the challenges at all levels ranging from sophisticated algorithms and procedures to mine the gold from massive data to high-performance computing (HPC) techniques and systems to get the value of the data in time. Big data systems have been a fruitful research area, and many systems have been designed and developed for different kinds of big data including relational data, graphs, and data in other forms. Along the journey, open-source systems have been a major driving force in wide adoption of big data systems, for example, Apache Hadoop, Spark, Storm and Flink. The success of those systems has lowered the bar of handling big data, but even led to more prosperous big data applications and ecosystem.
Matching Corresponding Regions of Interest on Cranio-Caudal and Medio-Lateral Oblique View Mammograms

Automatically matching corresponding regions of interest (ROIs) on two-view images is valuable in breast cancer diagnosis, benefiting of saving time and cutting the workload. We propose a method for matching the corresponding ROIs by integrating the geometric model and image similarity searching. The geometric model is implemented by restoring a free breast in the 3D space from two-view preprocessed breast contours. Then, the possible position of the ROI center on cranio-caudal (CC)/medio-lateral oblique (MLO) view image is represented by three feature points in the 3D space. As the view changes, these points can be mapped onto the MLO/CC view image. A matching strip is created later according to the confidence interval, within which the specific position of the ROI can be located by image similarity searching. The experiments were conducted on 273 pairs of mammograms with 400 calcifications and 284 pairs with 300 masses to verify the accuracy of the geometric model and similarity searching. The mean absolute error between the curves and the ROI centers was 3.36 ± 2.90 mm. For 95% detection sensitivity, the confidence interval was ±8.77 mm. For calcifications, the mean distance between the centers of the matched ROIs and the reference was 3.92 ± 4.61 mm. About 93.46% cases had overlap greater than 50%, and 92.46% cases had overlap greater than 75%. For masses, the mean distance was 6.15 ± 7.08 mm. About 88.46% cases had overlap greater than 50%, and 85.58% cases had overlap greater than 75%.