Reviewerly/exHarmony huggingface dataset:
Indirect associations in learning semantic and syntactic lexical relationships

Computational models of distributional semantics (a.k.a. word embeddings) represent a word's meaning in terms of its relationships with all other words. We examine what grammatical information is encoded in distributional models and investigate the role of indirect associations. Distributional models are sensitive to associations between words at one degree of separation, such as 'tiger' and 'stripes', or two degrees of separation, such as 'soar' and 'fly'. By recursively adding higher levels of representations to a computational, holographic model of semantic memory, we construct a distributional model sensitive to associations between words at arbitrary degrees of separation. We find that word associations at four degrees of separation increase the similarity assigned by the model to English words that share part-of-speech or syntactic type. Word associations at four degrees of separation also improve the ability of the model to construct grammatical English sentences. Our model proposes that human memory uses indirect associations to learn part-of-speech and that the basic associative mechanisms of memory and learning support knowledge of both semantics and grammatical structure.
A Comparison of Classification Methods to Classify the Breast Lesions from Ultrasound Images using Texture Feature Extraction

From past few decades there is huge death rates due to breast cancer.Detection of breast cancer at first stage itself is very important.For detection and screening Mammography technique is usd in hospitals.But it was not comfortable for many young women because it involves radiation during testing.The advantage of Ultrasound over mammography is its non-invasive procedure, no radiation like mammography and it is available with less cost.However, the excellence of ultrasound image is corrupted by a speckle noise.In this paper we are developing an algorithm which will reduce the speckle noise.We also proposed some Feature Extraction and classification methods for tumor detection from ultrasound breast images.
Two equivalent multi-sensor Kalman filters with variable delays and intermittent measurements

Kalman filtering of measurement data from multiple sensors with time-varying delays and missing measurements is considered in this work. Two existing approaches to Kalman filtering with delays are extended by removing some assumptions in order to have equivalent filtering methods and making comparisons between them. The computational loads of the two methods are compared in terms of the average number of floating point operations required by each method for different system dimensionalities and delay upper bounds. The results show that the superiority of the methods over each other depends on the comparison conditions.
Combination Of Scrum Methodology And IBM Design Thinking For Dashboard And Report System Development

Choosing correct methodology can bring many positive impacts for each team and user that involved.One of the most common methodology used now is Scrum.The Scrum methodology is known for developing more dynamic, adaptive and flexible systems.This methodology can be combined with the IBM Design Thinking framework in order to bring more understanding of user needs and offering more system value for users.The purpose of this research is to find out how combination of Scrum methodology and IBM Design Thinking can provide a better value for user in a system development.In order to combine these two methods, this research using common Scrum Methodologies and IBM Design Thinking from IBM.This research will combine Scrum and IBM Design Thinking and its deliverables to provide the best value for users.This case study shows that the combination of Scrum and IBM Design Thinking helped the development team in understanding user needs so that results are more effective and accepted by users.As both Scrum and IBM Design Thinking are sharing user-centric values, this study found that Scrum and IBM Design Thinking both complimenting each other in order to produce and provide the best value for users.
Modern Art History As a Human Science in a Situation of Cultural Turn

Intensive development of knowledge in the 20th century, including the emergence of new sciences and humanities, constantly creates a problematic situation in the sphere of art, shifting arts designation to what in the philosophy of science is known as normal science. This is associated with the idea of art as a science that has reached a stage of maturity and consistency and, therefore, complies with its norms. The concept of art as normal science is characterized by a certain degree of conservatism, as it presupposes arts selfprotection against deviations from the established methodology.&#x0D; However, sometimes the artistic processes of modernity require different approaches. In addition, the emergence of new humanities shifts the already established methodology of art. This happened in the first decades of the 20th century, in the era of a linguistic turn in the humanities, indicating the invasion of natural sciences in the humanities; and this is happening today, at the turn of the 21st century, in a situation of a cultural turn, the emergence and intensive development of the science of culture. The current turn requiresa deeper understanding of the structure and components of art history, i.e., its sub-disciplines: art history, art theory and art criticism.&#x0D; The essay argues that in the situation of cultural turn the theory of art can carry out functions which the other two sub-disciplines cannot. It propounds that art theory is able to make a decisive contribution to the elucidation of two problems: the relationship between art and cultural studies and the problem of historical time, which is important both for contemporary art and for art history.
Sarcasm Detection using Naïve Bayes SVM Hybrid

Sarcasm detection plays a vital role in Sentiment analysis and sentiment classification as the occurrence of sarcasm in an input text may drive Sentiment Analysis job in different (Wrong) classification. Our research work aims in sarcasm detection using basic ML approaches like Naïve Bayes and SVM. Understanding the importance of each model and its merits and combining them accordingly. This work majorly aims at building a hybrid model which leads to better accuracy which will help readers for better decision making.
Perancangan dan Pembuatan Website Puskesmas Kaliwates Jember sebagai Media Informasi Pelayanan Kesehatan dan Promosi Kesehatan

Kaliwates Jember Health Center is one of the health centers that does not have a website as a medium of information and promotion to the public, so that the public lacks information related to the health center. The purpose of this research was to design and to create a website of Kaliwates Jember Health Center. Researchers used qualitative research and used the waterfall model system design method. The stages in this method included Requirement Analysis and Definition,System and Software Design, Implementation and testing, Integration and system testing and Operation and maintenance. In the process of designing this system the researchers used a Flowchart system, Contex Diagram, Data Flow Diagram, Entity Relationship Diagram and in implementing programs they used notepad ++ and xampp. The strengths of the website that have been made are the doctor's questioning service for patients to be able to communicate with doctors in the Kaliwates Puskesmas without having to come to the puskesmas, patients can register online for treatment, there are statistical data about the number of patient visits through the website.It is expected that the development of existing websites such as distinguishing questions asked by doctors coming from new patients and old patients and hopefully, the future researchers will get more complete data related to puskesmas.
Insectomorphic cargo-carrying robot on a raft

The algorithm of the hexapod robot motion control is described.The aim of the motion is to ship the robot on a raft together with a cargo to the other shore of a body of water in the simple case when the robot imparts to the raft an initial push from the shore.The motion consists of transporting the cargo from the shore to the raft, moving the cargo across the moving raft, and carrying the cargo from the raft to the other shore.The algorithm was worked out using computer simulation within the complete dynamical model of motion taking into account the nonstationary action of water on the raft.Computer simulation was performed using the Universal Mechanism software package.Numerical results prove the validity of the algorithm if enough data about the motion for the purpose of control is available.
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic

The inverse method is a saturation-based theorem-proving technique; it relies on a forward proof-search strategy and can be applied to cut-free calculi enjoying the subformula property. Here, we apply this method to derive the unprovability of a goal formula G in Intuitionistic Propositional Logic. To this aim we design a forward calculus FRJ ( G ) for Intuitionistic unprovability, which is appropriate for constructively ascertaining the unprovability of a formula G by providing a concise countermodel for it; in particular, we prove that the generated countermodels have minimal height. Moreover, we clarify the role of the saturated database obtained as result of a failed proof-search in FRJ ( G ) by showing how to extract from such a database a derivation witnessing the Intuitionistic validity of the goal.
Controlled tracking in urban terrain: Closing the loop

Abstract We investigate the challenging problem of integrating detection, signal processing, target tracking, and adaptive waveform scheduling with lookahead in urban terrain. We propose a closed‐loop active sensing system to address this problem by exploiting three distinct levels of diversity: (1) spatial diversity through the use of coordinated multistatic radars; (2) waveform diversity by adaptively scheduling the transmitted waveform; and (3) motion model diversity by using a bank of parallel filters matched to different motion models. Specifically, at every radar scan, the waveform that yields the minimum trace of the one‐step‐ahead error covariance matrix is transmitted; the received signal goes through a matched‐filter, and curve fitting is used to extract range and range‐rate measurements that feed the LMIPDA‐VSIMM algorithm for data association and filtering. Monte Carlo simulations demonstrate the effectiveness of the proposed system in an urban scenario contaminated by dense and uneven clutter, strong multipath, and limited line‐of‐sight.
Constraint-Handling Techniques for Particle Swarm Optimization Algorithms

Population-based methods can cope with a variety of different problems, including problems of remarkably higher complexity than those traditional methods can handle. The main procedure consists of successively updating a population of candidate solutions, performing a parallel exploration instead of traditional sequential exploration. While the origins of the PSO method are linked to bird flock simulations, it is a stochastic optimization method in the sense that it relies on random coefficients to introduce creativity, and a bottom-up artificial intelligence-based approach in the sense that its intelligent behaviour emerges in a higher level than the individuals' rather than deterministically programmed. As opposed to EAs, the PSO involves no operator design and few coefficients to be tuned. Since this paper does not intend to study such tuning, general-purpose settings are taken from previous studies. The PSO algorithm requires the incorporation of some technique to handle constraints. A popular one is the penalization method, which turns the original constrained problem into unconstrained by penalizing infeasible solutions. Other techniques can be specifically designed for PSO. Since these strategies present advantages and disadvantages when compared to one another, there is no obvious best constraint-handling technique (CHT) for all problems. The aim here is to develop and compare different CHTs suitable for PSOs, which are incorporated to an algorithm with general-purpose settings. The comparisons are performed keeping the remaining features of the algorithm the same, while comparisons to other authors' results are offered as a frame of reference for the optimizer as a whole. Thus, the penalization, preserving feasibility and bisection methods are discussed, implemented, and tested on two suites of benchmark problems. Three neighbourhood sizes are also considered in the experiments.
IMPLEMENTASI KOMPETENSI INTI SATU DAN DUA KURIKULUM 2013 DALAM PEMBELAJARAN BAHASA INDONESIA SISWA KELAS VIII SMPN 1 KECAMATAN PONDOK KELAPA KABUPATEN BENGKULU TENGAH TAHUN PELAJARAN 2016/2017

The purpose of this study is to describe the implementation of the core competencies one and two Curriculum 2013 in learning Indonesian students class VIII SMPN 1 Kecamatan Pondok Kelapa Central Bengkulu District Lessons 2016/2017. The method used in this research is descriptive qualitative method. The subject of this research is one Indonesian teacher who teaches in class VIII SMPN 1 Kecamatan Pondok Kelapa, Central Bengkulu Regency. Technique of collecting data using observation and interview. Data analysis techniques used are Miles and Huberman which includes data collection, data reduction, data presentation, and data verification. Test the validity of the data using credibility test conducted by triangulation. The results showed that the teacher has implemented the core competence of one / spiritual attitude through the activity of saying and responding greetings, praying together, performing the prayers at school and keeping the environment around the school. While the two core competencies / social attitudes are integrated through group learning activities, not cheating or plagiarism, speaking honestly, working on and collecting tasks on time, obeying school rules, performing individual duties well, daring to perform in class, be responsible and accept The risks of action, respect for the elderly, not forcing opinions, helping each other to achieve mutual success, taking an active role, asking, answering, not despairing, daring to accept others politely and politely fellow.
Retraction of Effects of The Application of Information Technology to Art Education Therapy on University Students’ Self-Concept and Peer Relationship

Original Article: EURASIA J. Math., Sci Tech. Ed (2018), 14(7), 3035–3042. https://doi.org/10.29333/ejmste/90630 This document states that the Article is retracted by request from the corresponding author. All authors agree to the retraction of the Article.
Self-dual cyclic codes over <i>M<sub>2</sub>(\mathbb{Z}<sub>4</sub>)</i>

In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to $\mathbb{Z}_4[w]+U\mathbb{Z}_4[w]$, where $w$ is a root of the irreducible polynomial $x^2+x+1 \in \mathbb{Z}_2[x]$ and $U\equiv$ ${11}\choose{11}$. We first discuss the structure of the ring $M_2(\mathbb{Z}_4)$ and then focus on algebraic structure of cyclic codes and self-dual cyclic codes over $M_2(\mathbb{Z}_4)$. We obtain the generators of the cyclic codes and their dual codes. Few examples are given at the end of the paper.
A metalanguage for guarded iteration

Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying framework for various examples from program semantics, process algebra, and beyond. In the present paper, we propose a generic metalanguage for guarded iteration based on combining this notion with the fine-grain call-by-value paradigm, which we intend as a unifying programming language for guarded and unguarded iteration in the presence of computational effects. We give a generic (categorical) semantics of this language over a suitable class of strong monads supporting guarded iteration, and show it to be in touch with the standard operational behaviour of iteration by giving a concrete big-step operational semantics for a certain specific instance of the metalanguage and establishing soundness and (computational) adequacy for this case.
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1.4977^n and at most like 1.5012^n.
Convolutional neural networks analysed via inverse problem theory and sparse representations

Inverse problems in imaging such as denoising, deblurring, superresolution (SR) have been addressed for many decades. In recent years, convolutional neural networks (CNNs) have been widely used for many inverse problem areas. Although their indisputable success, CNNs are not mathematically validated as to how and what they learn. In this paper, we prove that during training, CNN elements solve for inverse problems which are optimum solutions stored as CNN neuron filters. We discuss the necessity of mutual coherence between CNN layer elements in order for a network to converge to the optimum solution. We prove that required mutual coherence can be provided by the usage of residual learning and skip connections. We have set rules over training sets and depth of networks for better convergence, i.e. performance.
A Toolchain to Produce Verified OCaml Libraries

This paper presents a methodology to get correct-by-construction OCaml programs using the Why3 tool. First, a formal behavioral specification is given in the form of an OCaml module signature extended with type invariants and function contracts, in the spirit of JML. Second, an implementation is written in the programming language of Why3 and then verified with respect to the specification. Finally, an OCaml program is obtained by an automated translation. Our methodology is illustrated with the proof of a union-find library. Several other proofs of data structures and algorithms are included in the companion artifact to this paper.
Generation of a stochastic binary field that fits a given heterogeneity power spectrum

Incomplete binary mixing of two components can form a heterogeneous assemblage in space. The heterogeneity power spectrum of the assemblage can be frequently obtained in observation. However, it is unknown if one can find a stochastic binary field to generate the observed spectrum. We propose a novel and powerful constructive procedure for this purpose. The procedure allows us not only to test whether certain binary mixing is feasible but also to tightly constrain the properties of the mixing components and the modal proportion. The method should find wide applications in many branches of geosciences.
A similarity network for web services operations substitution

Studying the similarity between Web services operations is a key solution to many problems, especially those related to the substitution, such as during a call failure or a malfunction, a list of similar operations is returned to the customer. He chooses an operation based on non-functional criteria. Generally, the similarity between Web services operations depends on the similarity between their inputs and their outputs parameters. In this work, we propose a new technique to study the functional similarity between web services operations. We will also, form a network such as the nodes represent the operations of the web services. A link joins two similar operations according to some relationships defined between them. The constituted network responds to the substitution best and much easier than existing works.
EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS

Abstract This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.
Advancing software engineering education: New practices and perspectives

Coupling is a fundamental property of software systems which is strongly connected with the quality of software design and has high impact on program understanding. The coupling between software components influences software maintenance and evolution as well. In order to ease the maintenance and evolution processes it is essential to estimate the impact of changes made in the software system, coupling indicating such a possible impact. This paper introduces a new aggregated coupling measurement which captures both the structural and the conceptual characteristics of coupling between the software components. The proposed measure combines the textual information contained in the source code with the structural relationships between software components. We conduct several experiments which underline that the proposed aggregated coupling measure reveals new characteristics of coupling and is also effective for change impact analysis.
Quantum Walks on Hypergraphs

In this work we introduce the concept of a quantum walk on a hypergraph. We show that the staggered quantum walk model is a special case of a quantum walk on a hypergraph.
GRICE’S COOPERATIVE PRINCIPLE VIOLATION IN THE SECOND PRESIDENTIAL DEBATE BETWEEN HILLARY CLINTON AND DONALD TRUMP

The aims of this research were to investigate kinds of maxims violated by the speakers and to investigate possible purposes of violations applied by the speakers. This research was conducted as qualitative descriptive study. The corpus of this research was Second Presidential transcript debate. The transcript was put into a checklist table and analyzed by Grice’s theory of Cooperative Principle. The results of this study showed that both Hillary Clinton and Donald Trump violated all maxims, with 75 violations by Hillary Clinton and 174 violations by Donald Trump. The most violated maxim by both speakers was maxim of quantity and the less violated maxim was maxim of manner. Moreover, the result showed the least possible purposes of violation by the speakers was to build positive political image towards hearer
Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M

Round5 is a Public Key Encryption and Key Encapsulation Mechanism (KEM) based on General Learning with Rounding (GLWR), a lattice problem. We argue that the ring variant of GLWR is better suited for embedded targets than the more common RLWE (Ring Learning With Errors) due to significantly shorter keys and messages. Round5 incorporates GLWR with error correction, building on design features from NIST Post-Quantum Standardization candidates Round2 and Hila5. The proposal avoids Number Theoretic Transforms (NTT), allowing more flexibility in parameter selection and making it simpler to implement. We discuss implementation techniques of Round5 ring variants and compare them to other NIST PQC candidates on lightweight Cortex M4 platform. We show that the current development version of Round5 offers not only the shortest key and ciphertext sizes among Lattice-based candidates, but also has leading performance and implementation size characteristics.