This document specifies a subset of the C programming language which is intended to be suitable for embedded automotive systems up to and including safety integrity level 3 (as defined in the MISRA Guidelines). It contains a list of rules concerning the use of the C programming language together with justifications and examples.
標簽： programming specifies document language
上傳時間： 2013-12-11
上傳用戶：cursor
Program for : 1) ZOOMING , 2) SHRINKING & 3) GRAY LEVEL RESOLUTION
標簽： SHRINKING Program ZOOMING for
上傳時間： 2013-12-18
上傳用戶：zhangyi99104144
Face Transfer is a method for mapping videorecorded perfor-mances of one individual to facial animations of another. It extracts visemes (speech-related mouth articulations), expressions, and three-dimensional (3D) pose from monocular video or 鏗乴m footage.
標簽： videorecorded perfor-mances individual Transfer
上傳時間： 2014-01-11
上傳用戶：2467478207
Video-DVM is a very cheap DVM that shows how an output as complex as a videocomposite signal can be generated entirely in software: two I/O pins and three resistors are all the hardware required. Connected to any TV set it displays voltages, included max and min peaks, using both giant digits and an analog bar-display . A serial data output for computer data logging is provided, too.
標簽： videocomposite Video-DVM complex output
上傳時間： 2014-12-09
上傳用戶：xuan‘nian
If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advancement of what has come to be called subjective idealism. He wrote a number of works, of which the most widely-read are Treatise Concerning the Principles of Human Knowledge (1710) and Three Dialogues between Hylas and Philonous (1713) (Philonous, the "lover of the mind," representing Berkeley himself).
標簽： there classic forest nobody
上傳時間： 2013-11-26
上傳用戶：stvnash
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
標簽： followingconditions tree completely satisfying
上傳時間： 2017-05-25
上傳用戶：2467478207
this version is only interesting for people that want to generate their own levels (need JDK to compile new level).
標簽： interesting generate version levels
上傳時間： 2017-06-02
上傳用戶：tb_6877751
8051 assembly language source code for serial 2 chanel analog digitan converter. useful for intermediate level 8051 assembly language programmer.
標簽： for converter assembly language
上傳時間： 2017-06-10
上傳用戶：zhaoq123
As I write this foreword, I am collaborating with four leading user interface (UI) component vendors on a presentation for the 2004 JavaOneSM conference. In our presentation, the vendors will show how they leverage JavaServerTM Faces technology in their products. While developing the presentation, I am learning some things about the work we’ve been doing on JavaServer Faces for the past three years. The vendors have their own set of concerns unique to adapting their product for JavaServer Faces, but they all voice one opinion loud and clear: they are very relieved to finally have a standard for web-based user interfaces.
標簽： collaborating component interface foreword
上傳時間： 2014-08-27
上傳用戶：時代電子小智
This book covers the fundamental concepts of data mining, to demonstrate the potential of gathering large sets of data, and analyzing these data sets to gain useful business understanding. The book is organized in three parts. Part I introduces concepts. Part II describes and demonstrates basic data mining algorithms. It also contains chapters on a number of different techniques often used in data mining. Part III focusses on business applications of data mining. Methods are presented with simple examples, applications are reviewed, and relativ advantages are evaluated.
標簽： fundamental demonstrate the gathering
上傳時間： 2014-12-02
上傳用戶：15736969615
