ד"ר אורלי יהלום

ד"ר אורלי יהלום

Dr. Orly Yahalom

ד"ר אורלי יהלום
Department
Software Engineering
Research Interests

Data Mining, Language Modeling, Music Transcription, Combinatorial Algorithms, Computer Science Education.

Courses

Probability for Software Engineering, Randomized Algorithms

Current Position
Senior Lecturer
Contact Information
Email
oyahalom.braude@gmail.com
Telephone
972-4-990-1900
Office
M 113
Office Hours
Spring semester 2017: Monday 12:30-14:00, or by appointment via email
Education
Ph.D.
2008, Computer Science, The Technion – Israel Institute of Technology, Haifa, Israel.
M.Sc.
2002, Computer Science, Ben Gurion University of the Negev, Be’er Sheva, Israel
B.Sc.
1999, Mathematics (cum laude), Ben Gurion University of the Negev, Be’er Sheva, Israel
B.Sc.
1999, Industrial Engineering and Management, Ben Gurion University of the Negev, Be’er Sheva, Israel
Research Areas
• Data mining • Language modeling for word prediction • Combinatorial optimization • Randomized algorithms • Computer science education • Computerized systems for cognitive training
Academic Appointments
2014-present    Head, Information System Engineering program, ORT Braude College      
2013-present Senior Lecturer, ORT Braude College, Department of Software Engineering
2008-2013 Lecturer, ORT Braude College, Department of Software Engineering
 
2003-2008 Teaching Assistant, The Technion – Israel Institute of Technology, Computer Science Department
 
2000-2002 Adjunct Lecturer, The Open University of Israel, Computer Science Department
 
2001 Teaching Assistant, Yizrael Valley College, Department of Computer Science and Information Systems
 
1997-2000 Teaching Assistant, Ben Gurion University of the Negev, Department of Computer Science and Department of Industrial Engineering and Management
 
 
 
 
 
Teaching Experience
ORT Braude College of Engineering:
  • Graduate Courses:
    Advanced Models in Complexity Theory (new course)
  • Undergraduate Courses:
    Randomized Algorithms (new course)
    Automata and Formal Languages
    Digital Systems
The Technion – Israel Institute of Technology

Logic and Set Theory for Computer Science
Data Structures 1

The Open University of Israel:
Automata and Formal Languages
Introduction to Computer Networks
Yizrael Valley College:
Introduction to Databases
Ben Gurion University of the Negev:
Design of Algorithms
Introduction to Data Structures and Algorithms
Computer Applications
Professional Activities
ORT Braude College:
2014 – present: Final Project Corrdinator, Software Engineering B.Sc. Program
2014 – present: Responsible for freshmen in unsatisfactory academic status, Depaprtment of Software Engineering
2012 – present: Coordinator for students in reserve duty, Department of Software Engineering
2011 – present: Member, College Committee for the Promotion of Teaching
2011 – 2014: Academic Advisor for 1st year students, Depaprtment of Software Engineering
2010 – present: Member, Curriculum Committee, Depaprtment of Software Engineering
2008 – 2011: Academic Advisor for 3rd year students, Depaprtment of Software Engineering
Conferences:
• Member of the organizing committee: The 8th ORT Braude College Interdisciplinary Research Conference, October 17-18, 2012.
• Member of the organizing committee: The 2nd Industry-Academia Conference (Industry-Oriented Innovation in Academia), ORT Braude College, January 25, 2011.
Reviews:
• RANDOM-APPROX 2011
• Theory of Computing Systems
Publications
Refereed Papers

1.             Renata Avros, Avi Soffer, Zeev Volkovich, and Orly Yahalom, "An approach to model selection in spectral clustering with application to the writing style determination problem", Knowledge Discovery, Knowledge Engineering and Knowledge Management, Communications in Computer and Information Science, Springer-Verlag Berlin Heidelberg, Volume 415, pp 19-36, 2013.
2.             Dvora Toledano-Kitai, Renata Avros, Zeev Volkovich, Gerhard-Wilhelm Weber and Orly Yahalom, "A Binomial Noised Model for Cluster Validation", Journal of Intelligent and Fuzzy Systems 24:417–427, 2013.

3.             Orly Yahalom, "Testing for Forbidden Posets in Ordered Rooted Forests", Int. J. Found. Comput. Sci. 23(6):1405-1417, 2012.

4.             Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman and Orly Yahalom, "On the query complexity of testing orientations for being Eulerian", ACM Trans. Algorithms 8(2):15.1-15.41, 2012.

5.             Zeev Volkovich, Gerhard-Wilhelm Weber, Renata Avros and Orly Yahalom, "On an Adjacency Cluster Merit Approach", Int. J. Operational Research 13(3):239-255, 2012.

6.             Eldar Fischer and Orly Yahalom, "Testing convexity properties of tree colorings", Algorithmica 60(4):766-805, 2011.

7.             Uriel Feige and Orly Yahalom, "On the complexity of finding balanced oneway cuts", Information Processing Letters 87 (1): 1–5, 2003.

8.             Gad Rabinowitz and Orly Yahalom, "Imperfect inspection of a multi-attribute deteriorating production system—a continuous time model", Quality and Reliability Engineering International 17:407–418, 2001.


Conference Proceedings and Abstracts
  1. Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, and Orly Yahalom, On the Query Complexity of Testing Orientations for Being Eulerian, In Proc. of APPROX-RANDOM 2008, LNCS 5171, pp. 402-415, Springer-Verlag, 2008.
  2. Eldar Fischer and Orly Yahalom, Testing Convexity Properties of Tree Colorings, In Proc. International Symposium on Theoretical Aspects of Computer Science, STACS 2007, LNCS 4393, pp. 109-120, Springer-Verlag, 2007.
Other Publications
Professional Reports:
  1. Orly Yahalom. Topics in Property Testing over Massively Parameterized Models. Ph.D. Dissertation. Advisor: Assoc. Prof. Eldar Fischer, The Technion – Israel Institute of Technology, Haifa, Israel, August, 2008.
  2. Orly Yahalom. Anticoloring Problems on Graphs. M.Sc. Thesis. Advisors: Prof. Daniel Berend and Dr. Ephraim Korach, Ben Gurion University of the Negev, Be’er Sheva, Israel, April 2002.