Search

University scientific research ability is an important indicator to express the strength of universities. In this paper, the evaluation of university scientific research ability is investigated based on the output of sci-tech papers. Four university alliances from North America, UK, Australia, and China, are selected as the case study of the university scientific research evaluation. Data coming from Thomson Reuters InCites are collected to support the evaluation. The work has contributed new framework to the issue of university scientific research ability evaluation. At first, we have established a hierarchical structure to show the factors that impact the evaluation of university scientific research ability. Then, a new MCDM method called D-AHP model is used to implement the evaluation and ranking of different university alliances, in which a data-driven approach is proposed to automatically generate the D numbers preference relations. Next, a sensitivity analysis has been given to show the impact of weights of factors and sub-factors on the evaluation result. At last, the results obtained by using different methods are compared and discussed to verify the effectiveness and reasonability of this study, and some suggestions are given to promote China’s scientific research ability.

The determination of the relation between a number and a numerical interval is one of the core problems in the scientific calculation of privacy protection. The calculation of the relationship between two numbers and a numerical interval to protect privacy is also the basic problem of collaborative computing. It is widely used in data queries, location search and other fields. At present, most of the solutions are still fundamentally limited to the integer level, and there are few solutions at the real number level. To solve these problems, this paper first uses Bernoulli inequality generalization and a monotonic function property to extend the solution to the real number level and designs two new protocols based on the homomorphic encryption scheme, which can not only protect the data privacy of both parties involved in the calculation, but also extend the number domain to real numbers. In addition, this paper designs a solution to the confidential cooperative determination problem between real numbers by using the sign function and homomorphism multiplication. Theoretical analysis shows that the proposed solution is safe and efficient. Finally, some extension applications based on this protocol are given.

In this paper, the authors study the mathematical properties of a class of alternating links called polyhedral links which have been used to model DNA polyhedra. The motivation of such studies is to provide guidance and aid in the research of the properties of certain DNA molecules. For example, such studies can provide characterizations of the structural complexity of DNA molecules. In an earlier work, Cheng and Jin studied the mathematical properties of such polyhedral links and were able to determine the braid index of a double crossover polyhedral link with 4 turn. However, the braid index of a double crossover polyhedral link with 4.5 turn remained an unsolved problem to this date, even though the graphs that admit the double crossover polyhedral links with 4.5 turn have been synthesized. In this paper, we provide a complete formulation of the braid index of a double crossover polyhedral link with an arbitrary turn number. Our approach is more general and it allows us to completely determine the braid indices for a much larger class of links. In the case of the double crossover polyhedral links, our formulation of the braid index is a simple formula based on a simpler graph used as a template to build the double crossover polyhedral links.

In this paper, the algebraic topological characteristics of brain networks composed of electroencephalogram(EEG) signals induced by different quality images were studied, and on that basis, a neurophysiological image quality assessment approach was proposed. Our approach acquired quality perception-related neural information via integrating the EEG collection with conventional image assessment procedures, and the physiologically meaningful brain responses to different distortion-level images were obtained by topological data analysis. According to the validation experiment results, statistically significant discrepancies of the algebraic topological characteristics of EEG data evoked by a clear image compared to that of an unclear image are observed in several frequency bands, especially in the beta band. Furthermore, the phase transition difference of brain network caused by JPEG compression is more significant, indicating that humans are more sensitive to JPEG compression other than Gaussian blur. In general, the algebraic topological characteristics of EEG signals evoked by distorted images were investigated in this paper, which contributes to the study of neurophysiological assessment of image quality.

In the case of a fire, the choice of exit in the highway tunnel is strictly limited by fire location, which seriously affects the evacuation time. A spontaneous or disorderly exit choice might result in a decreased evacuation efficiency and utilization rate of exits. In this paper, we propose a strategy to obtain the optimal exit choice based on fire location during highway tunnel evacuations. In our strategy, first, the vehicle distributions and locations of evacuating occupants are determined in the traffic simulation program VISSIM. The evacuation simulation software BuildingEXODUS is employed to obtain the corresponding parameters of the evacuation process and analyze the impacts of different fire locations on the evacuation time. During the analysis, the optimal productivity statistics (OPS) is selected as the evaluation index. Then, the feature points of the crowding occupants are captured by the fuzzy c-means (FCM) cluster algorithm. Next, based on the feature points, the relationship between the location of the fire and boundary of the optimal exit choice under the optimal OPS is obtained through the polynomial regression model. It is found that the R-squared(R2) and sum of squares for error (SSE) of the polynomial regression model, reflecting the accuracy estimation, are 98.02% and 2.79×10−4, respectively. Moreover, different fire locations impact the evacuation time of tunnel entrance and evacuation passageway. This paper shows that the location of the fire and boundary of optimal exit choice have a negative linear correlation. Taking the fire 110 m away from the evacuation passageway as an example, the OPS of our strategy can be decreased by 35.6% when compared with no strategies. Our proposed strategy could be applied to determine the location of variable evacuation signs to help evacuating occupants make optimal exit choices.

Several lifetime distributions have played an important role to fit survival data. However, for some of these models, the computation of maximum likelihood estimators is quite difficult due to presence of flat regions in the search space, among other factors. Several well-known derivative-based optimization tools are unsuitable for obtaining such estimates. To circumvent this problem, we introduce the AdequacyModel computational library version 2.0.0 for the R statistical environment with two major contributions: a general optimization technique based on the Particle Swarm Optimization (PSO) method (with a minor modification of the original algorithm) and a set of statistical measures for assessment of the adequacy of the fitted model. This library is very useful for researchers in probability and statistics and has been cited in various papers in these areas. It serves as the basis for the Newdistns library (version 2.1) published in an impact journal in the area of computational statistics, see https://CRAN.R-project.org/package=Newdistns. It is also the basis of the Wrapped library (version 2.0), see https://CRAN.R-project.org/package=Wrapped. A third package making use of the AdequacyModel library can be found in https://CRAN.Rproject.org/package=sglg. In addition, the proposed library has proved to be very useful for maximizing log-likelihood functions with complex search regions. The library provides a greater control of the optimization process by introducing a stop criterion based on a minimum number of iterations and the variance of a given proportion of optimal values. We emphasize that the new library can be used not only in statistics but in physics and mathematics as proved in several examples throughout the paper.

Precision point positioning (PPP) is widely used in maritime navigation and other scenarios because it does not require a reference station. In PPP, the satellite clock bias (SCB) cannot be eliminated by differential, thus leading to an increase in positioning error. The prediction accuracy of SCB has become one of the key factors restricting positioning accuracy. Although International GNSS Service (IGS) provides the ultra-rapid ephemeris prediction part (IGU-P), its quality and real-time performance can not meet the practical application. In order to improve the accuracy of PPP, this paper proposes to use the Prophet model to predict SCB. Specifically, SCB sequence is read from the observation part in the ultra-rapid ephemeris (IGU-O) released by IGS. Next, the SCB sequence between adjacent epochs are subtracted to obtain the corresponding SCB single difference sequence. Then using the Prophet model to predict SCB single difference sequence. Finally, the prediction result is substituted into the PPP positioning observation equation to obtain the positioning result. This paper uses the final ephemeris (IGF) published by IGS as a benchmark and compares the experimental results with IGU-P. For the selected four satellites, compared with the results of the IGU-P, the accuracy of SCB prediction of the model in this paper is improved by about 50.3%, 61.7%, 60.4%, and 48.8%. In terms of PPP positioning results, we use Real-time kinematic (RTK) measurements as a benchmark in this paper. Positioning accuracy has increased by 26%, 35%, and 19% in the N, E, and U directions, respectively. The results show that the Prophet model can improve the performance of PPP.

The present paper proposes a novel kernel adaptive filtering algorithm, where each Gaussian kernel is parameterized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of scalar width parameter. In fact, different from conventional kernel adaptive systems, the proposed filter is structured as a superposition of non-isotropic Gaussian kernels, whose non-isotropy makes the filter more flexible. The adaptation algorithm will search for optimal parameters in a wider parameter space. This generalization brings the need of special treatment of parameters that have a geometric structure. In fact, the main contribution of this paper is to establish update rules for precision matrices on the Lie group of SPD matrices in order to ensure their symmetry and positive-definiteness. The parameters of this filter are adapted on the basis of a least-squares criterion to minimize the filtering error, together with an ℓ1-type regularization criterion to avoid overfitting and to prevent the increase of dimensionality of the dictionary. Experimental results confirm the validity of the proposed method.

Complex network theory has been successful at unveiling the topology of the brain and showing alterations to the network structure due to brain disease, cognitive function and behavior. Functional connectivity networks (FCNs) represent different brain regions as the nodes and the connectivity between them as the edges of a graph. Graph theoretic measures provide a way to extract features from these networks enabling subsequent characterization and discrimination of networks across conditions. However, these measures are constrained mostly to binary networks and highly dependent on the network size. In this paper, we propose a novel graph-to-signal transform that overcomes these shortcomings to extract features from functional connectivity networks. The proposed transformation is based on classical multidimensional scaling (CMDS) theory and transforms a graph into signals such that the Euclidean distance between the nodes of the network is preserved. In this paper, we propose to use the resistance distance matrix for transforming weighted functional connectivity networks into signals. Our results illustrate how well-known network structures transform into distinct signals using the proposed graph-to-signal transformation. We then compute well-known signal features on the extracted graph signals to discriminate between FCNs constructed across different experimental conditions. Based on our results, the signals obtained from the graph-to-signal transformation allow for the characterization of functional connectivity networks, and the corresponding features are more discriminative compared to graph theoretic measures.

Aiming at serving the interdisciplinary demand in network science, this paper introduces a new concept for complex networks, named network stiffness, which is extracted from structural engineering by assuming that a complex network behaves similarly with a structured framework. This analogy allows interpreting that a complex network can resist against any cause attempting to induce deformation changes to the network's structure, regardless of whether the network is material or not. Within this framework, this paper examines the context of applying the conceptual analogy of stiffness from the field of structural engineering to network science and then it develops computational approaches capturing different aspects of network stiffness so that to be used in complex network analysis. The implementation of these approaches to a real-world network (global inbound tourism network) shows that stiffness can produce interesting insights to complex network analysis about the factors related to changes caused to the structure and the status of a complex network.

This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study.

As an important factor for improving recommendations, time information has been introduced to model users’ dynamic preferences in many papers. However, the sequence of users’ behaviour is rarely studied in recommender systems. Due to the users’ unique behavior evolution patterns and personalized interest transitions among items, users’ similarity in sequential dimension should be introduced to further distinguish users’ preferences and interests. In this paper, we propose a new collaborative filtering recommendation method based on users’ interest sequences (IS) that rank users’ ratings or other online behaviors according to the timestamps when they occurred. This method extracts the semantics hidden in the interest sequences by the length of users’ longest common sub-IS (LCSIS) and the count of users’ total common sub-IS (ACSIS). Then, these semantics are utilized to obtain users’ IS-based similarities and, further, to refine the similarities acquired from traditional collaborative filtering approaches. With these updated similarities, transition characteristics and dynamic evolution patterns of users’ preferences are considered. Our new proposed method was compared with state-of-the-art time-aware collaborative filtering algorithms on datasets MovieLens, Flixster and Ciao. The experimental results validate that the proposed recommendation method is effective and outperforms several existing algorithms in the accuracy of rating prediction.

Outlier removal is a fundamental data processing task to ensure the quality of scanned point cloud data (PCD), which is becoming increasing important in industrial applications and reverse engineering. Acquired scanned PCD is usually noisy, sparse and temporarily incoherent. Thus the processing of scanned data is typically an ill-posed problem. In the paper, we present a simple and effective method based on two geometrical characteristics constraints to trim the noisy points. One of the geometrical characteristics is the local density information and another is the deviation from the local fitting plane. The local density based method provides a preprocessing step, which could remove those sparse outlier and isolated outlier. The non-isolated outlier removal in this paper depends on a local projection method, which placing those points onto objects. There is no doubt that the deviation of any point from the local fitting plane should be a criterion to reduce the noisy points. The experimental results demonstrate the ability to remove the noisy point from various man-made objects consisting of complex outlier.

The repeated replacement method (RRM) is a Lagrangian meshfree method which we have previously applied to the Euler equations for compressible fluid flow. In this paper we present new enhancements to RRM, and we apply the enhanced method to both linear and nonlinear elasticity. We compare the results of ten test problems to those of analytic solvers, to demonstrate that RRM can successfully simulate these elastic systems without many of the requirements of traditional numerical methods such as numerical derivatives, equation system solvers, or Riemann solvers. We also show the relationship between error and computational effort for RRM on these systems, and compare RRM to other methods to highlight its strengths and weaknesses. And to further explain the two elastic equations used in the paper, we demonstrate the mathematical procedure used to create Riemann and Sedov-Taylor solvers for them, and detail the numerical techniques needed to embody those solvers in code.

In this paper, complex network theory is used to make time-series analysis of key indicators of governance structure and financing data. We analyze scientific listed companies' governance data from 2010 to 2014 and divide them into groups in accordance with the similarity they share. Then we select sample companies to analyze their financing data and explore the influence of governance structure on financing decision and the financing preference they display. This paper reviews relevant laws and regulations of financing from the perspective of law and economics, then proposes reasonable suggestions to consummate the law for the purpose of regulating listed companies' financing. The research provides a reference for making qualitative analysis on companies' financing.

Q is a semi-qualitative methodology to identify typologies of perspectives. It is appropriate to address questions concerning diverse viewpoints, plurality of discourses, or participation processes across disciplines. Perspectives are interpreted based on rankings of a set of statements. These rankings are analysed using multivariate data reduction techniques in order to find similarities between respondents. Discussing the analytical process and looking for progress in Q methodology is becoming increasingly relevant. While its use is growing in social, health and environmental studies, the analytical process has received little attention in the last decades and it has not benefited from recent statistical and computational advances. Specifically, the standard procedure provides overall and arguably simplistic variability measures for perspectives and none of these measures are associated to individual statements, on which the interpretation is based. This paper presents an innovative approach of bootstrapping Q to obtain additional and more detailed measures of variability, which helps researchers understand better their data and the perspectives therein. This approach provides measures of variability that are specific to each statement and perspective, and additional measures that indicate the degree of certainty with which each respondent relates to each perspective. This supplementary information may add or subtract strength to particular arguments used to describe the perspectives. We illustrate and show the usefulness of this approach with an empirical example. The paper provides full details for other researchers to implement the bootstrap in Q studies with any data collection design.

Active Queue Management (AQM) is recommended by Internet Engineering Task Force to mitigate the bufferbloat phenomenon in the Internet. In this paper, we show the results of comprehensive measurements carried out in our university network, in which a device with an AQM algorithm, designed and programmed for this purpose, was running. The implemented AQM algorithm was based on the dropping function, i.e. arriving packets were dropped randomly, with the probability being a function of the queue length. Several different dropping function forms, proposed in the networking literature, were used, in addition to the classic FIFO queue (no AQM). The experiment lasted over a month, during which the state of the network was measured and recorded several thousand times. This made the results independent of the natural fluctuations of the users’ behavior and the network load. Conclusions on the general performance improvement offered by the implemented AQM, as well as the differences in the performance between particular forms of the dropping function, were reached. Some of these conclusions differ from those drawn previously from simulations. This underlines the need for carrying measurements of new AQMs in real, operating networks, with complex, natural traffic.

This paper presents a stable and fast algorithm for independent component analysis with reference (ICA-R). This is a technique for incorporating available reference signals into the ICA contrast function so as to form an augmented Lagrangian function under the framework of constrained ICA (cICA). The previous ICA-R algorithm was constructed by solving the optimization problem via a Newton-like learning style. Unfortunately, the slow convergence and potential misconvergence limit the capability of ICA-R. This paper first investigates and probes the flaws of the previous algorithm and then introduces a new stable algorithm with a faster convergence speed. There are two other highlights in this paper: first, new approaches, including the reference deflation technique and a direct way of obtaining references, are introduced to facilitate the application of ICA-R; second, a new method is proposed that the new ICA-R is used to recover the complete underlying sources with new advantages compared with other classical ICA methods. Finally, the experiments on both synthetic and real-world data verify the better performance of the new algorithm over both previous ICA-R and other well-known methods.

In this paper, we propose designing transportation network topology and traffic distribution under fluctuating conditions using a bio-inspired algorithm. The algorithm is inspired by the adaptive behavior observed in an amoeba-like organism, plasmodial slime mold, more formally known as plasmodium of Physarum plycephalum. This organism forms a transportation network to distribute its protoplasm, the fluidic contents of its cell, throughout its large cell body. In this process, the diameter of the transportation tubes adapts to the flux of the protoplasm. The Physarum algorithm, which mimics this adaptive behavior, has been widely applied to complex problems, such as maze solving and designing the topology of railroad grids, under static conditions. However, in most situations, environmental conditions fluctuate; for example, in power grids, the consumption of electric power shows daily, weekly, and annual periodicity depending on the lifestyles or the business needs of the individual consumers. This paper studies the design of network topology and traffic distribution with oscillatory input and output traffic flows. The network topology proposed by the Physarum algorithm is controlled by a parameter of the adaptation process of the tubes. We observe various rich topologies such as complete mesh, partial mesh, Y-shaped, and V-shaped networks depending on this adaptation parameter and evaluate them on the basis of three performance functions: loss, cost, and vulnerability. Our results indicate that consideration of the oscillatory conditions and the phase-lags in the multiple outputs of the network is important: The building and/or maintenance cost of the network can be reduced by introducing the oscillating condition, and when the phase-lag among the outputs is large, the transportation loss can also be reduced. We use stability analysis to reveal how the system exhibits various topologies depending on the parameter.

This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity.

Accurate inferences of the emotional state of conversation participants can be critical in shaping analysis and interpretation of conversational exchanges. In qualitative analyses of discourse, most labelling of the perceived emotional state of conversation participants is performed by hand, and is limited to selected moments where an analyst may believe that emotional information is valuable for interpretation. This reliance on manual labelling processes can have implications for repeatability and objectivity, both in terms of accuracy, but also in terms of changes in emotional state that might go unnoticed. In this paper we introduce a qualitative discourse analytic support method intended to support the labelling of emotional state of conversational participants over time. We demonstrate the utility of the technique using a suite of well-studied broadcast interviews, taking a particular focus on identifying instances of inter-speaker conflict. Our findings indicate that this two-step machine learning approach can help decode how moments of conflict arise, sustain, and are resolved through the mapping of emotion over time. We show how such a method can provide useful evidence of the change in emotional state by interlocutors which could be useful to prompt and support further in-depth study.

The finite-time stabilization and finite-time H∞ control problems of Port-controlled Hamiltonian (PCH) systems with disturbances and input saturation (IS) are studied in this paper. First, by designing an appropriate output feedback, a strictly dissipative PCH system is obtained and finite-time stabilization result for nominal system is given. Second, with the help of the Hamilton function method and truncation inequality technique, a novel output feedback controller is developed to make the PCH system finite-time stable when IS occurs. Further, a finite-time H∞ controller is designed to attenuate disturbances for PCH systems with IS, and sufficient conditions are presented. Finally, a numerical example and a circuit example are given to reveal the feasibility of the obtained theoretical results.

Cryptographic cloud storage is used to make optimal use of the cloud storage infrastructure to outsource sensitive and mission-critical data. The continuous growth of encrypted data outsourced to cloud storage requires continuous updating. Attacks like file-injection are reported to compromise confidentiality of the user as a consequence of information leakage during update. It is required that dynamic schemes provide forward privacy guarantees. Updates should not leak information to the untrusted server regarding the previously issued queries. Therefore, the challenge is to design an efficient searchable encryption scheme with dynamic updates and forward privacy guarantees. In this paper, a novel private multi-linked dynamic index for encrypted document retrieval namely Pindex is proposed. The multi-linked dynamic index is constructed using probabilistic homomorphic encryption mechanism and secret orthogonal vectors. Full security proofs for correctness and forward privacy in the random oracle model is provided. Experiments on real world Enron dataset demonstrates that our construction is practical and efficient. The security and performance analysis of Pindex shows that the dynamic multi-linked index guarantees forward privacy without significant loss of efficiency.

Current cloud computing causes serious restrictions to safeguarding users’ data privacy. Since users’ sensitive data is submitted in unencrypted forms to remote machines possessed and operated by untrusted service providers, users’ sensitive data may be leaked by service providers. Program obfuscation shows the unique advantages that it can provide for cloud computing. In this paper, we construct an encrypted threshold signature functionality, which can outsource the threshold signing rights of users to cloud server securely by applying obfuscation, while revealing no more sensitive information. The obfuscator is proven to satisfy the average case virtual black box property and existentially unforgeable under the decisional linear (DLIN) assumption and computational Diffie-Hellman (CDH) assumption in the standard model. Moreover, we implement our scheme using the Java pairing-based cryptography library on a laptop.

Data collected in criminal investigations may suffer from: (i) incompleteness, due to the covert nature of criminal organisations; (ii) incorrectness, caused by either unintentional data collection errors and intentional deception by criminals; (iii) inconsistency, when the same information is collected into law enforcement databases multiple times, or in different formats. In this paper we analyse nine real criminal networks of different nature (i.e., Mafia networks, criminal street gangs and terrorist organizations) in order to quantify the impact of incomplete data and to determine which network type is most affected by it. The networks are firstly pruned following two specific methods: (i) random edges removal, simulating the scenario in which the Law Enforcement Agencies (LEAs) fail to intercept some calls, or to spot sporadic meetings among suspects; (ii) nodes removal, that catches the hypothesis in which some suspects cannot be intercepted or investigated. Finally we compute spectral (i.e., Adjacency, Laplacian and Normalised Laplacian Spectral Distances) and matrix (i.e., Root Euclidean Distance) distances between the complete and pruned networks, which we compare using statistical analysis. Our investigation identified two main features: first, the overall understanding of the criminal networks remains high even with incomplete data on criminal interactions (i.e., 10% removed edges); second, removing even a small fraction of suspects not investigated (i.e., 2% removed nodes) may lead to significant misinterpretation of the overall network., Comment: 18 pages, 4 figures, submitted to PLoS ONE Journal

In this paper, we use network approaches to analyze the relations between protein sequence features for the top hierarchical classes of CATH and SCOP. We use fundamental connectivity measures such as correlation (CR), normalized mutual information rate (nMIR), and transfer entropy (TE) to analyze the pairwise-relationships between the protein sequence features, and use centrality measures to analyze weighted networks constructed from the relationship matrices. In the centrality analysis, we find both commonalities and differences between the different protein 3D structural classes. Results show that all top hierarchical classes of CATH and SCOP present strong non-deterministic interactions for the composition and arrangement features of Cystine (C), Methionine (M), Tryptophan (W), and also for the arrangement features of Histidine (H). The different protein 3D structural classes present different preferences in terms of their centrality distributions and significant features.

Leukocyte (white blood cell, WBC) count is an essential factor that physicians use to diagnose infections and provide adequate treatment. Currently, WBC count is determined manually or semi-automatically, which often leads to miscounting. In this paper, we propose an automated method that uses a bioinspired segmentation mimicking the human perception of color. It is based on the claim that a person can locate WBCs in a blood smear image via the high chromatic contrast. First, by applying principal component analysis over RGB, HSV, and L*a*b* spaces, with specific combinations, pixels of leukocytes present high chromatic variance; this results in increased contrast with the average hue of the other blood smear elements. Second, chromaticity is processed as a feature, without separating hue components; this is different to most of the current automation that perform mathematical operations between hue components in an intuitive way. As a result of this systematic method, WBC recognition is computationally efficient, overlapping WBCs are separated, and the final count is more precise. In experiments with the ALL-IDB benchmark, the performance of the proposed segmentation was assessed by comparing the WBC from the processed images with the ground truth. Compared with previous methods, the proposed method achieved similar results in sensitivity and precision and approximately 0.2% higher specificity and 0.3% higher accuracy for pixel classification in the segmentation stage; as well, the counting results are similar to previous works.

Aiming at the problem of prediction accuracy of stochastic volatility series, this paper proposes a method to optimize the grey model(GM(1,1)) from the perspective of residual error. In this study, a new fitting method is firstly used, which combines the wavelet function basis and the least square method to fit the residual data of the true value and the predicted value of the grey model(GM(1,1)). The residual prediction function is constructed by using the fitting method. Then, the prediction function of the grey model(GM(1,1)) is modified by the residual prediction function. Finally, an example of the wavelet residual-corrected grey prediction model (WGM) is obtained. The test results show that the fitting accuracy of the wavelet residual-corrected grey prediction model has irreplaceable advantages.

A great deal of information is contained within archival maps—ranging from historic political boundaries, to mineral resources, to the locations of cultural landmarks. There are many ongoing efforts to preserve and digitize historic maps so that the information contained within them can be stored and analyzed efficiently. A major barrier to such map digitizing efforts is that the geographic location of each map is typically unknown and must be determined through an often slow and manual process known as georeferencing. To mitigate the time costs associated with the georeferencing process, this paper introduces a fully automated method based on map toponym (place name) labels. It is the first study to demonstrate these methods across a wide range of both simulated and real-world maps. We find that toponym-based georeferencing is sufficiently accurate to be used for data extraction purposes in nearly half of all cases. We make our implementation available to the wider research community through fully open-source replication code, as well as an online georeferencing tool, and highlight areas of improvement for future research. It is hoped that the practical implications of this research will allow for larger and more efficient processing and digitizing of map information for researchers, institutions, and the general public.

This paper presents an experimental comparison of four different hierarchical self-tuning regulatory control procedures in enhancing the robustness of the under-actuated systems against bounded exogenous disturbances. The proposed hierarchical control procedure augments the ubiquitous Linear-Quadratic-Regulator (LQR) with an online reconfiguration block that acts as a superior regulator to dynamically adjust the critical weighting-factors of LQR’s quadratic-performance-index (QPI). The Algebraic-Riccati-Equation (ARE) uses these updated weighting-factors to re-compute the optimal control problem, after every sampling interval, to deliver time-varying state-feedback gains. This article experimentally compares four state-of-the-art rule-based online adaptation mechanisms that dynamically restructure the constituent blocks of the ARE. The proposed hierarchical control procedures are synthesized by self-adjusting the (i) controller’s degree-of-stability, (ii) the control-weighting-factor of QPI, (iii) the state-weighting-factors of QPI as a function of “state-error-phases”, and (iv) the state-weighting-factors of QPI as a function of “state-error-magnitudes”. Each adaptation mechanism is formulated via pre-calibrated hyperbolic scaling functions that are driven by state-error-variations. The implications of each mechanism on the controller’s behaviour are analyzed in real-time by conducting credible hardware-in-the-loop experiments on the QNET Rotary-Pendulum setup. The rotary pendulum is chosen as the benchmark platform owing to its under-actuated configuration and kinematic instability. The experimental outcomes indicate that the latter self-adaptive controller demonstrates superior adaptability and disturbances-rejection capability throughout the operating regime.

To alleviate the data sparsity and cold start problems for collaborative filtering in recommendation systems, side information is usually leveraged by researchers to improve the recommendation performance. The utility of knowledge graph regards the side information as part of the graph structure and gives an explanation for recommendation results. In this paper, we propose an enhanced multi-task neighborhood interaction (MNI) model for recommendation on knowledge graphs. MNI explores not only the user-item interaction but also the neighbor-neighbor interactions, capturing a more sophisticated local structure. Besides, the entities and relations are also semantically embedded. And with the cross&compress unit, items in the recommendation system and entities in the knowledge graph can share latent features, and thus high-order interactions can be investigated. Through extensive experiments on real-world datasets, we demonstrate that MNI outperforms some of the state-of-the-art baselines both for CTR prediction and top-N recommendation.

The belief that the target of sexism has shifted from women to men is gaining popularity. Yet despite its potential theoretical and practical importance, the belief that men are now the primary target of sexism has not been systematically defined nor has it been reliably measured. In this paper, we define the belief in sexism shift (BSS) and introduce a scale to measure it. We contend that BSS constitutes a new form of contemporary sexism characterized by the perception that anti-male discrimination is pervasive, that it now exceeds anti-female discrimination, and that it is caused by women’s societal advancement. In four studies (N = 666), we develop and test a concise, one-dimensional, 15-item measure of BSS: the BSS scale. Our findings demonstrate that BSS is related to, yet distinct from other forms of sexism (traditional, modern, and ambivalent sexism). Moreover, our results show that the BSS scale is a stable and reliable measure of BSS across different samples, time, and participant gender. The BSS scale is also less susceptible to social desirability concerns than other sexism measures. In sum, the BSS scale can be a valuable tool to help understand a new and potentially growing type of sexism that may hinder women in unprecedented ways.

Silicene has attracted remarkable attention in the semiconductor research community due to its silicon (Si) nature. It is predicted as one of the most promising candidates for the next generation nanoelectronic devices. In this paper, an efficient non-iterative technique is employed to create the SPICE models for p-type and n-type uniformly doped silicene field-effect transistors (FETs). The current-voltage characteristics show that the proposed silicene FET models exhibit high on-to-off current ratio under ballistic transport. In order to obtain practical digital logic timing diagrams, a parasitic load capacitance, which is dependent on the interconnect length, is attached at the output terminal of the logic circuits. Furthermore, the key circuit performance metrics, including the propagation delay, average power, power-delay product and energy-delay product of the proposed silicene-based logic gates are extracted and benchmarked with published results. The effects of the interconnect length to the propagation delay and average power are also investigated. The results of this work further envisage the uniformly doped silicene as a promising candidate for future nanoelectronic applications.

Public key encryption with equality test enables the user to determine whether two ciphertexts contain the same information without decryption. Therefore, it may serve as promising cryptographic technique for cloud-assisted wireless sensor networks (CWSNs) to maintain data privacy. In this paper, an efficient RSA with equality test algorithm is proposed. The presented scheme also handles the attackers based on their authorization ability. Precisely, the proposed scheme is proved to be one-way against chosen-ciphertext attack security and indistinguishable against chosen ciphertext attacks. Moreover, the experimental evaluations depict that the underlying scheme is efficient in terms of encryption, decryption, and equality testing. Thus, this scheme may be used as a practical solution in context of CWSNs, where the users may compare two ciphertexts without decryption.

International audience; Recommender systems aim to provide users with a selection of items, based on predicting their preferences for items they have not yet rated, thus helping them filter out irrelevant ones from a large product catalogue. Collaborative filtering is a widely used mechanism to predict a particular user's interest in a given item, based on feedback from neighbour users with similar tastes. The way the user's neighbourhood is identified has a significant impact on prediction accuracy. Most methods estimate user proximity from ratings they assigned to co-rated items, regardless of their number. This paper introduces a similarity adjustment taking into account the number of co-ratings. The proposed method is based on a concordance ratio representing the probability that two users share the same taste for a new item. The probabilities are further adjusted by using the Empirical Bayes inference method before being used to weight similarities. The proposed approach improves existing similarity measures without increasing time complexity and the adjustment can be combined with all existing similarity measures. Experiments conducted on benchmark datasets confirmed that the proposed method systematically improved the recommender system's prediction accuracy performance for all considered similarity measures.

In quantum computing, the variational quantum algorithms (VQAs) are well suited for finding optimal combinations of things in specific applications ranging from chemistry all the way to finance. The training of VQAs with gradient descent optimization algorithm has shown a good convergence. At an early stage, the simulation of variational quantum circuits on noisy intermediate-scale quantum (NISQ) devices suffers from noisy outputs. Just like classical deep learning, it also suffers from vanishing gradient problems. It is a realistic goal to study the topology of loss landscape, to visualize the curvature information and trainability of these circuits in the existence of vanishing gradients. In this paper, we calculate the Hessian and visualize the loss landscape of variational quantum classifiers at different points in parameter space. The curvature information of variational quantum classifiers (VQC) is interpreted and the loss function's convergence is shown. It helps us better understand the behavior of variational quantum circuits to tackle optimization problems efficiently. We investigated the variational quantum classifiers via Hessian on quantum computers, starting with a simple 4-bit parity problem to gain insight into the practical behavior of Hessian, then thoroughly analyzed the behavior of Hessian's eigenvalues on training the variational quantum classifier for the Diabetes dataset. Finally, we show how the adaptive Hessian learning rate can influence the convergence while training the variational circuits., Comment: 13 pages, 9 figures

The time needed to evacuate a building depends on many factors. Some are related to people's behavior, while others are related to the physical characteristics of the building. This paper analyzes the historical data of 47 evacuation drills in 15 different university buildings, both academic and residential, involving more than 19 000 persons. We propose the study of the data presented using a dimensionless analysis and statistical regression in order to give a prediction of the ratio between exit time and the number of people evacuated. The results obtained show that this approach could be a useful tool for comparing buildings of this type, and that it represents a promising research topic which can also be extended to other types of buildings.

Our goal in this paper is to study and characterize the interdependency structure of the Mexican Stock Exchange (mainly stocks from BMV) in the period 2000-2019 and provide visualizations which in a one shot provide a big-picture panorama. To this end, we estimate correlation/concentration matrices from different models and then compute metrics from network theory including eigencentralities and network modularity

Presbyopia and myopia research shows a growing interest in ciliary muscle biometry using optical coherence tomography (OCT). Until now, segmentation of the ciliary muscle is often performed manually using either custom-developed programs or image processing software. Here we present a novel software for semi-automatic segmentation of the ciliary muscle. It provides direct import of OCT images in DICOM format, a standardized procedure for segmentation, image distortion correction, the export of anatomical ciliary muscle landmarks, like ciliary muscle apex and scleral spur, as well as a continuous thickness profile of the ciliary muscle as a novel way of analysis. All processing steps are stored as XML files, fostering documentation and reproducibility of research through the possibility of replicating the analysis. Additionally, CilOCT supports batch processing for the automated analysis of large numbers of images and the respective data export to tabulated text files based on the stored XML files. CilOCT was successfully applied in several studies and their results will be summarized in this paper.

Although in observational studies, propensity score matching is the most widely used balancing method, it has received much criticism. The main drawback of this method is that the individuals of the case and control groups are paired in the compressed one-dimensional space of propensity scores. In this paper, such a novel multivariate weighted k-nearest neighbours-based control group selection method is proposed which can eliminate this disadvantage of propensity score matching. The proposed method pairs the elements of the case and control groups in the original vector space of the covariates and the dissimilarities of the individuals are calculated as the weighted distances of the subjects. The weight factors are calculated from a logistic regression model fitted on the status of treatment assignment. The efficiency of the proposed method was evaluated by Monte Carlo simulations on different datasets. Experimental results show that the proposed Weighted Nearest Neighbours Control Group Selection with Error Minimization method is able to select a more balanced control group than the most widely applied greedy form of the propensity score matching method, especially for individuals characterized with few descriptive features.

This paper introduces a measure of the proximity in ideas using unsupervised machine learning. Knowledge transfers are considered a key driving force of innovation and regional economic growth. I explore knowledge relationships by deriving vector space representations of a patent’s abstract text using Document Vectors (Doc2Vec), and using cosine similarity to measure their proximity in ideas space. I illustrate the potential uses of this method with an application to geographic localization in knowledge spillovers. For patents in the same technology field, their normalized text similarity is 0.02-0.05 S.D.s higher if they are located within the same city, compared to patents from other cities. This effect is much smaller than when knowledge transfers are measured using normalized patent citations: local patents receive about 0.23-0.30 S.D.s more local citations than compared to non-local control patents. These findings suggest that the effect of geography on knowledge transfers may be much smaller than the previous literature using citations suggests.

The purpose of this study is to analyze the factorial structure of the Convergence Insufficiency Symptom Survey questionnaire with 15 items, in order to identify latent dimensions that can contribute to a more focused implementation. The questionnaire was self-administered in paper by 183 university students, in the age span of 18 to 30. Both Kaiser-Meyer-Olkin measure and Bartlett's sphericity test were performed to ensure the validity of the factorization. In order to analyze the principal components, factors which obtained eigenvalues greater than 1 were chosen. The extraction of factors was performed after computing a Promax rotation and a Kaiser criterion. In each extracted factor, the internal consistency was used to prove its reliability. Bartlett's sphericity test was statistically significant (p 0.75) in three dimensions. The multivariate statistical analysis of the Convergence Insufficiency Symptom Survey revealed a three-factor structure, so new forms of questionnaire analysis can be designed in order to obtain gains in the management of a symptomatic patient, using 3 subscores, one for each factor, instead of a total score. The factorial structure of the questionnaire can be used with a high level of confidence in future investigations, which aim to assess which dimensions are most affected in each type of visual changes and develop more targeted therapeutic performances.

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.

As eBook readers have expanded on the market, various online eBook markets have arisen as well. Currently, the online eBook market consists of at least publishers and online platform providers and authors, and these actors inevitably incur intermediate costs between them. In this paper, we introduce a blockchain-based eBook market system that enables self-published eBook trading and direct payments from readers to authors without any trusted party; because authors publish themselves and readers purchase directly from authors, neither actor incurs any intermediate costs. However, because of this trustless environment, the validity, ownership and intellectual property of digital contents cannot be verified and protected, and the safety of purchase transactions cannot be ensured. To address these shortcomings, we propose a secure and reliable eBook transaction system that satisfies the following security requirements: (1) verification of the ownership of each eBook, (2) confidentiality of eBook contents, (3) authorization of a right to read a book, (4) authentication of a legitimate purchaser, (5) verification of the validity and integrity of eBook contents, (6) safety of direct purchase transactions, and (7) preventing eBook piracy and illegal distribution. We provide practical cryptographic protocols for the proposed system and analyze the security and simulated performance of the proposed schemes.

Sequence count data are commonly modelled using the negative binomial (NB) distribution. Several empirical studies, however, have demonstrated that methods based on the NB-assumption do not always succeed in controlling the false discovery rate (FDR) at its nominal level. In this paper, we propose a dedicated statistical goodness of fit test for the NB distribution in regression models and demonstrate that the NB-assumption is violated in many publicly available RNA-Seq and 16S rRNA microbiome datasets. The zero-inflated NB distribution was not found to give a substantially better fit. We also show that the NB-based tests perform worse on the features for which the NB-assumption was violated than on the features for which no significant deviation was detected. This gives an explanation for the poor behaviour of NB-based tests in many published evaluation studies. We conclude that non-parametric tests should be preferred over parametric methods. Stijn Hawinkel was funded by Janssen Pharmaceutical Companies of John-son and Johnson. Luc Bijnens is currently employed by Janssen Pharmaceu-tical Companies of Johnson and Johnson. The funders supervised the work and provided suggestions, but had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Hawinkel, S (corresponding author), Univ Ghent, Dept Data Anal & Math Modelling, Ghent, Belgium. stijn.hawinkel@ugent.be

We have previously developed a new theory for pressure dependent outflow from the human eye, and tested the model using experimental data at intraocular pressures above normal eye pressures. In this paper, we use our model to analyze a hypotensive pressure-time dataset obtained following application of a Honan balloon. Here we show that the hypotensive pressure-time data can be successfully analyzed using our proposed pressure dependent outflow model. When the most uncertain initial data point is removed from the dataset, then parameter estimates are close to our previous parameter estimates, but clearly parameter estimates are very sensitive to assumptions. We further show that (i) for a measured intraocular pressure-time curve, the estimated model parameter for whole eye surface hydraulic conductivity is primarily a function of the ocular rigidity, and (ii) the estimated model parameter that controls the rate of decrease of outflow with increasing pressure is primarily a function of the convexity of the monotonic pressure-time curve. Reducing parameter uncertainty could be accomplished using new technologies to obtain higher quality datasets, and by gathering additional data to better define model parameter ranges for the normal eye. With additional research, we expect the pressure dependent outflow analysis described herein may find applications in the differential diagnosis, prognosis and monitoring of the glaucomatous eye.

Zero-determinant (ZD) strategies, a recently found novel class of strategies in repeated games, has attracted much attention in evolutionary game theory. A ZD strategy unilaterally enforces a linear relation between average payoffs of players. Although existence and evolutional stability of ZD strategies have been studied in simple games, their mathematical properties have not been well-known yet. For example, what happens when more than one players employ ZD strategies have not been clarified. In this paper, we provide a general framework for investigating situations where more than one players employ ZD strategies in terms of linear algebra. First, we theoretically prove that a set of linear relations of average payoffs enforced by ZD strategies always has solutions, which implies that incompatible linear relations are impossible. Second, we prove that linear payoff relations are independent of each other under some conditions. These results hold for general games with public monitoring including perfect-monitoring games. Furthermore, we provide a simple example of a two-player game in which one player can simultaneously enforce two linear relations, that is, simultaneously control her and her opponent's average payoffs. All of these results elucidate general mathematical properties of ZD strategies., 19 pages, 2 figures

The development of Web 2.0 and the rapid growth of available data have led to the development of systems, such as recommendation systems (RSs), that can handle the information overload. However, RS performance is severely limited by sparsity and cold-start problems. Thus, this paper aims to alleviate these problems. To realize this objective, a new model is proposed by integrating three sources of information: a user-item matrix, explicit and implicit relationships. The core strategy of this study is to use the multi-step resource allocation (MSRA) method to identify hidden relations in social information. First, explicit social information is used to compute the similarity between each pair of users. Second, for each non-friend pair of users, the MSRA method is applied to determine the probability of their relation. If the probability exceeds a threshold, a new relationship will be established. Then, all sources are incorporated into the Singular Value Decomposition (SVD) method to compute the missing prediction values. Furthermore, the stochastic gradient descent technique is applied to optimize the training process. Additionally, two real datasets, namely, Last.Fm and Ciao, are utilized to evaluate the proposed method. In terms of accuracy, the experiment results demonstrate that the proposed method outperforms eight state-of-the-art approaches: Heats, PMF, SVD, SR, EISR-JC, EISR-CN, EISR-PA and EISR-RAI.

The growing importance of maturity smart cities is currently observed worldwide. The vast majority of smart city models focus on hard domains such as communication and technology infrastructure. Scientists emphasize the need to take into account social capital and the knowledge of residents. The smart cities invest in enhanced openness and transparency data. Mature smart cities use real-time evidences and information to citizens, businesses and visitors. The smart cities are characterized by bottom-down management and civil government. The paper aims to assess the urban smartness of selected European cities based on the ISO 37120 standard. Several research methods including the Multidimensional Statistical Analysis (MSA) were applied. Using the statistical analysis of European smart cities with the implemented ISO 37120 standard, the author tried to fill gaps in the knowledge and to evaluate maturity smart cities. The results of the research have shown that the smart city concept is a viable strategy which contributes to the urban sustainability. The author also found out that urban sustainability frameworks contain a large number of indicators measuring environmental sustainability, the smart city frameworks lack environmental indicators while highlighting social and economic aspects.

Homogeneous Charge Compression Ignition (HCCI) combustion is a potential candidate for dealing with the stringent regulations on vehicle emissions while still providing very good energy efficiency. Despite the promising results obtained in preliminary studies, the lack of autoignition control has delayed its launch in the engine industry. In the development of the HCCI concept, the availability of reliable computer models has proved extremely valuable, due to their flexibility and lower cost compared with experiments using real engines. In order to obtain the best formulation of a fuel surrogate formulated with n-heptane, toluene and cyclohexane that efficiently estimate the autoignition behaviour, regression adjustments are made to the Root-Mean-Square Errors (RMSE) of experimental Starts of Combustion (SOC) from the modeled SOC. The canonical form of the Scheffe polynomials is widely used to fit the data from mixture experiments, however the experimenter might have only partial knowledge. In this paper we present the adaptation of the robust methodology for possibly misspecified blending model and an algorithm to obtain tailor-made optimal designs for mixture experiments, instead of using standard designs which are indiscriminately employed, to make good estimations of the parameters blending model. We maximize the determinant of the mean squared error matrix of the least square estimator over a realistic neighbourhood of the fitted regression mixture model. The maximized determinant is then minimized over the class of possible designs, yielding an optimal design. Thus, the computed desings are robust to the exact form of the true blending model. Standard mixture designs, as the simplex lattice, are around 25% efficient for estimation purposes compared with the designs obtained in this work when deviances from the considered model occur during the experiments. Once an optimal-robust design was selected (based on the level of certainty about model adequacy), we computed the optimal mixture that best reproduces the combustion property to be imitated. Optimal mixtures obtained when the considered model is inadequate agree with the results achieved in empirical studies, which validates the methodology proposed in this work.