Michael C. Loui

dblp:50/6302 · DBLP profile ↗
← Back
54ranked-venue papers
13as first author
3since 2021 · last 2024
0000-0002-3871-0724ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 24 · 12 first-authorHuman-computer interaction and ubiquitous computing · 23 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 4 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 1 since 2021Systems, architecture and hardware · 2Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
10 papers
Information theory · 65% Algorithms and data structures · 19% Computational complexity · 12%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Processor architecture and microarchitecture · 42% Integrated circuit design · 42% Parallel and multicore computing · 8%

Topics — the 16 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory
random number generation
0.122006
Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution · IEEE Trans. Inf. Theory 2006
Optimal random number generation from a biased coin · SODA 2005
Information theory › probability theory
discrete probability distribution
0.112006
Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution · IEEE Trans. Inf. Theory 2006
Information theory
entropy and randomness
0.112005
Optimal random number generation from a biased coin · SODA 2005
Algorithms and data structures
randomized algorithms
0.112005
Optimal random number generation from a biased coin · SODA 2005
Computational complexity › parallel complexity
PRAM
0.011994
Parallel Random Access Machines with both Multiplication and Shifts · Inf. Comput. 1994
Computational complexity › lower bounds
simulation lower bounds
0.021992
Optimal On-Line Simulations of Tree Machines by Random Access Machines · SIAM J. Comput. 1992
Optimal Dynamic Embedding of Trees into Arrays · SIAM J. Comput. 1983
Computational complexity › computational models
pointer machine
0.011993
Hierarchies and Space Measures for Pointer Machines · Inf. Comput. 1993
Processor architecture and microarchitecture › parallel computer organization
dictionary machine
0.011987
Dictionary Machines on Cube-Class Networks · IEEE Trans. Computers 1987
Integrated circuit design › VLSI design
parallel VLSI architecture
0.011987
Dictionary Machines on Cube-Class Networks · IEEE Trans. Computers 1987
Automata and formal languages › infinite-state systems › channel systems
communicating finite state machines
0.011993
Modeling robust asynchronous communication protocols with finite-state machines · IEEE Trans. Commun. 1993
Automata and formal languages
finite automata
0.011993
Modeling robust asynchronous communication protocols with finite-state machines · IEEE Trans. Commun. 1993
Algorithms and data structures › metric embedding
tree embedding
0.011983
Optimal Dynamic Embedding of Trees into Arrays · SIAM J. Comput. 1983
Automata and formal languages
turing machines
0.011981
Simulations among Multidimensional Turing Machines (Preliminary Version) · FOCS 1981
Algorithms and data structures › data structure design › search structures
dictionary data structure
0.011987
Dictionary Machines on Cube-Class Networks · IEEE Trans. Computers 1987
Distributed systems › distributed algorithms
distributed sorting
0.011984
The Complexity of Sorting on Distributed Systems · Inf. Control. 1984
Parallel and multicore computing
parallel algorithms
0.011984
The Complexity of Sorting on Distributed Systems · Inf. Control. 1984

Methods — techniques the papers use, named apart from their topics

prefix-free sets · 0.1efficient computation · 0.1characterization · 0.1information-theoretic lower bound · 0.0lower bound analysis · 0.0fault model analysis · 0.0pipelining · 0.0hamiltonian path construction · 0.0on-line simulation · 0.0
YearPublicationVenuePosition
2024 Panel Session: Preparing a Competitive Nomination for IEEE and ASEE Fellow and Other Competitive Awards
abstract
In this session, a panel of members of the current Fellows Committee of the IEEE Education Society will share advice on preparing nominations for Fellow of the IEEE and Fellow of the American Society for Engineering Education. The panelists will also provide advice on applications for competitive national and international awards. The panelists will explain how to enhance career planning to become eligible for awards and honors.
Laura Bottomley, Michael C. Loui, Cynthia J. Finelli, Cynthia M. Furse, Anthony A. Maciejewski, Bruce Wheeler, Barbara Oakley
FIE2
2022 A Qualitative Study of Emotions Experienced by First-year Engineering Students during Programming Tasks
abstract
In introductory computer programming courses, students experience a range of emotions. Students often experience anxiety and frustration when they encounter difficulties in writing programs. Continued frustration can discourage students from pursuing engineering and computing careers. Although prior research has shown how emotions affect students’ motivation and learning, little is known about students’ emotions in programming courses. In this qualitative study of first-year engineering students taking an introductory programming course, we examined the emotions that these students experienced during programming tasks and the reasons for experiencing those emotions. Our study was grounded in the control-value theory of achievement emotions. Each research participant came to two laboratory sessions: a programming session and a retrospective think-aloud interview session. In the programming session, each participant worked individually on programming problems. We collected screen capture, biometrics, and survey responses. In the interview session, each participant watched a video of their actions during the programming session. After every 2 minutes of viewing, the participants reported the emotions that they had experienced during this 2-minute period. We performed a thematic analysis of the interview data. Our results indicate that the participants experienced frustration most frequently. Sometimes they experienced multiple emotions. For example, one participant felt annoyed because she had made a mistake, but she felt joy and pride when she fixed the mistake. To promote student learning, educators should take students’ emotions into account in the design of curriculum and pedagogy for introductory programming courses.
Zahra Atiq, Michael C. Loui
ACM Trans. Comput. Educ.2
2021 Moral Narratives of Practicing Engineers Across Industry Sectors for Engineering Ethics Education
abstract
This work-in-progress research paper reports on an ongoing research study which addresses two research questions: RQ1) What are the moral narratives of engineering practitioners across industry sectors? RQ2) How are the engineers' moral narratives influenced by the organizational cultures of their workplaces? As stories that support and sustain one's moral life, moral narratives influence one's ethical decision-making. While it is expected that a better understanding of engineers' moral narratives can be helpful for improving engineering ethics education, little is known about engineers' moral narratives. This paper explains the methodological approach we are taking to answer the research questions. This paper also describes potential implications of this study by introducing a new pedagogical approach called Scaffolded Ethics Autobiography for engineering ethics education.
Brent K. Jesiek, Michael C. Loui
FIE3
2020 The Cambridge Handbook of Computing Education Research Summarized in 75 minutes
abstract
The 32 chapters of the 2019 Cambridge Handbook of Computing Education Research synthesize the existing research in computing education and propose new directions for future research. An author from each chapter will summarize their chapter with auto-advancing slides. Attendees will be introduced to the breadth of content in the new handbook and can identify chapters of interest. This fits uniquely as a special session, and will likely be informative, inspiring, and overwhelming.
Colleen M. Lewis, Timothy C. Bell, Paulo Blikstein, Adam S. Carter, Katrina Falkner, Sally Fincher, Kathi Fisler, Mark Guzdial, Patricia Haden, Sepehr Hejazi Moghadam, Michael S. Horn, Christopher D. Hundhausen, Amy J. Ko, Thomas Lancaster, Michael C. Loui, Lauren E. Margulieux, Leo Porter 0001, Anthony V. Robins, Jean J. Ryoo, Niral Shah, R. Benjamin Shapiro, Kerry Shephard, Beth Simon, Michael Tissenbaum, Ian Utting, Jan Vahrenhold, Aman Yadav
SIGCSE15
2018 Applying Phenomenography to Develop a Comprehensive Understanding of Ethics in Engineering Practice
abstract
This Work-in-Progress Research paper describes (1) the contemporary research space on ethics education in engineering; (2) our long-term research plan; (3) the theoretical underpinnings of Phase 1 of our research plan (phenomenography); and (4) the design and developmental process of a phenomenographic interview protocol to explore engineers' experiences with ethics. Ethical behavior is a complex phenomenon that is complicated by the institutional and cultural contexts in which it occurs. Engineers also have varied roles and often work in a myriad of capacities that influence their experiences with and understanding of ethics in practice. We are using phenomenography, a qualitative research approach, to explore and categorize the ways engineers experience and understand ethical engineering practice. Specifically, phenomenography will allow us to systematically investigate the range and complexity of ways that engineers experience ethics in professional practice in the health products industry. Phenomenographic data will be obtained through a specialized type of semi-structured interview. Here we introduce the design of our interview protocol and its four sections: Background, Experience, Conceptual, and Summative. We also describe our iterative process for framing questions throughout each section.
Andrew O. Brightman, Nick Fila, Justin L. Hess, Alison J. Kerr, Michael C. Loui, Carla B. Zoltowski
FIE6
2018 Applying Stages of Change in an Academic Context to Help Students Adopt Healthy Learning Dispositions and Behaviors
abstract
In this work in progress paper for the research category, we describe preliminary results from our design-based research project. Students leave engineering majors for many reasons. However, studies on goal orientation theory have shown that mastery goal orientation has positive correlations with outcomes such as persistence, self-efficacy, and self-regulated learning. We developed and taught an eight-week, one-credit course called Engineering the Mind as an intervention to encourage students to adopt positive learning dispositions and behaviors. We used the Stages of Change model as our theoretical framework to understand how engineering students adopt these learning dispositions and behaviors. We used multiple methods to assess student outcomes, collecting pre-post survey data as well as students' self-reflection assignments. In our preliminary results, we describe students in different Stages of Change based on their weekly course assignment on planning.
Dong San Choi, Michael C. Loui
FIE2
2017 Grit and two-year engineering retention
abstract
This work-in-progress paper describes an exploratory investigation of the relationship between Grit and retention of engineering students. Grit is a noncognitive trait that psychologists have used to predict success more accurately than cognitive traits like intelligence. We administered the Grit Scale in a first-year engineering design project course (n = 465). Using binary logistic regression, we found that Grit was not a significant predictor of retention, but one of Grit's subscales, Perseverance of Effort, was significant for both one- and two-year retention in engineering. Our results suggest that we may be able to improve retention by helping students develop persistence to overcome their challenges and difficulties.
Dong San Choi, Beth Ann Myers, Michael C. Loui
FIE3
2017 Students' perceptions of the social responsibilities of engineers
abstract
Engineering social responsibility is the responsibility of engineers to evaluate the broader impacts of their work on public welfare. Despite the central role of social responsibility to the engineering profession, social responsibility does not seem to be adequately emphasized in engineering curriculum. This study seeks to understand how students understand the social responsibilities of engineers. Interviews with ten students and three professors in engineering were analyzed with thematic analysis. The results from this study indicate that students are aware of ways that engineers can both benefit and harm society. When asked what influenced their views on social responsibility, students identified personal and extracurricular experiences, not engineering courses. Engineering programs are encouraged to incorporate more explicit instruction about the social dimensions of engineering to support the development of socially responsible engineers.
Athena Lin, Michael C. Loui
FIE2
2016 Grit and first-year retention in engineering
abstract
Recently “grit” has been defined by psychologists as a personal attribute that correlates with persistence through difficulties. We present our preliminary findings on grit and engineering students in this work-in-progress paper. We administered the Grit Scale in a first-year engineering design project course in a large public university in Fall 2014 and Spring 2015 (n = 475). Using binary logistic regression, we showed that grit alone was not a significant predictor of retention in engineering. For future work, we will include two-year retention data and also consider moderating variables such as gender and ethnicity to determine whether their interaction with grit tells a different story. If the moderating variables reveal that grit is more important in retaining students with certain attributes, the Grit Scale may be useful in identifying at-risk students. If not, however, we will need to reconsider the Grit Scale when it is applied to engineering students.
Dong San Choi, Beth Ann Myers, Michael C. Loui
FIE3
2016 The impact of supervised homework sessions and SAT-Math scores on academic performance in an advanced undergraduate course
abstract
Ancillary learning opportunities outside the classroom take different forms such as peer-led team learning (PLTL) and supplemental instruction (SI). To gain the benefits of ancillary sessions with less overhead than PLTL and SI, we facilitated optional weekly supervised homework sessions for AAE 35200, an aerospace structural mechanics course for third year engineering students at Purdue University. In these sessions, a graduate teaching assistant used the assigned homework problems to demonstrate key concepts on structural mechanics. In order to understand the attributes of the participants, a survey was administered. Also, session attendance was recorded and compared against the exam and homework results. Based on the collected data during the Fall 2015 and Spring 2016 semesters, we have reached the following conclusions: a) attending the supervised homework sessions does not significantly affect the exam score, whereas the opposite is true for the homework scores and b) SAT-Math scores do not seem to have a strong influence on both the exam and homework scores.
Waterloo Tsutsui, Michael C. Loui
FIE2
2015 Grit for engineering students
abstract
Studies suggest that students' attitudes toward engineering courses may determine whether they persist in engineering, rather than academic performance alone. We take a mixed-methods approach to explore gritty attitudes and to confirm whether previous research on grit can be applied to undergraduate engineering students. We address two main research questions: (1) Does the grit scale predict retention among first-year undergraduate engineering students? (2) What does grit specifically look like for engineering students? To answer the first question, we invited all first-year engineering students at one university to complete the grit scale during Fall 2014. We will check whether the scores on the grit scale correlate positively with retention in engineering. To answer the second question, we invited all students who were persisting in engineering after having earned a D or an F grade in a required technical course to participate in a semi-structured interview. We hope to capture how these engineering students respond to academic setbacks and what they believe about effort, perseverance, and academic success.
Dong San Choi, Michael C. Loui
FIE2
2015 Getting past the first year: Retaining engineering majors
abstract
Peer Led Team Learning (PLTL) is a nationally recognized curriculum enhancement strategy adopted in various forms by over 150 universities and colleges across the United States. Consistent with the outcomes and the vision of ABET Engineering Criteria 2000 and the National Academy of Engineering Engineer 2020, PLTL prepares students to work in teams; apply knowledge of mathematics, science, and engineering to solve problems; communicate effectively; engage in life-long learning; and develop leadership skills. Published PLTL program data have shown that using peer leaders in small group workshop settings boosts performance in critical first-year courses including core math, science and engineering courses. The PLTL model promotes the growth of critical workplace skills for students and peer leaders such as working in teams, listening, critical thinking and leadership. This paper will present the basics of the PLTL instructional model, including sample materials developed for engineering workshops. Consideration of the practicalities of the six critical components will be discussed: integration of the workshop component into the course structure, involvement of the teaching faculty, training and supervision of the peer leaders, creation of challenging materials, and provision of appropriate institutional resources.
A. E. Dreyfuss, Melanie Villatoro, Michael C. Loui, James E. Becvar, Geoffrey B. Saupe, Wayne Johnson
FIE3
2015 How should we estimate a missing exam score?
abstract
In core engineering courses, instructors administer multiple examinations as major assessments of students' learning. When a student is unable to take an exam, the instructor must estimate the missing exam score in order to calculate the student's course grade. Using exam score data from multiple offerings of two large engineering courses, we compared the accuracy of several methods to estimate an exam score, including linear regression methods. The standard error of regression of the ordinary least squares (OLS) regression model was consistently about 0.5. For final exam scores, the standard errors of linear models with equal weights were nearly the same as the standard errors of the OLS regression models. For other exam scores, the equal weight model was somewhat less accurate. The results of this study provide practical guidance to instructors who need to estimate missing exam scores.
Michael C. Loui, Athena Lin
FIE1
2015 Assessing an affordable and portable laboratory kit in an undergraduate control systems course
abstract
Lab kits allow students to take home laboratory equipment to complete experiments on their own time. Kits like these can expand access to hands-on experiences for online courses and to budget-strapped campuses. Although students like these kits, no previous studies compared student learning outcomes on assignments using these new kits with previous laboratory equipment. During the 2014-2015 academic year, we conducted a quasi-experiment to compare students' achievement of learning outcomes. Half of the laboratory sections in each semester used the existing equipment, while the other sections used the new kit. The objectives of the laboratory assignments were the same and the instructions were kept as close as possible between the two groups.
Rebecca M. Reck, Ramavarapu S. Sreenivas, Michael C. Loui
FIE3
2015 Learning philosophies: A glimpse into students' approaches to learning
abstract
A learning philosophy, as discussed in this paper, is a collection of beliefs about how one learns and approaches learning activities and tasks. Learning is often studied from the instructor's point of view, but learning from the student's perspective is not examined much. A baseline understanding of how students learning philosophies might be disclosed and interpreted are described by the nineteen student responses to an open-ended survey in an undergraduate elective course titled “Engineering in Global Context.” The findings suggest implications for course and curriculum design in order to promote higher levels of thinking and to develop appropriate epistemological beliefs. Partially through the lenses of Bloom's Taxonomy and Schommer's Epistemological Dimensions, this paper offers a glimpse into students' conceptions about learning.
Natascha M. Trellinger, Michael C. Loui
FIE2
2013 Lesbian, gay, bisexual, and transgender students in engineering: Climate and perceptions
abstract
Few studies of the climate in engineering for lesbian, gay, bisexual and transgender (LGBT) students have been conducted. According to these studies, LGBT students are often forced to cope with hostile climates in engineering. To address the question of how LGBT students experience the climate in engineering, we interviewed a total of 16 students at two institutions in the Midwest. We analyzed the interview transcripts using open coding based on a combination of Meyer's Minority Stress Theory and Tinto's Theory of Student Departure. Preliminary results indicate that LGBT students experience more situations of exclusion within engineering than in other areas of their campuses. Based on their experiences, students advocate increased visibility for LGBT students in engineering and a mentoring program to provide support from engineering faculty and graduate students who also identify as LGBT.
Kathryn F. Trenshaw, Ashley Hetrick, Ramona F. Oswald, Sharra L. Vostral, Michael C. Loui
FIE5
2012 The adjustment experience of first-year international undergraduate students in engineering
abstract
To compare the challenges that domestic and international students experience in adjusting to college, we conducted a mixed-methods study of first-year undergraduate engineering students at a large public university in the Midwest. We administered a survey to all first-year engineering students. We conducted separate focus groups of domestic and international first-year students. While the domestic and international students identified similar adjustment issues, international students had more difficulty with making American friends, understanding cultural references, adapting to American food, and becoming acquainted with unfamiliar teaching methods and assignments.
Whitney Barnes, Michael C. Loui
FIE2
2012 What should I do next? How advanced engineering students decide their post-baccalaureate plans
abstract
To describe how advanced engineering students decide their post-baccalaureate plans, we conducted a mixed-methods study with engineering students at a large public university in the Midwest. According to the surveys, there were no statistically significant differences between men and women in their choices of post-baccalaureate plans. Students who had positive undergraduate research experiences and students who felt attached to their departments as undergraduates were more likely to enter graduate school immediately after graduation. Students who had industrial internships were more likely to enter professional practice immediately. From the interview data, we defined eight decision style archetypes that characterize how students make post-baccalaureate plans.
Anwen Jiang, Michael C. Loui
FIE2
2012 Describing the What and Why of Students' Difficulties in Boolean Logic
abstract
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized common misconceptions and novice problem-solving processes of students who had recently completed a digital logic design class. We present these results and discuss their implications for instruction and the development of pedagogical assessment tools known as concept inventories.
Geoffrey L. Herman, Michael C. Loui, Lisa C. Kaczmarczyk, Craig B. Zilles
ACM Trans. Comput. Educ.2
2011 Work in progress - Exploring the evolution of the mentoring relationship in a summer undergraduate research program
abstract
The mentoring relationship is an important and crucial aspect in the academic and professional development of both mentor and protégé. Although the characteristics of positive mentoring relationships have been identified, there is little prior research in assessing the relationship between undergraduate researchers and their graduate student mentors. We present a document analysis of the reflective journals and mentoring philosophy statements of four graduate student mentors of undergraduate researchers in a summer research program. The preliminary results show that mentors and students can have mismatched expectations, and that as the mentoring relationship evolves, the roles of the mentor and student also evolve. We also present a mentoring model grounded in the data.
Renata A. Revelo Alonso, Michael C. Loui
FIE2
2011 Work in progress - Diversity harnessing in a general education course on digital information technology
abstract
Our general education course in digital information technology draws many students from academic disciplines outside science and mathematics. These students often struggle with the relevance of the course topics. To promote student motivation, we are modifying the course to better engage the students in the course topics via a method we term diversity harnessing. Diversity harnessing refers to the diversity in the students' personal interests and chosen academic disciplines. From the students' interests, we intend to gather applications and ideas and to quickly integrate this diverse student-driven subject matter back into the lectures, homework assignments, and examinations. Through diversity harnessing, we expect to find that students are more engaged in the course and that they apply the course content more effectively to their lives and careers beyond the end of the semester. We are assessing the effectiveness of diversity harnessing using both individual interviews and a standard course engagement questionnaire.
Christopher D. Schmitz, Renata A. Revelo Alonso, Michael C. Loui
FIE3
2010 Creating the digital logic concept inventory
abstract
A concept inventory (CI) is a standardized assessment tool that evaluates how well a student's conceptual framework matches the accepted conceptual framework of a discipline. In this paper, we present our process in creating and evaluating the alpha version of a CI to assess student understanding of digital logic. We have checked the validity and reliability of the CI through an alpha administration, follow-up interviews with students, analysis of administration results, and expert feedback. So far the feedback on the digital logic concept inventory is positive and promising.
Geoffrey L. Herman, Michael C. Loui, Craig B. Zilles
SIGCSE2
2010 Setting the Scope of Concept Inventories for Introductory Computing Subjects
abstract
A concept inventory is a standardized assessment tool intended to evaluate a student’s understanding of the core concepts of a topic. In order to create a concept inventory it is necessary to accurately identify these core concepts. A Delphi process is a structured multi-step process that uses a group of experts to achieve a consensus opinion. We present the results of three Delphi processes to identify topics that are important and difficult in each of three introductory computing subjects: discrete mathematics, programming fundamentals, and logic design. The topic rankings can not only be used to guide the coverage of concept inventories, but can also be used by instructors to identify what topics merit special attention.
Kenneth J. Goldman, Paul Gross 0001, Cinda Heeren, Geoffrey L. Herman, Lisa C. Kaczmarczyk, Michael C. Loui, Craig B. Zilles
ACM Trans. Comput. Educ.6
2009 Privacy and ethical issues in location-based tracking systems
abstract
Location-based tracking systems (LTSs) use a variety of technologies to record the locations of objects. An LTS can increase the risks to the privacy and security of individuals. Previous studies have failed to distinguish between losses and violations of privacy when the locations of individuals are recorded by an LTS. We argue that individual privacy is threatened not by the collection of public location information but by the centralization of aggregated information, and by the combination of location information with other personal information. Further, informed consent should be required when the collection of information might cause a violation of privacy.
Jessa Liying Wang, Michael C. Loui
ISTAS2
2008 Proof by incomplete enumeration and other logical misconceptions
abstract
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized common misconceptions and novice problem-solving processes of students who had recently completed a digital logic design class. We present these results and discuss their implications for instruction and the development of pedagogical assessment tools known as concept inventories.
Geoffrey L. Herman, Lisa C. Kaczmarczyk, Michael C. Loui, Craig B. Zilles
ICER3
2008 Identifying important and difficult concepts in introductory computing courses using a delphi process: selective compression of unicode arrays in java
abstract
A Delphi process is a structured multi-step process that uses a group of experts to achieve a consensus opinion. We present the results of three Delphi processes to identify topics that are important and difficult in each of three introductory computing subjects: discrete math, programming fundamentals, and logic design. The topic rankings can be used to guide both the coverage of standardized tests of student learning (i.e., concept inventories) and can be used by instructors to identify what topics merit emphasis.
Kenneth J. Goldman, Paul Gross 0001, Cinda Heeren, Geoffrey L. Herman, Lisa C. Kaczmarczyk, Michael C. Loui, Craig B. Zilles
SIGCSE6
2006 Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
abstract
In this paper, we characterize functions that simulate independent unbiased coin flips from independent coin flips of unknown bias. We call such functions randomizing. Our characterization of randomizing functions enables us to identify the functions that generate the largest average number of fair coin flips from a fixed number of biased coin flips. We show that these optimal functions are efficiently computable. Then we generalize the characterization, and we present a method to simulate an arbitrary rational probability distribution optimally (in terms of the average number of output digits) and efficiently (in terms of computational complexity) from outputs of many-faced dice of unknown distribution. We also study randomizing functions on exhaustive prefix-free sets.
Sung-Il Pae, Michael C. Loui
IEEE Trans. Inf. Theory2
2005 Optimal random number generation from a biased coin
Sung-Il Pae, Michael C. Loui
SODA2
2004 Debugging: from novice to expert
abstract
We conducted a study to demonstrate that formal training in debugging helps students develop skills in diagnosing and removing defects from computer programs. To accomplish this goal in an assembly language course, we designed multiple activities to enhance students' debugging skills. These activities included debugging exercises, debugging logs, development logs and reflective memos, and collaborative assignments. In a previous paper, we reported positive qualitative results. Students agreed that formal debugging training enhanced their debugging skills. In this paper, we present positive quantitative results that support our previous qualitative results. Students who completed the optional debugging exercises spent significantly less time on debugging their programs than those who did not. Furthermore, we develop a model of debugging abilities and habits based on students' comments in their debugging logs, development logs, reflective memos, and evaluation surveys. Students and educators could use the model to diagnose students' current debugging skills and take actions to enhance their skills.
Ryan Chmiel, Michael C. Loui
SIGCSE2
2001 Reconstructing a Minimum Spanning Tree after Deletion of Any Node
B. Das, Michael C. Loui
Algorithmica2
1994 Parallel Random Access Machines with both Multiplication and Shifts
Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui
Inf. Comput.3
1993 Hierarchies and Space Measures for Pointer Machines
David R. Luginbuhl, Michael C. Loui
Inf. Comput.2
1993 Modeling robust asynchronous communication protocols with finite-state machines
abstract
A.V. Aho et al. (Comput. Math. Applic., vol.8, p.205-14, 1982) used communicating finite-state machines to model synchronous protocols for reliable communication across unreliable channels. Their ideas are extended to modeling asynchronous protocols for communication across unreliable channels using finite-state machines communicating via an unreliable shared memory. Lower bounds on the size of machines and the number of symbols in the transmission alphabet required to achieve reliable communication are established. Two types of finite-state machines and two fault models for the shared memory are considered. In each case it is shown that there are robust protocols for deletion and insertion errors. It is also shown that there are no robust protocols for mutation errors. In contrast, in the synchronous case, robust protocols exist for all of these types of errors.>
Michael M. Wu, Michael C. Loui
IEEE Trans. Commun.2
1992 The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines
Michael C. Loui, David R. Luginbuhl
Math. Syst. Theory1
1992 Optimal On-Line Simulations of Tree Machines by Random Access Machines
abstract
This paper shows that every tree machine of time complexity t can be simulated on-line by a log-cost random access machine (RAM) of time complexity $O((t\log t)/\log \log t)$. Using information-theoretic techniques, it is shown that this simulation is optimal. It is also shown that every tree machine can be simulated by a unit-cost RAM in real time.
Michael C. Loui, David R. Luginbuhl
SIAM J. Comput.1
1992 Multiplication, Division and Shift Instructions in Parallel Random Access Machines
Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran
Theor. Comput. Sci.2
1990 An Efficient Distributed Algorithm for Maximum Matching in General Graphs
Michael M. Wu, Michael C. Loui
Algorithmica2
1990 An Algorithm for Load Balancing in Multiprocessor Systems
Michael C. Loui, Milind A. Sohoni
Inf. Process. Lett.1
1988 The General Maximum Matching Algorithm of Micali and Vazirani
Paul A. Peterson, Michael C. Loui
Algorithmica2
1988 Election in a Complete Network with a Sense of Direction
Michael C. Loui, Teresa A. Matsushita, Douglas B. West
Inf. Process. Lett.1
1988 Optimal Dynamic Embedding of X-Trees Into Arrays
Alan Scottedward Hodel, Michael C. Loui
Theor. Comput. Sci.2
1987 Dictionary Machines on Cube-Class Networks
abstract
A dictionary is a data structure that supports insertion, deletion, and retrieval operations. To maintain a database, a dictionary machine accepts an arbitrary sequence of instructions at a constant rate. We designed two new VLSI dictionary machines on general-purpose networks that emulate the binary cube. One machine runs on a shuffle-exchange network. It includes a novel architecture to implement pipelining of dictionary instructions. The other machine runs on a cube-connected-cycles network. The design of this machine relies on the existence of a Hamiltonian path, which we establish explicitly for every cube-connected-cycle network.
Alan M. Schwartz, Michael C. Loui
IEEE Trans. Computers2
1986 Election in a Complete Network with a Sense of Direction
Michael C. Loui, Teresa A. Matsushita, Douglas B. West
Inf. Process. Lett.1
1986 On Time versus Space III
Joseph Y. Halpern, Michael C. Loui, Albert R. Meyer, Daniel Weise
Math. Syst. Theory2
1985 Dictionary Machines on Cube-Class Networks
Alan M. Schwartz, Michael C. Loui
ICPP2
1985 On the Worst Case Performance of Buddy Systems
Errol L. Lloyd, Michael C. Loui
Acta Informatica2
1984 The Complexity of Sorting on Distributed Systems
Michael C. Loui
Inf. Control.1
1984 Minimizing Access Pointers into Trees and Arrays
Michael C. Loui
J. Comput. Syst. Sci.1
1983 Optimal Dynamic Embedding of Trees into Arrays
abstract
An optimal method for dynamically embedding trees into arrays is presented. Every multi-head tree machine of time complexity $t(n)$ can be simulated on-line by a multihead d-dimensional machine in time $O(t(n)^{1 + 1/d} /\log t(n))$. An information-theoretic argument gives the worst-case lower bound $\Omega (t(n)^{1+1/d} /\log t(n))$ on the time required.
Michael C. Loui
SIAM J. Comput.1
1982 Simulations Among Multidimensional Turing Machines
Michael C. Loui
Theor. Comput. Sci.1
1981 Simulations among Multidimensional Turing Machines (Preliminary Version)
abstract
For all d ≥ 1 and all e ≫ d, every deterministic multihead e-dimensional Turing machine of time complexity T(n) can be simulated on-line by a deterministic multihead d-dimensional Turing machine in time O(T(n)1+1/d-1/e(log T(n))O(1)). This simulation almost achieves the known lower bound Ω(T(n)1+1/d-1/e) on the time required. Furthermore, there is a deterministic d-dimensional machine with just two worktape heads that simulates the e-dimensional machine on-line in time O(T(n)1+1/d-1/delog T(n)). These simulations are interpreted in terms of dynamic embeddings among data structures.
Michael C. Loui
FOCS1
1981 Space-Bounded Simulation of Multitape Turing Machines
Leonard M. Adleman, Michael C. Loui
Math. Syst. Theory2
1981 A Space Bound for One-Tape Multidimensional Turing Machines
Michael C. Loui
Theor. Comput. Sci.1
1980 A Note on the Pebble Game
Michael C. Loui
Inf. Process. Lett.1