Curriculum Vitae - The University of Texas at Dallas

More documents

Recommendations

Info

2011 AFCEA (Armed Forces Communications and Electronics Association) Medal of Merit forService to AFCEA and Sustained Professional Excellence in Communications, Electronics,Intelligence and Information SystemsRecipient of 2011 SDPS (Society for Design and Process Science) Fellow Award forTransdisciplinary research in cyber securityRecipient of 2011 Society of Information Reuse and Integration (Subcommittee of IEEE Systems,Man and Cybernetics Society) Fellow Award for “outstanding research contributions andleadership in Secure Knowledge Management”INTERNALMITRE Program Achievement Awards 1997 (AWACS), 2002 and 2005 (IRS Research Credit)MITRE Director’s Awards 1997 (Data Mining), 1997 (Distributed Objects) MITRE Author of the Month Award (1997, 1999) Honeywell Computer Sciences Center Employee of the Month Award (April 1987)Control Data Corporation, Arden Hill Programming Division, CDCNET Award (September1985) NSF Program Awards (ITR 2003, Cyber Trust 2005)Louis A. Beecherl, Jr. I Distinguished Professorship in the Erik Jonsson School of Engineeringand Computer Science, The University of Texas at Dallas, 2010UTD Author Receptions (2007, 2008, 2009, 2010, for 4 books published while at UTD) UTD Invention Disclosure Awards, April 2010 UTD Invention Disclosure and Tech Transfer Award, November 20106
Section 3: SYNOPSIS OF RESEARCHMy research combines theory and practice. During the past 30+ years I have utilized my PhD research intheory of computation and complexity theory with my systems expertise in industry to develop prototypesbased on fundamental principles. Much of my research during this time was on the design anddevelopment of secure data management systems based on fundamental principles. A synopsis of myresearch follows.After I finished my PhD, starting in 1980, I continued with my research in computability theory andpublished four papers on my thesis work. They are: (i) Cylindrical Decision Problems for SystemFunctions in the Notre Dame Journal of Formal Logic in 1983; System Functions and their DecisionProblems, in Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik. (Mathematical LogicQuarterly) in 1984; The Concept of N-Cylinder and its Application in Zeitschrift fur Mathematische Logikund Grundlagen der Mathematik in 1986; and Reducibility Relationships Between Decision Problems forSystem Functions in Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik in 1987. Untilmy research, there was no generalized framework to study different classes of decision problems. In otherwords, recursion theoretic properties were studied for individual problems such as the halting problem, thederivability problem and the confluence problem. With my framework, we were able to study theindividual problems with the generalized classes. This was a major breakthrough at that time. I develepedcounter-examples for properties that could not be proved. This was achieved by the concept of N-Cylinderwhich I defined. N-Cylinder was an extension of Paul Young’s semi-cylinder. By using the N-Cylinder, Iwas able to show that the general confluence problem was neither recursive nor a cylinder while JohnCleave (my advisor at the University of Bristol) was unable to prove this result back in the early 1970swith the use of Young’s semi-cylinder.Between 1980 and 1983, while at the New Mexico Tech and at the University of Minnesota, I continuedto work on this topic and produced five more journal papers: Representation of One-One Degrees byDecision Problems in the Journal of Computer and Systems Sciences in 1982; Some Elementary ClosureProperties of N-Cylinders in the Notre Dame Journal of Formal Logic in 1983; The Concept of N-Cylinder and its Relationship to Simple Sets in the Notre Dame Journal of Formal Logic in 1983;Representation of One-One Degrees by N-Cylindrical Decision Problems in Zeitschrift furMathematische Logik und Grundlagen der Mathematik in 1988; and System Function Languages inMathematical Logic Quarterly in 1993. Furthermore, there were some questions that John Cleave posed inhis work in the early 1970s which I solved in the early 1980s. Particularly interesting was the followingquestion: could every one-one degree be represented by a particular decision problem? Cleave had shownthat every m-degree could be represented by a decision problem in the early 1970s which was a weakerresult. Cleave believed that the answer to this question would be a major breakthrough as this would showthe existence of decision problems that are Simple. In fact this was the first problem I worked on after myPhD. It was published in the prestigious Journal of Computer and Systems Sciences. This work wouldlater (1989) help me prove that the inference problem was unsolvable, a significant development indatabase security.Between January 1984 and January 1986, I worked at Control Data Corporation as I wanted to get realworld industrial experience working in a product development environment in computer networks anddistributed systems so that I get a feel for how systems really work. During this time I started research insecure dependable distributed systems that would complement my work at Control Data Corporation. Icollaborated with Prof. W. Tsai and his student at the University of Minnesota and together we addressedthe challenging problem of fault tolerance in a binary tree task model. Prior work had focused on a treewith a single child. We felt that binary tree model would be more realistic as tasks usually spawn multipletasks. After several years of work, we published our research in IEEE Transactions on SoftwareEngineering..Due to my increasing interest in secure systems, I joined Honeywell in January 1986 as I felt having aresearch-oriented job would strengthen my research in secure systems. I started working in the challengingarea of secure data management. I was part of a team designing one of the two prominent high assurance7
Page 1: Curriculum VitaeBhavani Thuraisingh
Page 5: EXTERNALSection 2: MAJOR AWARDSBest
Page 9 and 10: the concepts in semantic nets and c
Page 11 and 12: secure query processing for cloud.
Page 13 and 14: Section 4: RESEARCH LEADERSHIPhttp:
Page 15 and 16: Section 5: RESUME SUMMARYName:Dr. B
Page 17 and 18: Army, NSA, and CIA as well as consu
Page 19 and 20: Section 6: INDUSTRY/GOVERNMENT EXPE
Page 21 and 22: management to discuss projects as w
Page 23 and 24: Current (2004 - Present)The Univers
Page 25 and 26: Object Databases (1 day course taug
Page 27 and 28: Section 8: ACADEMIC RESEARCH SUPERV
Page 29 and 30: Thesis Committees: Serving/served o
Page 31 and 32: Section 9: RESEARCH FUNDINGI have o
Page 33 and 34: PI: L. KhanAmount: $260,00020. Nati
Page 35 and 36: 3. CIA: As manager of fifteen resea
Page 37 and 38: 15. Multilevel Security Issues in D
Page 39 and 40: 48. E-Mail Worm Detection Using Dat
Page 41 and 42: 79. Information Demands Drive Data
Page 43 and 44: 2. Foundations of Multilevel Databa
Page 45 and 46: 32. Parallel Processing and Trusted
Page 47 and 48: 66. Privacy Preserving Data Mining,
Page 49 and 50: 99. Data Mining for Cyber Security
Page 51 and 52: 130. Object-oriented Implementation
Page 53 and 54: 161. XIMKON- An Expert Simulation a
Page 55 and 56: 194. Ontology Alignment Using Multi
Page 57 and 58:
225. RETRO: A Framework for Semanti
Page 59 and 60:
5. Inference Problem in Database Se
Page 61 and 62:
I. JOURNAL SPECIAL ISSUES EDITEDSec
Page 63 and 64:
12. Proceedings ISI Conference, IEE
Page 65 and 66:
Bhavani ThuraisinghamUTDCS-45-06UTD
Page 67 and 68:
UTDCS-32-08A Practical Approach to
Page 69 and 70:
UTDCS-27-11Towards the Design and I
Page 71 and 72:
29. A Seminar on Real-time Database
Page 73 and 74:
14. Concurrency Control in Real-tim
Page 75 and 76:
17. Data Management Systems Evoluti
Page 77 and 78:
54. Data Mining for National Securi
Page 79 and 80:
5. Recent Developments in Some Trus
Page 81 and 82:
44. Data Engineering Directions, IE
Page 83 and 84:
6. Towards a Global Multilevel Data
Page 85 and 86:
19. Object Technology for C4I Appli
Page 87 and 88:
59. Assured Cloud Computing, AFOSR
Page 89 and 90:
2. A Seminar on Secure Database Sys
Page 91 and 92:
VIII. The University of Texas at Da
Page 93 and 94:
5. Secure Distributed Query Process
Page 95 and 96:
Simulated algorithms for informatio
Page 97 and 98:
1. Geospatial Proximity Algorithm,
Page 99 and 100:
Section 16: INTELLECTUAL PROPERTY A
Page 101 and 102:
Section 17: DISCUSSION OF PUBLISHED
Page 103 and 104:
conceptual structures (e.g., semant
Page 105 and 106:
1990s, we designed and implemented
Page 107 and 108:
inference problem. Back in the earl
Page 109 and 110:
9. A Semantic Web Based Framework f
Page 111 and 112:
Policy management: While discretion
Page 113 and 114:
Section 18: DISCUSSION OF COMPLETE
Page 115 and 116:
Publications: Several journal publi
Page 117 and 118:
Research and Technology Transfer in
Page 119 and 120:
13. IEEE WORDS Workshop, Santa Barb
Page 121 and 122:
82. AAAI, Vancouver, BC, Canada, Ju
Page 123 and 124:
http://findarticles.com/p/articles/
Page 125 and 126:
NSF Grants to Help Create Next-Gene
Page 127:
SECTION 21. CYBER SECURITY RESEARCH
show all

Curriculum Vitae - The University of Texas at Dallas

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?