On X, however, there is no standard, so various groups have developed their own protocols, with the result that programs written for one protocol cannot talk to programs written for a different protocol. Clearly this does not satisfy the fundamental requirement that DND allow the user to drag data from any program to any other program.
What is required is a single protocol that everybody can use so all programs can exchange data via DND. (The X Selection mechanism insures that everybody can exchange data via the clipboard.)
The basic requirements for such a protocol are that it provide visual feedback to the user during the drag and that it allow the target to choose whatever data format it prefers from among all the formats that the source can provide. In addition, it must be efficient so that the visual feedback does not lag behind the user's actions, and it must be safe from deadlock, race conditions, and other hazards inherent in asynchronous systems.
Current version: 5
Last updated on April 5, 2003
Comparison to other DND protocols
Supporters of the XDND protocol
The source is the window that will supply the data.
The target is the window that the cursor is on top of and which will receive the drop if the mouse is released.
You should be familiar with the X Selection mechanism described in the Xlib manuals: Volume 0, Appendix L and Volume 1, Chapter 10.
All data types and actions are referred to by their corresponding X Atoms. The atom names of the data types are the corresponding MIME types, in all lower case. (RFC's for MIME: 2045, 2046, 2047, 2048, 2049)
All constants mentioned in this document are the string names of X atoms, capitalized as shown. This avoids the need for hard-coded values, which would require a global registry.
Step 0:
Windows announce that they support the XDND protocol by creating a window property XdndAware.
Step 1:
When a drag begins, the source takes ownership of XdndSelection.
When the mouse enters a window that supports XDND (search for window property: avg 8), the source sends a ClientMessage of type XdndEnter (2) which contains the protocol version to use and the data types supported by the source.
An extension has been developed to allow dropping on other windows.
Step 2:
The target receives XdndEnter.
The ClientMessage only has space for three data types, so if the source supports more than this, the target must retrieve the property XdndTypeList from the source window in order to get the list of available types. (2)
Step 3:
The source sends a ClientMessage of type XdndPosition. (2) This tells the target the position of the mouse and the action that the user requested.
Step 4:
The target receives XdndPosition.
The target window must determine which widget the mouse is in and ask it whether or not it will accept the drop. For efficiency, the target window should keep track of whether or not the widget will accept the drop and only ask again if the action changes or the mouse enters a different part of the widget. Once the widget has said that it will accept the drop and as long as the action remains the same and the mouse remains in the same part, the widget gets all the XdndPosition messages so that it can re-draw itself to show the user where the data will be inserted, if appropriate.
To determine whether or not it can accept the drop, the target widget consults the list of types from the XdndEnter message and the requested action from the XdndPosition message.
If it cannot perform the requested action, it can return either XdndActionCopy or XdndActionPrivate. If neither of these are possible, then it should refuse the drop.
If it needs to look at the data itself, it calls XConvertSelection() for XdndSelection, the data type that it is interested in, and the given time stamp. (7) It can do this more than once, if necessary.
If it can accept the drop, it should hilight its border to notify the user. If it retrieved the data, it should cache it so it does not need to be retrieved again when the actual drop occurs.
Step 5:
The target sends a ClientMessage of type XdndStatus. (2) This tells the source whether or not it will accept the drop, and, if so, what action will be taken. It also includes a rectangle that means "don't send another XdndPosition message until the mouse moves out of here".
Step 6:
The source receives XdndStatus. It can use the action to change the cursor to indicate whether or not the user's requested action will be performed.
When the mouse moves out of the given rectangle, go to Step 3.
XdndPosition messages are normally triggered by MotionNotify events. However, if the mouse moves while the source is waiting for an XdndStatus message, the source has to cache the new mouse position and generate another XdndPosition message as soon as it receives the XdndStatus message. (This will be necessary when the server-target connection is much slower than the server-source connection.)
Step 7:
If the mouse leaves the window, the source sends a ClientMessage of type XdndLeave. (2)
If the mouse button is released in the window, the source waits for the last XdndStatus message (if necessary) and then sends a ClientMessage of type XdndLeave or XdndDrop, depending on the "accept" flag in the last XdndStatus. (2)
If the source never received any XdndStatus messages at all, it should send XdndLeave without waiting.
If the source doesn't receive the expected XdndStatus within a reasonable amount of time, it should send XdndLeave. While waiting for XdndStatus, the source can block, but it must at least process SelectionRequest events so the target can examine the data.
Step 8:
If the target receives XdndLeave, it frees any cached data and forgets the whole incident.
If the target receives XdndDrop and will accept it, it first uses XConvertSelection() to retrieve the data using the given time stamp (if it doesn't already have it cached). (7) It then uses the data in conjunction with the last action and mouse position that was acknowledged via XdndStatus. (Over a slow network, this makes the drop location consistent with the visual feedback given to the user.) Once it is finished, it sends XdndFinished.
If the target receives XdndDrop and will not accept it, it sends XdndFinished and then treats it as XdndLeave.
Every part of this protocol serves a purpose:
In order for the user to be able to transfer data from any application to any other application via DND, every application that supports XDND version N must also support all previous versions (3 to N-1). The XdndAware property provides the highest version number supported by the target (Nt). If the source supports versions up to Ns, then the version that will actually be used is min(Ns,Nt). This is the version sent in the XdndEnter message. It is important to note that XdndAware allows this to be calculated before any messages are actually sent.
The property can also act as an extra filter, because it can contain a list of types accepted by the target, as explained in the Technical Details section.
It is also critical for scrolling (see Notes section below) and for coexisting with other DND protocols (since one can try something else if XdndAware is not present) and is useful for debugging since it lets one check the target's XDND version, after which one can expect to receive an XdndStatus message.
By using XConvertSelection(), one can use the same data conversion code for both the Clipboard and Drag-and-Drop. This is an especially large saving if the target requests the type "MULTIPLE" or if the source is forced to send the data incrementally (type "INCR"). It also makes checking the data independent of the main sequence of messages, so XdndStatus correctly reports "yes" or "no" the first time.
By using XdndSelection, the dropped data doesn't interfere with the clipboard data stored in XA_PRIMARY.
Using XConvertSelection() does have the problem that the user can begin dragging something else before the data transfer is complete. However, the X clipboard has the same problem, so this doesn't impose any additional constraints on the user, and it can be avoided as explained below in the discussion of the XdndFinished message.
Specifying the action separately from the data type allows one to avoid defining N×M atoms for N data types and M actions. Since the user must have full control of what will happen, exactly one action is specified by the source. This is passed in the XdndPosition message to allow it to change during the drag. (e.g. if the user presses or releases modifier keys) The action accepted by the target is passed back in the XdndStatus message to allow the source to provide feedback in the cursor.
The special action XdndActionAsk tells the target that it should ask the user what to do after the drop occurs. This allows one to implement the effect obtained by right-dragging in Windows95®, where the file manager asks the user whether to move, copy, create a link, or cancel. The list of actions is retrieved from the XdndActionList property, and the description of each action that is shown to the user is retrieved from the XdndActionDescription property, both on the source window. Note that the user should be asked before retrieving the data and thus also before sending XdndFinished.
The special action XdndActionPrivate tells the source that the target will do something that the source doesn't understand and that won't require anything from the source other than a copy of the data.
The XdndEnter message initiates the session and gives the target a chance to set up local variables such as the transformation from root window coordinates to target window coordinates. It also provides a list of supported data types so the target doesn't have to call XConvertSelection() for XdndSelection, TARGETS.
The XdndPosition message provides mouse locations so that the target does not have to query the X server in order to redraw itself properly. There is no other reliable way for the target to get the mouse location because X will force the cursor to be grabbed by the source window, so only the source window will be receiving events. The target needs the mouse location because it has to update itself to show where the data will be inserted. This is especially important in text editors, spreadsheets, and file managers.
The time stamp in the XdndPosition message must be passed to XConvertSelection() to insure that the correct data is received.
The XdndStatus message provides feedback to the source (e.g. it might want to change the cursor) and insures that XdndPosition messages do not pile up when the network connection is slow.
The XdndLeave message cancels the session.
The XdndDrop message tells the target to proceed with the drop. The time stamp must be passed to XConvertSelection() to insure that the correct data is received.
The XdndFinished message tells the source that the target is done and no longer needs the data. This allows the source to implement any one of three different behaviors:
When the source receives XdndFinished, it can remove the item from its history, thereby keeping it from getting too large. The source must also be prepared to throw out extremely old data in case a target malfunctions.
If the version number in the XdndEnter message is higher than what the target can support, the target should ignore the source.
While the source and target are receiving XDND messages from each other, they should ignore all XDND messages from other windows.
If either application crashes while DND is active, the other application must avoid crashing on a BadWindow error. The only safe way to do this is to actually catch the error by installing an error handler with XSetErrorHandler(). In addition, the target must also listen for DestroyNotify events so that it doesn't wait forever for another XdndPosition if the source crashes between receiving XdndStatus and sending XdndPosition.
When the source and target are the same, the drop should be hysteretic within a region around the source window. (e.g. a 50 pixel border) The target remains the source as long as the mouse doesn't move into another widget that is willing to accept the drop. This makes it much easier for the user to drop the data on an invisible part of the source because dragging the mouse out onto the root window or a stray xterm will cause the source to scroll. The XdndAware property makes hysteresis possible because the root window, stray xterms, and especially the window border created by the window manager are ignored.
We are collecting examples to show DND might work in various cases. Dragging text is straightforward since there are several well-known formats, including text/plain and text/enriched. Dragging files is at least equally important.
We have also developed extensions that allow dropping on the root window and on windows that do not support XDND.
XdndActionLink only makes sense within a single program or between cooperating programs because the target must obtain not only the data, but also the location of the data. In all other cases, the target should respond with XdndActionCopy or XdndActionPrivate in the XdndStatus message.
On the other hand, XdndActionAsk makes equally good sense between unrelated programs and cooperating programs. However, when the source and target are unrelated, the target may choose to provide a list of actions that it can perform on its own after retrieving the data instead of asking the source for a list of actions.
Remember also that you must debounce the mouse drag. If the user moves the mouse by only a couple of pixels while clicking to select something, then it is far more likely that the user is a bit clumsy than that the user intends to start a drag. A threshold of 3 pixels is typical.
Getting up on my soap box...
In my opinion, programs should not change the cursor during the drag because this provides the user with the most consistent picture. The user is always dragging the same data, regardless of whether or not the current target will accept it. It is the target that should change to show whether or not it will accept the drop.
However, if you want to be Microsoft compliant, you have to change the cursor. As usual, Microsoft got it backwards...
As a side note, on page 253 of his book, About Face, Alan Cooper agrees wholeheartedly.
The single exception that I endorse is adding a small symbol to the cursor to show that the requested action will be performed, instead of XdndActionPrivate. For an example, refer to the page on dragging files.
When the source and target windows are part of the same application, sending X Client Messages is a waste of time and bandwidth, especially if the program and server are on different machines. Implementations should therefore detect the special cases of "source = target" and "source and target in same application" and handle them via function calls.
To avoid calling XConvertSelection() in the above cases:
Targets do not have to retrieve XdndTypeList from the source window if they find what they are looking for in the three types listed in the XdndEnter message.
It is pointless to send XdndPosition messages when the mouse is stationary.
To avoid unnecessary messages from the source to the server, one should only change the cursor when the target or status (acceptance and action) changes.
Unfortunately, one cannot avoid calling XTranslateCoordinates() continuously, because of overlapping windows.
All constants mentioned below are the string names of X atoms, capitalized as shown. This avoids the need for hard-coded values, which would require a global registry.
XdndAware
This window property must be of type XA_ATOM and must contain the highest version number of the protocol supported by the target. (Version numbers start at zero. The maximum version number is 0xFF because there is only one byte allocated for it in the XdndEnter message. At one new version every three months, which is very rapid turnover, this will last 64 years.)
The property must be set on each top-level X window that contains widgets that can accept drops. (new in version 3) The property should not be set on subwindows. The target must dispatch the messages to the appropriate widget. Since window managers often insert extra layers of windows, this requires searching down the subwindow tree using XTranslateCoordinates().
XdndSelection
This is the name of the X Selection that is used when the target wants to examine the data during the drag phase and when it wants to retrieve the data after a drop.
All data types are referred to by their corresponding X Atoms. The atom names are the corresponding MIME types, in all lower case. (RFC's for MIME: 2045, 2046, 2047, 2048, 2049)
For text, the charset attribute can be appended to the MIME type. (e.g. Japanese => text/plain;charset=ISO-2022-JP) If the charset attribute is not specified, it is assumed to be ISO-8859-1. (new in version 4)
Note that any data type may be transferred via the INCR protocol.
XdndTypeList
If the source supports more than 3 data types, this window property must be set on the source window, must be of type XA_ATOM, and must contain a list of all the supported data types.
Actions (new in version 2)
All actions are referred to by their corresponding X Atoms. The predefined actions are
The default is XdndActionCopy, and this is assumed to be the action when using version 0 or 1.
In general, XdndActionMove is implemented by first requesting the data and then the special target DELETE defined in the X Selection protocol. (File managers will obviously just use mv or its equivalent.) DELETE should be sent before XdndFinished.
Refer to the Theory and Notes sections for more information.
XdndActionList (new in version 2)
If the source sends XdndActionAsk, this window property must be set on the source window, must be of type XA_ATOM, and must contain a list of all the supported actions. The first one should be the default so the user doesn't have to change the selection in the radio group too often.
XdndActionDescription (new in version 2)
If the source sends XdndActionAsk, this window property must be set on the source window, must be of type XA_STRING, and must contain a list of ASCII strings separated by NULL's that the target should display when describing the choices to the user. These strings must be in the same order as the atoms in the XdndActionList property.
The option to cancel the operation must always be provided in the dialog displayed to the user, via a Cancel button, but should not be included in XdndActionList.
XdndProxy (new in version 4)
If this window property exists, it must be of type XA_WINDOW and must contain the ID of the proxy window that should be checked for XdndAware and that should receive all the client messages, etc. In order for the proxy window to behave correctly, the appropriate field of the client messages, window or data.l[0], must contain the ID of the window in which the mouse is located, not the proxy window that is receiving the messages. The only place where the proxy window should be used is when checking XdndAware and in the calls to XSendEvent().
The proxy window must have the XdndProxy property set to point to itself. If it doesn't or if the proxy window doesn't exist at all, one should ignore XdndProxy on the assumption that it is left over after a crash.
XdndEnter
Sent from source to target when the mouse enters a window that supports XDND.
If the Source supports more than three data types, bit 0 of data.l[1] is set. This tells the Target to check the property XdndTypeList on the Source window for the list of available types. This property should contain all the available types.
XdndPosition
Sent from source to target to provide mouse location.
XdndStatus
Sent from target to source to provide feedback on whether or not the drop will be accepted, and, if so, what action will be taken.
XdndLeave
Sent from source to target to cancel the drop.
XdndDrop
Sent from source to target to complete the drop.
XdndFinished (new in version 2)
Sent from target to source to indicate that the source can toss the data because the target no longer needs access to it.
(Note: Performing an action other than the one that was accepted with the last XdndStatus message is strongly discouraged because the user expects the action to match the visual feedback that was given based on the XdndStatus messages!)
If you are interested in supporting this protocol, but daunted by having to start from scratch, you can obtain sample C++ code via anonymous ftp. This code may be used under any license.
Paul Sheer has implemented XDND v2 in C as a generic library. The files are xdnd.c and xdnd.h
If you use a different language, please consider donating your code for others to look at.
We also have a binary that you can use to test interoperability between a correct implementation and your implementation.
While implementing this protocol, you may find it very useful to use the programs xlsatoms to list all the atoms that the server knows about, xprop to list all the properties on a particular window, and xscope to study the timing of events.
Even if you implement XDND from scratch, we would appreciate it if your distribution included some sort of documentation that states clearly that you are supporting this protocol and provides a reference to this web page. This will help get the snowball rolling. The more programs that support the same protocol, the more useful Drag-and-Drop will be for the users. If you tell us that you support the protocol, we will also add you to the list of supporters.
Version 5 adds additional information to the XdndFinished message in order to allow the Java DND API to be implemented on top of XDND. (Thanks to Danila A. Sinopalnikov for working out the details.)
Added requirement to File Dragging protocol. The user name must be provided via the new text/x-xdnd-username data type.
November 21, 2000:
Thanks to Daniel Biddle for pointing out that the MIME types should be specified in the format ISO-8859-1, not iso8859-1.
October 26, 2000:
Minor modifications to actions required by File Dragging protocol.
February 22, 2000:
Added additional notes about why the host name must always be included when dragging files.
June 7, 1999:
Version 4 adds XdndProxy window property to support the new protocol for dropping on the root window.Rewrote the protocol for dropping on the root window to conform to the latest implementations.
Added note in Technical Details section about how to specify the character set for text.
Created Direct Save (XDS) protocol layered on top of XDND.
December 1, 1998:
Rewrote the protocol for dropping on the root window to conform to the latest implementations.
September 19, 1998:
The File Dragging protocol now uses the well established text/uri-list instead of url/url.Added note to Optimization section about caching the window stack.
September 7, 1998:
Version 3 changes the way XdndAware is handled. To reduce the number of XTranslateCoordinates() calls to the X server and to make life easier for programs that use multiple X windows per widget, XdndAware must now be placed on the top-level X window, not on subwindows. This change is unfortunately incompatible with previous versions. However, since there are still relatively few programs that have been released with XDND support, the specification has simply been adjusted so XDND compliance only requires supporting version 3 and up. (This will never happen again!)In addition, Jeroen van der Zijp has invented an extension that allows dropping onto windows that do not support XDND, and Arnt Gulbrandsen has developed a way to drop on the root window.
August 17, 1998:
Version 2 adds the following features:With these new features, the File Dragging protocol becomes much simpler.
- The concept of an action. Previously, only copy was supported. Now, the source can specify any action, and the target can either accept it or fall back on copy or private. The predefined actions are XdndActionCopy (the default), XdndActionMove, XdndActionLink, XdndActionAsk, and XdndActionPrivate. Ask tells the target to get a list of acceptable actions from the source's XdndActionList and XdndActionDescription window properties and then ask the user which one to perform.
- The target is required to send XdndFinished. (Yes, I caved in :) However, if the source blocks, it must be prepared to time out in case the target is malfunctioning. Ideally, the source will not need to block because it will keep a history of past selections. The timestamp in XdndDrop allows the source to safely avoid both blocking and keeping a history by simply rejecting outdated requests.
Part of the reason for adding XdndFinished is that this allows XDND to be used with higher level API's (e.g. JavaBeans) that require notification of the end of the operation.
Added page of supporters.
February 25, 1998:
Added examples of how XDND fits into the larger picture of cooperating applications.
February 24, 1998:
Added trashcan discussion to the File Dragging protocol.
February 2, 1998:
Version 0 has a hole. If the user begins a second drag from the same source before the data has been transferred to the first target (over a really slow network, obviously), then the first target may get the wrong data. Thanks to Donal K. Fellows for pointing this out.Version 1 fixes this by adding a time stamp to XdndPosition and XdndDrop which must be used when requesting the data. This way, if the user quickly begins a second drag, the first target will at least get no data instead of the wrong data.
Please refer to the Theory section for a more complete discussion and the reasons why this was not fixed by adding a "drop finished" message.
January 28, 1998:
Added comparison to Xde.
This protocol was developed by John Lindal at New Planet Software, with help from Glenn Bach and lots of feedback from Arnt Gulbrandsen at Troll Tech and Owen Taylor of GTK+ and input from Elliot Lee at Red Hat Software.


16-bit 32kHz Alarm component as per TEP102 HAL guidelines. The mica family 32kHz Alarm is built on hardware timer 1, and actually runs at CPU frequency / 256. You can use the MeasureClockC.cyclesPerJiffy() command to figure out the exact frequency.
Assumes an ~8MHz CPU clock, replace this component if you are running at a radically different frequency.
Upto three of these alarms can be created (one per hardware compare register).


REWINDDIR
Section: Linux Programmer's Manual (3)
Updated: 2013-09-02
Index
Return to Main Contents
NAME
rewinddir - reset directory stream
SYNOPSIS
#include <sys/types.h>
#include <dirent.h>
void rewinddir(DIR *dirp);
DESCRIPTION
The
rewinddir()
function resets the position of the directory
stream
dirp
to the beginning of the directory.
RETURN VALUE
The
rewinddir()
function returns no value.
ATTRIBUTES
Multithreading (see pthreads(7))
The
rewinddir()
function is thread-safe.
CONFORMING TO
SVr4, 4.3BSD, POSIX.1-2001.
SEE ALSO
closedir(3),
opendir(3),
readdir(3),
scandir(3),
seekdir(3),
telldir(3)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- ATTRIBUTES
-
- Multithreading (see pthreads(7))
-
- CONFORMING TO
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:54:58 GMT, September 18, 2014


Brands That Trust US
How brands leverage these insights
"Gain actionable understanding on what drives customers' buying decisions from every comment/review/question/feedback they share anywhere on the web Understand The ‘WHY’ Behind The ‘WHAT’ Instantly gain actionable and competitive insights generated by our industry-leading AI, without the involvement of IT, market experts, or lengthy projects."
Product Perception
"Analyze every verbatim customer comment/feedback to uncover SKU and category level issues and compliments that matter the most to customers".
Purchase Drivers
"Quickly understand why customers buy your products, how they use them and features that resonate most with them".
a
Competitive Standing
"Scan the entire market to discover competing products, why customers buy/not buy them and how your products stack up against them".
a
Testimonials
Sridhar Nallani
CTO, Old Navy
This tool plays a major part in understanding the current state and where to invest and improve for all of our functions! It stacks high in time to market and capabilities.
Shaz Kahng
CEO, Gymboree
Heystack has very efficiently streamlined our quarterly analysis of newly launched products to uncover the top reasons for underperforming categories across the entire organization.
Jenny Ming
CEO, Charlotte Russe
We decided to implement Heystack as soon as it showed one to one mapping in the product quality issues we were seeing working with with an outside agency in real time and at a fraction of the cost.
Technologies
Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque
Clients
Projects
Hours Of Support
Hard Workers
Retail Partners
See it in action
Let us show you a 360 degree view of customers' perception of your products


Joel
Greetings! My name is Joel Epstein and I am a programming student at Code Fellows. In this episode of our coding adventure, we created a Tour Seattle page that will guide both local and foreign visitors around Seattle. Dubbed as the Emerald City, Seattle has no shortage of lush evergreen forests that brought in diverse demographics from all over the world. This influx of immigrants opened up doors to diverse cultures and cuisines in Seattle. With over hundreds of restaurants to choose from, this page will serve as a useful tool for the avid foodie to navigate through Seattle's food scene. My favorite food is carne asada tacos.
Dalton
Hello and welcome to our site! My name is Dalton Carr. I am currently enrolled at Codefellows to work torwards my certificate in Full-stack Javascript. Im from Las Vegas, Nevada originally so this project was perfect because I also got to learn about a ton of awesome grub spots! We created this site to help tourist or even locals find the perfect restaurant based on what they feel like eating that day.  I can't wait to try them all! My favorite so far is Mamma Melina's in the U-district
Thao
Hello there! I am Hanh-Thao Luu, a programming student at Code Fellows. We came up with the idea of the Seattle Tour Game in hope of guiding others who are unfamiliar with Seattle’s gems. Living in Seattle, besides the majestic mountains and beautiful bodies of water, we are blessed with many delicious dishes from diverse cultures.  For the time sake of this project, it's not possible to have all the restaurants listed on our webpage. For my part, I hand-picked some of the asian restaurants that I would recommend. My favorite restaurant is Bamboo Garden. Bon appétit!
James
Greetings! My name is Albert Portune but i go by James. I came from an IT background and wanted a change so I became a student at Codefellows. I spent 6 year in the Marine Corps as a Server Administrator working with hardware and setting up operation centers as fun as that is I found software development way more interesting and fun so I made a move to become a software developer. I love food and love cooking food too, so our project idea from Thao is perfect for me as a foodie and as someone who does not know Seattle well. My favorite place that i have tried thus far is Salvatore Ristorante Italiano and my favorite dish is Baked Ziti.


BREAKING: Court grants Maina N1bn bail - The Nation Newspaper
by https://www.facebook.com/CheerfulpraiseA Federal High Court sitting in Abuja on Monday granted bail to the former chairman of the defunct pension reform task team Mr. Abdulrasheed Maina in the sum of one billion naira with two sureties in like sum.
Details shortly…


Salmon Cookies Sales Data
New Store Submission Form
Store name:
Minimum hourly customers:
Maximum hourly customers:
Average cookies purchased per customer:
Change Operating Hours
All single-digit hours must be preceded by '0' (e.g. '08am', '01pm')
Opening hour:
Closing hour:
Daily Sales Data


Soldier Orbyu:
Please hurry! Take the documents you recovered from Researcher Medibal to War Mage Artius.


Many social media sites offer sharing widgets that websites can embed on their webpages. However, embedding JavaScript from multiple 3rd-party sites can cause a number of issues.
With the Social Share plugin, we've attempted to address the above issues. Social Share has consistent design, multiple layout options, and loads and renders quickly. If you are displaying share counts, the widget is rendered first, the counts are retrieved asynchronously, and the count is updated when it is successfully retrieved.
The Social Share widget currently supports 5 social networks: Twitter, Facebook, LinkedIn, Reddit, and Pinterest. More networks may become available in the future, but we will limit expansion to the more popular networks.
In particular, we will be looking at adding support Google Plus and StumbleUpon in future versions. However, we have had some technical challenges with the StumbleUpon API and the Google Plus button does not yet have an offical API.
Default usage of the Social Share plugin is extremely simple: just add the class
socialShare
to any
element. By default, a horizontal button
list with buttons and share counts for Facebook, Twitter, LinkedIn, Reddit, and Pinterest will be
injected into the element. If no URL is provided, the URL defaults to the current page.

Social Share has multiple options that allow you to customize the number and order of the social networks used, whether or not to show the share count, the layout of the buttons, and what style of button should be displayed.
All options are passed in as an HTML5 data-
attribute and none of them are required.
| Option | Description |
|---|---|
data-url |
The URL of the page to be shared and for which counts should be retrieved. Defaults to the current page. |
data-text |
The text to be auto-filled on network submissions. Defaults to the current page title. |
data-networks |
An comma-separated ordered list of networks to be displayed. Options include: facebook, twitter, linkedin, reddit, and pinterest. Defaults to all networks. |
data-showCount |
A boolean value on whether or not to show the share count. Defaults to true. |
data-countSize |
Determines if the count widget should be small and inline or large. Options are small and large. Defaults to small. |
data-orientation |
Controls the layout of the widget list. Options are horizontal and vertical. Defaults to horizontal. |
Below are demos of the different configurations that can be used with the Social Share plugin. Example code is provided for each demo.

VM UI Framework is created, owned, maintained by Virtuosi Media, Inc. © 2012-2013.


Sorry!
Your input file(s) is/are illegal, please check again! Job ID: {$vcode}
Requirements for RNA-Seq Data:
- The url must be a direct download link (no redirection, no authorization...);
- Seq files should be compressed by gzip;
- Each seq file should be less than 5 Gb.
Required columns of the file containing the list of editing sites:
- Column 1 (Region): The name of the chromosome or scaffold
- Column 2 (Position): The starting position of the SNV in the chromosome or scaffold (1-based)
- Column 3 (Strand): Strand (+/1 or -/0)
This file should be less than 10 MB.
If you need help please contact us at<EMAIL_ADDRESS>Your RNA Editing Plus Team


Hi, my emonTx+nanode have been sending data to emoncms.org for about 2 weeks now (also see http://lantaukwcounter.blogspot.hk/), and i have a couple of problems:
1. there seems to be a problem at the moment with the hh:mm display, i see only "h:" instead of real hours, also on example dashboards of Trystan http://emoncms.org/trystan/solarpv - maybe a bug introduced by v5? (EDIT: this seems to happen only on my chromebook and my android phone, laptop windows/chrome shows hours correctly)
2. my posting frequency sometimes goes down dramatically; i suspect it to be a problem of my internet connection, or can you confirm that the emoncms.org server is sometimes unreachable for several minutes? e.g. early morning (UK time) of 12 April, i also see some infrequent data points in Trystan's example dashboard (after some guess work as i only see "h:" at the moment). is there a place where such problems get reported?
it introduces large errors in my kWh data, see http://lantaukwcounter.blogspot.hk/2013/04/first-comparison-with-electricity-meter.html
3. my multigraph on http://emoncms.org/tomtobback/3phases always shows up with old data, i have to hit e.g. the D button to get the most recent 24hrs - how to fix this?
4. in the simplezoom vis, when i click on a bar i get the power graph for one day, starting 8:00 until 20:00, maybe because of my timezone GMT+8? how to fix this?
5. due to issue 2 i had a large error in my kWh histogram. strangely the kWh/day data seems correct, so i have 2 different values for kWh in that day (9 April) see http://emoncms.org/tomtobback/dailyconsu and i cannot manually edit the histogram data, it does not show up in the edit vis; is there a way to fix this?
Additionally, i have a couple of suggestions maybe for future versions:
-optional log scale on dial; my power is usually around 200W with peaks up to 15kW, if i set the max dial to 5kW, it does not report numbers over 5kW; it could just hit the extreme red while continuing to show increasing values
-when zooming in to hour-minute level, the day info is lost; it would be nice to have a rollover feature on the hh:mm that shows the full time data (day, hour, timezone?)
-the data text in the graphs is quite large, e.g. in the simplezoom vis, it overlaps and disables some buttons and makes it impossible to switch back from power to kWh/d view, also on http://emoncms.org/trystan/solarpv (at least in chrome)
I have to add that in general i am extremely happy with this cloud solution! Thanks a lot for any feedback on the above 5 issues-
Tom
Re: emoncms.org server, known issues?
Hello tomtobback
1. I dont see exactly what you see in the screenshot but there does seem to be something a little strange with some of the tick missing on the time axis with a change I made yesterday where I upgraded emoncms to use the latest stable version of the flotcharts library, Il have to look into it more.
2. Looking at your graph, if you experienced the issue at 7:10 to 7:30 and your 8 hours ahead then that would in fact coincide with a server issue that appears for me at 23:30 April 11 to 01:00 April 12 (BST). The server was under really very high load which would have made it sluggish at best, probably unresponsive. The cause of the slow down at that point Im not sure. There have been 4 such events since march 15th. So that would explain what you saw I think. But generally apart from those spikes, the server has been really stable with a load of around 0.5-0.7 which means it's been generally quite responsive.
I want to add a simple fix that will sort out the issue that downtime at any point along the line whether local internet or emoncms causes to kwh/d feeds and also histogram feeds. Only to add a kwh increment if the last datapoint is less than a couple of minutes away. There is a danger that this may end up reporting values that are lower than what they should be but from some tests here on my local machine it got rid of those large spikes in kwhd.
3. The Multigraph time window bug is an ongoing issue that I need to turn my attention too. Did putting a tick in the floating time box work for you?
4. Il have to look at this, I can confirm the bug here with BST +1
5. An editor for histogram is needed, I was faced with exactly the same problem yesterday and started to thing about an editor for histogram feeds, unfortunately its quite a bit more complicated to implement than the kwhd editor. I think we need either an editor for histogram feeds or to implement the fix that would the problem coming up in the first place and then recompile the older histogram data from the power feed. Anyway Ive got this high up on the list of things to fix.
Trystan
Re: emoncms.org server, known issues?
I'm also getting the problem with the time stamp on axis since the upgrade, gets worse when pushing one of the change buttons.
not a big problem but thought I'd confirm it on another feed also using emoncms.org
tailzer
Re: emoncms.org server, known issues?
Tristan, thanks a lot for your feedback.
1) seems solved now, thanks.
2) I notice I had another posting problem last night 22:00 to 7:00 (that's 17 April 15:00 to midnight for you), adding a virtual 10kWh to my kWh and kWh/d feed. Maybe this time it was just on my side. I agree with your proposed fix that in the absence of data values it is better to report zero than to continue with the last value.
Based on this 10kWh I have to conclude that my kWh/d are not calculated midnight to midnight, but rather 8:00 to 8:00 as in issue (4) - timezone.
3) ticking the floating time checkbox seems to have solved it now, thanks.
Tom


I have reconciled the detail file on these and no other ETS company is picking up the costs. I will be sending a detailed list of the companies to receive restricted stock with the final allocations on Wednesday.
Dawn
-----Original Message-----
From: Geaccone, Tracy
Sent: Monday, September 10, 2001 2:01 PM
To: Derr, Dawn
Cc: Botello, Mary
Subject: FW: 2002 Corporate Allocations - Revision #1
These companies have 200-300 people on them each, I hope no other ETS company is picking up their share! Please let me know.
Thanks
Tracy
-----Original Message-----
From: Botello, Mary
Sent: Monday, September 10, 2001 11:52 AM
To: Concklin, Elaine
Cc: Geaccone, Tracy
Subject: RE: 2002 Corporate Allocations - Revision #1
Elaine,
This is the response we received from Corp. on allocations to 1202 and 1195.
Mary,
Other than possibly benefit items, we won't allocate to those companies individually. I am getting a copy of the Restricted stock allocations and they may have some charges to these companies. I suspect that any charges to these two are in the ETS-HQ line but will work with Sharon Aulds to confirm.
Dawn
-----Original Message-----
From: Geaccone, Tracy
Sent: Monday, September 10, 2001 10:23 AM
To: Botello, Mary
Subject: FW: 2002 Corporate Allocations - Revision #1
Check with Dawn on these companies. If they don't have employees, the probably won't have Corp Charges.
-----Original Message-----
From:
Sent: Monday, September 10, 2001 10:10 AM
To: Geaccone, Tracy
Subject: FW: 2002 Corporate Allocations - Revision #1
None of my companies (1202, 42P, 1195, 184) are listed in this spreadsheet. What do I need to include in my Function? Are you going to send me a portion of the ETS HQ? It may make more sense to take those straight to the pipelines rather that flow them through 1202. Please let me know what you want to do.
Thanks, Elaine
-----Original Message-----
From: Geaccone, Tracy
Sent: Sunday, September 09, 2001 9:05 AM
To: Botello, Mary; Keiser, John; Perchal, Cheryl; Maddox, Lori; Concklin, Elaine; Giles, Valerie; Lindholm, Tod A.
Subject: FW: 2002 Corporate Allocations - Revision #1
fyi
-----Original Message-----
From: Derr, Dawn
Sent: Friday, September 07, 2001 5:28 PM
To: Geaccone, Tracy; Killen, Faith; Lee, Dana; Massey, Rachel; Smith, Kirk; Wood, Stephen; Copeland, Erin; Selzer, Howard; Pritt, Deborah; Stevens, Kirk; Schwertner, Brian; Galvan, Michael S.; Roper, Kerry; Myers, Thomas; Smith, Jeff E.; Ueckert, Allen W.; Tran, Agatha; Kaster, Mei-Ling
Cc: West, Terry
Subject: 2002 Corporate Allocations - Revision #1
Attached is the revised Corporate Allocation worksheet. Corporate cost center budgets will be reviewed with senior management on Tuesday, Sept. 11. We do not expect significant changes to the allocations, and any additional changes will be communicated to you for inclusion in your business unit's plan.
Please let me know if you have any questions.
Dawn
713-853-7775
<< File: Corp_2002_Alloc_2.xls >>
***********
EDRM Enron Email Data Set has been produced in EML, PST and NSF format by ZL Technologies, Inc. This Data Set is licensed under a Creative Commons Attribution 3.0 United States License <http://creativecommons.org/licenses/by/3.0/us/> . To provide attribution, please cite to "ZL Technologies, Inc. (http://www.zlti.com)."
***********
California


The Story of Doctor Dolittle
by Hugh Lofting
Chapter 7: The Bridge of Apes
Additional Information
- Year Published: 1920
- Language: English
- Country of Origin: England
- Source: Lofting, H. (1920). The Story of Doctor Dolittle . New York, NY: Frederick A. Stokes
-
Readability:
- Flesch–Kincaid Level: 4.2
- Word Count: 1,755
- Genre: Fantasy
- Keywords: adventure, helping others
- ✎ Cite This
Downloads
Queen Ermintrude had never in her life seen her husband so terrible as he got that night. He gnashed his teeth with rage.  He threw his tooth–brush at the palace cat. He rushed round in his night–shirt and woke up all his army and sent them into the jungle to catch the Doctor. Then he made all his servants go too—his cooks and his gardeners and his barber and Prince Bumpo's tutor—even the Queen, who was tired from dancing in a pair of tight shoes, was packed off to help the soldiers in their search.
All this time the Doctor and his animals were running through the forest towards the Land of the Monkeys as fast as they could go.
Gub–Gub, with his short legs, soon got tired; and the Doctor had to carry him—which made it pretty hard when they had the trunk and the hand–bag with them as well.
The King of the Jolliginki thought it would be easy for his army to find them, because the Doctor was in a strange land and would not know his way. But he was wrong; because the monkey, Chee–Chee, knew all the paths through the jungle—better even than the King's men did. And he led the Doctor and his pets to the very thickest part of the forest—a place where no man had ever been before—and hid them all in a big hollow tree between high rocks.
"We had better wait here," said Chee–Chee, "till the soldiers have gone back to bed. Then we can go on into the Land of the Monkeys."
So there they stayed the whole night through.
They often heard the King's men searching and talking in the jungle round about. But they were quite safe, for no one knew of that hiding–place but Chee–Chee—not even the other monkeys.
At last, when daylight began to come through the thick leaves overhead, they heard Queen Ermintrude saying in a very tired voice that it was no use looking any more—that they might as well go back and get some sleep.
As soon as the soldiers had all gone home, Chee–Chee brought the Doctor and his animals out of the hiding–place and they set off for the Land of the Monkeys.
It was a long, long way; and they often got very tired—especially Gub–Gub. But when he cried they gave him milk out of the cocoanuts which he was very fond of.
They always had plenty to eat and drink; because Chee–Chee and Polynesia knew all the different kinds of fruits and vegetables that grow in the jungle, and where to find them—like dates and figs and ground–nuts and ginger and yams. They used to make their lemonade out of the juice of wild oranges, sweetened with honey which they got from the bees' nests in hollow trees. No matter what it was they asked for, Chee–Chee and Polynesia always seemed to be able to get it for them—or something like it. They even got the Doctor some tobacco one day, when he had finished what he had brought with him and wanted to smoke.
At night they slept in tents made of palm–leaves, on thick, soft beds of dried grass. And after a while they got used to walking such a lot and did not get so tired and enjoyed the life of travel very much.
But they were always glad when the night came and they stopped for their resting–time. Then the Doctor used to make a little fire of sticks; and after they had had their supper, they would sit round it in a ring, listening to Polynesia singing songs about the sea, or to Chee–Chee telling stories of the jungle.
And many of the tales that Chee–Chee told were very interesting. Because although the monkeys had no history–books of their own before Doctor Dolittle came to write them for them, they remember everything that happens by telling stories to their children. And Chee–Chee spoke of many things his grandmother had told him—tales of long, long, long ago, before Noah and the Flood—of the days when men dressed in bear–skins and lived in holes in the rock and ate their mutton raw, because they did not know what cooking was—having never seen a fire. And he told them of the Great Mammoths and Lizards, as long as a train, that wandered over the mountains in those times, nibbling from the tree–tops. And often they got so interested listening, that when he had finished they found their fire had gone right out; and they had to scurry round to get more sticks and build a new one.
Now when the King's army had gone back and told the King that they couldn't find the Doctor, the King sent them out again and told them they must stay in the jungle till they caught him. So all this time, while the Doctor and his animals were going along towards the Land of the Monkeys, thinking themselves quite safe, they were still being followed by the King's men. If Chee–Chee had known this, he would most likely have hidden them again. But he didn't know it.
One day Chee–Chee climbed up a high rock and looked out over the tree–tops. And when he came down he said they were now quite close to the Land of the Monkeys and would soon be there.
And that same evening, sure enough, they saw Chee–Chee's cousin and a lot of other monkeys, who had not yet got sick, sitting in the trees by the edge of a swamp, looking and waiting for them. And when they saw the famous doctor really come, these monkeys made a tremendous noise, cheering and waving leaves and swinging out of the branches to greet him.
They wanted to carry his bag and his trunk and everything he had—and one of the bigger ones even carried Gub–Gub who had got tired again. Then two of them rushed on in front to tell the sick monkeys that the great doctor had come at last.
But the King's men, who were still following, had heard the noise of the monkeys cheering; and they at last knew where the Doctor was, and hastened on to catch him.
The big monkey carrying Gub–Gub was coming along behind slowly, and he saw the Captain of the army sneaking through the trees. So he hurried after the Doctor and told him to run.
Then they all ran harder than they had ever run in their lives; and the King's men, coming after them, began to run too; and the Captain ran hardest of all.
Then the Doctor tripped over his medicine–bag and fell down in the mud, and the Captain thought he would surely catch him this time.
But the Captain had very long ears—though his hair was very short. And as he sprang forward to take hold of the Doctor, one of his ears caught fast in a tree; and the rest of the army had to stop and help him.
By this time the Doctor had picked himself up, and on they went again, running and running. And Chee–Chee shouted,
"It's all right! We haven't far to go now!"
But before they could get into the Land of the Monkeys, they came to a steep cliff with a river flowing below. This was the end of the Kingdom of Jolliginki; and the Land of the Monkeys was on the other side—across the river.
And Jip, the dog, looked down over the edge of the steep, steep cliff and said,
"Golly! How are we ever going to get across?"
"Oh, dear!" said Gub–Gub. "The King's men are quite close now—Look at them! I am afraid we are going to be taken back to prison again." And he began to weep.
But the big monkey who was carrying the pig dropped him on the ground and cried out to the other monkeys.
"Boys—a bridge! Quick!—Make a bridge! We've only a minute to do it. They've got the Captain loose, and he's coming on like a deer. Get lively! A bridge! A bridge!"
The Doctor began to wonder what they were going to make a bridge out of, and he gazed around to see if they had any boards hidden any place.
But when he looked back at the cliff, there, hanging across the river, was a bridge all ready for him—made of living monkeys! For while his back was turned, the monkeys—quick as a flash—had made themselves into a bridge, just by holding hands and feet.
And the big one shouted to the Doctor, "Walk over! Walk over—all of you—hurry!"
Gub–Gub was a bit scared, walking on such a narrow bridge at that dizzy height above the river. But he got over all right; and so did all of them.
John Dolittle was the last to cross. And just as he was getting to the other side, the King's men came rushing up to the edge of the cliff.
Then they shook their fists and yelled with rage. For they saw they were too late. The Doctor and all his animals were safe in the Land of the Monkeys and the bridge was pulled across to the other side.
Then Chee–Chee turned to the Doctor and said,
"Many great explorers and gray–bearded naturalists have lain long weeks hidden in the jungle waiting to see the monkeys do that trick. But we never let a white man get a glimpse of it before. You are the first to see the famous 'Bridge of Apes.'"
And the Doctor felt very pleased.


XYZZY
问题描述 :
It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment on the Y-Crate. Your job is to test a number of these designs to see which are winnable.
Each game consists of a set of up to 100 rooms. One of the rooms is the start and one of the rooms is the finish. Each room has an energy value between -100 and +100. One-way doorways interconnect pairs of rooms.The player begins in the start room with 100 energy points. She may pass through any doorway that connects the room she is in to another room, thus entering the other room. The energy value of this room is added to the player’s energy. This process continues until she wins by entering the finish room or dies by running out of energy (or quits in frustration). During her adventure the player may enter the same room several times, receiving its energy each time.
Each game consists of a set of up to 100 rooms. One of the rooms is the start and one of the rooms is the finish. Each room has an energy value between -100 and +100. One-way doorways interconnect pairs of rooms.The player begins in the start room with 100 energy points. She may pass through any doorway that connects the room she is in to another room, thus entering the other room. The energy value of this room is added to the player’s energy. This process continues until she wins by entering the finish room or dies by running out of energy (or quits in frustration). During her adventure the player may enter the same room several times, receiving its energy each time.
输入:
The input consists of several test cases. Each test case begins with n, the number of rooms. The rooms are numbered from 1 (the start room) to n (the finish room). Input for the n rooms follows. The input for each room consists of one or more lines containing:the energy value for room i
the number of doorways leaving room i
a list of the rooms that are reachable by the doorways leaving room i
The start and finish rooms will always have enery level 0. A line containing -1 follows the last test case.
the number of doorways leaving room i
a list of the rooms that are reachable by the doorways leaving room i
The start and finish rooms will always have enery level 0. A line containing -1 follows the last test case.
输出:
In one line for each case, output “winnable” if it is possible for the player to win, otherwise output “hopeless”.
样例输入:
5 0 1 2 -60 1 3 -60 1 4 20 1 5 0 0 5 0 1 2 20 1 3 -60 1 4 -60 1 5 0 0 5 0 1 2 21 1 3 -60 1 4 -60 1 5 0 0 5 0 1 2 20 2 1 3 -60 1 4 -60 1 5 0 0 -1
样例输出:
hopeless hopeless winnable winnable
这道题纠结了俩小时，总觉得网上的解法存在点问题(也可能是我自己理解的问题)，不存在环的情况自然不用说，就是求最长路，对于存在环时候的情况，有一种说法是只要存在正环，直接判断1到n是否连通即可，还有一种说法是找到正环以后，从发现正环的点出发dfs看是否和n连通，如果是就可以到达，不是就直接不可以到达，我感觉不太对，比较支持某位前辈的说法，找到所有的正环，然后判断能否到达n，但是最近比较懒…鉴于这种方法实现比较复杂，最后还是用了个偷懒的方法><
先做一次n-1次循环的Bellman-Ford，因为前面做了n-1次操作，所以后面松弛操作成功的点有两种情况。1.该点本身在正环中，2.该点本身不在正环中，但是和正环连通。然后可以做无限次松弛操作，player在此点可获得的最大能量值赋值为INF，然后把该位置可获得能量值改成负数(如果该点在环中，就相当于去掉了环，不在环中也不影响结果)，直到某次循环没有松弛操作则跳出。
现在只需要检查player在n点的最大能量值的正负就可以直到结果了。
#include<iostream> #include<vector> #include<queue> using namespace std; #define INF<PHONE_NUMBER> vector<int>road[120]; int dis[120],va[120],mark[120]; int main() { int n,num,i,j,k,e; while(scanf("%d",&n)!=EOF) { if(n==-1) break; for(i=1;i<=n;i++) { road[i].clear(); dis[i]=0; mark[i]=0; } dis[1]=100; for(i=1;i<=n;i++) { scanf("%d%d",&va[i],&num); while(num--) { scanf("%d",&e); road[i].push_back(e); } } mark[1]=1; int flag=1; for(i=1;i<n;i++) { flag=0; for(j=1;j<=n;j++) { if(!mark[j]) continue; int size=road[j].size(); for(k=0;k<size;k++) { int e=road[j][k]; if(dis[j]+va[e]>dis[e]) { flag=1; dis[e]=dis[j]+va[e]; mark[e]=1; } } } if(!flag) break; } while(1) { flag=0; for(j=1;j<=n;j++) { if(!mark[j]) continue; int size=road[j].size(); for(k=0;k<size;k++) { int e=road[j][k]; if(dis[j]+va[e]>dis[e]) { flag=1; dis[e]=INF; mark[e]=1; va[e]=-100; } } } if(!flag) break; } if(dis[n]>0) printf("winnable\n"); else printf("hopeless\n"); } return 0; }
解题报告转自：http://www.cnblogs.com/SolarWings/archive/2013/03/16/2963961.html
(adsbygoogle = window.adsbygoogle || []).push({});
<EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS><EMAIL_ADDRESS>真心不错，力顶作者
为什么暴力求解方法循环到sqrt(n) 就可以了呢
什么破题，题意好难懂啊
不是有公式吗？何不直接计算
能不能说一下tmp数组和solve都是干嘛的？
DFS方法的原理还是不太清楚啊
不错，感谢分享。
能不能说一下tmp数组和solve都是干嘛的？
方法二可行，已测试
http://blog.csdn.net/alpc_paul/article/details/33769407
这个也是算法导论的习题
bottes vernies blanches
I appreciate the efforts you men and women place in to share blogs on such sort of matters, it was certainly useful. Keep Posting!
说的就是无向图啊，有向图的算法也是类似的


Detect Twig token tags which are marked as deprecated via PhpClass
Deprecation inspection for Twig token tags


Additional remarks for WorkflowList.SalesCycleProcessRelatedMode
If set to True for this property and only display requests related to sales cycle processes (opportunity)


EventWorkerFactory
EventWorkerFactory is a simple Factory to create EventWorker instances
Example:
const amqpWorker = EventWorkerFactory.getWorker('amqp',config);
Static Member Summary
| Static Public Members | ||
| public static get |
A basic list of the supported workers |
Static Method Summary
| Static Public Methods | ||
| public static |
getWorker(workerType: String, workerOptions: Object): EventWorker Create and returns a Worker based on the worker type and configuration options |
Static Public Members
Static Public Methods
public static getWorker(workerType: String, workerOptions: Object): EventWorker source
Create and returns a Worker based on the worker type and configuration options
Throw:
* |
Error if a workerType is unsupported |


CIST 1510 Case Projects |
|||
Chapter 01 |
Chapter 02 |
Chapter 03 |
Chapter 04 |
Chapter 05 |
Chapter 06 |
Chapter 07 |
Chapter 08 |
Chapter 09 |
Chapter 10 |
Chapter 11 |
Chapter 12 |
Chapter 13 |
Chapter 14 |
Chapter 15 |
Chapter 16 |
CIST 1510 Extra Credit |
||
ImageMap |
Tables |
Gallery |
CIST 1510 Class Assignments |
Flowers |
CIST 1510 Summative Projects |
|
Midterm |
Final |


States
Default
Indeterminate
Disabled
Disabled (checked)
Vertical
Overrides
Custom Active Color
XS
XL
Length
Track Padding
Stacked Label
On
Off
Size & Colors & Position


Fred2.CleavagePrediction package¶
Submodules¶
Fred2.CleavagePrediction.External module¶
-
class
Fred2.CleavagePrediction.External.
NetChop_3_1
[source]¶ Bases:
Fred2.Core.Base.ACleavageSitePrediction
,Fred2.Core.Base.AExternal
Implements NetChop Cleavage Site Prediction (v. 3.1)
-
cleavagePos
¶
-
command
¶
-
name
¶
-
supportedLength
¶
-
version
¶
-
Fred2.CleavagePrediction.PSSM module¶
-
class
Fred2.CleavagePrediction.PSSM.
APSSMCleavageFragmentPredictor
[source]¶ Bases:
Fred2.Core.Base.ACleavageFragmentPrediction
Abstract base class for PSSM predictions.
This implementation only supports cleavage fragment prediction not site prediction
Implements predict functionality
-
predict
(peptides, **kwargs)[source]¶ Takes peptides plus their trailing C and N-terminal residues to predict the probability that this 9mer was produced by proteasomal cleavage. It returns the score and the peptide sequence in a AResult object. Row-IDs are the peitopes column is the prediction score.
Parameters: - _aa_seq –
- kwargs –
Returns:
-
trailingN
¶ returns the number of trailing residues at the N terminal of the peptide used for prediction
Returns:
-
tralingC
¶ returns the number of trailing residues at the N terminal of the peptide used for prediction
Returns:
-
-
class
Fred2.CleavagePrediction.PSSM.
APSSMCleavageSitePredictor
[source]¶ Bases:
Fred2.Core.Base.ACleavageSitePrediction
Abstract base class for PSSM predictions.
This implementation only supports cleavage site prediction not fragment prediction
Implements predict functionality
-
predict
(aa_seq, length=None, **kwargs)[source]¶ Returns predictions for given peptides an alleles. If no alleles are given, predictions for all available models are made.
Parameters: - peptides (list(Peptide)/Peptide) – A single Peptide or a list of Peptides
- kwargs – optional parameter (not used yet)
Returns: Returns a AResult object with the prediction results
-
-
class
Fred2.CleavagePrediction.PSSM.
PCM
[source]¶ Bases:
Fred2.CleavagePrediction.PSSM.APSSMCleavageSitePredictor
Implements the PCM cleavage prediction method
Input list(Peptide) peptides: list of peptides for which cleave probability prediction should be performed -
cleavagePos
¶
-
name
¶
-
supportedLength
¶
-
version
¶
-
-
class
Fred2.CleavagePrediction.PSSM.
PSSMGinodi
[source]¶ Bases:
Fred2.CleavagePrediction.PSSM.APSSMCleavageFragmentPredictor
Implements the Cleavage Fragment prediction method of Ginodi et al.
Ido Ginodi, Tal Vider-Shalit, Lea Tsaban, and Yoram Louzoun Precise score for the prediction of peptides cleaved by the proteasome Bioinformatics (2008) 24 (4): 477-483
-
cleavagePos
¶
-
name
¶
-
supportedLength
¶
-
trailingN
¶
-
tralingC
¶
-
version
¶
-
-
class
Fred2.CleavagePrediction.PSSM.
ProteaSMMConsecutive
[source]¶ Bases:
Fred2.CleavagePrediction.PSSM.APSSMCleavageSitePredictor
Implements the ProteaSMM cleavage prediction method
Tenzer, S., et al. “Modeling the MHC class I pathway by combining predictions of proteasomal cleavage, TAP transport and MHC class I binding.” Cellular and Molecular Life Sciences CMLS 62.9 (2005): 1025-1037.
This model represents the consecutive proteasom
The matrices are generated not using the preon-dataset since a reacent study has show that including those worsened the results. See
Calis, Jorg JA, et al. “Role of peptide processing predictions in T cell epitope identification: contribution of different prediction programs.” Immunogenetics (2014): 1-9.
Input list(Peptide) peptides: list of peptides for which cleave probability prediction should be performed -
cleavagePos
¶
-
name
¶
-
supportedLength
¶
-
version
¶
-
-
class
Fred2.CleavagePrediction.PSSM.
ProteaSMMImmuno
[source]¶ Bases:
Fred2.CleavagePrediction.PSSM.APSSMCleavageSitePredictor
Implements the ProteaSMM cleavage prediction method
Tenzer, S., et al. “Modeling the MHC class I pathway by combining predictions of proteasomal cleavage, TAP transport and MHC class I binding.” Cellular and Molecular Life Sciences CMLS 62.9 (2005): 1025-1037.
This model represents the immuno proteasom
The matrices are generated not using the preon-dataset since a reacent study has show that including those worsened the results. See
Calis, Jorg JA, et al. “Role of peptide processing predictions in T cell epitope identification: contribution of different prediction programs.” Immunogenetics (2014): 1-9.
Input list(Peptide) peptides: list of peptides for which cleave probability prediction should be performed -
cleavagePos
¶
-
name
¶
-
supportedLength
¶
-
version
¶
-


| 类 | 说明 |
|---|---|
| ClearScrollAction | |
| ClearScrollRequest | |
| ClearScrollRequestBuilder | |
| ClearScrollResponse | |
| MultiSearchAction | |
| MultiSearchRequest |
A multi search API request.
|
| MultiSearchRequestBuilder |
A request builder for multiple search requests.
|
| MultiSearchResponse |
A multi search response.
|
| MultiSearchResponse.Item |
A search response item, holding the actual search response, or an error message if it failed.
|
| SearchAction | |
| SearchExecutionStatsCollector |
A wrapper of search action listeners (search results) that unwraps the query
result to get the piggybacked queue size and service time EWMA, adding those
values to the coordinating nodes'
ResponseCollectorService . |
| SearchPhaseController | |
| SearchPhaseController.ReducedQueryPhase | |
| SearchRequest |
A request to execute search against one or more indices (or all).
|
| SearchRequestBuilder |
A search action request builder.
|
| SearchResponse |
A response of a search request.
|
| SearchResponse.Clusters |
Holds info about the clusters that the search was executed on: how many in total, how many of them were successful
and how many of them were skipped.
|
| SearchResponseSections |
Base class that holds the various sections which a search response is
composed of (hits, aggs, suggestions etc.) and allows to retrieve them.
|
| SearchScrollAction | |
| SearchScrollRequest | |
| SearchScrollRequestBuilder |
A search scroll action request builder.
|
| SearchShardIterator |
Extension of
PlainShardIterator used in the search api, which also holds the OriginalIndices
of the search request. |
| SearchTask |
Task storing information about a currently running search request.
|
| SearchTransportService |
An encapsulation of
SearchService operations exposed through
transport. |
| SearchTransportService.CanMatchResponse | |
| SearchTransportService.SearchFreeContextResponse | |
| ShardSearchFailure |
Represents a failure to search on a specific shard.
|
| TransportClearScrollAction | |
| TransportMultiSearchAction | |
| TransportSearchAction | |
| TransportSearchScrollAction |
| 枚举 | 说明 |
|---|---|
| SearchType |
Search type represent the manner at which the search operation is executed.
|
| 异常错误 | 说明 |
|---|---|
| ReduceSearchPhaseException |
A failure during a reduce phase (when receiving results from several shards, and reducing them
into one or more results and possible actions).
|
| SearchPhaseExecutionException |


s=: 0 : 0 (+/y) % (#y) ) mean=: 3 : s MEAN=: 13 : s mean MEAN +-+-+------------+ +-----+-+-+ |3|:|(+/y) % (#y)| |+-+-+|%|#| +-+-+------------+ ||+|/|| | | 3 : '(+/y) % (#y)' |+-+-+| | | +-----+-+-+ +/ % #The explicit form of definition is likely to be more familiar to computer programmers than the tacit form. Translations provided by the adverb 13 : may therefore be helpful in learning tacit programming.
Exercises
| 19.1 | Use the display of the tacit definition of MEAN
to define an equivalent function called M . Answer: M=: +/ % # |


(Liyad)
Lisp yet another DSL interpreter
Liyad is very small Lisp interpreter written in JavaScript.
Let's make your yet another DSL with Lisp S-expression!
Liyad provides JavaScript APIs to customize all operators and macros.
You can easily and quickly build a new DSL you want to need.
Liyad's production build is only less than 100KB.
Liyad is written in pure JavaScript that running on both server side (Node.js) and modern browsers (Chrome, Firefox, Safari, Edge).
(LSX)
Alternative JSX notation using Lisp
More simple, more beautiful, and more powerful!
Liyad uses ES6 template literal syntax. You don't pass the entire code to transpile and evaluate it. Save your coding times.
No host environment's symbols are accessible from evaluated user contents by default. Malicious codes can not make a serious attack.
What you can do with JSX can be done with LSX. Plus, LSX itself is a complete data description format and is a complete programming language, so you can write more concise and powerful.


I-Team: Air Force reservist fighting to get unused PTO paid out
by John BedellDAYTON — A local Air Force reservist is facing a fight based on principle here at home.
She’s working to get paid for vacation time that she earned with the City of Dayton but couldn’ t use because of her service in the armed forces.
Jennifer Godsey says she’s serving out a dream in the Air Force.
“I'm with the 445th Airlift Wing out at Wright-Patterson Air Force Base,” she said. “It’s just an honor to represent our nation that way.”
But what she isn’t thrilled with is the dispute she’s in with the City of Dayton.
Godsey retired in August after serving 24 years as a Dayton police officer.
But last year, she was with the police department when she was deployed with her reserve unit to Kuwait.
“I had excess vacation time as a result of my deployment that I was not able to use,” Godsey said. “That excess was 16 days.”
So she filed a request to have the 16 days paid out.
Documentation and emails Godsey provided to News Center 7’s I-Team show the police department approved the request, but the city’s human resources department denied it.
So she filed a formal complaint with the U.S. Department of Labor under the Uniformed Services Employment and Reemployment Right Act (USERRA).
“They found that there was merit in the complaint that I filed and there was wrongdoing on the city’s part for taking those days as a result of my military service,” Godsey said.
The feds recommended the city pay Godsey for the full 16 days based on the USERRA complaint, but Dayton only paid her for seven.
News Center 7 I-Team reporter John Bedell reached out to the City of Dayton and asked the city to explain its decision.
They responded with the following statement: “The City of Dayton will not comment on this matter due to ongoing litigation.”
Godsey told the I-Team her next step it to talk with the Department of Justice — which may lead to civil action against the city.
“If this is not resolved, that is absolutely what I intend to do,” she said.
This isn’t about the money for Godsey.
She knows there are plenty of other city employees who are in the military.
She’s continuing this fight so it doesn’t become someone else’ battle.
“It’s just a matter of principle,” Godsey said. “And right is right and wrong is wrong. And that was vacation time that I had accrued and earned over the 24 years that I worked for the City of Dayton and it was turned around and taken away while I was serving my country.”


vue mastery
{{ product }}
In Stock
Low on stock
Out of Stock
{{stock}} items
{{detail}}
{{variant.color}}
{{size}}
{{ product }}
Increment Stock
Decrement Stock
Increment Cart
Decrement Cart
Add To Cart
Cart ({{cart}} items)
Stock ({{stock}} items)


{# Put your view macros here. If you find yourself repeating the same markup a lot, consider wrapping it in a macro. They're basically view helper functions that output HTML. #} {% macro renderJobRow(ctx, job) %}


NEURON files from the paper: Learning mechanism for column formation in the olfactory bulb by M. Migliore, Carlo Inzirillo, Gordon M. Shepherd, Front. Integr. Neurosci. (2007) 1:12. doi:10.3389/neuro.07.012.2007 In the olfactory bulb, the processing units for odor discrimination are believed to involve dendrodendritic synaptic interactions between mitral and granule cells. There is increasing anatomical evidence that these cells are organized in columns, and that the columns processing a given odor are arranged in widely distributed arrays. Experimental evidence is lacking on the underlying learning mechanisms for how these columns and arrays are formed. We have used a simplified realistic circuit model to test the hypothesis that distributed connectivity can self-organize through an activity-dependent dendrodendritic synaptic mechanism. The results point to action potentials propagating in the mitral cell lateral dendrites as playing a critical role in this mechanism, and suggest a novel and robust learning mechanism for the development of distributed processing units in a cortical structure. The traces shown in Fig.2 of the paper are produced by running 2mc-w05-w00-e2i3-int220.hoc. However, because the simulation is quite long, the output files are included in the distribution and read by plasticity-disp.hoc, that also allows the display of the time course for all dendrodendritic synapses. After the fig 2 button is pressed and the simulations have completed, the windows can have there axes adjusted similarly to the figures: Under unix systems: to compile the mod files use the command nrnivmodl and run the simulation hoc file with the command nrngui mosinit.hoc Under Windows systems: to compile the mod files use the "mknrndll" command. A double click on the simulation file mosinit.hoc will open the simulation window. Under MAC OS X: Drag and drop the plast folder onto the mknrndll icon in the NEURON application folder. When the mod files are finished compiling drag and drop the mosinit.hoc file onto the nrngui icon. Questions on how to use this model should be directed to michele.migliore@pa.ibf.cnr.it


001/* 002 * Licensed to the Apache Software Foundation (ASF) under one 003 * or more contributor license agreements. See the NOTICE file 004 * distributed with this work for additional information 005 * regarding copyright ownership. The ASF licenses this file 006 * to you under the Apache License, Version 2.0 (the 007 * "License"); you may not use this file except in compliance 008 * with the License. You may obtain a copy of the License at 009 * 010 * http://www.apache.org/licenses/LICENSE-2.0 011 * 012 * Unless required by applicable law or agreed to in writing, 013 * software distributed under the License is distributed on an 014 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 015 * KIND, either express or implied. See the License for the 016 * specific language governing permissions and limitations 017 * under the License. 018 */ 019package org.apache.shiro.subject.support; 020 021import org.apache.shiro.subject.Subject; 022import org.apache.shiro.util.ThreadState; 023 024/** 025 * A {@code SubjectRunnable} ensures that a target/delegate {@link Runnable Runnable} will execute such that any 026 * call to {@code SecurityUtils.}{@link org.apache.shiro.SecurityUtils#getSubject() getSubject()} during the 027 * {@code Runnable}'s execution will return the associated {@code Subject} instance. The {@code SubjectRunnable} 028 * instance can be run on any thread (the current thread or asynchronously on another thread) and the 029 * {@code SecurityUtils.getSubject()} call will still work properly. This implementation also guarantees that Shiro's 030 * thread state will be identical before and after execution to ensure threads remain clean in any thread-pooled 031 * environment. 032 *
 033 * When instances of this class {@link Runnable#run() run()}, the following occurs: 034 *
 035 *
The Subject and any of its associated thread state is first bound to the thread that executes the 036 * {@code Runnable}.
 037 *
The delegate/target {@code Runnable} is {@link #doRun(Runnable) run}
 038 *
Any previous thread state that might have existed before the {@code Subject} was bound is fully restored
 039 *
 040 *
 041 * 042 *
Usage
 043 * 044 * This is typically considered a support class and is not often directly referenced. Most people prefer to use 045 * the {@code Subject.}{@link Subject#execute(Runnable) execute} or 046 * {@code Subject.}{@link Subject#associateWith(Runnable) associateWith} methods, which transparently perform the 047 * necessary association logic. 048 *
 049 * An even more convenient alternative is to use a 050 * {@link org.apache.shiro.concurrent.SubjectAwareExecutor SubjectAwareExecutor}, which transparently uses 051 * instances of this class but does not require referencing Shiro's API at all. 052 * 053 * @see Subject#associateWith(Runnable) 054 * @see org.apache.shiro.concurrent.SubjectAwareExecutor SubjectAwareExecutor 055 * @since 1.0 056 */ 057public class SubjectRunnable implements Runnable { 058 059 protected final ThreadState threadState; 060 private final Runnable runnable; 061 062 /** 063 * Creates a new {@code SubjectRunnable} that, when executed, will execute the target {@code delegate}, but 064 * guarantees that it will run associated with the specified {@code Subject}. 065 * 066 * @param subject the Subject to associate with the delegate's execution. 067 * @param delegate the runnable to run. 068 */ 069 public SubjectRunnable(Subject subject, Runnable delegate) { 070 this(new SubjectThreadState(subject), delegate); 071 } 072 073 /** 074 * Creates a new {@code SubjectRunnable} that, when executed, will perform thread state 075 * {@link ThreadState#bind binding} and guaranteed {@link ThreadState#restore restoration} before and after the 076 * {@link Runnable Runnable}'s execution, respectively. 077 * 078 * @param threadState the thread state to bind and unbind before and after the runnable's execution. 079 * @param delegate the delegate {@code Runnable} to execute when this instance is {@link #run() run()}. 080 * @throws IllegalArgumentException if either the {@code ThreadState} or {@link Runnable} arguments are {@code null}. 081 */ 082 protected SubjectRunnable(ThreadState threadState, Runnable delegate) throws IllegalArgumentException { 083 if (threadState == null) { 084 throw new IllegalArgumentException("ThreadState argument cannot be null."); 085 } 086 this.threadState = threadState; 087 if (delegate == null) { 088 throw new IllegalArgumentException("Runnable argument cannot be null."); 089 } 090 this.runnable = delegate; 091 } 092 093 /** 094 * {@link ThreadState#bind Bind}s the Subject thread state, executes the target {@code Runnable} and then guarantees 095 * the previous thread state's {@link ThreadState#restore restoration}: 096 *
 097 * try { 098 * threadState.{@link ThreadState#bind bind()}; 099 * {@link #doRun doRun}(targetRunnable); 100 * } finally { 101 * threadState.{@link ThreadState#restore restore()} 102 * } 103 *
 104 */ 105 public void run() { 106 try { 107 threadState.bind(); 108 doRun(this.runnable); 109 } finally { 110 threadState.restore(); 111 } 112 } 113 114 /** 115 * Simply calls the target {@link Runnable Runnable}'s {@link Runnable#run run()} method. 116 * 117 * @param runnable the target runnable to run. 118 */ 119 protected void doRun(Runnable runnable) { 120 runnable.run(); 121 } 122}


{% extends "blog/layout.html" %} {% block content %}
{{ talk.summary }}
No talks available at this time


Your email address could not be verified. Please try a different contact email.
Your email address is awaiting verification. Please check your inbox for an email from All of Us Researcher Workbench, click on the link inside and then reload this page.


Features
Dictionary
In the need of a dictionary?
See what our community-powered dictionary has to offer:
- Support for 20+ languages
- Word and sentence translations
- Verified definitions
- Etymology
- Example sentences
How does it work?
Any registered user can view or add terms to the dictionary, so that others can learn vocabulary the easy way. We rely on the users' honesty when giving permission to modify the dictionary, although anyone can report an entry with inappropriate, or simply wrong information to get it reviewed by our team of qualified moderators.
Resources
Have you seen a fun video recently, or know an interesting article? Share it!
Our open library stores lots of resources for every kind of language learner. Videos, articles, documents... What's your favorite? While this is a fun way to learn a new language, it is most importantly an effective way to integrate with the real-life community involving the language.
Comprehensible Input
This is one of the most effective ways to learn a new language. It consists of exposing yourself to intelligible language, which is a little ahead of your current level, therefore understanding most of the structures, although not all of the vocabulary nor grammar. In this way, you will subconsciously acquire the language in a better and easier way than staring at a textbook for five hours straight.
- Search by language
- Search by level
- Search by tags and topics
- Search by category (videos, documents...)
Pricing
FREE FOREVER
Yup, that's it.
Sign up nowI already have an account


Cedric Shivonje : I am not the man who fell from the London skies
In Summary
- On June 30, the day a man fell from the compartment, Mr Shivonje says he was in Kawangware, where he used to work as a teacher of English and science at a private school.
- In an article published on November 11, Sky News identified Paul Manyasi, reported as an employee of Colnet — a cleaning company based at the airport — as “the man who fell from the sky”.
Nairobi. Cedric Isaac Shivonje, the man whose photographs were published by British broadcaster Sky News as the stowaway who fell from a Kenya Airways plane in London, is alive in a Kenyan prison.
The Nation met and interviewed him in prison, where he is being held after failing to raise Sh200,000 bail for an unrelated case.
DILEMMA
Dressed in a slim-fit blue shirt, in handcuffs — and spotting a red T-shirt inside — the 25-year-old said the photos used by Sky News as those of a Paul Manyasi, the alleged stowaway, were his.
“I am alive, as you can see,” he said, flanked by his father Isaac Beti, 45, and Nairobi lawyer James Mbugua.
Shivonje was delighted to see his father, who had travelled from Butali, Kakamega County.
Advertisement
His father — who identifies himself as Isaac Betti and not Isaac Manyasi as identified by the Sky News report — had come to Nairobi to visit his son for the first time in two years — and we accompanied him to the prison.
He had come with Shivonje’s uncle, Mr Timothy Burundi, who has been visiting him regularly at Industrial Area Prison Remand, where he was previously held.
Mr Shivonje’s emergence now compounds the identification dilemma of the nationality of the man who nestled in the landing compartment of the aircraft on June 30 and fell 3,500 feet as the plane approached Heathrow Airport in London.
RECORDS
The plane’s flight records show that it had been to South Africa before taking off from Jomo Kenyatta International Airport for London on the early morning of June 30.
So far, no family has claimed the body of the stowaway who fell in a London compound.
It is still in the United Kingdom.
Mr Shivonje told the Nation that he was arrested on August 7 and remanded on August 13 after being taken to a Kibera court where he is facing defilement charges.
On June 30, the day a man fell from the compartment, Mr Shivonje says he was in Kawangware, where he used to work as a teacher of English and science at a private school.
In an article published on November 11, Sky News identified Paul Manyasi, reported as an employee of Colnet — a cleaning company based at the airport — as “the man who fell from the sky”.
The next day, the Kenya Airports Authority issued a statement saying the name Paul Manyasi “does not appear in the JKIA staff register … and in the airport’s pass biometric register”. Colnet also denied it had employed a Paul Manyasi.
Sky News reported that it had received the photos it published from Paul’s girlfriend, also reported to be an employee of Colnet, whose identity was not revealed.
Shivonje said: “Those are my photos and they were taken from my Facebook page.”
When the woman is shown the police e-fit image of the deceased in the Sky News video, she says: “They look alike, but he wasn’t dark. But the face resembles.”
Sky News reported that Paul Manyasi was a 29-year-old.
Mr Shivonje’s identity card indicates he is 25.
The man told the Nation that he had been living in Kawangware, while Paul Manyasi was reported to have been a resident of Mukuru kwa Njenga.
During our meeting, we asked Mr Shivonje’s father about some of the statements he made to the Sky News team.
DID HE LIE?
For example, in the video, he is shown the bag that was found in the KQ compartment and says: “He used to have this one”.
Did he lie to the Sky News reporter? we asked.
“I could not tell them that my son was in jail,” he responded.
“When the visitors came, they said they wanted to speak to me. They said my son was working at the airport. They asked me if I knew where he was working and I said ‘No’. They told me that my son died after hiding in a UK-bound flight.”
“When they showed me the photos, I told them that my son’s name is Cedric Shivonje Isaac … All this time, I knew my son was in remand but I could not reveal to them. I wanted to protect him,” he said.
REPUTATION
“I did not want the villagers to know that my son was in jail.”
He added that the Sky News reporter gave him Sh20,000 before he left the home.
When the Sky News story broke locally, Mr Shivonje says he was reading a novel when he was alerted that he had been in the news.
“I saw my pictures on Citizen TV but the name was not mine. They said I was a cleaner at Jomo Kenyatta Airport. The next day, a madam (prison warden) told me the full story and inmates started calling me kifo (death) and maiti (corpse). I cried a lot.”
Mr Shivonje attended Matiuli K Primary and Tande High School in Kakamega before making his way to Nairobi.
“They have damaged my son’s reputation and he needs to be cleansed after being labelled dead,” his father said.
RETRACTION
Detectives who are handling the case in Nairobi told the Nation that the prints recovered from the stowaway do not match anyone in the civil registry.
The new development deepens the intrigues surrounding the man who stowed away a Kenya Airways flight and fell into a London compound.
Meanwhile, Nairobi law firm MJM Law LLP has threatened to sue Sky News, which it accuses of defaming its client.
In a November 19 letter, the company is demanding full retraction of the article, an apology and written commitment not to publish any more articles on Mr Shivonje.


DistCp Guide
Overview
DistCp (distributed copy) is a tool used for large inter/intra-cluster copying. It uses MapReduce to effect its distribution, error handling and recovery, and reporting. It expands a list of files and directories into input to map tasks, each of which will copy a partition of the files specified in the source list. Its MapReduce pedigree has endowed it with some quirks in both its semantics and execution. The purpose of this document is to offer guidance for common tasks and to elucidate its model.
Usage
Basic
The most common invocation of DistCp is an inter-cluster copy:
bash$ hadoop distcp hdfs://nn1:8020/foo/bar \
hdfs://nn2:8020/bar/foo
This will expand the namespace under /foo/bar on nn1 into a temporary file, partition its contents among a set of map tasks, and start a copy on each TaskTracker from nn1 to nn2. Note that DistCp expects absolute paths.
One can also specify multiple source directories on the command line:
bash$ hadoop distcp hdfs://nn1:8020/foo/a \
hdfs://nn1:8020/foo/b \
hdfs://nn2:8020/bar/foo
Or, equivalently, from a file using the -f option:
bash$ hadoop distcp -f hdfs://nn1:8020/srclist \
hdfs://nn2:8020/bar/foo
Where srclist contains
hdfs://nn1:8020/foo/a
hdfs://nn1:8020/foo/b
When copying from multiple sources, DistCp will abort the copy with an error message if two sources collide, but collisions at the destination are resolved per the options specified. By default, files already existing at the destination are skipped (i.e. not replaced by the source file). A count of skipped files is reported at the end of each job, but it may be inaccurate if a copier failed for some subset of its files, but succeeded on a later attempt (see Appendix).
It is important that each TaskTracker can reach and communicate with both the source and destination file systems. For HDFS, both the source and destination must be running the same version of the protocol or use a backwards-compatible protocol (see Copying Between Versions).
After a copy, it is recommended that one generates and cross-checks a listing of the source and destination to verify that the copy was truly successful. Since DistCp employs both MapReduce and the FileSystem API, issues in or between any of the three could adversely and silently affect the copy. Some have had success running with -update enabled to perform a second pass, but users should be acquainted with its semantics before attempting this.
It's also worth noting that if another client is still writing to a source file, the copy will likely fail. Attempting to overwrite a file being written at the destination should also fail on HDFS. If a source file is (re)moved before it is copied, the copy will fail with a FileNotFoundException.
Options
Option Index
| Flag | Description | Notes |
|---|---|---|
| -p[rbugp] | Preserve r: replication number b: block size u: user g: group p: permission |
Modification times are not preserved. Also, when -update is specified, status updates will not be synchronized unless the file sizes also differ (i.e. unless the file is re-created). |
| -i | Ignore failures | As explained in the Appendix, this option will keep more accurate statistics about the copy than the default case. It also preserves logs from failed copies, which can be valuable for debugging. Finally, a failing map will not cause the job to fail before all splits are attempted. |
| -log <logdir> | Write logs to <logdir> | DistCp keeps logs of each file it attempts to copy as map output. If a map fails, the log output will not be retained if it is re-executed. |
| -m <num_maps> | Maximum number of simultaneous copies | Specify the number of maps to copy data. Note that more maps may not necessarily improve throughput. |
| -overwrite | Overwrite destination | If a map fails and -i is not specified, all the files in the split, not only those that failed, will be recopied. As discussed in the following, it also changes the semantics for generating destination paths, so users should use this carefully. |
| -update | Overwrite if src size different from dst size | As noted in the preceding, this is not a "sync" operation. The only criterion examined is the source and destination file sizes; if they differ, the source file replaces the destination file. As discussed in the following, it also changes the semantics for generating destination paths, so users should use this carefully. |
| -f <urilist_uri> | Use list at <urilist_uri> as src list | This is equivalent to listing each source on the command line. The urilist_uri list should be a fully qualified URI. |
| -filelimit <n> | Limit the total number of files to be <= n | See also Symbolic Representations. |
| -sizelimit <n> | Limit the total size to be <= n bytes | See also Symbolic Representations. |
| -delete | Delete the files existing in the dst but not in src | The deletion is done by FS Shell. So the trash will be used, if it is enable. |
Symbolic Representations
The parameter <n> in -filelimit and -sizelimit can be specified with symbolic representation. For examples,
- 1230k = 1230 * 1024 = 1259520
- 891g = 891 * 1024^3 =<PHONE_NUMBER>84
Update and Overwrite
It's worth giving some examples of -update and -overwrite. Consider a copy from /foo/a and /foo/b to /bar/foo, where the sources contain the following:
hdfs://nn1:8020/foo/a
hdfs://nn1:8020/foo/a/aa
hdfs://nn1:8020/foo/a/ab
hdfs://nn1:8020/foo/b
hdfs://nn1:8020/foo/b/ba
hdfs://nn1:8020/foo/b/ab
If either -update or -overwrite is set, then both sources will map an entry to /bar/foo/ab at the destination. For both options, the contents of each source directory are compared with the contents of the destination directory. Rather than permit this conflict, DistCp will abort.
In the default case, both /bar/foo/a and /bar/foo/b will be created and neither will collide.
Now consider a legal copy using -update:
distcp -update hdfs://nn1:8020/foo/a \
hdfs://nn1:8020/foo/b \
hdfs://nn2:8020/bar
With sources/sizes:
hdfs://nn1:8020/foo/a
hdfs://nn1:8020/foo/a/aa 32
hdfs://nn1:8020/foo/a/ab 32
hdfs://nn1:8020/foo/b
hdfs://nn1:8020/foo/b/ba 64
hdfs://nn1:8020/foo/b/bb 32
And destination/sizes:
hdfs://nn2:8020/bar
hdfs://nn2:8020/bar/aa 32
hdfs://nn2:8020/bar/ba 32
hdfs://nn2:8020/bar/bb 64
Will effect:
hdfs://nn2:8020/bar
hdfs://nn2:8020/bar/aa 32
hdfs://nn2:8020/bar/ab 32
hdfs://nn2:8020/bar/ba 64
hdfs://nn2:8020/bar/bb 32
Only aa is not overwritten on nn2. If -overwrite were specified, all elements would be overwritten.
Appendix
Map sizing
DistCp makes a faint attempt to size each map comparably so that each copies roughly the same number of bytes. Note that files are the finest level of granularity, so increasing the number of simultaneous copiers (i.e. maps) may not always increase the number of simultaneous copies nor the overall throughput.
If -m is not specified, DistCp will attempt to schedule work for min (total_bytes / bytes.per.map, 20 * num_task_trackers) where bytes.per.map defaults to 256MB.
Tuning the number of maps to the size of the source and destination clusters, the size of the copy, and the available bandwidth is recommended for long-running and regularly run jobs.
Copying between versions of HDFS
For copying between two different versions of Hadoop, one will usually use HftpFileSystem. This is a read-only FileSystem, so DistCp must be run on the destination cluster (more specifically, on TaskTrackers that can write to the destination cluster). Each source is specified as hftp://<dfs.http.address>/<path> (the default dfs.http.address is <namenode>:50070).
MapReduce and other side-effects
As has been mentioned in the preceding, should a map fail to copy one of its inputs, there will be several side-effects.
- Unless -i is specified, the logs generated by that task attempt will be replaced by the previous attempt.
- Unless -overwrite is specified, files successfully copied by a previous map on a re-execution will be marked as "skipped".
- If a map fails mapred.map.max.attempts times, the remaining map tasks will be killed (unless -i is set).
- If mapred.speculative.execution is set set final and true, the result of the copy is undefined.


You can add names in here. You can change the names you have added but not the ones other people have.
You can cast your votes here. The results reflect the average of all the votes made for each name.
{{ vm.pickedParticipant.votes[vnkey].value }}
Are you one of these persons?
If not, go ahead and register.
Ok, I'll register


--- title: Helpers - Fabricator layout: 2-column section: Documentation --- {{#markdown}} # Helpers > How to add your own Handlebars helpers Add your own helpers to the Fabricator assembly engine by defining them in the `assemble` task in `gulpfile.js`: ```javascript // assemble gulp.task('assemble', function(done) { assemble({ helpers: { markdown: require('helper-markdown') } }); done(); }); ``` This adds the [helper-markdown](https://www.npmjs.com/package/helper-markdown) helper, which can be used like: ``` {{{{raw}}}}{{#markdown}} # Markdown! {{/markdown}}{{{{/raw}}}} ``` Learn more about [Handlebars helpers](http://handlebarsjs.com/block_helpers.html). ## Built-in helpers There are some useful helpers already built into Fabricator. ### iterate ``` {{{{raw}}}}{{#iterate 20}}


Boost Format library
The format library provides a class for formatting arguments according
to a format-string, as does printf, but with two major differences
:
- format sends the arguments to an internal stream, and so is entirely
type-safe and naturally supports all user-defined types.
- The ellipsis (...) can not be used correctly in the strongly typed
context of format, and thus the function call with arbitrary arguments is
replaced by successive calls to an argument feeding
operator%
You can find more Details in :
- Documentation (HTML).
- Headers
- Sample programs
- The program sample_formats.cpp demonstrates
simple uses of format.
- sample_new_features.cpp
illustrates the few formatting features that were added to printf's
syntax such as simple positional directives, centered alignment, and
'tabulations'.
- sample_advanced.cpp
demonstrates uses of advanced features, like reusing, and modifying,
format objects, etc..
- And sample_userType.cpp shows the
behaviour of the format library on user-defined types.
Revised
02 December, 2006
Copyright © 2003 Samuel Krempp
Distributed under the Boost Software License, Version 1.0. (See
accompanying file LICENSE_1_0.txt or
copy at http://www.boost.org/LICENSE_1_0.txt)