Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Viktors Berstis is active.

Publication


Featured researches published by Viktors Berstis.


international conference of the ieee engineering in medicine and biology society | 2009

Virtual Microscopy and Grid-Enabled Decision Support for Large-Scale Analysis of Imaged Pathology Specimens

Lin Yang; Wenjin Chen; Peter Meer; Gratian Salaru; Lauri Goodell; Viktors Berstis; David J. Foran

Breast cancer accounts for about 30% of all cancers and 15% of cancer deaths in women. Advances in computer-assisted analysis hold promise for classifying subtypes of disease and improving prognostic accuracy. We introduce a grid-enabled decision support system for performing automatic analysis of imaged breast tissue microarrays. To date, we have processed more than 1 00 000 digitized specimens (1200 times 1200 pixels each) on IBMs World Community Grid (WCG). As a part of the Help Defeat Cancer (HDC) project, we have analyzed that the data returned from WCG along with retrospective patient clinical profiles for a subset of 3744 breast tissue samples, and have reported the results in this paper. Texture-based features were extracted from the digitized specimens, and isometric feature mapping was applied to achieve nonlinear dimension reduction. Iterative prototyping and testing were performed to classify several major subtypes of breast cancer. Overall, the most reliable approach was gentle AdaBoost using an eight-node classification and regression tree as the weak learner. Using the proposed algorithm, a binary classification accuracy of 89% and the multiclass accuracy of 80% were achieved. Throughout the course of the experiments, only 30% of the dataset was used for training.


Genome Research | 2011

The Proteome Folding Project: Proteome-scale prediction of structure and function

Kevin Drew; Patrick Winters; Glenn L. Butterfoss; Viktors Berstis; Keith Uplinger; Jonathan Armstrong; Michael Riffle; Erik Schweighofer; Bill Bovermann; David R. Goodlett; Trisha N. Davis; Dennis E. Shasha; Lars Malmström; Richard Bonneau

The incompleteness of proteome structure and function annotation is a critical problem for biologists and, in particular, severely limits interpretation of high-throughput and next-generation experiments. We have developed a proteome annotation pipeline based on structure prediction, where function and structure annotations are generated using an integration of sequence comparison, fold recognition, and grid-computing-enabled de novo structure prediction. We predict protein domain boundaries and three-dimensional (3D) structures for protein domains from 94 genomes (including human, Arabidopsis, rice, mouse, fly, yeast, Escherichia coli, and worm). De novo structure predictions were distributed on a grid of more than 1.5 million CPUs worldwide (World Community Grid). We generated significant numbers of new confident fold annotations (9% of domains that are otherwise unannotated in these genomes). We demonstrate that predicted structures can be combined with annotations from the Gene Ontology database to predict new and more specific molecular functions.


international symposium on computer architecture | 1980

Security and protection of data in the IBM System/38

Viktors Berstis

The IBM System/38 machine architecture provides data security through addressability control and protection domains while minimizing overhead for this service. This paper describes the addressing mechanism, basic data organization and process structure of the System/38. These constructs are fundamental to the operation of the security mechanism. A description is given of security in the architecture and how it can be extended.


IEEE Design & Test of Computers | 1989

The V compiler: automatic hardware design

Viktors Berstis

The V language describes VLSI systems concisely through the use of sequential algorithmic descriptions. Because V includes high-level constructs such as queues, asynchronous calls, and cycle-blocks, designs are more readily described and optimized into efficient hardware implementations. The implementations can then be tuned for space, time, or other objectives using annotations. From the input description, the V compiler generates both a register-transfer-level specification and a software simulator. Thus, a single description is suitable for both functional simulation and input to logic synthesis. The author describes parsing. scheduling, and resource sharing using the V compiler. He discusses synthesis and simulation, annotations, and high-level constructs.<<ETX>>


Archive | 1999

Method and apparatus for setting automotive performance tuned preferences set differently by a driver

Viktors Berstis


Archive | 2003

Introduction to grid computing with globus

Luis Ferreira; Viktors Berstis; Jonathan Armstrong; Mike Kendzierski; Andreas Neukoetter; MasanobuTakagi; Richard Bing; Adeeb Amir; Ryo Murakawa; Olegario Hernandez; James Magowan; Norbert Bieberstein


Archive | 1997

Method for intelligently resolving entry of an incorrect uniform resource locator (URL)

Viktors Berstis; Maria Azua Himmel


Archive | 1999

Blocking saves to web browser cache based on content rating

Viktors Berstis; Herman Rodriguez


Archive | 1999

Method and apparatus for displaying real-time visual information on an automobile pervasive computing client

Viktors Berstis


Archive | 1997

Global history view

Viktors Berstis

Researchain Logo
Decentralizing Knowledge