Reviewerly/exHarmony huggingface dataset:
Towards a Credibility Analysis Model for Online Reviews

In digital transformations era, user-generated reviews have become important sources of information, and they play a significant role in users’ decision-making process. However, the overwhelming number of online reviews with unknown reviewers has made it difficult for users to find credible information. This paper conceptualizes a credibility analysis model for online reviews by synthesizing the related literature and using the Heuristic-Systematic Model (HSM). The credibility analysis model demonstrates factors affecting online reviews credibility (e.g., argument strength, review objectivity, review sidedness, internal consistency, reviewer credibility, external consistency, information rating, and structural factors). Moreover, the proposed model examines the moderating role of product/service types on the relationships between reviews credibility and its antecedents. To refine the model and our hypotheses, we plan to interview users of online reviews. Then, the hypotheses and model will be tested through a quantitative approach.
An Optimal Deployment Strategy for Radars and Infrared Sensors in Target Tracking

In target tracking, it is difficult to ensure that a target can be detected by both radars and infrared sensors simultaneously. In this paper, the dimensional-reduced particle swarm optimization (DRPSO) algorithm is proposed to find the optimal deployment for radars and infrared sensors when tracking multiple targets in a 3D area. Since DRPSO prevents premature convergence during optimization, an optimal deployment with higher tracking ability is obtained within fewer iterations compared with classical PSO.
MEMBANGUN WEBSITE PROFILE KELURAHAN MELAYU TENGGARONG

The research to build Website Profile of Tenggarong Kelurahan is a study to facilitate the public to obtain complete and up-to-date information because the information is felt to be very important in decision making and in achieving goals. In addition to obtaining complete and up-to-date information, the website can also send and publish information to the wider community online. The system development method used in this research is the System Development Life Cycle (SDLC) method, or better known as the system development life cycle in system engineering and software engineering, is the process of making and changing systems and the models and methodologies used to develop these systems. The long-term goal to be achieved is that it is hoped that this system will be able to publicize its activities for more up-to-date information so that the public can find out about the activities that have been carried out, ease of information on the procedures for handling correspondence in the Melayu Tenggarong village to the public at large. So that the specific target of using the Tenggarong Kelurahan website as an effective medium for delivering information can be achieved.
McArdle, Frank - Biographical entry - Index to the AMA archive

McArdle, Frank - Biographical entry - Index to the AMA archive - NAME is a biographical, bibliographical and archival database of SUBJECT with links to related articles and images. ADD MORE DESCRIPTION AS REQUIRED
내러티브 중심 문학교육 평가를 위한 탐색

This research demonstrates the need for a new paradigm in literary education to stop the pendulum movement and the need for concrete measures to be taken to ensure that practicality is secured, in the sense that the field of literary assessment has so far been engaged in the pendulum movement between policy demands and ideal orientation. From this point of view, he proposed a paradigm shift in the assessment of liberal arts by analyzing the current state of assessment of high school subjects, returning to the fundamental question of why, what, and how, the assessment of literature, education and education. This was called the Narrative Centering Literary Education Assessment, in which literary critics should deal with the process of life-aware growth based on narratives. Narrative Centrifugal also showed a developmental cycle of spiraling curves, and presented new taxonomy that could demonstrate its dynamism and be a specific guide to the design of the assessment.
A Mobile Application That Allows People Who Do Not Know Sign Language to Teach Hearing-Impaired People by Using Speech-to-Text Procedures

Hearing-impaired people use sign language to communicate with each other. People who do not know sign language it is difficult to communicate with hearing-impaired people. In this study, this problem is tried to solve with speech-to-text infrastructure. A software project has been developed to enable people who do not know sign language to communicate with the hearing impaired people. The scope of the system which named "Subtitles Course Tracking System (SCTS)" is that with an application running on the Android operating system, user’s speeches are converted into text (Speech-to-Text) and instantly transferred to remote a server. Speech texts which are recorded on the database of the remote server could be followed up in real-time on mobile phones and web pages by the software that has capable of asynchronous data exchange over the Internet (AJAX). Within the scope of this study, a web-based course management system has been developed and all courses in the system made accessible at any time.
RANCANG BANGUN SISTEM INFORMASI SIMPAN PINJAM BERBASIS WEB PADA KOPERASI UNIT DESA SOLIAMITRA DEPOK

The Industrial Era 4.0 is now very rapid with the development of all forms of digital applications to record all transactions that are running. Koperasi Unit Desa (KUD) Soliamitra requires a system in the running business process because the savings system itself uses a desktop-based or computerized system, but when the loan process is still done manually, using Microsoft Excel starting from applying for loans, installment payments to storage data relating to lending to report preparation, so that when recording loan data there are still frequent recording errors, using the web-based savings and loan information system technology is expected to improve service performance for members of the Koperasi Unit Desa (KUD) Soliamitra. In making this information system the author uses the SDLC method with a waterfall model, because step by step can be completed in an ordered and structured manner, and the design drawings using Unified Modeling Language (UML) as analysis and design and using NetBeans software for system implementation Java Servlet based object to support Web Application.
Recursive SPARQL for Graph Analytics

Work on knowledge graphs and graph-based data management often focus either on declarative graph query languages or on frameworks for graph analytics, where there has been little work in trying to combine both approaches. However, many real-world tasks conceptually involve combinations of these approaches: a graph query can be used to select the appropriate data, which is then enriched with analytics, and then possibly filtered or combined again with other data by means of a query language. In this paper we propose a declarative language that is well suited to perform graph querying and analytical tasks. We do this by proposing a minimalistic extension of SPARQL to allow for expressing analytical tasks; in particular, we propose to extend SPARQL with recursive features, and provide a formal syntax and semantics for our language. We show that this language can express key analytical tasks on graphs (in fact, it is Turing complete), offering a more declarative alternative to existing frameworks and languages. We show how procedures in our language can be implemented over an off-the-shelf SPARQL engine with a specialised client that allows parallelisation and batch-based processing when memory is limited. Results show that with such an implementation, procedures for popular analytics currently run in seconds or minutes for selective sub-graphs (our target use-case) but struggle at larger scales.
Modern Problems of Studying Art in an Inclusive Environment

The article focuses on the problems of studying art in the context of inclusion, describes the Russian and foreign experience of education in an inclusive environment. In order to address the issues, it is suggested to expand the content of the existing special education programs, introduce elective courses and extracurriculars, as well as create variatiable intergrative learning models for teachers, which suggest the use of art technologies that effectively include children with special needs into the general educational process.
Design of Nutrition Assessment of Hospitalized Patients Based on Web in Hospital of Universitas Sumatera Utara

Hospital of Universitas Sumatera Utara has some services which are integrated with hospital management information system, but nutrition service has not been included yet.Actually, the nutrition service activities consist of nutrition assessment as well as diet orders of hospitalized patients which been done manually that could cause error.The aim of the study is to make an application of nutrition assessment and diet orders of hospitalized patients based on web, so it can minimize the error.The name of the application is "E-NRD" made with Waterfall method.The study design was research and development and was done for 8 months.The steps of the study were dieticians and nurses interviews, data collection, application establishment, dieticians and nurses workshops of application, and finally the implementation of the application.Hopefully "E-NRD" as a part of hospital management information system could improve the quality of nutrition service in hospital of Universitas Sumatera Utara.
An Optimization Method for Feature Extraction of Radiation Sources

Feature extraction is an important part of machine learning models. However, traditional methods need professional knowledge about the specific field. We introduce an optimization method for feature extraction of radiation sources. The receivers get the sampling signals, and after applying Fourier transform, autoencoders train the data and output the encoded signals. Population based training (PBT) is used to optimize the hyperparameters. Compared to the traditional feature extraction methods, the proposed method achieve better result, the classification precision is above 95%.
Towards summarizing program statements in source code search

A common practice among programmers is to find pieces of source code using search engines. Programs retrieved by these engines are typically semantically but not necessarily syntactically similar. As a result, ranking methods are exploited to present relevant programs to users. However, due to implementation variability, users need to understand such programs. In this paper, we propose a method to group statements into clusters from a set of programs retrieved by a source code search engine. Each cluster comprises a number of program statements that have similar but not exact semantics and are pervasive. Our hypothesis is that such clusters help understand at a glance a set of semantically-related programs. We use approximate graph alignment to find correspondences among statements in two program dependence graphs that are similar with respect to their control and data flows, as well as operations they perform. We then build a graph with pairwise comparisons of program dependence graphs, and cast the problem of clustering statements as finding communities of statements that consistently align. Our evaluation using programs collected by BigCloneBench shows that clusters of statements discovered by our approach help discern implementation variations.
Fusion of Logically Concatenated Cross Binary Pattern and ε-Dragging Linear Regression for Face Classification across Poses

Face recognition across poses is a fundamental challenge in face recognition.The appearance of the face undergoes drastic changes with changes in the pose angle of the face.The popular uniform texture-based descriptor, Linear Binary Pattern (LBP), loses its appeal as the underlying intensity information changes.During pose changes, crucial facial key points get concealed and henceforth the rate of face recognition falls.In this paper, we propose utilizing an LBP-based texture descriptor, the Logically Concatenated Cross Binary Pattern, for extracting contour information from face images.The produced feature descriptors show a superior performance in terms of computational complexity.In order to retain only discriminant features, a balanced approach, like Marginalized Elastic-Net Regularization with ε-dragging, is fixed into the regularization term of the linear regression model.Classification is realized using regression residuals in the least-squares sense.In order to make the proposed approach robust to poses, Procrustes analysis is utilized at the preprocessing step when pose variations are significant.A comparative investigation of the proposed approach is presented by utilizing the UMIST database, the AT&T database, and the Indian Movie Face Database.
Web-based thematic module in social studies to improving student digital literation skills

Web-based thematic modules were developed based on the needs of social studies teachers and students of a media that collects social science material in an integrated and thematic manner that is easily accessible and flexible. This study aims to (1) find out the procedures for developing and making web-based modules on IPS material, (2) knowing the students' responses after using the WEB-based module as teaching material for social studies, (3) knowing the effectiveness of WEB-based modules viewed from student learning outcomes. The method used is the Research and Development method with a three-stage development model; there are design, production, and evaluation. The results of this study are (1) WEB-based thematic modules developed in two themes, namely the first theme of forest and land fires in Kalimantan and the second theme of the Industrial Revolution 4.0, (2) as for student responses to the use of this web-based thematic module product, in general, give a positive response. Although they found obstacles that were difficult to concentrate when studying with WEB, (3) the effectiveness of the product seen from student learning outcomes showed that this WEB-based module did not have a significant positive impact on student learning outcomes. 46.03% of students entered the category of mastering, and 53.94% of students entered the category of not mastering, so that shows the level of digital literacy of students is still low.
A high capacity text steganography scheme based on permutation and color coding.

In this paper, we propose a text steganographic scheme based on color coding and permutation. Given a secret message and a cover text, the proposed scheme embed the secret message in the cover text by making it colored, using a permutation algorithm. The stego-text is then send to the receiver by mail. The results which have been obtained by experiments, show that our model performs a better hiding process in terms of hiding capacity as compared to the scheme of Aruna Malik et al. on which our idea is based.
Trust-based Multiagent Consensus or Weightings Aggregation

We introduce a framework for reaching a consensus amongst several agents communicating via a trust network on conflicting information about their environment. We formalise our approach and provide an empirical and theoretical analysis of its properties.
The current state of automated negotiation theory: a literature review

Automated negotiation can be an efficient method for resolving conflict and redistributing resources in a coalition setting. Automated negotiation has already seen increased usage in fields such as e-commerce and power distribution in smart girds, and recent advancements in opponent modelling have proven to deliver better outcomes. However, significant barriers to more widespread adoption remain, such as lack of predictable outcome over time and user trust. Additionally, there have been many recent advancements in the field of reasoning about uncertainty, which could help alleviate both those problems. As there is no recent survey on these two fields, and specifically not on their possible intersection we aim to provide such a survey here.
"None of the Above":Measure Uncertainty in Dialog Response Retrieval

This paper discusses the importance of uncovering uncertainty in end-to-end dialog tasks, and presents our experimental results on uncertainty classification on the Ubuntu Dialog Corpus. We show that, instead of retraining models for this specific purpose, the original retrieval model's underlying confidence concerning the best prediction can be captured with trivial additional computation.
Understanding Cross-Lingual Syntactic Transfer in Multilingual Recurrent Neural Networks

It is now established that modern neural language models can be successfully trained on multiple languages simultaneously without changes to the underlying architecture. But what kind of knowledge is really shared among languages within these models? Does multilingual training mostly lead to an alignment of the lexical representation spaces or does it also enable the sharing of purely grammatical knowledge? In this paper we dissect different forms of cross-lingual transfer and look for its most determining factors, using a variety of models and probing tasks. We find that exposing our LMs to a related language does not always increase grammatical knowledge in the target language, and that optimal conditions for lexical-semantic transfer may not be optimal for syntactic transfer.
Chromosome Medial Axis Extraction Method Based on Graphic Geometry and Competitive Extreme Learning Machines Teams (CELMT) Classifier for Chromosome Classification

Automated chromosome classification is a vital task in cytogenetics and has been a common pattern recognition problem. Numerous attempts were made in the past decade years to characterize chromosomes for the intention of medical and cancer cytogenetics research. This paper proposes a graphic geometry-based approach for medial axis extraction and Competitive Extreme Learning Machine Teams (CELMT) with further correction method for chromosome classification. The initial two medial axis points are determined firstly according to the length of the intercept line in different directions, and then the complete medial axis for feature extraction is drawn based on the initial two points. After that, a base classifier ELMi, j is trained to differentiate a pair class chromosome (i, j), a total number of 276 classifiers are trained. Each base classifier will give a label and the final label will be determined by majority voting and further correction rules. Based on the experiment results, the method proposed in this paper can precisely extract the medial axis and extract the features to recognize the chromosome, the classification accuracy by using CELMT can achieve an average value of 96.23% and the running time is much shorter than the other classification algorithms.
Case, R - Biographical entry - Index to the AMA archive

Case, R - Biographical entry - Index to the AMA archive - NAME is a biographical, bibliographical and archival database of SUBJECT with links to related articles and images. ADD MORE DESCRIPTION AS REQUIRED
The wearable bone glossary: Wearable technology at the service of inclusive education

Medical EducationVolume 54, Issue 5 p. 447-448 REALLY GOOD STUFF: Lessons learned through innovation in medical education The wearable bone glossary: Wearable technology at the service of inclusive education Taluan Nogueira, Search for more papers by this authorVictoria Lindenbach de Morais, Search for more papers by this authorCatarine Perri de Moraes, Search for more papers by this authorCamilo Lellis-Santos, Corresponding Author lellis.unifesp@gmail.com orcid.org/0000-0002-7882-7548 Correspondence Camilo Lellis-Santos, Institute of Environmental, Chemical and Pharmaceutical Sciences, Universidade Federal de São Paulo, Rua São Nicolau, 210 - Centro, Diadema 09913-030, Brazil. Email: lellis.unifesp@gmail.comSearch for more papers by this author Taluan Nogueira, Search for more papers by this authorVictoria Lindenbach de Morais, Search for more papers by this authorCatarine Perri de Moraes, Search for more papers by this authorCamilo Lellis-Santos, Corresponding Author lellis.unifesp@gmail.com orcid.org/0000-0002-7882-7548 Correspondence Camilo Lellis-Santos, Institute of Environmental, Chemical and Pharmaceutical Sciences, Universidade Federal de São Paulo, Rua São Nicolau, 210 - Centro, Diadema 09913-030, Brazil. Email: lellis.unifesp@gmail.comSearch for more papers by this author First published: 06 April 2020 https://doi.org/10.1111/medu.14102Read 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 onEmailFacebookTwitterLinked InRedditWechat No abstract is available for this article. Volume54, Issue5May 2020Pages 447-448 RelatedInformation
Towards a complete perspective on labeled tree indexing: new size bounds, efficient constructions, and beyond

A labeled tree (or a trie) is a natural generalization of a string, which can also be seen as a compact representation of a set of strings. This paper considers the labeled tree indexing problem, and provides a number of new results on space bound analysis, and on algorithms for efficient construction and pattern matching queries. Kosaraju [FOCS 1989] was the first to consider the labeled tree indexing problem, and he proposed the suffix tree for a backward trie, where the strings in the trie are read in the leaf-to-root direction. In contrast to a backward trie, we call a usual trie as a forward trie. Despite a few follow-up works after Kosaraju's paper, indexing forward/backward tries is not well understood yet. In this paper, we show a full perspective on the sizes of indexing structures such as suffix trees, DAWGs, CDAWGs, suffix arrays, affix trees, affix arrays for forward and backward tries. Some of them take $O(n)$ space in the size $n$ of the input trie, while the others can occupy $O(n^2)$ space in the worst case. In particular, we show that the size of the DAWG for a forward trie with $n$ nodes is $\Omega(\sigma n)$, where $\sigma$ is the number of distinct characters in the trie. This becomes $\Omega(n^2)$ for an alphabet of size $\sigma = \Theta(n)$. Still, we show that there is a compact $O(n)$-space implicit representation of the DAWG for a forward trie, whose space requirement is independent of the alphabet size. This compact representation allows for simulating each DAWG edge traversal in $O(\log \sigma)$ time, and can be constructed in $O(n)$ time and space over any integer alphabet of size $O(n)$. In addition, this readily extends to the first indexing structure that permits bidirectional pattern searches over a trie within linear space in the input trie size.