001 /* 002 * Licensed to the Apache Software Foundation (ASF) under one or more 003 * contributor license agreements. See the NOTICE file distributed with 004 * this work for additional information regarding copyright ownership. 005 * The ASF licenses this file to You under the Apache License, Version 2.0 006 * (the "License"); you may not use this file except in compliance with 007 * the License. You may obtain a copy of the License at 008 * 009 * http://www.apache.org/licenses/LICENSE-2.0 010 * 011 * Unless required by applicable law or agreed to in writing, software 012 * distributed under the License is distributed on an "AS IS" BASIS, 013 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 014 * See the License for the specific language governing permissions and 015 * limitations under the License. 016 */ 017 018 package org.apache.commons.net.io; 019 020 import java.io.Closeable; 021 import java.io.IOException; 022 import java.io.InputStream; 023 import java.io.OutputStream; 024 import java.io.Reader; 025 import java.io.Writer; 026 import java.net.Socket; 027 028 /*** 029 * The Util class cannot be instantiated and stores short static convenience 030 * methods that are often quite useful. 031 * <p> 032 * <p> 033 * @see CopyStreamException 034 * @see CopyStreamListener 035 * @see CopyStreamAdapter 036 ***/ 037 038 public final class Util 039 { 040 /*** 041 * The default buffer size used by {@link #copyStream copyStream } 042 * and {@link #copyReader copyReader }. It's value is 1024. 043 ***/ 044 public static final int DEFAULT_COPY_BUFFER_SIZE = 1024; 045 046 // Cannot be instantiated 047 private Util() 048 { } 049 050 051 /*** 052 * Copies the contents of an InputStream to an OutputStream using a 053 * copy buffer of a given size and notifies the provided 054 * CopyStreamListener of the progress of the copy operation by calling 055 * its bytesTransferred(long, int) method after each write to the 056 * destination. If you wish to notify more than one listener you should 057 * use a CopyStreamAdapter as the listener and register the additional 058 * listeners with the CopyStreamAdapter. 059 * <p> 060 * The contents of the InputStream are 061 * read until the end of the stream is reached, but neither the 062 * source nor the destination are closed. You must do this yourself 063 * outside of the method call. The number of bytes read/written is 064 * returned. 065 * <p> 066 * @param source The source InputStream. 067 * @param dest The destination OutputStream. 068 * @param bufferSize The number of bytes to buffer during the copy. 069 * @param streamSize The number of bytes in the stream being copied. 070 * Should be set to CopyStreamEvent.UNKNOWN_STREAM_SIZE if unknown. 071 * @param listener The CopyStreamListener to notify of progress. If 072 * this parameter is null, notification is not attempted. 073 * @param flush Whether to flush the output stream after every 074 * write. This is necessary for interactive sessions that rely on 075 * buffered streams. If you don't flush, the data will stay in 076 * the stream buffer. 077 * @exception CopyStreamException If an error occurs while reading from the 078 * source or writing to the destination. The CopyStreamException 079 * will contain the number of bytes confirmed to have been 080 * transferred before an 081 * IOException occurred, and it will also contain the IOException 082 * that caused the error. These values can be retrieved with 083 * the CopyStreamException getTotalBytesTransferred() and 084 * getIOException() methods. 085 ***/ 086 public static final long copyStream(InputStream source, OutputStream dest, 087 int bufferSize, long streamSize, 088 CopyStreamListener listener, 089 boolean flush) 090 throws CopyStreamException 091 { 092 int bytes; 093 long total; 094 byte[] buffer; 095 096 buffer = new byte[bufferSize]; 097 total = 0; 098 099 try 100 { 101 while ((bytes = source.read(buffer)) != -1) 102 { 103 // Technically, some read(byte[]) methods may return 0 and we cannot 104 // accept that as an indication of EOF. 105 106 if (bytes == 0) 107 { 108 bytes = source.read(); 109 if (bytes < 0) 110 break; 111 dest.write(bytes); 112 if(flush) 113 dest.flush(); 114 ++total; 115 if (listener != null) 116 listener.bytesTransferred(total, 1, streamSize); 117 continue; 118 } 119 120 dest.write(buffer, 0, bytes); 121 if(flush) 122 dest.flush(); 123 total += bytes; 124 if (listener != null) 125 listener.bytesTransferred(total, bytes, streamSize); 126 } 127 } 128 catch (IOException e) 129 { 130 throw new CopyStreamException("IOException caught while copying.", 131 total, e); 132 } 133 134 return total; 135 } 136 137 138 /*** 139 * Copies the contents of an InputStream to an OutputStream using a 140 * copy buffer of a given size and notifies the provided 141 * CopyStreamListener of the progress of the copy operation by calling 142 * its bytesTransferred(long, int) method after each write to the 143 * destination. If you wish to notify more than one listener you should 144 * use a CopyStreamAdapter as the listener and register the additional 145 * listeners with the CopyStreamAdapter. 146 * <p> 147 * The contents of the InputStream are 148 * read until the end of the stream is reached, but neither the 149 * source nor the destination are closed. You must do this yourself 150 * outside of the method call. The number of bytes read/written is 151 * returned. 152 * <p> 153 * @param source The source InputStream. 154 * @param dest The destination OutputStream. 155 * @param bufferSize The number of bytes to buffer during the copy. 156 * @param streamSize The number of bytes in the stream being copied. 157 * Should be set to CopyStreamEvent.UNKNOWN_STREAM_SIZE if unknown. 158 * @param listener The CopyStreamListener to notify of progress. If 159 * this parameter is null, notification is not attempted. 160 * @exception CopyStreamException If an error occurs while reading from the 161 * source or writing to the destination. The CopyStreamException 162 * will contain the number of bytes confirmed to have been 163 * transferred before an 164 * IOException occurred, and it will also contain the IOException 165 * that caused the error. These values can be retrieved with 166 * the CopyStreamException getTotalBytesTransferred() and 167 * getIOException() methods. 168 ***/ 169 public static final long copyStream(InputStream source, OutputStream dest, 170 int bufferSize, long streamSize, 171 CopyStreamListener listener) 172 throws CopyStreamException 173 { 174 return copyStream(source, dest, bufferSize, streamSize, listener, 175 true); 176 } 177 178 179 /*** 180 * Copies the contents of an InputStream to an OutputStream using a 181 * copy buffer of a given size. The contents of the InputStream are 182 * read until the end of the stream is reached, but neither the 183 * source nor the destination are closed. You must do this yourself 184 * outside of the method call. The number of bytes read/written is 185 * returned. 186 * <p> 187 * @param source The source InputStream. 188 * @param dest The destination OutputStream. 189 * @return The number of bytes read/written in the copy operation. 190 * @exception CopyStreamException If an error occurs while reading from the 191 * source or writing to the destination. The CopyStreamException 192 * will contain the number of bytes confirmed to have been 193 * transferred before an 194 * IOException occurred, and it will also contain the IOException 195 * that caused the error. These values can be retrieved with 196 * the CopyStreamException getTotalBytesTransferred() and 197 * getIOException() methods. 198 ***/ 199 public static final long copyStream(InputStream source, OutputStream dest, 200 int bufferSize) 201 throws CopyStreamException 202 { 203 return copyStream(source, dest, bufferSize, 204 CopyStreamEvent.UNKNOWN_STREAM_SIZE, null); 205 } 206 207 208 /*** 209 * Same as <code> copyStream(source, dest, DEFAULT_COPY_BUFFER_SIZE); </code> 210 ***/ 211 public static final long copyStream(InputStream source, OutputStream dest) 212 throws CopyStreamException 213 { 214 return copyStream(source, dest, DEFAULT_COPY_BUFFER_SIZE); 215 } 216 217 218 /*** 219 * Copies the contents of a Reader to a Writer using a 220 * copy buffer of a given size and notifies the provided 221 * CopyStreamListener of the progress of the copy operation by calling 222 * its bytesTransferred(long, int) method after each write to the 223 * destination. If you wish to notify more than one listener you should 224 * use a CopyStreamAdapter as the listener and register the additional 225 * listeners with the CopyStreamAdapter. 226 * <p> 227 * The contents of the Reader are 228 * read until its end is reached, but neither the source nor the 229 * destination are closed. You must do this yourself outside of the 230 * method call. The number of characters read/written is returned. 231 * <p> 232 * @param source The source Reader. 233 * @param dest The destination writer. 234 * @param bufferSize The number of characters to buffer during the copy. 235 * @param streamSize The number of characters in the stream being copied. 236 * Should be set to CopyStreamEvent.UNKNOWN_STREAM_SIZE if unknown. 237 * @param listener The CopyStreamListener to notify of progress. If 238 * this parameter is null, notification is not attempted. 239 * @return The number of characters read/written in the copy operation. 240 * @exception CopyStreamException If an error occurs while reading from the 241 * source or writing to the destination. The CopyStreamException 242 * will contain the number of bytes confirmed to have been 243 * transferred before an 244 * IOException occurred, and it will also contain the IOException 245 * that caused the error. These values can be retrieved with 246 * the CopyStreamException getTotalBytesTransferred() and 247 * getIOException() methods. 248 ***/ 249 public static final long copyReader(Reader source, Writer dest, 250 int bufferSize, long streamSize, 251 CopyStreamListener listener) 252 throws CopyStreamException 253 { 254 int chars; 255 long total; 256 char[] buffer; 257 258 buffer = new char[bufferSize]; 259 total = 0; 260 261 try 262 { 263 while ((chars = source.read(buffer)) != -1) 264 { 265 // Technically, some read(char[]) methods may return 0 and we cannot 266 // accept that as an indication of EOF. 267 if (chars == 0) 268 { 269 chars = source.read(); 270 if (chars < 0) 271 break; 272 dest.write(chars); 273 dest.flush(); 274 ++total; 275 if (listener != null) 276 listener.bytesTransferred(total, chars, streamSize); 277 continue; 278 } 279 280 dest.write(buffer, 0, chars); 281 dest.flush(); 282 total += chars; 283 if (listener != null) 284 listener.bytesTransferred(total, chars, streamSize); 285 } 286 } 287 catch (IOException e) 288 { 289 throw new CopyStreamException("IOException caught while copying.", 290 total, e); 291 } 292 293 return total; 294 } 295 296 297 /*** 298 * Copies the contents of a Reader to a Writer using a 299 * copy buffer of a given size. The contents of the Reader are 300 * read until its end is reached, but neither the source nor the 301 * destination are closed. You must do this yourself outside of the 302 * method call. The number of characters read/written is returned. 303 * <p> 304 * @param source The source Reader. 305 * @param dest The destination writer. 306 * @param bufferSize The number of characters to buffer during the copy. 307 * @return The number of characters read/written in the copy operation. 308 * @exception CopyStreamException If an error occurs while reading from the 309 * source or writing to the destination. The CopyStreamException 310 * will contain the number of bytes confirmed to have been 311 * transferred before an 312 * IOException occurred, and it will also contain the IOException 313 * that caused the error. These values can be retrieved with 314 * the CopyStreamException getTotalBytesTransferred() and 315 * getIOException() methods. 316 ***/ 317 public static final long copyReader(Reader source, Writer dest, 318 int bufferSize) 319 throws CopyStreamException 320 { 321 return copyReader(source, dest, bufferSize, 322 CopyStreamEvent.UNKNOWN_STREAM_SIZE, null); 323 } 324 325 326 /*** 327 * Same as <code> copyReader(source, dest, DEFAULT_COPY_BUFFER_SIZE); </code> 328 ***/ 329 public static final long copyReader(Reader source, Writer dest) 330 throws CopyStreamException 331 { 332 return copyReader(source, dest, DEFAULT_COPY_BUFFER_SIZE); 333 } 334 335 /** 336 * Closes the object quietly, catching rather than throwing IOException. 337 * Intended for use from finally blocks. 338 * 339 * @param closeable the object to close, may be {@code null} 340 * @since 3.0 341 */ 342 public static void closeQuietly(Closeable closeable) { 343 if (closeable != null) { 344 try { 345 closeable.close(); 346 } catch (IOException e) { 347 } 348 } 349 } 350 351 /** 352 * Closes the socket quietly, catching rather than throwing IOException. 353 * Intended for use from finally blocks. 354 * 355 * @param socket the socket to close, may be {@code null} 356 * @since 3.0 357 */ 358 public static void closeQuietly(Socket socket) { 359 if (socket != null) { 360 try { 361 socket.close(); 362 } catch (IOException e) { 363 } 364 } 365 } 366 }


Inherits
Example.
List of all members.
Detailed Description
Example: Placing people on a photo
A group of people wants to take a group photo. Each person can give preferences next to whom he or she wants to be placed on the photo. The problem to be solved is to find a placement that satisfies as many preferences as possible.
Definition at line 77 of file photo.cc.
Member Enumeration Documentation
Branching to use for model.
- Enumerator:
-
| BRANCH_NONE |
Choose variables from left to right. |
| BRANCH_DEGREE |
Choose variable with largest degree. |
Definition at line 88 of file photo.cc.
Constructor & Destructor Documentation
Actual model.
Definition at line 93 of file photo.cc.
| Photo::Photo |
( |
bool |
share, |
|
|
Photo & |
s | |
|
) |
| | [inline] |
Constructor for cloning s.
Definition at line 123 of file photo.cc.
Member Function Documentation
| virtual Space* Photo::copy |
( |
bool |
share |
) |
[inline, virtual] |
| virtual void Photo::print |
( |
std::ostream & |
os |
) |
[inline, virtual] |
| void Photo::constrain |
( |
Space * |
s |
) |
[inline] |
Add constraint for next better solution.
Definition at line 144 of file photo.cc.
Member Data Documentation
Person's position on photo.
Definition at line 82 of file photo.cc.
Number of satisfied preferences.
Definition at line 84 of file photo.cc.
The documentation for this class was generated from the following file:


Click the button below to open a list of Institutions. After you select one, you’ll be guided through an authentication process. Upon completion, a public_token will be passed back to the server and exchanged for access_token.
item_id
san.asjsansakjsakjasjksajkas
access_token
••••••••hsakjsl
Now that you have an access_token you can make all of the following API requests:
Products
post
Auth
/auth/get
Retrieve account and routing numbers for checking and savings accounts.
post
Transactions
/transactions/get
Retrieve transactions for credit and depository accounts.
post
Identity
/identity/get
Retrieve Identity information on file with the bank. Reduce fraud by comparing user-submitted data to validate identity.
post
Balance
/accounts/balance/get
Check balances in real time to prevent non-sufficient funds fees.
Item management
post
/item/get
Retrieve information about an Item, like the institution, billed products, available products, and webhook information.
post
/accounts/get
Retrieve high-level information about all accounts associated with an Item.


Two vector in 2-dimensional space:
$$ \begin{aligned} A &= (a_1, a_2), \text{ in }\mathbb{R}^2\\ B &= (b_1, b_2), \text{ in }\mathbb{R}^2 \end{aligned}$$
Then a line segment going from A to B can be defined as:
$$r = \vec{oa} + \lambda \vec{ab}$$
This is simply the adition of the vector $a$ with a part of the vector going from $a$ to $b$
We know from the section on vector math that the vector going from $a$ to $b$ is equal to $b-a$ and thus we can write:
$$\begin{aligned} r &= \vec{OA} + \lambda \vec{AB}\\ &= \mathbf{a} + {\lambda}(\mathbf{b}-\mathbf{a}) \\ &= \mathbf{a} + {\lambda}\mathbf{b}-{\lambda}\mathbf{a} \\ &= (1-{\lambda})\mathbf{a} + {\lambda}\mathbf{b} \\ &= ((1-{\lambda})a1 + {\lambda}b1, (1-{\lambda})a2 + {\lambda}b2) \\ \end{aligned}$$
A sample:
You can drag the two red dots to change the endpoints $A$ and $B$ of the lnesegment.
Change the value of $\lambda$ by dragging the slider:
In a Euclidean space, a convex region is a region where, for every pair of points within the region, every point on the straight line segment that joins the pair of points is also within the region
If the region is not convext (see above for the definition) then it is concave.


The list of people who have helped us make OpenIMAJ better, through filing bug reports & feature requests, and contributing to the codebase is too big to mention here. The energy and patience of these contributors provides great motivation as we work to make OpenIMAJ even better.
OpenIMAJ relies heavily on other open-source software; see the full list here.


This default assignment may cause DoS due to globbing. Quote it.
: ${COLUMNS:=80}
: "${COLUMNS:=80}"
This statement is an idiomatic way of assigning a default value to an environment variable. However, even though it's passed to :
which ignores arguments, it's better to quote it.
If COLUMNS='/*/*/*/*/*/*'
, the unquoted, problematic code may spend 30+ minutes trashing the disk as it unnecessarily tries to glob expand the value.
The correct code uses double quotes to avoid glob expansion, and therefore does not have this problem.
When quoting, make sure to update any inner quotes:
: ${var:='foo'} # Assigns foo without quotes
: "${var:='foo'}" # Assigns 'foo' with quotes
None, though this issue is largely theoretical.


Action Mailer – Easy email delivery and testing
Action Mailer is a framework for designing email service layers. These layers are used to consolidate code for sending out forgotten passwords, welcome wishes on signup, invoices for billing, and any other use case that requires a written notification to either a person or another system.
Action Mailer is in essence a wrapper around Action Controller and the Mail gem. It provides a way to make emails using templates in the same way that Action Controller renders views using templates.
Additionally, an Action Mailer class can be used to process incoming email, such as allowing a blog to accept new posts from an email (which could even have been sent from a phone).
Sending emails
The framework works by initializing any instance variables you want to be available in the email template, followed by a call to mail
to deliver the email.
This can be as simple as:
class Notifier < ActionMailer::Base
default from<EMAIL_ADDRESS>def welcome(recipient)
@recipient = recipient
mail(to: recipient,
subject: "[Signed up] Welcome #{recipient}")
end
end
The body of the email is created by using an Action View template (regular ERB
) that has the instance variables that are declared in the mailer action.
So the corresponding body template for the method above could look like this:
Hello there,
Mr. <%= @recipient %>
Thank you for signing up!
If the recipient was given as<EMAIL_ADDRESS>the email generated would look like this:
Date: Mon, 25 Jan 2010 22:48:09 +1100
From<EMAIL_ADDRESS>To<EMAIL_ADDRESS>Message-ID<EMAIL_ADDRESS>Subject: [Signed up] Welcome<EMAIL_ADDRESS>Mime-Version: 1.0
Content-Type: text/plain;
charset="US-ASCII";
Content-Transfer-Encoding: 7bit
Hello there,
Mr<EMAIL_ADDRESS>Thank you for signing up!
In order to send mails, you simply call the method and then call deliver_now
on the return value.
Calling the method returns a Mail Message object:
=<EMAIL_ADDRESS># => Returns a Mail::Message object
.deliver_now # => delivers the email
Or you can just chain the methods together like:
Notifier.welcome("david@loudthinking.com").deliver_now # Creates the email and sends it immediately
Setting defaults
It is possible to set default values that will be used in every method in your Action Mailer class. To implement this functionality, you just call the public class method default
which you get for free from ::ActionMailer::Base
. This method accepts a Hash
as the parameter. You can use any of the headers, email messages have, like :from
as the key. You can also pass in a string as the key, like “Content-Type”, but Action Mailer does this out of the box for you, so you won’t need to worry about that. Finally, it is also possible to pass in a Proc that will get evaluated when it is needed.
Note that every value you set with this method will get overwritten if you use the same key in your mailer method.
Example:
class AuthenticationMailer < ActionMailer::Base
default from<EMAIL_ADDRESS>subject: Proc.new { "E-mail was generated at #{Time.now}" }
#.....
end
Receiving emails
To receive emails, you need to implement a public instance method called receive
that takes an email object as its single parameter. The Action Mailer framework has a corresponding class method, which is also called receive
, that accepts a raw, unprocessed email as a string, which it then turns into the email object and calls the receive instance method.
Example:
class Mailman < ActionMailer::Base
def receive(email)
page = Page.find_by(address: email.to.first)
page.emails.create(
subject: email.subject, body: email.body
)
if email.
email. .each do ||
page. .create({
file: , description: email.subject
})
end
end
end
end
This Mailman can be the target for Postfix or other MTAs. In Rails, you would use the runner in the trivial case like this:
rails runner 'Mailman.receive(STDIN.read)'
However, invoking Rails
in the runner for each mail to be received is very resource intensive. A single instance of Rails
should be run within a daemon, if it is going to process more than just a limited amount of email.
Configuration
The Base class has the full list of configuration options. Here’s an example:
ActionMailer::Base.smtp_settings = {
address: 'smtp.yourserver.com', # default: localhost
port: '25', # default: 25
user_name: 'user',
password: 'pass',
authentication: :plain # :plain, :login or :cram_md5
}
Download and installation
The latest version of Action Mailer can be installed with RubyGems:
$ gem install actionmailer
Source code can be downloaded as part of the Rails
project on GitHub:
License
Action Mailer is released under the MIT license:
Support
API documentation is at
Bug reports for the Ruby on Rails
project can be filed here:
Feature requests should be discussed on the rails-core mailing list here:


{{ define "content" }}
Welcome to Golang Bulgaria.
Not much to see here yet, one day we'll make a decent website.
Currently we are hosting a meetup in Sofia and Plovdiv. Feel free to join us!
Also you can get an invitation to our Slack.


NpnSlider is a multi range slider component using Angular v6.0. It can be used either as a multi range or a single range slider. By default, it is a multi range slider.
Selected Values: {{currentValues | json}}
By using multiRange
property, you can convert the slider as a single range slider


Gallery
Info
Home
Gallery
All works are provided by James Wakelin and Relevant Permission has been granted


| DOSE: |
1 bowl |
smoked |
Cannabis |
(tar / resin) |
It was a Monday, no school that day but I had to go the next day. I wanted to have a quick smoke to relax me so I could get a good night's sleep. I rolled up a towel and stuffed it under the door, lit an incense stick, and loaded 3 roaches into my homemade wood pipe. I smoked the bowl pretty fast, and the resinated weed was pretty potent
I then lied down and put on my current favorite CD; By The Way by Red Hot Chili Peppers. I was getting some trippy vibes as the cd played...when it got to track 4, 'dosed', my high was definately peakng. I closed my eyes and saw the most amazing thing in my life...
I was a baby, escaping from the womb. I didn't know it as it happened, but I was sliding out, being born into a busy world of bright lights, loud noises...I then realized what had just happened, and I saw all of my life, everything between the moment I was born and this second laying on my bed, flash by in a fraction of a second.
The intensity of the experience hit me like a truck. All of a sudden I felt amazing emotions all at the same time...I began to laugh, and cry at the same time at the beauty of it. The intense feeling lasted a few minutes; my mind was just racing with thoughts. I then realized something: the fast-motion version of my life I just saw WAS my whole life; it happened in a snap, just like that, that was it. I never lived before the second I was that tiny baby being born, that was the begining of it all, and time just seemed to stop into slow motion where it was...
Its hard to explain the feeling I had. It was so intense. I was positive that I had not lived before that moment; I was sure that what I saw, in a fraction of a second, was my life. my birthdays, the day I learned to surf, the first time I was introduced to the magical world of ganja, it was all there. and then it just stopped, and there I was, I had only lived for a fraction of a second
Relative to how long the earth...the universe...everything has existed, it really was a fraction of a second. That is where the amazing intensity came from.
I cried for a second, then just layed in bed, thinking about it for a long while.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Central Perk's menu includes only the finest coffees and pastries, offering many organic, gluten free, and vegan options.
Almost all of our ingredients and coffees are locally produced by small businesses, encouraging local economic growth.
Below, you will find some of our most popular products!


Aoccdrnig to a rscheearch at Cmabrigde Uinervtisy, it deosn't mttaer in waht oredr the
ltteers in a wrod are,
the olny iprmoetnt tihng is taht the frist and lsat ltteer be at the rghit pclae. The rset
can be a toatl mses
and you can sitll raed it wouthit porbelm. Tihs is bcuseae the huamn mnid deos not raed
ervey lteter by istlef,
but the wrod as a wlohe.
-- Unknown Author.
"Ennyn Durin Aran Moria. Pedo mellon a Minno. Im Narvi hain echant. Celebrimbor o Eregion
tethant. I thiw
hin"
"The Doors of Durin, Lord of Moria. Speak friend and enter. I Narvi made them. Celebrimbor
of Hollin drew these
signs."
-- "The Fellowship of the Ring" J. R. Tolkien
The Doors of Durin were opened by Gandalf and the Fellowship entered in
Moria.
As they found, this underground kingdom has gates on every passageway. Each gate has a written
message which
contains the key word. Luckily, Gimli knows how to recognize the key in these messages. It's the
most "like" word,
which has the greatest average "likeness" coefficient with other words in the message.
You are given a message. You need to pick out all words (a letter or group of letters that has meaning when spoken or written and typically shown with a space or other punctuation sign on either side when written or printed),
calculate the "likeness" coefficients with other words, take an average of them and choose the
greatest. Count
"likeness" coefficient even for the same words (of course it's 100). If several words have the
same resulting value,
then choose the word closest to the end of the message. Words in the message can be separated by
whitespaces and
punctuation. There are no numbers.
"Likeness" coefficient for two words is measured in percentages using the following rules:
- Letter case does not matter ("A" == "a");
- If the first letters of the words are equal, then add 10%;
- If the last letters of the words are equal, then add 10%;
- Add length comparison as
(length_of_word1 / length_of_word2) * 30%, if
length_of_word1 ≤ length_of_word2;
, else
(length_of_word2 / length_of_word1) * 30%
- Take all unique letters from the both words in one set and count how many letters appear in
the both words. Add to
the coefficient (common_letter_number / unique_letters_numbers) * 50;
So the maximum coefficient of likeness is 100%. For example: for the words "Bread" and "Beard".
The result should be given in the lower case.
Let's look at an example. The message "Friend Fred and friend Ted."
First, pick out words - ("friend", "fred", "and", "friend", "ted").
Next we calculate "likeness" for the first word with other.
"friend" and "fred" have the same first and last letters, so add 20.
Then length comparison: the length of "fred" is lesser than "friend", so add (4/6)*30=20.
The last rule: for these words unique letters are "definr" and the intersected letters are
"defr".
So add (4/6)*50≈33.333. And the summary is 73.333.
This way we will count all other coefficients and get the following table
(results are rounded just for simplicity). The greatest average is 62.976 and the result is
"friend".
| friend | fred | and | friend | ted |
--------|---------|---------|---------|---------|---------|
friend | ------ | 73.333 | 39.286 | 100.0 | 39.286 |
fred | 73.333 | ------ | 40.833 | 73.333 | 52.5 |
and | 39.286 | 40.833 | ------ | 39.286 | 50.0 |
friend | 100.0 | 73.333 | 39.286 | ------ | 39.286 |
ted | 39.286 | 52.5 | 50.0 | 39.286 | ------ |
--------|---------|---------|---------|---------|---------|
sum | 251.905 | 239.999 | 169.405 | 251.905 | 181.072 |
average | 62.976 | 60 | 42.351 | 62.976 | 45.268 |
Input: A message as a string (unicode)
Output: The keyword as a string.
Example:
find_word("Speak friend and enter.") == "friend"
How it is used:
This is a fabricated algorithm which can be modified and be used for linguistic research and
text pattern
recognition.
Precondition:
0 < len(message)
all(x in (string.ascii_letters + string.punctuation + " ") for x in message)


{% if post.installation %}
Behold! AppImages are usually not verified by others. Follow these instructions only if you trust the developer of the software. Use at your own risk!
{% for dist in post.installation %}Download version {{ repo.version }} and make it executable by entering the following commands in a terminal:
wget {{ repo.repository }}
chmod +x {{ repo.package }}
Of course, you can also just download {{ repo.version }}.
{% endfor %} {% endfor %} {% endif %}


White to play 62
pips White=146 Black=162
(CorrectAnswer= 0/0, ErrorScore= 0)
1. 21/13 eq: +0.223 55.12% (G:14.33% B:0.50%) 44.88% (G: 9.49% B:0.29%) 2. 22/16 6/4* eq: +0.132 (-0.091) 52.46% (G:16.31% B:0.58%) 47.54% (G:12.04% B:0.55%) 3. 21/15 6/4* eq: +0.037 (-0.186) 49.71% (G:16.89% B:0.75%) 50.29% (G:13.81% B:0.72%) 4. 13/5 eq: -0.011 (-0.234) 48.37% (G:16.58% B:0.71%) 51.63% (G:12.80% B:0.51%) 5. 22/14 eq: -0.084 (-0.307) 47.14% (G:12.76% B:0.53%) 52.86% (G:12.81% B:0.52%)


Research
Metabolic Network Analysis and Regulatory Pattern Searches
We develop and maintain software for overlaying multi-omic data upon the metabolic network and using that data to find interesting regulatory patterns within the data.
Protein-Metabolite Interaction Data Visualization and Analysis
We develop tools and models for identifying and contextualizing important protein-metabolite interaction regulatory events.
Ribosome Profiling
We develop and maintain software that aids in the uniform and automated processing of ribosome profiling sequencing data.


shenfun
div
and grad
operators, there is Dx
for a partial derivative
from shenfun import Dx
v = TestFunction(W)
du = Dx(v, 0, 1)
where the first argument to Dx
is a basis function, the second (integer) is the axis to take the derivative over, and the third (integer) is the number of derivatives, e.g.,
$$
\begin{equation}
\frac{\partial^2 v}{\partial y^2} = \text{Dx(v, 1, 2)}. \notag
\tag{61}
\end{equation}
$$
The operator can be nested. To compute \( \frac{\partial^2 u}{\partial x \partial y} \) one may do
v = TestFunction(W)
du = Dx(Dx(v, 0, 1), 1, 1)
The operators work on TestFunctions, TrialFunctions
or Functions
, where only the last actually contain any data, because a Function
is used to store the solution. Once a solution has been found, one may also manipulate it further using project
in combination with operators on Functions
. For example, to compute \( \partial u / \partial x \) of the solution to the biharmonic problem, one can do
K0 = Basis(N[0])
W0 = TensorProductSpace(comm, (K0, K1, K2))
du_hat = project(Dx(u, 0, 1), W0, uh_hat=u_hat)
du = Function(W0, False)
du = W0.backward(du_hat , du)
Note that we are here using a regular Chebyshev space (Basis
) instead of the biharmonic, to avoid enforcing erroneous boundary conditions on the solution. We could in this case also, with advantage, have chosen a Dirichlet space, since the derivative of the biharmonic problem is known to be zero on the edges of the domain (at \( x=\pm 1 \)).
All problems considered thus far have been scalar valued. With shenfun
there is also some functionality for working with vector equations. To this end, there is a class called VectorTensorProductSpace
, and there is an additional operator, curl
, that can only be used on vectors:
from shenfun.chebyshev.bases import ShenBiharmonicBasis
from shenfun.fourier.bases import R2CBasis, C2CBasis
from shenfun import Function, TensorProductSpace, VectorTensorProductSpace , curl
from shenfun import inner, curl, TestFunction
import numpy as np
from mpi4py import MPI
comm = MPI.COMM_WORLD
N = (32, 33, 34)
K0 = ShenBiharmonicBasis(N[0])
K1 = C2CBasis(N[1])
K2 = R2CBasis(N[2])
T = TensorProductSpace(comm, (K0, K1, K2))
Tk = VectorTensorProductSpace([T, T, T])
v = TestFunction(Tk)
u_ = Function(Tk, False)
u_[:] = np.random.random(u_.shape)
u_hat = Function(Tk)
u_hat = Tk.forward(u_, u_hat)
w_hat = inner(v, curl(u_), uh_hat=u_hat)
Vector equations have very similar form as scalar equations, but at the moment of writing the different equation components cannot be implicitly coupled.


Well done! Successfully read this important alert message.
Heads up! This alert needs your attentiong, but it's not super important
Warining! Better check yourself, you've not looking too good
Oh snap! Change a few things up and try submitting again.


{% extends "base.html" %} {% load hc_extras %} {% block content %}
Success! You have verified this email address, and it will now receive {{ site_name }} notifications.


Full name:
org.dellroad:dellroad-stuff-maven-plugin:2.4.0:git-describe
Description:
Attributes:
| Name | Type | Since | Description |
|---|---|---|---|
| <abbrev> | int | - | Instead of using the default 7 hexadecimal digits as the
abbreviated object name, use this many digits, or as many digits as
needed to form a unique object name. A value of 0 will suppress
long format, only showing the closest tag. Default value is: -1. User property is: abbrev. |
| <all> | boolean | - | Instead of using only the annotated tags, use any ref found in
refs/ namespace. This option enables matching any
known branch, remote-tracking branch, or lightweight tag. Default value is: false. User property is: all. |
| <always> | boolean | - | Show uniquely abbreviated commit object as fallback. Default value is: false. User property is: always. |
| <candidates> | int | - | Instead of considering only the 10 most recent tags as candidates
to describe the input consider up to this many candidates.
Increasing this value above 10 will take slightly longer but may
produce a more accurate result. A value of 0 will cause only exact
matches to be output. Default value is: -1. User property is: candidates. |
| <committish> | String | - | Commit-ish object name to describe. Defaults to HEAD
if not set. Note: this property is incompatible with
dirty. User property is: committish. |
| <contains> | boolean | - | Instead of finding the tag that predates the commit, find the tag
that comes after the commit, and thus contains it. Automatically
implies tags. Default value is: false. User property is: contains. |
| <dirty> | String | - | Describe the working tree. It means describe HEAD and
appends the configured value if the working tree is dirty. Note:
this property is incompatible with committish. User property is: dirty. |
| <encoding> | String | - | The name of the character encoding to use when converting the
command's standard output bytes into a String. Default value is: UTF-8. User property is: encoding. |
| <exactMatch> | boolean | - | Only output exact matches (a tag directly references the supplied
commit). This is the same as setting candidates to
zero. Default value is: false. User property is: exactMatch. |
| <firstParent> | boolean | - | Follow only the first parent commit upon seeing a merge commit.
This is useful when you wish to not match tags on branches merged
in the history of the target commit. Default value is: false. User property is: firstParent. |
| <longFormat> | boolean | - | Always output the long format (the tag, the number of commits and
the abbreviated commit name) even when it matches a tag. This is
useful when you want to see parts of the commit object name in
"describe" output, even when the commit in question happens to be a
tagged version. Instead of just emitting the tag name, it will
describe such a commit as v1.2-0-gdeadbee (0th commit
since tag v1.2 that points at object
deadbee....). Default value is: false. User property is: long. |
| <match> | String | - | Only consider tags matching the given glob(7) pattern,
excluding the refs/tags/ prefix. This can be used to
avoid leaking private tags from the repository. User property is: match. |
| <propertyName> | String | - | The name of the Maven property to set. Default value is: git.describe. User property is: propertyName. |
| <tags> | boolean | - | Instead of using only the annotated tags, use any tag found in
refs/tags namespace. This option enables matching a
lightweight (non-annotated) tag. Default value is: false. User property is: tags. |
| <trim> | boolean | - | Whether to trim whitespace before setting the property value. Default value is: true. User property is: trim. |
| <workingDirectory> | File | - | The git(1) working directory where the code is checked
out. Default value is: ${project.basedir}. User property is: workingDirectory. |


Thinking in C: Foundations for Java
& C++, by Chuck Allison (a MindView, Inc.
Seminar-on-CD ROM, ©2000, bound into the back of this book and also
available at www.BruceEckel.com). This is a course including lectures and
slides in the foundations of the C Language to prepare you to learn Java or C++.
This is not an exhaustive course in C; only the necessities for moving on to the
other languages are included. Additional language-specific sections introduce
features for the C++ or Java programmer-to-be. Recommended prerequisite: some
experience with a high-level programming language, such as Pascal, BASIC,
Fortran, or LISP (it’s possible to struggle through the CD without this
background, but the course isn’t designed to be an introduction to the
basics of programming).
The C++ Programming Language,
3rd edition, by Bjarne Stroustrup
(Addison-Wesley 1997). To some degree, the goal of the book that you’re
currently holding is to allow you to use Bjarne’s book as a reference.
Since his book contains the description of the language by the author of that
language, it’s typically the place where you’ll go to resolve any
uncertainties about what C++ is or isn’t supposed to do. When you get the
knack of the language and are ready to get serious, you’ll need
it.
C++ Primer, 3rd
Edition, by Stanley Lippman and
Josee Lajoie (Addison-Wesley 1998). Not that much of a
primer anymore; it’s evolved into a thick book filled with lots of detail,
and the one that I reach for along with Stroustrup’s when trying to
resolve an issue. Thinking in C++ should provide a basis for
understanding the C++ Primer as well as Stroustrup’s
book.
C & C++ Code Capsules, by
Chuck Allison (Prentice-Hall, 1998). This book assumes
that you already know C and C++, and covers some of the issues that you may be
rusty on, or that you may not have gotten right the first time. This book fills
in C gaps as well as C++ gaps.
The C++ Standard. This is the
document that the committee worked so hard on for all those years. This is
not free, unfortunately. But at least you can buy the electronic form in
PDF for only $18 at
www.cssinfo.com.
Listed in order of publication. Not all
of these are currently available.
Computer Interfacing with Pascal &
C (Self-published via the Eisys imprint, 1988. Only available via
www.BruceEckel.com). An introduction to electronics from back when CP/M
was still king and DOS was an upstart. I used high-level languages and often the
parallel port of the computer to drive various electronic projects. Adapted from
my columns in the first and best magazine I wrote for, Micro Cornucopia
(To paraphrase Larry O’Brien, long-time editor of Software
Development Magazine: the best computer magazine ever published – they
even had plans for building a robot in a flower pot!) Alas, Micro C became lost
long before the Internet appeared. Creating this book was an extremely
satisfying publishing experience.
Using C++ (Osborne/McGraw-Hill
1989). One of the first books out on C++. This is out of print and replaced by
its second edition, the renamed C++ Inside & Out.
C++ Inside & Out
(Osborne/McGraw-Hill 1993). As noted, actually the 2nd edition of
Using C++. The C++ in this book is reasonably accurate, but it's circa
1992 and Thinking in C++ is intended to replace it. You can find out more
about this book and download the source code at
www.BruceEckel.com.
Thinking in C++, 1st
edition (Prentice-Hall 1995).
Black Belt C++, the Master’s
Collection, Bruce Eckel, editor (M&T Books 1994). Out of print. A
collection of chapters by various C++ luminaries based on their presentations in
the C++ track at the Software Development Conference, which I chaired. The cover
on this book stimulated me to gain control over all future cover
designs.
Thinking in Java, 2nd
edition (Prentice-Hall, 2000). The first edition of this book won the
Software Development Magazine Productivity Award and the Java
Developer’s Journal Editor’s Choice Award in 1999. Downloadable
from www.BruceEckel.com.
These books go more deeply into language
topics, and help you avoid the typical pitfalls inherent in developing C++
programs.
Effective C++ (2nd
Edition, Addison-Wesley 1998) and More Effective C++ (Addison-Wesley
1996), by Scott Meyers. The classic, must-have texts for
serious problem-solving and code design in C++. I’ve tried to capture and
express many of the concepts from these books in Thinking in C++, but I
don’t fool myself in thinking that I’ve succeeded. If you spend any
serious time with C++ you’ll end up with these books. Also available on CD
ROM.
Ruminations on C++, by
Andrew Koenig and Barbara Moo
(Addison-Wesley, 1996). Andrew worked directly with Stroustrup on many aspects
of the C++ language and is an extremely reliable authority. I’ve also
found the incisiveness of his insights to be refreshing, and have learned much
from him, both in print and in person, over the years.
Large-Scale C++ Software Design,
by John Lakos (Addison-Wesley, 1996). Covers
issues and answers questions you will encounter during the creation of big
projects, but often smaller ones as well.
C++ Gems, Stan Lippman, editor
(SIGS publications, 1996). A selection of articles from The C++
Report.
The Design & Evolution of C++,
by Bjarne Stroustrup (Addison-Wesley 1994). Insights
from the inventor of C++ about why he made various design decisions. Not
essential, but interesting.
Extreme Programming Explained by
Kent Beck (Addison-Wesley 2000). I love this
book. Yes, I tend to take a radical approach to things but I've always felt that
there could be a much different, much better program development process, and I
think XP comes pretty darn close. The only book that has had a similar impact on
me was PeopleWare (described below), which talks primarily about the
environment and dealing with corporate culture. Extreme Programming
Explained talks about programming, and turns most things, even recent
“findings,” on their ear. They even go so far as to say that
pictures are OK as long as you don’t spend too much time on them and are
willing to throw them away. (You’ll notice that this book does not
have the “UML stamp of approval” on its cover.) I could see
deciding whether to work for a company based solely on whether they used XP.
Small book, small chapters, effortless to read, exciting to think about. You
start imagining yourself working in such an atmosphere and it brings visions of
a whole new world.
UML
Distilled by Martin Fowler (2nd edition,
Addison-Wesley, 2000). When you first encounter UML, it is daunting because
there are so many diagrams and details. According to Fowler, most of this stuff
is unnecessary so he cuts through to the essentials. For most projects, you only
need to know a few diagramming tools, and Fowler’s goal is to come up with
a good design rather than worry about all the artifacts of getting there. A
nice, thin, readable book; the first one you should get if you need to
understand UML.
The Unified Software Development
Process by Ivar Jacobsen, Grady
Booch, and James Rumbaugh
(Addison-Wesley 1999). I went in fully prepared to dislike this book. It seemed
to have all the makings of a boring college text. I was pleasantly surprised
– only pockets of the book contain explanations that seem as if those
concepts aren’t clear to the authors. The bulk of the book is not only
clear, but enjoyable. And best of all, the process makes a lot of practical
sense. It’s not Extreme Programming (and does not have their clarity about
testing) but it’s also part of the UML juggernaut – even if you
can’t get XP adopted, most people have climbed aboard the “UML is
good” bandwagon (regardless of their actual level of experience
with it) and so you can probably get it adopted. I think this book should be the
flagship of UML, and the one you can read after Fowler’s UML
Distilled when you want more detail.
Before you choose any method, it’s
helpful to gain perspective from those who are not trying to sell one.
It’s easy to adopt a method without really understanding what you want out
of it or what it will do for you. Others are using it, which seems a compelling
reason. However, humans have a strange little psychological quirk: If they want
to believe something will solve their problems, they’ll try it. (This is
experimentation, which is good.) But if it doesn’t solve their problems,
they may redouble their efforts and begin to announce loudly what a great thing
they’ve discovered. (This is denial, which is not good.) The assumption
here may be that if you can get other people in the same boat, you won’t
be lonely, even if it’s going nowhere (or sinking).
This is not to suggest that all
methodologies go nowhere, but that you should be armed to the teeth with mental
tools that help you stay in experimentation mode (“It’s not working;
let’s try something else”) and out of denial mode (“No,
that’s not really a problem. Everything’s wonderful, we don’t
need to change”). I think the following books, read before you
choose a method, will provide you with these tools.
Software Creativity, by Robert
Glass (Prentice-Hall, 1995). This is the best book
I’ve seen that discusses perspective on the whole methodology
issue. It’s a collection of short essays and papers that Glass has written
and sometimes acquired (P.J. Plauger is one
contributor), reflecting his many years of thinking and study on the subject.
They’re entertaining and only long enough to say what’s necessary;
he doesn’t ramble and bore you. He’s not just blowing smoke, either;
there are hundreds of references to other papers and studies. All programmers
and managers should read this book before wading into the methodology
mire.
Software Runaways: Monumental Software
Disasters, by Robert Glass (Prentice-Hall 1997). The great thing about this
book is that it brings to the forefront what we don’t talk about: how many
projects not only fail, but fail spectacularly. I find that most of us still
think “That can’t happen to me” (or “That can’t
happen again”) and I think this puts us at a disadvantage. By
keeping in mind that things can always go wrong, you’re in a much better
position to make them go right.
Peopleware, by Tom
Demarco and Timothy Lister
(Dorset House, 2nd edition 1999). Although they have backgrounds in
software development, this book is about projects and teams in general. But the
focus is on the people and their needs rather than the technology and its
needs. They talk about creating an environment where people will be happy and
productive, rather than deciding what rules those people should follow to be
adequate components of a machine. This latter attitude, I think, is the biggest
contributor to programmers smiling and nodding when XYZ method is adopted and
then quietly doing whatever they’ve always done.
Complexity, by M. Mitchell
Waldrop (Simon & Schuster, 1992). This chronicles
the coming together of a group of scientists from different disciplines in Santa
Fe, New Mexico, to discuss real problems that the individual disciplines
couldn’t solve (the stock market in economics, the initial formation of
life in biology, why people do what they do in sociology, etc.). By crossing
physics, economics, chemistry, math, computer science, sociology, and others, a
multidisciplinary approach to these problems is developing. But more
importantly, a different way of thinking about these ultra-complex
problems is emerging: Away from mathematical determinism and the illusion that
you can write an equation that predicts all behavior and toward first
observing and looking for a pattern and trying to emulate that pattern by
any means possible. (The book chronicles, for example, the emergence of genetic
algorithms.) This kind of thinking, I believe, is useful as we observe ways to
manage more and more complex software projects.


Birmingham woman transforms empty cupboard under stairs into incredible 'bedroom’ for her dog
The woman revealed what was once a bare box room with grey carpet and white walls has been given a modern revamp with marble-style tiles
by James Rodger, Amber Hicks, https://www.facebook.com/jamesrodgerjournalistA Birmingham woman has revealed how she transformed an empty cupboard under her stairs into a bedroom - for her dog.
The woman, from the Second City, revealed the incredible transformation which has seen her create an adorable bedroom for her Labrador.
The Lab, named Luther, is enjoying his new home - with plenty of blankets to keep him snug, as well as a cosy bed.
The images have been posted on social media, with home lovers flocking to laud the Birmingham woman after she shared her transformation.
She created the heavenly environment for her pup and has subsequently been branded the "best human ever".
Facebook users who are members of a popular DIY group have taken to the social networking platform to give feedback.
The woman revealed what was once a bare box room with grey carpet and white walls has been given a modern revamp with marble-style tiles.
The walls have decorated using a combination of pale green tiles and wallpaper, while a number of shelves house Luther's treats, reports the Mirror.
The thrifty decorator captioned the post: "Wasn’t using my under stairs cupboard so made my Labrador a bedroom."
One person replied: "This is a great idea."
Another wrote: "Absolutely LOVE. Your pet is treated better than some people probably has a nicer pad too! Fantastic."
One social media user quipped it was "better than Harry Potter’s under stair bedroom".
Another gushed: "This is the cutest thing! You are the best human.'


private fun chooseLayersDialog(): Unit
Displays a dialog allowing the user to choose the number of layers shown on the tree. If there is no tree being displayed, a Snackbar error message will be shown instead.


Defines | |
| #define | BLE_NVID_IRK 0x02 |
| The Device's IRK. | |
| #define | BLE_NVID_CSRK 0x03 |
| The Device's CSRK. | |
| #define | BLE_NVID_SIGNCOUNTER 0x04 |
| The Device's Sign Counter. | |
| #define | BLE_NVID_GAP_BOND_START 0x20 |
| Start of the GAP Bond Manager's NV IDs. | |
| #define | BLE_NVID_GAP_BOND_END 0x5f |
| End of the GAP Bond Manager's NV IDs Range. | |
| #define | BLE_NVID_GATT_CFG_START 0x70 |
| Start of the GATT Configuration NV IDs. | |
| #define | BLE_NVID_GATT_CFG_END 0x79 |
| End of the GATT Configuration NV IDs. |


A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
GatewayBOT19-Jun-18 12:05 PM
[slack] <hollowman9000> Kill everything
[slack] <hollowman9000> 132 hours without nicotine
Cryptoon19-Jun-18 12:29 PM
tradewar not good for business
smk762 - dracocanis ominator19-Jun-18 12:35 PM
weaponising space might be lucrative tho
Cryptoon19-Jun-18 12:54 PM
lucrative for whom?
smk762 - dracocanis ominator19-Jun-18 12:54 PM
milspace complex
gotta secure that border from the greys
and claim all the minable asteroids
RAE19-Jun-18 12:57 PM
SpaceForce! - Can people get a grunt position, like a space rifleman?
smk762 - dracocanis ominator19-Jun-18 12:59 PM
service guarantees citizenship
RAE19-Jun-18 12:59 PM
I think I saw that in a movie once ...
smk762 - dracocanis ominator19-Jun-18 01:00 PM
hollywood plants the seed
RAE19-Jun-18 01:02 PM
agreed, hopefully that seed is not an egg ... a crab-like alien egg
smk762 - dracocanis ominator19-Jun-18 01:03 PM
Build a wall on the ground, and only let through those that defend the wall in orbit.
RAE19-Jun-18 01:09 PM
that's one intense citizenship test and would thoroughly weed out the bad actors - gallant space record required
smk762 - dracocanis ominator19-Jun-18 01:09 PM
Orbital customs officers, to enfore tarrifs on Martian trinkets
RAE19-Jun-18 01:11 PM
Back to trading ... I know this is Verus, but KMD is showing weak atm, touching 31 RSI and well below the 15 day MA.
smk762 - dracocanis ominator19-Jun-18 01:11 PM
intergalactic TSA
RAE19-Jun-18 01:11 PM
What would you tariff from Mars do you reckon?
smk762 - dracocanis ominator19-Jun-18 01:13 PM
Electric cars, soybeans and whiskey.
RAE19-Jun-18 01:13 PM
Wait. Just wait a minute. I'm not on Verus!
Wrong channel, wrong planet as well.
smk762 - dracocanis ominator19-Jun-18 01:14 PM
KMD is such a convincing buy I overbought
1
RAE19-Jun-18 01:14 PM
Yes KMD is tempting at these levels
smk762 - dracocanis ominator19-Jun-18 01:14 PM
this week its beans for breakfast, water for lunch, and swell up for dinner.
RAE19-Jun-18 01:15 PM
One day we will all be able to afford chorizo with KMD, but until then we must eat the bean.
smk762 - dracocanis ominator19-Jun-18 01:16 PM
havent bought anything for a couple months, seemed now was a good time
RAE19-Jun-18 01:18 PM
Yeah I reckon now is a good time, KMD and BTC levels have been back and forth 3 waves now ... whole market has really between 275 - 291 billion total marketcap.
Deleted User19-Jun-18 01:18 PM
chorizo?
smk762 - dracocanis ominator19-Jun-18 01:18 PM
the BIS report was the final signal for me
RAE19-Jun-18 01:18 PM
Chorizo is a spiced Spanish sausage
smk762 - dracocanis ominator19-Jun-18 01:19 PM
next week or two, there'll be a bit of counterhype in msm
Deleted User19-Jun-18 01:19 PM
claro que sí, una delicia
smk762 - dracocanis ominator19-Jun-18 01:19 PM
i prefer quality meats over lambos
Deleted User19-Jun-18 01:19 PM
i thought that we were heading towards lambos, not chorizos
but yeah, yummy
smk762 - dracocanis ominator19-Jun-18 01:20 PM
it'll be a lot of chorizo
1
RAE19-Jun-18 01:20 PM
Yes, a special delight that chorizo is my friend Siamo ... indeed this a special meat.
smk762 - dracocanis ominator19-Jun-18 01:21 PM
now im hungry
RAE19-Jun-18 01:22 PM
Great conversation friends, however I must retire to the bed chamber then wake up for work in the morning. Out
smk762 - dracocanis ominator19-Jun-18 01:23 PM
peace. 10 minutes we find out how wall street responds
The Bank for International Settlements just told the cryptocurrency world it’s not ready for prime time -- and as far as mainstream financial services go, may never be.
If only bloomberg would notice komodo senpai
Its as if theyre describing exactly what komodo fixes
Scaling, price fluctuations, pow electricity wastage, exchange hacks
Oh if only they knew
3
smk762 - dracocanis ominator19-Jun-18 01:45 PM
love how they imply it's not worth continuing and remain ignorant of how quick tech adapts
these secret society dudes are all mr burns. no idea. used to manipulating slowly, plans spanning generations. tech moves quick enough to slip out of their control
Deleted User19-Jun-18 01:50 PM
you hit the nail on the head @smk762 - dracocanis ominator
ComputerGenie19-Jun-18 02:10 PM
"Its as if theyre describing exactly what komodo fixes
... price fluctuations, pow electricity wastage..."
True story: KMD hasn't fluctuated -85% from Dec. 21 and I don't have a $2k USD electric bill...
I love Komodo as much or more than the next guy; but, let's not all line up in a circle just yet(edited)
smk762 - dracocanis ominator19-Jun-18 02:12 PM
name checks out
cant control market fluctuations. Energy use is relative.
I venture cryptomining collectivley is on par or less than traditional banking
ComputerGenie19-Jun-18 02:14 PM
"cant control market fluctuations" that was my point
smk762 - dracocanis ominator19-Jun-18 02:14 PM
one komodo is still one komodo tho
or maybe 1.05 KMD
ComputerGenie19-Jun-18 02:16 PM
a half-penny is still a half-penny too
didn't stop me from selling one for $1800 last year, though
smk762 - dracocanis ominator19-Jun-18 02:19 PM
numis are whacky
nice haul
ComputerGenie19-Jun-18 02:19 PM
Bitpanda is a good start, but until KMD has a retail market or generalized fiat exchanges, we're still tied to the same insane fluctuations of BTC
Deleted User19-Jun-18 02:21 PM
The price part was a joke
Electricity as in dPoW
Other pow coins getting notarized
Scaling is going well
Exchange hacks/ico hacks and kmds dIco
smk762 - dracocanis ominator19-Jun-18 02:21 PM
itll keep influencing the market in general as long as it is dominant. Sick as I am hearing about bcash vs bcoin, Id like to see a rebalance of market share for the benefit of crypto in general
Deleted User19-Jun-18 02:22 PM
Etc etc. I didnt mean kmd will be the currency of the future, just that komodo fixes most of the problems they were talking about in the article
ComputerGenie19-Jun-18 02:22 PM
dPoW adds electricity
smk762 - dracocanis ominator19-Jun-18 02:23 PM
the efficiency gain far outweighs the additional energy consumption
ComputerGenie19-Jun-18 02:24 PM
that depends on scale; the larger it becomes, the more that is true
Deleted User19-Jun-18 02:25 PM
Well in a sense it can secure another blockchain with bitcoins hashrate, without using all the electricity from mining bitcoin? Recycling?Idk (edited)
Save the world one blockchain at a time
smk762 - dracocanis ominator19-Jun-18 02:25 PM
scale potential is significant. just need to fill it.
2
ComputerGenie19-Jun-18 02:28 PM
@Deleted User never forget that the BTC hash is just a now thing; going on @smk762 - dracocanis ominator 's claim, if a more efficient, more secure chain came into the lead then the savings would be exponentially greater(edited)
smk762 - dracocanis ominator19-Jun-18 02:29 PM
flexibility to adapt is great advantage for evolving
ComputerGenie19-Jun-18 02:29 PM
indeed, one of the things I love about the way it's done
GatewayBOT19-Jun-18 02:30 PM
[slack] <tolken> I love this short-list on Bitpanda: “Buy and sell any supported cryptocurrency you want, from Bitcoin to Ethereum, Dash, Litecoin, Bitcoin Cash, Ripple, Komodo and IOTA.”
[slack] <tolken> Yea, Komodo. The blackout being lifted? :)
PSA: If you think the #EOS launch was chaotic, wait until #TRON launches in a couple of days... I also happened to have reviewed the entire $TRX codebase.
My eyes hurt.
They should rebrand to "TRON: the Frankenstein of crypto." Learn more


|
SimpleITK
|
Morphological watershed transform from markers. More...
#include <sitkMorphologicalWatershedFromMarkersImageFilter.h>
Public Types | |
| using | PixelIDTypeList = ScalarPixelIDTypeList |
| using | Self = MorphologicalWatershedFromMarkersImageFilter |
| Public Types inherited from itk::simple::ImageFilter | |
| using | Self = ImageFilter |
| Public Types inherited from itk::simple::ProcessObject | |
| using | Self = ProcessObject |
Public Member Functions | |
| Image | Execute (const Image &image, const Image &markerImage) |
| Self & | FullyConnectedOff () |
| Self & | FullyConnectedOn () |
| bool | GetFullyConnected () const |
| bool | GetMarkWatershedLine () const |
| std::string | GetName () const |
| Self & | MarkWatershedLineOff () |
| Self & | MarkWatershedLineOn () |
| MorphologicalWatershedFromMarkersImageFilter () | |
| Self & | SetFullyConnected (bool FullyConnected) |
| Self & | SetMarkWatershedLine (bool MarkWatershedLine) |
| std::string | ToString () const |
| virtual | ~MorphologicalWatershedFromMarkersImageFilter () |
| Public Member Functions inherited from itk::simple::ImageFilter | |
| ImageFilter () | |
| virtual | ~ImageFilter ()=0 |
| Public Member Functions inherited from itk::simple::ProcessObject | |
| virtual void | Abort () |
| virtual int | AddCommand (itk::simple::EventEnum event, const std::function< void()> &func) |
| Directly add a callback to observe an event. More... | |
| virtual int | AddCommand (itk::simple::EventEnum event, itk::simple::Command &cmd) |
| Add a Command Object to observer the event. More... | |
| virtual float | GetProgress () const |
| An Active Measurement of the progress of execution. More... | |
| virtual bool | HasCommand (itk::simple::EventEnum event) const |
| Query of this object has any registered commands for event. More... | |
| ProcessObject () | |
| virtual void | RemoveAllCommands () |
| Remove all registered commands. More... | |
| virtual | ~ProcessObject () |
| virtual void | DebugOn () |
| virtual void | DebugOff () |
| virtual bool | GetDebug () const |
| virtual void | SetDebug (bool debugFlag) |
| virtual void | SetNumberOfThreads (unsigned int n) |
| virtual unsigned int | GetNumberOfThreads () const |
| virtual void | SetNumberOfWorkUnits (unsigned int n) |
| virtual unsigned int | GetNumberOfWorkUnits () const |
Private Types | |
| using | MemberFunctionType = Image(Self::*)(const Image *image, const Image *markerImage) |
Private Member Functions | |
| template<class TImageType1 , class TImageType2 > | |
| Image | DualExecuteInternal (const Image *image, const Image *markerImage) |
Private Attributes | |
| std::unique_ptr< detail::DualMemberFunctionFactory< MemberFunctionType > > | m_DualMemberFactory |
| bool | m_FullyConnected {false} |
| bool | m_MarkWatershedLine {true} |
Friends | |
| struct | detail::DualExecuteInternalAddressor< MemberFunctionType > |
Additional Inherited Members | |
| Static Public Member Functions inherited from itk::simple::ProcessObject | |
| static bool | GetGlobalDefaultDebug () |
| static void | GlobalDefaultDebugOff () |
| static void | GlobalDefaultDebugOn () |
| static void | SetGlobalDefaultDebug (bool debugFlag) |
| static void | GlobalWarningDisplayOn () |
| static void | GlobalWarningDisplayOff () |
| static void | SetGlobalWarningDisplay (bool flag) |
| static bool | GetGlobalWarningDisplay () |
| static double | GetGlobalDefaultCoordinateTolerance () |
| Access the global tolerance to determine congruent spaces. More... | |
| static void | SetGlobalDefaultCoordinateTolerance (double) |
| Access the global tolerance to determine congruent spaces. More... | |
| static double | GetGlobalDefaultDirectionTolerance () |
| Access the global tolerance to determine congruent spaces. More... | |
| static void | SetGlobalDefaultDirectionTolerance (double) |
| Access the global tolerance to determine congruent spaces. More... | |
| static bool | SetGlobalDefaultThreader (const std::string &threader) |
| Set/Get the default threader used for process objects. More... | |
| static std::string | GetGlobalDefaultThreader () |
| Set/Get the default threader used for process objects. More... | |
| static void | SetGlobalDefaultNumberOfThreads (unsigned int n) |
| static unsigned int | GetGlobalDefaultNumberOfThreads () |
| Set/Get the default threader used for process objects. More... | |
| Protected Member Functions inherited from itk::simple::ImageFilter | |
| void | CheckImageMatchingDimension (const Image &image1, const Image &image2, const std::string &image2Name) |
| void | CheckImageMatchingPixelType (const Image &image1, const Image &image2, const std::string &image2Name) |
| void | CheckImageMatchingSize (const Image &image1, const Image &image2, const std::string &image2Name) |
| Protected Member Functions inherited from itk::simple::ProcessObject | |
| virtual unsigned long | AddITKObserver (const itk::EventObject &, itk::Command *) |
| virtual itk::ProcessObject * | GetActiveProcess () |
| virtual void | OnActiveProcessDelete () |
| virtual void | onCommandDelete (const itk::simple::Command *cmd) noexcept |
| virtual void | PreUpdate (itk::ProcessObject *p) |
| virtual void | RemoveITKObserver (EventCommand &e) |
| Protected Member Functions inherited from itk::simple::NonCopyable | |
| NonCopyable ()=default | |
| NonCopyable (const NonCopyable &)=delete | |
| NonCopyable & | operator= (const NonCopyable &)=delete |
| Static Protected Member Functions inherited from itk::simple::ImageFilter | |
| template<class TImageType > | |
| static void | FixNonZeroIndex (TImageType *img) |
| Static Protected Member Functions inherited from itk::simple::ProcessObject | |
| template<class TImageType > | |
| static TImageType::ConstPointer | CastImageToITK (const Image &img) |
| template<class TPixelType , unsigned int VImageDimension, unsigned int VLength, template< typename, unsigned int > class TVector> | |
| static Image | CastITKToImage (itk::Image< TVector< TPixelType, VLength >, VImageDimension > *img) |
| template<unsigned int VImageDimension, unsigned int VLength, template< unsigned int > class TVector> | |
| static Image | CastITKToImage (itk::Image< TVector< VLength >, VImageDimension > *img) |
| template<class TImageType > | |
| static Image | CastITKToImage (TImageType *img) |
| static const itk::EventObject & | GetITKEventObject (EventEnum e) |
| template<typename T > | |
| static std::ostream & | ToStringHelper (std::ostream &os, const T &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const char &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const signed char &v) |
| static std::ostream & | ToStringHelper (std::ostream &os, const unsigned char &v) |
Morphological watershed transform from markers.
The watershed transform is a tool for image segmentation that is fast and flexible and potentially fairly parameter free. It was originally derived from a geophysical model of rain falling on a terrain and a variety of more formal definitions have been devised to allow development of practical algorithms. If an image is considered as a terrain and divided into catchment basins then the hope is that each catchment basin would contain an object of interest.
The output is a label image. A label image, sometimes referred to as a categorical image, has unique values for each region. For example, if a watershed produces 2 regions, all pixels belonging to one region would have value A, and all belonging to the other might have value B. Unassigned pixels, such as watershed lines, might have the background value (0 by convention).
The simplest way of using the watershed is to preprocess the image we want to segment so that the boundaries of our objects are bright (e.g apply an edge detector) and compute the watershed transform of the edge image. Watershed lines will correspond to the boundaries and our problem will be solved. This is rarely useful in practice because there are always more regional minima than there are objects, either due to noise or natural variations in the object surfaces. Therefore, while many watershed lines do lie on significant boundaries, there are many that don't. Various methods can be used to reduce the number of minima in the image, like thresholding the smallest values, filtering the minima and/or smoothing the image.
This filter use another approach to avoid the problem of over segmentation: it let the user provide a marker image which mark the minima in the input image and give them a label. The minima are imposed in the input image by the markers. The labels of the output image are the label of the marker image.
The morphological watershed transform algorithm is described in Chapter 9.2 of Pierre Soille's book "Morphological Image Analysis: Principles and Applications", Second Edition, Springer, 2003.
This code was contributed in the Insight Journal paper: "The watershed transform in ITK - discussion and new developments" by Beare R., Lehmann G. https://www.insight-journal.org/browse/publication/92
Definition at line 62 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
private |
Setup for member function dispatching
Definition at line 120 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
| using itk::simple::MorphologicalWatershedFromMarkersImageFilter::PixelIDTypeList = ScalarPixelIDTypeList |
Define the pixels types supported by this filter
Definition at line 74 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
| using itk::simple::MorphologicalWatershedFromMarkersImageFilter::Self = MorphologicalWatershedFromMarkersImageFilter |
Definition at line 64 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
virtual |
Destructor
| itk::simple::MorphologicalWatershedFromMarkersImageFilter::MorphologicalWatershedFromMarkersImageFilter | ( | ) |
Default Constructor that takes no arguments and initializes default parameters
|
private |
| Image itk::simple::MorphologicalWatershedFromMarkersImageFilter::Execute | ( | const Image & | image, |
| const Image & | markerImage | ||
| ) |
Execute the filter on the input image
|
inline |
Definition at line 99 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set the value of FullyConnected to true or false respectfully.
Definition at line 98 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set/Get whether the connected components are defined strictly by face connectivity or by face+edge+vertex connectivity. Default is FullyConnectedOff. For objects that are 1 pixel wide, use FullyConnectedOn.
Definition at line 104 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set/Get whether the watershed pixel must be marked or not. Default is true. Set it to false do not only avoid writing watershed pixels, it also decrease algorithm complexity.
Definition at line 90 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inlinevirtual |
Name of this class
Implements itk::simple::ProcessObject.
Definition at line 107 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Definition at line 85 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set the value of MarkWatershedLine to true or false respectfully.
Definition at line 84 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set/Get whether the connected components are defined strictly by face connectivity or by face+edge+vertex connectivity. Default is FullyConnectedOff. For objects that are 1 pixel wide, use FullyConnectedOn.
Definition at line 95 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
inline |
Set/Get whether the watershed pixel must be marked or not. Default is true. Set it to false do not only avoid writing watershed pixels, it also decrease algorithm complexity.
Definition at line 81 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
virtual |
Print ourselves out
Reimplemented from itk::simple::ProcessObject.
|
friend |
Definition at line 122 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
private |
Definition at line 126 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
private |
Definition at line 132 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.
|
private |
Definition at line 130 of file sitkMorphologicalWatershedFromMarkersImageFilter.h.


Episode 49 - Was Stonehenge built using pig fat?
Neolithic people sure knew how to play with their food.
Read More ›
Episode 48 - Can your brain see into the future?
Well, it all depends on how you define future...but yeah!
Read More ›
Episode 47 - How can you measure the expansion of the universe?
...and how do you even start to measure it?

Activation of a special type of fat by caffeine molecules could hold the answer...
Read More ›
Episode 45 - Can seals learn to sing and talk?
How did spoken language evolve? Seals may hold some of the clues...
Read More ›
Episode 44 - Is the Critical Brain Hypothesis Correct?
Cells in your brain may always be on the verge of an "avalanche"...
Read More ›
Episode 43 - Does human endurance have a hard limit?
Just how much energy can the human body exert?
Read More ›
Episode 42 - Did supernovae make us walk upright?
Could radiation from stars have prompted ancient humans to walk upright?
Read More ›
Episode 41 - How deep does bomb carbon go?
How deep must we go in the ocean before we no longer see human traces?
Read More ›
Episode 40 - Are synthetic genomes in our future?
Can we change the building blocks of life and create synthetic organisms?
Read More ›
Episode 39 - Are moonquakes reshaping the Moon?
There's been renewed interest in the moon, but what do we still have left to learn about it?
Read More ›
Episode 38 - How bad is the Replication Crisis?
Science depends on the repeatability of experiments, but it turns out many high-profile studies are not repeatable...
Read More ›
Episode 37 - Is there a wrong side of the time zone?
Daylight Savings Time gets a bad rap every year when it's time to turn the clocks forward, but DST has a friend no one warned you about...

Within minutes after death, brain tissue begins to degrade...but could new techniques extend their life?

Dubstep could make a great bug repellant.
Read More ›
Episode 34 - How do you image a black hole?
The incredible science behind this groundbreaking photo.
Read More ›
Episode 33 - Are eggs really bad for you?
This breakfast controversy keeps getting worse.
Read More ›
Episode 32 - Does space affect male and female astronauts differently?
Man or woman, space is a tough place to live.
Read More ›
Episode 31 - Did F-words come from a change in diet?
A new study is shaking up the field of linguistics.
Read More ›
Episode 30 - Why does pain hurt?
Your grunting and whining could be coming from just a few neurons.
Read More ›
Episode 29 - Is Titan's organic atmosphere coming from its core?
The only known moon with an atmosphere has remained mysterious for decades.
Read More ›
Episode 28 - How did tardigrades become immortal?
These resilient little creatures may hold the keys to human longevity.
Read More ›
Episode 27 - Are female brains really 'more youthful'?
Male brains may age sooner than their female counterparts.
Read More ›
Episode 26 - Can you understand talking brain waves?
You may one day be able to speak using only your thoughts.
Read More ›
Episode 25 - How did the Curiosity rover weigh a mountain on Mars?
Scientists converted a simple instrument into a scale for mountains.
Read More ›
Episode 24 - How can 3D printed filters improve chemotherapy?
A breakthrough technology could make chemo less harmful and more effective.
Read More ›
Episode 23 - What's making Maine's giant ice disk spin?
A 300-foot ice disk is spinning in a river and scientists aren't sure why.
Read More ›
Episode 22 - Can an LED control your nervous system?
A new field called Optogenetics could revolutionize human gene therapy.
Read More ›
Episode 21 - Did Leonardo da Vinci have strabismus?
A rare eye condition may have helped the genius with painting.
Read More ›
Episode 20 - How often did humans breed with Neanderthals?
Our ancestors did the cross-species deed, and it's in your DNA.
Read More ›
Episode 19 - Does negative mass explain dark matter?
95% of the universe is "dark matter," but what is that exactly?
Read More ›
Episode 18 - How does an ion plane actually fly?
A new plane design from MIT could revolutionize aerospace.
Read More ›
Episode 17 - Did climate change cause the Great Dying?
The foreboding science behind history's worst mass extinction event.
Read More ›
Episode 16 - Can you prove you're human in one word?
A new "minimal Turing test" is harder to beat than you think.
Read More ›
Episode 15 - How hard was the Insight landing on Mars?
The "6 minutes of terror" came from years of work.
Read More ›
Episode 14 - Is paralysis a thing of the past?
Spinal stimulation may be able to work miracles.
Read More ›
Episode 13 - Is Oumuamua an alien spacecraft?

Read More ›
Episode 12 - Does cloud seeding work?
A simple technique lets scientists alter the weather.
Read More ›
Episode 11 - How many faces do you know?
If you're bad with faces, you may have a new scientific excuse.

Genetic engineering puts scientists in a moral dilemma.
Read More ›
Episode 9 - Can we terraform Mars?
The red planet may be less hospitable than you hoped.
Read More ›
Episode 8 - Can you hear meteors?
When you wish upon a star, keep your ears peeled.

Read More ›
Episode 6 - What are microwave weapons?
The scary science behind the US embassy attacks in Cuba.
Read More ›
Episode 5 - Can goats read your face?
Goats may be able to recognize human emotions.
Read More ›
Episode 4 - Is pollution hurting your cognition?
You may want to move out of the city.
Read More ›
Episode 3 - Saturn is whistling to Enceladus
The "song of the summer" comes from deep space.
Read More ›
Episode 2 - How to find water on Mars
Don't plan a beach trip yet though...
Read More ›
Episode 1 - How do spiders fly?
Who even knew spiders could fly?
Read More ›


Medicare Open Enrollment: Now’s the time!
By: Marilyn Tavenner, Acting Administrator
It’s picking season – pumpkins, apples, Halloween candy…and a Medicare health or drug plan. Today is the start of Medicare Open Enrollment!
In my work with Medicare, one of the questions people ask me often is which plan is the best one. That’s not something I can answer, because picking a plan is an important and personal decision. Each person has a unique set of priorities. How do you weigh your options? Now’s the time to think about what matters to you, and pick the Medicare plan that meets your needs.
When you sit down to review your Medicare health and drug plan choices this year, keep track of the things you may want in a plan, and pick one that’s right for you. Here are some things to keep in mind while you consider your choices:
Costs
You should look at your current health care costs to find coverage that works with your financial situation. How much are your premiums and deductibles? How much do you pay for hospital stays and doctor visits? Just like with everything else, the lowest-premium health plan option might not be the best choice for you.
Coverage
Are the services you need covered? We know future health care needs can be hard to predict, but changes happen. Maybe your doctor changed your prescriptions this year or you have different health concerns. Make sure you understand what services and benefits you’re likely to use in the coming year and find coverage that meets your needs.
Convenience
Your time is valuable. When comparing plans, make sure you check which doctors and hospitals you’ll be able to use. Where are they located and what are their hours? Check which pharmacies you can use. Can you get prescriptions by mail? Remember that even if you’re happy with your current plan, these answers might change from year to year.
Quality of care
Ask yourself whether you’re truly satisfied with your medical care. Not all health care is created equal, and the doctors, hospitals and facilities you choose can impact your health. Look for plans with a 5‑star performance rating — the right expertise and care may help speed your recovery and improve your outcomes.
It’s worth your time to take a look and compare coverage between now and when Open Enrollment ends on December 7. Use the Medicare Plan Finder to look at all of the health and drug plan options in your area. If you still need help comparing, call 1‑800‑MEDICARE (1‑800‑633‑4227).
Only you know what’s most important to you and your family – that’s why I want to make sure you have all the information you need to make the best decision. Before you consider your Medicare plan options, think about your personal priorities so you can be sure your plan meets your unique needs.
Stay up to date on the latest Medicare news and follow us on Twitter @Medicaregov.
Put it on your fall checklist: Medicare Open Enrollment
By: Julie Green Bataille, Director of Communications
If you’re like me, fall is an extremely busy time of year—getting the kids ready for a new school year, making sure everyone in my family gets a flu shot, getting the house and yard ready for the winter. With everything we have going on, it’s so easy to forget another activity that should be on all our fall checklists: Helping our parents prepare for Medicare Open Enrollment.
Medicare Open Enrollment gives beneficiaries the chance to review their health and prescription drug coverage for the coming year. If they need to make any changes, they can do so between October 15 and December 7. But if they decide that they’re happy sticking with the coverage they have now, they don’t need to do anything else.
For all of us who are caregivers, or who just care about older parents and family members, we need to ensure that they have the right information to make the right choice. Sit down and have a conversation with them, and help them explore their options and find coverage that fits their needs.
If your parents want to go online and sort through the details, they can get an early start, and you can help them navigate the process if needed. We’ve already made sure that the Medicare Plan Finder is fully updated with all new 2013 cost and benefit information for health and drug plans and is ready right now. All your parents need to do is start by entering the drugs and checking on the doctors and pharmacies they want to use. A few more steps will get them a personalized list of their plan choices and help them compare.
Between now and December 7, your parents will be hearing more about the choices, benefits, and lower overall costs they’ll have when it comes to Medicare. We’ll also be adding tips and advice to this blog, to help them you and them consider and weigh choices, and to find places to go to get help if needed.
When Medicare Open Enrollment ends on December 7, we want every single person with Medicare to have health and drug coverage that meets their needs. But we need your help. We need you to help ensure that your older family members have the right health plan. So when you’re preparing your fall checklist, don’t forget to put Medicare Open Enrollment at the top.
Stay up to date on the latest Medicare news and follow us on Twitter @Medicaregov.
When was your last mammogram?

Mammograms are breast cancer screening tests that can often detect a lump before you or your doctor can feel it. This can help detect breast cancer early, when it’s the most treatable. All women over 40 should have a screening mammogram every 12 months – and Medicare covers it at no cost if your doctor accepts assignment.
Talk to your doctor about risk factors, and to schedule your next screening. Take control of your health – better health is in your hands.
Getting outpatient therapy? Be sure you know Medicare’s limits
Are you getting physical therapy after a hip replacement? Speech-language pathology services after a stroke? Anytime you get outpatient physical therapy, occupational therapy or speech-language pathology services, be sure you know the limits for how much Medicare will pay.
Medicare helps pay for medically-necessary outpatient physical and occupational therapy, and speech-language pathology services. There are limits, called “therapy caps,” on these services when you get them from most outpatient providers.
The therapy cap amounts for 2012 are:
- $1,880 for physical therapy (PT) and speech-language pathology (SLP) services combined
- $1,880 for occupational therapy (OT) services
You may qualify to get an exception so that Medicare will continue to pay its share for your services after you reach the therapy cap limits. Your therapist must document your need for medically-necessary services in your medical record, and your therapist’s billing office must indicate on your claim for services above the therapy cap that your outpatient therapy services are medically necessary.
Learn more about Medicare’s limits on therapy services.
Protect yourself and those you love—get your free flu shot
It’s that time of year again. With the beginning of fall comes the beginning of flu season.
Get your flu shot early and stay healthy! It’s free for people with Medicare, once per flu season in the fall or winter, when given by doctors or other health care providers (such as senior centers and pharmacies) that take Medicare.
Schedule your flu shot today!


Module logger
creates a logger class.
this class does not throw exceptions directly, note return values and error messages need to be dealt with in your own code. designed for use with the classy object creator
Usage:
Logger = require ( 'logger ' )
Info:
- Copyright: (c) 2019 David Porter
- Release: 1.0.10
- License: MIT
- Author: David Porter
Functions
| initMethod (obj) | adds the default log levels Error, Warning, Info and Debug and sets their associated default values ON (true), ON (true), OFF (false), OFF (false). |
| addLogLevel (obj, logLevel) | addLogLevel, adds a log level completly from the logger. |
| removeLogLevel (obj, logLevel) | removeLogLevel, removes a log level completly from the logger. |
| logLevelExits (obj, logLevel) | logLevelExists, returns true or false depending if the log level exists or not |
| registerModule (obj, moduleName) | registerModule, registers a module from the logger. |
| deregisterModule (obj, moduleName) | deregisterModule, deregisters a module from the logger. |
| registerState (obj, moduleName) | returns a value if the module is registered or not |
| log (obj, logLevel, ...) | log, test the master state and if OFF (false) stop all further log processing the default use of log calls at the Global level, i.e. |
| logFromModule (the, moduleName, logLevel, ...) | logFromModule, test the master state and if OFF (false) stop all further log processing the default use of log calls at the Global level, i.e. |
| setLogState (the, logState, ...) | setLogState, sets a specific log value to true (on) or false (off) if called by an object then that state ONLY applies to that object, if called by the class itself then it applies to ALL objects, except those that have a specific state note if master is off ( false ) then even objects that have their own log level of true WILL NOT LOG. |
| setModuleLogState (obj, moduleName, logState, ...) | setModuleLogState, sets a specific log value for a module to true (on) or false (off) if called by an object then that state ONLY applies to that object, note if master is off ( false ) then even objects that have their own log level of true WILL NOT LOG. |
| setMyOutput (obj, outputFunc, defaultToFollow) | setMyOutput, allows the user to control where logs are sent |
| describe (obj) | describes the current logger in a text string |
| setMasterLogState (obj, state) | sets the master log state note if no value it toggles the current state |
| getLogPrefix (obj) | returns the Log prefix the logger uses, so other module can know this without magic numbers |
| registerSearch (obj, who) | searches down through a class to ensure the module and all its parents are registered |
Fields
| _VERSION | version details |
| _URL | Git Hub Location of the master branch |
| _DESCRIPTION | the current module description |
| _LICENSE | the current licence |
| _MODULENAME | the module name |
Functions
- initMethod (obj)
-
adds the default log levels Error, Warning, Info and Debug and sets their associated default values ON (true), ON (true), OFF (false), OFF (false).
also sets the logger to the default output.
Parameters:
- obj the calling object
Returns:
-
No return value
See also:
Usage:
myLogger = Logger ()
myLogger = Logger ( { [ callLogOutput = YOUR_OWN_LOG_FUNCTION, masterLogState = true | false, myOwnLogState = true | false ] })
- addLogLevel (obj, logLevel)
-
addLogLevel, adds a log level completly from the logger.
All registered modules will also recive this log level
Parameters:
- obj the calling object OR class itself
- logLevel the level you want to add
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:addLogLevel ( 'LOG_LEVEL_NAME' [, true | false ] )
- removeLogLevel (obj, logLevel)
-
removeLogLevel, removes a log level completly from the logger.
All registerd modules will loose this log level
Parameters:
- obj the calling object OR class itself
- logLevel the level you want to remove
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:removeLogLevel ( 'LOG_LEVEL_NAME' )
- logLevelExits (obj, logLevel)
-
logLevelExists, returns true or false depending if the log level exists or not
Parameters:
- obj the calling object OR class itself
- logLevel the level you want to check
Returns:
-
true if exists, false if fit does not
Usage:
logger:logLevelExists ( 'LOG_LEVEL_NAME' )
- registerModule (obj, moduleName)
-
registerModule, registers a module from the logger.
This adds the calls to module.Log_LOGLEVEL from the module
Parameters:
- obj the calling object OR class itself
- moduleName the module name you want to deregister
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:registerModule ( 'MODULE_NAME' | module )
- deregisterModule (obj, moduleName)
-
deregisterModule, deregisters a module from the logger.
This removes the calls to module.Log_LOGLEVEL from the module
Parameters:
- obj the calling object OR class itself
- moduleName the module name you want to deregister
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:deregisterModule ( 'MODULE_NAME' | module )
- registerState (obj, moduleName)
-
returns a value if the module is registered or not
Parameters:
- obj the object
- moduleName the module you are interested in
Returns:
-
true or false
Usage:
logger:registerState ( 'MODULE_NAME' | module )
- log (obj, logLevel, ...)
-
log, test the master state and if OFF (false) stop all further log processing
the default use of log calls at the Global level, i.e. no module name provided
Parameters:
- obj the calling object OR class itself
- logLevel the log level
- ... the items to log
Returns:
-
true if success, false if failed - Failed also returns an error message, note that if called with no values it always returns the name of the logLevel called
Usage:
logger:log ( 'LOG_LEVEL_NAME' | logLevel, [ ... Items you want to log in a list ] )
Log_LOG_LEVEL_NAME ( [ ... Items you want to log in a list ] ) -- note this calls up to _G scope
- logFromModule (the, moduleName, logLevel, ...)
-
logFromModule, test the master state and if OFF (false) stop all further log processing
the default use of log calls at the Global level, i.e. no module name provided
Parameters:
- the calling object OR class itself
- moduleName the module name you want the log to come from
- logLevel the log level
- ... the items to log
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:logFromModule ( module, 'LOG_LEVEL_NAME' | logLevel, [ ... Items you want to log in a list ] )
module.Log_LOG_LEVEL_NAME ( [ ... Items you want to log in a list ] ) -- note this calls up to the module scope
- setLogState (the, logState, ...)
-
setLogState, sets a specific log value to true (on) or false (off)
if called by an object then that state ONLY applies to that object,
if called by the class itself then it applies to ALL objects, except those that have a specific state
note if master is off ( false ) then even objects that have their own log level of true WILL NOT LOG.
to log the global master MUST be ON, the local master log level must be ON and your object specific value must be ON
Parameters:
- the calling object OR class itself
- logState the specific state you want true or false (must be a bool)
- ... the various levels you wish to change
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:setLogState ( true | false [, LIST OF LOG LEVELS TO APPLY TO ] )
- setModuleLogState (obj, moduleName, logState, ...)
-
setModuleLogState, sets a specific log value for a module to true (on) or false (off)
if called by an object then that state ONLY applies to that object,
note if master is off ( false ) then even objects that have their own log level of true WILL NOT LOG.
to log the global master MUST be ON, the local master log level must be ON and your object specific value must be ON
Parameters:
- obj the calling object OR class itself
- moduleName the calling object OR class itself
- logState the specific state you want true or false (must be a bool)
- ... the various levels you wish to change
Returns:
-
true if success, false if failed - Failed also returns an error message
Usage:
logger:setModuleLogState ( module, true | false [, LIST OF LOG LEVELS TO APPLY TO ] )
- setMyOutput (obj, outputFunc, defaultToFollow)
-
setMyOutput, allows the user to control where logs are sent
Parameters:
- obj the calling object
- outputFunc either a function the user wished to use of if a boolean and true it emplies use the default function only
- defaultToFollow if set and true then after the user function the default logger will also run
Returns:
-
No return value
Usage:
logger:setMyOutput ( function ( logData ) [ return ] DO_STUFF_WITH logData end [, true ] )
logger:setMyOutput ( true )
logger:setMyOutput ( )
- describe (obj)
-
describes the current logger in a text string
Parameters:
- obj the calling object
Returns:
-
a string description of the current logger
Usage:
logger:describe ()
- setMasterLogState (obj, state)
-
sets the master log state
note if no value it toggles the current state
Parameters:
- obj the logging object
- state the state true (On), false (Off)
Returns:
-
No return value
Usage:
logger:setMasterLogState ( true | false )
logger:setMasterLogState ( )
- getLogPrefix (obj)
-
returns the Log prefix the logger uses, so other module can know this without magic numbers
Parameters:
- obj the calling object
Returns:
-
the log prefix
Usage:
logger:getLogPrefix ()
- registerSearch (obj, who)
-
searches down through a class to ensure the module and all its parents are registered
Parameters:
- obj the calling object
- who the classy object we want to examine
Returns:
-
No return value
Usage:
logger:registerSearch ()


GiveMy
Emoji
Home
(current)
Developers
Aaishika S Bhattacharya
Team Lead, Web Developer and Extension Developer
Anushka Agarwal
Automation with Selenium
Gyanesh Samanta
Chatbot and Filter Developer
Souharda Biswas
Web Developer
See Project on GitHub


---
layout: post
title: Getting more involved in Debian
date: '2008-02-27T15:37:00.002+01:00'
author: Steven Van Acker
tags:
- Debian
- English
modified_time: '2008-02-27T15:41:36.273+01:00'
blogger_id: tag:blogger.com,1999:blog-5513234137363262204.post-8358346264159125065
blogger_orig_url: http://www.singularity.be/2008/02/getting-more-involved-in-debian.html
---
During my small Fedora adventure, I realised how much I really like Debian. To show my appreciation, I will try to get more involved in the Debian project.
These orphaned packaged have caught my eye and I should look into them and see if I can maintain them in Debian:


Statement
Id
Account
Opening Balance
Payments And Other Credits
Purchases And Adjustments
Fees Charged
Interest Charged
Closing Balance
Minimum Payment Due
Payment Due Date
Close Date
Transactions
page
of
page size
10
20
50
100
Id
Post Date
Amount
Check Number
Name
Memo
FIT Id
Category


Blog post index
Why Use Git and Github for Version Control
Fireside Chat with Shareef
CSS Design: What are the differences between relative, absolute, and fixed positioning?
What is Your Thinking Style
Compare Arrays and Hashes
Guided Pairing Session: What is Pair Programming?
Issues in the Tech Industry
How to use the enumerable method
group_by
Giving feedback and Peer Pairing at DBC
Ruby Classes: What does it cost to get a beer around here?
Stereotype Threat in the Tech Community
Inheritance versus Composition in Ruby
Exploring your Values
Comparing Ruby Classes and Javascript Functions
Conflict and Conflict Resolution
SQL Query Optimization
SQL Cheat Sheet
How To Ask Questions
Reflecting on my personal website and blog


Step1
Download the app.
Go to the App Store, search for RWallet, and download.
Step2
Accept the terms and conditions.
Read through the full terms and conditions before accepting them.
Step3
Select ‘Create Basic Wallet’.
This option is recommended for first-time users.
Step4
Select the currency you want to store in your wallet.
You can change this at any time.
Step5
Write down your recovery phrases.
These phrases will allow you to recover the balance of your wallet in the case of a forgotten PIN, deleted app, or issues with your device. Make sure you keep your recovery phrases private.
Step6
Input the words in order.
Input the words in the same order that were presented to you in the previous step.
Step7
Create a PIN.
You will use this PIN to gain access to your account. Make sure you keep your PIN private.

You can start adding funds to your wallet.