A conceptual approach to gene expression analysis enhanced by visual analytics

The analysis of gene expression data is a complex task for biologists wishing to understand the role of genes in the formation of diseases such as cancer. Biologists need greater support when trying to discover, and comprehend, new relationships within their data. In this paper, we describe an approach to the analysis of gene expression data where overlapping groupings are generated by Formal Concept Analysis and interactively analyzed in a tool called CUBIST. The CUBIST workflow involves querying a semantic database and converting the result into a formal context, which can be simplified to make it manageable, before it is visualized as a concept lattice and associated charts

Effects of interior aircraft noise on speech intelligibility and annoyance

Recordings of the aircraft ambiance from ten different types of aircraft were used in conjunction with four distinct speech interference tests as stimuli to determine the effects of interior aircraft background levels and speech intelligibility on perceived annoyance in 36 subjects. Both speech intelligibility and background level significantly affected judged annoyance. However, the interaction between the two variables showed that above an 85 db background level the speech intelligibility results had a minimal effect on annoyance ratings. Below this level, people rated the background as less annoying if there was adequate speech intelligibility

Spartan Daily, April 25, 1990

Volume 94, Issue 57https://scholarworks.sjsu.edu/spartandaily/7987/thumbnail.jp

An overlay architecture for throughput optimal multipath routing

Legacy networks are often designed to operate with simple single-path routing, like shortest-path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions. In this work, we study an overlay architecture for dynamic routing such that only a subset of devices (overlay nodes) need to make dynamic routing decisions. We determine the essential collection of nodes that must bifurcate traffic for achieving the maximum multicommodity network throughput. We apply our optimal node placement algorithm to several graphs and the results show that a small fraction of overlay nodes is sufficient for achieving maximum throughput. Finally, we propose a heuristic policy (OBP), which dynamically controls traffic bifurcations at overlay nodes. In all studied simulation scenarios, OBP not only achieves full throughput, but also reduces delay in comparison to the throughput optimal backpressure routing.United States. Air Force (Contract FA8721-05-C-0002)National Science Foundation (U.S.) (Grant CNS-0915988)United States. Office of Naval Research (Grant N00014-12-1-0064)United States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238)European Social Fund (WiNC Project of the Action:Supporting Postdoctoral Researchers

Spartan Daily, October 17, 1983

Volume 81, Issue 34https://scholarworks.sjsu.edu/spartandaily/7083/thumbnail.jp

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion

A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks to find whether there exist at most k edges in the input graph whose deletion results in a diamond-free graph. The problem was proved to be NP-complete and a polynomial kernel of O(k^4) vertices was found by Fellows et. al. (Discrete Optimization, 2011). In this paper, we give an improved kernel of O(k^3) vertices for Diamond-free Edge Deletion. We give an alternative proof of the NP-completeness of the problem and observe that it cannot be solved in time 2^{o(k)} * n^{O(1)}, unless the Exponential Time Hypothesis fails

CNPq/INPE LANDSAT system: Report of activities from October 1, 1983 to September 30, 1984

The status of Brazilian facilities for receiving, recording, processing, and distributing LANDSAT-generated products is presented. Price lists and the revised LANDSAT-4 and -5 coverage map are included

Spartan Daily, May 8, 1989

Volume 92, Issue 63https://scholarworks.sjsu.edu/spartandaily/7853/thumbnail.jp

Spartan Daily, January 28, 1991

Volume 96, Issue 1https://scholarworks.sjsu.edu/spartandaily/8069/thumbnail.jp

Spartan Daily, October 12, 1982

Volume 79, Issue 31https://scholarworks.sjsu.edu/spartandaily/6943/thumbnail.jp