|
|
|
|
|
 |
|
|
|
|
Click Here to Download my CV |
| Click Here for the Recent Ice Shower at nec Pictures |
|
|
|
|
|
Position |
|
Junior Professor, Department of Computer Engineering |
|
|
|
|
|
e-mail |
|
shaileshpandeynec@yahoo.com / shaileshbp@nec.edu.np |
|
|
|
|
|
Contact |
|
+977-1-6611744 Ext: 229 |
|
|
|
|
|
Publications |
|
- S. Pandey, R. Shrestha, “Solving Maze Puzzles using Ant Algorithm”
(Submitted), March 2007.
- S. Pandey, K. Sapkota, L. Thapa, “Efficient Information Retrieval using Measures of Semantic Similarity”, in Proc. Conference on Software, Knowledge, Information Management and Applications, Chiang Mai, Thailand, December 2006, pp. 94-98. [DOWNLOAD PDF]
- S. Pandey, Y. Raj, “Development of the Politeness Planner for a Psychiatric Disorder Classification System”, in Proc. Conference on Software, Knowledge, Information Management and Applications, Chiang Mai, Thailand, December 2006, pp. 165-168. [DOWNLOAD PDF] [DOWNLOAD PPT]
- S. Pandey, K. Sapkota, P. Shrestha, "Stochastic and Rule Based POS Tagger for Nepali" , Presented at the 12th Himalayan Language Symposium, Kathmandu, Nepal, November 2006. [DOWNLOAD PPT]
- S. Pandey, Y. Raj and S. Basnet, “Machine Translation of Programming(Artificial) Language into Natural Language”, in Proc. Contemporary Issues in Nepalese Linguistics, Kathmandu, 2004, pp. 463-470. [DOWNLOAD PDF]
|
|
|
|
|
|
See the List of Possible Projects in My Google Group |
|
View Posts |
|
Join my Google Group |
|
|
|
|
|
Courses in 2006 -Fall |
Courses in 2006 -Spring |
|
- Elective I: Compiler Design
- Programming in C
|
- Elective II: Aritificial Intelligence
- Network Programming
|
|
|
|
|
|
Supervision - Undergraduate Projects - 2007 |
|
Please note that the projects are in the formulation stage and we have just identified the field of research. Details regarding the projects will be posted shortly. |
|
- Question/Answering System
- Anaphora Resolution for Nepali
- Path Planning and Obstacle Avoidance using Reinforcement Learning
- Visualization of JAVA source code (Generating UML diagram, Collaboration Diagram etc.)
|
|
|
|
|
|
Supervision - Undergraduate Projects - 2006 |
|
- Query Optimization Based On Measures of Semantic Similarity (Complete)
- Mero Sano Sathi (Complete)
- Visualization of Java Source Code (Complete)
- Virtual Reality Modelling of Patan Museum (Complete)
- Game Playing Using Heuristic Search -Baghchal (Complete)
- Nepali Speech to Text (Complete)
- Hand Pattern Recognition (Complete)
- Virtual Fussball(Complete)
- Controlling Antennae Movement by Voice (Complete)
- Agent Based Computing (Complete)
|
|
|
|
|
|
Research Areas of Interest |
|
- Computational Linguistics
- Artificial Intelligence
- Compiler Design
|
|
|
|
|
|
Lecture Notes - Network Programming |
|
- Internet Protocols
- OSI Model
- Introduction to IPX
- Introduction to SNA
- Introduction to UUCP
- Network API, BSD History, Three Way Handshaking,
Port Numbers, Socket Structures
- Socket Functions
- Database Functions
- Non-Blocking, Synchronous I/O Multiplexing
|
- Processes and Signals
- WinSock Overview, Message Driven Architecture, Winsock Functions
- Deviation from Berkeley
- WinSock Socket Function Calls
- Creating a Socket connection in Winsock
- Non-Blocking, Select, Asynchronous Model
- Novell Netware 286,386
- IPX/SPX Packets, Function Calls
|
|
|
|
|
|
Lecture Notes - Compiler Design |
|
|
- Introduction to Compilers and Compiler Design Stages
- Lexical Analysis
- Syntax Analyzers, Grammars
- Top Down Parsing
- Bottom Up Parsing
|
|
|
|
|
|
|
Lecture Notes - C Programming |
|
|
- History and Generation of Computing
- Flowcharting Basics
- Operation of a Computer
- History of C
For Detail History Visit: http://cm.bell-labs.com/cm/cs/who/dmr/chist.html
- Get Ready to Program in C
- Character Sets and Data Types in C
- Statements and Expressions
- Operators in C
- Structures and Unions
- Functions
|
- Pointers (Notes by Ted Jensen) - Good Place to Start
- Data File and File Handling
|
|
|
|
|
|
Nepal Engineering College Box: 10210, Changunarayan VDC, Bhaktapur, Nepal. +(977)16611744 +(977)16611681 |