針對目前使用的RS232接口數(shù)字化B超鍵盤存在PC主機啟動時不能設(shè)置BIOS，提出一種PS2鍵盤的設(shè)計方法。基于W78E052D單片機，采用8通道串行A/D轉(zhuǎn)換器設(shè)計了8個TGC電位器信息采集電路，電位器位置信息以鍵盤掃描碼序列形式發(fā)送，正交編碼器信號通過XC9536XL轉(zhuǎn)換為單片機可接收的中斷信號，軟件接收到中斷信息后等效處理成按鍵。結(jié)果表明，在滿足開機可設(shè)置BIOS同時，又可實現(xiàn)超聲特有功能，不需要專門設(shè)計驅(qū)動程序，接口簡單，成本低。
Abstract: Aiming at the problem of the digital ultrasonic diagnostic imaging system keyboard with RS232 interface currently used couldn?蒺t set the BIOS when the PC boot， this paper proposed a design method of PS2 keyboards. Based on W78E052D microcontroller，designed eight TGC potentiometers information acquisition circuit with 8-channel serial A/D converter， potentiometer position information sent out with keyboard scan code sequentially.The control circuit based on XC9536 CPLD is used for converting the mechanical actions of the encoders into the signals that can be identified by the MCU， software received interrupt information and equivalently treatmented as key. The results show that the BIOS can be set to meet the boot， ultrasound specific functionality can be achieved at the same time， it does not require specially designed driver，the interface is simple and low cost.
See Appendix B for a description of the programs included
on this companion disk. RESOURCE.WRI identifies other books
and resources for Internet programming. WEBHELP.HLP contains
an introduction to the World Wide Web. TCPMAN.HLP provides
detailed instructions to help you use the Trumpet Winsock
included on this disk. Use the Program Manager s File menu
Run option to execute the SETUP.EXE program found on this
disk. SETUP.EXE will install the programs on your hard drive
and create an Internet Programming group window.
Internet編程技術(shù) [配套程序]
[涉及平臺] VC
[作者] void
[文件大小] 1032K
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
by Randal L. Schwartz and Tom Phoenix
ISBN 0-596-00132-0
Third Edition, published July 2001.
(See the catalog page for this book.)
the text of Learning Perl, 3rd Edition.
Table of Contents
Copyright Page
Preface
Chapter 1: Introduction
Chapter 2: Scalar Data
Chapter 3: Lists and Arrays
Chapter 4: Subroutines
Chapter 5: Hashes
Chapter 6: I/O Basics
Chapter 7: Concepts of Regular Expressions
Chapter 8: More About Regular Expressions
Chapter 9: Using Regular Expressions
Chapter 10: More Control Structures
Chapter 11: Filehandles and File Tests
Chapter 12: Directory Operations
Chapter 13: Manipulating Files and Directories
Chapter 14: Process Management
Chapter 15: Strings and Sorting
Chapter 16: Simple Databases
Chapter 17: Some Advanced Perl Techniques
Appendix A: Exercise Answers
Appendix B: Beyond the Llama
Index
Colophon
by Randal L. Schwartz and Tom Phoenix
ISBN 0-596-00132-0
Third Edition, published July 2001.
(See the catalog page for this book.)
Learning Perl, 3rd Edition.
Table of Contents
Copyright Page
Preface
Chapter 1: Introduction
Chapter 2: Scalar Data
Chapter 3: Lists and Arrays
Chapter 4: Subroutines
Chapter 5: Hashes
Chapter 6: I/O Basics
Chapter 7: Concepts of Regular Expressions
Chapter 8: More About Regular Expressions
Chapter 9: Using Regular Expressions
Chapter 10: More Control Structures
Chapter 11: Filehandles and File Tests
Chapter 12: Directory Operations
Chapter 13: Manipulating Files and Directories
Chapter 14: Process Management
Chapter 15: Strings and Sorting
Chapter 16: Simple Databases
Chapter 17: Some Advanced Perl Techniques
Appendix A: Exercise Answers
Appendix B: Beyond the Llama
Index
Colophon
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
