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. [ABSTRACT FROM AUTHOR]

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 . It is also the basis of the Wrapped library (version 2.0), see . A third package making use of the AdequacyModel library can be found in . 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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper proposes a new quantum-like method for the binary classification applied to classical datasets. Inspired by the quantum Helstrom measurement, this innovative approach has enabled us to define a new classifier, called Helstrom Quantum Centroid (HQC). This binary classifier (inspired by the concept of distinguishability between quantum states) acts on density matrices—called density patterns—that are the quantum encoding of classical patterns of a dataset. In this paper we compare the performance of HQC with respect to twelve standard (linear and non-linear) classifiers over fourteen different datasets. The experimental results show that HQC outperforms the other classifiers when compared to the Balanced Accuracy and other statistical measures. Finally, we show that the performance of our classifier is positively correlated to the increase in the number of “quantum copies” of a pattern and the resulting tensor product thereof. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper reports on themes that arose in an investigation of university lecturers' views on the teaching of linear algebra. This focus on themes was the initial part of a study concentrating on four areas: What is important to teach in a first course in linear algebra? Are there teaching methods which are particularly suited for such a course? Are there tools that should/should not be used; and do the answers to these questions vary according to the degree (Engineering or Mathematics) the students follow? Questionnaire data was coded using thematic analysis which generated 11 themes related to the four questions above. The Results section presents the themes. The Discussion section considers the themes as a whole; splits – dualities – in teaching linear algebra; students' challenges with abstraction; aspects of doing mathematics; and pedagogical issues. [ABSTRACT FROM AUTHOR]

Several network features and information retrieval methods have been proposed to elucidate the structure of citation networks and to detect important nodes. However, it is difficult to retrieve information related to trends in an academic field and to detect cutting-edge areas from the citation network. In this paper, we propose a novel framework that detects the trend as the growth direction of a citation network using network representation learning(NRL). We presume that the linear growth of citation network in latent space obtained by NRL is the result of the iterative edge additional process of a citation network. On APS datasets and papers of some domains of the Web of Science, we confirm the existence of trends by observing that an academic field grows in a specific direction linearly in latent space. Next, we calculate each node’s degree of trend-following as an indicator called the intrinsic publication year (IPY). As a result, there is a correlation between the indicator and the number of future citations. Furthermore, a word frequently used in the abstracts of cutting-edge papers (high-IPY paper) is likely to be used often in future publications. These results confirm the validity of the detected trend for predicting citation network growth. [ABSTRACT FROM AUTHOR]

This paper is concerned with the potential multistability of protein concentrations in the cell. That is, situations where one, or a family of, proteins may sit at one of two or more different steady state concentrations in otherwise identical cells, and in spite of them being in the same environment. For models of multisite protein phosphorylation for example, in the presence of excess substrate, it has been shown that the achievable number of stable steady states can increase linearly with the number of phosphosites available. In this paper, we analyse the consequences of adding enzyme docking to these and similar models, with the resultant sequestration of phosphatase and kinase by the fully unphosphorylated and by the fully phosphorylated substrates respectively. In the large molecule numbers limit, where deterministic analysis is applicable, we prove that there are always values for these rates of sequestration which, when exceeded, limit the extent of multistability. For the models considered here, these numbers are much smaller than the affinity of the enzymes to the substrate when it is in a modifiable state. As substrate enzyme-sequestration is increased, we further prove that the number of steady states will inevitably be reduced to one. For smaller molecule numbers a stochastic analysis is more appropriate, where multistability in the large molecule numbers limit can manifest itself as multimodality of the probability distribution; the system spending periods of time in the vicinity of one mode before jumping to another. Here, we find that substrate enzyme sequestration can induce bimodality even in systems where only a single steady state can exist at large numbers. To facilitate this analysis, we develop a weakly chained diagonally dominant M-matrix formulation of the Chemical Master Equation, allowing greater insights in the way particular mechanisms, like enzyme sequestration, can shape probability distributions and therefore exhibit different behaviour across different regimes. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The European Emission Trading System (EU ETS) is commonly regarded as the key pillar of the European climate policy and as the main unifying tool to create a unique carbon price all over Europe. The UK has always played a crucial role in the EU ETS, being one of the most active national registry and a crucial hub for the exchange of allowances in the market. Brexit, therefore, could deeply modify the number and directions of such exchanges as well as the centrality of the other countries in this system. To investigate these issues, the present paper exploits network analysis tools to compare the structure of the EU ETS market in its first two phases with and without the UK, investigating a few different scenarios that might emerge from a possible reallocation of the transactions that have involved UK partners. We find that without the UK the EU ETS network would become in general much more homogeneous, though results may change focusing on the type of accounts involved in the transactions. [ABSTRACT FROM AUTHOR]

In this paper, we explore the problem of establishing a network among the stocks of a market at high frequency level and give an application to program trading. Our work uses high frequency data from the National Stock Exchange, India, for the year 2014. To begin, we analyse the spectrum of the correlation matrix to establish the presence of linear relations amongst the stock returns. A comparison of correlations with pairwise mutual information shows the further existence of non-linear relations which are not captured by correlation. We also see that the non-linear relations are more pronounced at the high frequency level in comparison to the daily returns used in earlier work. We provide two applications of this approach. First, we construct minimal spanning trees for the stock network based on mutual information and study their topology. The year 2014 saw the conduct of general elections in India and the data allows us to explore their impact on aspects of the network, such as the scale-free property and sectorial clusters. Second, having established the presence of non-linear relations, we would like to be able to exploit them. Previous authors have suggested that peripheral stocks in the network would make good proxies for the Markowitz portfolio but with a much smaller number of stocks. We show that peripheral stocks selected using mutual information perform significantly better than ones selected using correlation. [ABSTRACT FROM AUTHOR]

The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman’s eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data sets were simulated to fit known factor structures, with the data sets varying across different criteria: number of factors (2 and 4), number of items (5 and 10), sample size (100, 500, 1000 and 5000) and correlation between factors (orthogonal, .20, .50 and .70), resulting in 64 different conditions. For each condition, 500 data sets were simulated using lavaan. The result shows that the EGA performs comparable to parallel analysis, EBIC, eBIC and to Kaiser-Guttman rule in a number of situations, especially when the number of factors was two. However, EGA was the only technique able to correctly estimate the number of dimensions in the four-factor structure when the correlation between factors were .7, showing an accuracy of 100% for a sample size of 5,000 observations. Finally, the EGA was used to estimate the number of factors in a real dataset, in order to compare its performance with the other six techniques tested in the simulation study. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The reuse of business processes (BPs) requires similarities between them to be suitably identified. Various approaches have been introduced to address this problem, but many of them feature a high computational cost and a low level of automation. This paper presents a clustering algorithm that groups business processes retrieved from a multimodal search system (based on textual and structural information). The algorithm is based on Incremental Covering Arrays (ICAs) with different alphabets to determine the possible number of groups to be created for each row of the ICA. The proposed algorithm also incorporates Balanced Bayesian Information Criterion to determine the optimal number of groups and the best solution for each query. Experimental evaluation shows that the use of ICAs with strength four (4) and different alphabets reduces the number of solutions needed to be evaluated and optimizes the number of clusters. The proposed algorithm outperforms other algorithms in various measures (precision, recall, and F-measure) by between 12% and 88%. Friedman and Wilcoxon non-parametric tests gave a 90–95% significance level to the obtained results. Better options of repository search for BPs help companies to reuse them. By thus reusing BPs, managers and analysts can more easily get to know the evolution and trajectory of the company processes, a situation that could be expected to lead to improved managerial and commercial decision making. [ABSTRACT FROM AUTHOR]

Clustering large and complex data sets whose partitions may adopt arbitrary shapes remains a difficult challenge. Part of this challenge comes from the difficulty in defining a similarity measure between the data points that captures the underlying geometry of those data points. In this paper, we propose an algorithm, DCG++ that generates such a similarity measure that is data-driven and ultrametric. DCG++ uses Markov Chain Random Walks to capture the intrinsic geometry of data, scans possible scales, and combines all this information using a simple procedure that is shown to generate an ultrametric. We validate the effectiveness of this similarity measure within the context of clustering on synthetic data with complex geometry, on a real-world data set containing segmented audio records of frog calls described by mel-frequency cepstral coefficients, as well as on an image segmentation problem. The experimental results show a significant improvement on performance with the DCG-based ultrametric compared to using an empirical distance measure. [ABSTRACT FROM AUTHOR]

Owing to the emergence of the Internet and its rapid growth, people can use mobile devices on many social media platforms (blogs, Facebook forums, etc.), and the platforms provide well-known websites for people to express and share their daily activities and ideas on global issues. Many consumers utilize product review websites before making a purchase. Many well-known websites are searched for relevant product reviews and experiences of product use. We can easily collect large amounts of structured and unstructured product data and further analyze the data to determine the desired product information. For this reason, many researchers are gradually focusing on sentiment analysis or opinion exploration (opinion mining) and use this technique to extract and analyze customer opinions and emotions. This paper proposes a sentimental text mining method based on an additional features method to enhance accuracy and reduce implementation time and uses singular value decomposition and principal component analysis for data dimension reduction. This study has four contributions: (1) the proposed algorithm for preprocessing the data for sentiment classification, (2) the additional features to enhance the accuracy of the sentiment classification, (3) the application of singular value decomposition and principal component analysis for data dimension reduction, and (4) the design of five modules based on different features, with or without stemming, to compare the performance results. The experimental results show that the proposed method has better accuracy than other methods and that the proposed method can decrease the implementation time. [ABSTRACT FROM AUTHOR]

The software-defined networking (SDN) paradigm has simplified the management of computer networks by decoupling data and control planes. Moreover, the separation of the data and control planes has transitioned network complexity from traditional devices to controllers; therefore, controllers have become indispensable entities in SDN. Controllers have multiple features and direct the network from a central point and respond to updates to topological changes. However, the supportive capability of these features is strong in one controller but weak in another. Due to several controllers and each controller having a set of features, selecting an optimal SDN controller can be considered to be a multi-criteria decision-making (MCDM) problem. Herein, a two-step approach is proposed for SDN controller selection. First, the controllers are ranked with analytical network process (ANP) according to their qualitative features which influence the performance of these controllers and then a performance comparison is performed to check for the QoS improvement. The controller with a high-weight value from the feature-based comparison is quantitatively analysed by experimental analysis. The main contribution of this paper is checking the applicability of the ANP for controller selection in SDN considering its features and performance analysis in real-world Internet and Brite topologies. The simulation results show that the controller computed through the proposed approach outperforms the controller selected with existing approaches. The selection of an optimum controller with ANP results in a reduction of topology discovery time and delay in the normal and traffic load scenario. Similarly, an increase in throughput with a reasonable utilization of the central processing unit (CPU) is observed for the proposed controller. [ABSTRACT FROM AUTHOR]

The purpose of Fuzzy Comprehensive CS-SVR Model (FCCS-SVR) is to evaluate and monitor the health status of a radar equipment and then keep its safe operation. Due to reasons such as few samples, slow changes and the nonlinear structure of data of fault monitoring signal, the health status evaluation of a radar system is quite difficult. By establishing the evaluation index system of a radar, the combination of AHP method and Entropy weight method is studied in this paper. In order to evaluate the value of health status, several optimization algorithms including PSO, GA, BA and CS are used for optimizing the parameters of SVR model. Meanwhile, in order to avoid the problem that the system is at the edge of the state, a radar health assessment method based on the combination of Fuzzy Comprehensive Evaluation and Cuckoo Search-Support Vector Regression (CS-SVR), which is named as Fuzzy Comprehensive CS-SVR (FCCS-SVR), is further proposed. The result of case analysis reflects that the state evaluation of the radar system is realized. The system performance analysis shows that the use of FCCS-SVR evaluation method provides a high recognition rate and can accurately assess the health status of the radar system. [ABSTRACT FROM AUTHOR]

A new dynamic mode decomposition (DMD) method is introduced for simultaneous system identification and denoising in conjunction with the adoption of an extended Kalman filter algorithm. The present paper explains the extended-Kalman-filter-based DMD (EKFDMD) algorithm which is an online algorithm for dataset for a small number of degree of freedom (DoF). It also illustrates that EKFDMD requires significant numerical resources for many-degree-of-freedom (many-DoF) problems and that the combination with truncated proper orthogonal decomposition (trPOD) helps us to apply the EKFDMD algorithm to many-DoF problems, though it prevents the algorithm from being fully online. The numerical experiments of a noisy dataset with a small number of DoFs illustrate that EKFDMD can estimate eigenvalues better than or as well as the existing algorithms, whereas EKFDMD can also denoise the original dataset online. In particular, EKFDMD performs better than existing algorithms for the case in which system noise is present. The EKFDMD with trPOD, which unfortunately is not fully online, can be successfully applied to many-DoF problems, including a fluid-problem example, and the results reveal the superior performance of system identification and denoising. [ABSTRACT FROM AUTHOR]

Objectives: Professional sporting organisations invest considerable resources collecting and analysing data in order to better understand the factors that influence performance. Recent advances in non-invasive technologies, such as global positioning systems (GPS), mean that large volumes of data are now readily available to coaches and sport scientists. However analysing such data can be challenging, particularly when sample sizes are small and data sets contain multiple highly correlated variables, as is often the case in a sporting context. Multicollinearity in particular, if not treated appropriately, can be problematic and might lead to erroneous conclusions. In this paper we present a novel ‘leave one variable out’ (LOVO) partial least squares correlation analysis (PLSCA) methodology, designed to overcome the problem of multicollinearity, and show how this can be used to identify the training load (TL) variables that influence most ‘end fitness’ in young rugby league players. Methods: The accumulated TL of sixteen male professional youth rugby league players (17.7 ± 0.9 years) was quantified via GPS, a micro-electrical-mechanical-system (MEMS), and players’ session-rating-of-perceived-exertion (sRPE) over a 6-week pre-season training period. Immediately prior to and following this training period, participants undertook a 30–15 intermittent fitness test (30-15IFT), which was used to determine a players ‘starting fitness’ and ‘end fitness’. In total twelve TL variables were collected, and these along with ‘starting fitness’ as a covariate were regressed against ‘end fitness’. However, considerable multicollinearity in the data (VIF >1000 for nine variables) meant that the multiple linear regression (MLR) process was unstable and so we developed a novel LOVO PLSCA adaptation to quantify the relative importance of the predictor variables and thus minimise multicollinearity issues. As such, the LOVO PLSCA was used as a tool to inform and refine the MLR process. Results: The LOVO PLSCA identified the distance accumulated at very-high speed (>7 m·s-1) as being the most important TL variable to influence improvement in player fitness, with this variable causing the largest decrease in singular value inertia (5.93). When included in a refined linear regression model, this variable, along with ‘starting fitness’ as a covariate, explained 73% of the variance in v30-15IFT ‘end fitness’ (p<0.001) and eliminated completely any multicollinearity issues. Conclusions: The LOVO PLSCA technique appears to be a useful tool for evaluating the relative importance of predictor variables in data sets that exhibit considerable multicollinearity. When used as a filtering tool, LOVO PLSCA produced a MLR model that demonstrated a significant relationship between ‘end fitness’ and the predictor variable ‘accumulated distance at very-high speed’ when ‘starting fitness’ was included as a covariate. As such, LOVO PLSCA may be a useful tool for sport scientists and coaches seeking to analyse data sets obtained using GPS and MEMS technologies. [ABSTRACT FROM AUTHOR]

Abstract In this paper, we first characterize the structure of symmetries J such that a projection P is J -contractive. Then the minimal and maximal elements of the symmetries J with P ⁎ J P ⩽ J (or J P ⩾ 0) are given. Moreover, some formulas between P (2 I − P − P ⁎) + (P (2 I − P − P ⁎) − ) and P (P + P ⁎) − (P (P + P ⁎) + ) are established. [ABSTRACT FROM AUTHOR]

Abstract This paper presents strong connections between four variants of the zero forcing number and four variants of the Grundy domination number. These connections bridge the domination problem and the minimum rank problem, providing a linear algebra approach to the domination problem. We show that several Grundy domination type parameters are bounded above by minimum rank type parameters. We also give a method to calculate the L -Grundy domination number by the Grundy total domination number, giving some linear algebra bounds for the L -Grundy domination number. [ABSTRACT FROM AUTHOR]

The traditional image mosaic result based on SIFT feature points extraction, to some extent, has distortion errors: the larger the input image set, the greater the spliced panoramic distortion. To achieve the goal of creating a high-quality panorama, a new and improved algorithm based on the A-KAZE feature is proposed in this paper. This includes changing the way reference image are selected and putting forward a method for selecting a reference image based on the binary tree model, which takes the input image set as the leaf node set of a binary tree and uses the bottom-up approach to construct a complete binary tree. The root node image of the binary tree is the ultimate panorama obtained by stitching. Compared with the traditional way, the novel method improves the accuracy of feature points detection and enhances the stitching quality of the panorama. Additionally, the improved method proposes an automatic image straightening model to rectify the panorama, which further improves the panoramic distortion. The experimental results show that the proposed method cannot only enhance the efficiency of image stitching processing, but also reduce the panoramic distortion errors and obtain a better quality panoramic result. [ABSTRACT FROM AUTHOR]

The current marketing landscape, apart from conventional approaches, consists of campaigns designed especially for launching information diffusion processes within online networks. Associated research is focused on information propagation models, campaign initialization strategies and factors affecting campaign dynamics. In terms of algorithms and performance evaluation, the final coverage represented by the fraction of activated nodes within a target network is usually used. It is not necessarily consistent with the real marketing campaigns using various characteristics and parameters related to coverage, costs, behavioral patterns and time factors for overall evaluation. This paper presents assumptions for a decision support system for multi-criteria campaign planning and evaluation with inputs from agent-based simulations. The results, which are delivered from a simulation model based on synthetic networks in a form of decision scenarios, are verified within a real network. Last, but not least, the study proposes a multi-objective campaign evaluation framework with several campaign evaluation metrics integrated. The results showed that the recommendations generated with the use of synthetic networks applied to real networks delivered results according to the decision makers’ expectation in terms of the used evaluation criteria. Apart from practical applications, the proposed multi-objective approach creates new evaluation possibilities for theoretical studies focused on information spreading processes within complex networks. [ABSTRACT FROM AUTHOR]

The notable increase in the size and dimensions of data have presented challenges for data storage and retrieval. The Bloom filter and its generations, due to efficient space overheads and constant query delays, have been broadly applied to querying memberships of a big data set. However, the Bloom filter and most of the variants regard each element as a 1-dimensional string and adopt multiple different string hashes to project the data. The interesting problem is when the inputs are numerical vectors with high dimensions, it remains unknown whether they can be projected into the Bloom filter in their original format. Furthermore, we investigate whether the projection is random and uniform. To address these problems, this paper presents a new uniform Prime-HD-BKDERhash family and a new Bloom filter (P-HDBF) to retrieve the membership of a big data set with the numerical high dimensions. Since the randomness and uniformity of data mapping determines the performance of the Bloom filter, to verify these properties, we first introduce information entropy. Our theoretical and experimental results show that the P-HDBF can randomly and uniformly map the data in their native formats. Moreover, the P-HDBF provides an efficient solution alternative to implement membership search with space-time overheads. This advantage may be suitable for engineering applications that are resource-constrained or identification of the nuances of the graphics and images. [ABSTRACT FROM AUTHOR]

Purpose: This paper lays the groundwork for linking Hounsfield unit measurements to the International System of Units (SI), ultimately enabling traceable measurements across X-ray CT (XCT) machines. We do this by characterizing a material basis that may be used in XCT reconstruction giving linear combinations of concentrations of chemical elements (in the SI units of mol/m3) which may be observed at each voxel. By implication, linear combinations not in the set are not observable. Methods and materials: We formulated a model for our material basis with a set of measurements of elemental powders at four tube voltages, 80 kV, 100 kV, 120 kV, and 140 kV, on a medical XCT. The samples included 30 small plastic bottles of powders containing various compounds spanning the atomic numbers up to 20, and a bottle of water and one of air. Using the chemical formulas and measured masses, we formed a matrix giving the number of Hounsfield units per (mole per cubic meter) at each tube voltage for each of 13 chemical elements. We defined a corresponding matrix in units we call molar Hounsfield unit (HU) potency, the difference in HU values that an added mole per cubic meter in a given voxel would add to the measured HU value. We built a matrix of molar potencies for each chemical element and tube voltage and performed a singular value decomposition (SVD) on these to formulate our material basis. We determined that the dimension of this basis is two. We then compared measurements in this material space with theoretical measurements, combining XCOM cross section data with the tungsten anode spectral model using interpolating cubic splines (TASMICS), a one-parameter filter, and a simple detector model, creating a matrix similar to our experimental matrix for the first 20 chemical elements. Finally, we compared the model predictions to Hounsfield unit measurements on three XCT calibration phantoms taken from the literature. Results: We predict the experimental HU potency values derived from our scans of chemical elements with our theoretical model built from XCOM data. The singular values and singular vectors of the model and powder measurements are in substantial agreement. Application of the Bayesian Information Criterion (BIC) shows that exactly two singular values and singular vectors describe the results over four tube voltages. We give a good account of the HU values from the literature, measured for the calibration phantoms at several tube voltages for several commercial instruments, compared with our theoretical model without introducing additional parameters. Conclusions: We have developed a two-dimensional material basis that specifies the degree to which individual elements in compounds effect the HU values in XCT images of samples with elements up to atomic number Z = 20. We show that two dimensions is sufficient given the contrast and noise in our experiment. The linear combination of concentrations of elements that can be observed using a medical XCT have been characterized, providing a material basis for use in dual-energy reconstruction. This approach provides groundwork for improved reconstruction and for the link of Hounsfield units to the SI. [ABSTRACT FROM AUTHOR]

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force state-vector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model. [ABSTRACT FROM AUTHOR]

The process of inferring parameter values from experimental data can be a cumbersome task. In addition, the collection of experimental data can be time consuming and costly. This paper covers both these issues by addressing the following question: “Which experimental outputs should be measured to ensure that unique model parameters can be calculated?”. Stated formally, we examine the topic of minimal output sets that guarantee a model’s structural identifiability. To that end, we introduce an algorithm that guides a researcher as to which model outputs to measure. Our algorithm consists of an iterative structural identifiability analysis and can determine multiple minimal output sets of a model. This choice in different output sets offers researchers flexibility during experimental design. Our method can determine minimal output sets of large differential equation models within short computational times. [ABSTRACT FROM AUTHOR]

Background: Regular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA). However, with the ever-increasing scale and complexity of pattern sets, state explosion problem has brought a great challenge to the DFA based regular expression matching. Rule grouping is a direct method to solve the state explosion problem. The original rule set is divided into multiple disjoint groups, and each group is compiled to a separate DFA, thus to significantly restrain the severe state explosion problem when compiling all the rules to a single DFA. Objective: For practical implementation, the total number of DFA states should be as few as possible, thus the data structures of these DFAs can be deployed on fast on-chip memories for rapid access. In addition, to support fast pattern update in some applications, the time cost for grouping should be as small as possible. In this study, we aimed to propose an efficient grouping method, which generates as few states as possible with as little time overhead as possible. Methods: When compiling multiple patterns into a single DFA, the number of DFA states is usually greater than the total number of states when compiling each pattern to a separate DFA. This is mainly caused by the semantic overlaps among different rules. By quantifying the interaction values for each pair of rules, the rule grouping problem can be reduced to the maximum k-cut graph partitioning problem. Then, we propose a heuristic algorithm called the one-step greedy (OSG) algorithm to solve this NP-hard problem. What’s more, a subroutine named the heuristic initialization (HI) algorithm is devised to further optimize the grouping algorithms. Results: We employed three practical rule sets for the experimental evaluation. Results show that the OSG algorithm outperforms the state-of-the-art grouping solutions regarding both the total number of DFA states and time cost for grouping. The HI subroutine also demonstrates its significant optimization effect on the grouping algorithms. Conclusions: The DFA state explosion problem has became the most challenging issue in the regular expression matching applications. Rule grouping is a practical direction by dividing the original rule sets into multiple disjoint groups. In this paper, we investigate the current grouping solutions, and propose a compact and efficient grouping algorithm. Experiments conducted on practical rule sets demonstrate the superiority of our proposal. [ABSTRACT FROM AUTHOR]

Natural disasters like hurricanes, floods or earthquakes can damage power grid devices and create cascading blackouts and islands. The nature of failure propagation and extent of damage, among other factors, is dependent on the structural features of the grid, that are distinct from that of random networks. This paper analyzes the structural vulnerability of real power grids to impending disasters and presents intuitive graphical metrics to quantify the extent of topological damage. We develop two improved graph eigen-value based bounds on the grid vulnerability. Further we study adversarial attacks aimed at weakening the grid’s structural robustness and present three combinatorial algorithms to determine the optimal topological attack. Simulations on power grid networks and comparison with existing work show the improvements of the proposed measures and attack schemes. [ABSTRACT FROM AUTHOR]

Spatiotemporal nonstationarity and autocorrelation are two crucial points in modeling geographical data. Previous studies have demonstrated that geographically and temporally weighted autoregressive (GTWAR) model accounts for both spatiotemporal nonstationarity and autocorrelation simultaneously to estimate house prices. Therefore, this paper proposes a kernel-based GTWAR (KBGTWAR) model by incorporating the basic principle of support vector machine regression into spatially and temporally varying coefficients model. The efficacy of KBGTWAR model is demonstrated through a case study on housing prices in the city of Shenzhen, China, from year 2004 to 2008. Comparing the existing models, KBGTWAR model obtains the lowest value for the residual sum of squares (RSS) and the highest value for the coefficient of determination R2. Moreover, KBGTWAR model improves the goodness of fit of the existing GTWAR model from 12.0 to 4.5 in terms of RSS, from 0.914 to 0.968 in terms of R2 and from 3.84 to 4.45 in terms of F-statistic. The results show that KBGTWAR model provides a comparatively high goodness of fit and sufficient explanatory power for both spatiotemporal nonstationarity and autocorrelation. The results of this study demonstrate that the proposed KBGTWAR model can be used to effectively formulate polices for real estate management. [ABSTRACT FROM AUTHOR]

The paper investigates the effect of preferential gathering sites on urban insurgency in an agent-based model (ABM). The ABM model was proposed in earlier work and has been validated using FBI data. There is a nonlinear tradeoff between the local density of citizens due to the number of preferential gathering sites and the ability of law enforcement officers (LEOs) to adequately patrol that leads to a non-monotonic behavior in the number of large scale outburst of insurgency with respect to the number of gathering sites. The inclusion of a moderate number of sites decreases the number of large-scale outbursts. Having no gathering sites or a large number of gathering sites has a dilutive effect on the number of large-scale outbursts. Thus, this non-monotonicity indicates that a small number of organized units produces a larger insurgency effect than a larger number of distributed units. It is also shown, using Koopman mode analysis, that the spatial morphology of agents due to the gathering sites gives rise to temporal organization of the model dynamics; there is a prominent quasi-periodic component in the number of active and intimidated citizens and in the spatial distribution of the LEOs. [ABSTRACT FROM AUTHOR]

As the basic carrier of air flight operation, air route network (ARN) is of great significance to the smooth operation of flights. However, the waypoint is a core part of the route, so it is an important topic to identify influential waypoints in ARN. In this paper, a method to identify the influence of the node in ARN based on an improved entropy weight (IEW) method is proposed. Then, centrality measures including degree, closeness, betweenness and eigenvector as the multi-attribute of ARN in IEW application. IEW method is used to aggregate the multi-attribute to obtain the evaluation of the influence of each waypoint. To demonstrate the effectiveness of the IEW method, three real ARNs are selected to conduct several experiments with susceptible infected recovered (SIR) model. The results show the efficiency and practicability of the proposed method. [ABSTRACT FROM AUTHOR]

Integrated Information Theory (IIT) has become nowadays the most sensible general theory of consciousness. In addition to very important statements, it opens the door for an abstract (mathematical) formulation of the theory. Given a mechanism in a particular state, IIT identifies a conscious experience with a conceptual structure, an informational object which exists, is composed of identified parts, is informative, integrated and maximally irreducible. This paper introduces a space-time continuous version of the concept of integrated information. To this aim, a graph and a dynamical systems treatment is used to define, for a given mechanism in a state for which a dynamics is settled, an Informational Structure, which is associated to the global attractor at each time of the system. By definition, the informational structure determines all the past and future behavior of the system, possesses an informational nature and, moreover, enriches all the points of the phase space with cause-effect power by means of its associated Informational Field. A detailed description of its inner structure by invariants and connections between them allows to associate a transition probability matrix to each informational structure and to develop a measure for the level of integrated information of the system. [ABSTRACT FROM AUTHOR]

This paper proposes a global approach for the multi-view registration of unordered range scans. Our method starts with the pair-wise registration, where multi-scale descriptor is selected for feature point and the propagation of feature correspondence is accordingly accelerated. Subsequently, we design an effective rule to judge the reliability of these pair-wise registration results. According to the judgment of reliability, we propose a model fusion method, which can utilize reliable results of pair-wise registration to augment the model shape. Finally, multi-view registration can be achieved by operating the pair-wise registration, reliability judgment, and model fusion alternately. The proposed approach can be applied to scene reconstruction and robot mapping. Experimental results conducted on public datasets show that the proposed approach can automatically achieve multi-view registration of unordered range scans. Compared with other related approaches, the proposed approach has superior performances in accuracy and effectiveness. [ABSTRACT FROM AUTHOR]

Interactions between countries originate from diverse aspects such as geographic proximity, trade, socio-cultural habits, language, religions, etc. Geopolitics studies the influence of a country’s geographic space on its political power and its relationships with other countries. This work reveals the potential of Wikipedia mining for geopolitical study. Actually, Wikipedia offers solid knowledge and strong correlations among countries by linking web pages together for different types of information (e.g. economical, historical, political, and many others). The major finding of this paper is to show that meaningful results on the influence of country ties can be extracted from the hyperlinked structure of Wikipedia. We leverage a novel stochastic matrix representation of Markov chains of complex directed networks called the reduced Google matrix theory. For a selected small size set of nodes, the reduced Google matrix concentrates direct and indirect links of the million-node sized Wikipedia network into a small Perron-Frobenius matrix keeping the PageRank probabilities of the global Wikipedia network. We perform a novel sensitivity analysis that leverages this reduced Google matrix to characterize the influence of relationships between countries from the global network. We apply this analysis to two chosen sets of countries (i.e. the set of 27 European Union countries and a set of 40 top worldwide countries). We show that with our sensitivity analysis we can exhibit easily very meaningful information on geopolitics from five different Wikipedia editions (English, Arabic, Russian, French and German). [ABSTRACT FROM AUTHOR]

Sparse spectral clustering (SSC) has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets such as hyperspectral images (HSIs). In this paper, we propose two efficient approximate sparse spectral clustering methods for HSIs clustering in which clustering performance is improved by utilizing local information among the data. Firstly, we construct a smaller representative dataset on which sparse spectral clustering is performed. Then the labels of ground object are extending to whole dataset based on the local information according to two extending strategies. The first one is that the local interpolation is utilized to improve the extension of the clustering result. The other one is that the label extension is turned to a problem of subspace embedding, and is fulfilled by locally linear embedding (LLE). Several experiments on HSIs demonstrated that the proposed algorithms are effective for HSIs clustering. [ABSTRACT FROM AUTHOR]

Railway seat inventory control aims to maximize ticket sale profits by determining a selling policy on the reservation horizon. This paper introduces a dynamic bid price approach in railway seat inventory control problem. Multi-dimensional demand is taken into consideration in modeling the problem, in which passenger transfer is our main focus. A new approximate approach is designed to this problem. Numerical examples are presented to evaluate the efficiency of this approach. Simulation experiments are conducted to verify the impact of transfer under different scenarios. [ABSTRACT FROM AUTHOR]

The logistic coupled map lattices (LCML) have been widely investigated as well as their pattern dynamics. The patterns formation may depend on not only fluctuations of system parameters, but variation of the initial conditions. However, the mathematical discussion is quite few for the effect of initial values so far. The present paper is concerned with the pattern formation for a two-dimensional Logistic coupled map lattice, where any initial value can be linear expressed by corresponding eigenvectors, and patterns formation can be determined by selecting the corresponding eigenvectors. A set of simulations are conducted whose results demonstrate the fact. The method utilized in the present paper could be applied to other discrete systems as well. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Adaptation is a crucial biological function possessed by many sensory systems. Early work has shown that some influential equilibrium models can achieve accurate adaptation. However, recent studies indicate that there are close relationships between adaptation and nonequilibrium. In this paper, we provide an explanation of these two seemingly contradictory results based on Markov models with relatively simple networks. We show that as the nonequilibrium driving becomes stronger, the system under consideration will undergo a phase transition along a fixed direction: from non-adaptation to simple adaptation then to oscillatory adaptation, while the transition in the opposite direction is forbidden. This indicates that although adaptation may be observed in equilibrium systems, it tends to occur in systems far away from equilibrium. In addition, we find that nonequilibrium will improve the performance of adaptation by enhancing the adaptation efficiency. All these results provide a deeper insight into the connection between adaptation and nonequilibrium. Finally, we use a more complicated network model of bacterial chemotaxis to validate the main results of this paper. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper provides a description of how market competitiveness evaluations concerning mechanical equipment can be made in the context of multi-criteria decision environments. It is assumed that, when we are evaluating the market competitiveness, there are limited number of candidates with some required qualifications, and the alternatives will be pairwise compared on a ratio scale. The qualifications are depicted as criteria in hierarchical structure. A hierarchical decision model called PCbHDM was used in this study based on an analysis of its desirable traits. Illustration and comparison shows that the PCbHDM provides a convenient and effective tool for evaluating the market competitiveness of mechanical equipment. The researchers and practitioners might use findings of this paper in application of PCbHDM. [ABSTRACT FROM AUTHOR]

The golden ratio, ϕ = 1.61803…, has often been found in connection with biological phenomena, ranging from spirals in sunflowers to gene frequency. One example where the golden ratio often arises is in self-replication, having its mathematical origins in Fibonacci’s sequence for “rabbit reproduction”. Recently, it has been claimed that ϕ determines the ratio between the number of different nucleobases in human genome. Such empirical examples continue to give credence to the idea that the golden ratio is a universal constant, not only in mathematics but also for biology. In this paper, we employ a general framework for chemically realistic self-replicating reaction systems and investigate whether the ratio of chemical species population follows “universal constants”. We find that many self-replicating systems can be characterised by an algebraic number, which, in some cases, is the golden ratio. However, many other algebraic numbers arise from these systems, and some of them—such as and 1.22074… which is also known as the 3rd lower golden ratio—arise more frequently in self-replicating systems than the golden ratio. The “universal constants” in these systems arise as roots of a limited number of distinct characteristic equations. In addition, these “universal constants” are transient behaviours of self-replicating systems, corresponding to the scenario that the resource inside the system is infinite, which is not always the case in practice. Therefore, we argue that the golden ratio should not be considered as a special universal constant in self-replicating systems, and that the ratios between different chemical species only go to certain numbers under some idealised scenarios. [ABSTRACT FROM AUTHOR]

PCA has been widely used in many fields to detect dominant principle components, but it ignores the information embedded in the remaining components. As a supplement to PCA, we propose the General Component Analysis (GCA). The inverse participation ratios (IPRs) are used to identify the global components (GCs) and localized components (LCs). The mean values of the IPRs derived from the shuffled data are taken as the natural threshold, which is exquisite and novel. In this paper, the Chinese corporate bond market is analyzed as an example. We propose a novel network method to divide time periods based on micro data, which performs better in capturing the time points when the market state switches. As a result, two periods have been obtained. There are two GCs in both periods, which are influenced by terms to maturity and ratings. Besides, there are 382 LCs in Period 1 and 166 LCs in Period 2. In the LC portfolios there are two interesting bond collections which are helpful to understand the thoughts of the investors. One is the supper AAA bond collection which is believed to have implicit governmental guarantees by the investors, and the other is the overcapacity industrial bond collection which is influenced by the supply-side reform led by the Chinese government. GCA is expected to be applied to other complex systems. [ABSTRACT FROM AUTHOR]

Identifying influential nodes is an important topic in many diverse applications, such as accelerating information propagation, controlling rumors and diseases. Many methods have been put forward to identify influential nodes in complex networks, ranging from node centrality to diffusion-based processes. However, most of the previous studies do not take into account overlapping communities in networks. In this paper, we propose an effective method based on network representation learning. The method considers not only the overlapping communities in networks, but also the network structure. Experiments on real-world networks show that the proposed method outperforms many benchmark algorithms and can be used in large-scale networks. [ABSTRACT FROM AUTHOR]

Lack of unallocated spectrum and increasing demand for bandwidth in wireless networks is forcing new devices and technologies to share frequency bands. Spectrum sensing is a key enabler for frequency sharing and there is a large body of existing work on signal detection methods. However a unified methodology that would be suitable for objective comparison of detection methods based on experimental evaluations is missing. In this paper we propose such a methodology comprised of seven steps that can be applied to evaluate methods in simulation or practical experiments. Using the proposed methodology, we perform the most comprehensive experimental evaluation of signal detection methods to date: we compare energy detection, covariance-based and eigenvalue-based detection and cyclostationary detection. We measure minimal detectable signal power, sensitivity to noise power changes and computational complexity using an experimental setup that covers typical capabilities from low-cost embedded to high-end software defined radio devices. Presented results validate our premise that a unified methodology is valuable in obtaining reliable and reproducible comparisons of signal detection methods. [ABSTRACT FROM AUTHOR]

This paper is concerned with the derivation of a well-balanced kinetic scheme to approximate a shallow flow model incorporating non-flat bottom topography and horizontal temperature gradients. The considered model equations, also called as Ripa system, are the non-homogeneous shallow water equations considering temperature gradients and non-uniform bottom topography. Due to the presence of temperature gradient terms, the steady state at rest is of primary interest from the physical point of view. However, capturing of this steady state is a challenging task for the applied numerical methods. The proposed well-balanced kinetic flux vector splitting (KFVS) scheme is non-oscillatory and second order accurate. The second order accuracy of the scheme is obtained by considering a MUSCL-type initial reconstruction and Runge-Kutta time stepping method. The scheme is applied to solve the model equations in one and two space dimensions. Several numerical case studies are carried out to validate the proposed numerical algorithm. The numerical results obtained are compared with those of staggered central NT scheme. The results obtained are also in good agreement with the recently published results in the literature, verifying the potential, efficiency, accuracy and robustness of the suggested numerical scheme. [ABSTRACT FROM AUTHOR]

Recent studies have examined the risk of poverty throughout the life course, but few have considered how transitioning in and out of poverty shape the dynamic heterogeneity and mortality disparities of a cohort at each age. Here we use state-by-age modeling to capture individual heterogeneity in crossing one of three different poverty thresholds (defined as 1×, 2× or 3× the “official” poverty threshold) at each age. We examine age-specific state structure, the remaining life expectancy, its variance, and cohort simulations for those above and below each threshold. Survival and transitioning probabilities are statistically estimated by regression analyses of data from the Health and Retirement Survey RAND data-set, and the National Longitudinal Survey of Youth. Using the results of these regression analyses, we parameterize discrete state, discrete age matrix models. We found that individuals above all three thresholds have higher annual survival than those in poverty, especially for mid-ages to about age 80. The advantage is greatest when we classify individuals based on 1× the “official” poverty threshold. The greatest discrepancy in average remaining life expectancy and its variance between those above and in poverty occurs at mid-ages for all three thresholds. And fewer individuals are in poverty between ages 40-60 for all three thresholds. Our findings are consistent with results based on other data sets, but also suggest that dynamic heterogeneity in poverty and the transience of the poverty state is associated with income-related mortality disparities (less transience, especially of those above poverty, more disparities). This paper applies the approach of age-by-stage matrix models to human demography and individual poverty dynamics. In so doing we extend the literature on individual poverty dynamics across the life course. [ABSTRACT FROM AUTHOR]