Search

Recently, computational Grids have proven to be a good solution for processing large-scale, computation intensive problems. However, the heterogeneity, dynamics of resources and diversity of applications requirements have always been important factors affecting their performance. In response to these challenges, this work first builds a Grid job scheduling architecture that can dynamically monitor Grid computing center resources and make corresponding scheduling decisions. Second, a Grid job model is proposed to describe the application requirements. Third, this paper studies the characteristics of commercial interconnection networks used in Grids and forecast job transmission time. Fourth, this paper proposes an application-aware job scheduling mechanism (AJSM) that includes periodic scheduling flow and a heuristic application-aware deadline constraint job scheduling algorithm. The rigorous performance evaluation results clearly demonstrate that the proposed application-aware job scheduling mechanism can successful schedule more Grid jobs than the existing algorithms. For successful scheduled jobs, our proposed AJSM method is the best algorithm for job average processing time and makespan. [ABSTRACT FROM AUTHOR]

This paper introduces an optimal sizing algorithm for a hybrid renewable energy system using smart grid load management application based on the available generation. This algorithm aims to maximize the system energy production and meet the load demand with minimum cost and highest reliability. This system is formed by photovoltaic array, wind turbines, storage batteries, and diesel generator as a backup source of energy. Demand profile shaping as one of the smart grid applications is introduced in this paper using load shifting-based load priority. Particle swarm optimization is used in this algorithm to determine the optimum size of the system components. The results obtained from this algorithm are compared with those from the iterative optimization technique to assess the adequacy of the proposed algorithm. The study in this paper is performed in some of the remote areas in Saudi Arabia and can be expanded to any similar regions around the world. Numerous valuable results are extracted from this study that could help researchers and decision makers. [ABSTRACT FROM AUTHOR]

In this paper we introduce a novel algorithm, called Exogenous Fitness, to calculate the Fitness of subnational entities and we apply it to the states of Brazil. In the last decade, several indices were introduced to measure the competitiveness of countries by looking at the complexity of their export basket. Tacchella et al (2012) developed a non-monetary metric called Fitness. In this paper, after an overview about Brazil as a whole and the comparison with the other BRIC countries, we introduce a new methodology based on the Fitness algorithm, called Exogenous Fitness. Combining the results with the Gross Domestic Product per capita (GDPp), we look at the dynamics of the Brazilian states in the Fitness-Income plane. Two regimes are distinguishable: one with high predictability and the other with low predictability, showing a deep analogy with the heterogeneous dynamics of the World countries. Furthermore, we compare the ranking of the Brazilian states according to the Exogenous Fitness with the ranking obtained through two other techniques, namely Endogenous Fitness and Economic Complexity Index. [ABSTRACT FROM AUTHOR]

ICD-10(International Classification of Diseases 10th revision) is a classification of a disease, symptom, procedure, or injury. Diseases are often described in patients’ medical records with free texts, such as terms, phrases and paraphrases, which differ significantly from those used in ICD-10 classification. This paper presents an improved approach based on the Longest Common Subsequence (LCS) and semantic similarity for automatic Chinese diagnoses, mapping from the disease names given by clinician to the disease names in ICD-10. LCS refers to the longest string that is a subsequence of every member of a given set of strings. The proposed method of improved LCS in this paper can increase the accuracy of processing in Chinese disease mapping. [ABSTRACT FROM AUTHOR]

Custom bus routes need to be optimized to meet the needs of a customized bus for personalized trips of different passengers. This paper introduced a customized bus routing problem in which trips for each depot are given, and each bus stop has a fixed time window within which trips should be completed. Treating a trip as a virtual stop was the first consideration in solving the school bus routing problem (SBRP). Then, the mixed load custom bus routing model was established with a time window that satisfies its requirement and the result were solved by Cplex software. Finally, a simple network diagram with three depots, four pickup stops, and five delivery stops was structured to verify the correctness of the model, and based on the actual example, the result is that all the buses ran 124.42 kilometers, the sum of kilometers was 10.35 kilometers less than before. The paths and departure times of the different busses that were provided by the model were evaluated to meet the needs of the given conditions, thus providing valuable information for actual work. [ABSTRACT FROM AUTHOR]

This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian Relaxation and local search is proposed and is demonstrated to be both effective and efficient based on computational experiments on random numerical examples with 49, 88, 150 and 263 nodes in the network. A real case study for a 100-city network in Hunan province, China, is presented, based on which the properties of the model are discussed and some managerial insights are analyzed. [ABSTRACT FROM AUTHOR]

Circuity, defined as the ratio of the shortest network distance to the Euclidean distance between one origin–destination (O-D) pair, can be adopted as a helpful evaluation method of indirect degrees of train paths. In this paper, the maximum circuity of the paths of operated trains is set to be the threshold value of the circuity of high-speed train paths. For the shortest paths of any node pairs, if their circuity is not higher than the threshold value, the paths can be regarded as the reasonable paths. With the consideration of a certain relative or absolute error, we cluster the reasonable paths on the basis of their inclusion relationship and the center path of each class represents a passenger transit corridor. We take the high-speed rail (HSR) network in China at the end of 2014 as an example, and obtain 51 passenger transit corridors, which are alternative sets of train paths. Furthermore, we analyze the circuity distribution of paths of all node pairs in the network. We find that the high circuity of train paths can be decreased with the construction of a high-speed railway line, which indicates that the structure of the HSR network in China tends to be more complete and the HSR network can make the Chinese railway network more efficient. [ABSTRACT FROM AUTHOR]

As a sustainable transportation mode, high-speed railway (HSR) has become an efficient way to meet the huge travel demand. However, due to the high acquisition and maintenance cost, it is impossible to build enough infrastructure and purchase enough train-sets. Great efforts are required to improve the transport capability of HSR. The utilization efficiency of train-sets (carrying tools of HSR) is one of the most important factors of the transport capacity of HSR. In order to enhance the utilization efficiency of the train-sets, this paper proposed a train-set circulation optimization model to minimize the total connection time. An innovative two-stage approach which contains segments generation and segments combination was designed to solve this model. In order to verify the feasibility of the proposed approach, an experiment was carried out in the Beijing-Tianjin passenger dedicated line, to fulfill a 174 trips train diagram. The model results showed that compared with the traditional Ant Colony Algorithm (ACA), the utilization efficiency of train-sets can be increased from 43.4% (ACA) to 46.9% (Two-Stage), and 1 train-set can be saved up to fulfill the same transportation tasks. The approach proposed in the study is faster and more stable than the traditional ones, by using which, the HSR staff can draw up the train-sets circulation plan more quickly and the utilization efficiency of the HSR system is also improved. [ABSTRACT FROM AUTHOR]

Although frequent fluctuations in domestic hog prices seriously affect the stability and robustness of the hog supply chain, hog futures (an effective hedging instrument) have not been listed in China. To better understand hog futures market hedging, it is important to study the steady state of intersubjective bidding. This paper uses evolutionary game theory to construct a game model between hedgers and speculators in the hog futures market, and replicator dynamic equations are then used to obtain the steady state between the two trading entities. The results show that the steady state is one in which hedgers adopt a “buy” strategy and speculators adopt a “do not speculate” strategy, but this type of extreme steady state is not easily realized. Thus, to explore the rational proportion of hedgers and speculators in the evolutionary stabilization strategy, bidding processes were simulated using weekly average hog prices from 2006 to 2015, such that the conditions under which hedgers and speculators achieve a steady state could be analyzed. This task was performed to achieve the stability critical point, and we show that only when the value of λ is satisfied and the conditions of hog futures price changes and futures price are satisfied can hedgers and speculators achieve a rational proportion and a stable hog futures market. This market can thus provide a valuable reference for the development of the Chinese hog futures market and the formulation and guidance of relevant departmental policies. [ABSTRACT FROM AUTHOR]

Recently, Pulse Coupled Oscillator (PCO)-based travelling waves have attracted substantial attention by researchers in wireless sensor network (WSN) synchronization. Because WSNs are generally artificial occurrences that mimic natural phenomena, the PCO utilizes firefly synchronization of attracting mating partners for modelling the WSN. However, given that sensor nodes are unable to receive messages while transmitting data packets (due to deafness), the PCO model may not be efficient for sensor network modelling. To overcome this limitation, this paper proposed a new scheme called the Travelling Wave Pulse Coupled Oscillator (TWPCO). For this, the study used a self-organizing scheme for energy-efficient WSNs that adopted travelling wave biologically inspired network systems based on phase locking of the PCO model to counteract deafness. From the simulation, it was found that the proposed TWPCO scheme attained a steady state after a number of cycles. It also showed superior performance compared to other mechanisms, with a reduction in the total energy consumption of 25%. The results showed that the performance improved by 13% in terms of data gathering. Based on the results, the proposed scheme avoids the deafness that occurs in the transmit state in WSNs and increases the data collection throughout the transmission states in WSNs. [ABSTRACT FROM AUTHOR]

As one of data mining techniques, outlier detection aims to discover outlying observations that deviate substantially from the reminder of the data. Recently, the Local Outlier Factor (LOF) algorithm has been successfully applied to outlier detection. However, due to the computational complexity of the LOF algorithm, its application to large data with high dimension has been limited. The aim of this paper is to propose grid-based algorithm that reduces the computation time required by the LOF algorithm to determine the k-nearest neighbors. The algorithm divides the data spaces in to a smaller number of regions, called as a “grid”, and calculates the LOF value of each grid. To examine the effectiveness of the proposed method, several experiments incorporating different parameters were conducted. The proposed method demonstrated a significant computation time reduction with predictable and acceptable trade-off errors. Then, the proposed methodology was successfully applied to real database transaction logs of Korea Atomic Energy Research Institute. As a result, we show that for a very large dataset, the grid-LOF can be considered as an acceptable approximation for the original LOF. Moreover, it can also be effectively used for real-time outlier detection. [ABSTRACT FROM AUTHOR]

This paper explores several data mining and time series analysis methods for predicting the magnitude of the largest seismic event in the next year based on the previously recorded seismic events in the same region. The methods are evaluated on a catalog of 9,042 earthquake events, which took place between 01/01/1983 and 31/12/2010 in the area of Israel and its neighboring countries. The data was obtained from the Geophysical Institute of Israel. Each earthquake record in the catalog is associated with one of 33 seismic regions. The data was cleaned by removing foreshocks and aftershocks. In our study, we have focused on ten most active regions, which account for more than 80% of the total number of earthquakes in the area. The goal is to predict whether the maximum earthquake magnitude in the following year will exceed the median of maximum yearly magnitudes in the same region. Since the analyzed catalog includes only 28 years of complete data, the last five annual records of each region (referring to the years 2006–2010) are kept for testing while using the previous annual records for training. The predictive features are based on the Gutenberg-Richter Ratio as well as on some new seismic indicators based on the moving averages of the number of earthquakes in each area. The new predictive features prove to be much more useful than the indicators traditionally used in the earthquake prediction literature. The most accurate result (AUC = 0.698) is reached by the Multi-Objective Info-Fuzzy Network (M-IFN) algorithm, which takes into account the association between two target variables: the number of earthquakes and the maximum earthquake magnitude during the same year. [ABSTRACT FROM AUTHOR]

Relevance: Popularity-based approaches are widely adopted in music recommendation systems, both in industry and research. These approaches recommend to the target user what is currently popular among all users of the system. However, as the popularity distribution of music items typically is a long-tail distribution, popularity-based approaches to music recommendation fall short in satisfying listeners that have specialized music preferences far away from the global music mainstream. Addressing this gap, the contribution of this article is three-fold. Definition of mainstreaminess measures: First, we provide several quantitative measures describing the proximity of a user’s music preference to the music mainstream. Assuming that there is a difference between the global music mainstream and a country-specific one, we define the measures at two levels: relating a listener’s music preferences to the global music preferences of all users, or relating them to music preferences of the user’s country. To quantify such music preferences, we define a music item’s popularity in terms of artist playcounts (APC) and artist listener counts (ALC). Moreover, we adopt a distribution-based and a rank-based approach as means to decrease bias towards the head of the long-tail distribution. This eventually results in a framework of 6 measures to quantify music mainstream. Differences between countries with respect to music mainstream: Second, we perform in-depth quantitative and qualitative studies of music mainstream in that we (i) analyze differences between countries in terms of their level of mainstreaminess, (ii) uncover both positive and negative outliers (substantially higher and lower country-specific popularity, respectively, compared to the global mainstream), analyzing these with a mixed-methods approach, and (iii) investigate differences between countries in terms of listening preferences related to popular music artists. We conduct our studies and experiments using the standardized LFM-1b dataset, from which we analyze about 800,000,000 listening events shared by about 53,000 users (from 47 countries) of the music streaming platform Last.fm. We show that there are substantial country-specific differences in listeners’ music consumption behavior with respect to the most popular artists listened to. Rating prediction experiments: Third, we demonstrate the applicability of our study results to improve music recommendation systems. To this end, we conduct rating prediction experiments in which we tailor recommendations to a user’s level of preference for the music mainstream using the proposed 6 mainstreaminess measures: defined by a distribution-based or rank-based approach, defined on a global level or on a country level (for the user’s country), and for APC or ALC. Our approach roughly equals a hybrid recommendation approach in which a demographic filtering strategy is implemented before collaborative filtering is performed. Results suggest that, in terms of rating prediction accuracy, each of the presented mainstreaminess definitions has its merits. [ABSTRACT FROM AUTHOR]

Dengue is a national priority disease in Cambodia. The Cambodian National Dengue Surveillance System is based on passive surveillance of dengue-like inpatients reported by public hospitals and on a sentinel, pediatric hospital-based active surveillance system. This system works well to assess trends but the sensitivity of the early warning and time-lag to usefully inform hospitals can be improved. During The ECOnomic development, ECOsystem MOdifications, and emerging infectious diseases Risk Evaluation (ECOMORE) project’s knowledge translation platforms, Cambodian hospital staff requested an early warning tool to prepare for major outbreaks. Our objective was therefore to find adapted tools to improve the early warning system and preparedness. Dengue data was provided by the National Dengue Control Program (NDCP) and are routinely obtained through passive surveillance. The data were analyzed at the provincial level for eight Cambodian provinces during 2008–2015. The R surveillance package was used for the analysis. We evaluated the effectiveness of Bayesian algorithms to detect outbreaks using count data series, comparing the current count to an expected distribution obtained from observations of past years. The analyses bore on 78,759 patients with dengue-like syndromes. The algorithm maximizing sensitivity and specificity for the detection of major dengue outbreaks was selected in each province. The overall sensitivity and specificity were 73% and 97%, respectively, for the detection of significant outbreaks during 2008–2015. Depending on the province, sensitivity and specificity ranged from 50% to 100% and 75% to 100%, respectively. The final algorithm meets clinicians’ and decisionmakers’ needs, is cost-free and is easy to implement at the provincial level. [ABSTRACT FROM AUTHOR]

Background: The development of new diagnostic tools allows for faster detection of both tuberculosis (TB) and multidrug-resistant (MDR) TB and should lead to reduced transmission by earlier initiation of anti TB therapy. The research conducted in the Arkhangelsk region of the Russian Federation in 2012–14 included economic evaluation of Line Probe Assay (LPA) implementation in MDR-TB diagnostics compared to existing culture-based diagnostics of Löwenstein Jensen (LJ) and BacTAlert. Clinical superiority of LPA was demonstrated and results were reported elsewhere. Study aim: The PROVE-IT Russia study aimed to report the outcomes of the cost minimization analysis. Methods: Costs of LPA-based diagnostic algorithm (smear positive (SSm+) and for smear negative (SSm-) culture confirmed TB patients by Bactec MGIT or LJ were compared with conventional culture-based algorithm (LJ–for SSm- and SSm+ patients and BacTAlert–for SSm+ patients). Cost minimization analysis was conducted from the healthcare system, patient and societal perspectives and included the direct and indirect costs to the healthcare system (microscopy and drug susceptibility test (DST), hospitalization, medications obtained from electronic medical records) and non-hospital direct costs (patient’s travel cost, additional expenses associated with hospitalization, supplementary medicine and food) collected at the baseline and two subsequent interviews using the WHO-approved questionnaire. Results: Over the period of treatment the LPA-based diagnostic corresponded to lesser direct and indirect costs comparing to the alternative algorithms. For SSm+ LPA-based diagnostics resulted in the costs 4.5 times less (808.21 US$) than LJ (3593.81 US$) and 2.5 times less than BacTAlert liquid culture (2009.61 US$). For SSm- LPA in combination with Bactec MGIT (1480.75 US$) vs LJ (1785.83 US$) showed the highest cost minimization compared to LJ (2566.09 US$). One-way sensitivity analyses of the key parameters and threshold analyses were conducted and demonstrated that the results were robust to variations in the cost of hospitalization, medications and length of stay. Conclusion: From the perspective of Russian Federation healthcare system, TB diagnostic algorithms incorporating LPA method proved to be both more clinically effective and less expensive due to reduction in the number of hospital days to the correct MDR-TB diagnosis and treatment initiation. LPA diagnostics comparing conventional culture diagnostic algorithm MDR-TB was a cost minimizing strategy for both patients and healthcare system. [ABSTRACT FROM AUTHOR]

Generally, the probabilistic linguistic term set (PLTS) provides more accurate descriptive properties than the hesitant fuzzy linguistic term set does. The probabilistic linguistic preference relation (PLPR), which is applied to deal with complex decision-making problems, can be constructed for PLTSs. However, it is difficult for decision makers to provide the probabilities of occurrence for PLPR. To deal with this problem, we propose a definition of expected consistency for PLPR and establish a probability computing model to derive probabilities of occurrence in PLPR with priority weights for alternatives. A consistency-improving iterative algorithm is presented to examine whether or not the PLPR is at an acceptable consistency. Moreover, the consistency-improving iterative algorithm should obtain the satisfaction consistency level for the unacceptable consistency PLPR. Finally, a real-world employment-city selection is used to demonstrate the effectiveness of the proposed method of deriving priority weights from PLPR. [ABSTRACT FROM AUTHOR]

Romani people are a significant minority in Europe counting about 10 million individuals scattered throughout the continent. They are a migratory group originating from Northwestern India. Their exodus from India occurred approximately 1000–1500 years ago. The migration route of the Romani people was reconstructed with the help of cultural anthropology, linguistics and historical records. Their migration made them through Central Asia, Middle East and the Caucasus region, prior to the arriving into Europe. Yet the significance of these regions, especially of the Caucasus, in Roma ancestry was a rather neglected topic. Contribution of the Caucasus and further affected regions to the ancestry of Roma was investigated based on genome-wide autosomal marker data. 158 European Roma samples and 41 populations from the Caucasus region, from Middle East, Central Asia and from South Asia were considered in our tests. Population structure and ancestry analysis algorithms were applied to investigate the relationship of Roma with these populations. Identical by descent DNA segment analyses and admixture linkage disequilibrium based tests were also applied. Our results suggest that the Caucasus region plays also a significant role in the genetic legacy of Romani people besides the main sources, Europe and South Asia, previously investigated by other population genetic studies. The Middle East and Central Asia seems slightly less important but far from negligible in connection with the sources of Roma ancestry. Our results point out that the Caucasus region and altogether the area of the Caspian and Black Seas had a significant role in the migration of Romani people towards Europe and contributed significantly to the genetic legacy of Roma rival to the European and Indian main sources. [ABSTRACT FROM AUTHOR]

Identifying the abnormally high-risk regions in a spatiotemporal space that contains an unexpected disease count is helpful to conduct surveillance and implement control strategies. The EigenSpot algorithm has been recently proposed for detecting space-time disease clusters of arbitrary shapes with no restriction on the distribution and quality of the data, and has shown some promising advantages over the state-of-the-art methods. However, the main problem with the EigenSpot method is that it cannot be adapted to detect more than one spatiotemporal hotspot. This is an important limitation, since, in reality, we may have multiple hotspots, sometimes at the same level of importance. We propose an extension of the EigenSpot algorithm, called Multi-EigenSpot that is able to handle multiple hotspots by iteratively removing previously detected hotspots and re-running the algorithm until no more hotspots are found. In addition, a visualization tool (heatmap) has been linked to the proposed algorithm to visualize multiple clusters with different colors. We evaluated the proposed method using the monthly data on measles cases in Khyber-Pakhtunkhwa, Pakistan (Jan 2016- Dec 2016), and the efficiency was compared with the state-of-the-art methods: EigenSpot and Space-time scan statistic (SaTScan). The results showed the effectiveness of the proposed method for detecting multiple clusters in a spatiotemporal space. [ABSTRACT FROM AUTHOR]

Development of easily defoliating sugarcane varieties is urgently needed to facilitate efficient mechanical harvesting, reduce production costs, and increase sugar yield in China. In order to quantify the defoliation characteristics of sugarcane, we investigated eight traits in two field experiments with a range of sugarcane varieties at maturity. The length (LSR) and angle (ASR) of the sheath ruptured from the stalk, defoliation force (DF), and self-defoliation (SD) were the traits with the greatest contribution to the quantitative assessment of sugarcane defoliation based on a principal component analysis, which accounted for more than 75% of the cumulative variability. A small set of traits, namely SD, ASR, and DF measured at the 10th leaf were selected as predictors. Using these predictors, 37 out of 38 sugarcane cultivars were correctly classified into three groups (easy, difficult and intermediate in terms of ease of defoliation) that had been clustered based on six traits. These simplified measurements will be applied to screen new lines in the sugarcane breeding program in China. [ABSTRACT FROM AUTHOR]

Background: This study aimed to investigate the spatiotemporal clustering and socio-environmental factors associated with dengue fever (DF) incidence rates at street level in Guangzhou City, China. Methods: Spatiotemporal scan technique was applied to identify the high risk region of DF. Multiple regression model was used to identify the socio-environmental factors associated with DF infection. A Poisson regression model was employed to examine the spatiotemporal patterns in the spread of DF. Results: Spatial clusters of DF were primarily concentrated at the southwest part of Guangzhou City. Age group (65+ years) (Odd Ratio (OR) = 1.49, 95% Confidence Interval = 1.13 to 2.03), floating population (OR = 1.09, 95% CI = 1.05 to 1.15), low-education (OR = 1.08, 95% CI = 1.01 to 1.16) and non-agriculture (OR = 1.07, 95% CI = 1.03 to 1.11) were associated with DF transmission. Poisson regression results indicated that changes in DF incidence rates were significantly associated with longitude (β = -5.08, P<0.01) and latitude (β = -1.99, P<0.01). Conclusions: The study demonstrated that social-environmental factors may play an important role in DF transmission in Guangzhou. As geographic range of notified DF has significantly expanded over recent years, an early warning systems based on spatiotemporal model with socio-environmental is urgently needed to improve the effectiveness and efficiency of dengue control and prevention. [ABSTRACT FROM AUTHOR]

Background: More countries are using verbal autopsy as a part of routine mortality surveillance. The length of time required to complete a verbal autopsy interview is a key logistical consideration for planning large-scale surveillance. Methods: We use the PHMRC shortened questionnaire to conduct verbal autopsy interviews at three sites and collect data on the length of time required to complete the interview. This instrument uses a novel checklist of keywords to capture relevant information from the open response. The open response section is timed separately from the section consisting of closed questions. Results: We found the median time to complete the entire interview was approximately 25 minutes and did not vary substantially by age-specific module. The median time for the open response section was approximately 4 minutes and 60% of interviewees mentioned at least one keyword within the open response section. Conclusions: The length of time required to complete the interview was short enough for large-scale routine use. The open-response section did not add a substantial amount of time and provided useful information which can be used to increase the accuracy of the predictions of the cause of death. The novel checklist approach further reduces the burden of transcribing and translating a large amount of free text. This makes the PHMRC instrument ideal for national mortality surveillance. [ABSTRACT FROM AUTHOR]

The mobility of modern metropolises strongly relies on urban rail transit (URT) systems, and such a heavy dependence causes that even minor service interruptions would make the URT systems unsustainable. This study aims at optimally dispatching the ground feeder-bus to coordinate with the urban rails’ operation for eliminating the effect of unexpected service interruptions in URT corridors. A feeder-bus dispatch planning model was proposed for the collaborative optimization of URT and feeder-bus cooperation under emergency situations and minimizing the total evacuation cost of the feeder-buses. To solve the model, a concept of dummy feeder-bus system is proposed to transform the non-linear model into traditional linear programming (ILP) model, i.e., traditional transportation problem. The case study of Line #2 of Nanjing URT in China was adopted to illustrate the model application and sensitivity analyses of the key variables. The modeling results show that as the evacuation time window increases, the total evacuation cost as well as the number of dispatched feeder-buses decrease, and the dispatched feeder-buses need operate for more times along the feeder-bus line. The number of dispatched feeder-buses does not show an obvious change with the increase of parking spot capacity and time window, indicating that simply increasing the parking spot capacity would cause huge waste for the emergent bus utilization. When the unbalanced evacuation demand exists between stations, the more feeder-buses are needed. The method of this study will contribute to improving transportation emergency management and resource allocation for URT systems. [ABSTRACT FROM AUTHOR]

Traffic congestion varies spatially and temporally. The observation of the formation, propagation and dispersion of network traffic congestion can lead to insights about the network performance, the bottleneck dynamics etc. While many researchers use the traffic flow data to reconstruct the congestion profile, the data missing problem is bypassed. Current methods either omit the missing data or supplement the missing part by average etc. Great error may be introduced during these processes. Rather than simply discarding the missing data, this research regards the data missing event as a result of either the severe congestion which prevent the floating vehicle from entering the congested area, or a type of feature of the resulting traffic flow time series. Hence a new traffic flow operational index time series similarity measurement is expected to be established as a basis of identifying the dynamic network bottleneck. The method first measures the traffic flow operational similarity between pairs of neighboring links, and then the similarity results are used to cluster the spatial-temporal congestion. In order to get the similarity under missing data condition, the measurement is implemented in a two-stage manner: firstly the so called first order similarity is calculated given that the traffic flow variables are bounded both upside and downside; then the first order similarity is aggregated to generate the second order similarity as the output. We implement the method on part of the real-world road network; the results generated are not only consistent with empirical observation, but also provide useful insights. [ABSTRACT FROM AUTHOR]

Background: Analytic measurement of serum tumour markers is one of commonly used methods for cancer risk management in certain areas of the world (e.g. Taiwan). Recently, cancer screening based on multiple serum tumour markers has been frequently discussed. However, the risk–benefit outcomes appear to be unfavourable for patients because of the low sensitivity and specificity. In this study, cancer screening models based on multiple serum tumour markers were designed using machine learning methods, namely support vector machine (SVM), k-nearest neighbour (KNN), and logistic regression, to improve the screening performance for multiple cancers in a large asymptomatic population. Methods: AFP, CEA, CA19-9, CYFRA21-1, and SCC were determined for 20 696 eligible individuals. PSA was measured in men and CA15-3 and CA125 in women. A variable selection process was applied to select robust variables from these serum tumour markers to design cancer detection models. The sensitivity, specificity, positive predictive value (PPV), negative predictive value, area under the curve, and Youden index of the models based on single tumour markers, combined test, and machine learning methods were compared. Moreover, relative risk reduction, absolute risk reduction (ARR), and absolute risk increase (ARI) were evaluated. Results: To design cancer detection models using machine learning methods, CYFRA21-1 and SCC were selected for women, and all tumour markers were selected for men. SVM and KNN models significantly outperformed the single tumour markers and the combined test for men. All 3 studied machine learning methods outperformed single tumour markers and the combined test for women. For either men or women, the ARRs were between 0.003–0.008; the ARIs were between 0.119–0.306. Conclusion: Machine learning methods outperformed the combined test in analysing multiple tumour markers for cancer detection. However, cancer screening based solely on the application of multiple tumour markers remains unfavourable because of the inadequate PPV, ARR, and ARI, even when machine learning methods were incorporated into the analysis. [ABSTRACT FROM AUTHOR]

In this study, an improved Data INterpolating Empirical Orthogonal Functions (DINEOF) algorithm for determination of missing values in a spatio-temporal dataset is presented. Compared with the ordinary DINEOF algorithm, the iterative reconstruction procedure until convergence based on every fixed EOF to determine the optimal EOF mode is not necessary and the convergence criterion is only reached once in the improved DINEOF algorithm. Moreover, in the ordinary DINEOF algorithm, after optimal EOF mode determination, the initial matrix with missing data will be iteratively reconstructed based on the optimal EOF mode until the reconstruction is convergent. However, the optimal EOF mode may be not the best EOF for some reconstructed matrices generated in the intermediate steps. Hence, instead of using asingle EOF to fill in the missing data, in the improved algorithm, the optimal EOFs for reconstruction are variable (because the optimal EOFs are variable, the improved algorithm is called VE-DINEOF algorithm in this study). To validate the accuracy of the VE-DINEOF algorithm, a sea surface temperature (SST) data set is reconstructed by using the DINEOF, I-DINEOF (proposed in 2015) and VE-DINEOF algorithms. Four parameters (Pearson correlation coefficient, signal-to-noise ratio, root-mean-square error, and mean absolute difference) are used as a measure of reconstructed accuracy. Compared with the DINEOF and I-DINEOF algorithms, the VE-DINEOF algorithm can significantly enhance the accuracy of reconstruction and shorten the computational time. [ABSTRACT FROM AUTHOR]

Background: In the Arkhangelsk region of Northern Russia, multidrug-resistant (MDR) tuberculosis (TB) rates in new cases are amongst the highest in the world. In 2014, MDR-TB rates reached 31.7% among new cases and 56.9% among retreatment cases. The development of new diagnostic tools allows for faster detection of both TB and MDR-TB and should lead to reduced transmission by earlier initiation of anti-TB therapy. Study Aim: The PROVE-IT (Policy Relevant Outcomes from Validating Evidence on Impact) Russia study aimed to assess the impact of the implementation of line probe assay (LPA) as part of an LPA-based diagnostic algorithm for patients with presumptive MDR-TB focusing on time to treatment initiation with time from first-care seeking visit to the initiation of MDR-TB treatment rather than diagnostic accuracy as the primary outcome, and to assess treatment outcomes. We hypothesized that the implementation of LPA would result in faster time to treatment initiation and better treatment outcomes. Methods: A culture-based diagnostic algorithm used prior to LPA implementation was compared to an LPA-based algorithm that replaced BacTAlert and Löwenstein Jensen (LJ) for drug sensitivity testing. A total of 295 MDR-TB patients were included in the study, 163 diagnosed with the culture-based algorithm, 132 with the LPA-based algorithm. Results: Among smear positive patients, the implementation of the LPA-based algorithm was associated with a median decrease in time to MDR-TB treatment initiation of 50 and 66 days compared to the culture-based algorithm (BacTAlert and LJ respectively, p<0.001). In smear negative patients, the LPA-based algorithm was associated with a median decrease in time to MDR-TB treatment initiation of 78 days when compared to the culture-based algorithm (LJ, p<0.001). However, several weeks were still needed for treatment initiation in LPA-based algorithm, 24 days in smear positive, and 62 days in smear negative patients. Overall treatment outcomes were better in LPA-based algorithm compared to culture-based algorithm (p = 0.003). Treatment success rates at 20 months of treatment were higher in patients diagnosed with the LPA-based algorithm (65.2%) as compared to those diagnosed with the culture-based algorithm (44.8%). Mortality was also lower in the LPA-based algorithm group (7.6%) compared to the culture-based algorithm group (15.9%). There was no statistically significant difference in smear and culture conversion rates between the two algorithms. Conclusion: The results of the study suggest that the introduction of LPA leads to faster time to MDR diagnosis and earlier treatment initiation as well as better treatment outcomes for patients with MDR-TB. These findings also highlight the need for further improvements within the health system to reduce both patient and diagnostic delays to truly optimize the impact of new, rapid diagnostics. [ABSTRACT FROM AUTHOR]