This program demonstrates using watchdog timers to invoke deadline
handlers. CoordinatorTask sends data to the organizer.
OrganizerTask receives data from the coordinatorTask, and resets
the coordinatorTask when no data is sent by the coordinatorTask in
the past five seconds (deadline time). This demonstration program
is automatically stopped after twenty seconds.
One-channel queuing system simulator (M/M/1)
* Arrival and service times are random and distributed exponetially.
*
* The simulator is time-slice-driven, i.e. the system model is being
* run at discrete time points, with constant increments deltaT.
* At each such time moment, program checks if a new item arrival or
* release has occurred during previus deltaT.
palm編成,這種書很少,有興趣看看
Title: Palm Programming: The Developer s Guide
URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0
ISBN: 1-56592-525-4
Author: Julie McKeehan/ Neil Rhodes
Publisher: O Reilly
Page: 478
Edition: 1st edition (December 1998)
Catalog: PDA programming / Palm
Format: pdf
Size: 2.06M
Supplier:
Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
Many programs today suffer from the fact that their users have to connect using IP addresses. This is impossible for dialup users, whose IPs change all the time, and painful for LAN users who don t know their IP addresses or whose addresses also change. In addition, many collaborative programs could benefit from offering friends lists, showing friends as online or offline, providing status information. This kind of functionality is hard to provide, requiring a dedicated Internet database and a new client - client protocol. But it is offered today through a system called AwareNet, which is offered free of charge and royalty
penMesh is a generic and efficient data structure for representing and manipulating polygonal meshes. OpenMesh is developed at the Computer Graphics Group, RWTH Aachen , as part of the OpenSGPlus project, is funded by the German Ministry for Research and Education ( BMBF), and will serve as geometry kernel upon which the so-called high level primitives (e.g. subdivision surfaces or progressive meshes) of OpenSGPlus are built.
It was designed with the following goals in mind :
Flexibility : provide a basis for many different algorithms without the need for adaptation.
Efficiency : maximize time efficiency while keeping memory usage as low as possible.
Ease of use : wrap complex internal structure in an easy-to-use interface.
Support servers like Tomcat, Resin, WebSphere, WebLogic etc.
Multi-languages(English/Chinese...)
Support RSS 2.0
RSS syndication
Unlimited XML news source
Customizable fetch time interval
Customizable max entry count
Customizable max content size
Abstract:Noise frequency modulation(FM)jamming。which belongs to blanket jamming。is already become
the main form ofnoise jamming at present。because the wideband was gained by it.Tne spectnlnl ofnoise FM
jamming is analyzed by time domain autocorrelation method in this paper.It’S jamm g peculiarity and幾out—
putting signal’S jamming peculiarity ale explained.At last,these time series models ofnoise FM jalllIIling sig—
nal and幾outputting signal ale built.
acm HDOJ 1051WoodenSticks
Description:
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
Learning Kernel Classifiers: Theory and Algorithms, Introduction This chapter introduces the general problem of machine learning and how it relates to statistical inference. 1.1 The Learning Problem and (Statistical) Inference It was only a few years after the introduction of the first computer that one of man’s greatest dreams seemed to be realizable—artificial intelligence. Bearing in mind that in the early days the most powerful computers had much less computational power than a cell phone today, it comes as no surprise that much theoretical research on the potential of machines’ capabilities to learn took place at this time. This becomes a computational problem as soon as the dataset gets larger than a few hundred examples.