100,095 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Implementation Challenges and Opportunities in the Outcome-Based Education (OBE) for Teaching Engineering Courses: A Case Study
No full textAbstract: Outcome-based education is a closed-loop control system accepted globally for enhancing the teaching-learning processes. However, the success of the system is not prominently visible in fresh graduates. Hence detailed research and optimal process to implement OBE is necessary. This paper aims to investigate the challenges in implementing Outcome-based education and explores opportunities for improvement. Further, pedagogic planning for the analytical subjects has been proposed and the performance of the proposed method is analyzed using a case study. Performance improvement in Course Outcome attainments of the course Antennas and Wave Propagation, offered for undergraduate engineering (ECE) students have been investigated and evaluated in this paper. The investigation shows that dynamically adapting the teaching-learning and assessment methods during the course based on the assessments of the student’s capabilities results in improved performance. The following changes in the system have been suggested for the optimal implementation of OBE. The CO targets for the current semester course should be fixed based on the CO attainment of the previous semester courses of the same batch instead of the traditional way of fixing CO attainment targets. The microanalysis of the end-semester marks and students’ feedback at the ratio of 5:1 may be considered for overall CO attainment computation at the end of the course.Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP)
© Copyright: All rights reserved
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Popular Roommates in Simply Exponential Time
No full textWe consider the popular matching problem in a graph G = (V,E) on n vertices with strict preferences. A matching M is popular if there is no matching N in G such that vertices that prefer N to M outnumber those that prefer M to N. It is known that it is NP-hard to decide if G has a popular matching or not. There is no faster algorithm known for this problem than the brute force algorithm that could take n! time. Here we show a simply exponential time algorithm for this problem, i.e., one that runs in O^*(k^n) time, where k is a constant.
We use the recent breakthrough result on the maximum number of stable matchings possible in such instances to analyze our algorithm for the popular matching problem. We identify a natural (also, hard) subclass of popular matchings called truly popular matchings and show an O^*(2^n) time algorithm for the truly popular matching problem
Stable Matchings with One-Sided Ties and Approximate Popularity
No full textWe consider a matching problem in a bipartite graph G = (A ∪ B, E) where vertices in A rank their neighbors in a strict order of preference while vertices in B are allowed to have weak rankings, i.e., ties are allowed in their preferences. Stable matchings always exist in G and are easy to find, however popular matchings need not exist and it is NP-complete to decide if one exists. This motivates the "approximately popular" matching problem.
A well-known measure of approximate popularity is low unpopularity factor. We show that when each tie in G has length at most k, there always exists a stable matching whose unpopularity factor is at most k. Our proof is algorithmic and we compute such a stable matching in polynomial time. Our result can be considered to be a generalization of Gärdenfors' result (1975) which showed that when rankings are strict, every stable matching is popular.
There are several applications where the size of the matching is its most important attribute. What one seeks here is a maximum matching M such that there is no maximum matching more popular than M. When rankings are weak, it is NP-hard to decide if G admits such a matching. When ties are one-sided and of length at most k, we show a polynomial time algorithm to find a maximum matching whose unpopularity factor within the set of maximum matchings is at most 2k
Fairly Popular Matchings and Optimality
No full textWe consider a matching problem in a bipartite graph G = (A ∪ B, E) where vertices have strict preferences over their neighbors. A matching M is popular if for any matching N, the number of vertices that prefer M is at least the number that prefer N; thus M does not lose a head-to-head election against any matching where vertices are voters. It is easy to find popular matchings; however when there are edge costs, it is NP-hard to find (or even approximate) a min-cost popular matching. This hardness motivates relaxations of popularity.
Here we introduce fairly popular matchings. A fairly popular matching may lose elections but there is no good matching (wrt popularity) that defeats a fairly popular matching. In particular, any matching that defeats a fairly popular matching does not occur in the support of any popular mixed matching. We show that a min-cost fairly popular matching can be computed in polynomial time and the fairly popular matching polytope has a compact extended formulation.
We also show the following hardness result: given a matching M, it is NP-complete to decide if there exists a popular matching that defeats M. Interestingly, there exists a set K of at most m popular matchings in G (where |E| = m) such that if a matching is defeated by some popular matching in G then it has to be defeated by one of the matchings in K
Popular matchings: structure and algorithms
No full textAn instance of the popular matching problem (POP-M) consists of a set of applicants and a set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A matching M of applicants to posts is popular if there is no other matching M' such that more applicants prefer M' to M than prefer M to M'. This paper provides a characterization of the set of popular matchings for an arbitrary POP-M instance in terms of a structure called the switching graph, a directed graph computable in linear time from the preference lists. We show that the switching graph can be exploited to yield efficient algorithms for a range of associated problems, including
the counting and enumeration of the set of popular matchings and computing popular matchings that satisfy various additional optimality criteria. Our algorithms for computing such optimal popular matchings improve those described in a recent paper by Kavitha and Nasre
Supplemental Material - Prevalence and correlates of human immunodeficiency virus infection among spouses of married men who have sex with men in India
No full textSupplemental Material for Prevalence and correlates of human immunodeficiency virus infection among spouses of married men who have sex with men in India by Aylur K Srikrishnan, Kavitha Ganesan, Shruti H Mehta, Cecilia Tomori, Canjeevaram K Vasudevan, David D Celentano and Sunil S Solomon in International Journal of STD & AIDS</p
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Cycle bases in graphs characterization, algorithms, complexity, and applications.
No full textCycles in graphs play an important role in many applications, e.g., analysis of electrical networks, analysis of chemical and biological pathways, periodic scheduling, and graph drawing. From a mathematical point of view, cycles in graphs have a rich structure. Cycle bases are a compact description of the set of all cycles of a graph. In this paper, we survey the state of knowledge on cycle bases and also derive some new results. We introduce different kinds of cycle bases, characterize them in terms of their cycle matrix, and prove structural results and apriori length bounds. We provide polynomial algorithms for the minimum cycle basis problem for some of the classes and prove APX -hardness for others.
We also discuss three applications and show that they require different kinds of cycle bases
- …
