This innovative practice full paper introduces an automated assessment system, Michigan System of Automated Assessment for Accreditation (MSA3), designed for computing and engineering programs to meet both external accreditation and internal university requirements while minimally increasing faculty and staff workload. The system integrates with Canvas, enabling instructors to input assessment data directly during grading, streamlining the process by eliminating the need for separate data entry and report dissemination. Key features include automated data export and the generation of visual analytics, securely hosted on university servers. Additionally, the paper presents a preliminary study on how this system affects faculty attitudes towards the assessment workload required by ABET. Our preliminary survey results indicate a favorable perception by faculty, which should increase their buy-in and engagement with assessment, supporting assertions made in the literature. Our findings also suggest that the system may help align faculty efforts with accreditation demands more seam-lessly. Its code will be made available on GitHub, allowing for easy adaptation by other institutions using Canvas. Our future work includes increasing the level of automation, extending our methodology to other learning management systems, and conducting a larger evaluation to gauge MSA3's efficacy on the perception of the accreditation and faculty/staff buy-in.

Smart Cities include the concept of large, intelligent systems coming together cooperatively to enable better living conditions in future urban areas. Reduction in fuel/electricity usage, crime, improved economies, less waste, and overall better living conditions are primary goals. A key enabling technology is the Intelligent Transportation System (ITS), in which various transportation mechanisms cooperate to improve quality of life by reducing fuel/electricity usage, decreasing congestion, and decreasing travel time. Studies have shown that enormous resources are wasted by congestion alone in transportation systems. In this position paper, we present the ITS as a major factor in facilitating the smart city of the future.

MOTIVATION: Determining the methylation state of regions with high copy numbers is challenging for second-generation sequencing, because the read length is insufficient to map reads uniquely, especially when repetitive regions are long and nearly identical to each other. Single-molecule real-time (SMRT) sequencing is a promising method for observing such regions, because it is not vulnerable to GC bias, it produces long read lengths, and its kinetic information is sensitive to DNA modifications. RESULTS: We propose a novel linear-time algorithm that combines the kinetic information for neighboring CpG sites and increases the confidence in identifying the methylation states of those sites. Using a practical read coverage of ∼30-fold from an inbred strain medaka (Oryzias latipes), we observed that both the sensitivity and precision of our method on individual CpG sites were ∼93.7%. We also observed a high correlation coefficient (R = 0.884) between our method and bisulfite sequencing, and for 92.0% of CpG sites, methylation levels ranging over [0,1] were in concordance within an acceptable difference 0.25. Using this method, we characterized the landscape of the methylation status of repetitive elements, such as LINEs, in the human genome, thereby revealing the strong correlation between CpG density and hypomethylation and detecting hypomethylation hot spots of LTRs and LINEs. We uncovered the methylation states for nearly identical active transposons, two novel LINE insertions of identity ∼99% and length 6050 base pairs (bp) in the human genome, and 16 Tol2 elements of identity >99.8% and length 4682 bp in the medaka genome. AVAILABILITY AND IMPLEMENTATION: AgIn (Aggregate on Intervals) is available at: https://github.com/hacone/AgIn CONTACT: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Success within the distance learning paradigm typically requires a strong intrinsic motivation on the part of the learner. This motivation needs to be matched with effective delivery of engaging course content. Developing an active engagement environment for deep learning is a nontrivial task as the instructor is not physically present. To address the concern in an online/blended delivery model, we had developed and examined our first cyber classroom, in which lectures are automatically recorded and posted to a website for subsequent online consumption. The observed limitations of this approach were twofold: (1) online student participation in onground classroom activities was unfeasible; and (2) onground student collaborative activities were severely curtailed by the classroom layout. In this work in progress we present our revised concept grounded in active learning scientific principles combined with lessons learned from our prior approach. By leveraging classroom spatial layout best practices combined with the apropos technology, we seek to address the aforementioned two concerns. Specifically we present a description of our revised cyber classroom, along with plans for future application involving integrating online learning with the flipped classroom concept.

With classroom instruction undergoing a massive transformation to incorporate online learning techniques at unprecedented levels, technological advances have facilitated a range of mechanisms that improve teaching and learning. At the same time, these technological advances have also facilitated different forms of cheating in classes.

The impact of the computing field is becoming more profound everyday in all facets of modern society. Despite significant efforts from academia and relatively high demand for computing, technology producers are needed more than ever. This has been corroborated by a recent NSF Press Release [1], stating that computing is the only STEM discipline with more job openings than college graduates to fill them up. A major responsibility for such an outcome rests upon educators' ability to produce professionals capable of handling ever more complex technical challenges. In this challenging environment, the importance of practical work in science and engineering, supported by lab exercises, is widely known. While it is desirable to create physical laboratories for teaching these technologies, it is not always possible nor desirable. In this paper, we present an effective alternative approach, in the form of an affordable, virtualized laboratory environment that can be used in a variety of computing and engineering courses, as well as in other fields, in lieu of physical labs. Results of a survey supporting the validity of this approach are also presented. Students in four different classes were surveyed concerning the effectiveness and desirability of this virtual laboratory approach. The survey results indicate that student response to and interest in the virtual environment is very strong.

Traditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper presents a 2D-mesh cluster allocation strategy for hypercubes. The proposed auxiliary free list processor allocation strategy can efficiently allocate 2D-mesh dusters without size constraints, can reduce average job turnaround time compared with that based on subcube allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlock-free E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.>

The clustered parallel computer (CPC), based on a workstation cluster, is becoming popular as a choice for high-performance network or parallel computing. However, operating system overheads, network protocols, and higher message-passing latency contribute to a lower overall communication performance in a cluster of workstations, increasing the likelihood that timesharing of parallel jobs can be used to improve system throughput in a workstation cluster. The traditional means by which the CPC minimizes user job turnaround time (JTT) is through space sharing, in which user jobs are given exclusive control over clusters of processors. The objective of this study is to examine methods by which system utilization may be increased by giving timeshared access to parallel jobs without sacrificing the primary goal of minimizing user JTT.>

Cedar is a hierarchical shared-memory multiprocessor consisting of four clusters of vector processors connected to a 32-bank word-interleaved shared memory via two unidirectional multistage shuffle-exchange networks. Cedar scalability is studied via simulation and measurement. The simulation methodology is verified by comparing simulated performance with that of the real machine. The performance scalability of the interconnection networks and memory modules which compose Cedar's shared memory system is then examined in detail. The system is shown to be basically scalable in performance, but not perfectly so. A "brute force" approach to increasing scalability, doubling the clock speed of the memory subsystem, is shown to be only moderately effective at improving scalability. Finally, by limiting traffic in the network, the scalability of the system is increased significantly at very little cost.>

Tkaditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper predents a 2Dmesh cluster allocation strategy for hypercubes. The proposed auxiliary free list procwor allocation strategy can efficiently allocate 2D-mesh clusters without size constraints, can reduce average job turnaround time compared with that based on subcubc allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlockfree Ecube routing. The proposed auxiIiary free list strategy can be easily implemented on hypercube multicomputers to increage processor utilization.

In this paper, we give an overview of the Cedar multiprocessor and present recent performance results. These include the performance of some computational kernels and the Perfect Benchmarks. We also present a methodology for judging parallel system performance and apply this methodology to Cedar, Cray YMP-8, and Thinking Machines CM-5.

Article Free Access Share on Performance of a shared memory system for vector multiprocessors Authors: S. W. Turner Univ. of Illinois, Urbana, IL Univ. of Illinois, Urbana, ILView Profile , A. V. Veidenbaum Univ. of Illinois, Urbana, IL Univ. of Illinois, Urbana, ILView Profile Authors Info & Claims ICS '88: Proceedings of the 2nd international conference on SupercomputingJune 1988 Pages 315–325https://doi.org/10.1145/55364.55395Online:01 June 1988Publication History 10citation186DownloadsMetricsTotal Citations10Total Downloads186Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF