Doina Bein

Dr. Doina Bein

Department of Computer Science, California State University, Fullerton, CA, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011
Verified
Book Chapter
Closed access
PDF file
DBDoina Bein
Doina Bein
WBWolfgang Bein
Wolfgang Bein
SVSwathi Venigella
Swathi Venigella

1 January 2009 in International Journal of Sensor Networks
Verified
Journal Article
Closed access
WBWolfgang W. Bein
Wolfgang W. Bein
DBDoina Bein
Doina Bein
SMSrilaxmi Malladi
Srilaxmi Malladi
We study the coverage problem for sensor networks from the fault tolerance and reliability point of view. Fault tolerance is a critical issue for sensors deployed in places where they are not easily replaceable, repairable and rechargeable. Failure of one node should not incapacitate the entire network. We propose three 1-fault tolerant topologies, namely square, hexagonal and improved 8-node. We show how to extend these to k-fault tolerant schemes and calculate reliabilities using Markov models. The proposed models are compared to one another, as well as with the minimal coverage model of Zhang and Hou. The minimum coverage model is the most unreliable among the models, whereas the improved 8-node model is the most reliable except at the very beginning of the system, where the square model is more reliable. To our knowledge, this is the first paper which studies a pattern from the perspective of reliability.

1 May 2010 in Information Sciences
Verified
Journal Article
Closed access
DBDoina Bein
Doina Bein
SZS.Q. Zheng
S.Q. Zheng

12 October 2012 in Information Fusion
Verified
Journal Article
Closed access
YWYicheng Wen
Yicheng Wen
DBDoina Bein
Doina Bein
SPShashi Phoha
Shashi Phoha

15 February 2010
Verified
Conference Paper
Open access
PDF file
BCBhadrachalam Chitturi
Bhadrachalam Chitturi
DBDoina Bein
Doina Bein
NGNick V. Grishin
Nick V. Grishin
The search of structural motifs that specify the spatial arrangement of polypeptide segments is preferred over other methods such as common substructure discovery and structural superposition in comparing protein structures. 3D protein structures can be modeled as graphs whose maximum degree is bounded by a constant. Structural motifs can also be modeled as graphs and a significant percentage of them are trees. Thus, motif search in proteins can be modeled as an enumeration of isomorphic subgraphs where a query tree Q with m nodes is searched in a sparse graph G with n nodes and the maximum degree of any node in G is bounded by a constant ε. We design an efficient divide-and-conquer algorithm that finds all copies of Q in G by partitioning Q using a minimum dominating set. This strategy can be extended to sparse query graphs that can be reduced to trees by deleting a small number of edges.

12 May 2020
Verified
Book Chapter
Closed access
PDF file
CVChary Vielma
Chary Vielma
AVAbhishek Verma
Abhishek Verma
DBDoina Bein
Doina Bein