Reviewerly/exHarmony huggingface dataset:
Methods and Models of a Multifunctional System Support for Decision Making for Differential Diagnosis of Diseases

The article discusses the development of a multifunctional system for the support of medical decision-making for the differential diagnosis of the disease based on the modular principle.It is known that due to the complexity of processing large volumes of information with a large number of decision rules in the knowledge base (KB), the decision-making process is complicated.In connection with this, usually an expert system with the aim of increasing the accuracy of diagnostic solutions isdeveloped as one functional expert systems (ES) for a narrow class of diseases.A multifunctional medical decision support systems (MDSS) will be designed to solve the problems of differential diagnosis of not one but many classes of diseases, which complicates the decision-making process.This paper discusses the development of multifunctional MDSS.Facilitation of the diagnostic decision-making process is carried out using the modular principle.Each module has a pile of knowledge bases, which has a hierarchical structure designed for phased reasoning.The software part of the ES consists of control programs and several modules (subprograms).Each module is designed to solve the differential diagnosis of one narrow class of the disease.The implementation of this system is considered for examples of the class of disease "Myocardial infarction" and "Headache".By increasing the number of modules in the KB, you can expand the versatility of this diagnostic system.
Effect of Dialogs’ Arrangement on Accuracy and Workload for Confirming Input Data

Recently, a variety of web services are available through the Internet. On these web services, the users have to input data correctly such as personal information and ordering data on digital devices. If they make mistakes in their input data on this kind of services, it often makes serious troubles. To avoid these troubles, many services have functions like “confirmation dialog” for the users to confirm their input data. However, the traditional confirmation dialog can be skipped by simply clicking OK button on the dialog without confirming input data. To solve the problem, we proposed “Phantom Dialog” that shows simultaneously two parallel arranged dialogs with user’s input data and system-generated dummy data. It was found that the Phantom Dialog could make difficult to skip the process of the confirmation. But, it took longer confirmation time than the traditional confirmation dialog. In this paper, in order to reduce the time, we propose to increase the probability that user’s input data is shown on the left dialog, which is expected to be read firstly by the user on the Phantom Dialog. As the result of the evaluation with the three different probabilities on the Phantom Dialog, it is found that the participants can confirm their input data faster with left-biased probability without deterioration in the confirmation accuracy. Furthermore, most of them did not notice that the probabilities were different.
Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory

We present an in-place algorithm for the parallel-partition problem with linear work and polylogarithmic span. The algorithm uses only exclusive read/write shared variables and can be implemented using parallel-for-loops without any additional concurrency considerations (i.e., the algorithm is EREW). A key feature of the algorithm is that it exhibits provably optimal cache behavior up to small-order factors.
Improved UX of Network Device Monitoring: A Practical Example of Information Visualization

Today, the possible amount of data to collect has grown with better computers and the internet. Therefore, the interest in how to visualize complex data has increased. In this thesis, a practical example of how to design an information visualization (IV) application has been conducted. Advencia is a company located in Malmo that focuses on cyber-security. Advenica’s product, ZoneGuard, works as a bridge between two security domains that blocks or allows network packages to transfer between the domains. Advenica saw a need to visualize the information exchange between the two domains and the status of a ZoneGuard. To design an IV that is adapted to the users’ needs, a user-centered design (UCD) approach was implemented. A UCD approach resulted in an IV application that Advenica was satisfied with. In that aspect, a UCD approach in this project was a success. However, with the limitation of access to real end-users, the end-users’ user experience (UX) could not be fully tested. This was solved by instead testing on employees at Advenica. It is first when the application is tested on the end-users, that one can confirm if the visualization has a high usability or not. Representative and interactive IV techniques were used to design the IV application. To represent information transferred through a ZoneGuard, vertical stacked bar graphs were used. In the application, there are examples of how bar graphs and line charts can be used to visualize data. There are also examples of how hovering over (mouse over), which is an interactive technique, can be used to enhance a user’s understanding of the data. (Less)
Forgetting Auxiliary Atoms in Forks (Extended Abstract)

This work tackles the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. We call this property projective strong equivalence (PSE). It has been recently proved that not any logic program containing auxiliary atoms can be reformulated, under PSE, as another logic program or formula without them -- this is known as strongly persistent forgetting. In this paper, we introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective we call fork. We provide a semantic characterisation of PSE for forks and use it to show that, in this extension, it is always possible to forget auxiliary atoms under strong persistence. We further define when the obtained fork is representable as a regular formula.
The properties and parameters of generic Bose – Chaudhuri – Hocquenghem codes

The Bose – Chaudhuri – Hocquenghem type of linear cyclic codes (BCH codes) is one of the most popular and widespread error-correcting codes. Their close connection with the theory of Galois fields gave an opportunity to create a theory of the norms of syndromes for BCH codes, namely, syndrome invariants of the G-orbits of errors, and to develop a theory of polynomial invariants of the G-orbits of errors. This theory as a whole served as the basis for the development of effective permutation polynomial-norm methods and error correction algorithms that significantly reduce the influence of the selector problem. To date, these methods represent the only approach to error correction with non-primitive BCH codes, the multiplicity of which goes beyond design boundaries. This work is dedicated to a special error-correcting code class – generic Bose – Chaudhuri – Hocquenghem codes or simply GBCH-codes. Sufficiently accurate evaluation of the quantity of such codes in each length was produced during our work. We have investigated some properties and connections between different GBCH-codes. Special attention was devoted to codes with constructive distances of 3 and 5, as those codes are usual for practical use. Their almost complete description is given in the range of lengths from 7 to 107. The paper contains a fairly clear theoretical classification of GBCH-codes. Special attention is paid to the corrective capabilities of the codes of this class, namely, to the calculation of the minimal distances of these codes with various parameters. The codes are found whose corrective capabilities significantly exceed those of the well-known GBCH-codes with the same design parameters.
Privacy and Integrity Preserving Computations with CRISP

In the digital era, users share their personal data with service providers to obtain some utility, e.g., access to high-quality services. Yet, the induced information flows raise privacy and integrity concerns. Consequently, cautious users may want to protect their privacy by minimizing the amount of information they disclose to curious service providers. Service providers are interested in verifying the integrity of the users' data to improve their services and obtain useful knowledge for their business. In this work, we present a generic solution to the trade-off between privacy, integrity, and utility, by achieving authenticity verification of data that has been encrypted for offloading to service providers. Based on lattice-based homomorphic encryption and commitments, as well as zero-knowledge proofs, our construction enables a service provider to process and reuse third-party signed data in a privacy-friendly manner with integrity guarantees. We evaluate our solution on different use cases such as smart-metering, disease susceptibility, and location-based activity tracking, thus showing its promising applications. Our solution achieves broad generality, quantum-resistance, and relaxes some assumptions of state-of-the-art solutions without affecting performance.
SHOCK-BRIGADE OF SOVIET RUSSIA’S PEDAGOGIC INSTITUTES: PREREQUISITES FOR THE CREATION AND CONTENT OF UNPUBLISHED DECREES

The article reveals and analyses the content of unpublished decrees on the shock-brigade of higher educational institutes adopted in Soviet Russia at the late 1920s. Despite the fact that the documents were signed by the government of the country, they have been practically not mentioned in the sourcebooks of legal acts, decrees of the Soviet government and historical and pedagogic literature. At the same time, they contributed to the transformation of the Russian system of pedagogic education, defi ning a course for the centralisation of management and outlining the contours of the model of continuous professional training of pedagogues. Evaluation of the text of the resolutions, their correlation with socio-cultural and historical conditions allowed us to determine the prerequisites for the formation of a shock-brigade of higher pedagogic educational institutions. Based on the analysis of archival sources in the Upper Volga region, the article provides examples of implementing the decision on the shock-brigade of pedagogic institutes at the regional level. The research materials supplement scientifi c information about the features of the national educational policy in the fi eld of teacher training and can be used to supplement the sourcebooks of legal acts of the beginning of the Soviet period of Russian history, implement modern educational policy in the fi eld of pedagogic education, analyse the activities of supporting universities, supplement the educational literature and content of training courses on the history of pedagogy and education.
Sistem Informasi Fasilitas di DKI Jakarta berbasis Android dengan Algoritma Floyd Warshall

Mobile devices, especially the Android operating system, are very easy to use to provide information related to work or location precisely and accurately, especially searching for the location of facilities in DKI Jakarta, such as hospitals, fire stations, restaurants, hotels, and other places. But so far the problem is often encountered related to inaccurate information reports where reports take the form of images and text without a real location statement. For this reason, it is necessary to design a mobile application that can provide detailed information about the location of several public facilities in DKI Jakarta using the Software Development Life Cycle (SDLC) method. Applications that are made can provide information that has several features including image information, title, description, location, and weather.
Refining membership degrees obtained from fuzzy C-means by re-fuzzification

Fuzzy C-mean (FCM) is the most well-known and widely-used fuzzy clustering algorithm. However, one of the weaknesses of the FCM is the way it assigns membership degrees to data which is based on the distance to the cluster centers. Unfortunately, the membership degrees are determined without considering the shape and density of the clusters. In this paper, we propose an algorithm which takes the FCM clustering results and re-fuzzifies them by taking into account the shape and density of the clusters. The algorithm first defuzzifies the FCM clustering results. Then the crisp result is fuzzified again. Re-fuzzification in our algorithm has some advantages. The main advantage is that the fuzzy membership degrees of data points are obtained based on the shape and density of clusters. Adding the ability to eliminate noise and outlier data is the other advantage of our algorithm. Finally, our proposed re-fuzzification algorithm can slightly improve the FCM clustering quality, because the data points change their clusters according to similarity to the shape and density of their respective clusters. These advantages are supported by simulations on real and synthetic datasets.
Journey Towards Tiny Perceptual Super-Resolution

Recent works in single-image perceptual super-resolution (SR) have demonstrated unprecedented performance in generating realistic textures by means of deep convolutional networks. However, these convolutional models are excessively large and expensive, hindering their effective deployment to end devices. In this work, we propose a neural architecture search (NAS) approach that integrates NAS and generative adversarial networks (GANs) with recent advances in perceptual SR and pushes the efficiency of small perceptual SR models to facilitate on-device execution. Specifically, we search over the architectures of both the generator and the discriminator sequentially, highlighting the unique challenges and key observations of searching for an SR-optimized discriminator and comparing them with existing discriminator architectures in the literature. Our tiny perceptual SR (TPSR) models outperform SRGAN and EnhanceNet on both full-reference perceptual metric (LPIPS) and distortion metric (PSNR) while being up to 26.4$\times$ more memory efficient and 33.6$\times$ more compute efficient respectively.
ANALISIS KESALAHAN BERBAHASA DALAM BIOGRAFI PRAMOEDYA ANANTA TOER KARYA MUHAMMAD RIFAI

Language error analysis is a method used in language learning, which aims to find out language mistakes made by students. This study aims to determine the language errors contained in the biography of Pramoedya Ananta Toer written by Muhammad Rifai. Using qualitative methods by reading and examining Pramoedya Ananta Toer's biography to find out the errors contained in the biography, the technique used for data collection is literature review by carefully reading Pramoedya Ananta Toer's biography to find out what errors are found in the biography. While the data analysis technique is to classify the errors found and then analyzed in accordance with these errors. From the biography there are errors in (1) phonology (there are 1 errors in phoneme change and there are 2 errors in phoneme removal), (2) morphology (sound errors that should be melted, but there are no errors and 1 error is used), (3) syntax (phrase field errors there are 2 errors, redundant word errors there are 2 errors and errors in the sentence field there are 6 errors), preposition errors there are 1 errors), (4) semantics (errors in the choice of words there are 4 errors), and language errors in the application of spelling (punctuation errors there are 2 errors. So the number of errors found is 22 errors.
Using Stacks for Image Segmentation Based on Region Growing

The aim of the work is to comparatively evaluate the sizes of FIFO and LIFO stacks required for image segmentation based on growing regions. The coordinates (y, x) of the pixels that need to be attached to the cultivated area are placed in stacks during the segmentation process. The size of the stack needed to store the coordinates depends on the structure of the image and cannot be determined before segmentation. To avoid stack overflow, its size is determined for maximum load conditions when the image contains a single maximum area. In this case, the stack size is equal to the image size. This approach does not take into account the process of stack unloading and leads to memory overrun. Expressions are obtained in the paper that allow one to increase the accuracy of determining the sizes of FIFO and LIFO stacks necessary for storing the coordinates of adjacent pixels in a segmentation algorithm based on growing regions under maximum load conditions. In this case, the initial position of the region growth point and the direction of the selection of adjacent pixels in the scanning window are taken into account. A comparative assessment of the stack sizes required for image segmentation showed that using the FIFO stack is preferable to the LIFO stack and leads to significant memory savings.
It Is Likely That Your Loss Should be a Likelihood

Many common loss functions such as mean-squared-error, cross-entropy, and reconstruction loss are unnecessarily rigid. Under a probabilistic interpretation, these common losses correspond to distributions with fixed shapes and scales. We instead argue for optimizing full likelihoods that include parameters like the normal variance and softmax temperature. Joint optimization of these "likelihood parameters" with model parameters can adaptively tune the scales and shapes of losses in addition to the strength of regularization. We explore and systematically evaluate how to parameterize and apply likelihood parameters for robust modeling, outlier-detection, and re-calibration. Additionally, we propose adaptively tuning $L_2$ and $L_1$ weights by fitting the scale parameters of normal and Laplace priors and introduce more flexible element-wise regularizers.
Foam accumulators: packaging and weight reduction for mobile applications

Standardized parts like hydraulic accumulators are used in nearly every hydraulic system, in many cases even several.Therefore, even small changes in size and weight of accumulators can save considerable material costs.In mobile applications, hydraulic accumulators are used among others in hydro-pneumatic suspension systems.There is a strong focus on miniaturization and weight reduction, as the components always have to be transported with the vehicle.Energy density and energy content of conventional hydraulic accumulators cannot be maximized at the same time.This limitation can be overcome by adding a heat capacity with large surface into the gas volume of the accumulator.The heat capacity enlarges the isothermal frequency range and therefore enlarges the energy density of the accumulator at the given frequency and the given size.In this paper an experimental comparison of conventional hydraulic accumulators and accumulators with foam inserts shows, that at a specific frequency band, the stiffness of foam filled accumulators is significantly lower than of conventional accumulators.The energy density is about 11 % higher than in conventional accumulators.Consequently, a space reduction of about 18 % is possible.
Redefining the gravity

Abstract A falling object does not have weight, but only moving force, a moving object has fixed uniform motion ( see proof ahead ), it neither accelerates nor retards during falling towards Earth. So every particle on earth has a uniform value of inertia. Every particle on earth tends to move towards the centre of the earth as each particle has a direction towards the centre but as compared to space each and every direction of particles may be considered as having single infinite side. These forces indicate us all about earth circumstances and prevailing at its beginning. We will take into consideration the mass of earth before collection coming into existence. The weight which we feel on the surface of the earth is actually a force which tends to move. Objects do not fall due to attraction of earth but due to their own force which we feel as weight. There is no acceleration while falling of an object compared with a 3D Graph of space. The falling path of an object is actually curved. All force of earth has alignment towards a single central point. The force which we feel as weight is responsible for retraction of earth towards the centre but not due to attraction. There is nether attraction between two points on earth nor between any object and earth.
A Descriptive Analysis on Cyber Crimes, Types , Preventions in Financial Transactions

In today's volatile economic environment, the chance and incentive to commit frauds have both increased. Instances of asset misappropriation, concealment, cybercrime, and accounting fraud are only increasing by the day. With changes in technology, frauds have taken the form and modalities of gangland, deploying increasingly sophisticated methods of perpetration. As financial transactions turn into more and more technology-driven, they appear to have become the weapon of choice when it comes to fraudsters. Information, intelligence, and knowledge are requisite in corporation to notice and prevent white-collar crime. The call for expansion has given this unit immense opportunities and as a result, the proliferation in online transactions mounting on technologies like NEFT (National Electronic Fund Transfer), RTGS (Real-Time Gross-Settlements), ECS (Electronic Clearing Service) and mobile transactions are a glimpse of the deeprooted technology in banking and financial matters. But like two sides to a coin, opportunities come with threats and success comes with its equivalent challenges Thus with the swift expansion of computers, and internet technology, new forms of worldwide crimes known as 'Cybercrime's has evolved in the scene. In struggle cyber-crime, financial institutions should assure that their staff and clients are frequently conversant about the risks, such as phishing attacks and social engineering
Research on Aesthetic Perception of Artificial Intelligence Style Transfer

At present, there is still room for evolution in style transfer of open source programs. This research uses open source code for style transfer on GitHub. In addition, it supports the development of online AI Attraction Page, Windows versions, Andorid platform, and Intel NCS. It also strengthens calculation and supports bases of multiple platforms. It is able to implement static style transfer on film, and speed up style transfer inferencing performance on web page. In addition, the literature review explores aesthetic perception elements and applies them to calculate parameter setting. The results of this study discover when the content image weight is 7.5 and the style image weight is 120, the inferenced image can retain characteristics of the original image, and come out with new blending style. Besides, to freeze the content and style image weight ratio, and increase the style image weight value to more than 10,000, the thin film color effect may appear. When there are 32 filters, the extracted color and style can show the most appropriate proportion and state. When the style size is adjusted to 410 × 256 and the content image is close in size, the original style features become more prominent. Finally, keep the style image free space at appropriately 25%, higher texture effect may occur after training.