Academic literature on the topic 'Original programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Original programming.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Original programming"
1
Mweshi, George. "Feature Selection using Genetic Programming." Zambia ICT Journal 3, no. 2 (2019): 11–18. http://dx.doi.org/10.33260/zictjournal.v3i2.62.
Full textAbstract:
Extracting useful and novel information from the large amount of collected data has become a necessity for corporations wishing to maintain a competitive advantage. One of the biggest issues in handling these significantly large datasets is the curse of dimensionality. As the dimension of the data increases, the performance of the data mining algorithms employed to mine the data deteriorates. This deterioration is mainly caused by the large search space created as a result of having irrelevant, noisy and redundant features in the data. Feature selection is one of the various techniques that can be used to remove these unnecessary features. Feature selection consequently reduces the dimension of the data as well as the search space which in turn increases the efficiency and the accuracy of the mining algorithms. In this paper, we investigate the ability of Genetic Programming (GP), an evolutionary algorithm searching strategy capable of automatically finding solutions in complex and large search spaces, to perform feature selection. We implement a basic GP algorithm and perform feature selection on 5 benchmark classification datasets from UCI repository. To test the competitiveness and feasibility of the GP approach, we examine the classification performance of four classifiers namely J48, Naives Bayes, PART, and Random Forests using the GP selected features, all the original features and the features selected by the other commonly used feature selection techniques i.e. principal component analysis, information gain, relief-f and cfs. The experimental results show that not only does GP select a smaller set of features from the original features, classifiers using GP selected features achieve a better classification performance than using all the original features. Furthermore, compared to the other well-known feature selection techniques, GP achieves very competitive results.
2
Antczak, Tadeusz. "Saddle point criteria and duality in multiobjective programming via an η-approximation method". ANZIAM Journal 47, № 2 (2005): 155–72. http://dx.doi.org/10.1017/s1446181100009962.
Full textAbstract:
AbstractIn this paper, Antczak's η-approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the η-saddle points of the associated η-approximated vector optimisation problems. We introduce an η-Lagrange function for a constructed η-approximated vector optimisation problem and present some modified η-saddle point results. Furthermore, we construct an η-approximated Mond-Weir dual problem associated with the original dual problem of the considered multiobjective programming problem. Using duality theorems between η-approximation vector optimisation problems and their duals (that is, an η-approximated dual problem), various duality theorems are established for the original multiobjective programming problem and its original Mond-Weir dual problem.
3
Hasuike, Takashi, Hideki Katagiri, and Hiroaki Ishii. "Multiobjective Random Fuzzy Linear Programming Problems Based on the Possibility Maximization Model." Journal of Advanced Computational Intelligence and Intelligent Informatics 13, no. 4 (2009): 373–79. http://dx.doi.org/10.20965/jaciii.2009.p0373.
Full textAbstract:
Two multiobjective random fuzzy programming problems considered based on the possibility maximization model using possibilistic and stochastic programming are not initially well defined due to the random variables and fuzzy numbers included. To solve them analytically, probability criteria are set for objective functions and chance constraints are introduced. Taking into account the decision maker’s subjectivity and the original plan’s flexibility, a fuzzy goal is introduced for each objective function. The original problems are then changed into deterministic equivalent problems to make the possibility fractile optimization problem equivalent to a linear programming problem. The possibility maximization problem for probability is changed into a nonlinear programming problem, and an analytical solution is constructed extending previous solution approaches.
4
Zhang, Chengxue, Debin Kong, Peng Pan, and Mingyuan Zhou. "A New Algorithm for Privacy-Preserving Horizontally Partitioned Linear Programs." Journal of Mathematics 2021 (February 10, 2021): 1–4. http://dx.doi.org/10.1155/2021/6651480.
Full textAbstract:
In a linear programming for horizontally partitioned data, the equality constraint matrix is divided into groups of rows. Each group of the matrix rows and the corresponding right-hand side vector are owned by different entities, and these entities are reluctant to disclose their own groups of rows or right-hand side vectors. To calculate the optimal solution for the linear programming in this case, Mangasarian used a random matrix of full rank with probability 1, but an event with probability 1 is not a certain event, so a random matrix of full rank with probability 1 does not certainly happen. In this way, the solution of the original linear programming is not equal to the solution of the secure linear programming. We used an invertible random matrix for this shortcoming. The invertible random matrix converted the original linear programming problem to a secure linear program problem. This secure linear programming will not reveal any of the privately held data.
5
Lin, Hongwei, Yuping Wang, and Xiaoli Wang. "An Auxiliary Function Method for Global Minimization in Integer Programming." Mathematical Problems in Engineering 2011 (2011): 1–13. http://dx.doi.org/10.1155/2011/402437.
Full textAbstract:
An auxiliary function method is proposed for finding the global minimizer of integer programming problem. Firstly, we propose a method to transform the original problem into an integer programming with box constraint, which does not change the properties of the original problem. For the transformed problem, we propose an auxiliary function to escape from the current local minimizer and to get a better one. Then, based on the proposed auxiliary function, a new algorithm to find the global minimizer of integer programming is proposed. At last, numerical results are given to demonstrate the effectiveness and efficiency of the proposed method.
6
Feng, Qi Gao, Han Ping Mao, Yan Fang Wei, and Hong Wei Jiao. "New Computational Method for a Class of Optimization Problems in Production System and System Engineering." Applied Mechanics and Materials 29-32 (August 2010): 1016–21. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.1016.
Full textAbstract:
In this paper, a new computational method is proposed for solving a class of optimization problems which have broad applications in production system and system engineering. Firstly, by exploiting structure of the problem, linear relaxation programming of the original problem is constructed. By using simplex method we can solve a sequence of linear relaxation programming, the proposed algorithm is convergent to the global minimum of original problem through the successive refinement of the feasible region of a series of linear programming problems. In finally, numerical experiments are given to show the feasible of the proposed method.
7
Al-Bayati, Abbas Y., and Huda E. Khalid. "An Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity Analysis." American Journal of Engineering and Applied Sciences 2, no. 2 (2009): 481–87. http://dx.doi.org/10.3844/ajeassp.2009.481.487.
Full text
8
ANTCZAK, TADEUSZ. "AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS". Asia-Pacific Journal of Operational Research 23, № 04 (2006): 525–42. http://dx.doi.org/10.1142/s0217595906001029.
Full textAbstract:
In this paper, the so-called η-approximation approach is used to obtain the sufficient conditions for a nonlinear multiobjective programming problem with univex functions with respect to the same function η. In this method, an equivalent η-approximated vector optimization problem is constructed by a modification of both the objective and the constraint functions in the original multiobjective programming problem at the given feasible point. Moreover, to find the optimal solutions of the original multiobjective problem, it sufficies to solve its associated η-approximated vector optimization problem. Finally, the description of the η-approximation algorithm for solving a nonlinear multiobjective programming problem involving univex functions is presented.
9
Gabriele, G. A., and T. J. Beltracchi. "An Investigation of Pshenichnyi’s Recursive Quadratic Programming Method for Engineering Optimization." Journal of Mechanisms, Transmissions, and Automation in Design 109, no. 2 (1987): 248–53. http://dx.doi.org/10.1115/1.3267445.
Full textAbstract:
This paper discusses Pshenichnyi’s recursive quadratic programming algorithm for use in engineering optimization problems. An evaluation of the original algorithm is offered and several modifications are presented. The modifications include; addition of a variable metric update of the Hessian, an improved active set criterion, direct inclusion of the variable bounds, a divergence control mechanism, and updating schemes for the algorithm parameters. Implementations of the original algorithm and the modified algorithm were tested against the Sandgren test set of 23 engineering optimization problems. The results indicate that the modified algorithm was able to solve 20 of the 23 test problems while the original algorithm solved only 11. The modified algorithm was more efficient than the original on all the test problems.
10
O’Donoghue and Heinemann. "Synthetic DNA and RNA Programming." Genes 10, no. 7 (2019): 523. http://dx.doi.org/10.3390/genes10070523.
Full textAbstract:
Synthetic biology is a broad and emerging discipline that capitalizes on recent advances in molecular biology, genetics, protein and RNA engineering as well as omics technologies. Together these technologies have transformed our ability to reveal the biology of the cell and the molecular basis of disease. This Special Issue on “Synthetic RNA and DNA Programming” features original research articles and reviews, highlighting novel aspects of basic molecular biology and the molecular mechanisms of disease that were uncovered by the application and development of novel synthetic biology-driven approaches.
Dissertations / Theses on the topic "Original programming"
1
Fitzpatrick, Don Robert. "The Survival of the Three Original U.S. Television Networks Into the Twenty-First Century as Diverse Broadcast Programming Sources." Digital Commons @ Butler University, 1995. http://digitalcommons.butler.edu/grtheses/31.
Full textAbstract:
The economic viability of the three original U. S . television networks, ABC, CBS, and NBC, is threatened by emerging competition, excessive regulation, and the proliferation of new broadcasting and telecommunications technologies. This is a significant problem because United States viewers have depended upon free, diverse, broadcast television programming for more than forty years. This programming has traditionally been provided to viewers at no charge, unlike costly pay-per-view, direct broadcast satellite systems, cable television, backyard or rooftop television satellite receiving dishes, video programming via the Regional Bell Operating Companies (video Dialtone), wide and local area computer networks, or the Internet. Each network's survival depends upon its strategies in the areas of new technologies and political action with regard to regulation. Moreover, the three original networks are healthier than they may appear because the financial takeovers that occurred in 1985-1986 provided each with financial strength and strong corporate leadership.
2
Tegethoff, Marion. "Fetal origins of pediatric disease fetoplacental plasticity and intrauterine programming by stress and glucocorticoids." Göttingen Cuvillier, 2009. http://d-nb.info/999629417/04.
Full text
3
Sivanandan, R. "A linear programming approach for synthesizing origin-destination (O-D) trip tables from link traffic volumes." Diss., This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-07102007-142518/.
Full text
4
Lei, Peng. "A Linear Programming Method for Synthesizing Origin-Destination (O-D) Trip Tables from Traffic Counts for Inconsistent Systems." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/36860.
Full textAbstract:
Origin-Destination (O-D) trip tables represent the demand-supply information of each directed zonal-pair in a given region during a given period of time. The effort of this research is to develop a linear programming methodology for estimating O-D trip tables based on observed link volumes. In order to emphasize the nature of uncertainty in the data and in the problem, the developed model permits the user's knowledge of path travel time to vary within a band-width of values, and accordingly modifies the user-optimality principle. The data on the observed flows might also not be complete and need not be perfectly matched. In addition, a prior trip table could also be specified in order to guide the updating process via the model solution. To avoid excessive computational demands required by a total numeration of all possible paths between each O-D pair, a Column Generation Algorithm (CGA) is adopted to exploit the special structures of the model. Based on the known capacity of each link, a simple formula is suggested to calculate the cost for the links having unknown volumes. An indexed cost is introduced to avoid the consideration of unnecessary passing-through-zone paths, and an algorithm for solving the corresponding minimum-cost-path problem is developed. General principles on the design of an object-oriented code are presented, and some useful programming techniques are suggested for this special problem. Some test results on the related models are presented and compared, and different sensitivity analyses are performed based on different scenarios. Finally, several research topics are recommended for future research.<br>Master of Science
5
Gottfredson, Lauren Michelle. "Maternal Stress, Breastmilk IGF-1, and Offspring Growth among Breastfeeding Mothers-Infant Pairs in the Tampa Bay Area." Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5690.
Full textAbstract:
Background: Maternal stress during utero has been shown to have negative health consequences on the offspring, including low birth weight and increased risk of adult disease. Variation in breastmilk may act as an environmental cue of maternal stress and continue to program the infant during early life. This research aimed to explore the role of breastmilk on developmental programming of the infant. Specifically, to examine how breastmilk may act as a medium for the exposure of stress between the mother and the offspring, and see if variation in insulin like growth factor-1 (IGF-1) a potential mechanism for the relationship.
Methods: Survey-interviews, anthropometrics of the mother and offspring (height and weight), and breastmilk samples were collected for 31 breastfeeding mother-offspring pairs in the Tampa Bay area. Breastmilk was analyzed for IGF-1 and fat content. Maternal stress was measured through the PSS-10 and two self-reported ten-point stress scales. Offspring length for age and weight for age Z-scores were calculated using LMS equation.
Results: PPS-10 score was negatively correlated with child length for age and weight for age Z-scores. Child length for age and weight for age Z-scores were also negatively correlated with the breastmilk fat variables (creamatocrit percent, fat g/dL, and kcal/dL). No relationships were found between breastmilk IGF-1 and offspring length for age, weight for age, or maternal stress. Conclusions: Results indicate that maternal stress may negatively impact offspring growth. However, more research is necessary to better understand if or how breastmilk fat may act as a mechanism to mediate offspring growth due to maternal stress. This sample had low levels and prevalence of detectable IGF-1, which likely contributed to the lack of statistical relationships.
Further research using lower dilutions and larger samples sizes is necessary to better explore the potential role of breastmilk IGF-1 on offspring growth and/or its relationship to maternal stress.
6
Narayanan, Arvind. "A linear programming approach for synthesizing origin-destination (O-D) trip tables based on a partial set of link traffic volumes." Thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-01312009-063506/.
Full text
7
Cunha, Fábio da Silva. "Similaridades nas desigualdades : um modelo animal para o estudo de vulnerabilidade ao sedentarismo." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2013. http://hdl.handle.net/10183/70421.
Full textAbstract:
Introdução: O modelo teórico, no qual perfis extremos de desigualdade coexistem num cenário complexo promovendo desfechos de saúde similares, denominado “similaridades nas desigualdades”, surgiu de evidências em humanos. O objetivo deste trabalho foi propor um modelo animal para refletir o fenômeno "similaridades nas desigualdades". Métodos: As ratas prenhes foram randomizadas pelo peso corporal, mantidas individualmente e no dia 10 de gestação foram divididas em três grupos: Controle (Cont), que recebeu ração padrão à vontade; Restrição Alimentar 50% (R50%), que recebeu 50% do consumo do grupo controle e Dieta Rica em Gordura (RG), que recebeu uma dieta rica em gordura à vontade. Essas dietas foram oferecidas a partir do dia 10 de gestação até o dia 21 de lactação. Em até 24 horas após o nascimento, todos os filhotes foram adotados por outras mães, formando os seguintes grupos: Cont_Cont, R50%_Cont, R50%_R50%, Cont_R50%, RG_Cont, RG_RG, Cont_RG. Peso corporal e consumo alimentar das genitoras, peso ao nascer, peso ao longo da vida e exercício físico voluntário foram comparados entre grupos por Equação de Estimação Generalizada (GEE), usando diferentes modelos estatísticos. ANOVA de duas vias foi usada para avaliar os desfechos de gordura abdominal e medidas bioquímicas. Resultados: O peso corporal das genitoras Cont e RG foi maior, comparado ao peso das genitoras R50%. Além de alguns efeitos isolados da exposição às dietas R50% ou RG durante momentos específicos perinatais (gestação e/ou lactação), o efeito das "similaridades nas desigualdades" foi observado no peso ao nascer (ambos filhotes R50% e RG foram mais leves do que os Cont) e na atividade física (os grupos extremos R50%_Cont e RG_Cont foram igualmente diferentes do grupo de referência Cont_Cont, sendo machos menos ativos e fêmeas mais ativas). O acompanhamento do peso corporal ao longo da vida mostrou que os machos pesaram mais que as fêmeas. Nenhum dos três modelos estatísticos evidenciou diferenças entre grupos no total de gordura abdominal. Conclusão: Este estudo contribui com a idéia de que as desigualdades em saúde estão relacionadas a resultados similares em saúde para ambos os extremos populacionais, e propõe um modelo animal para explorar ainda mais este efeito.<br>Introduction: We have previously proposed a theoretical model in which extreme unequal social backgrounds coexist in a complex scenario promoting similar health outcomes, named “Similarities in the inequalities”, and had evidence of this effect in humans. Our objective was to propose an animal model to reflect the “Similarities in the inequalities” phenomenon. Methods: Rats were time-mated and randomly allocated to: Control (Adlib), receiving an ad libitum diet of standard laboratory chow, 50% food restricted (FR), receiving 50% of the ad libitum-fed dam’s intake and high fat diet (HF), receiving a diet containing 45.0% fat. These diets were provided from day 10 of pregnancy throughout the 21-day of lactation. Within 24 hours after birth, all pups were cross-fostered to other dams, forming the following groups: Adlib_Adlib, FR_Adlib, FR_FR, Adlib_FR, HF_Adlib, HF_HF, Adlib_HF. Dam’s body weight and show consumption, pup’s birth weight, growth and physical activity in running wheels, was compared between groups through GEE, using different statistical models. Twoway ANOVA was used to evaluate abdominal fat and biochemical outcomes. Results: Body weight of Adlib and HF dams was higher compared to FR dams. Apart from some isolated effects of the exposure to the FR or HF diets during specific perinatal times (gestation and/or lactation), the “Similarities in the inequalities” effect was seen in birth weight (both FR and HF pups were smaller than Adlib pups) and physical activity (the extreme groups FR_Adlib and HF_Adlib were similarly different from the reference group Adlib_Adlib, being less active in males and more active in females). Body weight monitoring throughout life showed that males were heavier than females. None of the three statistical models showed differences between groups in total abdominal fat. Conclusion: Our study contributes to the idea that health inequalities are related to similar health outcomes for both populational extremes, and proposes an animal model to further explore this effect.
8
Park, Taehyung. "Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems." Diss., Virginia Tech, 1998. http://hdl.handle.net/10919/30658.
Full textAbstract:
This research is concerned with the development of algorithmic approaches for solving
problems that arise in the design and analysis of telecommunication networks, location-allocation distribution contexts, and intelligent transportation networks. Specifically, the corresponding problems addressed in these areas are a local access and transport area (LATA) network design problem, the discrete equal-capacity p-median problem (PMED), and the estimation of dynamic origin-destination path ows or trip tables in a general network.
For the LATA network problem, we develop a model and apply the Reformulation-Linearization Technique (RLT) to construct various enhanced tightened versions of the proposed model. We also design efficient Lagrangian dual schemes for solving the linear programming relaxation of the various enhanced models, and construct an effective heuristic procedure for deriving good quality solutions in this process. Extensive computational results are provided to demonstrate the progressive tightness resulting from the enhanced formulations and their effect on providing good quality feasible solutions. The results indicate that the proposed procedures typically yield solutions having an optimality gap of less than 2% with respect to the derived lower bound, within a reasonable effort that involves the solution of a single linear program.
For the discrete equal-capacity p-median problem, we develop various valid inequalities, a separation routine for generating cutting planes via specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for solving this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for solving this class of problems.
For the estimation of dynamic path ows in a general network, we propose a parametric optimization approach to estimate time-dependent path ows, or origin-destination trip tables, using available data on link traffic volumes for a general road network. Our model assumes knowledge of certain time-dependent link ow contribution factors that are a dynamic generalization of the path-link incidence matrix for the static case. We propose a column generation approach that uses a sequence of dynamic shortest path subproblems in order to solve this problem. Computational results are presented on several variants of two sample test networks from the literature. These results indicate the viability of the proposed approach for use in an on-line mode in practice.
Finally, we present a summary of our developments and results, and offer several related recommendations for future research.<br>Ph. D.
9
Ferraro, Zachary Michael. "An Examination of Maternal Contributors and Potential Modifiers of Fetal Growth in Pregnancy." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/22817.
Full textAbstract:
A greater understanding of critical periods of body weight regulation, including pregnancy, may aid in efforts to optimize weight management strategies for the mother and her baby. The gestational period has been implicated to play, in the child, a vital role in the developmental origins of obesity and other cardiometabolic diseases later in life. Therefore, we initially examined existing literature on the role of maternal obesity and its link to pediatric obesity and documented the known underlying physiological mechanisms responsible for this relationship while suggesting potential intervention targets that may improve maternal-fetal outcomes. In a second paper, we aimed to quantify maternal predictors of large for gestational age (LGA) neonates in the Ottawa and Kingston (OaK) birth cohort with specific hypotheses verifying the independent contribution of maternal prepregnancy body mass index (BMI) and excessive gestational weight gain (GWG) to fetal overgrowth. This paper also highlights the clinical utility of the revised 2009 Institute of Medicine GWG guidelines and discusses the potential role of physiological factors underlying the observed associations between BMI, excessive GWG and LGA neonates. As a follow-up to our population-level analysis (i.e., OAK cohort), papers three and four highlight how the insulin-like growth factor (IGF) axis, a vital regulator of growth and development, may be compromised at the molecular level in cases of maternal obesity (paper 3) and excessive GWG (paper 4). In paper 3 we show that maternal obesity is associated with attenuated expression of IGF binding protein-4 (IGFBP4) in umbilical cord blood and discuss how this may preferentially promote fetal adipogenesis. The effects of excessive GWG on IGF axis protein expression are addressed in paper four where we show that excessive weight gain during pregnancy is associated with increased expression of IGFBP3 in maternal circulation in normoglycemic term pregnancies. In this paper we discuss the potential inhibitory role of IGFBP3 on adipogenesis and how it relates to glucose intolerance during pregnancy. Recognizing that both obesity and excessive GWG can alter physiological processes in mother and her baby, appropriate evidence-based interventions are warranted to best optimize outcomes. In paper five, we discuss the results of a study which sought to assess patient information channels and knowledge of nutrition and physical activity during pregnancy with the intent that these findings be applied to best design efficacious strategies that cater to the needs of our target group of pregnant women. In our analysis we show that the majority of pregnant women studied would be willing to participate in a lifestyle intervention for their own personal health and that of their child. Of great interest was the observation that most women were not informed of the importance of pregnancy-specific energy intake, or made aware of their own healthy GWG targets. Additionally, many of the respondents reported receiving no information pertaining to appropriate physical activity recommendations; despite the fact that the vast majority of participants consider this lifestyle modality to be safe during their pregnancy. Finally in paper six, we build on the results of our previous work and evaluate the risks and benefits of physical activity during pregnancy on maternal-fetal outcomes through a review of the literature and note that engaging in non-sedentary pursuits during gestation may aid in maternal weight regulation, protect against metabolic disorders and optimize neonatal birth weight and body composition. Overall, the collective nature of the papers presented in this dissertation provides qualitative and quantitative evidence to support not only the complexity of body weight regulation in the mother and her baby, but also highlights potential avenues for intervention that may improve maternal-fetal outcomes during this critical period.
10
Arroyo, Juan Pablo. "Exploring Potential Risk Factors of Fetal Origins of Diabetes| Maternal Stressors during Pregnancy and Birth Outcomes among Women in a Hospital in the Municipality of Caguas, Puerto Rico." Thesis, University of South Florida, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=1543402.
Full textAbstract:
<p> Puerto Rico has the highest prevalence of type 2 diabetes, low birth-weight, and the second highest prevalence of preterm-birth in all the U.S. and its non-incorporated territories. These conditions are related. Birth-weight at both ends of the spectrum and preterm-birth are associated with an increased risk for developing type 2 diabetes and immune-inflammatory dysregulations. Maternal psychosocial stressors during pregnancy have also been recognized as potential risk factors for type 2 diabetes, and have been consistently associated with preterm-birth and low birth-weight across populations. Current evidence points toward epigenetic fetal metabolic-programming as the mechanism that underlies the increased risk for the previously mentioned morbidities. However, the particular psychosocial stressors that may contribute to the high prevalence of low birth-weight and preterm-birth in the population of Puerto Rico have not been well studied.</p><p> The present study assesses the relationships between particular psychosocial stressors, socioeconomic status, food insecurity, and birth outcomes. The results of this study show that low-risk pregnancy women were more likely to have babies with a higher ponderal index if they were exposed to stressors during gestation months 5, 6, and 7, or if exposed to "relationship stress" at any time during pregnancy. Women exposed to "financial difficulties" at any time during pregnancy were more likely to deliver babies at an earlier gestational age. Differences in birth outcomes between the exposed and non-exposed women were independent of maternal anthropometric measurements, maternal age at birth, number of previous births, and sex of the baby. Significant differences in birth outcomes were found between categories of father's self-identified and identified by others ethnicity, but sample size within categories was small. Although mothers with children at home had higher levels of food insecurity, and the level of food insecurity was correlated with higher levels of stress, no birth outcome measure was associated with food insecurity.</p><p> Some results are atypical in comparison with other populations, and therefore these findings may contribute to the understanding of population differences in the relationship between maternal stress during pregnancy and birth outcomes. The relatively small sample size and strict exclusion criteria of this study may limit the generalizability of the findings. Epidemiological similarities between Puerto Rico and other populations, and the possibility of a higher ponderal index increasing the risk for type 2 diabetes in the population of Puerto Rico need to be examined in future research.</p>
Books on the topic "Original programming"
1
Mallang, Edward A. The original parameter cross-reference for the C-64 user. E.A. Mallang III, 1987.
Find full text
3
Siewert, Senta. Performing Moving Images. Amsterdam University Press, 2020. http://dx.doi.org/10.5117/9789462985834.
Full textAbstract:
Performing Moving Images: Access, Archive and Affects presents institutions, individuals and networks who have ensured experimental films and Expanded Cinema of the 1960s and 1970s are not consigned to oblivion. Through a comparison of recent international case studies from festivals, museums, and gallery spaces, the book analyzes their new contexts, and describes the affective reception of those events. The study asks: what is the relationship between an aesthetic experience and memory at the point where film archives, cinema, and exhibition practices intersect? What can we learn from re-screenings, re-enactments, and found footage works, that are using archival material? How does the affective experience of the images, sounds and music resonate today? Performing Moving Images: Access, Archive and Affects proposes a theoretical framework from the perspective of the performative practice of programming, curating, and reconstructing, bringing in insights from original interviews with cultural agents together with an interdisciplinary academic discourse.
4
Ing, Hlaváček Vladimír, ed. Numerical solution of nonlinear boundary value problems with applications. Dover Publications, 2008.
Find full text
5
Mastropietro, Alessandro. Riraccontare Verdi: Materiali per un ciclo (de)costruzionista : raccolta consuntivo- documentaria di scritti originali e materiali da programmi di sala relativi al ciclo concertistico Riraccontare Verdi, 55. stagione gennaio-dicembre 2001, ideato e realizzato dalla Società aquilana dei concerti B. Barattelli. Società aquilana dei concerti B. Barattelli, 2002.
Find full text
6
Mastropietro, Alessandro. Riraccontare Verdi: Materiali per un ciclo (de)costruzionista : raccolta consuntivo-documentaria di scritti originali e materiali da programmi di sala relativi al ciclo concertistico "Riraccontare Verdi," 55a stagione gennaio-dicembre 2001, ideato e realizzato dalla Società aquilana dei concerti "B. Barattelli". Società aquilana dei concerti "B. Barattelli,", 2002.
Find full text
7
Boudreau, Joseph F., and Eric S. Swanson. Applied Computational Physics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198708636.001.0001.
Full textAbstract:
Applied Computational Physics describes methods for solving a vast array of classical and quantum mechanical scientific problems while stressing modern computational paradigms for achieving these solutions. The text develops computational techniques, numerical algorithms, and physics applications in parallel. The goal of the book is to provide students of physics with essential and modern computational skills and to increase the confidence with which they write computer programs within their problem domain. Hundreds of original problems reinforce programming skills and increase the ability to solve real-life physics problems at and beyond the graduate level.
8
Marschark, Marc, Shirin Antia, and Harry Knoors, eds. Co-Enrollment in Deaf Education. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190912994.001.0001.
Full textAbstract:
Co-enrollment programming in deaf education refers to classrooms in which a critical mass of deaf and hard-of-hearing (DHH) students is included in a classroom containing mainly hearing students and the class is taught by both a mainstream teacher and a teacher of the deaf. It thus offers full access to both DHH and hearing students in the classroom through “co-teaching” and avoids both academic segregation of DHH students and their integration into classes with hearing students without the need for additional support services or modification of instructional methods and materials. Co-enrollment thus seeks to give DHH learners the best of both (mainstream and separate) educational worlds. Co-enrollment programming has been described as a “bright light on the educational horizon” for DHH learners, giving them unique educational opportunities and educational access comparable to that of hearing peers. Co-enrollment programming shows great promise, but research concerning co-enrollment programming for DHH learners is still in its infancy. This volume provides descriptions of 14 co-enrollment programs from around the world, explaining their origins, functioning, and available outcomes. Set in the larger context of what we know and what we don’t know about educating DHH learners, the volume offers readers a vision of a brighter future in deaf education for DHH children, their parents, and their communities.
9
Vanderschraaf, Peter. A Limited Leviathan. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199832194.003.0006.
Full textAbstract:
The state social contract relationship between rulers and the ruled in civil society is fruitfully understood as a governing convention. This relationship is modeled with an indefinitely repeated Humean Sovereignty game, where subjects and their sovereign maintain a governing convention by respectively obeying and providing adequate government. The ruled and their rulers maintain an implicit contract that is self-enforcing rather than an explicit contract requiring third-party enforcement. This model is motivated by the Trust problem in game theory and dynamic programming models of employment search. The governing convention idea has roots in Hume’s discussions of government. The closely allied Leadership Selection problem has roots in Hobbes’ account of commonwealth by institution. Hobbes’ original analysis fails, but his general strategy of justifying government by identifying an isomorphism between an actual regime and the regime of hypothetical choice motivates justifying democratic government via the salience of a democratic leadership convention.
10
Gelman, Andrew, and Deborah Nolan. A course in statistical communication and graphics. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198785699.003.0016.
Full textAbstract:
This chapter describes a course on statistical communication. Originally developed for training statistics graduate students as instructors, the course now is popular with students in other fields including undergraduates. It is a demanding course, with two homework assignments per week and active participation during class. This level of commitment signals the seriousness of the topic. The chapter contains a prototype class meeting, and lecture-by-lecture specifics for 26 lecture periods of 75 minutes each. The material includes lesson plans and links to course slides, activities, and reading and homework assignments. Topics include, statistical graphics, statistical story telling and reporting, teaching statistics, giving a presentation, technical writing, interactive graphics, and programming practices.
Book chapters on the topic "Original programming"
1
Régin, J. C., T. Petit, C. Bessière, and J. F. Puget. "An Original Constraint Based Approach for Solving over Constrained Problems." In Principles and Practice of Constraint Programming – CP 2000. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45349-0_46.
Full text
2
Dagnino, Francesco, Viviana Bono, Elena Zucca, and Mariangiola Dezani-Ciancaglini. "Soundness Conditions for Big-Step Semantics." In Programming Languages and Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_7.
Full textAbstract:
AbstractWe propose a general proof technique to show that a predicate is sound, that is, prevents stuck computation, with respect to a big-step semantics. This result may look surprising, since in big-step semantics there is no difference between non-terminating and stuck computations, hence soundness cannot even be expressed. The key idea is to define constructions yielding an extended version of a given arbitrary big-step semantics, where the difference is made explicit. The extended semantics are exploited in the meta-theory, notably they are necessary to show that the proof technique works. However, they remain transparent when using the proof technique, since it consists in checking three conditions on the original rules only, as we illustrate by several examples.
3
Iwashita, Hidetoshi, and Masahiro Nakao. "Coarrays in the Context of XcalableMP." In XcalableMP PGAS Programming Language. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7683-6_3.
Full textAbstract:
AbstractCoarray features have been implemented on the Omni XcalableMP compiler with a source-to-source translator and layered runtime libraries. Three memory allocation methods for coarrays were implemented for the GASNet and MPI-3 communication libraries and the native interface of Fujitsu. For the coarray PUT/GET communication, algorithms using DMA (zero-copy) and buffering were introduced. Important techniques for achieving high performance were the non-blocking PUT communication implemented in the runtime library and the optimization for the GET communication in the translator. Using the ping-pong benchmark and the modified version, the fundamental performance was evaluated and analyzed. The MPI version of the Himeno benchmark was ported to the coarray version and modified for fully using the non-blocking PUT. As a result of the evaluation, the non-blocking coarray version clearly outperformed the original and non-blocking MPI versions.
4
Laurel, Jacob, and Sasa Misailovic. "Continualization of Probabilistic Programs With Correction." In Programming Languages and Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_14.
Full textAbstract:
AbstractProbabilistic Programming offers a concise way to represent stochastic models and perform automated statistical inference. However, many real-world models have discrete or hybrid discrete-continuous distributions, for which existing tools may suffer non-trivial limitations. Inference and parameter estimation can be exceedingly slow for these models because many inference algorithms compute results faster (or exclusively) when the distributions being inferred are continuous. To address this discrepancy, this paper presents Leios. Leios is the first approach for systematically approximating arbitrary probabilistic programs that have discrete, or hybrid discrete-continuous random variables. The approximate programs have all their variables fully continualized. We show that once we have the fully continuous approximate program, we can perform inference and parameter estimation faster by exploiting the existing support that many languages offer for continuous distributions. Furthermore, we show that the estimates obtained when performing inference and parameter estimation on the continuous approximation are still comparably close to both the true parameter values and the estimates obtained when performing inference on the original model.
5
Jaber, Guilhem, and Andrzej S. Murawski. "Complete trace models of state and control." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_13.
Full textAbstract:
AbstractWe consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either $$\mathrm {call/cc}$$ call / cc or no control operator.Our first result is a fully abstract trace model for the most expressive setting, featuring both higher-order references and $$\mathrm {call/cc}$$ call / cc , constructed in the spirit of operational game semantics. Next we examine the impact of suppressing higher-order references and callcc in contexts and provide an operational explanation for the game-semantic conditions known as visibility and bracketing respectively. This allows us to refine the original model to provide fully abstract trace models of interaction with contexts that need not use higher-order references or $$\mathrm {call/cc}$$ call / cc . Along the way, we discuss the relationship between error- and termination-based contextual testing in each case, and relate the two to trace and complete trace equivalence respectively.Overall, the paper provides a systematic development of operational game semantics for all four cases, which represent the state-based face of the so-called semantic cube.
6
Tsugane, Keisuke, Taisuke Boku, Hitoshi Murai, Mitsuhisa Sato, William Tang, and Bei Wang. "Hybrid-View Programming of Nuclear Fusion Simulation Code in XcalableMP." In XcalableMP PGAS Programming Language. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7683-6_7.
Full textAbstract:
AbstractXcalableMP(XMP) supports a global-view model that allows programmers to define global data and to map them to a set of processors, which execute the distributed global data as a single thread. In XMP, the concept of a coarray is also employed for local-view programming. In this study, we port Gyrokinetic Toroidal Code - Princeton (GTC-P), which is a three-dimensional gyrokinetic PIC code developed at Princeton University to study the microturbulence phenomenon in magnetically confined fusion plasmas, to XMP as an example of hybrid memory model coding with the global-view and local-view programming models. In local-view programming, the coarray notation is simple and intuitive compared with Message Passing Interface (MPI) programming, while the performance is comparable to that of the MPI version. Thus, because the global-view programming model is suitable for expressing the data parallelism for a field of grid space data, we implement a hybrid-view version using a global-view programming model to compute the field and a local-view programming model to compute the movement of particles. The performance is degraded by 20% compared with the original MPI version, but the hybrid-view version facilitates more natural data expression for static grid space data (in the global-view model) and dynamic particle data (in the local-view model), and it also increases the readability of the code for higher productivity.
7
Abate, Carmine, Roberto Blanco, Ștefan Ciobâcă, et al. "Trace-Relating Compiler Correctness and Secure Compilation." In Programming Languages and Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_1.
Full textAbstract:
AbstractCompiler correctness is, in its simplest form, defined as the inclusion of the set of traces of the compiled program into the set of traces of the original program, which is equivalent to the preservation of all trace properties. Here traces collect, for instance, the externally observable events of each execution. This definition requires, however, the set of traces of the source and target languages to be exactly the same, which is not the case when the languages are far apart or when observations are fine-grained. To overcome this issue, we study a generalized compiler correctness definition, which uses source and target traces drawn from potentially different sets and connected by an arbitrary relation. We set out to understand what guarantees this generalized compiler correctness definition gives us when instantiated with a non-trivial relation on traces. When this trace relation is not equality, it is no longer possible to preserve the trace properties of the source program unchanged. Instead, we provide a generic characterization of the target trace property ensured by correctly compiling a program that satisfies a given source property, and dually, of the source trace property one is required to show in order to obtain a certain target property for the compiled code. We show that this view on compiler correctness can naturally account for undefined behavior, resource exhaustion, different source and target values, side-channels, and various abstraction mismatches. Finally, we show that the same generalization also applies to many secure compilation definitions, which characterize the protection of a compiled program against linked adversarial code.
8
Jungck, Peder, Ralph Duncan, and Dwight Mulcahy. "Origins of packetC." In packetC Programming. Apress, 2011. http://dx.doi.org/10.1007/978-1-4302-4159-1_1.
Full text
9
Ershov, A. P. "Descriptive Analysis of the Problem." In Origins of Programming. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-3278-0_1.
Full text
10
Ershov, A. P. "Statement of the Problem and General Theory." In Origins of Programming. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-3278-0_2.
Full textConference papers on the topic "Original programming"
1
Yuen, Shiu Yin, and Shing Wa Leung. "Genetic programming that ensures programs are original." In 2009 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2009. http://dx.doi.org/10.1109/cec.2009.4983035.
Full text
2
Saoban, Chawalit, and Sunisa Rimcharoen. "Identifying an original copy of the source codes in programming assignments." In 2019 16th International Joint Conference on Computer Science and Software Engineering (JCSSE). IEEE, 2019. http://dx.doi.org/10.1109/jcsse.2019.8864196.
Full text
3
Ping Ji and Jian Jin. "Integer Linear Programming for Transforming Pairwise Based Results to the Original Ratings." In 11th International Symposium on Operations Research and its Applications in Engineering, Technology and Management 2013 (ISORA 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.2257.
Full text
4
Turbak, Franklyn, Eni Mustafaraj, Maja Svanberg, and Michael Dawson. "Work in Progress: Identifying and Analyzing Original Projects in an Open-Ended Blocks Programming Environment." In The 23rd International Conference on Distributed Multimedia Systems, Visual Languages and Sentient Systems. KSI Research Inc. and Knowledge Systems Institute Graduate School, 2017. http://dx.doi.org/10.18293/dms2017-021.
Full text
5
Ghoshal, Samik, and Jason Clark. "Reinventing MEMS Through Genetic Programming." In ASME 2012 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/imece2012-88506.
Full textAbstract:
As the functional requirements of MEMS devices become more complex, advanced optimization techniques become more necessary in determining acceptable parameters, or even creating new components to satisfy a desired output. These challenges are being met through the use of genetic programming (GP), a brand of optimization that determines parameters through its “artificial intelligence” selecting and choosing the best output. The applications of genetic programming to MEMS have been mostly limited to the task of optimizing parameters and components for existing devices. In addition to these applications, GP can also be utilized to create original MEMS devices. Existing MEMS devices can also be reinvented to match the shape and structure of existing devices based solely on the device’s performance characteristics. This paper will discuss how the electro-thermal actuator and the chevron actuator were successfully reinvented through this process.
6
Samanta, B. "Machine Fault Detection Using Genetic Programming." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84642.
Full textAbstract:
Applications of genetic programming (GP) include many areas. However applications of GP in the area of machine condition monitoring and diagnostics is very recent and yet to be fully exploited. In this paper, a study is presented to show the performance of machine fault detection using GP. The time domain vibration signals of a rotating machine with normal and defective gears are processed for feature extraction. The extracted features from original and preprocessed signals are used as inputs to GP for two class (normal or fault) recognition. The number of features and the features are automatically selected in GP maximizing the classification success. The results of fault detection are compared with genetic algorithm (GA) based artificial neural network (ANN)- termed here as GA-ANN. The number of hidden nodes in the ANN and the selection of input features are optimized using GAs. Two different normalization schemes for the features have been used. For each trial, the GP and GA-ANN are trained with a subset of the experimental data for known machine conditions. The trained GP and GA-ANN are tested using the remaining set of data. The procedure is illustrated using the experimental vibration data of a gearbox. The results compare the effectiveness of both types of classifiers with GP and GA based selection of features.
7
Tatsukawa, Tomoaki, Taku Nonomura, Akira Oyama, and Kozo Fujii. "Aerodynamic Design Exploration for Reusable Launch Vehicle Using Multi-Objective Genetic Programming." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48154.
Full textAbstract:
A new type of multi-objective genetic programming (MOGP) for design exploration is proposed. The feature of the new MOGP is the simultaneous symbolic regression to multiple variables using correlation coefficients. This methodology is applied to Pareto-optimal solutions of the multi-objective aerodynamic design optimization problem of a bi-conical shape reusable launch vehicle. The MOGP presents symbolic equations which have high correlations to zero-lift drag at supersonic condition, maximum lift-to-drag at supersonic condition and volume of shape through single MOGP run. These equations also have high correlation to another parameter of the body geometry. These results indicate that MOGP is capable of finding composite more efficient design parameters from original design parameters.
8
Majovská, Renata, and Petr Fiala. "MODELLING OF SUPPLY NETWORK DESIGN." In The 19th International Conference on Modelling and Applied Simulation. CAL-TEK srl, 2019. http://dx.doi.org/10.46354/i3m.2019.mas.004.
Full textAbstract:
The paper is dedicated to proposed modelling approach for supply networks. The original structure of network systems can be modelled as complex adaptive systems and use agent-oriented simulation to demonstrate origin. The structure is clarified by expert opinion with use of DEMATEL method. The suitability of supply networks can be measured by multiple objectives, such as economic, environmental, social, and others. Traditional concepts of optimality focus on valuation of already given systems. We propose to use a methodology for optimal system design. As a methodology of optimal system design can be employed De Novo Multi-objective Linear Programming for reshaping feasible sets in linear systems.
9
Du Bois, Andre, and Rodrigo Ribeiro. "Combining Effects in a Music Programming Language based on Patterns." In Simpósio Brasileiro de Computação Musical. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbcm.2019.10430.
Full textAbstract:
HMusic is a domain specific language based on music patterns that can be used to write music and live coding. The main abstractions provided by the language are patterns and tracks. Code written in HMusic looks like patterns and multi-tracks available in music sequencers, drum machines and DAWs. HMusic provides primitives to design and combine patterns generating new patterns. The objective of this paper is to extend the original design of HMusic to allow effects on tracks. We describe new abstractions to add effects on individual tracks and in groups of tracks, and how they influence the combinators for track composition and multiplication. HMusic allows the live coding of music and, as it is embedded in the Haskell functional programming language, programmers can write functions to manipulate effects on the fly. The current implementation of the language is compiled into Sonic Pi [1], and we describe how the compiler’s back-end was modified to support the new abstractions for effects. HMusic can be and can be downloaded from [2].
10
Hsu, Yeh-Liang, Yu-Fa Lin, and Yu-Shuei Guo. "A Fuzzy Sequential Linear Programming Algorithm for Engineering Design Optimization." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0060.
Full textAbstract:
Abstract An optimization process can be viewed as a closed-loop control system. Traditional “controllers”, the numerical optimization algorithms, are usually “crisply” designed for well defined mathematical models. However, when applied to engineering design optimization problems in which function evaluations can be expensive and imprecise, very often the crisp algorithms will become impractical or will not converge. A common strategy for designers is to monitor the optimization process and keep “tuning” the process in an interactive manner, using their judgment on the information obtained from previous iterations, and their knowledge of the problem. This paper presents how the heuristics of this human supervision can be modeled into the optimization algorithms using fuzzy set theory. A fuzzy version of sequential linear programming is used to demonstrate this idea. Fuzzy rules, which describe the human supervision during the optimization process, are combined with the numerical rules of the original algorithm to refine the output of each iteration. Several design optimization problems are used to show the feasibility and practicality of this approach.
Reports on the topic "Original programming"
1
Kelly, Luke. Humanitarian Evidence Summary No.14. Institute of Development Studies (IDS), 2021. http://dx.doi.org/10.19088/k4d.2021.069.
Full textAbstract:
This is the 14th monthly Humanitarian Evidence Summary (HUMES) to signpost FCDO and other UK government departments to the latest relevant evidence and discourse on humanitarian action to inform and support their response. It is the result of 1 day of work per month and is not intended to be a comprehensive summary of available evidence on humanitarian action but aims to make original documents easily accessible to decision-makers that, if relevant to them, they could refer to before making decisions. This summary covers publications on Enhancing protection and humanitarian access; Needs assessment and analysis; Accountability to affected populations; Cash programming; Managing risk better, preparedness and anticipation; Resilience and protracted crisis; Other and Resource Hubs.
2
Kelly, Luke. Humanitarian Evidence Summary No.12. Institute of Development Studies (IDS), 2021. http://dx.doi.org/10.19088/k4d.2021.031.
Full textAbstract:
This is the 12th monthly Humanitarian Evidence Summary (HUMES) to signpost FCDO and other UK government departments to the latest relevant evidence and discourse on humanitarian action to inform and support their response. It is the result of 1 day of work per month and is not intended to be a comprehensive summary of available evidence on humanitarian action but aims to make original documents easily accessible to decision-makers that, if relevant to them, they could refer to before making decisions. This summary covers publications on Enhancing protection and humanitarian access; Needs assessment and analysis; Accountability to affected populations; Cash programming; Managing risk better, preparedness and anticipation; Other; and Resource Hubs.
3
Kelly, Luke. Humanitarian Evidence Summary No.15. Institute of Development Studies (IDS), 2021. http://dx.doi.org/10.19088/k4d.2021.089.
Full textAbstract:
This is the 15th monthly Humanitarian Evidence Summary (HUMES) to signpost FCDO and other UK government departments to the latest relevant evidence and discourse on humanitarian action to inform and support their response. It is the result of 1 day of work per month and is not intended to be a comprehensive summary of available evidence on humanitarian action but aims to make original documents easily accessible to decision-makers that, if relevant to them, they could refer to before making decisions. This summary covers publications on Enhancing protection and humanitarian access; Needs assessment and analysis; Accountability to affected populations; Cash programming; Managing risk better, preparedness and anticipation; Resilience and protracted crisis; Other; and Resource Hubs.
4
Murphy, Joe J., Michael A. Duprey, Robert F. Chew, Paul P. Biemer, Kathleen Mullan Harris, and Carolyn Tucker Halpern. Interactive Visualization to Facilitate Monitoring Longitudinal Survey Data and Paradata. RTI Press, 2019. http://dx.doi.org/10.3768/rtipress.2019.op.0061.1905.
Full textAbstract:
Surveys often require monitoring during data collection to ensure progress in meeting goals or to evaluate the interim results of an embedded experiment. Under complex designs, the amount of data available to monitor may be overwhelming and the production of reports and charts can be costly and time consuming. This is especially true in the case of longitudinal surveys, where data may originate from multiple waves. Other such complex scenarios include adaptive and responsive designs, which were developed to act on the results of such monitoring to implement prespecified options or alternatives in protocols. This paper discusses the development of an interactive web-based data visualization tool, the Adaptive Total Design (ATD) Dashboard, which we designed to provide a wide array of survey staff with the information needed to monitor data collection daily. The dashboard was built using the R programming language and Shiny framework and provides users with a wide range of functionality to quickly assess trends. We present the structure of the data used to populate the dashboard, its design, and the process for hosting it on the web. Furthermore, we provide guidance on graphic design, data taxonomy, and software decisions that can help guide others in the process of developing their own data collection monitoring systems. To illustrate the benefits of the dashboard, we present examples from the National Longitudinal Study of Adolescent to Adult Health (Add Health). We also discuss features of the dashboard to be developed for future waves of Add Health.