32,426 research outputs found
New insights in high-energy electron emission and underlying transport physics of nanocrystalline Si
No full textUNO News Events, March 2016 Author Linda Suskie Leads Interactive Webinar for Faculty
No full textThe Center for Faculty Excellence and the Assessment Committee will co-sponsor two webinars presented by Linda Suskie, author of Assessing Student Learning: A Common Sense Guide. The assessment webinars will be interactive with a short set of presentations, and each will be followed by a question and answer discussion. The book discussion will focus on Chapter 7--Organizing an Assessment Process and Chapter 10-Creating on Effective Assinment
Electron Energy Loss Behavior in Si Quantum Dots Interconnected with Tunnel Oxide Barriers
No full textEfficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
No full textIn this paper we consider the problem of listing the maximal k-degenerate induced subgraphs of a chordal graph, and propose an output-sensitive algorithm using delay O(m⋅ω(G)) for any n-vertex chordal graph with m edges, where ω(G)≤n is the maximum size of a clique in G. Degeneracy is a well known sparsity measure, and k-degenerate subgraphs are a notion of sparse subgraphs, which generalizes other problems such as independent sets (0-degenerate subgraphs) and forests (1-degenerate subgraphs). Many efficient enumeration algorithms are designed by solving the so-called Extension problem, which asks whether there exists a maximal solution containing a given set of nodes, but no node from a forbidden set. We show that solving this problem is NP-complete for maximal k-degenerate induced subgraphs, motivating the need for additional techniques
Omaha Public High Schools\u27 Graduates Attending UNO
No full textDuring the 1986-87 school year, the University of Nebraska at Omaha/Omaha Public Schools (UNO/OPS) Liaison Committee requested a study to determine how high school graduates from the Omaha Public Schools were progressing in their college careers at UNO. The author was asked to work with Paul Malcom of the Research Department of Omaha Public Schools to determine how the study might be conducted. Possible research questions were shared with the committee. The author met with Malcom to obtain lists of names of high school graduates.
Earlier, OPS conducted a survey of its high school graduates and developed a list of high schools graduates who reported attending UNO. More than one-third of the names listed as attending UNO were not found in UNO records. Of the one-third missing from UNO records, half had arranged to send American College Test (ACT) scores to UNO, although they had not registered for classes. Apparently, some students who intended to go to UNO decided to work for a period of time before they registered at the university. (The follow-up study with its self-reporting procedures presented too many problems, and was not used in this study.
In honor of Philip M. Morse.
No full textIncludes bibliographies.Editors Herman Feshbach and K. Uno Ingard
Opening Access: Increasing Scholarly Impact with DigitalCommons@UNO
No full textDigitalCommons@UNO (https://digitalcommons.unomaha.edu/) is an Institutional Repository (IR) and an initiative implemented by the University of Nebraska at Omaha (UNO) Libraries to support our UNO scholars through providing a Green Open Access solution. DigitalCommons@UNO disseminates a wide variety of scholarship including faculty papers, electronic theses and dissertations (ETDs), conferences and journals. Since its launch in 2014, the UNO Libraries have been implementing and managing DigitalCommons@UNO through outreach to the UNO community in an effort to collect scholarly works into the IR
New polynomial delay bounds for maximal subgraph enumeration by proximity search
No full textIn this paper we propose polynomial delay algorithms for several maximal subgraph listing problems, by means of a seemingly novel technique which we call proximity search. Our result involves modeling the space of solutions as an implicit directed graph called “solution graph”, a method common to other enumeration paradigms such as reverse search. Such methods, however, can become inefficient due to this graph having vertices with high (potentially exponential) degree. The novelty of our algorithm consists in providing a technique for generating better solution graphs, reducing the out-degree of its vertices with respect to existing approaches, and proving that it remains strongly connected. Applying this technique, we obtain polynomial delay listing algorithms for several problems for which output-sensitive results were, to the best of our knowledge, not known. These include Maximal Bipartite Subgraphs, Maximal k-Degenerate Subgraphs (for bounded k), Maximal Induced Chordal Subgraphs, and Maximal Induced Trees. We present these algorithms, and give insight on how this general technique can be applied to other problems
- …
