Reviewerly/exHarmony huggingface dataset:
Generative Guiding Block: Synthesizing Realistic Looking Variants Capable of Even Large Change Demands

Realistic image synthesis is to generate an image that is perceptually indistinguishable from an actual image. Generating realistic looking images with large variations (e.g., large spatial deformations and large pose change), however, is very challenging. Handing large variations as well as preserving appearance needs to be taken into account in the realistic looking image generation. In this paper, we propose a novel realistic looking image synthesis method, especially in large change demands. To do that, we devise generative guiding blocks. The proposed generative guiding block includes realistic appearance preserving discriminator and naturalistic variation transforming discriminator. By taking the proposed generative guiding blocks into generative model, the latent features at the layer of generative model are enhanced to synthesize both realistic looking- and target variation- image. With qualitative and quantitative evaluation in experiments, we demonstrated the effectiveness of the proposed generative guiding blocks, compared to the state-of-the-arts.
Query Acceleration of Graph Databases by ID Caching Technology

In this paper, we approach the design of ID caching technology (IDCT) for graph databases, with the purpose of accelerating the queries on graph database data and avoiding redundant graph database query operations which will consume great computer resources. Traditional graph database caching technology (GDCT) needs a large memory to store data and has the problems of serious data consistency and low cache utilization. To address these issues, in the paper we propose a new technology which focuses on ID allocation mechanism and high-speed queries of ID on graph databases. Specifically, ID of the query result is cached in memory and data consistency is achieved through the real-time synchronization and cache memory adaptation. In addition, we set up complex queries and simple queries to satisfy all query requirements and design a mechanism of cache replacement based on query action time, query times, and memory capacity, thus improving the performance furthermore. Extensive experiments show the superiority of our techniques compared with the traditional query approach of graph databases.
FEATURES OF CONSTRUCTION OF MUSICAL-AESTHETIC SPACE AS A COMPONENT OF THE CULTURAL - EDUCATIONAL SPACE OF A COMPREHENSIVE SCHOOL

There were analyzed the scientific ways for organization of the culture-educational space of a comprehensive school. The cultural-educational space model is presented as an integrity of spatial-semantic, meaningfully-methodic and communicative-organizational components. The basic directions of designing of development and structural components were identified. The attention was made on the specifics of pedagogical tasks, educationally-developing, extracurricular, leisure-developing environments. The features of the musical-aesthetic space as the components of the cultural-educational space of a comprehensive school where examined. It has structural elements such as: child individuality as the subject of education, different forms of activity; common principles of organization; new musical-educational technologies. New ways of musical-aesthetic space organization of general school were suggested. There were analyzed such principles of that space development as: sequence, systematic, purposefulness, pupil’s free choice of activity, optimal connection of different forms of teaching (frontal, group and individual), the positive emotional background formation. Educational functions of the musical-aesthetic space of general school were characterized. These are the spiritual and creative child individuality potential; compensation of its deficiency in child’s other life domains; upbringing of the aesthetic attitude toward music; positive emotional educational background creation. It was suggested, that professional training of future music teachers has to anticipate acquiring skills to master that space as well as purposeful using of its sources in the process of musical-aesthetic pupils upbringing realization.
Simuleringar av elliptiska kurvor för elliptisk kryptografi

This thesis describes the theory behind elliptic-curve Diffie-Hellman key exchanges. All the way from the definition of a group until how the operator over an elliptic curve forms an abelian group. ...
ROTOR: A Tool for Renaming Values in OCaml's Module System

The functional programming paradigm presents its own unique challenges to refactoring. For the OCaml language in particular, the expressiveness of its module system makes this a highly non-trivial task and there is currently no automated support for large-scale refactoring in the OCaml language. We present ROTOR, a tool for automatically renaming top-level value definitions in OCaml's module system. To compute the effect of renaming, ROTOR relies on a novel concept which we call a value extension. This is a collection of related declarations in a program that must all be renamed at once. In practice, this leads to a notion of dependency: renaming a function 'foo' in module A (mutually) depends on renaming function 'foo' in module B etc. We describe important aspects of ROTOR's design, implementation, and evaluation on two large codebases: Jane Street's core library and its dependencies, and the OCaml compiler itself. In these real-world settings we find that some cases involve a surprisingly complex network of dependencies, and that the use of the PPX preprocessor system presents significant challenges.
The Merits of Compositional Abstraction: A Case Study in Propositional Logic

We revisit a well-established and old topic in computational logic: algorithms – such as the one by Quine-McCluskey – that convert a formula of propositional logic into a semantically equivalent disjunctive normal form whose clauses are all prime implicants of that formula. This exercise in education is meant to honor Bernhard Steffen, who made important contributions in formal verification and its use of compositional abstraction, and who is a role model in transferring research insights into teaching addressed at students with varying skill levels. The algorithm we propose here is indeed compositional and can teach students about the value of compositional abstractions – making use of simple lattice-theoretic and semantic concepts.
Multiagent Model of People Evacuation from Premises while Emergency

The multi-agent model of emergency evacuation process in case of limited space conditions is offered. A distinctive feature of the proposed model is the systematic consideration of physical interactions between agents and their reasonable behavior in conditions of evacuation from premises of a complex configuration. The model allows to investigate the state and behavior of people in emergency and determine the time of their evacuation. The proposed model can be used as a basis for determining ways and developing plans for evacuation from premises in emergency situations.
Detection of Difficult for Understanding Medical Words using Deep Learning

In the medical domain, non-specialized users often require a better understandingof medical information provided by doctors. In this work, we address this need.We introduce novel embeddings received from RNN - FrnnMUTE (French RNNMedical Understandability Text Embeddings) - and show how they help to improveidentification of readability and understandability of medical words when appliedas features in the classification task, reaching at maximum 87.0 F1 score. We alsofound out that adding pre-trained FastText word embeddings to the feature set substantiallyimproves the performance of the classification model. For generalizabilitystudy of different models, we introduce a methodology comprising three crossvalidationscenarios which allow testing classifiers in real-world conditions: whenunderstanding of medical words by new users is unknown or when no informationabout understandability of new words is provided for the model.
Video Action Classification Using PredNet

In this paper, we evaluate the PredNet \cite{lotter16} on the Something-something action data set \cite{farzaneh18} and implement the PredNet+, which we train in a multi-task fashion to output both classification labels and predictions. Our idea is to condition video prediction and action classification on each other. We discuss a series of observations about the PredNet and conclude that it does not completely follow the principles of the predictive coding framework.
An Approach to Extracting Distributed Data From the Integrated Environment of Web Technologies Based on Set Theory

The composition and extraction of the information distributed by the different web technologies allow adesign of a multifunction imported data environment. However, the problems of integration andcommunication between the heterogeneous data web always (lodges) on distributed servers.In fact, Web technologies have been proposed to meet certain needs related to heterogeneous anddistributed information systems for communicating and exchanging computerized data on the Web. Furthermore, web generations go through client-server communication (from a static, dynamic and semantic webhuman client) to server-server communication.For this purpose, Web services are technology application integration by excellence across the Internet.They operate independently of the heterogeneities of the system components on which they are based andare weakly coupled software components interacting with each other.This paper aims to achieve a management approach to extracting and modeling distributed informationbased on set theory and calculate the execution time of a query to this distributed data.
I made some tutorials on getting started ...

I made some tutorials on getting started with a wordpress.com site but it is often much easier using WordPress.org. Even more reliable is using @microdotblog
Developing a Platform for Traffic Data Analysis

Scenwise is a business working on innovative and sophisticated solutions in the domain of traffic management. Leveraging data science and IT systems, Scenwise delivers products to institutions to facilitate efficient traffic management. In order to manage the highly complex network of infrastructure on the road network, traffic managers need to use and analyze data that is collected all across the network in order to support decision makers in management of this network. However, there is often a mismatch in expertise between traffic management experts and decision makers. Traffic management experts use highly technical visualization techniques that require significant background knowledge in the traffic management domain. In addition, the visualization techniques are spread out over a multitude of systems that do not work together. In order to bridge the knowledge gap, a product needs to be created that allows experts to extract and visualize relevant data using their traffic domain knowledge while providing intuitive and clear visualizations which are clear to both experts and non-experts. The ultimate goal of this product would be to facilitate efficient traffic management in order to improve the lives of commuters by contributing to a better organized infrastructure. Our project group has designed and implemented a product for Scenwise that offers this solution. A web-based application has been created that retrieves and stores traffic data. The product is able to traverse the road network and provide helpful insights into the traffic network’s state at either the present moment, or moments in history. The application is able to provide dynamic traffic contour plots, draw fundamental diagrams, show live traffic intensity over the entire Dutch road network and provide information related to traffic events like accidents and matrix sign states. The product is able to do all of this while providing a seamless and intuitive user interface. The system has been designed and implemented over a span of ten weeks by a group of five students. A SCRUM methodology was adopted and through careful discussion with the client and a continuous feedback loop a product was delivered that fits both the clients needs and the wider product vision that has been defined.
EDUCATIONAL CHALLENGES AS ACTIVITY MOTIVATORS

The article describes modern motivational schemes aimed at the initiation, formation and development of learning and cognitive motivation of students. The schemes were developed using elements of gamification based on mobile technologies, which made it possible to increase the overall involvement of students in the search for solutions to the problems posed. The didactic potential of the games-сhallenges is considered. The structure of the challenge "Explanation", and stages of a QR-quest are presented. The model is concretized by educational products and student feedback, successfully tested.
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.

Consider a PPT two-party protocol $\pi=(A,B)$ in which the parties get no private inputs and obtain outputs $O^A,O^B\in \{0,1\}$, and let $V^A$ and $V^B$ denote the parties' individual views. Protocol $\pi$ has $\alpha$-agreement if $Pr[O^A=O^B]=1/2+\alpha$. The leakage of $\pi$ is the amount of information a party obtains about the event $\{O^A=O^B\}$; that is, the leakage $\epsilon$ is the maximum, over $P\in\{A,B\}$, of the distance between $V^P|OA=OB$ and $V^P|OA\neq OB$. Typically, this distance is measured in statistical distance, or, in the computational setting, in computational indistinguishability. For this choice, Wullschleger [TCC 09] showed that if $\alpha>>\epsilon$ then the protocol can be transformed into an OT protocol. We consider measuring the protocol leakage by the log-ratio distance (which was popularized by its use in the differential privacy framework). The log-ratio distance between X,Y over domain \Omega is the minimal $\epsilon>0$ for which, for every $v\in\Omega$, $log(Pr[X=v]/Pr[Y=v])\in [-\epsilon,\epsilon]$. In the computational setting, we use computational indistinguishability from having log-ratio distance $\epsilon$. We show that a protocol with (noticeable) accuracy $\alpha\in\Omega(\epsilon^2)$ can be transformed into an OT protocol (note that this allows $\epsilon>>\alpha$). We complete the picture, in this respect, showing that a protocol with $\alpha\in o(\epsilon^2)$ does not necessarily imply OT. Our results hold for both the information theoretic and the computational settings, and can be viewed as a fine grained approach to weak OT amplification. We then use the above result to fully characterize the complexity of differentially private two-party computation for the XOR function, answering the open question put by Goyal, Khurana, Mironov, Pandey, and Sahai [ICALP 16] and Haitner, Nissim, Omri, Shaltiel, and Silbak [FOCS 18].
Multi-scale GANs for Memory-efficient Generation of High Resolution Medical Images

Currently generative adversarial networks (GANs) are rarely applied to medical images of large sizes, especially 3D volumes, due to their large computational demand. We propose a novel multi-scale patch-based GAN approach to generate large high resolution 2D and 3D images. Our key idea is to first learn a low-resolution version of the image and then generate patches of successively growing resolutions conditioned on previous scales. In a domain translation use-case scenario, 3D thorax CTs of size 512x512x512 and thorax X-rays of size 2048x2048 are generated and we show that, due to the constant GPU memory demand of our method, arbitrarily large images of high resolution can be generated. Moreover, compared to common patch-based approaches, our multi-resolution scheme enables better image quality and prevents patch artifacts.
An Econometric View of Algorithmic Subsampling

Datasets that are terabytes in size are increasingly common, but computer bottlenecks often frustrate a complete analysis of the data. While more data are better than less, diminishing returns suggest that we may not need terabytes of data to estimate a parameter or test a hypothesis. But which rows of data should we analyze, and might an arbitrary subset of rows preserve the features of the original data? This paper reviews a line of work that is grounded in theoretical computer science and numerical linear algebra, and which finds that an algorithmically desirable {\em sketch} of the data must have a {\em subspace embedding} property. Building on this work, we study how prediction and inference is affected by data sketching within a linear regression setup. The sketching error is small compared to the sample size effect which is within the control of the researcher. As a sketch size that is algorithmically optimal may not be suitable for prediction and inference, we use statistical arguments to provide `inference conscious' guides to the sketch size. When appropriately implemented, an estimator that pools over different sketches can be nearly as efficient as the infeasible one using the full sample.
INNOVATION AND DEVELOPMENT OF INFORMATION COMMUNICATION TECHNOLOGY (ICT) IN LIBRARIES: A NEW DIMENSION IN LIBRARIANSHIP.

15May 2019 INNOVATION AND DEVELOPMENT OF INFORMATION COMMUNICATION TECHNOLOGY (ICT) IN LIBRARIES: A NEW DIMENSION IN LIBRARIANSHIP. Naveed-e Sehar and Mahnoor Khan. Asstt. Professor,Department of Library and Information Science, University of Karachi. Asstt. Librarian, IBA Karachi.
Mean field models for large data-clustering problems

We consider mean-field models for data--clustering problems starting from a generalization of the bounded confidence model for opinion dynamics. The microscopic model includes information on the position as well as on additional features of the particles in order to develop specific clustering effects. The corresponding mean--field limit is derived and properties of the model are investigated analytically. In particular, the mean--field formulation allows the use of a random subsets algorithm for efficient computations of the clusters. Applications to shape detection and image segmentation on standard test images are presented and discussed.
My Gadget Just Cares For Me - How NINA Can Prove Security Against Combined Attacks.

Differential Power Analysis and Differential Fault Analysis threaten the security of even the most trustworthy cryptographic primitives. It is important we protect their implementation such that no sensitive information is leaked using side channels and it withstands injected faults or combined physical attacks.
Quantifying Information Exposure in Internet Routing

Data sent over the Internet can be monitored and manipulated by intermediate entities in the data path from the source to the destination. For unencrypted communications (and some encrypted communications with known weaknesses), eavesdropping and man-in-the-middle attacks are possible. For encrypted communication, the identification of the communicating endpoints is still revealed. In addition, encrypted communications may be stored until such time as newly discovered weaknesses in the encryption algorithm or advances in computer hardware render them readable by attackers. In this work, we use public data to evaluate both advertised and observed routes through the Internet and measure the extent to which communications between pairs of countries are exposed to other countries. We use both physical router geolocation as well as the country of registration of the companies owning each router. We find a high level of information exposure; even physically adjacent countries use routes that involve many other countries. We also found that countries that are well `connected' tend to be more exposed. Our analysis indicates that there exists a tradeoff between robustness and information exposure in the current Internet.
How to Correct Errors in Multi-Server PIR.

Suppose that there exist a user and \(\ell \) servers \(S_1,\ldots ,S_{\ell }\). Each server \(S_j\) holds a copy of a database \(\mathbf {x}=(x_1, \ldots , x_n) \in \{0,1\}^n\), and the user holds a secret index \(i_0 \in \{1, \ldots , n\}\). A b error correcting \(\ell \) server PIR (Private Information Retrieval) scheme allows a user to retrieve \(x_{i_0}\) correctly even if and b or less servers return false answers while each server learns no information on \(i_0\) in the information theoretic sense. Although there exists such a scheme with the total communication cost \( O(n^{1/(2k-1)} \times k\ell \log {\ell } ) \) where \(k=\ell -2b\), the decoding algorithm is very inefficient.
한국어 학습자와 교사의 적극적·소극적 공손 전략 실현 양상 연구 학문 목적 2·3·4급 학습자의 수업을 중심으로

Aiming to examine the realization of positive and negative politeness strategies, this thesis has surveyed the transcripts of the speeches of teachers and learners in the Korean language classes. The positive and negative politeness strategies are based on the face and politeness theories. Face may be defined as ‘one’s public image asserted about oneself’. Face as such can be divided into positive and negative face. Positive face refers to the speaker’s desire to see his or her wishes respected by the interlocutors, and negative face refers to an individual’s right to behave freely lest the speaker’s wishes not be deterred by others and the desire not to be coerced by others. The theory developed into the strategy to avoid face-threatening acts by Brown and Levinson (1987). This study, which focuses on the positive and negative politeness strategies, has examined how they show in the Korean language classes through the transcripts of the speeches of teachers and learners. The analysis of the Korean language classes showed that the positive politeness strategy registered a higher level of frequency than the negative politeness strategy. This showed that the three classes involved less face-threatening acts between the learners and the teachers. The study is significant, in that the how the positive and negative politeness strategies were realized enables it to guess at the class atmosphere and the relationship between the learner and the teacher, depending on which strategies were used more frequently. It is because a positive classroom atmosphere in which participants trust one another will use mainly the positive politeness strategies, whereas a tense classroom atmosphere in which participants cannot cooperate will use the greatly face-threatening negative politeness strategies. The analysis will enable the teacher to examine the aspects of the strategies which the teacher frequently uses and find help in improving the class later. However, this study has limitations, in that it failed to distinguish the teachers’ speeches from the learners’ and closely examine the differences according to levels. As the positive and negative politeness strategies have not been researched through the speeches in the Korean classes, a lot of research topics remain to be carried out, including how the frequently used strategies vary with the levels of the learners, how female and male teachers differ, and what differences the learners’ nationality and sex make in how the strategies are realized. Looking ahead, these studies need to continue.