CrazyEngineers Forum - Computer Science & IT Engineering |
- Computer Networking Basics : Video Tutorials By thenewboston
- Reading video and making frames of it using MATLAB
- submitt button in php
- Computer Networking Tutorials
- Threaded Binary Tree - Concept Explained
- Picture Clauses in COBOL - Concept Explained
- Data Division in COBOL - Concept Explained
| Computer Networking Basics : Video Tutorials By thenewboston Posted: 26 Dec 2010 09:50 PM PST Computer Networking Basics : Video Tutorials By thenewboston from YouTube |
| Reading video and making frames of it using MATLAB Posted: 26 Dec 2010 12:48 PM PST Hi, I am trying to develop a small project for Content Based Video Retrieval (CBVR), based on the YCbCr components of the frames of the video. I've tried reading the video and making it into frames, but in vain.:confused: I've tried aviread function. Then, tried Frame = mov(frame).cdata; to get the frame data, which is kept in loop, and some other commands, but couldn't succeed. I've even tried mpegread package, but couldn't even read the mpeg file. :( Plzzzzz help me out guys... Once I get the frames, I can move further.... Thanks in advnace..... |
| Posted: 26 Dec 2010 09:10 AM PST hello, i am making a website in php. because this is the only language i am familiar with. and i want to add some attractive buttons in my web sites. but using html only i cant make this happen. so please somebody tell me how to create some cool looking buttons so that i can add them in my php based website (is it possible to create a button in photoshope and add it on my website ? if yes then how ?). thank you..! |
| Posted: 26 Dec 2010 07:41 AM PST Hey guys, I found some computer networking tutorial and I read few topics which sound good to me.. So i am posting it here. Lecture Notes: Computer Networks (CS425) If anyone has more resources related to computer networking. Please post in the same thread. May be it will be helpful to all. |
| Threaded Binary Tree - Concept Explained Posted: 26 Dec 2010 04:42 AM PST In the linked representation of a binary tree, additional space is required to store the two links of each node. For leaf nodes, these fields always have nil values as there are no left or right sub-trees present. To remove this drawback of memory wastage, the concept of threaded binary tree was developed. In this type of tree, the empty links are replaced by pointers, called threads which point to some other node of the tree. If the left child of a node of a tree is null (or empty) it will be replaced by a thread (i.e. a pointer) to that node which appears just before that node, when the tree is traversed in inorder. Similarly, if a right child of the node is null (or empty) it will be replaced by a thread (i.e. a pointer) to that node which appears just after that node, when the tree is traversed in inorder. Such threads are called inorder threads. We also have preorder and postorder threads. The left thread gives predecessor and the right thread gives successor node. The node of a threaded binary tree can be declared as: enum boolean { int false = 0; int true = 1; }; struct threadedtree { enum boolean left; struct threadedtree *leftchild; int data; enum boolean right; struct threadedtree *rightchild; } |
| Picture Clauses in COBOL - Concept Explained Posted: 26 Dec 2010 04:28 AM PST Picture Clauses Every type of data must have a picture. This determines the type of data that it is. There is a distinction between the pictures that are used for input (or working storage) fields and those that are used for output fields. The ones used for output fields can be used to edit the output and do things like suppress leading zeroes or replace them by asterisks (for checks). Input or Working Storage Pictures X : Alpanumeric. Any character. A : Letter or Blank. 9 : Digit V : Assumed decimal point S : Sign Output Pictures X, A, and 9 can be used here also. B -> Blank Z -> Zero suppression 0 -> Zero insertion / -> Slash insertion eg. for a date. , -> Comma insertion (big numbers) . -> decimal point + -> forces a sign to appear - ->sign if negative CR -> Credit symbol DB -> Debit symbol * -> Asterisk instead of leading zeroes. $ ->Dollar sign |
| Data Division in COBOL - Concept Explained Posted: 26 Dec 2010 04:23 AM PST The DATA DIVISION is that part of the COBOL program where every data item processed by the program is described. It is important to note that, unless an item is described in the DATA DIVISION it cannot be used in the PROCEDURE DIVISION. DATA DIVISION consists of various sections: 1) FILE SECTION: This includes the descriptions of all the data items that should be read from or written onto some external file. 2) WORKING-STORAGE SECTION: The data items which are developed internally as intermediate results as well as the constants are described in this section. The format is as follows: DATA DIVISION. FILE SECTION. ................................... ....[file section entries]... ................................... WORKING-STORAGE SECTION. .......................................... ....[working storage entries]... .......................................... All the section names as well as the division name must be coded as margin A entries. Both these sections are optional i.e. a particular section may be omitted if there is no data that may be described. |
| You are subscribed to email updates from CrazyEngineers Forum - Computer Science & IT Engineering To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google Inc., 20 West Kinzie, Chicago IL USA 60610 | |
No comments:
Post a Comment