Pattern-MAC (PMAC) protocol, instead of having fixed sleepwakeups,
the sleep-wakeup schedules of the sensor nodes are
adaptively determined. The schedules are decided based on a
node’s own traffic and that of its neighbors.
Abstract-In this paper, simple autonomous chaotic circuits
coupled by resistors are investigated. By carrying out computer
calculations and circuit experiments, irregular self-switching phenomenon
of three spatial patterns characterized by the phase
states of quasi-synchronization of chaos can be observed from
only four simple chaotic circuits. This is the same phenomenon
as chaotic wandering of spatial patterns observed very often from
systems with a large number of degrees of freedom. Namely, one
of spatial-temporal chaos observed from systems of large size can
be also generated in the proposed system consisting of only four
chaotic circuits. A six subcircuits case and a coupled chaotic circuits
networks are also studied, and such systems are confirmed
to produce more complicated spatio-temporal phenomena.
Parallel robotic manipulators can be considered a well-established option
for many different applications of manipulation, machining, guiding,
testing, control, tracking, haptic force feed-back, etc. A typical parallel robotic
manipulator (PM) consists of a mobile platform connected to the
base (fixed platform) by at least two kinematic chains called limbs. The
mobile platform can achieve between one and three independent translations
(T) and one to three independent rotations (R).
This book is about writing TinyOS systems and applications in the nesC language. This chapter gives a
brief overview of TinyOS and its intended uses. TinyOS is an open-source project which a large number of
research universities and companies contribute to. The main TinyOS website, http://www.tinyos.net,
has instructions for downloading and installing the TinyOS programming environment. The website has a
great deal of useful information which this book doesn’t cover, such as common hardware platforms and
how to install code on a node.
Behavioral models are used in games and computer graphics for
realistic simulation of massive crowds. In this paper, we present a
GPU based implementation of Reynolds [1987] algorithm for simulating
flocks of birds and propose an extension to consider environment
self occlusion. We performed several experiments and
the results showed that the proposed approach runs up to three
times faster than the original algorithm when simulating high density
crowds, without compromising significantly the original crowd
behavior.
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
Aodv for NS-2. A mobile ad-hoc network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring
network of mobile routers connected wirelessly. MANET may operate in a standalone fashion, or may
be connected to the larger Internet. Many routing protocols have been developed for MANETs over
the past few years. This project evaluated three specific MANET routing protocols which are Ad-hoc
On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET Ondemand
routing protocol (DYMO) to better understand the major characteristics of these routing
protocols. Different performance aspects were investigated in this project including packet delivery
ratio, routing overhead, throughput and average end-to-end delay.
These codes require an ASCII input file called input.dat of the following form:
Lower Limit on x Upper Limit on x Final Time
Pressure for x<0 when t=0 Density for x<0 when t=0 Speed for x<0 when t=0
Pressure for x>0 when t=0 Density for x>0 when t=0 Speed for x>0 when t=0
These codes produce 8 ASCII output files:
density.out. Density vs. x
entropy.out. Entropy vs. x
mach.out. Mach number vs. x
massflux.out. Mass flux vs. x
pressure.out. Pressure vs. x
sound.out. Speed-of-sound vs. x
velocity.out. Velocity vs. x
waves.out. A description of the solution in terms of the three waves defined in the book (+,-,0).
matlab有限元網格劃分程序
DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below.
One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods.
For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes.
Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles.
To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
