507,150 research outputs found

    Short lists with short programs in short time - a short proof

    Full text link
    Bauwens, Mahklin, Vereshchagin and Zimand [ECCC TR13-007] and Teutsch [arxiv:1212.6104] have shown that given a string x it is possible to construct in polynomial time a list containing a short description of it. We simplify their technique and present a shorter proof of this result

    Semi Automated Partial Credit Grading of Programming Assignments

    Get PDF
    The grading of student programs is a time consuming process. As class sizes continue to grow, especially in entry level courses, manually grading student programs has become an even more daunting challenge. Increasing the difficulty of grading is the needs of graphical and interactive programs such as those used as part of the UNH Computer Science curriculum (and various textbooks). There are existing tools that support the grading of introductory programming assignments (TAME and Web-CAT). There are also frameworks that can be used to test student code (JUnit, Tester, and TestNG). While these programs and frameworks are helpful, they have little or no no support for programs that use real data structures or that have interactive or graphical features. In addition, the automated tests in all these tools provide only “all or nothing” evaluation. This is a significant limitation in many circumstances. Moreover, there is little or no support for dynamic alteration of grading criteria, which means that refactoring of test classes after deployment is not easily done. Our goal is to create a framework that can address these weaknesses. This framework needs to: 1. Support assignments that have interactive and graphical components. 2. Handle data structures in student programs such as lists, stacks, trees, and hash tables. 3. Be able to assign partial credit automatically when the instructor can predict errors in advance. 4. Provide additional answer clustering information to help graders identify and assign consistent partial credit for incorrect output that was not predefined. Most importantly, these tools, collectively called RPM (short for Rapid Program Management), should interface effectively with our current grading support framework without requiring large amounts of rewriting or refactoring of test code

    There’s a standard for that: Aligning academic aspirations, professional standards, and ALA accreditation

    Get PDF
    The Syracuse University library and information science (LIS) program has committed to a new focus on INformation Justice, Equity, and Community EngagemenT (INJECT) that will guide a redesign of our program and redefine our commitment to our students, our coursework, and our impact on the information profession and broader community. While INJECT concepts form the bedrock of our new curriculum, our program is committed to being responsive to library professional standards as well as the ALA Standards for Accreditation of Master’s Programs in Library and Information Studies. Professional standards produced by library associations including ALA, IFLA, ACRL, SLA, RUSA, and YALSA reflect the needs of the library profession and impact the knowledge, skills, abilities, and dispositions librarians need to learn. In designing professional curriculum, LIS faculty must respond to and design for existing standards and competency lists in order to create a program that correlates with the ideals held by various library organizations. At the same time, LIS programs must demonstrate alignment with ALA Standards for Accreditation. So, how do the various competency lists compare to accreditation standards? How do the competencies and standards support INJECT topics, including critical librarianship, social justice, and equity and where do they fall short? This poster reveals an analysis and alignment of professional standards, accreditation standards, and our aspirations to better represent information justice, equity, and community engagement in LIS. This work can enable faculty to transform LIS curricula and create a resilient future for our programs, our student, and the broader LIS profession

    Review of \u3ci\u3eONE HUNDRED YEARS OF INQUIRY AND INNOVATION: AN ILLUSTRATED HISTORY OF THE AMERICAN DAIRY SCIENCE ASSOCIATION\u3c/i\u3e, edited by Coleen M. Jones

    Get PDF
    In recognition of its centennial, the American Dairy Science Association (founded in July 1906) has produced this large (8 1/2 x 11) coffee-table book, chronicling the Association’s first 100 years. The book is richly illustrated with both black and white, and color photographs, gleaned from many academic dairy science programs, individual association members, and well-known dairy industry publications. Beginning with information on dairying prior to 1906 and the founding of the ADSA, the arrangement is then divided into 25-year intervals. Each of the four sections leads with a short overview of dairying, followed by line graphs of the number of milk cows, milk production, and consumption for the time period. A year-by-year summary of developments and significant events in the industry, and/or the Association, completes the information. The images throughout complement and reinforce the text, illustrating production and industry practices, research, changes in mechanization and technology, and consumer public relations. The volume ends with the ADSA Vision and Mission statements, lists of past-presidents and executive leadership, and an epilogue by a member of the Centennial Planning Committee

    On the parallelization of molecular dynamics codes

    Get PDF
    Abstract Molecular dynamics (MD) codes present a high degree of spatial data locality and a significant amount of independent computations. However, most of the parallelization strategies are usually based on the manual transformation of sequential programs either by completely rewriting the code with message passing routines or using specific libraries intended for writing new MD programs. In this paper we propose a new library-based approach (DDLY) which supports parallelization of existing short-range MD sequential codes. The novelty of this approach is that it can directly handle the distribution of common data structures used in MD codes to represent data (arrays, Verlet lists, link cells), using domain decomposition. Thus, the insertion of run-time support for distribution and communication in a MD program does not imply significant changes to its structure. The method is simple, efficient and portable. It may be also used to extend existing parallel programming languages, such as HPF

    Differential Adoption of Technologies and its Implications for Policy choice between Equity and Growth

    Get PDF
    Government policies often attempt to create simultaneous impact on economic efficiency and equity. The Ethiopian government optimistically has targeted to simultaneously achieve at improvement in agricultural efficiency (growth) and equitable distribution of the benefits by all farmers in the whole part of the country. However, many scholars most often argue that growth and equity are inversely related in most development processes. Thus, the main objective of the paper was to evaluate the interhousehold and interregional technology adoption pattern (implies both growth and equity). The conceptual relationship of growth and equity, and experiences in adoption studies were first assessed. Then three ecological potentials with 150 sample size each (a total of 450) were studied using Probit Model. The study result has shown that only 35.5% of the sample adopted. The beneficiaries of the extension were relatively the resource rich farmers of which the largest proportion were concentrated in the high potentials areas. The high potential areas benefited remarkably higher net returns to land and management from the use of same technology than the other areas. Thus, alike the previous extension approaches used in the country and as supported by lists of literature, the new extension system could not be also free from such bias at least in the short-run. Conclusively, differential adoption of technology within a certain period of time can be regarded as a natural phenomenon. Hence, efforts to enable both the poor and the rich to equally adopt agricultural technology would rather imply substituting equity for growth at a very low level of the economy status that has immeasurable social cost. For countries like Ethiopia, which is at a very low level of economic status, focusing on growth through increasing the farm productivity of the potential adopters in the short-run, and designing special programs for the poor to follow their footsteps is suggestible. Otherwise, the country may remain behind while pulling both the poor and the rich together

    Linear list-approximation for short programs (or the power of a few random bits)

    Full text link
    A cc-short program for a string xx is a description of xx of length at most C(x)+cC(x) + c, where C(x)C(x) is the Kolmogorov complexity of xx. We show that there exists a randomized algorithm that constructs a list of nn elements that contains a O(logn)O(\log n)-short program for xx. We also show a polynomial-time randomized construction that achieves the same list size for O(log2n)O(\log^2 n)-short programs. These results beat the lower bounds shown by Bauwens et al. \cite{bmvz:c:shortlist} for deterministic constructions of such lists. We also prove tight lower bounds for the main parameters of our result. The constructions use only O(logn)O(\log n) (O(log2n)O(\log^2 n) for the polynomial-time result) random bits . Thus using only few random bits it is possible to do tasks that cannot be done by any deterministic algorithm regardless of its running time

    Short lists for shortest descriptions in short time

    Full text link
    Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instead seek a short list of candidates which includes a laconic description. Remarkably such approximations exist. This paper presents an efficient algorithm which generates a polynomial-size list containing an optimal description for a given input string. Along the way, we employ expander graphs and randomness dispersers to obtain an Explicit Online Matching Theorem for bipartite graphs and a refinement of Muchnik's Conditional Complexity Theorem. Our main result extends recent work by Bauwens, Mahklin, Vereschchagin, and Zimand

    Sustainability Education and Learning Committee Web Portal

    Get PDF
    Course Code: ENR/AEDE 4567This project was completed for The Sustainability Education and Learning Committee (SELC) of OSU's Sustainability Institute to provide insight and student perspective on the best way to design an interactive web portal that encompasses and makes easily accessible all sustainability-centric and and sustainability-related majors, minors, and coursework in one platform.Sustainability Education and Learning CommitteeAcademic Major: Environment, Economy, Development, and Sustainabilit
    corecore