Dissertations / Theses on the topic 'Engineering Programs'
To see the other types of publications on this topic, follow the link: Engineering Programs.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Engineering Programs.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Orr, Harrison. "Student Retention in Community College Engineering and Engineering Technology Programs." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3657.
Full textAbstract:
An ex-pos-facto non-experimental quantitative study was conducted to examine the academic, financial, and student background factors that influence first-to-second year retention of engineering and engineering technology students at U.S. community colleges. Analysis of the five research questions was done using a chi-square test and multiple logistic regressions. Data were obtained from the National Center for Education Statistics (NCES) Beginning Postsecondary Students 2012/2014 (BPS: 12/14) study. Computations were performed using PowerStats, a web-based statistical tool provided by the NCES, as well as IBM SPSS 25.
The sample population consisted of students who entered postsecondary education for the first time in the 2011-2012 academic year and enrolled in an engineering or engineering technology program at a community college. Predictor variables were identified from the dataset and grouped into the categories of academic, financial, and student background variables. These groupings were used as individual models to predict first-to-second year retention of community college engineering and engineering technology students using logistic regressions. Finally, individual variables that displayed statistical significance were then combined and were used as a model to predict student retention with a logistic regression.
Results indicate that community college engineering and engineering technology students are not retained at a significantly different rate than non-engineering and engineering technology majors. In addition, the groupings of academic and student background variables did not have a significant impact on the retention of community college engineering and engineering technology students, while the grouping of financial variables did have a significant impact on retention. The variables attendance pattern (academic), TRIO program eligibility criteria and total aid amount (financial), and dependency status (student background) were all statistically significant to their respective predictor models. Finally, the combination of these statistically significant academic, financial, and student background variables were significant predictors of retention.
2
Grahn, Andreas. "Requirement engineering in programs that generates applications." Thesis, University West, Department of Informatics and Mathematics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-587.
Full text
3
An, Li. "University programs in software engineering : a survey." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ64074.pdf.
Full text
4
Coleman, Jesse J. "The design, construction, and implementation of an engineering software command processor and macro compiler /." Online version of thesis, 1995. http://hdl.handle.net/1850/12219.
Full text
5
Handa, Sunny. "Reverse engineering computer programs under Canadian copyright law." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22693.
Full textAbstract:
The field of copyright law has been especially active in recent times as a result of its application to computer programs. Copyright law, not originally designed to protect such works, has had to adapt to suit the special nature of computer programs. This paper addresses the applicability of copyright law to the reverse engineering of computer programs. Reverse engineering is a method by which programmers may uncover the ideas and processes used within an existing computer program, thereby allowing the construction of compatible computer programs. Reverse engineering may also be used to create works which are directly competitive with the original program, and may also be used to assist in the piracy of computer programs. The mere act of reverse engineering computer programs, regardless of its purpose, potentially infringes the copyright of the computer program in question, notwithstanding whether the results of the process are used in an infringing manner.Recently both the European Union countries and the United States have accepted reverse engineering as an exception to copyright infringement. The European Union has opted for a legislative solution, whereas in the United States several courts have construed the fair use exception contained in that country's Copyright Act as allowing reverse engineering.
In this paper, it is argued that Canada must also adopt a reverse engineering exception to copyright infringement. It is claimed that the implementation of such an exception is justified through examination of the underlying policy goals of copyright law in the context of an economic framework. Reverse engineering fosters the creation of standards which, it is argued, increase societal wealth. The existence of a reverse engineering exception is consistent with the balance between the economic rights of individual authors and societal technological progress, which copyright seeks to maintain. It is demonstrated that copyright exists as the only form of applicable intellectual property protection which can broadly limit the disclosure of concepts underlying computer programs.
It is suggested that an effective exception should be statutorily based. It is felt that the existing fair dealing exception contained in the Canadian Copyright Act is juridically under-developed and too uncertain to provide an effective solution to the reverse engineering problem. A legislative solution would send a clear message to the software industry as well as to the courts, and could prohibit contracting out of the Copyright Act which would potentially be allowed were a judicial solution sought. It is further suggested that the statutory exception should broadly allow the process of reverse engineering as opposed to limiting it to cases where compatibility is sought. Narrowing the exception creates conceptual difficulties in applying limits to reverse engineering. Allowing a broad exception would avoid these difficulties while continuing to provide copyright holders with protection if, after the reverse engineering process is concluded, their protectable expression is used within another's software product.
6
Liang, Donglin. "Developing practical program analyses for programs with pointers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8203.
Full text
7
Leith, P. "Legal knowledge engineering : computing, logic and law." Thesis, Open University, 1985. http://oro.open.ac.uk/56914/.
Full textAbstract:
The general problem approached in this thesis is that of building computer based legal advisory programs (otherwise known as expert systems or Intelligent Knowledge Based Systems). Such computer systems should be able to provide an individual with advice about either the general legal area being investigated, or advice about how the individual should proceed in a given case. In part the thesis describes a program (the ELl program) which attempts to confront some of the problems inherent in the building of these systems. The ELl system is seen as an experimental program (currently handling welfare rights legislation) and development vehicle. It is not presented as a final commercially implementable program. We present a detailed criticism of the type of legal knowledge contained within the system. The second, though in part intertwined, major subject of the thesis describes the jurisprudential aspects of the attempt to model the law by logic, a conjunction which is seen to be at the heart of the computer/law problem. We suggest that the conjunction offers very little to those who are interested in the real application of the real law, and that this is most forcefully seen when a working computer system models that conjunction. Our conclusion is that neither logic nor rule-based methods are sufficient for handling legal knowledge. The novelty and import of this thesis is not simply that it presents a negative conclusion; rather that it offers a sound theoretical and pragmatic framework for understanding why these methods are insufficient - the limits to the field are, in fact, defined.
8
Samson, Brian R. "A system for writing interactive engineering programs in APL." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25108.
Full textAbstract:
As the use of computers in engineering becomes more significant and widespread, there is a growing need for interactive computer programs which can be used with a minimum of user preparation. This thesis presents and demonstrates a system for writing interactive engineering programs in APL, a programming language. A good interactive program is sensitive to the needs of the user, and generally includes help features, default options, escape features and check features. To include all of these features in a conventionally organized program is complicated and tedious, especially for longer programs with many interaction events between the program and the user. The system presented here makes it fairly simple to include all of the above features, and provides two additional benefits:
1. The logic of the program becomes more prominent, hence easier to follow and check.
2. The program tends to be highly modular in form, making it more readable and easier to test and debug.Applied Science, Faculty of
Civil Engineering, Department of
Graduate
9
Karlsson, Mårten. "Green concurrent engineering : a model for DFE management programs /." Lund : International Institute for Industrial Environmental Economics (Internationella miljöinstitutet), Univ, 2001.
Find full text
10
Griffin, William E., and Michael R. Schilling. "Analyzing cost, schedule, and engineering variances on acquisitions programs." Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/10615.
Full textAbstract:
MBA Professional ReportThis study of cost, schedule, and engineering variance (CV, SV, and EV) data identified in the Selected Acquisition Reports (SARs) of acquisition programs indicates that early program variances are significantly associated with future program variances. An enhanced understanding of CV, SV, and EV interrelationships and the connection between these program variances and the cost and schedule Earned Value contract variances will allow program managers to better understand the full programmatic impact of a variance problem. This understanding could also aid future researchers in identifying best practices in recovering from the identification of such a problem. In addition, the identification of CV, SV, and EV differences across Major Defense Acquisition Program (MDAP) types highlights the connection between segments of the defense industry and the development of best program management practices. This research first examines data using traditional descriptive statistics in order to determine whether identifiable patterns exist among MDAPs and their associated contracts. A primary objective of the analysis is to develop empirical models that employ cross-sectional, time-series data contained in the SARs. These models help explain the full effect of fixed-price incentive RandD contracts within MDAPs on cost and schedule variance during both engineering and manufacturing development (EMD) and production and deployment. It is anticipated that this analysis will also help close any existing gaps in the understanding of program versus contract management data.
11
Gatson, Jacqueline M. "Industry–university engagement in multicultural engineering programs: an exploratory study." Diss., Kansas State University, 2015. http://hdl.handle.net/2097/18948.
Full textAbstract:
Doctor of EducationDepartment of Educational Leadership
Michael Holen
Facing the rapidly increasing globalization of world economies and a steadily diversifying domestic consumer base, U.S. corporations have embraced the benefits of hiring more employees with diverse perspectives and experiences. Particularly in industries dependent upon knowledge of science, technology, engineering, and mathematics, recognition has grown that the American work force is seriously constrained by the clear underrepresentation of minority participants. In engineering, the most prevalent attempt to address these issues is through the establishment of multicultural engineering programs (MEPs), often designed as partnerships between universities and major corporate entities. These programs strive to identify, recruit, retain, educate and ultimately employ significant numbers of students of color to strengthen industry innovation and competitiveness. This investigation was initiated to expand the limited research literature on MEPs and the nature of their partnerships with industry. Using qualitative methodology, an exploratory viewpoint, and the lens of the Commitment-Trust Key Mediating Variable Model (KMV) of Relationship Marketing, the relationships of five mature and highly regarded university MEPs and one of their self identified primary industry partners were examined. Leaders of the National Association of Multicultural Engineering Program Advocates, the national representative body for MEPs, identified exemplary MEPs in the organization’s five regions; using a selection paradigm, five institutions were chosen for study selected from four of the regions. Each institution then identified a primary industry partner. Participants responded to in-depth interviews (MEPs) and questionnaires (industry) with respect to the nature, benefits, and challenges to both entities in the partnerships. Documents were reviewed for each program and industry. Responses were coded, crosschecked, and analyzed for patterns and themes. In particular, the study explored the issue of how commitment and trust are established in these partnership relationships. Twenty-four patterns and three themes emerged. Clearly, university-industry multicultural engineering partnerships are viewed as engendering important employment opportunities for underrepresented program graduates, promoting a well-developed pipeline of minority employee talent for industry, and increasing funding both for university multicultural programming and minority student support. The study also reports on the broad range of activities these partnerships practice. It suggests avenues for further study to enhance university-industry engagement.
12
Artiles-Fonseca, Mayra Sharlenne. "Choice in the Advisor Selection Processes of Doctoral Engineering Programs." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/102659.
Full textAbstract:
Research on doctoral student attrition has shown that one of the main reasons for which students do not persist in the Ph.D. is because of a poor relationship with their doctoral advisor. The importance of the advising relationship is especially true in science, math, and engineering degrees because of the science model of advising as the student is the advisor's employee, close collaborator, and apprentice. While much attention has been given to understanding the dynamics of the advising relationship, little attention has been given to on how these relationships commence or the context in which they begin. This study ultimately contributes to understanding the context of the inception of advisor- advisee relationships and how it ultimately relates to both faculty and doctoral student satisfaction. The following overarching research questions guide this dissertation: What are the processes for doctoral students to find advisors in engineering, science, and math? How is this process experienced by faculty and students? To address these questions, I conducted three studies. Through these studies, this dissertation: 1) Identified and described the types of advisor-advisee selection processes that exist in engineering, science, and math and examined trends and patterns across disciplines; 2) compared how two Chemical Engineering programs practice the advisor selection process and examined how faculty and graduate program directors negotiate agency in the process and 3) explored how students experience satisfaction of their basic needs in the advisor selection process of one Chemical Engineering program and examined which student attributes influence this satisfaction of needs. The results showed that there are multiple ways through which a student can find an advisor in science, math, and engineering doctoral program, but these vary widely by both discipline and field of study. The results also showed both students and faculty value the ability to select whom they will work with. However, both groups may also need support in making this decision regarding with whom they will work. Overall, the results of this dissertation highlight the importance of developing practices that balance an individual's need for support and autonomy to improve their satisfaction.Doctor of Philosophy
13
Soltani, Atash. "The Contrast of Systems Engineering Application in Two Spacecraft Programs." Digital Commons at Loyola Marymount University and Loyola Law School, 2014. https://digitalcommons.lmu.edu/etd/432.
Full text
14
Martin, Gary Richard. "Career Counseling Practices In Abet-Accredited Engineering Cooperative Education Programs." Scholarly Commons, 1986. https://scholarlycommons.pacific.edu/uop_etds/3321.
Full textAbstract:
Purpose. The purpose of this study was to describe and evaluate the career counseling practices in all schools of engineering in the United States with ABET-accredited engineering Cooperative Education programs. Procedure. A thirty-two item questionnaire was developed and sent out to all ABET-accredited Cooperative Education offices. All the engineering coordinators in each office filled out the questionnaire. Eighty-six percent of the schools responded to the surveys. Findings. (1) Most engineering Co-op coordinators have educational backgrounds in engineering and have taken at least one class in career counseling. (2) Co-op coordinators tend to have caseloads and other responsibilities which restrict the amount of career counseling they can offer. (3) Little correlation exists between the amount of time coordinators spend career counseling and the ability of students to obtain jobs. (4) There is a slight negative correlation between coordinators' caseloads and their placement rate. (5) There is a slight positive correlation between coordinators' caseloads and the amount of time their students receive in career counseling. (6) There is a slight positive correlation between coordinators' caseloads and the amount of time they believe students should receive in career counseling. (7) There is no correlation between the total amount of time students receive in career counseling and their ability to secure Co-op jobs. (8) There are very slight positive correlations between the amount of time students receive in seven of eighteen specified career counseling services and their ability to get a Co-op job. Conclusions. The average coordinator was found to have a career counseling training level of one class. Many slight correlations were found between the amount of career counseling which students receive and their ability to secure Co-op employment. It was also found that coordinators with average amounts of career counseling training tend to spend the most time in career counseling services. Recommendations. (1) Similar studies should be conducted with engineering Co-op programs which were not necessarily accredited by ABET, and non-engineering Co-op programs. (2) It would also be of interest to correlate time spent career counseling with other measures of "success" such as cost-effectiveness, and student satisfaction.
15
Islam, mohammad Nazrul. "Extending WCET benchmark programs." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13929.
Full textAbstract:
Today, traditional mechanical and electrical systems are replaced with special ICT (Information and communication technology) based solutions and with the invention of new technologies; this trend is increasing further more. This special ICT-based domain is called Real-time systems and today’s driveby-wire, electronic stability programs in car, control software in vehicles are just a few examples of real time systems. The task is a fundamental element of the software in a real-time system, and it is always necessary to know the longest execution time of a task, since missing a task’s deadline is a not allowed in a time critical hard real-time system. The longest execution time of a task or the Worst Case Execution Time (WCET) is estimated by WCET analysis. This estimation should be tight and safe to ensure the proper timing behavior of the real time system. But this WCET analysis is not always easy to perform, as the execution time of a task can vary by software characteristics like program flow or input data and also by hardware characteristics like speed of CPU, cache, pipeline and others. There are several methods and tools for WCET analysis. Some of them are commercial products and other are research prototypes. To verify and validate WCET analysis tools, evaluations of the tool’s properties are important, and thus WCET benchmark programs has emerged in recent years. These are intended for comparison between these tools properties and associated methods. The Mälardalen WCET benchmark suite has been maintained to evaluate the properties of various tool sets. In this thesis these benchmarks programs have been analyzed by SWEET (Swedish WCET Analysis Tool), the main tool used in this thesis. SWEET is a research prototype for WCET analysis. The main goal of this thesis work was to extend existing benchmark programs for WCET tools. It was obvious that most work load will be on benchmark program extension and at the beginning the work has been started by analyzing different small WCET benchmark programs. The evaluation of SWEET’s properties has been taken into a further extent by analyzing another benchmark program which is called PapaBench, a free real-time benchmark from Paparazzi project that represents a real-time application, developed to be embedded on different Unmanned Aerial Vehicles (UAV). Lots of time was required to complete the analyzing of PapaBench. The main reason behind this extensive work was that we decided to participate with SWEET in WCET Challenge 2011 (WCC 2011). So the purpose of the thesis ultimately turned into analyzing PapaBench instead of extending the WCET benchmark programs. The result of the thesis work is therefore mainly the analysis results from the analysis of PapaBench, which were reported to WCC 2011. The results from WCC 2011 are included in a paper presented at the WCET 2011 workshop, which took place in July 2011 in Porto, Portugal. Another part of the work was to examine real-time train control software which was provided by Bombardier. The main reason behind getting these industrial codes was to possibly add new benchmark programs to the Mälardalen WCET benchmark suite. A thorough manual study of this code has been performed to find out whether new benchmark programs could be found. However, due to its structure and size, we decided that this code was not suitable to add to the Mälardalen WCET benchmark suite.
16
Blumofe, Robert D. (Robert David). "Executing multithreaded programs efficiently." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11095.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 135-145).
by Robert D. Blumofe.
Ph.D.
17
Frigo, Matteo 1968. "Portable high-performance programs." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80594.
Full text
18
Setiowijoso, Liono. "Data Allocation for Distributed Programs." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5102.
Full textAbstract:
This thesis shows that both data and code must be efficiently distributed to achieve good performance in a distributed system. Most previous research has either tried to distribute code structures to improve parallelism or to distribute data to reduce communication costs. Code distribution (exploiting functional parallelism) is an effort to distribute or to duplicate function codes to optimize parallel performance. On the other hand, data distribution tries to place data structures as close as possible to the function codes that use it, so that communication cost can be reduced. In particular, dataflow researchers have primarily focused on code partitioning and assignment. We have adapted existing data allocation algorithms for use with an existing dataflow-based system, ParPlum. ParPlum allows the execution of dataflow graphs on networks of workstations. To evaluate the impact of data allocation, we extended ParPlum to more effectively handle data structures. We then implemented tools to extract from dataflow graphs information that is relevant to the mapping algorithms and fed this information to our version of a data distribution algorithm. To see the relation between code and data parallelism we added optimization to optimize the distribution of the loop function components and the data structure access components. All of these are done automatically without programmer or user involvement. We ran a number of experiments using matrix multiplication as our workload. We used different numbers of processors and different existing partitioning and allocation algorithm. Our results show that automatic data distribution greatly improves the performance of distributed dataflow applications. For example, with 15 x 15 matrices, applying data distribution speeds up execution about 80% on 7 machines. Using data distribution and our code-optimizations on 7 machines speeds up execution over the base case by 800%. Our work shows that it is possible to make efficient use of distributed networks with compiler support and shows that both code mapping and data mapping must be considered to achieve optimal performance.
19
Wu, Jerry. "Using dynamic analysis to infer Python programs and convert them into database programs." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/121643.
Full textAbstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 195-196).
I present Nero, a new system that automatically infers and regenerates programs that access databases. The developer first implements a Python program that uses lists and dictionaries to implement the database functionality. Nero then instruments the Python list and dictionary implementations and uses active learning to generate inputs that enable it to infer the behavior of the program. The program can be implemented in any arbitrary style as long as it implements behavior expressible in the domain specific language that characterizes the behaviors that Nero is designed to infer. The regenerated program replaces the Python lists and dictionaries with database tables and contains all code required to successfully access the databases. Results from several inferred and regenerated applications highlight the ability of Nero to enable developers with no knowledge of database programming to obtain programs that successfully access databases.
by Jerry Wu.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
20
Bani, Younis Mohammed [Verfasser]. "Re-Engineering Approach for PLC Programs based on Formal Methods : Re-Engineering-Ansatz für SPS-Programme auf Basis formaler Beschreibungen / Mohammed Bani Younis." Aachen : Shaker, 2006. http://d-nb.info/1166515214/34.
Full text
21
Grasso, Barton. "Benchmarking the Management of Construction Programs." NCSU, 2007. http://www.lib.ncsu.edu/theses/available/etd-03222007-001859/.
Full textAbstract:
The management of large capital improvement construction programs involves the efforts of both internal staff and external service providers. An understanding of how construction programs are managed, either through internal or external staff, is essential in tracking future trends and determining improvements and best practices in the management process. To address this need a survey was developed by a focus group of industry professionals. The survey was distributed to the membership of a number of professional organizations that represented owners within the construction industry. The survey attempted to determine both the current status of managing a construction program throughout a broad range of demographic characteristics (including the definition of program management) and the hiring of an external program manager. The survey and subsequent analysis that focused on the management of a construction program examined the following key points: role of a program manager, internal capabilities, outsourcing, sourcing strategy, and management costs. The survey and subsequent analysis that focused on hiring an external program manager examined: program management fees, type of firms used in managing a construction program, factors considered when hiring a program manager, and organizational structure. The results of the survey have also been segregated by public and private organizations to denote any differences in the management of public and private construction programs. A key contribution of this research was determining the percentage of outsourcing within each phase of the construction process and the number of service providers considered in the selection process. Also, a multifaceted definition of program management was developed from the research for use in clarifying the concept of program management within construction.
22
Patterson, Andrew Joseph 1974. "Tool support for introductory software engineering education." Monash University, School of Computer Science and Software Engineering, 2002. http://arrow.monash.edu.au/hdl/1959.1/7738.
Full text
23
Boyd-Sinkler, Karis Elisabeth. "Exploring the Interpersonal Relationships of Black Men in Undergraduate Engineering Programs." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/103709.
Full textAbstract:
The dilemma of making education an equitable system, especially for minoritized groups, has persisted for centuries. While there have been efforts aimed at decreasing disparities, there is still more work that needs to be done. An often-overlooked population in science, technology, engineering, and math (STEM) is Black men—a group at the nexus of being a gender majority and racial minority. Thus, the purpose of this exploratory research study is to understand how Black men experience interpersonal relationships in undergraduate engineering programs. The overarching research question that guides this study is: What are the qualitatively different aspects of interpersonal relationships experienced by Black men in undergraduate engineering programs? Using Bronfenbrenner's Ecological Systems Theory as a lens and a quasi-phenomenography methodology to understand the variance of the students' relationships, I conducted 14 semi-structured interviews with students who identified as a Black man and were a second-year or higher in their undergraduate engineering program. By examining interpersonal relationships, I clarify the meaningfulness of relationships at one historically Black college and university (N=1) and two historically white institutions (N=13). A total of seven relationship types and ten different ways students described their relationships were identified in the data. Each of the ways students described their relationship was organized on the emergent domains of academic, emotional/mental, financial, professional, social, and spiritual. Students also mentioned five environmental influences that impacted their experiences in engineering. My results indicate that students find value in relationships with people who were relatable, people who could provide insight or knowledge, and people who showed a sense of care or concern for the student. Students also mentioned how environmental influences bear significance on their over experience in engineering. The present study lays the groundwork for holistically examining the interpersonal relationships of Black men in undergraduate engineering programs.Doctor of Philosophy
For decades, Black men have experienced educational hardships from as early as first grade. While many researchers have identified areas to improve the educational experience for Black men, few have looked at the educational experience of Black men in science, technology, engineering, and math (STEM). My research adds to the current conversations surrounding Black men in undergraduate engineering programs by looking at how relationships impact their educational experiences. I conducted a research study with 14 Black men in undergraduate engineering programs at two historically white institutions (N=13) and one historically Black university (N=1). I asked Black men about the types of relationships they had and why those relationships were meaningful to them. I also asked the students if there were outside influences such as stereotypes held by society that might impact how they look at their relationships. The students primarily discussed relationships with their STEM peers and professors. Relationships that were more meaningful for students were with people who were relatable, people who could provide insight or knowledge, and people who showed a sense of care or concern for the student. Outside influences that impacted students' relationships were their academic major, the type of institution they attended, their gender, their race/ethnicity, and National events. These findings contribute in several ways to our understanding of the value of relationships and provide a basis for future research involving Black men in STEM.
24
Albiz, Niccolas. "Sustainability Education at Industrial Engineering Programs in Sweden : A study of the relevant and received sustainability education, and the associated challenges, at 5-year industrial engineering programs." Thesis, KTH, Hållbarhet och industriell dynamik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177134.
Full textAbstract:
The public concern for sustainability issues is ever increasing whilst the trust in corporations is decreasing. CEOs now see sustainability concern and compliance as an important component in retaining their competitive advantage and regaining the trust of their surrounding community. For these reasons it is important to find new manners of uniting societal improvement with business, requiring new forms of competencies. This study has investigated what sustainability education is actually central to the industrial engineering profile, as well as what of this is then covered in the programs. The study involved two phases. The first involved interviewing experts as to what was central for these engineers to learn, resulting in a content list. The second phase involved mapping the instances of this content in the five largest industrial engineering programs (covering circa 74% of these students) as well as the associated challenges to broaching this content. The first phase was primarily qualitative whilst the second phase was largely quantitative, though each data point consisted of a qualitative interview. Five key insights can be drawn from the study regardless of normative stand-point. 1) The sustainability topics that were deemed relevant cover a vast area of disciplines and aspects. 2) There is a skewedness in the content covered, favouring the environmental aspects. 3) There is a lack of integrative instances where the knowledge from different sources and perspectives is synthesized. 4) The key challenges revolve around concept definition and communication. 5) The normativity, interconnectedness and pedagogics contribute with uncertainty and complexity in the assessment of sustainability education. The study is finalized with a synthesis of the various insights to arrive at the conclusion that having sustainable business practice as the aim of the programs, establishing common content goals and employing active learning approach would circumvent many of the perceived challenges as well as align the programs with the need of the industry. This study contributes with deeper understanding of the sustainability education required and provided to industrial engineering students in Sweden. As such the study has practical applications for the programs studied. The theoretical implications of this study lie in the empirical data achieved regarding the topics of relevance to these engineers, showing high levels of agreement with current literature, as well as the perceived challenges to broaching this content in the current curricula. Furthermore it provides empirical data as to the sustainability education received at different programs.Allmänhetens intresse över hållbarhetsfrågor ökar samtidigt som tilliten för företag minskar. Företagsledare ser numera hållbarhet som en viktig komponent i att bibehålla deras konkurrenskraft och att återfå allmänhetens tillit. Det är således viktigt att finna nya sätt att förena samhällsnytta med företagande, vilket kräver nya sorters kompetens inom hållbarhetsområdet. Denna studie har undersökt vilka hållbarhetsämnen som är centrala för industriell ekonomistudenten, givet deras profil i näringslivet, samt vad av detta som berörs i programmen. Studien var indelad i två faser. Den första ämnade till att skapa en lista av de, för dessa ingenjörer, centrala ämnen genom intervjuer med experter inom området. Den andra fasen kartlagde de ämnen som berördes inom de fem största industriell ekonomiprogrammen (täckandes cirka 74% av studenterna) samt vilka utmaningar som associerades till detta arbete. Den första fasen var till stora delar kvalitativ. Den efterföljande fasen var en kvantitativ kartläggning där varje datapunkt representerade en kvalitativ intervju. Ur studien uppkom fem nyckelinsikter, som står sig oavsett normativ ståndpunkt. Dessa inkluderade: 1) De hållbarhetsämnen som ansågs relevanta för denna målgrupp spänner en vid area av discipliner och aspekter. 2) Fördelningen på ämnen som täcks inom programmen påvisar en preferens mot den miljömässiga aspekten. 3) Det finns en brist på integrerande instanser i utbildningarna, där kunskap från olika aspekter och källor sammankopplas. 4) Nyckelutmaningarna centreras runt definiering och kommunikation. 5) Normativitet, sammankoppling och pedagogik bidrar alla till osäkerhet och komplexitet i bedömning av hållbarhetsutbildningar. Studien avslutas med en syntes av de olika insikterna för att komma till slutsatsen att hållbart företagande som övergripande syfte för utbildningarna, en gemensam målbild för innehållet samt komplettering med ”active learning” metodiker skulle övervinna många av de uppfattade utmaningarna samtidigt som det skulle uppfylla näringslivets kompetensbehov för framtida konkurrenskraft. Denna studie bidrar till förståelsen över vilken hållbarhetsutbildning som bedrivs och vilken som anses behövd av industriell ekonomistudenter i Sverige. Studien har därmed praktiska implikationer för de program som studerades. Teoretiska bidrag inkluderas av den empiriska data som framtagits gällande relevanta hållbarhetsämnen vilka uppvisar hög konvergens med litteraturen inom ämnen, samt de upplevda utmaningar kring att inkludera detta ämne i befintliga program. Vidare bidrar studien med empirisk data kring det som faktiskt berörs idag på de olika industriell ekonomiprogrammen.
25
Hsieh, Wilson Cheng-Yi. "Extracting parallelism from sequential programs." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14752.
Full text
26
SermuliÅ, Å¡ JÄ nis. "Cache optimizations for stream programs." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33359.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (leaves 73-75).
As processor speeds continue to increase, the memory bottleneck remains a primary impediment to attaining performance. Effective use of the memory hierarchy can result in significant performance gains. This thesis focuses on a set of transformations that either reduce cache-miss rate or reduce the number of memory accesses for the class of streaming applications, which are becoming increasingly prevalent in embedded, desktop and high-performance processing. A fully automated optimization algorithm is presented that reduces the memory bottleneck for stream applications developed in the high-level stream programming language StreamIt. This thesis presents four memory optimizations: 1) cache aware fusion, which combines adjacent program components while respecting instruction and data cache constraints, 2) execution scaling, which judiciously repeats execution of program components to improve instruction and state locality, 3) scalar replacement, which converts certain data buffers into a sequence of scalar variables that can be register allocated, and 4) optimized buffer management, which reduces the overall number of memory accesses issued by the program. The cache aware fusion and execution scaling reduce the instruction and data cache-miss rates and are founded upon a simple and intuitive cache model that quantifies the temporal locality for a sequence of actor executions.
(cont.) The scalar replacement and optimized buffer management reduce the number of memory accesses. An experimental evaluation of the memory optimizations is presented for three different architectures: StrongARM 1110, Pentium 3 and Itanium 2. Compared to unoptimized StreamIt code, the memory optimizations presented in this thesis yield a 257% speedup on the StrongARM, a 154% speedup on the Pentium 3, and a 152% speedup on Itanium 2. These numbers represent averages over our streaming benchmark suite. The most impressive speedups are demonstrated on an embedded processor StrongARM, which has only a single data and a single instruction cache, thus increasing the overall cost of memory operations and cache misses.
by JÄnis. SermuliÅÅ¡.
M.Eng.
27
Milicevic, Aleksandar Ph D. Massachusetts Institute of Technology. "Executable specifications for Java programs." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62442.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 55-57).
In this thesis, we present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, written in first-order relational logic with transitive closure, and the imperative language for this purpose is Java. By being able to mix imperative code with executable declarative specifications, the user can easily express constraint problems in-place, i.e. in terms of the existing data structures and objects on the heap. After a solution is found, our framework will automatically update the heap to reflect the solution, so the user can continue to manipulate the program heap in the usual imperative way, without ever having to manually translate the problem back and forth between the host programming environment and the solver language. We show that this approach is not only convenient, but, for certain problems, like puzzles or NP-complete graph algorithms, it can also outperform the manual implementation. We also present an optimization technique that allowed us to run our tool on heaps with almost 2000 objects.
by Aleksandar Milicevic.
S.M.
28
Ansel, Jason (Jason Andrew). "Autotuning programs with algorithmic choice." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/87913.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 231-251).
The process of optimizing programs and libraries, both for performance and quality of service, can be viewed as a search problem over the space of implementation choices. This search is traditionally manually conducted by the programmer and often must be repeated when systems, tools, or requirements change. The overriding goal of this work is to automate this search so that programs can change themselves and adapt to achieve performance portability across different environments and requirements. To achieve this, first, this work presents the PetaBricks programming language which focuses on ways for expressing program implementation search spaces at the language level. Second, this work presents OpenTuner which provides sophisticated techniques for searching these search spaces in a way that can easily be adopted by other projects. PetaBricks is a implicitly parallel language and compiler where having multiple implementations of multiple algorithms to solve a problem is the natural way of programming. Choices are provided in a way that also allows our compiler to tune at a finer granularity. The PetaBricks compiler autotunes programs by making both fine-grained as well as algorithmic choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. PetaBricks also introduces novel techniques to autotune algorithms for different convergence criteria or quality of service requirements. We show that the PetaBricks autotuner is often able to find non-intuitive poly-algorithms that outperform more traditional hand written solutions. OpenTuner is a open source framework for building domain-specific multi-objective program autotuners. OpenTuner supports fully-customizable configuration representations, an extensible technique representation to allow for domain-specific techniques, and an easy to use interface for communicating with the program to be autotuned. A key capability inside OpenTuner is the use of ensembles of disparate search techniques simultaneously; techniques that perform well will dynamically be allocated a larger proportion of tests. OpenTuner has been shown to perform well on complex search spaces up to 10³⁰⁰⁰ possible configurations in size.
by Jason Ansel.
Ph. D.
29
Ziyuan, Jiang. "Synthesis of GPU Programs from High-Level Models." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230163.
Full textAbstract:
Modern graphics processing units (GPUs) provide high-performance general purpose computation abilities. They have massive parallel architectures that are suitable for executing parallel algorithms and operations. They are also throughput-oriented devices that are optimized to achieve high throughput for stream processing. Designing efficient GPU programs is a notoriously difficult task. The ForSyDe methodology is suitable to ease the difficulties of GPU programming. The methodology encourages software development from a high level of abstraction and then transforming the abstract model to an implementation through a series of formal methods. The existing ForSyDe models support the synchronous data flow (SDF) model of computation (MoC) which is suitable for modeling stream computations and is good for synthesizing efficient stream processing programs. There also exists high-level design models named parallel patterns that are suitable to represent parallel algorithms and operations. The thesis studies the method of modeling parallel algorithms using parallel patterns, and explores the way to synthesize efficient OpenCL implementation on GPUs for parallel patterns. The thesis also tries to enable the integration of parallel patterns into the ForSyDe SDF model in order to model stream parallel operations. An automation library that helps designing stream programs for parallel algorithms targeting GPUs is purposed in the thesis project. Several experiments are performed to evaluate the effectiveness of the proposed library regarding implementations of the high-level model.Moderna grafikbehandlingsenheter (GPU) tillhandahåller högpresterande generella syftes-beräkningsförmågor. De har massiva parallella arkitekturer som är lämpliga för att utföra parallella algoritmer och operationer. De är också streaminriktade enheter som är optimerade för att uppnå hög streaming för streamingbehandling. Att utforma effektiva GPU-program är en notoriskt svårt uppgift. ForSyDe-metoden är lämplig för att underlätta svårigheterna med GPU-programmering. Metodiken uppmuntrar mjukvaruutveckling från en hög nivå av abstraktion för att sedan omvandla den abstrakta modellen till en implementering genom en rad formella metoder. De befintliga ForSyDe-modellerna stöder synkron dataflöde (SDF) modell av beräkning (MoC) som är lämplig för modellering av streaming-beräkningar och är bra för att syntetisera effektiv streaming-bearbetningsprogram. Det finns också högkvalitativa designmodeller som kallas parallella mönster vilka är lämpliga för att representera parallella algoritmer och operationer. Avhandlingen analyserar metoden för modellering av parallella algoritmer med parallella mönster, och utforskar sättet att syntetisera effektiv OpenCL-implementering för GPU för parallella mönster. Avhandlingen försöker även att möjliggöra integration av parallella mönster i ForSyDe SDF-modellen för att modellera streaming parallella operationer. Ett automationsbibliotek som hjälper till att designa stream-program för parallella algoritmer som riktar sig mot GPU:er är avsedda för avhandlingsprojektet. Flera experiment utförs för att utvärdera effektiviteten hos det föreslagna biblioteket avseende implementering av högnivåmodellen.
30
Chuck, Lisa Gay Marie. "A Predictive Model for Benchmarking Academic Programs (pBAP) Using U.S. News Ranking Data for Engineering Colleges Offering Graduate Programs." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2396.
Full textAbstract:
Improving national ranking is an increasingly important issue for university administrators. While research has been conducted on performance measures in higher education, research designs have lacked a predictive quality. Studies on the U.S. News college rankings have provided insight into the methodology; however, none of them have provided a model to predict what change in variable values would likely cause an institution to improve its standing in the rankings. The purpose of this study was to develop a predictive model for benchmarking academic programs (pBAP) for engineering colleges. The 2005 U.S. News ranking data for graduate engineering programs were used to create a four-tier predictive model (pBAP). The pBAP model correctly classified 81.9% of the cases in their respective tier. To test the predictive accuracy of the pBAP model, the 2005 U.S .News data were entered into the pBAP variate developed using the 2004 U.S. News data. The model predicted that 88.9% of the institutions would remain in the same ranking tier in the 2005 U.S. News rankings (compared with 87.7% in the actual data), and 11.1% of the institutions would demonstrate tier movement (compared with an actual 12.3% movement in the actual data). The likelihood of improving an institution's standing in the rankings was greater when increasing the values of 3 of the 11 variables in the U.S. News model: peer assessment score, recruiter assessment score, and research expenditures.Ed.D.
Department of Educational Research, Technology and Leadership
Education
Educational Leadership
31
Yasin, Atif. "Synergistic Timing Speculation for Multi-Threaded Programs." DigitalCommons@USU, 2016. https://digitalcommons.usu.edu/etd/5229.
Full textAbstract:
Timing speculation is a promising approach to increase the processor performance and energy efficiency. Under timing speculation, an integrated circuit is allowed to operate at a speed faster than its slowest path|the critical path. It is based on the empirical observation, which is presented later in the thesis, that these critical path delays are rarely manifested during the program execution. Consequently, as long as the processor is equipped with an error detection and recovery mechanism, its performance can be increased and/or energy consumption reduced beyond that achievable by any other conventional operation.
While many past works have dealt with timing speculation within a single core, in this work, a new direction is being uncovered | timing speculation for a multi-core processor executing a parallel, multi-threaded application. Through a rigorous cross-layered circuit architectural analysis, it is observed that during the execution of a multi-threaded program, there is a significant variation in circuit delay characteristics across different threads.
Synergistic Timing Speculation (SynTS) is proposed to exploit this variation (heterogeneity) in path sensitization delays, to jointly optimize the energy and execution time of the many-core processor. In particular, SynTS uses a sampling based online error probability estimation technique, coupled with a polynomial time algorithm, to optimally determine the voltage, frequency and the amount of timing speculation for each thread. The experimental analysis is presented for three pipe stages, namely, Decode, SimpleALU and ComplexALU, with a reduction in Energy Delay Product by up to 26%, 25% and 7.5% respectively, compared to existing per-core timing speculation scheme. The analysis also embeds a case study for a General Purpose Graphics Processing Unit.
32
Miller, David N. "Systems Engineering and Integration of Control Centers in Support of Multiple Programs." International Foundation for Telemetering, 1989. http://hdl.handle.net/10150/614682.
Full textAbstract:
International Telemetering Conference Proceedings / October 30-November 02, 1989 / Town & Country Hotel & Convention Center, San Diego, CaliforniaThe Multiprogram Control Center (MPCC) at the Johnson Space Center (JSC) was envisioned as a means of satisfying the ground control requirements for complex Space Transportation System (STS) payloads and unmanned vehicles. This paper will describe the role and characteristics of the MPCC and its relationship to the STS Mission Control Center (MCC). It will also reveal significant problems encountered and useful solutions to some fairly generic problems. It will discuss the current direction of control center technology and vendor opportunities from the MPCC's perspective. It will conclude with specific lessons learned thus far in the MPCC project.
33
Wang, Hongjie. "Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/36823.
Full textAbstract:
The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible region that is restricted by a set of constraints, each of which is defined in terms of nonconvex factorable functions. Such problems find widespread applications in production planning, location and allocation, chemical process design and control, VLSI chip design, and numerous engineering design problems. This thesis offers a first comprehensive methodological development and implementation for determining a global optimal solution to such factorable programming problems. To solve this class of problems, we propose a branch-and-bound approach based on linear programming (LP) relaxations generated through various approximation schemes that utilize, for example, the Mean-Value Theorem and Chebyshev interpolation polynomials, coordinated with a {em Reformulation-Linearization Technique} (RLT). The initial stage of the lower bounding step generates a tight, nonconvex polynomial programming relaxation for the given problem. Subsequently, an LP relaxation is constructed for the resulting polynomial program via a suitable RLT procedure. The underlying motivation for these two steps is to generate a tight outer approximation of the convex envelope of the objective function over the convex hull of the feasible region. The bounding step is thenintegrated into a general branch-and-bound framework. The construction of the bounding polynomials and the node partitioning schemes are specially designed so that the gaps resulting from these two levels of approximations approach zero in the limit, thereby ensuring convergence to a global optimum. Various implementation issues regarding the formulation of such tight bounding problems using both polynomial approximations and RLT constructs are discussed. Different practical strategies and guidelines relating to the design of the algorithm are presented within a general theoretical framework so that users can customize a suitable approach that takes advantage of any inherent special structures that their problems might possess. The algorithm is implemented in C++, an object-oriented programming language. The class modules developed for the software perform various functions that are useful not only for the proposed algorithm, but that can be readily extended and incorporated into other RLT based applications as well. Computational results are reported on a set of fifteen engineering process control and design test problems from various sources in the literature. It is shown that, for all the test problems, a very competitive computational performance is obtained. In most cases, the LP solution obtained for the initial node itself provides a very tight lower bound. Furthermore, for nine of these fifteen problems, the application of a local search heuristic based on initializing the nonlinear programming solver MINOS at the node zero LP solution produced the actual global optimum. Moreover, in finding a global optimum, our algorithm discovered better solutions than the ones previously reported in the literature for two of these test instances.Master of Science
34
Tomlinson-Dykens, Susan Ann. "Executive education programs in the construction industry : an analysis of existing national programs and current industry participation." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/45718.
Full text
35
Misailović, Saša. "Accuracy-aware optimization of approximate programs." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101577.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 168-176).
Many modern applications (such as multimedia processing, machine learning, and big-data analytics) exhibit a natural tradeoff between the accuracy of the results they produce and the application's execution time or energy consumption. These applications allow us to investigate new, more aggressive optimization approaches. This dissertation presents a foundation of program optimization systems that expose and profitably exploit tradeoffs between the accuracy of the results that the program produces and the time and energy required to produce those results. These systems apply accuracy-aware program transformations that intentionally change the semantics of optimized programs. A key challenge to applying accuracy-aware transformations is understanding the uncertainty that the transformations introduce into the program's execution. To address this challenge, this dissertation presents program analysis techniques that quantify the uncertainty introduced by program transformations. First, this dissertation identifies the properties of subcomputations that are amenable to loop perforation (an accuracy-aware transformation that skips loop iterations). Second, it presents how static analysis can derive expressions that characterize the frequency and magnitude of errors. Third, it presents a system that automatically applies accuracy-aware transformations by formulating accuracy-aware program optimization as standard mathematical optimization problems. The experimental results show that accuracy-aware transformations can help uncover significant performance and energy improvements with acceptable accuracy losses.
by Saša Misailović.
Ph. D.
36
Thai, Sonny. "Collaborative editor environments for player programs." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/77006.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63).
Player programming competitions are becoming a more popular way of introducing students to programming as well as allowing more experienced coders to hone their skills. In these competitions, teams of individuals must work together to produce a software project that will compete against other teams' projects in a well defined test. Collaboration is crucial in the overall learning experience and in determining the quality of the project. Although there are no standardized set of collaborative tools that exist for player programming IDEs, this paper documents the steps taken to investigate the ideal collaborative tools for editing player programs. These tools are a combination of frontend and backend features. Initial testing shows positive feedback from users of older systems. Future work consists of larger scale testing to perfect the standardized collaborative toolset.
by Sonny Thai.
M.Eng.
37
Puig, Fernandez Xavier. "VirtualHome : simulating household activities via programs." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118051.
Full textAbstract:
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 53-55).
In order to learn to perform complex activities, autonomous agents need to know the sequences of actions needed to reach a given task. In this thesis, we propose to use programs, i.e., sequences of atomic actions and interactions, as a high level representation of complex tasks. Programs are interesting because they provide a non-ambiguous representation of a task, and allow agents to execute them. However, nowadays, there is no database providing this type of information. Towards this goal, we first crowd-source programs for a variety of activities that happen in people's homes, via a game-like interface used for teaching kids how to code. Using the collected dataset, we show how we can learn to extract programs directly from natural language descriptions or from videos. We then implement the most common atomic (inter)actions in the Unity3D game engine, and use our programs to "drive" an artificial agent to execute tasks in a simulated household environment. Our VirtualHome simulator allows us to create a large activity video dataset with rich ground-truth, enabling training and testing of video understanding models. We further showcase examples of our agent performing tasks in our VirtualHome based on language descriptions.
by Xavier Puig Fernandez.
S.M. in Computer Science and Engineering
38
Bruening, Derek L. (Derek Lane) 1976. "Systematic testing of multithreaded Java programs." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80050.
Full textAbstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (p. 149-150).
Derek L. Bruening.
M.Eng.
39
Carbin, Michael (Michael James). "Automatically identifying critical behaviors in programs." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55143.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 60-63).
The large size of modern software systems has led to an increase in the complexity of the interaction between a system's code, its input, and its output. I propose the following classifications for the regions of a system's input: * Critical control: data that influences the internal operation and output of the system. * Critical payload: data that heavily contributes to the output of the program but does not substantially influence the internal operation of the program. * Benign control: data that influences the internal operation of the system, but does not contribute to the output of the system. * Benign payload: data that neither contributes to the output nor substantially influences the internal operation of the program. In this thesis, I present Chaos, a system designed to automatically infer these classifications for a program's inputs and code. Chaos monitors the execution trace and dynamic taint trace of an application over a suite of inputs to determine how regions of the programs' code and input influence its behavior and output. This thesis demonstrates the accuracy of Chaos's classifications for a set of imaging applications and their support libraries. These automatically inferred classifications are relevant to a variety of software engineering tasks, including program understanding, maintenance, debugging, testing, and defect correction triage.
by Michael Carbin.
S.M.
40
Givan, Robert Lawrence. "Automatically inferring properties of computer programs." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11051.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (p. 97-101).
by Robert Lawrence Givan, Jr.
Ph.D.
41
Ponzio, Stephen J. (Stephen John). "Restricted branching programs and hardware verification." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/35042.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 71-77).
by Stephen John Ponzio.
Ph.D.
42
Nill, Scott T. (Scott Thomas). "Aerospace composite manufacturing cost models as geometric programs." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118731.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 108-110).
The introduction of large, composite transport aircraft, such as the Airbus A350 and the Boeing 787, has been fraught with billions of dollars of production cost overruns. This research develops a novel approach to manufacturing cost modeling during the conceptual design phase using Geometric Programming (GP). A new formulation of a closed queuing network as a GP is presented to capture the crucial cost trade-offs between capacity and inventory. Additionally, GP models are presented for modeling unit processes in composite manufacturing and for modeling cost accounting metrics. Applied to the challenges of conceptual design for composite aircraft, the cost models can be used as a tool to help inform decisions about which manufacturing process to use and what type of supply chain should be deployed. The special sensitivity-analysis properties of the GP solutions can be exploited to explain how different aspects of the design drive manufacturing costs and to find highly sensitive areas of the trade-space that would have a large impact on cost if the design needed to be altered. The framework is demonstrated for fast but informative analyses of process trade-offs in composite fuselage fabrication.
by Scott T. Nill.
Ph. D.
43
Nguyen, Hai Viet. "A computer simulation of fatigue crack initiation in engineering components /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66010.
Full text
44
Torri, Stephen A. Hamilton John A. "Generic reverse engineering architecture with compiler and compression classification components." Auburn, Ala, 2009. http://hdl.handle.net/10415/1583.
Full text
45
af, Geijerstam Klas. "CONGESTION-CONTROLLED AUTOTUNING OF OPENMP PROGRAMS." Thesis, Umeå universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-163181.
Full textAbstract:
Parallelisation is becoming more and more important as the single core performance increase is stagnating while the amount of cores is increasing with every new generation of hardware. The traditional approach of manual parallelisation has an alternative in parallel frameworks, such as OpenMP, which can simplify the creation of parallel code. Optimising this code can, however, be cumbersome and difficult. Automating the optimisation or tuning of parallel code and computations is a very interesting alternative to manually optimising algorithms and programs. Previous work has shown that intricate systems can effectively autotune parallel programs with potentially the same effectiveness as human experts. This study suggests using an approach with the main algorithm used inspired from the congestion control algorithms from computer networks, namely AIMD. By applying the algorithm on top of an OpenMP program the parallel parameters such as grain size can be controlled. Thee simplied algorithm is shown to be able to achieve a 19% speedup compared to a naive static parallel implementation
46
Verma, Aditi. "Manpower development for new nuclear energy programs." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/76956.
Full textAbstract:
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Nuclear Science and Engineering, 2012.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 103-107).
In the spring of 2012, nine countries were seriously considering embarking on nuclear energy programs, either having signed contracts with reactor vendors or having made investments for the development of infrastructure for nuclear energy. Several more countries are expected to initiate nuclear energy programs during this decade. The new nuclear power plants that will be built in these countries will require well-trained personnel in numbers sufficient to ensure their safe and efficient operation, maintenance and regulation. The approaches to manpower development of the American, French, Japanese, Korean, Chinese and Indian nuclear industries are described and analyzed. Lead times for the development of education and training infrastructure and for training workers are found to be of the order of several years. This necessitates forecasting manpower requirements and planning ahead. Differences between these countries in their approaches to manpower development are observed. These include differences of job specialization, educational qualifications, and workforce size. Such differences are driven by differences in the structure of the industry, regulatory pressures, historical factors and future expectations. Comparisons are also made between the nuclear, coal, and airline industries in the U.S. These findings have important implications for the institutional design of new nuclear energy programs. Differences in the objectives, expected scale, and pace of development of these programs mean that systems of manpower development need to be tailored to each country. A hierarchy of strategic and implementational decisions informing the creation of manpower development systems for newcomer countries is presented.
by Aditi Verma.
S.B.
47
Strei, Thomas J. III. "Mapping and analyzing nuclear weapons programs development." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127304.
Full textAbstract:
Thesis: S.B., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, May, 2020Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 23-25).
An in-depth review of the types of nuclear reactors and their relationship to the development of nuclear weapons was conducted in order to provide a better understanding of the intention of a state in the creation of an internal nuclear program. An analysis of countries that have developed nuclear weapons and countries that have not was conducted. Following this analysis, the relationship between the weapons program, or lack thereof, was compared to the research reactors possessed by the country. The political environment of the country was also taken into account in order to determine the motivations behind the nuclear weapons development. It was concluded that there are a myriad of factors at play in the decision made by a country to develop nuclear weapons. There is a direct correlation between the construction of research reactors that were previously utilized for weapons research and the pursuit of an independent nuclear weapons program. However, a political impetus is necessary for the proper motivation to develop nuclear weapons to exist.
by Thomas J. Strei, III.
S.B.
S.B. Massachusetts Institute of Technology, Department of Nuclear Science and Engineering
48
Yeaman, Adetoun Oludara. "Understanding Empathy in the Experiences of Undergraduate Engineering Students in Service-Learning Programs." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/99038.
Full textAbstract:
In an increasingly globalized world and with rapid advancement in technology, there is a need to grapple more intently with social implications of engineering and technology. In the engineering community, these trends direct us to more critically consider how engineering and technology affect humanity and to interact effectively in diverse populations. Empathy, an ability that is central to the process of understanding and considering others, has been recognized as a valuable competency in the education of engineers. In engineering education specifically, several studies have pursued definition of empathy in the engineering context and its importance in engineering curriculum. Studies suggest that service learning is a useful pedagogical approach for supporting students in the development of social competencies, including empathy. However, it is not clear how this development happens.
In this dissertation, I sought to understand engineering students' experiences in a service-learning context to learn the ways in which empathy emerged in their descriptions and the elements of participants' experiences that shaped their empathy development. My participants were fourteen engineering students from two institutions, a small private university and a large public university, with both groups involved in at least one-semester of a service-learning course. I describe my phenomenological approach to this investigation and share my findings. Notably, I found eight main themes in my investigation of the role of empathy within the service-learning experiences described namely: changing perspective about others, having a sense of responsibility to others, keeping an open mind, inquiring of stakeholders, seeing others' points of view, understanding others' situations, being able to adjust goals and compromise and recognizing and/or welcoming difference. Additionally, I found both elements of participants' experiences designed into the course and those that were unprecedented relevant in shaping their empathy development. I also discuss the implications of these findings for engineering education and practice.Doctor of Philosophy
In an increasingly globalized world and with rapid advancement in technology, there is a need to think more intentionally about social implications of engineering and technology. These trends make is necessary for the engineering education to incorporate critical consideration of how engineering and technology affect humanity and how to interact effectively in diverse populations. Empathy, an ability that is central to the process of understanding and considering others, has been recognized as a valuable competency in the education of engineers. Studies suggest that service learning is a useful pedagogical approach for supporting students in the development of social competencies like empathy. My aim in this dissertation was to understand engineering students' experiences in a service-learning context to learn the ways in which their descriptions reveal empathy and the elements within their context that shaped empathy development. My participants are fourteen engineering students from two institutions, a small private university and a large public university, with both groups involved in at least one-semester of a service-learning course. Having explored students' experiences, I discuss key findings about how and within which contexts empathy came to play in these experiences. There are many different ways that empathy can play a role within students' experiences in a service-learning context and many facets of an experience help draw out more empathic practices. In this dissertation, I discuss implications of these findings for engineering education and practice.
49
Davis, Kirsten A. "Pursuing Intentional Design of Global Engineering Programs: Understanding Student Experiences and Learning Outcomes." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/97979.
Full textAbstract:
As engineering work becomes more globalized, it is important to prepare students to succeed in a global engineering workforce. Prior research has explored different factors important to the design of global programs generally, but less is known about the experiences and learning outcomes of engineering students while abroad. Because this population has historically been underrepresented in global programs, few research-based practices have been identified to support the intentional design of global experiences for engineering students. This dissertation seeks to provide such insights through three studies that address the following components of global engineering program design: 1) the assessment of Global Engineering Competency (GEC) through use of a series of scenarios based in the Chinese context; 2) the relationship between program destination and students’ experiences and reported learning outcomes; and 3) the experiences that engineering students identify as most significant during their time abroad. I used a combination of quantitative, qualitative, and mixed research methods to explore students’ learning and experiences in global engineering programs. The results of these studies revealed that engineering students have a wide variety of learning outcomes and experiences as a result of global programs, that great care should be exercised in choosing and interpreting assessment methods for global programs, and that the design of global engineering programs should be informed by characteristics of both the student participants and the program destination. Overall, the results of this dissertation highlight the importance of intentionality when designing global engineering programs to better prepare students for success in a global work environment.Doctor of Philosophy
As engineering work becomes more globalized, it is important to prepare students to succeed in a global engineering workforce. Prior research has explored different factors important to the design of global programs generally, but less is known about the experiences and learning outcomes of engineering students while abroad. Because this population has historically been underrepresented in global programs, few research-based practices have been identified to support the intentional design of global experiences for engineering students. This dissertation seeks to provide such insights through three studies that address the following components of global engineering program design: 1) the assessment of Global Engineering Competency (GEC) through use of a series of scenarios based in the Chinese context; 2) the relationship between program destination and students’ experiences and reported learning outcomes; and 3) the experiences that engineering students identify as most significant during their time abroad. I used a combination of quantitative, qualitative, and mixed research methods to explore students’ learning and experiences in global engineering programs. The results of these studies revealed that engineering students have a wide variety of learning outcomes and experiences as a result of global programs, that great care should be exercised in choosing and interpreting assessment methods for global programs, and that the design of global engineering programs should be informed by characteristics of both the student participants and the program destination. Overall, the results of this dissertation highlight the importance of intentionality when designing global engineering programs to better prepare students for success in a global work environment.
50
Kushman, Nate. "Generating computer programs from natural language descriptions." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101572.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 159-169).
This thesis addresses the problem of learning to translate natural language into preexisting programming languages supported by widely-deployed computer systems. Generating programs for existing computer systems enables us to take advantage of two important capabilities of these systems: computing the semantic equivalence between programs, and executing the programs to obtain a result. We present probabilistic models and inference algorithms which integrate these capabilities into the learning process. We use these to build systems that learn to generate programs from natural language in three different computing domains: text processing, solving math problems, and performing robotic tasks in a virtual world. In all cases the resulting systems provide significant performance gains over strong baselines which do not exploit the underlying system capabilities to help interpret the text.
by Nate Kushman.
Ph. D.