搜索结果

z-trenning z-tickets. mipt lucky tickets. Count of numbers with 2*n digits in base k such that sum of first n digits is same as second n digits.

stepldr .S3C244X equipped with an internal SRAM buffer called 鈥楽teppingstone鈥? When booting, the first 4 KBytes of the NAND flash memory will be loaded into Steppingstone and the boot code loaded into Steppingstone will be executed.

Genetic Algorithm example using Java You have 10 cards numbered 1 to 10. You have to divide them into 2 piles so that: The sum of the first pile is as close as possible to 36 and the product of all in second pile is as close as poss to 360.

simple ATM [Automatic Teller Machine] system the basic functions Login including write-offs, inquiries, deposits, withdrawals and alter the code. Simulation of ATM terminal users logged in, their account numbers and passwords through the ATM network to transmit to the server, ATM database server bas ...

FIR Filter Design This chapter treats the design of linear-phase FIR filters. The assignments are divided in two parts, the first part focuses on the design of FIR filters using the window design method while the second part focuses on design

Windows applications using C++ and the Microsoft Foundation Class (MFC) library. The text builds from the ground up, first describing the Windows architecture and showing how MFC works with that architecture next covering the document/view framework that simplifies the creation of industrial-streng ...

Real-Time Design Patterns: Robust Scalable Architecture for Real-Time Systems. In this book, Bruce Douglass illustrates for the first time how two important contemporary software engineering advances鈥攑atterns and the UML鈥攃an be applied advantageously to the concepts and techniques traditionall ...

使用FPGA/CPLD设置语音AD、DA转换芯片AIC23，FPGA/CPLD系统时钟为24.576MHz 1、AIC系统时钟为12.288MHz，SPI时钟为6.144MHz 2、AIC处于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、帧同步在96KHz

c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths ...

Learn to build applications with Jakarta Struts, the most popular JSP development framework. Struts Kick Start is a "hands-on" book filled with sample applications and code snippets you can reuse, and in-depth coverage of new features in Struts 1.1. If you are looking for a practical book that "show ...