A Case Study of the Impediments to the Commercialization of Research at the University of Kentucky

The commercialization of university-based research occurs to varying degrees between academic institutions. Previous studies have found that multiple barriers can impede the effectiveness and efficiency by which academic research is commercialized. This case study was designed to better understand the impediments to research commercialization at the University of Kentucky via a survey and interview with three successful academic entrepreneurs. The study also garnered insight from the individuals as to how the commercialization process could be improved. Issues with commercialization infrastructure; a lack of emphasis, at the university level, on the importance of research commercialization; a void in an entrepreneurial culture on campus; inhibitory commercialization policies; and a lack of business and commercialization knowledge among faculty were highlighted as the most significant barriers. The research subjects also suggested that commercialization activity may generally increase if a number of factors were mitigated. Such insight can be communicated to the administrative leadership of the commercialization process at the University of Kentucky. Long term, improving university-based research commercialization will allow academic researchers to be more active and successful entrepreneurs such that intellectual property will progress more freely to the marketplace for the benefit of inventors, universities and society

On the k-Boundedness for Existential Rules

The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase. It is well-known that this problem is undecidable for all known chase variants. The related problem of boundedness asks if a given set of existential rules is bounded, i.e., whether there is a predefined upper bound on the number of (breadth-first) steps of the chase, independently from any factbase. This problem is already undecidable in the specific case of datalog rules. However, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound is unknown. Hence, in this paper, we investigate the decidability of the k-boundedness problem, which asks whether a given set of rules is bounded by an integer k. We prove that k-boundedness is decidable for three chase variants, namely the oblivious, semi-oblivious and restricted chase.Comment: 20 pages, revised version of the paper published at RuleML+RR 201

Prioritized Repairing and Consistent Query Answering in Relational Databases

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.Comment: Accepted to the special SUM'08 issue of AMA

Overlapping Schwarz for Nonlinear Problems. An Element Agglomeration Nonlinear Additive Schwarz Preconditioned Newton Method for Unstructured Finite Element Problems

This paper extends previous results on nonlinear Schwarz preconditioning ([4]) to unstructured finite element elliptic problems exploiting now nonlocal (but small) subspaces. The non-local finite element subspaces are associated with subdomains obtained from a non-overlapping element partitioning of the original set of elements and are coarse outside the prescribed element subdomain. The coarsening is based on a modification of the agglomeration based AMGe method proposed in [8]. Then, the algebraic construction from [9] of the corresponding non-linear finite element subproblems is applied to generate the subspace based nonlinear preconditioner. The overall nonlinearly preconditioned problem is solved by an inexact Newton method. Numerical illustration is also provided

Disclination vortices in elastic media

The vortex-like solutions are studied in the framework of the gauge model of disclinations in elastic continuum. A complete set of model equations with disclination driven dislocations taken into account is considered. Within the linear approximation an exact solution for a low-angle wedge disclination is found to be independent from the coupling constants of the theory. As a result, no additional dimensional characteristics (like the core radius of the defect) are involved. The situation changes drastically for 2\pi vortices where two characteristic lengths, l_\phi and l_W, become of importance. The asymptotical behaviour of the solutions for both singular and nonsingular 2\pi vortices is studied. Forces between pairs of vortices are calculated.Comment: 13 pages, published versio

Physical Electronics

Contains reports on three research projects

An in-depth investigation of interval temporal logic model checking with regular expressions

In the last years, the model checking (MC) problem for interval temporal logic (ITL) has received an increasing attention as a viable alternative to the traditional (point-based) temporal logic MC, which can be recovered as a special case. Most results have been obtained by imposing suitable restrictions on interval labeling. In this paper, we overcome such limitations by using regular expressions to define the behavior of proposition letters over intervals in terms of the component states. We first prove that MC for Halpern and Shoham’s ITL (HS), extended with regular expressions, is decidable. Then, we show that formulas of a large class of HS fragments, namely, all fragments featuring (a subset of) HS modalities for Allen’s relations meets, met-by, starts, and started-by, can be model checked in polynomial working space (MC for all these fragments turns out to be PSPACE-complete)