Downloads & Free Reading Options - Results

The primary question of this study is to determine whether an established resistance training guidelines exists for patients with cardiovascular disease. And if so, statistically analyse the existing literature to provide future recommendations for resistance training for cardiovascular diseases.

Despite growing scholarly interest in participatory practices within the archival field, there remains a lack of comprehensive synthesis on how such approaches are implemented through public programming and what outcomes they yield across different regional contexts. This study addresses this gap by systematically reviewing participatory approaches in archival public programming, aiming to classify their forms, evaluate their impacts, and identify implementation challenges.

Despite growing scholarly interest in participatory practices within the archival field, there remains a lack of comprehensive synthesis on how such approaches are implemented through public programming and what outcomes they yield across different regional contexts. This study addresses this gap by systematically reviewing participatory approaches in archival public programming, aiming to classify their forms, evaluate their impacts, and identify implementation challenges.

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

Systematic Investment Plans (SIPs) have gained popularity as a disciplined approach to investing, allowing individuals to invest fixed amounts at regular intervals. However, optimizing the allocation of funds across various assets to maximize returns while minimizing risk remains a challenge. This paper explores the application of Linear Programming (LP) in optimizing SIPs. Using Python, the investment problem has been formulated as a linear programming model. It demonstrates how investors can maximize returns subject to constraints such as budget, risk tolerance, and investment horizon. The results indicate that LP can be a powerful tool for enhancing the efficiency of SIPs, providing a structured approach to asset allocation that aligns with investors' financial goals. The research highlights the role of LP in determining the optimal portfolio by solving objective functions that represent returns, while also factoring in real-world investment constraints. Through this approach, investors can potentially improve the performance of their SIP portfolios and make more informed decisions that align with their financial goals. The results demonstrate the effectiveness of LP in systematic investment strategies.

Systematic Investment Plans (SIPs) have gained popularity as a disciplined approach to investing, allowing individuals to invest fixed amounts at regular intervals. However, optimizing the allocation of funds across various assets to maximize returns while minimizing risk remains a challenge. This paper explores the application of Linear Programming (LP) in optimizing SIPs. Using Python, the investment problem has been formulated as a linear programming model. It demonstrates how investors can maximize returns subject to constraints such as budget, risk tolerance, and investment horizon. The results indicate that LP can be a powerful tool for enhancing the efficiency of SIPs, providing a structured approach to asset allocation that aligns with investors' financial goals. The research highlights the role of LP in determining the optimal portfolio by solving objective functions that represent returns, while also factoring in real-world investment constraints. Through this approach, investors can potentially improve the performance of their SIP portfolios and make more informed decisions that align with their financial goals. The results demonstrate the effectiveness of LP in systematic investment strategies.

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This research project is designed as a systematic review, with a rigorous methodology employed to comprehensively analyse public programming within archival institutions. The fundamental purpose of this study is to deliver an in-depth examination of the various public programming activities that archives undertake, coupled with a thorough evaluation of the outcomes that these activities generate. In synthesising evidence derived from a multitude of scholarly sources, the research endeavours to identify both the strategies that have proven most effective in engaging the public and the challenges that archival institutions commonly encounter in their outreach efforts. Furthermore, it seeks to pinpoint potential opportunities that could enhance public programming and foster stronger connections between archives and the communities they serve. The anticipated outcomes of this research are primarily directed towards advancing archival practices and enriching the academic discourse surrounding archival outreach and community engagement. It is expected that the study will yield evidence-based insights, providing a foundation for the development of robust and effective public programming frameworks. Moreover, the research aims to underscore the pivotal role of public programming in improving the accessibility of archival resources, thereby facilitating greater utilisation of these valuable materials. Therefore, this scholarly endeavour strives to cultivate a deeper understanding of how public programming can be strategically optimised to not only promote the use of archival collections but also to foster a broader societal appreciation for documentary heritage and its significance.

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

The primary question of this study is to determine whether a established set of resistance training guideline exists for patients with cardiovascular diseases. And if so, synthesise the existing literature to provide future recommendations for resistance training for cardiovascular disease.

The primary question of this study is to determine whether a established set of resistance training guideline exists for patients with cardiovascular diseases. And if so, synthesise the existing literature to provide future recommendations for resistance training for cardiovascular disease.

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This thesis addresses some of these problems by developing a formal basis for the design of parallel programs in form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. It allows the development of reactive systems, that is, possibly non-terminating programs designed to interact persistently with their environment. Moreover the specification of liveness properties such as termination or eventual entry is supported by our methodology. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. Most refinement rules are syntax-directed in the sense that each rule corresponds to a specific language construct. The calculus straddles both concurrency paradigms.

Teaching computer programming to novices is a difficult task due to the complex nature of the subject, as negative stereotypes are associated with programming and because introductory programming courses often fail to encourage student understanding. This Protocol outlines the plan that is to be followed in order to investigate the effectiveness of using robots as tools to aid the process of teaching programming. Such a study will help to determine whether the use of robotic technology can help to overcome current barriers which novice programmers face and whether there is scope for future research activities to explore such an area. The Systematic Literature Review (SLR) methodology has been selected in order to achieve these objectives. Nine electronic databases and the proceedings from six conferences and two journals will be searched for literature relevant to the study. The SLR is a trustworthy, rigorous and auditable tool and is one that allows for existing evidence to be collected and summarised while identifying gaps in current research. This Protocol describes the plan that is to be followed in order to ensure the successful implementation of the SLR. The Protocol is split into sections that report on the research questions to be addressed, the search strategy to be implemented, details of how literature will be selected for inclusion in the review, the criteria for study quality assessment, discussion on methods of data extraction and analysis of potential limitations that may impact the study. As no past SLR has been found to examine the use of robots in such a context the study that will follow this Protocol will be the first of its kind. It is intended that this Protocol can be used as a resource for researchers who are looking to perform a SLR in a related education field. Moreover, the Protocol will act as a source of reference once the SLR has been completed and disseminated. Appended is a Study Quality Assessment Form.

The researchers explored whether implementation of a systematic outcomes-based assessment process is necessary for demonstrating quality in service learning programs at a two-year and a four-year institution. The findings revealed that Western Community College and the University of the Coast maintained quality service-learning programs, which met their established learning goals and reflected the community's needs, by incorporating numerous components of a systematic outcomes-based assessment process, even though this process had not been established.

In the present study, we will examine whether the cross-race recognition deficit can be reduced by directing participants' attention to the lower half of cross-race faces

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)

This report studies the applicability of the Theory of Software Science to COBOL Programs. A COBOL analyzer was written to produce the most important Software Science metrics. The analyzer was used to study several COBOL Databases. The analyzer has been distributed to AIRMICS and to several other organizations including Ohio State University, Jet Propulsion Labs, CINCOM INC., and the University of Trondheim, Norway. Using the analyzer we investigated the software Science Effort Estimator and compared this with estimator based on lines of code and on 'cyclometric complexity.' Our experiments show that the software science effort estimator works reasonably well only if a program is properly modularized and if inter-module factors are included. Published reports on our findings are available on request. We also studied the language level hypothesis of software science in a COBOL environment. While the study shows that the mean language level for COBOL falls between those for FORTRAN and PL/I, the study also shows that language level is heavily dependent on the size of the program and that it fluctuates too much to be considered 'constant' as the Halstead theory postulates. (Author)