45,377 research outputs found
UNO Website-International Studies and Programs-Homepage
No full textThe University of Nebraska Omaha (UNO) offers more than 200 high-quality academic programs in a safe, affordable U.S. city.
With more than 2,000 international students, we hove t he most diverse university in the region There\u27s no better time to be a Maverick
UNO Website CIS&T Computer Science Learning Center homepage
No full textThe Computer Science Learning Center (CSLC) offers peer-based assistance to several other CS core courses through peer tutoring and review sessions. The CSLC serves all UNO students taking these courses free of charge. Students seeking to work with a tutor only need to come to the center; no appointment is necessary for most of these core courses
UNO 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
New insights in high-energy electron emission and underlying transport physics of nanocrystalline Si
No full textOmaha 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.
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
UNO Website: TLC Homepage
No full textThe Thompson Learning Community (TLC) is a learning community that provides support to students with a Susan T. Buffet Foundation scholarship. TLC aims to make the transition to college, and the entry into a major field of study as smooth and educationally rewarding as possible
Enumeration of Maximal Common Subsequences Between Two Strings
No full textA maximal common subsequence (MCS) between two strings X and Y is an inclusion-maximal subsequence of both X and Y. MCSs are a natural generalization of the classical concept of longest common subsequence (LCS), which can be seen as a longest MCS. We study the problem of efficiently listing all the distinct MCSs between two strings. As discussed in the paper, this problem is algorithmically challenging as the same MCS cannot be listed multiple times: for example, dynamic programming [Fraser et al., CPM 1998] incurs in an exponential waste of time, and a recent algorithm for finding an MCS [Sakai, CPM 2018] does not seem to immediately extend to listing. We follow an alternative and novel graph-based approach, proposing the first output-sensitive algorithm for this problem: it takes polynomial time in n per MCS found, where n= max { | X| , | Y| } , with polynomial preprocessing time and space
- …
