Reviewerly/exHarmony huggingface dataset:
RETRACTED ARTICLE: A fuzzy control model based on BP neural network arithmetic for optimal control of smart city facilities

In order to analyze and study the fuzzy control model of smart city optimization control, this paper designs a fully networked fuzzy controller based on BP neural network arithmetic, so that the realization process of fuzzy reasoning is networked and clear. The evaluation mode of wisdom town is constructed, and the index system is simplified according to the evaluation index system of the develop possible of wisdom town. The analog outcome shows that the above arithmetic can availably optimize the parameters and structure of the neuro vagueness control, and the designed neuro vagueness control has good performance. The build of wisdom cities is advantageous to further promoting the deep integration of industrialization, informationization, urbanization, and agricultural modernization, which is of great significance for solving urban development problems and promoting continuable town develop. To improve the development capacity of intelligent city, we should highlight the characteristics of smart cities; advocate the concept of sustainable development and low-carbon development, market-oriented, overall planning, top-level design, and micro-regulation; and take the road of development with local characteristics.
Zero-inflated sum of Conway-Maxwell-Poissons (ZISCMP) regression

While excess zeros are often thought to cause data over-dispersion (i.e. when the variance exceeds the mean), this implication is not absolute. One should instead consider a flexible class of distributions that can address data dispersion along with excess zeros. This work develops a zero-inflated sum-of-Conway-Maxwell-Poissons (ZISCMP) regression as a flexible analysis tool to model count data that express significant data dispersion and contain excess zeros. This class of models contains several special case zero-inflated regressions, including zero-inflated Poisson (ZIP), zero-inflated negative binomial (ZINB), zero-inflated binomial (ZIB), and the zero-inflated Conway-Maxwell-Poisson (ZICMP). Through simulated and real data examples, we demonstrate class flexibility and usefulness. We further utilize it to analyze shark species data from Australia's Great Barrier Reef to assess the environmental impact of human action on the number of various species of sharks.
CCFS: A Confidence-Based Cost-Effective Feature Selection Scheme for Healthcare Data Classification

Feature selection (FS) is one of the fundamental data processing techniques in various machine learning algorithms, especially for classification of healthcare data. However, it is a challenging issue due to the large search space. Binary Particle Swarm Optimization (BPSO) is an efficient evolutionary computation technique, and has been widely used in FS. In this paper, we proposed a Confidence-based and Cost-effective feature selection (CCFS) method using BPSO to improve the performance of healthcare data classification. Specifically, first, CCFS improves search effectiveness by developing a new updating mechanism that designs the feature confidence to explicitly take into account the fine-grained impact of each dimension in the particle on the classification performance. The feature confidence is composed of two measurements: the correlation between feature and categories, and historically selected frequency of each feature. Second, considering the fact that the acquisition costs of different features are naturally different, especially for medical data, and should be fully taken into account in practical applications, besides the classification performance, the feature cost and the feature reduction ratio are comprehensively incorporated into the design of fitness function. The proposed method has been verified in various UCI public datasets and compared with various benchmark schemes. The thoroughly experimental results show the effectiveness of the proposed method, in terms of accuracy and feature selection cost.
Automatic classification of cells in microscopic fecal images using convolutional neural networks

The analysis of fecal-type components for clinical diagnosis is important. The main examination involves the counting of red blood cells (RBCs), white blood cells (WBCs), and molds under the microscopic. With the development of machine vision, some vision-based detection schemes have been proposed. However, these methods have a single target for detection, with low detection efficiency and low accuracy. We proposed an algorithm to identify the visible image of fecal composition based on intelligent deep learning. The algorithm mainly includes region proposal and candidate recognition. In the process of segmentation, we proposed a morphology extraction algorithm in a complex background. As for the candidate recognition, we proposed a new convolutional neural network (CNN) architecture based on Inception-v3 and principal component analysis (PCA). This method achieves high-average Precision of 90.7%, which is better than the other mainstream CNN models. Finally, the images within the rectangle marks were obtained. The total time for detection of an image was roughly 1200 ms. The algorithm proposed in the present paper can be integrated into an automatic fecal detection system.
Secure Approximate String Matching for Privacy-Preserving Record Linkage

Real-world applications of record linkage often require matching to be robust in spite of small variations in string fields. For example, two health care providers should be able to detect a patient in common, even if one record contains a typo or transcription error. In the privacy-preserving setting, however, the problem of approximate string matching has been cast as a trade-off between security and practicality, and the literature has mainly focused on Bloom filter encodings, an approach which can leak significant information about the underlying records. We present a novel public-key construction for secure two-party evaluation of threshold functions in restricted domains based on embeddings found in the message spaces of additively homomorphic encryption schemes. We use this to construct an efficient two-party protocol for privately computing the threshold Dice coefficient. Relative to the approach of Bloom filter encodings, our proposal offers formal security guarantees and greater matching accuracy. We implement the protocol and demonstrate the feasibility of this approach in linking medium-sized patient databases with tens of thousands of records.
Understanding Context for Tasks and Activities

Human activity is one of the most important pieces of context affecting an individual's information needs. Understanding the relationship between activities, time, location, and other contextual features can improve the quality of various intelligent systems, including contextual search engines, task managers, digital personal assistants, chat bots, and recommender systems.
Differentially Private Publication of Vertically Partitioned Data

In this paper, we study the problem of publishing vertically partitioned data under differential privacy, where different attributes of the same set of individuals are held by multiple parties. In this setting, with the assistance of a semi-trusted curator, the involved parties aim to collectively generate an integrated dataset while satisfying differential privacy for each local dataset. Based on the latent tree model (LTM), we present a differentially private latent tree (DPLT) approach, which is, to the best of our knowledge, the first approach to solving this challenging problem. In DPLT, the parties and the curator collaboratively identify the latent tree that best approximates the joint distribution of the integrated dataset, from which a synthetic dataset can be generated. The fundamental advantage of adopting LTM is that we can use the connections between a small number of latent attributes derived from each local dataset to capture the cross-dataset dependencies of the observed attributes in all local datasets such that the joint distribution of the integrated dataset can be learned with little injected noise and low computation and communication costs. DPLT is backed up by a series of novel techniques, including two-phase latent attribute generation (TLAG), tree index based correlation quantification (TICQ) and distributed Laplace perturbation protocol (DLPP). Extensive experiments on real datasets demonstrate that DPLT offers desirable data utility with low computation and communication costs.
Finding and Analyzing App Reviews Related to Specific Features: A Research Preview

[Context and motivation] App reviews can be a rich source of information for requirements engineers. Recently, many approaches have been proposed to classify app reviews as bug reports, feature requests, or to elicit requirements. [Question/problem] None of these approaches, however, allow requirements engineers to search for users' opinions about specific features of interest. Retrieving reviews on specific features would help requirements engineers during requirements elicitation and prioritization activities involving these features. [Principal idea/results] This paper presents a research preview on our tool-supported method for taking requirements engineering decisions about specific features. The tool will allow one to (i) find reviews that talk about a specific feature, (ii) identify bug reports, change requests and users' sentiment about this feature, and (iii) visualize and compare users' feedback for different features in an analytic dashboard. [Contributions] Our contribution is threefold: (i) we identify a new problem to address, i.e. searching for users' opinions on a specific feature, (ii) we provide a research preview on an analytics tool addressing the problem, and finally (iii) we discuss preliminary results on the searching component of the tool.
Theoretical analysis of dynamic binary neural networks with simple sparse connection

This paper studies dynamic binary neural networks with simple sparse connection such that each neuron transforms three binary inputs to one binary output via three binary branches. First, it is proven theoretically that rotation-type periodic orbits can be stored into the networks and local stability of the stored orbits is very strong. If the local stability is very strong, the networks can remove any 1-bit error and make the periodic orbits robust. Second, an FPGA-based implementation is presented where the neurons are realized by simple majority decision circuits and the binary positive/negative connections are realized by direct/inverter connections. Using the hardware, typical periodic orbits are confirmed experimentally. The simple FPGA-based implementation is basic to realize engineering applications of the networks such as control signals of switching circuits.
Design of Intelligent classroom facial recognition based on Deep Learning

The emergence of Intelligent Classroom (ITS) is a significant improvement in the current level of modern teaching. This paper designs a real-time classroom assessment system that utilizes computer vision's target recognition technology. Based on the FER-2013 facial expression dataset and convolutional neural network (CNN), this paper establishes a real-time emotion recognition model by removing the fully connected layer and using the depth separable convolution combined with the remaining modules. In the end, the model established in this paper shows high detection accuracy and robustness, and can realize real-time evaluation of students' classroom performance to give teachers quick feedback.
Privacy-Aware Personal Data Storage (P-PDS): Learning how to Protect User Privacy from External Applications

Recently, Personal Data Storage (PDS) has inaugurated a substantial change to the way people can store and control their personal data, by moving from a service-centric to a user-centric model. PDS offers individuals the capability to keep their data in a unique logical repository, that can be connected and exploited by proper analytical tools, or shared with third parties under the control of end users. Up to now, most of the research on PDS has focused on how to enforce user privacy preferences and how to secure data when stored into the PDS. In contrast, in this paper we aim at designing a Privacy-aware Personal Data Storage (P-PDS), that is, a PDS able to automatically take privacy-aware decisions on third parties access requests in accordance with user preferences. The proposed P-PDS is based on preliminary results presented in [1] , where it has been demonstrated that semi-supervised learning can be successfully exploited to make a PDS able to automatically decide whether an access request has to be authorized or not. In this paper, we have deeply revised the learning process in order to have a more usable P-PDS, in terms of reduced effort for the training phase, as well as a more conservative approach w.r.t. users privacy, when handling conflicting access requests. We run several experiments on a realistic dataset exploiting a group of 360 evaluators. The obtained results show the effectiveness of the proposed approach.
A novel accelerated implementation of RSA using parallel processing

AbstractAbstractPast research has evidently proved that public key cryptosystems are usually slower than symmetric key cryptosystems due to the reason that they use one additional cryptographic key and different methods for encryption and decryption. RSA is one of the most common asymmetric key cryptography algorithms. Recent research has focused on speeding up RSA using various techniques. With the introduction of distributed computing, parallelization of algorithms enables them to run on multiple cores concurrently at a time. RSA consists of two resource intensive operations namely Modular Exponentiation of up to 1024-bit exponents and repeated calculation of Greatest common divisor. Thus, RSA lays the perfect base for application of Montgomery Reduction algorithm to optimize the Repeated Modular multiplication in exponentiation. In this paper we proposed a parallel scheme for RSA using a new parallel data structure known as Concurrent Indexed List of character blocks. The aim of our research was to improve the speed of RSA encryption and decryption using parallelism and also make it compatible with leading industry cryptography standards. We have simulated four different approaches namely both parallel and sequential with and without Montgomery. We have also integrated our parallel paradigm with renowned C++ Crypto library and achieved a speed-up of upto four times than sequential approach. Unlike any other previous approaches, our implementation got easily integrated with any external library and thus can be adopted by any other algorithmic scheme.Keywords: RSAParallel AlgorithmsMontgomery ReductionHyperthreading
Analyzing the Simonshaven Case Using Bayesian Networks

This paper is one in a series of analyses of the Dutch Simonshaven murder case, each using a different modeling approach. We adopted a Bayesian network (BN)-based approach which requires us to determine the relevant hypotheses and evidence in the case and their relationships (captured as a directed acyclic graph) along with explicit prior conditional probabilities. This means that both the graph structure and probabilities had to be defined using subjective judgments about the causal, and other, connections between variables and the strength and nature of the evidence. Determining if a useful BN could be quickly constructed by a small group using the previously established idioms-based approach which provides a generic method for translating legal cases into BNs, was a key aim. The model described was built by the authors during a workshop dedicated to the case at the Isaac Newton Institute, Cambridge, in September 2016. The total effort involved was approximately 26 h (i.e., an average of 6 h per author). With the basic assumptions described in the paper, the posterior probability of guilt once all the evidence is entered is 74%. The paper describes a formal evaluation of the model, using sensitivity analysis, to determine how robust the model conclusions are to key subjective prior probabilities over a full range of what may be deemed "reasonable" from both defense and prosecution perspectives. The results show that the model is reasonably robust-pointing not only generally to a reasonably high posterior probability of guilt but also generally below the 95% threshold expected in criminal law. Given the constraints on building a complex model so quickly, there are inevitably weaknesses; hence, the paper describes these and how they might be addressed, including how to take account of supplementary case information not known at the time of the workshop.
Investigating the Association Between Internet Health Information Use and Patient Willingness to Communicate with Health Care Providers

Communication between health professionals and patients is an intergroup phenomenon where the health professional has the most power and status. Over the past few decades, there has been a steady increase in the availability to patients of information about healthcare and specific diseases on the Internet. In this paper, we ask whether the use of Internet health information assists patients to manage their consultations with health professionals better and whether it alters the intergroup dynamic by providing a more equal status for patients. In this study 370 participants from Australia and Canada completed a survey that included a ‘willingness to communicate with health professionals’ scale. They also commented on their use and trust of Internet health information. Thematic analysis suggests that patients’ use of Internet health information serves as a broker between patients and their health provider in health consultations. We discuss the implications of these findings for health practitioners as they address how easier Internet access influences patient interactions with health professionals. We consider future research directions these finding provide in explaining communication behaviour in this context.
Comparison of Sentiment Analysis and User Ratings in Venue Recommendation

Venue recommendation aims to provide users with venues to visit, taking into account historical visits to venues. Many venue recommendation approaches make use of the provided users' ratings to elicit the users' preferences on the venues when making recommendations. In fact, many also consider the users' ratings as the ground truth for assessing their recommendation performance. However, users are often reported to exhibit inconsistent rating behaviour, leading to less accurate preferences information being collected for the recommendation task. To alleviate this problem, we consider instead the use of the sentiment information collected from comments posted by the users on the venues as a surrogate to the users' ratings. We experiment with various sentiment analysis classifiers, including the recent neural networks-based sentiment analysers, to examine the effectiveness of replacing users' ratings with sentiment information. We integrate the sentiment information into the widely used matrix factorization and GeoSoCa multi feature-based venue recommendation models, thereby replacing the users' ratings with the obtained sentiment scores. Our results, using three Yelp Challenge-based datasets, show that it is indeed possible to effectively replace users' ratings with sentiment scores when state-of-the-art sentiment classifiers are used. Our findings show that the sentiment scores can provide accurate user preferences information, thereby increasing the prediction accuracy. In addition, our results suggest that a simple binary rating with 'like' and 'dislike' is a sufficient substitute of the current used multi-rating scales for venue recommendation in location-based social networks.
Efficient Ising Model Mapping to Solving Slot Placement Problem

Ising model-based computation has attracted attention as it can obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot placement problem is one of the combinatorial optimization problems which plays an important role in the optimal logic-block placement as well as optimal delivery decisions but it is known as an NP-hard problem. Solving it efficiently is one of the largest challenges. In this paper, we propose an efficient Ising model mapping to solve the slot placement problem and an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. First, we propose slot-placement constraint terms that minimize the energy function or Hamiltonian of the Ising model when satisfying the slot-placement constraints. Secondly, we propose an objective function term in the energy function that minimizes the total weighted wiring length between items to be placed to the slots. In Ising model-based computations, the final spin states cannot necessarily satisfy the slot-placement constraints, which gives one of the largest differences from the conventional computations. Hence we newly propose an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. On a fully-connected annealing machine, we could obtain feasible solutions with almost the same accuracy as the simulated annealing for slot placement problem with two orders of magnitude faster.
Person Reidentification by Joint Local Distance Metric and Feature Transformation

Person reidentification is of great importance in visual surveillance and multiperson tracking across multiple camera views. Two fundamental problems are critical for person reidentification: 1) how to account for appearance variation or feature transformation caused by viewpoint changes and 2) how to learn a discriminative distance metric for reidentification. In this paper, we propose an algorithm in which both feature transformation and metric learning are exploited and jointly optimized. We learn local models from subsets of training samples with regularization imposed by the global model which is trained among the entire data set. The learned local models enhance the discriminative strength and generalization ability. Experimental results on the Viewpoint Invariant PEdestrian Eecognition, Queen Mary University of London ground reidentification, CUHK01, and CUHK03 benchmark data sets show that the proposed sample-specific view-invariant approach performs favorably against the state-of-the-art person reidentification methods.