This sections documents the API to the PHISH library that PHISH minnows call. In PHISH lingo, a "minnow" is a stand-alone application which makes calls to the PHISH library.
The API for the MPI and ZMQ (socket) versions of the PHISH library are identical.
A general discussion of how and when minnows call PHISH library functions is given in the Minnows section of the manual.
The PHISH library has a C-style API, so it is easy to write minnows in any language, e.g. C, C++, Fortran, Python. A true C++-style API is also provided, which means a C++ program can use either the C or C++ API. A Python wrapper on the C-style API is also provided, which has a slightly different syntax for some functions. The doc pages for individual library functions document all 3 APIs. See the section below entitled C vs C++ vs Python interface for a quick overview.
PHISH minnows communicate with other minnows by sending and receiving datums. Before looking at individual library calls, it may be helpful to understand how data is stored internally in a datum by the PHISH library. This topic is discussed below, in the section entitled Format of a datum.
The PHISH library is not large; there are only a handful of calls, that can be grouped into the following categories. Follow the links to see a doc page for each library call.
There are two different versions of the PHISH library that can be built. One that calls message-passing functions from the MPI library, and one that calls socket functions from the ZMQ library. In either case, the library should typically be built as a shared library so it can loaded at run-time by each minnow. This is required if the minnow is written in Python.
The easiest way to build all of PHISH, including the PHISH libraries, is to use the cross-platform CMake build system. We recommend building PHISH with a separate build directory:
$ tar xzvf phish.tar.gz -C ~/src $ mkdir ~/build/phish $ cd ~/build/phish $ ccmake ~/src/phish-14sep12
Then, in the CMake curses interface, configure the build, generate makefiles, and build phish:
$ make
Alternatively, you can build either version from the src directory of the distribution by typing one of these lines:
make -f Makefile.machine mpi make -f Makefile.machine zmq
where "machine" is the name of one of the Makefiles in the directory. These should produce the file libphish-mpi.so or libphish-zmq.so.
If none of the provided Makefiles are a match to your machine, then you can use of them as a template for creating your own, e.g. Makefile.foo. Note that only the top section for compiler/linker settings need be edited. This is where you should specify your compiler and any switches it uses. The MPI_INC setting is only needed if you are building the MPI version of the library, and the compiler needs to know where to find the mpi.h file. Likewise the ZMQ_INC setting is only needed if you are building the ZMQ version of the library, and the compiler needs to know where to find the zmq.h file. The MPI_LIB and ZMQ_LIB settings are for the MPI and ZMQ library themselves and any other auxiliary libraries they require.
If the build is successful, a libphish-mpi.a or libphish-zmq.a file is produced.
You can also type
make -f Makefile.machine clean
to remove *.o and lib*.so files from the directory.
As noted above, the APIs to the PHISH library for C versus C++ versus Python are very simliar. A C++ program can use either the C or C++ API.
To use the C interface, a C or C++ program includes the file src/phish.h and makes calls to functions as follows:
#include "phish.h" phish_error("My error");
The C++ interface in src/phish.hpp encloses the PHISH API in the namespace "phish", so functions can be invoked as
#include "phish.hpp" phish::error("My error");
or as
#include "phish.hpp" using namespace phish error("My error");
To use the Python interface, see this section of the manual for details. A Python program can invoke a library function as
import phish phish.error("My error")
or
from phish import * error("My error")
The chief function of the PHISH library is to facilitate the exchange of data between minnows. This is done through datums, which contain one or more fields. Each field is a fundamental data type such as a "32-bit integer" or a "vector of doubles" or a NULL-terminated character string.
The PHISH library defines a specific explicit type for each fundamental data type it recognizes, such as "int32" for 32-bit signed integers, or "uint64" for 64-bit unsigned integers, or "double" for a double-precision value. This is so that the format of the datum, at the byte level, is identical on different machines, and datums can thus be exchanged between minnows running on machines with different word lengths or between minnows written in different languages (e.g. C vs Fortran vs Python).
IMPORTANT NOTE: Different endian ordering of fundamental numeric data types on different machines breaks this model. We may address this at some future point within the PHISH library.
This is the byte-level format of datums that are sent and received by minnows via the PHISH library:
Integer flags are interleaved with the fundamental data types and the flags themselves are all 32-bit signed integers. This allows minnows that call the phish_pack and phish_unpack functions to use the usual C "int" data type as function arguments, instead of the int32_t types defined in the function prototypes. The compiler will only give an error if the native "int" on a machine is not a 32-bit integer. See the doc pages for phish_pack and phish_unpack for details.
The "type" values are one of these settings, as defined in src/phish.h:
PHISH_CHAR, PHISH_INT*, PHISH_UINT*, PHISH_FLOAT, and PHISH_DOUBLE are a single character, a signed integer (of length 8,16,32,64 bits), an unsigned integer (of length 8,16,32,64 bits), a float (typically 4 bytes), and a double (typically 8 bytes).
PHISH_RAW is a string of raw bytes which minnows can format in any manner, e.g. a C data structure containing a collection of various C primitive data types. PHISH_STRING is a standard C-style NULL-terminated C-string. The NULL is included in the field.
The ARRAY types are contiguous sequences of int*, uint*, float, or double values, packed one after the other.
PHISH_PICKLE is an option available when using the Python wrapper on the PHISH library to encode arbitrary Python objects in pickled form as a string of bytes.
The "size" values are only included for PHISH_RAW (# of bytes), PHISH_STRING (# of bytes including NULL), the ARRAY types (# of values), and PHISH_PICKLE (# of bytes).
The field data is packed into the datum in a contiguous manner. This means that no attention is paid to alignment of integer or floating point values.
The maximum allowed size of an entire datum (in bytes) is set to a default value of 1024 bytes or 1 Kbyte. This can be overridden via the set memory command in a PHISH input script or "--set memory" command-line option.
When a datum is sent to another minnow via the MPI version of the PHISH library, MPI flags the message with an MPI "tag". This tag encodes the receiving minnow's input port and also a "done" flag. Specifically, if the datum is not a done message, the tag is the receiver's input port (0 to Nport-1). For a done message a value of MAXPORT is added to the tag. See the discussion of MAXPORT in this section of the manual.
Similarly, the ZMQ version of the PHISH library prepends a "done" flag and port number to each datum.
See the phish_input doc page for a discussion of ports. See the shutdown section of the Minnows doc page for a discussion of "done" messages.


BETA... V0.1. Nope it doesn't have any relation with biology
A response grid with rows and columns, based on Simple Grid. Check this exact page you are viewing on your pc!
Always focused on mobile.
Although we offer custom styles too, dna css is still very fast and light weight!
DNA css is based on Aroma css, its ancestor. It also uses many of the custom styles offered by Aroma css.
<link rel="stylesheet" href="https://doublepicebs.github.io/dnacss/dna.css">


This is a tribute website, dedicated to Hans Zimmer works.
Profile:
Composer and record producer from Germany. Head of composers studio Remote Control Productions.
Born on September 12, 1957 in Frankfurt am Main.
If you want to find out more, go to the official Hanz Zimmer's page for more info.


Star Gazer
问题描述 :
Sven Cal Payang is a Natural who was a member of the Phantom Pain Special Forces and piloted the GAT-X105E Strike Noir.
As is known, Sven was astronomy amateur when he was still a child. After the war between ZAFT and Earth Alliance, he decided to continue his childhood dream.
Sven’s new house is located at a peaceful town. What’s more, there is a lake in his garden. One day, he came up with a new idea on finding stars using interference phenomenon. He put a radio wave receiver h meter above the surface of a lake. When a radio star rising, it detects maxima successively due to interference of radio waves from the star, and its reflection waves from the water. The wavelength of the waves is λ centimeters. Sven wants to find stars as quickly as possible. Can you help him?
As is known, Sven was astronomy amateur when he was still a child. After the war between ZAFT and Earth Alliance, he decided to continue his childhood dream.
Sven’s new house is located at a peaceful town. What’s more, there is a lake in his garden. One day, he came up with a new idea on finding stars using interference phenomenon. He put a radio wave receiver h meter above the surface of a lake. When a radio star rising, it detects maxima successively due to interference of radio waves from the star, and its reflection waves from the water. The wavelength of the waves is λ centimeters. Sven wants to find stars as quickly as possible. Can you help him?
输入:
Several cases are given until the end of input. Each line contains h and λ separated by a space.
输出:
Several cases are given until the end of input. Each line contains h and λ separated by a space.
样例输入:
0.5 20.0 20.0 0.5
样例输出:
5.74 0.00
Hint
Notice: When light reflected from a medium having an index of refraction greater than that of the medium in which it is traveling, a 180°phase change (or λ/2 shift ) occurs.
/* 说起这题真的会气死人的，物理到现在全忘了，什么叫干涉完全不知道，等于说这题根本没办法解 看了解题报告才知道，悲剧！！看来做ACM什么都要学好啊，上回也有一个物理的要积分的题目 */ #include <iostream> #include <cstdio> #include <cmath> #define IP 3.1415926 using namespace std; int main() { double r, h; while( scanf("%lf %lf", &h, &r) != EOF) { double ans = asin(0.01 * r / (4 * h)); printf("%0.2lf/n", 180 * ans / IP); } }
参考：http://blog.csdn.net/huixisheng/article/details/5786209
(adsbygoogle = window.adsbygoogle || []).push({});
制裁华为的后果？我只能说，好样的，就是这样。哈哈哈，虽然国产的手机比不上苹果，但是又怎么样？为毛苹果在中国卖的最贵？果狗们这是你们的功劳，你们继续捧你们的美国爹。
能不能说一下tmp数组和solve都是干嘛的？
#pragma pack(2) 这个用法太坑爹
3，求得所有的为的总和sum—->所有数的总和
printf( "Not Possible" );—->printf("impossible");
对吗？
这是什么鬼，怎么多头文件
顺利测试通过了，多谢
map[nodes .index][nodes .index] == 0 就是判断不相邻的。这个是可以证明的。
这种二分还是比较经典！mark
思路二可以用一个长度为k的队列来实现，入队后判断下队尾元素的next指针是否为空，若为空，则出队指针即为所求。
哎，path[0]应该是从零开始吧，为什么是赋值1呢？
great!
88行是多余的，可以删除
较好的写法是 start+(end-start)/2
程序是错的吧，明显没有判断不和该节点相邻的其他节点是否相互相邻
原来欧几里德定理应用这么多


| Titre | Auteur | Lien | Tags | Importance | Datasets | Code |
|---|---|---|---|---|---|---|
| A Riemannian Network for SPD Matrix Learning | Zhiwu Huang, Luc Van Gool | https://arxiv.org/abs/1608.04233 | SPDnet Neural Network Riemannian Geometry |
↑ | Emotion recognition Action recognition Face verification |
https://github.com/zhiwu-huang/SPDNet |
| Riemannian batch normalization for SPD neural networks | Daniel A. Brooks et al | https://arxiv.org/pdf/1909.02414.pdf | SPDnet Riemannian Geometry Batch normalisation |
↑ | ||
| Is Second-order Information Helpful for Large-scale Visual Recognition? | Peihua Li1, Jiangtao Xie1, Qilong Wang1, Wangmeng Zuo2 1Dalian University of Technology, 2Harbin Institute of Technology | https://openaccess.thecvf.com/content_ICCV_2017/papers/Li_Is_Second-Order_Information_ICCV_2017_paper.pdf | Second order network Robust estimation Neural network |
↑ | ||
| Neural Architecture Search of SPD Manifold Networks | Rhea Sanjay Sukthanker1, Zhiwu Huang1, Suryansh Kumar1, Erik Goron Endsjo1, Yan Wu1, Luc Van Gool1,2 | https://arxiv.org/pdf/2010.14535.pdf | SPDnet Batch normalisation Architecture discovery |
- | ||
| Matrix backpropagation for deep net- works with structured layer | Catalin Ionescu et al | https://openaccess.thecvf.com/content_iccv_2015/papers/Ionescu_Matrix_Backpropagation_for_ICCV_2015_paper.pdf | Bilinear Neural network Optimisation Matrix backpropagation |
↑ | ||
| ReDro: Efficiently Learning Large-sized SPD Visual Representation | ↓ | |||||
| A prototype-based SPD matrix network for domain adaptation EEG emotion recognition | ↑ | |||||
| Nonlinear Ranking Loss on Riemannian Potato Embedding | ↓ | |||||
| ManifoldNorm: Extending normalizations on Riemannian Manifolds | - | |||||
| SymNet: A Simple Symmetric Positive Definite Manifold Deep Learning Method for Image Set Classification | - | |||||
| Bilinear CNN models for fine-grained visual recognition | ↑ | |||||
| DeepKSPD: Learning Kernel-matrix-based SPD Representation for Fine-grained Image Recognition | ↓ | |||||
| GeomNet | ↑ | |||||
| Geoopt | ↓ |
Zhiwu Huang, Luc Van Gool Computer Vision Lab, ETH Zurich, Switzerland {zhiwu.huang<EMAIL_ADDRESS>- BiMap : $W$ is the equivalent of weights. Supposed to be orthogonal. → Riemannian backpropagation on Stiefel
- ReEig : $\epsilon$ is chosen beforehand and allows regularisation
- LogEig : Just a logaritmic mapping to have Euclidean data before classifier
The results for the AFEW, HDM05 and PaSC datasets. PaSC1/PaSC2 are the control/handheld testings.
- Choice of $\epsilon=\{10^{-4}, 5\times 10^{-5}, 0\}$ : the network probably becomes shallow
- No bias term in the "activation" function
- Pedestrian detection : poor results but may due to tuning
- Matlab/python code repoduce results
- Re-used in many further works (especially EEG kinda)
Tsung-Yu Lin Aruni RoyChowdhury Subhransu Maji
Daniel Brooks, Olivier Schwander, Frédéric Barbaresco, Jean-Yves Schneider, Matthieu Cord Thales Land and Air Systems and Sorbonne University
Batch normalization (also known as batch norm) is a method used to make artificial neural networks faster and more stable through normalization of the layers' inputs by re-centering and re-scaling.
Let us use $B$ to denote a mini-batch of size $m$ of the entire training set. The empirical mean and variance of $B$ could thus be denoted as $$ \mu_{B}=\frac{1}{m} \sum_{i=1}^{m} x_{i} \text {, and } \sigma_{B}^{2}=\frac{1}{m} \sum_{i=1}^{m}\left(x_{i}-\mu_{B}\right)^{2}. $$ For a layer of the network with d-dimensional input, $x=\left(x^{(1)}, \ldots, x^{(d)}\right)$, each dimension of its input is then normalized (i.e. re-centered and re-scaled) separately : $$ \hat{x}_{i}^{(k)}=\frac{x_{i}^{(k)}-\mu_{B}^{(k)}}{\sqrt{\sigma_{B}^{(k)^{2}}+\epsilon}}, $$ where $k\in\{1,\dots,d\}$, $i\in\{1,\dots,m\}$, $\mu_{B}^{(k)}$ and $\sigma_{B}^{(k)^{2}}$ are the per-dimension mean and variance, respectively.
- Centering from $\mathcal{G}$ (barycenter of PSD data) : $\forall i \leq N, \bar{P}_{i}=\Gamma_{\mathfrak{G} \rightarrow I_{d}}\left(P_{i}\right)=\mathfrak{G}^{-\frac{1}{2}} P_{i} \mathfrak{G}^{-\frac{1}{2}}$
- Biaising towards parameter $G$ : $\forall i \leq N, \tilde{P}_{i}=\Gamma_{I_{d} \rightarrow G}\left(\bar{P}_{i}\right)=G^{\frac{1}{2}} \bar{P}_{i} G^{\frac{1}{2}}$
Peihua Li, Jiangtao Xie, Qilong Wang, Wangmeng Zuo Dalian University of Technology and Harbin Institute of Technology
Fully Connected layers in a neural networks are those layers where all the inputs from one layer are connected to every activation unit of the next layer. In most popular machine learning models, the last few layers are full connected layers which compiles the data extracted by previous layers to form the final output.
$ \mathbf{P} \mapsto(\mathbf{U}, \mathbf{\Lambda}), \quad \mathbf{P}=\mathbf{U} \boldsymbol{\Lambda} \mathbf{U}^{T} $
$$ (\mathbf{U}, \boldsymbol{\Lambda}) \mapsto \mathbf{Q}, \quad \mathbf{Q} \triangleq \mathbf{P}^{\alpha}=\mathbf{U F}(\boldsymbol{\Lambda}) \mathbf{U}^{T}, $$ $\alpha$ positive scalar and $\mathbf{F}$ defined by $ f\left(\lambda_{i}\right)=\left\{\begin{array}{cc} \lambda_i ^\alpha & \text{for MPN}\\ \lambda_{i}^{\alpha} / \lambda_{1}^{\alpha} & \text { for MPN+M- } \ell_{2} \\ \lambda_{i}^{\alpha} /\left(\sum_{k} \lambda_{k}^{2 \alpha}\right)^{\frac{1}{2}} & \text { for MPN+M-Fro } \end{array}\right. $
Our MPN- COV pooling replaces the common first-order, max/average pooling after the last conv. layer, producing a global, d(d + 1)/2−dimensional image representation by concate- nation of the upper triangular part of one covariance ma- trix. In state-of-the-art ConvNets, the feature dimension d of the last conv. layer gets much larger. For such archi- tectures, we add a 1 × 1 conv. layer of 256 channels after the last conv. layer, so that the dimension of features in- putted to the MPN-COV layer is fixed to 256 (see Sec. 5.3 and Sec. 5.4). As such, we alleviate the problem of small sample of large-dimensional features while decreasing the computational cost of the MPN-COV layer.
Saimunur Rahman et al
Very interesting, but not a threat. Also $\mathbf{B}$ is huge.
Also some results :


nearley.js2.0.0
Quick compiler
Enter a nearley grammar here and press the button. nearley will
parse it into an AST and compile the AST into a JavaScript file.
(Note: some features, such as loading built-ins, won’t work
on the browser).


subrela.analysis module¶
Tools for analysis.
Functions¶
|
Calculate strong relevance scores of clusters. |
|
Calculate weak relevance scores of subgroups. |
Tools for analysis.
|
Calculate strong relevance scores of clusters. |
|
Calculate weak relevance scores of subgroups. |


Module pl.test
Useful test utilities.
test.asserteq({1,2},{1,2}) -- can compare tables
test.asserteq(1.2,1.19,0.02) -- compare FP numbers within precision
T = test.tuple -- used for comparing multiple results
test.asserteq(T(string.find(" me","me")),T(2,3))
Dependencies: pl.utils , pl.tablex , pl.pretty , pl.path , debug
Functions
| asserteq (x, y, eps) | like assert, except takes two arguments that must be equal and can be tables. |
| assertmatch (s1, s2) | assert that the first string matches the second. |
| asserteq2 (x1, x2, y1, y2) | a version of asserteq that takes two pairs of values. |
| tuple () | encode an arbitrary argument list as a tuple. |
| timer (msg, n, fun, ...) | Time a function. |
Functions
- asserteq (x, y, eps)
-
like assert, except takes two arguments that must be equal and can be tables.
If they are plain tables, it will use tablex.deepcompare.
Parameters:
x
: any valuey
: a value equal to xeps
: an optional tolerance for numerical comparisons
- assertmatch (s1, s2)
-
assert that the first string matches the second.
Parameters:
s1
: a strings2
: a string
- asserteq2 (x1, x2, y1, y2)
-
a version of asserteq that takes two pairs of values.
x1==y1 and x2==y2
must be true. Useful for functions that naturally return two values.Parameters:
x1
: any valuex2
: any valuey1
: any valuey2
: any value
- tuple ()
-
encode an arbitrary argument list as a tuple.
This can be used to compare to other argument lists, which is
very useful for testing functions which return a number of values.
Usage:
asserteq(tuple( ('ab'):find 'a'), tuple(1,1))
- timer (msg, n, fun, ...)
-
Time a function. Call the function a given number of times, and report the number of seconds taken,
together with a message. Any extra arguments will be passed to the function.
Parameters:
msg
: a descriptive messagen
: number of times to call the functionfun
: the function...
: optional arguments to fun


All commands are preceeded by a '/'. If the command following the '/' is not recognized, you will be informed by the server. In the following list, any value surrounded by {} are meant to be replaced completely by user input. {} is not expected as part of the command.
/roll {dX} - You can ask the server to roll a variety of different dice for you. This includes d4, d6, d8, d10, d12, d20, and d100. If you try to roll a different die, the server will tell you that the die was not valid.
/me {action} - If you send this command to the server, it will tell all users that you did whatever the specified action is. For example, if my username is Joe, "/me takes over the world" will have the server say to everyone "Joe takes over the world".
/w {name} {message} - This will send a whisper with the text of {message} to the user specified by {name}. If that user does not exist, you will be notified.
/r {message} - This will send a response (in the form of a whisper) to the last user to send a whisper to you. If you have not been whispered, you will be notified. If the user you are replying to is no longer connected, you will be notified.
Additional Features
No Duplicates Users - The server will identify if the username you are attempting to use is already in use, and reject you attempting to join.
Enter To Send Input - I set up event listeners to allow you to send an input out of either input field by pressing the enter key. This means that if you are typing in a username and hit enter, you will connect with that name. It also means that if you are typing a message and hit enter that message will be sent.
Empty Message Field - Whenever you finish sending a message (either by clicking the button or hitting enter), the input field for the message clears.


Environmental science is the interdisciplinary study of the physical, chemical, and biological systems that sustain life on our planet. In this course we will explore current environmental challenges such as the conservation of biodiversity, the sustainable production of energy, and the implications of human population growth. The processes of scientific inquiry and discovery will be emphasized through investigation of specific case studies and the critical evaluation of the underlying scientific evidence.
Spring 2016, Tuesday/Thursday 3:30-4:50, 3 credits
Assistant Professor Adam M. Wilson
Office: Wilkeson 120
email: see here phone:<PHONE_NUMBER>
Environmental Literacy, Science Literacy, and Sustainability
Human Population and Environmental Health
Consumption and the Environmental Footprint
Ecology (Ecosystems, Populations, and Communities)
Biodiversity and Evolution
Water Resources
Food Resources
Fossil Fuels
Air Pollution
Renewable Engery
Urbanization
Sustainability and Environmental Policy


Software Developer
Epic Systems
Madison WI
The University of Michigan
Bachelors May 2016
Computer Science in Engineering
I am a software development engineer at Epic Systems in Madison Wisconsin. I received my Bachelor's degree in Computer Science Engineering from the University of Michigan in 2016. At Epic, I will be working on user facing applications which are designed to help inpatient clinicians quickly and easily understand patient data so that they can do their jobs quicker and better.
In my undergraduate pursuit, I was involved in imbedded systems research with Lab11, working for Professor Prabal Dutta. The lab's focus was on the Internet of Things and pervasive computing. Specifically solving the last inch problem, one step beyond the last mile problem. We like to say that "The world would be a better place when everything is networked and everything is connected". Expounding on this, we want to live in a world where a chair can tell you who is sitting in it and your refrigerator can query it's content and leave you a message dictating that you need to pick up milk on the way home from work. The solutions to this, at least right now, is sensors, tiny low power sensors everywhere. Of course this level of coverage is a ways off, but in my free time I'm slowly trying to build myself bits and pieces of a smart house, letting data and automation make my life easier.
I'm looking for projects to do in my free time to keep me up to date with the ever changing world of tech. If you have an idea or an app that needs a another part time developer feel free to reach out to me. And if you want to bounce ideas of someone, I'm always interested in talking about tech and application design.
On a more social note, I enjoy music and live for driving. Sometimes I try to sing, but that’s more out of passion than talent. Sometimes I make video games, but usually I play them. I like beer, and love great food and sometimes I cook it. Let's make time to do one of these things!
As a final project for a UI Course, as part of a group of three, I built a mobile application to aid CS instructors in office hours. In an attempt to reduce friction in giving office hours we created a mobile queue of students who can be viewed, serviced and removed from the queue. This aims to solve the problem of whiteboard signups which both do not scale, and require the instructor to waste time in order to find who the next student on the queue is. It should serve as a mobile workstation for instructors conducting office hours.
As part of Professor Dutta's Lab, I implemented a piece of software which found the relative location of a camera to any known LED lights in the image. The project had a number of steps which follow.
1. Setup Led light tubes, which blink at specific, unique frequencies.
2. Start Software side by leveraging openCV to create a bounding rectangle around each "blob" of light in the image(blobs tend to be formed from more than a single light source because of the proximity of the 4 tubes inside of a single box light).
3. Finding Changes in frequencies through probing the rectangles with FFTs. Using multiple points where the frequency change was over a noise threshold I created a line of best fit between the points minimizing the error while keeping the slope of the rectangle.
4. With all boxes seperated, the code finds the center of each box(the center of each led tube) and takes the frequency at that point. The frequency is then compared to known position and frequency pairs. This is the end of my section of the code. In the implementation, these matches are passed off to angle of arrival calculations which find location relative to each light located in the image. The process is accurate to the decimeter level. The code can be found on Lab11's Github.
As part of a team, at Mhacks we designed and developed the Android application "Bang!". Bang was designed such that on a single button press, a random contact from the user's contact list was selected, and paired with a random pickup line from a sqlite database. This pickup line is then automatically sent to the selected contact using Android's SMS Manager. The code for this project can be found on Github.
I was an instructional aid(TA/IA) for EECS: 482(Operating Systems) for the Winter 2015 semester under the direction of Professor Jason Flinn. As an instructional aid, I gave a weekly discussion to a section of 15-20 students(both Graduate and Undergraduate). I also held office hours every week, helping with conceptual project questions and debugging. The class covers multithreaded programming, scheduling, address spaces/virtual memory, filesystems and networking, as well as overviews of distributed systems and security
Send me a message, i'd love to chat whether it be professional or personal


|
"Ye wanderers from a mighty State, Oh teach us how to legislate -" |
D'Oyly Carte In the 20th Century
1900 to 1950
During the revival of Patience at the Savoy, in the years 1900 - 1901, three important deaths occurred: that of Sir Arthur Sullivan, Queen Victoria and Richard D'Oyly Carte. After Richard's death his wife took over running the Savoy Theatre and subsequently sold it to William Greet. Their was a revival of Iolanthe and the Company introduced several new Operas including The Emerald Isle, Merrie England and The Princess of Kensington. The latter was by Basil Hood and Edward German. In 1903 the Company went on tour for for three years - this included a seven month visit to South Africa. The next Savoy season was from December 1906 to August 1907 and four brand new productions were given (Yeomen, Gondoliers, Patience and Iolanthe), under the direction of W.S. Gilbert and J.M. Gordon, the D'Oyly Carte producer who stayed with the company until 1930. Another season followed in 1908-1909. After these two seasons the Company continued to tour the British provinces, with Henry Lytton playing the comic roles. Lytton had joined the company in 1884 at the age of 17. In 1887 he understudied George Grossmith in Ruddigore. He went on play many Gilbert and Sullivan roles - 30 altogether.
Henry was knighted in 1932. His last performance was as Jack Point, in Dublin, on June 30th, 1934. He died on August 15th, 1936. Helen D'Oyly Carte died in 1913 and the Company went into decline. Rupert D'Oyly Carte stepped in with a keen business sense and revitalized the company. He did this in grand style with a re-dressing of Iolanthe, Gondoliers and Patience. He needed a larger theatre than the savoy and soon the Princess became the Company's new home. The 1919-20 Princess Theatre season was a great success with the Operas given a new look with fresh scenery and costumes. New principals were engaged including Derek Oldham, Elsie Griffin and Darrell Fancourt. Geoffrey Toye was the musical director. Ruddigore was added to the repertoire in 1920 with a new Overture written by Jeffrey Toye. Cox and Box was revived in 1921. A second company was formed to tour the provinces. This company existed from 1919 to 1927 and included such names as Martyn Green, Leslie Rands and Marjorie Eyre. From 1918 to 1925 ten of the Operas were recorded and issued on 78 r.p.m. discs. These were acoustic recordings. A series of Electric recordings were made from 1927 onwards. The 1926 London season opened with a new production of The Mikado with scenery and costumes designed by Charles Ricketts, one of the foremost artists of the day. The conductor was Dr Malcolm Sargent. This began his long career with the Company.
In 1929 the Savoy Theatre was gutted and largely rebuilt. The Company returned to their old home with a new production of The Gondoliers with new sets and costumes by Charles Ricketts. H.M.S. Pinafore, The Pirates of Penzance and Patience also saw new costume designs by George Sheringham. Martyn Green succeeded Henry Lytton in 1934. He had been a member of the Company since 1922, touring the provinces singing in the chorus and taking some minor principal roles. In 1926 he was transfered to the main Company understudying Henry Lytton. In September 1934 the Company sailed to North America for a 15 week season at the Martin Beck Theatre in New York. The season was so successful that return visits were made in 1936 and 1939. In 1938 a colour film version of The Mikado was made at Pinewood Studios. The cast included Martyn Green and Sydney Granville. During the Second World War the Company introduced a new production of The Yeomen of the Guard with a controversial set by Peter Goffin. It was so designed to focus attention on the Opera and not detract from it. Goffin's designs were eventually accepted and thus became a long association between him and the Company.
In 1948 a new production of Ruddigore was presented in Newcastle with a new Act 2 set and new costumes by Peter Goffin. In the midst of the preparations for this production Rupert D'Oyly Carte died. He was succeeded by his daughter Bridget who continued to run the Company for the next 33 years.
|


FELICIA'S JOURNEY A film review by Christopher Null Copyright 1999 Christopher Null filmcritic.com
Atom Egoyan is no stranger to the top ten lists of filmcritic.com. THE ADJUSTER (#7, 1991), CALENDAR (#6, 1993), EXOTICA (#7, 1995), and THE SWEET HEREAFTER (#3, 1997) attest to some amazing staying power over our minds. And while Egoyan's latest effort, FELICIA'S JOURNEY, is certainly a watchable film, it's likely to be his first of the decade that doesn't make the cut.
Why? While Egoyan is a master at working with cryptic source material, FELICIA'S JOURNEY lends itself more to its source as a novel than the big screen. Basically, this is the story of two people. First is Felicia (Cassidy), an Irish lass who's travelled to the U.K. to search for the father of her unborn child. Along the way she encounters Joseph Hilditch (Hoskins), a sweet and friendly `catering director' who hides a secret that other critics will undoubtedly reveal, but I won't.
FELICIA'S JOURNEY quickly becomes one of codependency. Hilditch, the son of a famous TV cooking show star (Egoyan regular, his wife Khanjian), needs the woman to dote upon. Felicia needs him to help search for her Johnny, and to feed and shelter her. We do manage to get inside the heads of both of these characters, particularly interesting in flashbacks to Hilditch's bizarre life as a child. But I posit that the film may have been just as understandable without them.
By the end, we realize we've been watching a couple of crazies for the last two hours. The resolution arrives exactly as expected, which is *not* Egoyan's typical M.O. The movie ends, the theater clears, the story feels unfinished and trifling.
Artisan has already begun a campaign to get Hoskins a Best Actor nomination, and rightfully so. But aside from his impressive, slow-burning work along with typical Egoyan cinematic beauty, FELICIA has little to add to Egoyan's repertoire. There are moments of greatness, punctuated by stretches of predictable narrative. Ultimately, the film just feels too much like something you'd see late at night on Showtime. Okay, maybe better than that, but nothing to send a postcard home about.
Better luck on the next trip, Atom.
RATING: ***1/2
|------------------------------| \ ***** Perfection \ \ **** Good, memorable film \ \ *** Average, hits and misses \ \ ** Sub-par on many levels \ \ * Unquestionably awful \ |------------------------------|
MPAA Rating: PG-13
Director: Atom Egoyan Producer: Bruce Davy Writer: Atom Egoyan Starring: Bob Hoskins, Elaine Cassidy, Claire Benedict, Brid Brennan, Kriss Dosanjh, Nizwar Karanj, Arsinée Khanjian, Peter McDonald, Gerard McSorley, Sheila Reed, Danny Turner, Ali Yassine
http://www.feliciasjourney-movie.com/
--- Christopher Null -<EMAIL_ADDRESS>- http://www.filmcritic.com Check out G-Rex.com Personal Shopper at http://www.g-rex.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


#
Import Config
(current)
Save as Default
SBS Webhard
About
Status Check
Mount All
Unmount All
Import Config
(current)
Save as Default
SBS Webhard
About
Status Check
Mount All
Unmount All
SBS Network Drive Tool
0.9.3
Detective Mod
Custom
Template
Detective Mod Activated
NAS Server
Select..
PDS 교양/종편 NAS1
PDS 교양/종편 NAS2
PDS 예능 NAS1
PDS 예능 NAS2
PDS 드라마 NAS1
PDS 드라마 NAS2
NDS NAS1
NDS NAS2
NDS NAS3
Shared Folder Name
Mount Drive
Select..
B
M
K
Account Name
Password
Add Connection
Refresh Drive
IP Address or Domain
Shared Folder Name
Mount Drive
Select..
B
M
K
Account Name
Password
Add Connection
Refresh Drive
Mount
Unmount
Clear
Clear All
Invalid Input
×
The value of the hostname and drive letter cannot be left blank.
About
×
Save List
×
Drive List was successfully saved!
Import Config file (Json)
×
Error
×
요청하신 작업을 완료하지 못했습니다.
Error
×
요청하신 작업을 완료하지 못했습니다.
System Mounted Drive List
×


Module etc.c.curl
This is an interface to the libcurl library.
Converted to D from curl headers by htod and cleaned up by Jonas Drewsen (jdrewsen)
Windows x86 note: A DMD compatible libcurl static library can be downloaded from the dlang.org download page.
Copyright (C) 1998 - 2010, Daniel Stenberg<EMAIL_ADDRESS>et al.
This software is licensed as described in the file COPYING, which you should have received as part of this distribution. The terms are also available at http://curl.haxx.se/docs/copyright.html.
You may opt to use, copy, modify, merge, publish, distribute and/or sell copies of the Software, and permit persons to whom the Software is furnished to do so, under the terms of the COPYING file.
This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
Functions
Structs
| Name | Description |
|---|---|
CURLMsg
|
|
curl_certinfo
|
info about the certificate chain, only for OpenSSL builds. Asked for with CURLOPT_CERTINFO / CURLINFO_CERTINFO |
curl_fileinfo
|
Content of this structure depends on information which is known and is achievable (e.g. by FTP LIST parsing). Please see the url_easy_setopt(3) man page for callbacks returning this structure -- some fields are mandatory, some others are optional. The FLAG field has special meaning. |
curl_forms
|
structure to be used as parameter for CURLFORM_ARRAY |
curl_httppost
|
|
curl_khkey
|
|
curl_slist
|
linked-list structure for the CURLOPT_QUOTE option (and other) |
curl_sockaddr
|
addrlen was a socklen_t type before 7.18.0 but it turned really
ugly and painful on the systems that lack this type
|
_N2
|
Content of this structure depends on information which is known and is achievable (e.g. by FTP LIST parsing). Please see the url_easy_setopt(3) man page for callbacks returning this structure -- some fields are mandatory, some others are optional. The FLAG field has special meaning. |
_N28
|
Unions
| Name | Description |
|---|---|
_N31
|
Enums
| Name | Description |
|---|---|
CurlAuth
|
|
CurlCallbackInfo
|
the kind of data that is passed to information_callback |
CurlChunkBgnFunc
|
return codes for CURLOPT_CHUNK_BGN_FUNCTION |
CurlChunkEndFunc
|
return codes for CURLOPT_CHUNK_END_FUNCTION |
CurlClosePolicy
|
|
CurlCSelect
|
|
CurlError
|
All possible error codes from all sorts of curl functions. Future versions may return other values, stay prepared. |
CurlFileType
|
enumeration of file types
|
CurlFInfoFlagKnown
|
|
CurlFnMAtchFunc
|
return codes for FNMATCHFUNCTION |
CurlFormAdd
|
use this for multipart formpost building |
CurlFtp
|
parameter for the CURLOPT_FTP_CREATE_MISSING_DIRS option |
CurlFtpAuth
|
parameter for the CURLOPT_FTPSSLAUTH option |
CurlFtpMethod
|
parameter for the CURLOPT_FTP_FILEMETHOD option |
CurlFtpSSL
|
parameter for the CURLOPT_FTP_SSL_CCC option |
CurlGlobal
|
|
CurlHttpVersion
|
These enums are for use with the CURLOPT_HTTP_VERSION option. |
CurlInfo
|
|
CurlIoCmd
|
|
CurlIoError
|
|
CurlIpResolve
|
Below here follows defines for the CURLOPT_IPRESOLVE option. If a host name resolves addresses using more than one IP protocol version, this option might be handy to force libcurl to use a specific IP version. |
CurlKHMatch
|
this is the set of status codes pass in to the callback |
CurlKHStat
|
this is the set of return values expected from the curl_sshkeycallback
callback
|
CurlKHType
|
points to a zero-terminated string encoded with base64 if len is zero, otherwise to the "raw" data |
CurlLockAccess
|
Different lock access types |
CurlLockData
|
Setup defines, protos etc for the sharing stuff. |
CurlM
|
|
CurlMOption
|
|
CurlMsg
|
|
CurlNetRcOption
|
These enums are for use with the CURLOPT_NETRC option. |
CurlOption
|
|
CurlPause
|
|
CurlPoll
|
|
CurlProto
|
CURLPROTO_ defines are for the CURLOPT_*PROTOCOLS options |
CurlProxy
|
|
CurlReadFunc
|
|
CurlRedir
|
symbols to use with CURLOPT_POSTREDIR. CURL_REDIR_POST_301 and CURL_REDIR_POST_302 can be bitwise ORed so that CURL_REDIR_POST_301 | CURL_REDIR_POST_302 == CURL_REDIR_POST_ALL |
CurlRtspReq
|
Public API enums for RTSP requests |
CurlSeek
|
These are the return codes for the seek callbacks |
CurlSeekPos
|
seek whence... |
CurlShError
|
|
CurlShOption
|
pass in a user data pointer used in the lock/unlock callback functions |
CurlSockType
|
|
CurlSshAuth
|
|
CurlSslVersion
|
|
CurlTimeCond
|
|
CurlTlsAuth
|
|
CurlUseSSL
|
parameter for the CURLOPT_USE_SSL option |
CurlVer
|
Structures for querying information about the curl library at runtime. |
CurlVersion
|
Enum values
| Name | Type | Description |
|---|---|---|
CURLINFO_DOUBLE
|
||
CURLINFO_HTTP_CODE
|
CURLINFO_RESPONSE_CODE is the new name for the option previously known as
CURLINFO_HTTP_CODE
|
|
CURLINFO_LONG
|
||
CURLINFO_MASK
|
||
CURLINFO_SLIST
|
||
CURLINFO_STRING
|
||
CURLINFO_TYPEMASK
|
||
CURLM_CALL_MULTI_SOCKET
|
just to make code nicer when using curl_multi_socket () you can now check
for CURLM_CALL_MULTI_SOCKET too in the same style it works for
curl_multi_perform () and CURLM_CALL_MULTI_PERFORM
|
|
CURLOPTTYPE_FUNCTIONPOINT
|
long may be 32 or 64 bits, but we should never depend on anything else but 32 | |
CURLOPTTYPE_LONG
|
long may be 32 or 64 bits, but we should never depend on anything else but 32 | |
CURLOPTTYPE_OBJECTPOINT
|
long may be 32 or 64 bits, but we should never depend on anything else but 32 | |
CURLOPTTYPE_OFF_T
|
long may be 32 or 64 bits, but we should never depend on anything else but 32 | |
CURLOPT_HEADERDATA
|
three convenient "aliases" that follow the name scheme better | |
CURLOPT_READDATA
|
three convenient "aliases" that follow the name scheme better | |
CURLOPT_RTSPHEADER
|
three convenient "aliases" that follow the name scheme better | |
CURLOPT_SERVER_RESPONSE_TIMEOUT
|
||
CURLOPT_WRITEDATA
|
three convenient "aliases" that follow the name scheme better | |
CURLVERSION_NOW
|
The 'CURLVERSION_NOW ' is the symbolic name meant to be used by
basically all programs ever that want to get version information. It is
meant to be a built-in version number for what kind of struct the caller
expects. If the struct ever changes, we redefine the NOW to another enum
from above.
|
|
CURL_ERROR_SIZE
|
||
CURL_MAX_HTTP_HEADER
|
The only reason to have a max limit for this is to avoid the risk of a bad server feeding libcurl with a never-ending header that will cause reallocs infinitely | |
CURL_MAX_WRITE_SIZE
|
Tests have proven that 20K is a very bad buffer size for uploads on Windows, while 16K for some odd reason performed a lot better. We do the ifndef check to allow this value to easier be changed at build time for those who feel adventurous. The practical minimum is about 400 bytes since libcurl uses a buffer of this size as a scratch area (unrelated to network send operations). | |
CURL_WRITEFUNC_PAUSE
|
This is a magic return code for the write callback that, when returned, will signal libcurl to pause receiving on the current transfer. | |
HTTPPOST_BUFFER
|
upload file from buffer | |
HTTPPOST_CALLBACK
|
upload file contents by using the regular read callback to get the data and pass the given pointer as custom pointer | |
HTTPPOST_FILENAME
|
specified content is a file name | |
HTTPPOST_PTRBUFFER
|
upload file from pointer contents | |
HTTPPOST_PTRCONTENTS
|
contents is only stored pointer do not free in formfree | |
HTTPPOST_PTRNAME
|
name is only stored pointer do not free in formfree | |
HTTPPOST_READFILE
|
specified content is a file name | |
LIBCURL_COPYRIGHT
|
This is the global package copyright | |
LIBCURL_TIMESTAMP
|
This is the date and time when the full source package was created. The timestamp is not stored in git, as the timestamp is properly set in the tarballs by the maketgz script. | |
LIBCURL_VERSION
|
This is the version number of the libcurl package from which this header file origins: | |
LIBCURL_VERSION_MAJOR
|
The numeric version number is also available "in parts" by using these constants | |
LIBCURL_VERSION_MINOR
|
The numeric version number is also available "in parts" by using these constants | |
LIBCURL_VERSION_NUM
|
This is the numeric version of the libcurl version number, meant for easier
parsing and comparions by programs. The LIBCURL_VERSION_NUM define will
always follow this syntax:
|
|
LIBCURL_VERSION_PATCH
|
The numeric version number is also available "in parts" by using these constants |
Aliases
| Name | Type | Description |
|---|---|---|
CURL
|
void
|
|
CURLcode
|
int
|
|
curlfiletype
|
int
|
|
CURLFORMcode
|
int
|
|
CURLINFO
|
int
|
|
curliocmd
|
int
|
|
curlioerr
|
int
|
|
CURLM
|
void
|
|
CURLMcode
|
int
|
|
CURLMoption
|
int
|
|
CURLMSG
|
int
|
|
CURLoption
|
int
|
|
CURLSH
|
void
|
|
CURLSHcode
|
int
|
|
CURLSHoption
|
int
|
|
curlsocktype
|
int
|
|
CURLversion
|
int
|
|
curl_calloc_callback
|
void* function(ulong, ulong)
|
The following typedef's are signatures of malloc, free, realloc, strdup and
calloc respectively. Function pointers of these types can be passed to the
curl_global_init_mem () function to set user defined memory management
callback routines.
|
curl_chunk_bgn_callback
|
long function(void*, void*, int)
|
if splitting of data transfer is enabled, this callback is called before download of an individual chunk started. Note that parameter "remains" works only for FTP wildcard downloading (for now), otherwise is not used |
curl_chunk_end_callback
|
long function(void*)
|
If splitting of data transfer is enabled this callback is called after download of an individual chunk finished. Note! After this callback was set then it have to be called FOR ALL chunks. Even if downloading of this chunk was skipped in CHUNK_BGN_FUNC. This is the reason why we don't need "transfer_info" parameter in this callback and we are not interested in "remains" parameter too. |
curl_closepolicy
|
int
|
|
curl_conv_callback
|
int function(char*, ulong)
|
This prototype applies to all conversion callbacks |
curl_debug_callback
|
int function(void*, int, char*, ulong, void*)
|
|
curl_fnmatch_callback
|
int function(void*, char*, char*)
|
callback type for wildcard downloading pattern matching. If the string matches the pattern, return CURL_FNMATCHFUNC_MATCH value, etc. |
curl_formget_callback
|
extern(C) ulong function(void*, char*, ulong)
|
callback function for curl_formget ()
The void *arg pointer will be the one passed as second argument to
curl_formget ().
The character buffer passed to it must not be freed.
Should return the buffer length passed to it as the argument "len" on
success.
|
curl_free_callback
|
void function(void*)
|
The following typedef's are signatures of malloc, free, realloc, strdup and
calloc respectively. Function pointers of these types can be passed to the
curl_global_init_mem () function to set user defined memory management
callback routines.
|
curl_ftpauth
|
int
|
|
curl_ftpccc
|
int
|
|
curl_ftpcreatedir
|
int
|
|
curl_ftpmethod
|
int
|
|
curl_infotype
|
int
|
|
curl_ioctl_callback
|
int function(void*, int, void*)
|
|
curl_lock_access
|
int
|
|
curl_lock_data
|
int
|
|
curl_lock_function
|
void function(void*, int, int, void*)
|
|
curl_malloc_callback
|
void* function(ulong)
|
The following typedef's are signatures of malloc, free, realloc, strdup and
calloc respectively. Function pointers of these types can be passed to the
curl_global_init_mem () function to set user defined memory management
callback routines.
|
curl_multi_timer_callback
|
extern(C) int function(void*, long, void*)
|
private callback pointer |
curl_off_t
|
long
|
Data type definition of curl_off_t .
|
curl_opensocket_callback
|
std.
|
|
curl_progress_callback
|
int function(void*, double, double, double, double)
|
|
curl_proxytype
|
int
|
|
curl_read_callback
|
ulong function(char*, ulong, ulong, void*)
|
|
curl_realloc_callback
|
void* function(void*, ulong)
|
The following typedef's are signatures of malloc, free, realloc, strdup and
calloc respectively. Function pointers of these types can be passed to the
curl_global_init_mem () function to set user defined memory management
callback routines.
|
curl_seek_callback
|
int function(void*, long, int)
|
|
curl_socket_callback
|
extern(C) int function(void*, std.
|
private socket pointer |
curl_socket_t
|
std.
|
jdrewsen - Get socket alias from std.socket
|
CURL_SOCKET_TIMEOUT
|
||
curl_sockopt_callback
|
int function(void*, std.
|
|
curl_sshkeycallback
|
int function(void*, curl_khkey*, curl_khkey*, CurlKHMatch, void*)
|
|
curl_ssl_ctx_callback
|
int function(void*, void*, void*)
|
actually an OpenSSL SSL_CTX |
curl_strdup_callback
|
char* function(char*)
|
The following typedef's are signatures of malloc, free, realloc, strdup and
calloc respectively. Function pointers of these types can be passed to the
curl_global_init_mem () function to set user defined memory management
callback routines.
|
curl_TimeCond
|
int
|
|
curl_unlock_function
|
void function(void*, int, void*)
|
|
curl_usessl
|
int
|
|
curl_version_info_data
|
_N28
|
|
curl_write_callback
|
ulong function(char*, ulong, ulong, void*)
|
|
fd_set
|
int
|
|
FUNCTIONPOINT
|
name is uppercase CURLOPT_ |
|
LONG
|
name is uppercase CURLOPT_ |
|
OBJECTPOINT
|
name is uppercase CURLOPT_ |
|
OFF_T
|
name is uppercase CURLOPT_ |


Gecode::Search::BabEngine Class Reference
#include <search.hh>
Inherits Gecode::Search::EngineCtrl.
Detailed Description
Implementation of depth-first branch-and-bound search engines.Definition at line 582 of file search.hh.
Public Types | |
| enum | ExploreStatus { ES_SOLUTION, ES_CONSTRAIN } |
| Status of the explore function. More... | |
Public Member Functions | |
| BabEngine (unsigned int c_d, unsigned int a_d, Stop *st, size_t sz) | |
| Initialize engine. | |
| void | init (Space *s) |
| Initialize engine to start at space s. | |
| ExploreStatus | explore (Space *&s1, Space *&s2) |
| Search for next better solution | |
| size_t | stacksize (void) const |
| Return stack size used by engine. | |
| ~BabEngine (void) | |
| Destructor. |
Member Enumeration Documentation
Constructor & Destructor Documentation
| Gecode::Search::BabEngine::BabEngine | ( | unsigned int | c_d, | |
| unsigned int | a_d, | |||
| Stop * | st, | |||
| size_t | sz | |||
| ) | [inline] |
| Gecode::Search::BabEngine::~BabEngine | ( | void | ) | [inline] |
Member Function Documentation
| void Gecode::Search::BabEngine::init | ( | Space * | s | ) | [inline] |
| BabEngine::ExploreStatus Gecode::Search::BabEngine::explore | ( | Space *& | s1, | |
| Space *& | s2 | |||
| ) |
| size_t Gecode::Search::BabEngine::stacksize | ( | void | ) | const [inline] |
The documentation for this class was generated from the following files:
- gecode/search.hh (Revision: 7310)
- gecode/search/bab.cc (Revision: 5916)
- gecode/search/bab.icc (Revision: 6273)


Survey for highway
by Staff ReporterRevenue and Housing Minister E. Chandrasekharan has said all work on the Kanhangad-Panathur highway, including the survey, will be completed by December.
Addressing a meeting convened by District Collector D. Sajith Babu here on Sunday, the Minister said the Deputy Director of Survey was entrusted with the task of identifying the Poramboke and encroached land and remeasuring the land boundary required for the road.
The panchayat presidents, who attended the meeting, assured the cooperation of the public for the land survey. The Minister sought the completion of the survey without delay.


There are 2x subnets in a network, where x is the number of borrowed subnet bits.
There are 2h-2 usable hosts in a network, where h is the number of host bits.
The block size for a subnet is 256-subnet mask value. Start at zero and count in block sizes. Every block size will be a new network address.
The broadcast address is one less than the next network address. Count in block sizes.
The usable hosts are between the network address and the broadcast. So the usable hosts the block size plus one through the next block size minus two.
Confused? The best way to learn subnetting is to practice! Start with the basics and go from there.
Learning how to subnet accurately and quickly are keys to success in the IT field and also to passing IT certifications, such as the CCNA. We subnet to avoid having one large network. A single giant network would be an unmanageable mess.
All subnetting is done in binary, however, because we humans are used to a base-ten system, we translate things into decimal numbers. This makes life a lot easier. It is important to understand the binary behind the decimal. Without understanding the binary, it is difficult to understand why we calculate network masks, broadcast addresses, etc. the way we do.A binary digit is called a bit. It represents a 1 or a 0. An IPv4 address has 32 bits, and an IPv6 address has 128 bits, but let's stick with IPv4 for now. Each IPv4 address is split up into four octets separated by periods. Each bit represents a power of 2. An octet is a group of 8 bits and can have a value ranging from 0 to 255. If you do not know how to count in binary, or convert binary into decimals, and vice versa you should check out the Binary Practice page.
OK, so an IP address is 32 bits. This address is then divided into two parts, the subnet bits and the host bits. The subnet bits show what network a device is on, and the host bits define the individual device. Think of a telephone number, you have an area code and then the number. The area code can be thought of as the subnet bits. Many people who live near one another share an area code, but they all have an individual phone number. The same is of devices on a subnet. They all share the same subnet bits, but then each one has an individual combination of host bits.
The way we know which part of the IP address is the subnet bit part and which part is the host bit part is using a subnet mask. A subnet mask (or net-mask) is made up of 32-bits, like a regular IP address, but is used only to divide the subnet bits from the host bits. The subnet bits are all 1s and the host bits are all 0s. So a subnet mask might be 11111111.11111111.1111111.00000000, which in decimal should be <IP_ADDRESS>. This would specify that any IP address with that subnet mask will have the first three octets be used as subnet bits, and the last octet will be used for host bits.
You can have subnets inside of subnets. That's essentially what subnetting is; dividing blocks of IPs into smaller blocks. To do this you 'borrow' bits from the host range and add them to the subnetting bits. For example, you can split the above <IP_ADDRESS> into 4 subnets with the subnet mask of <IP_ADDRESS>. "Wait, what??" Well, lets look back at the binary subnet mask for <IP_ADDRESS>: 11111111.11111111.11111111.00000000. We can 'borrow' two bits from the host bits and create a net subnet mask of 11111111.11111111.11111111.11000000. Changing those two bits from 0s to 1s makes the last octet equal to 192. (Don't get it? Practice your Binary.) By 'borrowing' those bits you can now create four new subnets within your original subnet. Why four? Because those two bits have four different possible combinations. You can have 00, 01, 10, 11. This number will always be 2x where x is the number of 'borrowed' subnet bits.
Now we know how many subnets we can create, but how many IPs does each subnet have? That is calculated the same way, only using the host bits. We have 6 host bits left (all the zeros) so we just find 2y where y is the number of host bits. 26=64. But wait! That is how many IPs a subnet has, not how many usable hosts a subnet has. Every subnet must have a network address and a broadcast address, and neither of those can ever be used by a host. So the usable hosts is actually 2y-2 where y is the amount of host bits. In this case there are 62 usable bits per subnet. As you can see, learning your powers of two is key to subnetting quickly.
The network address is used to identify the network that you are working on and the broadcast IP is used to send messages to every device on that subnet. The network address is always the very first IP address of a subnet, and the broadcast is always the very last IP address of a subnet. In other words, for a network address is the IP address where all the host bits are set to 0 and the broadcast address is the IP address where all the host bits are set to 1.
Though the class system of IP ranges has been replaced by CIDR, many people still talk about the five classes of IP address range. Only three are really important.
Class A addresses use the first octet for networking and the last three octets as host bits. The first octet range is 1-126 (or any ip address where the first bit is a 0).
Class B addresses use the first two octets for networking and the last two for host bits. The first octet range is from 128-192 (the first two bits are 10).
Class C addresses use the first three octets for networking and the last octet for host bits. The range of the first octet is 192-223 (the first three bits are 110 in binary).
There are also Class D and E addresses which go from 224-239 and 240-255 and are used for multicast and experimental uses, respectively.
Private IP ranges are:
| Class | Size | Subnet Mask | Range of IPs |
| Class A | <IP_ADDRESS>/8 | <IP_ADDRESS> | <IP_ADDRESS> - <IP_ADDRESS> |
| Class B | <IP_ADDRESS>/12 | <IP_ADDRESS> | <IP_ADDRESS> - <IP_ADDRESS> |
| Class C | <IP_ADDRESS>/16 | <IP_ADDRESS> | <IP_ADDRESS> - <IP_ADDRESS> |
You may also want to read up on IPv6.


Rand and Min stood looking at one another, not moving, until finally he said, “Would you like to come out to the farm with me?”
She gave a little start at the sound of his voice. “The farm?”
“It’s a school, really. For the men who come for the amnesty.”
Min’s face paled. “No, I don’t think . . . Merana will be waiting to hear from me. And I should let them know your rules as soon as possible. Any one of them could wander into the Inner City without knowing, and you wouldn’t want . . . I really ought to go.”
He did not understand. Without meeting even one of the students, she was afraid of them, men who could channel, men who wanted to channel. In anyone else it would be understandable, but he could channel, and she was ready to rough his hair and poke his ribs and call him names to his face. “Do you want an escort back to The Crown of Roses? There really are footpads, even by daylight. Not many, but I would not like anything to happen to you.”
Her laugh was a bit unsteady. She truly was upset over the farm. “I took care of myself while you were tending sheep, farmboy.” Abruptly she had a knife in either hand; a flourish, and they went back up her sleeves, not quite so smoothly as they had come out. In a much more sober tone, she said, “You must take care of yourself, Rand. Rest. You look tired.” Startlingly, she went a-tiptoe and stretched her head up to brush his lips with a kiss. “It is good to see you too, sheepherder.” And with another laugh, this one delighted, she slipped out.
Muttering to himself, Rand put his coat back on and went into his bedchamber to fetch his sword from the back of the wardrobe, a dark, rose-carved thing tall enough and wide enough for four men’s clothes. He really was turning into a randy goat. Min was just having her fun. He wondered how long she intended to keep teasing him for one slip of the tongue.
A cloth bag of moderate size, clinking when he lifted it from under his stockings in a drawered chest inlaid with lapis, went into one coat pocket, and a much smaller velvet bag went in atop his angreal. The silversmith who had made the contents of the larger had been more than happy to work for the Dragon Reborn and had tried to refuse payment for the honor of it. The goldsmith who had made the single piece in the other bag had required four times what Bashere said the work was worth, and a pair of Maidens to stand over him until it was done.
This trip to the farm had been in Rand’s mind for some time already. He did not like Taim, and Lews Therin would surge around the man, but he could not go on avoiding the place. Especially not now. So far as he knew, Taim had done well at keeping the students out of the city—at least, Rand had heard of no incidents, and he would have—but news of Merana and the embassy would reach the farm eventually, by the supply carts or with new students, and in the way of rumors, nine Aes Sedai would become nine Red sisters, or ninety, hunting men to gentle. Whether the result of that would be students running off in the night or students coming into Caemlyn to strike the first blow, he had to quell it before it began.
Caemlyn held too many rumors of Aes Sedai already as it was, another reason he had planned to go out. Alanna and Verin and the Two Rivers girls had grown into half the Tower, by the word in the streets, and there were plenty of other tales of Aes Sedai sneaking into the city, sneaking through the gates in the night. That story of an Aes Sedai Healing stray cats was so prevalent he could almost believe in her himself, but all Bashere’s efforts to track the tale down provided as much substance as the tale that the women who escorted the Dragon Reborn everywhere were really Aes Sedai in disguise.
Unconsciously Rand turned, staring at a wall banded with white reliefs of lions and roses, staring beyond it. Alanna was no longer at Culain’s Hound. She was on edge; had she not been Aes Sedai, he would have said her nerves were jagged. Once last night he had wakened, sure she was weeping; the feel had been that strong. Sometimes he almost found himself forgetting she was there—until something like her waking him happened. He supposed you really could grow used to anything. This morning Alanna was . . . eager, as well; eager seemed the best word. He would wager all of Caemlyn that the plumb line from his eyes to her ran straight to The Crown of Roses. He would wager Verin was with her. Not nine Aes Sedai. Eleven.
Lews Therin murmured uneasily. It was the sound of a man wondering whether his back was against a wall. Rand wondered, too. Eleven, and thirteen could take him as easily as scoop up a child. If he gave them the chance. Lews Therin began laughing softly, a hoarse weeping sort of laugh; he had drifted again.
For a moment Rand considered Somara and Enaila, then opened a gateway right there above the blue-and-gold-patterned carpet in his bedchamber. Sullen as they were this morning, one of them was sure to blurt something before the visit to the farm was done, and remembering his previous visits, he did not want the students all looking over their shoulders for fear of twenty or so Maidens. That sort of thing did little for a man’s confidence, and they needed confidence if they were to survive.
Taim was right on one point; holding on to saidin, a man knew he was alive, and it went beyond heightened senses. Despite the Dark One’s taint, despite the feel of oily offal staining your bones, when the Power was trying to melt you where you stood, freeze you till you shattered, when one misstep or one moment of weakness meant death—Light, you knew you were alive. Still, he pushed the Source away as soon as he was through the gateway, and not only to rid himself of the taint before his stomach emptied itself; it seemed worse than it had been, more vile, if that was possible. His real reason for abandoning the Power was that he did not think he dared face Taim with saidin in him and Lews Therin in his head.
The clearing was browner than he remembered, more leaves crackling under his boots and still fewer on the trees. Some of the pines were completely yellow, and a number of leatherleafs stood dead, gray and bare. But if the clearing had changed, the farm was altered almost beyond recognition.
The farmhouse looked in much better repair with its new thatch, and the barn had certainly been rebuilt entirely; it was much larger than before and did not lean at all. Horses filled a large corral beside the barn, and the pens of cows and sheep had been moved farther away. The goats were penned now as well, and neat rows of coops held the chickens. The forest had been cleared back. Over a dozen long white tents made a row beyond the barn, and nearby stood the frames for two buildings much larger than the farmhouse, where a cluster of women sat outside doing their sewing and watching a score of children roll hoops and toss balls and play with dolls. The biggest change was the students, most in close-fitting high-collared black coats and few sweating. There must have been well over a hundred, of all ages. Rand had had no idea Taim’s recruiting trips had gone this well. The feel of saidin seemed to fill the air. Some men practiced weaves, setting fire to stumps or shattering stones or snaring each other in coils of Air. Others channeled to haul water, the buckets gripped with Air, or to push dung carts from the barn, or stack firewood. Not everyone was channeling. Henre Haslin had a line of bare-chested men under his eye, working the forms with practice swords. With only a fringe of white hair and a bulbous red nose, Haslin sweated more than his students, and doubtless was wishing for his wine, but he watched and corrected as sharply as when he was Master of the Sword for the Queen’s Guards. Saeric, a gray-haired Red Water Goshien with no right hand, had two shirtless rows under his stony eyes. One was kicking as high as their heads, pivot and kick, then pivot and kick with the other foot, over and over; the other punched the air in front of them as fast they could. All in all, it was a far cry from the pitiful handful Rand had seen the last time.
  “And who are you?” he demanded in a Taraboner accent. “I suppose you have come to the Black Tower to learn, yes? You should have waited in Caemlyn for the wagon to bring you. You could have had another day to enjoy that fine coat.”
“I am Rand al’Thor,” Rand said quietly. Quietly so as not to let out a sudden surge of anger. Civility cost nothing, and if this fool did not decide it was cheap at the price soon . . .
If anything, the sneer deepened. “So you are him, are you?” He looked Rand up and down insolently. “You do not look so grand to me. I think that I myself could—” A flow of Air solidified just before it clipped him under the ear, and he collapsed in a heap.
“Sometimes we need a hard discipline,” Taim said, coming to stand over the man on the ground. His voice was almost jolly, but his dark tilted eyes stared close to murder at the man he had clubbed. “You cannot tell a man he has the power to make the earth shake, then expect him to walk small.” The Dragons climbing the sleeves of his black coat glittered in the sunlight; thread-of-gold would do for the one, but what could make the blue shine so? Abruptly he raised his voice. “Kisman! Rochaid! Drag Torval away and douse him until he wakes. No Healing, mind you. Maybe an aching head will teach him to mind his tongue.”
Two men in black coats, younger than Rand, came running and bent over Torval, then hesitated, glancing at Taim. After a moment, Rand felt saidin fill them; flows of Air lifted a limp Torval, and the pair trotted away with him floating between them.
I should have killed him long ago, Lews Therin panted. I should have . . . should have . . . there was a stretching toward the Source.
 Rand thought. No, you don’t!  With a fading wail Lews Therin fled.
Rand took a slow breath. Taim was looking at him, wearing that almost-smile. “You teach them Healing?”
“The little I know, first thing. Even before how not to sweat to death in this weather. A weapon loses its utility if it’s going to be laid up with the first wound. As it is, I have had one kill himself drawing too deeply and three burn themselves out, but no one has died from a sword yet.” He managed to put a good deal of contempt into the word “sword.”
“I see,” Rand said simply. One dead and three burned out. Did Aes Sedai lose that many in the Tower? But then, they went slowly. They could afford to go slowly. “What is this Black Tower the fellow was talking about? I don’t like the sound of it, Taim.” Lews Therin was mumbling and moaning again, just short of making words.
The hawk-nosed man shrugged, studying the farm and the students with a proprietary pride. “A name the students use. You could not go on calling this just ‘the farm.’ They certainly did not feel right about it; they wanted something more. The Black Tower to balance the White Tower.” He tilted his head, looking at Rand almost sideways. “I can suppress it, if you wish. It is easy enough to take a word from men’s lips.”
Rand hesitated. Easy enough to take a word from their lips perhaps, but not from their minds. It did have to be called something. He had not thought of that. Why not the Black Tower? Though looking at the farmhouse and the framing—larger, but only wood—the name did make him smile. “Let it stand.” Maybe the White Tower had begun as humbly. Not that the Black Tower would ever have time to grow into anything to rival the White. That erased his smile, and he looked at the children sadly. He was playing as much as they, pretending there was a chance of building something that might last. “Assemble the students, Taim. I have a few things to say to them.”
He had come expecting to gather them round him, and then seeing their numbers, maybe to speak from the back of the rickety cart that now seemed to have vanished.  It stood in an open area beyond the farmhouse, the ground beaten bare and flat and hard around it. The women and children gathered to one side to watch and listen.
From the block, Rand had a chance to see clues to how far Taim’s recruiting had ranged. Jahar Narishma, whom Taim had pointed out, the young man with the spark, had dark eyes as big as a girl’s, a pale face filled with confidence, and hair in two long braids with silver bells on the ends. Actually, Taim had said he came from Arafel, but Rand recognized a Shienaran’s shaved head and topknot on another man, and two with the transparent veils often worn by men and women alike in Tarabon. There were tilted eyes from Saldaea and pale, short fellows from Cairhien. One old man had a beard oiled and cut to a point in imitation of a Tairen lord, which he assuredly was not with that creased leathery face, and no fewer than three wore beards that left their upper lips bare. He hoped Taim had not roused Sammael’s interest by recruiting into Illian. He had expected mainly younger men, but fresh faces like Eben’s and Fedwin’s were balanced by gray or balding heads, some even more grizzled than Damer. Now that he thought of it, though, there was no mystery, no reason there should not be as many grandfathers who could be taught as boys.
He did not know how to make speeches, but he had thought long and hard over what he wanted to say. Not the first part, but that was quickest done, with luck. “You’ve all probably heard stories that the Tower . . . the White Tower . . . has divided. Well, it’s true. There are some rebel Aes Sedai who might just decide to follow me, and they’ve sent emissaries. Nine of them, sitting in Caemlyn right now and waiting my pleasure. So when you hear about Aes Sedai in Caemlyn, don’t believe any rumors.
There was no reaction. They just stood there staring up at him, hardly seeming to blink. Taim looked wry, very wry. Touching the larger bag in his pocket, Rand went on with the part he had labored over.
“You need a name. In the Old Tongue, Aes Sedai means Servants of All, or something very close. The Old Tongue doesn’t translate easily.” For himself, he knew only a few words, some from Asmodean, a handful from Moiraine, some that had seeped through from Lews Therin. Bashere had provided what he needed, though. “Another word in the Old Tongue is asha’man. It means guardian, or guardians. Or defender, and maybe a couple of other things; I told you, the Old Tongue is very flexible. Guardian seems to be best, though. Not just any defender or guardian, though. You could not call a man who defended an unjust cause asha’man, and never one that was evil. An asha’man was a man who defended truth and justice and right for everyone. A guardian who would not yield even when hope was gone.” The Light knew, hope would go when Tarmon Gai’don came, if not before. “That is what you are here to become. When you finish your training, you will be Asha’man.”
Murmurs rustled like leaves in a breeze, the name being repeated, but they died quickly. Attentive faces peered up at him; he could almost see ears pricking for his next words. At least that was a little better than before.
“Aes Sedai begin as novices, then become Accepted, then finally full Aes Sedai. You will have degrees, too, but not like theirs. There will be no putting out or sending away among us.” Send away? Light, he would do everything short of tying them hand and foot to stop anyone who wanted to go if he could channel at all. “When a man first comes to the Black Tower . . . ” He did not like that name. “ . . . he will be called a soldier, because that is what he becomes when he joins us, what you all became, a soldier to fight the Shadow, and not just the Shadow, but anyone who opposes justice or oppresses the weak. When a soldier reaches a certain stage in his skills, he will be called Dedicated, and wear this.” From the bag he took one of the badges the silversmith had made, a small gleaming silver sword, perfect with its long hilt and slanting quillons and slightly curved blade. “Taim.”
Taim walked to the block stiffly, and Rand bent to pin the silver sword to the tall collar of his coat. It seemed to shine even more brightly against the pitch-black wool. Taim’s face had as much expression as the stone beneath Rand’s boots. Rand handed him the bag, whispering, “Give these to whoever you think is ready. Just be sure they are.”
Straightening, he hoped there were enough; he really had not expected anywhere near so many men. “Dedicated who advance their skill far enough will be called Asha’man, and they will wear this.”  Sunlight sparkled on finely crafted gold and rich red enamel. A sinuous form exactly like the one on the Dragon banner. That went onto Taim’s collar too, on the other side, so sword and Dragon shone at the sides of his throat. “I suppose I was the first Asha’man,” Rand told the students, “but Mazrim Taim is the second.” Taim’s face made stone look soft; what was wrong with the man? “I hope that all of you will become Asha’man eventually, but whether you do or not, remember that all of us are soldiers. There are many battles ahead, maybe not always the ones we expect, and at the end, the Last Battle. The Light send it is the last. If the Light shines on us, we will win. We will win because we must win.”
There should have been some sort of cheer when he stopped. He did not take himself for the sort of speaker who could make men jump and shout, but these men knew why they were here. Telling them they would win should have produced something, however feeble. There was only silence.
Rand jumped down from the stone block, and Taim snapped, “Disperse to lessons and chores.” The students—the soldiers—went their ways almost as silently as they had stood, with only a murmur of quiet words. Taim motioned toward the farmhouse. He was holding the bag of sword pins so tightly it was a wonder none of them stabbed him through the cloth. “If my Lord Dragon has time for a cup of wine?”
Rand nodded; he wanted to get to the bottom of this before returning to the Palace.
The front room of the farmhouse was just what might be expected, a bare floor swept spotless, mismatched ladder-back chairs arranged in front of a red brick fireplace so clean it seemed impossible it had ever held a fire.  Sora Grady entered silently and set a wooden tray atop the cloth, with a bright blue pitcher of wine and two white-glazed mugs. Rand had thought her gaze would not hurt after all this time, but the accusation in her eyes made him glad when she left. She had been sweating, he realized. Taim tossed the bag onto the tray and emptied a mug straight away.
“Don’t you teach the women that trick of concentrating?” Rand asked. “It’s cruel to make them sweat when their men don’t.”
“Most want no part of it,” Taim said curtly. “Their husbands and sweethearts try to teach them, but most refuse even to listen. It might have to do with saidin, you see.”
Rand peered into his mug at the dark wine. He had to feel his way here. No blowing up just because irritation prickled. “I’m pleased to see the recruiting going so well. You said you’d match the Tower . . . the White Tower . . . ” White Tower; Black Tower. What would the stories make of that? If there were any. “ . . . in less than a year, and if you keep on at this rate, you will. I don’t see how you find so many.”
“Sift enough sand,” Taim said stiffly, “and you will find a few grains of gold eventually. I leave that to others now, except for a trip or two. Damer, Grady, there are a dozen men I can trust alone for a day; they have enough years not to do anything stupid, and there are enough younger men with the strength to make a gateway, if not much more, to accompany the older who don’t. You will have your thousand before the year. What of those I send on to Caemlyn? Have you made an army of them yet? You have your thousand there, and times over.”
“I leave that to Bashere,” Rand said quietly. Taim’s mouth quirked derisively, and Rand set his mug down before it could break in his grip. Bashere was making what he could of them, he understood, in a camp somewhere west of the city; what he could considering that they were, as the Saldaean put it, a ragtag collection of penniless farmers, runaway apprentices and failed craftsmen who had never held a sword, ridden a horse with a saddle or been more than five miles from where they were born. Rand had too much to concern him to worry about the likes of that; he had told Bashere to do what he wanted with them and not bother him unless they ran riot.
Looking at Taim, who was making no effort to hide his disdain, he stuck his hands behind his back, where they clenched into fists. Lews Therin rumbled in the distance, an echo of his anger. “What has gotten into you? You’ve had a burr in your breeches ever since I put those badges on you. Is it something to do with them? If so, I don’t understand. Those men will think more of theirs for seeing you receive yours from the Dragon Reborn. For that matter, they’ll think more of you for it. Maybe you won’t have to keep discipline by clubbing men over the head. Well, what have you to say?” That began well enough, in a calm tone if not exactly mild—he had not intended it to be mild—but along the way his voice grew firmer and louder. Not to a shout, yet that final question cracked, like a whip.
The most remarkable transformation came over the other man. Taim shook visibly—with rage, Rand would have said, not fear—but when the shaking stopped, he was his old self again. Not friendly certainly, a touch mocking, but very much relaxed and in control of himself. “Since you must know, what worries me are Aes Sedai, and you. Nine Aes Sedai come to Caemlyn, plus two, make eleven. Then there might just be one or two more. I haven’t been able to find them yet, but—”
“I told you to stay out of the city,” Rand said flatly.
“I found a few men to ask questions for me.” Taim’s tone was dry as dust. “I’ve been no closer than here since I saved you from that Gray Man.”
Rand let that pass. Barely. Almost. The voice in his head was too low to be understood, but cold thunder for that.  That came out with all the contempt he felt—Taim had saved him?—and the man jerked. Outwardly he still appeared at his ease, yet his eyes could have been dark gemstones.
“And if they join with the Red Aes Sedai?” His voice was cool and amused, but his eyes glittered. “There are Red sisters in the countryside. Several parties of them, arrived in the last few days. Trying to intercept men coming here.”

Go away, he said firmly. The fumbling continued, and so did the voice.
 They must serve him. It is plain; they must serve him.
Go away, Rand shouted back silently.  Stretching toward the Source.
Oh, Light, I killed them all. All that I loved. If I kill him, it will be well, though. I can make it up, if I kill him finally. No, nothing can make up, but I must kill him anyway. Kill them all. I must. I must.
No! Rand screamed inside his head. You’re dead, Lews Therin.  You are dead!
Abruptly he realized he was leaning on the table, holding himself up with sagging knees. And muttering, “You are dead! I am alive, and you are dead!” But he had not seized saidin. And neither had Lews Therin. Shivering, he looked at Taim and was surprised to see concern on the man’s face.
“You must hold on,” Taim said softly. “If sanity can be held, you must. The price is too high, if you fail.”
“I won’t fail,” Rand said, pushing himself upright. Lews Therin was silent. There seemed to be nothing in his head but himself. And the feel of Alanna, of course. “Have these Reds taken anyone?
“Not that I have heard.” Taim was watching him cautiously, as if he expected another outburst. “Most of the students come through gateways now, and with all the people on the roads, it cannot be easy to pick out a man heading here unless he talks too freely.” He paused. “They could be disposed of easily enough in any case.”
“No.” Was Lews Therin really gone? He wished it, and knew he would be a fool to believe. “If they start taking men, I’ll have to do something, but as it is, they’re no threat out in the country. And believe me, nobody Elaida sends is likely to join those Aes Sedai in the city. Either lot would probably welcome you before they did each other.”
“What about those who are not in the countryside? Eleven of them? A few accidents could reduce that to a much safer number. If you don’t want to soil your own hands, I am willing to—”
“No! How many times do I have to say, no! If I feel a man channel in Caemlyn, I will come for you, Taim. I swear I will. And don’t think you can stay far enough from the Palace that I won’t feel it and be safe. If one of those Aes Sedai keels over dead for no reason, I will know who to blame. Mark me!”
“You set wide boundaries,” Taim said dryly. “If Sammael or Demandred decides to taunt you with a few dead Aes Sedai on your doorstep, my veins are opened?”
“They haven’t so far, and you had better hope they do not start. Mark me, I say.”
“I hear my Lord Dragon and obey, of course.” The hawk-nosed man bowed slightly. “But I still say eleven is a dangerous number.”
Rand laughed in spite of himself. “Taim, I intend to teach them to dance to my flute.” Light, how long since he had played the flute? Where was his flute? Faintly, he heard Lews Therin chuckling.


Up: Contents
Next: Implementation Information
Previous: An Application Example
This chapter discusses routines for getting and, where appropriate, setting
various parameters that relate to the MPI implementation and the execution environment
(such as error handling).
The procedures for entering and leaving the MPI execution environment are also
described here.
Up: Contents
Next: Implementation Information
Previous: An Application Example
Return to MPI-2.2 Standard Index
Return to MPI Forum Home Page
(Unofficial) MPI-2.2 of September 4, 2009
HTML Generated on September 10, 2009


Prebuffer trivial files into memory, up to the given number of bytes across all uploaded files.
Handy for handling small file uploads (such as user avatars) in an application where file
uploads are not a significant feature.
@member/
Prebuffer trivial files into memory, up to the given number of bytes across all uploaded files.
Handy for handling small file uploads (such as user avatars) in an application where file
uploads are not a significant feature.
@member/


We all have to start somewhere.
"John Sweet is the best new programmer I've ever seen!"
My first Golang program
Expanding my Goland skill set
Building my bootstrap skill set


Zumba's Typography involves two font families with some varying styles.
Sub Headline
Minion Pro | 1.75rem/28px | ItalicSub-sub Headline
Minion Pro | 1.5rem/24px | ItalicBold 1
BrandonText-Bold | 1.25rem/20pxBold 2
BrandonText-Bold | 1rem/16pxRegular body copy looks like this: We take the "work" out of workout, by mixing low-intensity and high-intensity moves for an interval-style, calorie-burning dance fitness party. Once the Latin and World rhythms take over, you'll see why Zumba® Fitness classes are often called exercise in disguise. Super effective? Check. Super fun? Check and check.
BrandonText-Regular | 1rem/16px


MobileMenu is a tiny very customizable jquery plugin for turn any block or menu to look-alike on-canvas menus with submenus.
As demo you can check menu of this site on 619 or lower screen size. Or click link below for more detailed demo
Open MenuYou can download it from here.
Or from project github page https://github.com/sargismarkosyan/MobileMenu
MobileMenu have some options:
menu: false
menu block, it can be used if you want attach block to an existing menu objectmenuOpenIcon: false
menu opener element html codemenuOpenObject: false
element witch mast be clicked for menu opening, if this parameter is set no need for menuOpenIconbody: ''
menu inner html, by default it will get content of selector elementonInit: false
callback after menu is initializedonOpen: false
callback after menu openingonClose: false
callback after menu closingonUlInit: false
plugin recursively check each ul inside block and do some modifications for it, you can add callback for do some changestheme: 'mobilemenu-theme'
this class will be attached in menu block and by default menuOpenIcon itemHere is an example
var menu = $('.menu').mobilemenu({
menuOpenIcon: 'Click to open menu',
body: '
some body
',
onInit: function(menu, options){
console.log(menu);
console.log(options);
},
onOpen: function(menu, options){
console.log(menu);
console.log(options);
},
onClose: function(menu, options){
console.log(menu);
console.log(options);
},
onUlInit: function(ul, index, menu, options){
console.log(ul);
console.log(index);
console.log(menu);
console.log(options);
}
});
menu.openMenu();
MobileMenu return object with functions:
menu
this is menu objectmenuInner
menu inside content objectopenMenu
opening menucloseMenu
closing menuupdateMenu
this will update ul elements, its needs to be called after menuInner modifications


ICO audits based on open-source intelligence and computer forensics
Learn MoreICOcert is a group of serial entrepreneurs, security researchers and experienced developers who believes that cryptocurrencies are here to stay and will disrupt the future in ways never imagined.
The majority of the cryptocurrencies and blockchain-baked projects that are present in the current market were launched as ICO. Their popularity grew over time and so did their number. With respect to the venture capitalists long-established approach, ICO due diligence is significantly harder.
Our mission is to set a standard for ICO assessments with our auditing system that combines information security techniques, open-source intelligence, computer forensics and business risk research in a reliable evaluation.
Get StartedProfessional risk assessment for institutional and private investors
Verification of the model value creation and its plans for growth
English proofreading, plagiarism checks and citation assistance
Deep expertise in auditing Solidity, JavaScript and Python
If you are interested in our services, feel free to contact us.
We will get back to you as soon as possible.


This component integrates a FLUX based React component with Angular 2.0. The treeview supports expanding and collapsing of nodes. Click the "icon" next to the node text to expand or collapse a node.


Athletes window
All clubs
Manchecter United
Barcelona
Name
Age
Email
Rank
Club
John
16
<EMAIL_ADDRESS>Junior
Manchecter united
Maria
18
<EMAIL_ADDRESS>Senior
Barcelona


MORE AND MORE
U N L I M I T E D
TRADE
CONSUMPTION
TRANSPORT
PRODUCTION

BUY A CUSTOM MORE&MORE SWIMSUIT
A PROJECT BY SURYA MATTU, SARAH ROTHBERG, AND MARINA ZURKOW


Gecode::Int::Cumulatives Namespace Reference
Detailed Description
Cumulatives propagatorsThis namespace contains a propagator for the cumulatives constraint as presented in
@inproceedings{DBLP:conf/cp/BeldiceanuC02, author = {Nicolas Beldiceanu and Mats Carlsson}, title = {A New Multi-resource cumulatives Constraint with Negative Heights.}, booktitle = {CP}, year = {2002}, pages = {63-79}, ee = {http://link.springer.de/link/service/series/0558/ bibs/2470/24700063.htm}, crossref = {DBLP:conf/cp/2002}, bibsource = {DBLP, http://dblp.uni-trier.de} } @proceedings{DBLP:conf/cp/2002, editor = {Pascal Van Hentenryck}, title = {Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings}, booktitle = {CP}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2470}, year = {2002}, isbn = {3-540-44120-4}, bibsource = {DBLP, http://dblp.uni-trier.de} }
Classes | |
| class | Event |
| An event collects the information for one evnet for the sweep-line. More... | |
| class | Val |
| Propagator for the cumulatives constraint. More... | |
Enumerations | |
| enum | ev_t { EVENT_CHCK, EVENT_PROF, EVENT_PRUN } |
| Types of events for the sweep-line. More... |
Enumeration Type Documentation


RONIN A film review by Mark R. Leeper
Capsule: A good director, a great lineup of stars, lots of action, explosions, car chases, crashing cars, and flames. But RONIN also has almost no story beyond double crosses and murders. This is a film with minimal characterization. John Frankenheimer gives us a film that is all sizzle and no steak. Rating: 4 (0 to 10), 0 (-4 to +4)
It would be hard to choose the best American political thriller. Some people would probably pick THE MANCHURIAN CANDIDATE and others (myself included) would pick SEVEN DAYS IN MAY. Both those films were tense exercises in chills. The two films came out within two years of each other and both were directed by the same man, John Frankenheimer. But that was 1962 and 1964 respectively. For most of the rest of his career Frankenheimer has turned out some decent films, but has shown little of the promise that those two thrillers showed. Each of those films had memorable characters and a tense plot. They had almost nothing in the way of chases or gunplay. The thrills all came from the plot. RONIN is like a film made by another man. Somewhere behind all the shooting and explosions and car chases there are the rudiments ofa plot, but we see only tiny pieces of it. We get a clue here and one there as to what is going on but J. D. Zeik's screenplay is a bit obscure.
The film begins explaining that a ronin is a masterless samurai. When a samurai has failed in the job of protecting his master from death, he becomes a ronin, much like a gunfighter in the American West. If you miss the opening, do not worry. This film will explain again what a ronin is. Sam (played by Robert De Niro) is the modern equivalent of a ronin. He is a free agent who seems to have really good instincts about how to stay alive the world of a professional killer. He clearly was in a dangerous business at one time and now he seems to be drifting around on his own somewhere in France. Sam is recruited from a Montmartre bar by Dierdre (Natascha McElhone of THE TRUMAN SHOW), an Irish woman, to be part of an action to steal a mysterious metal case. Dierdre is very tight-lipped about what is in the case. Sam joins a team of four others: Vincent (Jean Reno of THE PROFESSIONAL/LEON and MISSION IMPOSSIBLE), Spence (Sean Bean, TV's Richard Sharpe, and also PATRIOT GAMES and GOLDENEYE), and Gregor (Stellan Skarsgard of BREAKING THE WAVES and GOOD WILL HUNTING). Also along is Larry (Skipp Suddeth). The group seems to know their business, particularly Sam, but each is in his own way cold and professional with his own field of expertise. Their only human side seems to be in tensions among the members of the team. The story is not very easy to follow. It is never clear who is double-crossing whom and who is working for whom. Somehow Russians (who may or may not be the Russian Mafia) and Irish radicals are involved trying to get their hands on a certain metal case.
Some very good actors are involved in this film. One wonders what they saw in the script. The characters are mostly one-dimensional professional killers. They know their work, and seeing their thought patterns adds some interest to the film, but for this group deep feeling between two people is teaming up with another killer so that neither is killed. By the end of the film we never really got to know anybody. Maybe that is the secret of why such good actors took parts, since these are not very demanding characters to create. In addition to the above characters the film also features Jonathan Pryce and Michael Lonsdale (the latter of MOONRAKER and of the superior thriller THE DAY OF THE JACKAL).
As a revival of a sort of action film that was popular in the 1960s, I was hoping that there would be something here to grab onto and enjoy. Unfortunately there are no deep characters, and little to make us care who eventually ends up with the metal case or why they want it. I rate RONIN a 4 on the 0 to 10 scale and a 0 on the -4 to +4 scale. NON-SPOILER: Incidentally, the tale of THE 47 RONIN has been filmed multiple times, usually under the title CHUSHINGURA or as THE 47 RONIN. Also one frequently sees in Japanese art the image of a man breaking down a door with a huge mallet. This is the first blow of the 47 Ronin.
Mark R. Leeper<EMAIL_ADDRESS>Copyright 1998 Mark R. Leeper
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Check out: Shah Rukh Khan and Tahira Kashyap's cute banter about who has better hair
by TIMESOFINDIA.COMBollywood actor Ayushmann Khurrana’s wife Tahira Kashyap was recently on Shah Rukh Khan’s talk show. She is one of the toughest fighters and survivors of breast cancer and spoke about the same disease on the show.
Further, elated on sharing the stage with King Khan, Tahira tweeted “Super stoked to be on the stage of #TEDTalksIndiaNayiBaat, Tonight at 9.30pm on @starplus @hotstartweets @NatGeoIndia @starworldindia @TEDTalks @iamsrk The last picture in this series is for keeps! ( also I am giving a tough competition to his lustrous hair)”
Replying to the same, Shah Rukh Khan in his quirky way tweeted “Everything is good! But Baat Baal tak pahunch jai toh mein personally leta hoon....Bala ki Biwi kahin ki!!! Love you.”
Ayushmann Khurrana couldn't help but comment on this fun banter and then he took to his Twitter handle and wrote, “This banter though. Sigh. #SRkian”
Meanwhile, Ayushmann Khurrana’s ‘Bala’ is doing good at the box office. The movie is getting appreciation from both fans and critics.


[gecode-users] Installation : Intel Compiler
Christian Schulte
cschulte at kth.se
Wed May 23 16:29:33 CEST 2007
Dear Simon,
that's tough luck! But we can't help you here as we only can fix bugs in
Gecode ;-)
You need to get in touch with your compiler vendor as this is not a Gecode
bug but an internal error in the Intel C++ compiler (as the message says).
Christian
--
Christian Schulte, http://www.imit.kth.se/~schulte/
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Simon Boivin
Sent: Wednesday, May 23, 2007 3:35 PM
To: users at gecode.org
Cc: Michaël Krajecki; arnaud.renard
Subject: [gecode-users] Installation : Intel Compiler
Hi,
I'm trying to compile Gecode and install it by using the intel
compiler icc and icpc. However, after using ./configure CC=icc CXX=icpc
and using make to create the librairie a have this error :
../gecode/int/distinct/dom.icc(353): internal error: assertion failed:
lower_expr: enk_object_lifetime not at top (shared/edgcpfe/lower_il.c,
line 13663)
return new ViewValGraph(n_view,x,val_inf,n_val,size);
^ compilation
aborted for gecode/int/distinct.cc (code 4)
We use the Intel compiler Version 9.0 and we compile on an Itanium 2
dual core.
Thank!
----------------------------------------
Simon Boivin
École Polytechnique de Montréal
_______________________________________________
Gecode users mailing list
users at gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
More information about the gecode-users
mailing list


{%extends 'base.html'%} {%block content%} {%block styles%} {{block.super}} {%endblock%}
Phone Number: {{profile.Phone}}
Email Address: {{profile.email}}
Bio: {{profile.bio}}
{{project.Title}}
Project by {{project.User.name}}


ADEWILLIAMS & ASSOCIATES 117 ADE ROAD LAGOS NIGERIA. TEL: 234 1 759781 Dear Sir, I am Barrister Ade Williams, a legal Solicitor and I was the Personal Attorney and legal adviser to MR.John Bales , a national of your country, who used to work with Mobil oil Company Nigeria Plc. On the 21st of August 2000, my client,his wife and their three children were involved in a car accident along Sagamu Express Road. All occupants of the vehicle unfortunately lost their lives. Since then I have made several enquiries to your embassy to locate any of my clients extended relatives, this has also proved unsuccessful.After these several unsuccessful attempts, I decided to trace his relatives over the Internet, to locate any member of his family but of no avail, hence I contacted you. I have contacted you to assist in repatriating the money and property left behind by my client before they get confiscated or declared unserviceable by the bank where these huge deposits were lodged. Particularly, the bank where the deceased had a deposit valued at about Ten Million United States Dollars($U.S10,000,000) has issued me a notice to provide the next of kin or have the account confiscated within the next ten official working days. Since I have been unsuccessful in locating the relatives for over two years now. I seek your consent to present you as the next of kin of the deceased Since you are from the same country so that the proceeds of this account valued at Ten Million United States Dollars ($U.S10,000,000) can be paid to you and then you and me can share the money. 65% to me and 25% to you,while 10% should be for expenses or tax as your Government may require, I have all necessary legal documents that can be used to back up any claim we may make. All I require is your honest Cooperation to enable us see this deal through. I guarantee that this will be executed under a legitimate arrangement that will protect you from any breach of the law. Best regards, Barrister Ade Williams KINDLY CALL ME FOR ORAL CLERIFICATION.+234 1 759781 OR REPLY TO<EMAIL_ADDRESS>|


Just Do It!
Discover
Featured Products
$162
Air Jordan XXXV
$90
Air Jordan 1 ’07
$120
Nike Air Force 1 High
$150
Nike Cosmic Unity
Space Hippie
Discover
New Products
$135
Air Jordan 1 Centre Court
$150
KD14
$200
Nike Air VaporMax
Flyknit 3 Exeter Edition
$180
Nike ZoomX Invincible
Run Flyknit