Reviewerly/exHarmony huggingface dataset:
Graph-based Keyphrase Extraction Using Word and Document Em beddings

With the increasing amount of text data in applications, the task of keyphrase extraction receives more attention that aims to extract concise and important information from a document. In this paper, we propose a novel graph-based keyphrase extraction method using word and document embedding vectors. Two graph construction schemes named GKE-w and GKE-p are designed in which candidate words and phrases are represented as nodes respectively. By calculating the similarity between a word/phrase and the document, each node is assigned an initial weight that reflects the preference to be a keyphrase. Then, we calculate the score of each candidate word/phrase using a semantic biased random walk strategy. Finally, the Top N scored candidate phrases are selected as the final keyphrases. Experiments on two widely used datasets show that the proposed keyphrase extraction algorithm outperforms the state-of-the-art keyphrase extraction methods in terms of precision, recall, and F1 measures.
Efficiency of Cluster Validity Indexes in Fuzzy Clusterwise Generalized Structured Component Analysis

Fuzzy clustering has been broadly applied to classify data into K clusters by assigning membership probabilities of each data point close to K centroids. Such a function has been applied into characterizing the clusters associated with a statistical model such as structural equation modeling. The characteristics identified by the statistical model further define the clusters as heterogeneous groups selected from a population. Recently, such statistical model has been formulated as fuzzy clusterwise generalized structured component analysis (fuzzy clusterwise GSCA). The same as in fuzzy clustering, the clusters are enumerated to infer the population and its parameters within the fuzzy clusterwise GSCA. However, the identification of clusters in fuzzy clustering is a difficult task because of the data-dependence of classification indexes, which is known as a cluster validity problem. We examined the cluster validity problem within the fuzzy clusterwise GSCA framework and proposed a new criterion for selecting the most optimal number of clusters using both fit indexes of the GSCA and the fuzzy validity indexes in fuzzy clustering. The criterion, named the FIT-FHV method combining a fit index, FIT, from GSCA and a cluster validation measure, FHV, from fuzzy clustering, performed better than any other indices used in fuzzy clusterwise GSCA.
DF-toolkit

Applications in several areas, such as privacy, security, and integrity validation, require direct access to database management system (DBMS) storage. However, relational DBMSes are designed for physical data independence, and thus limit internal storage exposure. Consequently, applications either cannot be enabled or access storage with ad-hoc solutions, such as querying the ROWID (which can expose physical record location within DBMS storage but not within OS storage) or using DBMS "page repair" tools that read and write DBMS data pages directly. Such ad-hoc methods are limited in their capabilities and difficult to program, maintain, and port across various DBMSes. In this demonstration, we showcase DF-Toolkit - a set of tools that provide an abstracted access to the DBMS storage layer. Users will be able to view DBMS storage not accessible through other applications. Examples include unallocated (e.g., deleted) data, index value-pointer pairs, and cached DBMS pages in RAM. Users will also be able to interact with several special-purpose security applications that audit DBMS storage beyond what DBMS vendors support.
Knowledge Federation: A Unified and Hierarchical Privacy-Preserving AI Framework

With strict protections and regulations of data privacy and security, conventional machine learning based on centralized datasets is confronted with significant challenges, making artificial intelligence (AI) impractical in many mission-critical and data-sensitive scenarios, such as finance, government, and health. In the meantime, tremendous datasets are scattered in isolated silos in various industries, organizations, different units of an organization, or different branches of an international organization. These valuable data resources are well underused. To advance AI theories and applications, we propose a comprehensive framework (called Knowledge Federation- KF) to address these challenges by enabling AI while preserving data privacy and ownership. Beyond the concepts of federated learning and secure multi-party computation, KF consists of four levels of federation: (1) information level, low-level statistics and computation of data, meeting the requirements of simple queries, searching and simplistic operators; (2) model level, supporting training, learning, and inference; (3) cognition level, enabling abstract feature representation at various levels of abstractions and contexts; (4) knowledge level, fusing knowledge discovery, representation, and reasoning. We further clarify the relationship and differentiation between knowledge federation and other related research areas. We have developed a reference implementation of KF, called iBond Platform, to offer a production-quality KF platform to enable industrial applications in finance, insurance, marketing, and government. The iBond platform will also help establish the KF community and a comprehensive ecosystem and usher in a novel paradigm shift towards secure, privacy-preserving and responsible AI. As far as we know, knowledge federation is the first hierarchical and unified framework for secure multi-party computing (statistics, queries, searching, and low-level operations) and learning (training, representation, discovery, inference, and reasoning).
Using GEOS-5 forecast products to represent aerosol optical depth in operational day-ahead solar irradiance forecasts for the southwest United States

This study aims to improve operational day-ahead direct normal irradiance (DNI) forecasts in clear-sky conditions using the Weather and Research Forecasting model. To create three different forecasting methods targeting the direct effect of aerosols on radiation, we use three different types of aerosol optical depth (AOD) data: (1) the Tegen aerosol climatology, (2) the persistence of measured AERONET AOD, and (3) the Goddard Earth Observing System model version 5 (GEOS-5) gridded forecasts of AOD. We evaluate each method at the Solana Generating Station, a concentrating solar power plant near Gila Bend, Arizona, and the University of Arizona, Tucson. We perform a retrospective DNI forecast analysis and find that including GEOS-5 forecast AOD improved the DNI forecast compared to using an aerosol climatology at both locations. At Tucson, where AOD is measured, we find that the persistence of measured AOD gives the best DNI forecast. However, the accuracy of that measured AOD reduces when translating it 225 km to Solana to forecast DNI 48 hours later. We then include the GEOS-5 AOD forecasts in one member of an operational forecast system and evaluate it against the other ensemble members that use the aerosol climatology. In clear-sky conditions, including GEOS-5 forecast AOD instead of the Tegen aerosol climatology, reduces the DNI forecast root mean square error by 27% at Solana. We found no significant differences during all-sky conditions because the relatively poor performance during cloudy conditions outweighs the improvements made in clear-sky conditions.
Robust Face Super-Resolution via Position Relation Model Based on Global Face Context

Because Face Super-Resolution (FSR) tends to infer High-Resolution (HR) face image by breaking the given Low- Resolution (LR) image into individual patches and inferring the HR correspondence one patch by one separately, Super- Resolution (SR) of face images with serious degradation, especially with occlusion, is still a challenging problem of the computer vision field. To address this problem, we propose a patch-level face model for FSR, which we called the position relation model. This model consists of the mapping relationships in every face position to the rest of the face positions based on similarity. In other words, we build a constraint for each patch position via the relationship in this model from the global range of face. Once an individual input LR image patch is seriously deteriorated, the substitute patch in whole face range can be sought according to the relationship of the model at this position as the provider of the LR information. In this way, the lost facial structures can be compensated by knowledge located in remote pixels or structure information which leads to better high-resolution face images. The LR images with degradations, not only the serious low-quality degradation, e.g. noise, blur, but also the occlusions, can be effectively hallucinated into HR ones. Quantitative and qualitative evaluations on the public datasets demonstrate that the proposed algorithm performs favorably against state-of-theart methods.
Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification

The subject of this study is three fundamental procedures of contemporary data analysis: outlier detection, clustering and classification. These issues are considered in a conditional approach – the introduction of specific (e.g., current) values to the model allows, in practice, a significantly precise description of the reality under research. The same methodology has been used for all three of the above tasks, and it considerably facilitates the interpretations, potential modifications and practical applications of the material investigated. Using non-parametric methods frees the procedures under investigation from a distribution in the considered dataset. This paper contains a complete set of formulas that allow easy implementation of the presented material in real-world problems.
Reducing Distributional Uncertainty by Mutual Information Maximisation and Transferable Feature Learning

Distributional uncertainty exists broadly in many real-world applications, one of which in the form of domain discrepancy. Yet in the existing literature, the mathematical definition of it is missing. In this paper, we propose to formulate the distributional uncertainty both between the source(s) and target domain(s) and within each domain using mutual information. Further, to reduce distributional uncertainty (e.g. domain discrepancy), we (1) maximise the mutual information between source and target domains and (2) propose a transferable feature learning scheme, balancing two complementary and discriminative feature learning processes (general texture learning and self-supervised transferable shape learning) according to the uncertainty. We conduct extensive experiments on both domain adaption and domain generalisation using challenging common benchmarks: Office-Home and DomainNet. Results show the great effectiveness of the proposed method and its superiority over the state-of-the-art methods.
Robust tracking algorithm for infrared target via correlation filter and particle filter

To overcome the shortcomings of low signal-to-noise ratio and less available information of infrared images, as well as the challenges of fast camera motion and partial occlusion, a robust tracker via correlation filter and particle filter is proposed for infrared target. Firstly, to explore the strength of the particle-filter-based tracker, a Lp-norm based low-rank sparse tracker is proposed. Then, a robust tracker is proposed by complementing the advantages of both correlation-filter-based and particle-filter-based trackers, which can not only handle the camera motion challenge, but also improve tracking accuracy and robustness. Finally, to address the tracking drift problem and deal with the partial occlusion challenge, an effective template update approach is designed according to different characteristics of correlation-filter-based and particle-filter-based trackers. Experimental results on the VOT-TIR2015 benchmark set demonstrate that the proposed tracker can not only outperform several state-of-the-art trackers in terms of both accuracy and robustness, but also effectively handle the challenges such as camera motion, partial occlusion, size change and motion change.
Biomedical document triage using a hierarchical attention-based capsule network

Abstract Background Biomedical document triage is the foundation of biomedical information extraction, which is important to precision medicine. Recently, some neural networks-based methods have been proposed to classify biomedical documents automatically. In the biomedical domain, documents are often very long and often contain very complicated sentences. However, the current methods still find it difficult to capture important features across sentences. Results In this paper, we propose a hierarchical attention-based capsule model for biomedical document triage. The proposed model effectively employs hierarchical attention mechanism and capsule networks to capture valuable features across sentences and construct a final latent feature representation for a document. We evaluated our model on three public corpora. Conclusions Experimental results showed that both hierarchical attention mechanism and capsule networks are helpful in biomedical document triage task. Our method proved itself highly competitive or superior compared with other state-of-the-art methods.
Internet Of Things and women’s health

The Internet of Things (IoT) is a system of interrelated computing devices with unique identifiers and the ability to transfer data over a network without human-to-human or human-to-computer intera...
Rogue device discrimination in ZigBee networks using wavelet transform and autoencoders

Abstract In modern wireless systems such as ZigBee, sensitive information which is produced by the network is transmitted through different wired or wireless nodes. Providing the requisites of communication between diverse communication system types, such as mobiles, laptops, and desktop computers, does increase the risk of being attacked by outside nodes. Malicious (or unintentional) threats, such as trying to obtain unauthorized accessibility to the network, increase the requirements of data security against the rogue devices trying to tamper with the identity of authorized devices. In such manner, focusing on Radio Frequency Distinct Native Attributes (RF-DNA) of features extracted from physical layer responses (referred to as preambles) of ZigBee devices, a dataset of distinguishable features of all devices can be produced which can be exploited for the detection and rejection of spoofing/rogue devices. Through this procedure, distinction of devices manufactured by the different/same producer(s) can be realized resulting in an improvement of classification system accuracy. The two most challenging problems in initiating RF-DNA are (1) the mechanism of features extraction in the generation of a dataset in the most effective way for model classification and (2) the design of an efficient model for device discrimination of spoofing/rogue devices. In this paper, we analyze the physical layer features of ZigBee devices and present methods based on deep learning algorithms to achieve high classification accuracy, based on wavelet decomposition and on the autoencoder representation of the original dataset.
Move&amp;Find: The Value of Kinaesthetic Experience in a Casual Data Representation

The value of a data representation is traditionally judged based on aspects like effectiveness and efficiency that are important in utilitarian or work-related contexts. Most multisensory data representations, however, are employed in casual contexts where creativity, affective, physical, intellectual, and social engagement might be of greater value. We introduce Move&Find, a multisensory data representation in which people pedalled on a bicycle to exert the energy required to power a search query on Google's servers. To evaluate Move&Find, we operationalized a framework suitable to evaluate the value of data representations in casual contexts and experimentally compared Move&Find to a corresponding visualization. With Move&Find, participants achieved a higher understanding of the data. Move&Find was judged to be more creative and encouraged more physical and social engagement—components of value that would have been missed using more traditional evaluation frameworks.
Estimating the Size of Branch-and-Bound Trees

This paper investigates the problem of estimating the size of branch-and-bound (B&amp;B) trees for solving mixed-integer programs. We first prove that the size of the B&amp;B tree cannot be approximated within a factor of 2 for general binary programs, unless [Formula: see text]. Second, we review measures of progress of the B&amp;B search, such as the well-known gap and the often-overlooked tree weight, and propose a new measure, which we call leaf frequency. We study two simple ways to transform these progress measures into B&amp;B tree-size estimates, either as a direct projection or via double-exponential smoothing, a standard time-series forecasting technique. We then combine different progress measures and their trends into nontrivial estimates using machine learning techniques, which yield more precise estimates than any individual measure. The best method that we have identified uses all individual measures as features of a random forest model. In a large computational study, we train and validate all methods on the publicly available MIPLIB and Coral general purpose benchmark sets. On average, the best method estimates B&amp;B tree sizes within a factor of 3 on the set of unseen test instances, even during the early stage of the search, and improves in accuracy as the search progresses. It also achieves a factor of 2 over the entire search on each of the six additional sets of homogeneous instances that we tested. All techniques are available in version 7 of the branch-and-cut framework SCIP. Summary of Contribution: This manuscript develops a method for online estimation of the size of branch-and-bound trees, thereby combining methods of mixed-integer programming and machine learning. We show that high-quality estimations can be obtained using the presented techniques. The methods are also useful in everyday use of branch-and-bound algorithms to obtain approximate search-completion information. The manuscript is accompanied by an extensive online supplement comprising the code used for our simulations and an implementation of all discussed methods in the academic solver SCIP, together with the tools and instructions to train estimators for custom instance sets.
The untyped computational λ-calculus and its intersection type discipline

We study a Curry style type assignment system for untyped λ-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational λ-calculus based on Wadler's variant, without let, and with unit and bind operators. We define a notion of reduction for the calculus and prove it confluent. We then introduce an intersection type system inspired by Barendregt, Coppo and Dezani system for ordinary untyped λ-calculus, establishing type invariance under conversion. Finally, we introduce a notion of convergence, which is precisely related to reduction, and characterize convergent terms via their types.
Automatic fall detection using region-based convolutional neural network

The common classifiers usually used to detect fall incidents depend on building and maintaining complex feature extraction for accurate machine learning tasks. However, these efforts have not succeeded in determining an ideal classifier or feature extraction for fall detection. In this research, we address the feature extraction problem along with the choice of the most appropriate classifier by using deep learning where the most prominent features are learned over the numerous layers of the network. More specifically, a general framework that relies on a faster region-based convolutional neural network was designed and developped to recognize the fall incidents. In particular, we designed three custom architectures and exploited transfer learning by using pre-trained networks such as the VGG-16 and AlexNet to overcome the fall detection challenge. The performance of the proposed networks showed the advantage of the pre-trained networks, where VGG-16 scored highest in those measures followed by AlexNet, the custom networks showed impressive results that were close to the pre-trained networks.
A Hybrid KNN algorithm with Sugeno measure for the personal credit reference system in China

Ever increasing ordinal variables are being collected by the Personal Credit Reference System in China, however this system suffers from analysis of this kind of data, which cannot be calculated by Euclidean distance. In this study, we put forward a hybrid KNN algorithm based on Sugeno measure, and we prove that the error of this algorithm is smaller than that of Euclidean distance, furthermore, we use real data obtained from the Personal Credit Reference System to perform experiments and get the user’s initial portrait. Through the comparisons with Kmeans algorithm and other different distance measures in KNN algorithm, we find that the hybrid KNN algorithm is more suitable for clustering personal credit data.
Photometric Stereo-Based Depth Map Reconstruction for Monocular Capsule Endoscopy

The capsule endoscopy robot can only use monocular vision due to the dimensional limit. To improve the depth perception of the monocular capsule endoscopy robot, this paper proposes a photometric stereo-based depth map reconstruction method. First, based on the characteristics of the capsule endoscopy robot system, a photometric stereo framework is established. Then, by combining the specular property and Lambertian property of the object surface, the depth of the specular highlight point is estimated, and the depth map of the whole object surface is reconstructed by a forward upwind scheme. To evaluate the precision of the depth estimation of the specular highlight region and the depth map reconstruction of the object surface, simulations and experiments are implemented with synthetic images and pig colon tissue, respectively. The results of the simulations and experiments show that the proposed method provides good precision for depth map reconstruction in monocular capsule endoscopy.
A generic construction for revocable identity-based encryption with subset difference methods

To deal with dynamically changing user's credentials in identity-based encryption (IBE), providing an efficient key revocation method is a very important issue. Recently, Ma and Lin proposed a generic method of designing a revocable IBE (RIBE) scheme that uses the complete subtree (CS) method by combining IBE and hierarchical IBE (HIBE) schemes. In this paper, we propose a new generic method for designing an RIBE scheme that uses the subset difference (SD) method instead of using the CS method. In order to use the SD method, we generically design an RIBE scheme by combining IBE, identity-based revocation (IBR), and two-level HIBE schemes. If the underlying IBE, IBR, and HIBE schemes are adaptively (or selectively) secure, then our RIBE scheme is also adaptively (or selectively) secure. In addition, we show that the layered SD (LSD) method can be applied to our RIBE scheme and a chosen-ciphertext secure RIBE scheme also can be designed generically.