Search

Simple Summary: Breast cancer is a significant cause of female cancer-related deaths in the US. Checking how severe the cancer is helps in planning treatment. Modern AI methods are good at grading cancer, but they are not used much in hospitals yet. We developed and utilized ensemble deep learning algorithms for addressing the tasks of classifying (1) breast cancer subtype and (2) breast cancer invasiveness from whole slide image (WSI) histopathology slides. The ensemble models used were based on convolutional neural networks (CNNs) known for extracting distinctive features crucial for accurate classification. In this paper, we provide a comprehensive analysis of these models and the used methodology for breast cancer diagnosis tasks. Cancer diagnosis and classification are pivotal for effective patient management and treatment planning. In this study, a comprehensive approach is presented utilizing ensemble deep learning techniques to analyze breast cancer histopathology images. Our datasets were based on two widely employed datasets from different centers for two different tasks: BACH and BreakHis. Within the BACH dataset, a proposed ensemble strategy was employed, incorporating VGG16 and ResNet50 architectures to achieve precise classification of breast cancer histopathology images. Introducing a novel image patching technique to preprocess a high-resolution image facilitated a focused analysis of localized regions of interest. The annotated BACH dataset encompassed 400 WSIs across four distinct classes: Normal, Benign, In Situ Carcinoma, and Invasive Carcinoma. In addition, the proposed ensemble was used on the BreakHis dataset, utilizing VGG16, ResNet34, and ResNet50 models to classify microscopic images into eight distinct categories (four benign and four malignant). For both datasets, a five-fold cross-validation approach was employed for rigorous training and testing. Preliminary experimental results indicated a patch classification accuracy of 95.31% (for the BACH dataset) and WSI image classification accuracy of 98.43% (BreakHis). This research significantly contributes to ongoing endeavors in harnessing artificial intelligence to advance breast cancer diagnosis, potentially fostering improved patient outcomes and alleviating healthcare burdens. [ABSTRACT FROM AUTHOR]

Background. In April 2008, experts reviewed updates on sexually transmitted disease (STD) prevention and treatment in preparation for the revision of the Centers for Disease Control and Prevention (CDC) STD Treatment Guidelines. This included a review of cervical cancer screening in the STD clinical setting. Methods. Key questions were identified with assistance from an expert panel. Reviews of the literature were conducted using the PubMed computerized database and shared with the panel. Updated information was incorporated in the 2010 CDC STD Treatment Guidelines. Results. We recommend that STD clinics offering cervical screening services screen and treat women according to guidelines by the American College of Obstetrics and Gynecology, the American Cancer Society, the US Preventive Services Task Force, and the American Society for Colposcopists and Cervical Pathologists. New to the 2010 guidelines are higher age for initiating cervical screening (age ≥21 years) and less frequent intervals of screening (at least every 3 years). New recommendations include new technologies, such as liquid-based cytology and high-risk human papillomavirus (HPV) DNA tests. Liquid-based technologies are not recommended over conventional testing. HPV DNA tests are recommended as adjunct tests and with new indications for use in cervical screening and management. Stronger recommendations were issued for STD clinics offering cervical screening services to have protocols in place for follow-up of test results and referral (eg, colposcopy). Conclusions. Important additions to the 2010 STD Treatment Guidelines include information on updated algorithms for screening and management of women and recommendations for use of liquid-based cytology and high-risk HPV testing. [ABSTRACT FROM AUTHOR]

Background: Cigarette smoking remains the leading cause of preventable disease and death in the United States. Primary care offers an ideal setting to reach adults who smoke cigarettes and improve uptake of evidence-based cessation treatment. Although U.S. Preventive Services Task Force Guidelines recommend the 5As model (Ask, Advise, Assess, Assist, Arrange) in primary care, there are many barriers to its implementation. Automated, comprehensive, and proactive tools are needed to overcome barriers. Our team developed and preliminarily evaluated a proactive electronic visit (e-visit) delivered via the Electronic Health Record patient portal to facilitate evidence-based smoking cessation treatment uptake in primary care, with promising initial feasibility and efficacy. This paper describes the rationale, design, and protocol for an ongoing Hybrid Type I effectiveness-implementation trial that will simultaneously assess effectiveness of the e-visit intervention for smoking cessation as well as implementation potential across diverse primary care settings. Methods: The primary aim of this remote five-year study is to examine the effectiveness of the e-visit intervention vs. treatment as usual (TAU) for smoking cessation via a clinic-randomized clinical trial. Adults who smoke cigarettes are recruited across 18 primary care clinics. Clinics are stratified based on their number of primary care providers and randomized 2:1 to either e-visit or TAU. An initial baseline e-visit gathers information about patient smoking history and motivation to quit, and a clinical decision support algorithm determines the best evidence-based cessation treatment to prescribe. E-visit recommendations are evaluated by a patient's own provider, and a one-month follow-up e-visit assesses cessation progress. Main outcomes include: (1) cessation treatment utilization (medication, psychosocial cessation counseling), (2) reduction in cigarettes per day, and (3) biochemically verified 7-day point prevalence abstinence (PPA) at six-months. We hypothesize that patients randomized to the e-visit condition will have better cessation outcomes (vs. TAU). A secondary aim evaluates e-visit implementation potential at patient, provider, and organizational levels using a mixed-methods approach. Implementation outcomes include acceptability, adoption, fidelity, implementation cost, penetration, and sustainability. Discussion: This asynchronous, proactive e-visit intervention could provide substantial benefits for patients, providers, and primary care practices and has potential to widely improve reach of evidence-based cessation treatment. Trial registration: NCT05493254. [ABSTRACT FROM AUTHOR]

This paper details an approach for accurately machine sorting Library of Congress (LC) call numbers which improves considerably upon other methods reviewed. The authors have employed this sorting method in creating an open-source software tool for library stacks maintenance, possibly the first such application capable of sorting the full range of LC call numbers. The method has potential application to any software environment that stores and retrieves LC call number information. [ABSTRACT FROM AUTHOR]

Primary care physicians (PCPs) play an indispensable role in providing comprehensive care and referring patients for specialty care and other medical services. As the COVID-19 outbreak disrupts patient access to care, understanding the quality of primary care is critical at this unprecedented moment to support patients with complex medical needs in the primary care setting and inform policymakers to redesign our primary care system. The traditional way of collecting information from patient surveys is time-consuming and costly, and novel data collection and analysis methods are needed. In this review paper, we describe the existing algorithms and metrics that use the real-world data to qualify and quantify primary care, including the identification of an individual's likely PCP (identification of plurality provider and major provider), assessment of process quality (for example, appropriate-care-model composite measures), and continuity and regularity of care index (including the interval index, variance index and relative variance index), and highlight the strength and limitation of real world data from electronic health records (EHRs) and claims data in determining the quality of PCP care. The EHR audits facilitate assessing the quality of the workflow process and clinical appropriateness of primary care practices. With extensive and diverse records, administrative claims data can provide reliable information as it assesses primary care quality through coded information from different providers or networks. The use of EHRs and administrative claims data may be a cost-effective analytic strategy for evaluating the quality of primary care. [ABSTRACT FROM AUTHOR]

The computer-assisted resuscitation algorithm (CARA) is the software component of an automatic infusion pump system being designed by US Army’s Walter Reed Institute of Research (WRAIR) to be used in the battlefields of tomorrow. Such medical devices are safety critical, and their use needs to be approved by the US Food and Drug Administration (FDA) – a process on which formal methods can have a great impact. In this special section, six papers on the analysis of CARA’s requirements are presented. In the rest of this introduction, we present the framework and summary of results from those papers. [ABSTRACT FROM AUTHOR]

Colon and rectal cancers are the most common kinds of cancer globally. Colon cancer is more prevalent in men than in women. Early detection increases the likelihood of survival, and treatment significantly increases the likelihood of eradicating the disease. The Surveillance, Epidemiology, and End Results (SEER) programme is an excellent source of domestic cancer statistics. SEER includes nearly 30% of the United States population, covering various races and geographic locations. The data are made public via the SEER website when a SEER limited-use data agreement form is submitted and approved. We investigate data from the SEER programme, specifically colon cancer statistics, in this study. Our objective is to create reliable colon cancer survival and conditional survival prediction algorithms. In this study, we have presented an overview of cancer diagnosis methods and the treatments used to cure cancer. This paper presents an analysis of prediction performance of multiple deep learning approaches. The performance of multiple deep learning models is thoroughly examined to discover which algorithm surpasses the others, followed by an investigation of the network's prediction accuracy. The simulation outcomes indicate that automated prediction models can predict colon cancer patient survival. Deep autoencoders displayed the best performance outcomes attaining 97% accuracy and 95% area under curve-receiver operating characteristic (AUC-ROC). [ABSTRACT FROM AUTHOR]

Algorithmic vision, the computational process of making meaning from digital images or visual information, has changed the relationship between the image and the human subject. In this paper, I explicate on the role of algorithmic vision as a technique of algorithmic governance, the organization of a population by algorithmic means. With its roots in the United States post-war cybernetic sciences, the ontological status of the computational image undergoes a shift, giving way to the hegemonic use of automated facial recognition technologies towards predatory policing and profiling practices. By way of example, I argue that algorithmic vision reconfigures the philosophical links between vision, image, and truth, paradigmatically changing the way a human subject is represented through imagistic data. With algorithmic vision, the relationship between subject and representation challenges the humanistic discourse around images, calling for a critical displacement of the human subject from the center of an analysis of how computational images make meaning. I will explore the relationship between the operative image, the image that acts but is not seen by human eyes, and what Louise Amoore calls an "emergent subject," a subject that is made visible through algorithmic techniques (2013). Algorithmic vision reveals subjects to power in a mode that requires a new approach towards analyzing the entanglement and invisiblization of the human in automated decision-making systems. [ABSTRACT FROM AUTHOR]

In this paper, we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar (GPR) measurements. GPR is one of the most studied and successful modalities for automatic buried threat detection (BTD), and a large variety of BTD algorithms have been proposed for it. Despite this, large-scale comparisons of GPR-based BTD algorithms are rare in the literature. In this paper, we report the results of a multi-institutional effort to develop advanced BTD algorithms for a real-world GPR BTD system. The effort involved five institutions with substantial experience with the development of GPR-based BTD algorithms. In this paper, we report the technical details of the advanced algorithms submitted by each institution, representing their latest technical advances, and many state-of-the-art GPR-based BTD algorithms. We also report the results of evaluating the algorithms from each institution on the large experimental data set used for development. The experimental data set comprised 120 000 m2 of GPR data using surface area, from 13 different lanes across two U.S. test sites. The data were collected using a vehicle-mounted GPR system, the variants of which have supplied data for numerous publications. Using these results, we identify the most successful and common processing strategies among the submitted algorithms, and make recommendations for GPR-based BTD algorithm design. [ABSTRACT FROM AUTHOR]

This paper investigates the possibility of the implementation of Genetic Programming (GP) algorithm on a publicly available COVID-19 data set, in order to obtain mathematical models which could be used for estimation of confirmed, deceased, and recovered cases and the estimation of epidemiology curve for specific countries, with a high number of cases, such as China, Italy, Spain, and USA and as well as on the global scale. The conducted investigation shows that the best mathematical models produced for estimating confirmed and deceased cases achieved R2 scores of 0.999, while the models developed for estimation of recovered cases achieved the R2 score of 0.998. The equations generated for confirmed, deceased, and recovered cases were combined in order to estimate the epidemiology curve of specific countries and on the global scale. The estimated epidemiology curve for each country obtained from these equations is almost identical to the real data contained within the data set [ABSTRACT FROM AUTHOR]

This paper introduces for the first time the concept of Bayesian model averaging (BMA) with multiple prior structures, for rainfall‐runoff modeling applications. The original BMA model proposed by Raftery et al. (2005, https://doi.org.10.1175/MWR2906.1) assumes that the prior probability density function (pdf) is adequately described by a mixture of Gamma and Gaussian distributions. Here we discuss the advantages of using BMA with fixed and flexible prior distributions. Uniform, Binomial, Binomial‐Beta, Benchmark, and Global Empirical Bayes priors along with Informative Prior Inclusion and Combined Prior Probabilities were applied to calibrate daily streamflow records of a coastal plain watershed in the southeast United States. Various specifications for Zellner's g prior including Hyper, Fixed, and Empirical Bayes Local (EBL) g priors were also employed to account for the sensitivity of BMA and derive the conditional pdf of each constituent ensemble member. These priors were examined using the simulation results of conceptual and semidistributed rainfall‐runoff models. The hydrologic simulations were first coupled with a new sensitivity analysis model and a parameter uncertainty algorithm to assess the sensitivity and uncertainty associated with each model. BMA was then used to subsequently combine the simulations of the posterior pdf of each constituent hydrological model. Analysis suggests that a BMA based on combined fixed and flexible priors provides a coherent mechanism and promising results for calculating a weighted posterior probability compared to individual model calibration. Furthermore, the probability of Uniform and Informative Prior Inclusion priors received significantly lower predictive error, whereas more uncertainty resulted from a fixed g prior (i.e., EBL). Plain Language Summary: This study presents a two‐step procedure that includes model calibration of a range of hydrological models using DREAM (zs) algorithm, followed by ensemble prediction of streamflow using Bayesian model averaging (BMA) with various prior structures. The hydrological modeling simulations were first coupled with a new sensitivity analysis model and a parameter uncertainty algorithm to assess the sensitivity and uncertainty associated with each hydrologic model simulation. BMA was then used to subsequently combine the simulations on the most important parts of the posterior probabilities of each constituent hydrological model. Analysis suggests a BMA with fixed and flexible priors provides a coherent mechanism and promising results for calibrating a weighted posterior probability compared to individual model calibration. The hierarchy of prior distributions used in this study increased the flexibility of BMA fitting for daily streamflow simulation and reduced the dependence of posterior and predictive uncertainty (including model probabilities) on prior assumptions of hydrological modeling simulation. Key Points: Bayesian model averaging with fixed and flexible prior structures were applied to combine the posterior probability distribution of four hydrological modelsCustom prior inclusion and uniform prior induced a much sharper posterior medianPutting a prior on both θ and g makes the analysis naturally adaptive and avoids the information paradox [ABSTRACT FROM AUTHOR]

Background: Over the past few decades, numerous forecasting methods have been proposed in the field of epidemic forecasting. Such methods can be classified into different categories such as deterministic vs. probabilistic, comparative methods vs. generative methods, and so on. In some of the more popular comparative methods, researchers compare observed epidemiological data from the early stages of an outbreak with the output of proposed models to forecast the future trend and prevalence of the pandemic. A significant problem in this area is the lack of standard well-defined evaluation measures to select the best algorithm among different ones, as well as for selecting the best possible configuration for a particular algorithm.Results: In this paper we present an evaluation framework which allows for combining different features, error measures, and ranking schema to evaluate forecasts. We describe the various epidemic features (Epi-features) included to characterize the output of forecasting methods and provide suitable error measures that could be used to evaluate the accuracy of the methods with respect to these Epi-features. We focus on long-term predictions rather than short-term forecasting and demonstrate the utility of the framework by evaluating six forecasting methods for predicting influenza in the United States. Our results demonstrate that different error measures lead to different rankings even for a single Epi-feature. Further, our experimental analyses show that no single method dominates the rest in predicting all Epi-features when evaluated across error measures. As an alternative, we provide various Consensus Ranking schema that summarize individual rankings, thus accounting for different error measures. Since each Epi-feature presents a different aspect of the epidemic, multiple methods need to be combined to provide a comprehensive forecast. Thus we call for a more nuanced approach while evaluating epidemic forecasts and we believe that a comprehensive evaluation framework, as presented in this paper, will add value to the computational epidemiology community. [ABSTRACT FROM AUTHOR]

• FDD tools are increasingly adopted in commercial buildings. • Using FDD tools to correct hunting faults can mitigate issues cost-effectively. • We developed and implemented automated control hunting correction in FDD tools. • The algorithm was tested in nine VAV boxes and successfully eliminated hunting faults. • We discussed challenges and future research areas for scaling the technology up. Control hunting due to improper proportional–integral–derivative (PID) parameters in the building automation system (BAS) is one of the most common faults identified in commercial buildings. It can cause suboptimal performance and early failure of heating, ventilation, and air conditioning (HVAC) equipment. Commercial fault detection and diagnostics (FDD) software represents one of the fastest growing market segments in smart building technologies in the United States. Implementation of PID retuning procedures as an auto-correction algorithm and integration into FDD software has the potential to mitigate control hunting across a heterogeneous portfolio of buildings with different BAS in a scalable way. This paper presents the development, implementation, and field testing of an automated control hunting fault correction algorithm based on lambda tuning open-loop rules. The algorithm was developed in a commercial FDD software and successfully tested among nine variable air volume boxes in an office building in the United States. The paper shows the feasibility of using FDD tools to automatically correct control hunting faults, discusses scalability considerations, and proposes a path forward for the HVAC industry and academia to further improve this technology. [ABSTRACT FROM AUTHOR]

The topic of algorithmic fairness is of increasing importance to the Human–Computer Interaction research community following accumulating concerns regarding the use and deployment of Artificial Intelligence-based systems. How we conduct research on algorithmic fairness directly influences our inferences and conclusions regarding algorithmic fairness. To better understand the methodological decisions of studies focused on people's perceptions of algorithmic fairness, we systematic analysed relevant papers from the CHI and FAccT conferences. We identified 200 relevant papers published between 1993 and 2022 and assessed their study design, participant sample, and geographical location of participants and authors. Our results highlight that studies are predominantly cross-sectional, cover a wide range of participant roles, and that both authors and participants are primarily from the United States. Based on these findings, we reflect on the potential pitfalls and shortcomings in how the community studies algorithmic fairness. • Mapping of CHI and FAccT papers on algorithmic fairness published 1993–2022. • Over one-third of papers miss details on participant locality and compensation. • Algorithmic fairness research largely restricted to US and other Western countries. • Limited cross-country collaboration, most study samples from a single country. • Remote studies are most common, longitudinal studies are relatively rare. [ABSTRACT FROM AUTHOR]

Prophylactic interventions such as vaccine allocation are some of the most effective public health policy planning tools. The supply of vaccines, however, is limited and an important challenge is to optimally allocate the vaccines to minimize epidemic impact. This resource allocation question (which we refer to as VID) has multiple dimensions: when, where, to whom, etc. Most of the existing literature in this topic deals with the latter (to whom), proposing policies that prioritize individuals by age and disease risk. However, since seasonal influenza spread has a typical spatial trend, and due to the temporal constraints enforced by the availability schedule, the when and where problems become equally, if not more, relevant. In this paper, we study the VID problem in the context of seasonal influenza spread in the United States. We develop a national scale metapopulation model for influenza that integrates both short and long distance human mobility, along with realistic data on vaccine uptake. We also design GA, a greedy algorithm for allocating the vaccine supply at the state level under temporal constraints and show that such a strategy improves over the current baseline of pro-rata allocation, and the improvement is more pronounced for higher vaccine efficacy and moderate flu season intensity. Further, the resulting strategy resembles a ring vaccination applied spatiallyacross the US. [ABSTRACT FROM AUTHOR]

Background: About 30 million individuals in the United States are living with a rare disease, which by definition have a prevalence of 200,000 or fewer cases in the United States ([National Organization for Rare Disorders], [About NORD], [2016]). Disease heterogeneity and geographic dispersion add to the difficulty of completing robust studies in small populations. Improving the ability to conduct research on rare diseases would have a significant impact on population health. The purpose of this paper is to raise awareness of methodological approaches that can address the challenges to conducting robust research on rare diseases.Approach: We conducted a landscape review of available methodological and analytic approaches to address the challenges of rare disease research. Our objectives were to: 1. identify algorithms for matching study design to rare disease attributes and the methodological approaches applicable to these algorithms; 2. draw inferences on how research communities and infrastructure can contribute to the efficiency of research on rare diseases; and 3. to describe methodological approaches in the rare disease portfolio of the Patient-Centered Outcomes Research Institute (PCORI), a funder promoting both rare disease research and research infrastructure.Results: We identified three algorithms for matching study design to rare disease or intervention characteristics (Gagne, et.al, BMJ 349:g6802, 2014); (Gupta, et.al, J Clin Epidemiol 64:1085-1094, 2011); (Cornu, et. al, Orphet J Rare Dis 8:48,2012) and summarized the applicable methodological and analytic approaches. From this literature we were also able to draw inferences on how an effective research infrastructure can set an agenda, prioritize studies, accelerate accrual, catalyze patient engagement and terminate poorly performing studies. Of the 24 rare disease projects in the PCORI portfolio, 11 are randomized controlled trials (RCTs) using standard designs. Thirteen are observational studies using case-control, prospective cohort, or natural history designs. PCORI has supported the development of 9 Patient-Powered Research Networks (PPRNs) focused on rare diseases.Conclusion: Matching research design to attributes of rare diseases and interventions can facilitate the completion of RCTs that are adequately powered. An effective research infrastructure can improve efficiency and avoid waste in rare disease research. Our review of the PCORI research portfolio demonstrates that it is feasible to conduct RCTs in rare disease. However, most of these studies are using standard RCT designs. This suggests that use of a broader array of methodological approaches to RCTs --such as adaptive trials, cross-over trials, and early escape designs can improve the productivity of robust research in rare diseases. [ABSTRACT FROM AUTHOR]

The social functions of urbanized areas are highly dependent on and supported by the convenient access to public transportation systems, particularly for the less privileged populations who have restrained auto ownership. To accurately evaluate the public transit accessibility, it is critical to capture the spatiotemporal variation of transit services. This can be achieved by measuring the shortest paths or minimum travel time between origin-destination (OD) pairs at each time-of-day (e.g. every minute). In recent years, General Transit Feed Specification (GTFS) data has been gaining popularity for between-station travel time estimation due to its interoperability in spatiotemporal analytics. Many software packages, such as ArcGIS, have developed toolbox to enable the travel time estimation with GTFS. They perform reasonably well in calculating travel time between OD pairs for a specific time-of-day (e.g. 8:00 AM), yet can become computational inefficient and unpractical with the increase of data dimensions (e.g. all times-of-day and large network). In this paper, we introduce a new algorithm that is computationally elegant and mathematically efficient to address this issue. An open-source toolbox written in C++ is developed to implement the algorithm. We implemented the algorithm on City of St. George’s transit network to showcase the accessibility analysis enabled by the toolbox. The experimental evidence shows significant reduction on computational time. The proposed algorithm and toolbox presented is easily transferable to other transit networks to allow transit agencies and researchers perform high resolution transit performance analysis. [ABSTRACT FROM AUTHOR]

Constraints arise naturally in many scientific experiments/studies such as in, epidemiology, biology, toxicology, etc. and often researchers ignore such information when analyzing their data and use standard methods such as the analysis of variance (ANOVA). Such methods may not only result in a loss of power and efficiency in costs of experimentation but also may result poor interpretation of the data. In this paper we discuss constrained statistical inference in the context of linear mixed effects models that arise naturally in many applications, such as in repeated measurements designs, familial studies and others. We introduce a novel methodology that is broadly applicable for a variety of constraints on the parameters. Since in many applications sample sizes are small and/or the data are not necessarily normally distributed and furthermore error variances need not be homoscedastic (i.e. heterogeneity in the data) we use an empirical best linear unbiased predictor (EBLUP) type residual based bootstrap methodology for deriving critical values of the proposed test. Our simulation studies suggest that the proposed procedure maintains the desired nominal Type I error while competing well with other tests in terms of power. We illustrate the proposed methodology by re-analyzing a clinical trial data on blood mercury level. The methodology introduced in this paper can be easily extended to other settings such as nonlinear and generalized regression models. [ABSTRACT FROM AUTHOR]

In 2012, the US Census Bureau posed a challenge under the America COMPETES Act, an act designed to improve the competitiveness of the United States by investing in innovation through research and development. The Census Bureau contracted Kaggle.com to host and manage a worldwide competition to develop the best statistical model to predict 2010 Census mail return rates. The Census Bureau provided competitors with a block group-level database consisting of housing, demographic, and socioeconomic variables derived from the 2010 Census, five-year American Community Survey estimates, and 2010 Census operational data. The Census Bureau then challenged teams to use these data (and other publicly available data) to construct the models. One goal of the challenge was to leverage winning models as inputs to a new model-based hard-to-count (HTC) score, a metric to stratify and target geographic areas according to propensity to self-respond in sample surveys and censuses. All contest winners employed data-mining and machine-learning techniques to predict mail-return rates. This made the models relatively hard to interpret (when compared with the Census Bureau’s original HTC score) and impossible to directly translate to a new HTC score. Nonetheless, the winning models contained insights toward building a new model-based score using variables from the database. This paper describes the original algorithm-based HTC score, insights gained from the Census Return Rate Challenge, and the model underlying a new HTC score. [ABSTRACT FROM AUTHOR]

Abstract: The estimation of the recurrence rate and the distribution in severity of extreme ice events, which is required in order to determine design criteria for structures such as electric transmission lines, suffers from the fact that there appears to be a great variability in freezing rain events, in terms of duration, quantity of precipitation, and wind speed. Rauber et al. (2001), developed 7 archetypical patterns for freezing rain storms that indeed articulated differences in duration, spatial extent and intensity of storms. This finding suggests that it would not be correct to consider all freezing rain storms as a single homogeneous statistical population, which is the current practice in the extreme value analysis of ice storms. This paper presents an automated and objective methodology for classifying freezing rain storms that can be used in a de-aggregated extreme value analysis. This paper presents the theory, methodology, and results for clustering freezing rain storms. The procedure is tested using a base data set of previously classified storms: the storms identified and classified by Rauber et al. (2001) that occurred over North Eastern United States. The storms are described by making average anomaly maps based on sea level pressure (SLP), and 1000–500hPa geopotential heights using NCEP reanalysis data. Synoptic categories are then formed using clustering algorithms and principal component analysis. The k-means clustering algorithm is compared with a number of hierarchical algorithms. The resulting clusters using the k-means algorithm are compared amongst themselves as well as with the archetypical patterns of Rauber et al. For each event, statistics on wind speeds and precipitation are calculated using NCEP reanalysis data and NCEP hourly precipitation data respectively to verify the significance of the clusters. The three cluster solutions based on 1000–500hPa anomaly maps using the typing method developed here are found to be suitable for grouping storms in homogeneous populations. [Copyright &y& Elsevier]

Abstract: The Radio Aurora Explorer (RAX) is a triple CubeSat that launched on November 19, 2010. RAX was designed to study plasma irregularities in the polar lower ionosphere (80–300km), and is the first CubeSat mission funded by the United States National Science Foundation. The scientific mission requires attitude knowledge within 5° (), and a custom attitude determination subsystem was developed for the mission. The subsystem utilizes rate gyros, magnetometers, coarse sun sensors, and an extended Kalman filter, and was designed to be a simple, low cost solution to meet the attitude determination requirements. In this paper, we describe the design, implementation, and testing of the RAX attitude determination subsystem, including derivation of the determination requirements, sensor selection, the integrated hardware design, pre-flight sensor calibration, and attitude estimation algorithms. The paper is meant to serve as a resource for others in the small satellite and nanosatellite communities, as well as a critical reference for those analyzing RAX data. Lessons learned from the design and performance of the RAX determination subsystem will be used in future designs of attitude determination systems for small satellites and similar platforms, such as high altitude balloons and autonomous aerial vehicles. [Copyright &y& Elsevier]

Abstract: Several hundred workers die in construction in the United States every year because equipment operators are unable to see their fellow workers during operation of their vehicle. In this paper we propose a step towards improving this situation by providing an automated method based on range imaging for estimating the coarse head orientation of a construction equipment operator. This research utilizes commercially-available low resolution range cameras to measure the continuously changing field-of-view (FOV) of an equipment operator in outdoor construction. This paper presents a methodology to measure so-called dynamic blind spot maps. The dynamic blind spot map is then projected on a known static equipment blind spot map that already exists to each construction vehicle. A robust computational coarse head pose estimation algorithm and results to three different pieces of construction equipment and multiple operators are presented. The developed method has the potential in automatically determining the spaces around vehicles that are currently not in the field-of-view of the vehicle operator thus providing eventually additional means and technology for improving safety in construction. [Copyright &y& Elsevier]

Abstract: Optimization of combined cooling, heating, and power (CCHP) systems operation commonly focuses only on energy cost. Different algorithms have been developed to attain optimal utilization of CCHP units by minimizing the energy cost in CCHP systems operation. However, other outcomes resulting from CCHP operation such as primary energy consumption and emission of pollutants should also be considered during CCHP systems evaluation as one would expect these outcomes can be subject to regulation. This paper presents an optimization of the operation of CCHP systems for different climate conditions based on operational cost, primary energy consumption (PEC), and carbon dioxide emissions (CDE) using an optimal energy dispatch algorithm. The results for the selected cities demonstrate that in general there is not a common trend among the three optimization modes presented in this paper since optimizing one parameter may reduce or increase the other two parameters. The only cities that show reduction of PEC while also reducing the CDE are Columbus, MS; Minneapolis, MN; and Miami, FL. For these cities the operational cost always increases when compared to the reference case consisting of using a vapor/compression cycle for cooling and natural gas for heating. On the other hand, for San Francisco and Boston, CCHP systems increase the CDE. In general, if CCHP systems increase the cost of operation, as long as energy savings and reduction of emissions are guaranteed, the implementation of these systems should be considered. [Copyright &y& Elsevier]

Abstract: This paper investigates a graph enumeration problem, called the maximal -subgraphs problem, where is a hereditary or connected-hereditary graph property. Formally, given a graph G, the maximal -subgraphs problem is to generate all maximal induced subgraphs of G that satisfy . This problem differs from the well-known node-deletion problem, studied by Yannakakis and Lewis [J. Lewis, On the complexity of the maximum subgraph problem, in: Proc. 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York, USA, 1978, pp. 265–274; M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. 10th Annual ACM Symposium on Theory of Computing, ACM Press, New York, USA, 1978, pp. 253–264; J. Lewis, M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20 (2) (1980) 219–230]. In the maximal -subgraphs problem, the goal is to produce all (locally) maximal subgraphs of a graph that have property , whereas in the node-deletion problem, the goal is to find a single (globally) maximum size subgraph with property . Algorithms are presented that reduce the maximal -subgraphs problem to an input-restricted version of this problem. These algorithms imply that when attempting to efficiently solve the maximal -subgraphs problem for a specific , it is sufficient to solve the restricted case. The main contributions of this paper are characterizations of when the maximal -subgraphs problem is in a complexity class C (e.g., polynomial delay, total polynomial time). [Copyright &y& Elsevier]

Homeland security challenges civil engineers to develop solutions to protect critical infrastructure systems from intentional attacks. The water infrastructure system is one of eight critical infrastructures defined in the report by the President’s Commission on Critical Infrastructure Protection (PDD 1998). This paper offers a model for an operational response strategy to mitigate consequences of intentional physical attacks on the water infrastructure system. An intentional physical attack occurs when a water infrastructure facility is nonfunctional because of physical destruction of the facility by individuals or groups with malicious intentions. Three indices are presented in this paper to measure the consequences of intentional physical attacks: (a) the degree of the disruption of critical infrastructure services, (b) economic loss, and (c) the number of people affected. Then, a multiobjective genetic algorithm is used to find solutions to affect minimum consequences among these indicators. Evaluation of the model using two water infrastructure networks indicates that the genetic algorithms can successfully identify Pareto-optimal solutions to reduce the negative consequences of different attack scenarios. These solutions represent a pool of strategies to be incorporated in emergency plans. In addition, the modified nondominated sorting genetic algorithms (NSGA-II) developed in this study can significantly improve the quality of the solution early in the evolution process. This can be very critical when the time available to obtain mitigation plans is very limited. [ABSTRACT FROM AUTHOR]

Current spatial database systems offer limited querying capabilities beyond binary topological relations. This paper introduces a model for projective relations between regions to support other qualitative spatial queries. The relations are ternary because they are based on the collinearity invariant of three points under projective geometry. The model is built on a partition of the plane into separate zones that are obtained from projective properties of two reference objects: Then, by considering the empty/nonempty intersections of a primary object with these zones, the model is able to distinguish between 34 different projective relations. Then, the paper proposes original algorithms for computing the relations under the assumption that regions of the plane are stored as vector polygons in a spatial database. These algorithms run in optimal O(n log n) time. [ABSTRACT FROM AUTHOR]

In this paper, the authors study the performance of scheduling algorithms exploiting the multiuser selection diversity. Schedulers with affordable-rate transmission and adaptive transmission based on the absolute signal-to-noise ratio (SNR) and the normalized SNR are considered. In contrast to previous studies on the multiuser-diversity systems, the channel dynamics is taken into consideration in this paper by a novel formulation based on the level crossing analysis of stochastic processes. Then, the authors make the connection between the Doppler frequency shift, which indicates the channel temporal correlation, and the average (channel) access time, the average waiting time (AWT) between accesses, and the average access rate (AAR) of active users. These properties are important for the scheduler design, especially for applications where delay is a concern. In addition, analytical expressions for the system throughput and the degree of fairness (DOF) when users have nonidentical average channel conditions are presented. These expressions quantify the effect of disparateness in users' average channel conditions on the system performance. [ABSTRACT FROM AUTHOR]

Reverse link capacity of a direct-sequence code-division multiple-access (DS-CDMA) system in a multicell environment has been studied recently, and significant capacity improvements due to the use of beamforming have been observed. However, system performance with beamforming will be affected by several impairments, such as direction of arrival estimation errors, array perturbations, mutual coupling, and signal spatial spreads. In this paper, reverse link performance of CDMA systems with beamforming under these impairments (imperfect beamforming) is investigated. A simplified beamforming model is developed to evaluate the system performance in terms of user capacity, bit-error rates (BER), and outage probabilities. Both signal-to-interference-ratio-based power control and strength-based power control are considered in this paper. The capacity and BER degradations due to different impairments are shown, and outage probabilities under different power control schemes are examined. [ABSTRACT FROM AUTHOR]

This paper describes the implementation of the staggered pulse repetition time (PRT) technique on NOAA's research and development WSR-88D in Norman, Oklahoma. The prototype algorithm incorporates a novel rule for the correct assignment of Doppler mean velocity that is needed to accommodate arbitrary stagger ratios. Description of the rule, consideration of errors, and choice of appropriate stagger ratios are presented. The staggered PRT algorithm is integrated with the standard processing on the WSR-88D, some details of which are included in the paper. A simple ground clutter canceller removes the pure complex time series mean (DC) component from autocovariance estimates; censoring of overlaid echoes and thresholding are equivalent to those used on the WSR-88D. Further, a cursory verification of statistical errors indicates good agreement with theoretical expectations. Although the staggered PRT algorithm operates in real time, it was advantageous to collect several events of staggered PRT time series data for further scrutiny. Results presented from one of the events demonstrate the potency of the staggered PRT to mitigate range and velocity ambiguities. [ABSTRACT FROM AUTHOR]

This paper focuses on the benchmark control problems for seismically excited nonlinear buildings. The benchmark study focuses on three typical steel structures, 3-, 9-, and 20-story buildings designed for the SAC project for the Los Angeles region. This paper reports the application of the active control scheme on the 3- and 20-story benchmark buildings, where the control action is achieved by a fuzzy logic controller. The main advantage of the fuzzy controller is its inherent robustness and ability to handle any nonlinear behavior of the structure. The performance of the controller is validated through the computer simulation on MATLAB. The control scheme satisfies the control constraints and is presented according to the evaluation criteria provided with the benchmark problems for comparison with other schemes. Four different earthquakes (El Centro 1940, Hachinohe 1968, Northridge 1994, and Kobe 1995) will be used in the simulation. [ABSTRACT FROM AUTHOR]

The detection of pulmonary nodules is one of the most studied problems in the field of medical image analysis due to the great difficulty in the early detection of such nodules and their social impact. The traditional approach involves the development of a multistage CAD system capable of informing the radiologist of the presence or absence of nodules. One stage in such systems is the detection of ROI (regions of interest) that may be nodules in order to reduce the space of the problem. This paper evaluates fuzzy clustering algorithms that employ different classification strategies to achieve this goal. After characterising these algorithms, the authors propose a new algorithm and different variations to improve the results obtained initially. Finally it is shown as the most recent developments in fuzzy clustering are able to detect regions that may be nodules in CT studies. The algorithms were evaluated using helical thoracic CT scans obtained from the database of the LIDC (Lung Image Database Consortium). [ABSTRACT FROM AUTHOR]

The National Oceanic and Atmospheric Administration (NOAA) Geostationary Operational Environmental Satellite series R (GOES-R) will greatly expand the ability to observe the earth from geostationary orbit compared to the current-generation GOES, with more than 3 times as many spectral bands and a 75% reduction in footprint size. These enhanced capabilities are beneficial to rainfall rate estimation since they provide sensitivity to cloud-top properties such as phase and particle size that cannot be achieved using the limited channel selection of current GOES. The GOES-R rainfall rate algorithm, which is an infrared-based algorithm calibrated in real time against passive microwave rain rates, has been previously described in an algorithm theoretical basis document (ATBD); this paper describes modifications since the release of the ATBD, including a correction for evaporation of precipitation in dry regions and improved calibration updates. These improvements have been evaluated using a simplified version applicable to current-generation GOES to take advantage of the high-resolution ground validation data routinely available over the conterminous United States. Correcting for subcloud evaporation using relative humidity from a numerical model reduced false alarm rainfall by half and reduced the overall error by 35% for hourly accumulations validated against the National Centers for Environmental Prediction stage IV radar-gauge field; however, the number of missed events did increase slightly. Reducing the size of the calibration regions and increasing the training data requirements improved the consistency of the retrieved rates in time and space and reduced the overall error by an additional 4%. [ABSTRACT FROM AUTHOR]

The relationship between gold and US dollar series, which are non-stationary, is commonly known to be negative from a periodic perspective. Is this really the case? This paper established a combined iteration algorithm using the theory of spectral analysis after subtracting the trend using penalized B-spline functions to obtain the implicit cycles in gold and US dollar series. This algorithm accurately separates the trend terms and periodic terms of the two series to produce more precise and complete periodic information. The results show that both series share three common implicit cycles: two long periods and one short one. Both long-period terms are negatively correlated, whereas the short-period terms are positively correlated. [ABSTRACT FROM AUTHOR]

Efficient solution of the single source shortest path (SSSP) problem on road networks is an important requirement for numerous real-world applications. This paper introduces an algorithm for the SSSP problem using compression method. Owning to precomputing and storing all-pairs shortest path (APSP), the process of solving SSSP problem is a simple lookup of a little data from precomputed APSP and decompression. APSP without compression needs at least 1TB memory for a road network with one million vertices. Our algorithm can compress such an APSP into several GB, and ensure a good performance of decompression. In our experiment on a dataset about Northwest USA (with 1.2 millions vertices), our method can achieve about three orders of magnitude faster than Dijkstra algorithm based on binary heap. [ABSTRACT FROM AUTHOR]

Therapy for polymyalgia rheumatica (PMR) varies widely in clinical practice as international recommendations for PMR treatment are not currently available. In this paper, we report the 2015 European League Against Rheumatism (EULAR)/American College of Rheumatology (ACR) recommendations for the management of PMR. We used the Grading of Recommendations, Assessment, Development and Evaluation (GRADE) methodology as a framework for the project. Accordingly, the direction and strength of the recommendations are based on the quality of evidence, the balance between desirable and undesirable effects, patients' and clinicians' values and preferences, and resource use. Eight overarching principles and nine specific recommendations were developed covering several aspects of PMR, including basic and follow-up investigations of patients under treatment, risk factor assessment, medical access for patients and specialist referral, treatment strategies such as initial glucocorticoid (GC) doses and subsequent tapering regimens, use of intramuscular GCs and disease modifying anti-rheumatic drugs (DMARDs), as well as the roles of non-steroidal anti-rheumatic drugs and non-pharmacological interventions. These recommendations will inform primary, secondary and tertiary care physicians about an international consensus on the management of PMR. These recommendations should serve to inform clinicians about best practices in the care of patients with PMR. [ABSTRACT FROM AUTHOR]

This paper evaluates, for the first time, flash-flood guidance (FFG) values and recently developed gridded FFG (GFFG) used by the National Weather Service (NWS) to monitor and predict imminent flash flooding, which is the leading storm-related cause of death in the United States. It is envisioned that results from this study will be used 1) to establish benchmark performance of existing operational flash-flood prediction tools and 2) to provide information to NWS forecasters that reveals how the existing tools can be readily optimized. Sources used to evaluate the products include official reports of flash floods from the NWS Storm Data database, discharge measurements on small basins available from the U.S. Geological Survey, and witness reports of flash flooding collected during the Severe Hazards Analysis and Verification Experiment. Results indicated that the operational guidance values, with no calibration, were marginally skillful, with the highest critical success index of 0.20 occurring with 3-h GFFG. The false-alarm rates fell and the skill improved to 0.34 when the rainfall was first spatially averaged within basins and then reached 50%% of FFG for 1-h accumulation and exceeded 3-h FFG. Although the skill of the GFFG values was generally lower than that of their FFG counterparts, GFFG was capable of detecting the spatial variability of reported flash flooding better than FFG was for a case study in an urban setting. [ABSTRACT FROM AUTHOR]

This paper proposes an en route speed reduction to complement current ground delay practices in air traffic flow management. Given a nominal cruise speed, there exists a bounded range of speeds that allows aircraft to fly slower with the same or lower fuel consumption than the nominal flight. Therefore, flight times are increased and delay can be partially performed in the air, at no extra fuel cost for the operator. This concept has been analyzed in an initial feasibility study, computing the maximum amount of delay that can be performed in the air in some representative flights. The impact on fuel consumption has been analyzed, and two scenarios are proposed: the flight fuel remains the same as in the nominal flight, and some extra fuel allowance is permitted in order to face uncertainties. Results show significant values of airborne delay that may be useful in many situations, with the exception of short hauls where airborne delay may be too short. If cruise altitude is changed, the amount of airborne delay increases, since changes in cruise speed modify the optimal flight altitudes. From the analyzed flights, a linear dependency is found relating the airborne delay with the amount of extra fuel allowance. [ABSTRACT FROM AUTHOR]

This paper describes the application of a novel multiobjective self-adaptive differential evolution (MOSADE) algorithm for the simultaneous optimization of component sizing and control strategy in parallel hybrid electric vehicles (HEVs). Based on an electric assist control strategy, the HEV optimal design problem is formulated as a nonlinear constrained multiobjective problem with competing and noncommensurable objectives of fuel consumption and emissions. The driving performance requirements are considered constraints. The proposed MOSADE approach adopts an external elitist archive to retain nondominated solutions that are found during the evolutionary process. To preserve the diversity of Pareto optimal solutions, a progressive comparison truncation operator based on the normalized nearest neighbor distance is proposed. Moreover, a fuzzy set theory is employed to extract the best compromise solution. Finally, the optimization is performed over the following three typical driving cycles that are currently used in the U.S. and European communities: 1) the file transfer protocol; 2) ECE +EUDC; and 3) Urban Dynamometer Driving Schedule. The results demonstrate the capability of the proposed approach to generate well-distributed Pareto optimal solutions of the HEV multiobjective optimization design problem. The comparison with the reported results of genetic-algorithm-based weighting sum approaches and Nondominated Sorting Genetic Algorithm II reveals the superiority of the proposed approach and confirms its potential for optimal HEV design. [ABSTRACT FROM PUBLISHER]

Snow cover plays an important role in the climate system by changing the energy and mass transfer between the atmosphere and the surface. Reliable observations of the snow cover are difficult to obtain without satellites. This paper introduces a new algorithm for satellite-based snow-cover detection that is in operational use for Meteosat in the European Organisation for the Exploitation of Meteorological Satellites Satellite Application Facility on Land Surface Analysis (LSA SAF). The new version of the product is compared with the old version and the NOAA/National Environmental Satellite, Data, and Information Service Interactive Multisensor Snow and Ice Mapping System (IMS) snow-cover product. The new version of the LSA SAF snow-cover product improves the accuracy of snow detection and is comparable to the IMS product in cloud-free conditions. [ABSTRACT FROM AUTHOR]

A new algorithm of matrix spectral factorization is proposed which can be applied to compute an approximate spectral factor of any positive definite matrix function which satisfies the Paley-Wiener condition. ref refid="fnote1"/ id="fnote1" asterisk="no"paraThis paper includes the detailed proofs for an innovative method for matrix spectral factorization that can be used in numerous applications, including filtering, data compression, and wireless communications. A U.S. patent application has been submitted for this innovation through the Technology Commercialization Center, University of Maryland.para [ABSTRACT FROM AUTHOR]

Abstract: Altruism has previously been proposed as a topic for interstellar communication, because it begins to describe one important class of human and non-human behaviors, and because it can be modeled in mathematical and physical terms. Prior research has focused on altruism toward close relatives. The current paper explains how we could communicate basic principles of reciprocal altruism, in which one entity undergoes short-term self-sacrifice for the benefit of another, as well as for long-term self-interest. After providing an algorithmic description of the loss of mass involved in the evolution of stars—a phenomenon that should be familiar to extraterrestrial astronomers—an analogous process is described at a human scale, where the maintenance or loss of mass represents the maintenance or loss of health, and ultimately life. An adaptation of the Prisoner''s Dilemma game is communicated, showing limitations of both cooperation and defection as strategies for interacting with other agents. For the overall stability of a population, there are significant advantages for entities not always either cooperating or defecting in their responses; we end by modeling a more flexible strategy discussed by game theorists, known as Tit For Tat. [Copyright &y& Elsevier]

Abstract: This study presents an adaptive intelligent algorithm for forecasting gasoline demand based of artificial neural network (ANN), conventional regression and design of experiment (DOE). To show the superiority and applicability of the proposed algorithm it has been applied for monthly demand estimation of gasoline in Japan, USA, Kuwait, Canada and Iran within 1992–2005. The economic indicators used in this paper are price, GDP (Gross Domestic Production), population, number of vehicles, gasoline demand in the last periods and correlation coefficient between variables. The proposed algorithm may be used to estimate gasoline demand in the future by optimizing parameter values. The proposed algorithm uses ANOVA to select either ANN or regression for future demand estimation. Furthermore, if the null hypothesis in ANOVA and F-test is rejected, the Duncan method is used to identify which model is closer to actual data at α level of significance. Neural network is an intelligent, adaptive and optimizing method for solving the complicated problems. The results show that ANN provides far less error than regression. Moreover, the proposed algorithm provides near optimal solution for gasoline demand estimation due to its flexibility and intelligibility. The intelligent algorithm is therefore ideal for policy making with respect to gasoline consumption estimation. [ABSTRACT FROM AUTHOR]

Validation is an important and particularly challenging task for remote sensing of soil moisture. A key issue in the validation of soil moisture products is the disparity in spatial scales between satellite and in situ observations. Conventional measurements of soil moisture are made at a point, whereas satellite sensors provide an integrated area/volume value for a much larger spatial extent. In this paper, four soil moisture networks were developed and used as part of the Advanced Microwave Scanning Radiometer–Earth Observing System (AMSR-E) validation program. Each network is located in a different climatic region of the U.S., and provides estimates of the average soil moisture over highly instrumented experimental watersheds and surrounding areas that approximate the size of the AMSR-E footprint. Soil moisture measurements have been made at these validation sites on a continuous basis since 2002, which provided a seven-year period of record for this analysis. The National Aeronautics and Space Administration (NASA) and Japan Aerospace Exploration Agency (JAXA) standard soil moisture products were compared to the network observations, along with two alternative soil moisture products developed using the single-channel algorithm (SCA) and the land parameter retrieval model (LPRM). The metric used for validation is the root-mean-square error (rmse) of the soil moisture estimate as compared to the in situ data. The mission requirement for accuracy defined by the space agencies is 0.06 \m^3/\m^3. The statistical results indicate that each algorithm performs differently at each site. Neither the NASA nor the JAXA standard products provide reliable estimates for all the conditions represented by the four watershed sites. The JAXA algorithm performs better than the NASA algorithm under light-vegetation conditions, but the NASA algorithm is more reliable for moderate vegetation. However, both algorithms have a moderate to large bias in all cases. The SCA had the lowest overall rmse with a small bias. The LPRM had a very large overestimation bias and retrieval errors. When site-specific corrections were applied, all algorithms had approximately the same error level and correlation. These results clearly show that there is much room for improvement in the algorithms currently in use by JAXA and NASA. They also illustrate the potential pitfalls in using the products without a careful evaluation. [ABSTRACT FROM AUTHOR]

Over the decades, significant progress has been made in satellite precipitation product development. In particular, temporal resolution and timely availability have been improved by blended techniques. The resulting products, including near-real-time precipitation products, are widely used in various research and applications. However, the lack of support for user-defined areas or points of interest poses a major obstacle to quickly gaining knowledge of product quality and behavior on a local or regional scale. Current online operational intercomparison and validation services have not addressed this issue adequately. This paper describes an ongoing work to develop an online information system prototype for global satellite precipitation algorithm validation and intercomparison, to overcome current shortcomings by providing dynamic and customized information to users on the expected bias and accuracy of the products, and to give algorithm developers a better understanding of the strengths and weaknesses of different algorithmic approaches and data sources. An example is provided to illustrate the functionality and capabilities of the system, and future plans are discussed. The system being developed complements and accelerates the existing and ongoing validation activities in the community and contributes to the current NASA Tropical Rainfall Measuring Mission and the future NASA Global Precipitation Mission. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, I analyze immigration''s effect on the SAT-scores and college application patterns of high school students in California and Texas. The student-level dataset used is longitudinal in nature and is matched via a unique algorithm to the Census 2000 summary tabulation files to determine immigration at the local census-place level. The Census measure of immigration developed here is extremely specific and improves upon existing immigration measures. Using empirical strategies to account for issues of selection, this essay''s main finding is that the 1990s immigration did not harm, and possibly benefited the student outcomes of U.S. citizens. [Copyright &y& Elsevier]

A geometry-based approach is presented to identify cloud shadows using an automated cloud classification algorithm developed for the National Polar-orbiting Operational Environmental Satellite System (NPOESS) program. These new procedures exploit both the cloud confidence and cloud phase intermediate products generated by the Visible/Infrared Imager/Radiometer Suite (VIIRS) cloud mask (VCM) algorithm. The procedures have been tested and found to accurately detect cloud shadows in global datasets collected by NASA’s Moderate Resolution Imaging Spectroradiometer (MODIS) sensor and are applied over both land and ocean background conditions. These new procedures represent a marked departure from those used in the heritage MODIS cloud mask algorithm, which utilizes spectral signatures in an attempt to identify cloud shadows. However, they more closely follow those developed to identify cloud shadows in the MODIS Surface Reflectance (MOD09) data product. Significant differences were necessary in the implementation of the MOD09 procedures to meet NPOESS latency requirements in the VCM algorithm. In this paper, the geometry-based approach used to predict cloud shadows is presented, differences are highlighted between the heritage MOD09 algorithm and new VIIRS cloud shadow algorithm, and results are shown for both these algorithms plus cloud shadows generated by the spectral-based approach. The comparisons show that the geometry-based procedures produce cloud shadows far superior to those predicted with the spectral procedures. In addition, the new VCM procedures predict cloud shadows that agree well with those found in the MOD09 product while significantly reducing the execution time as required to meet the operational time constraints of the NPOESS system. [ABSTRACT FROM AUTHOR]