What's New (Last updated: 08.03.2019)
Deployment Date: 08.03.2019
Changes
- Features
-
• Re-worked spreadsheet template, added fields for Ships Stores, added README tab.
-
• Created Clearance Certificate template.
-
• Ability to generate a Clearance Certificate for cleared port calls.
-
• Set master of vessels in both client (Port call registration - Crew step) or in the spreadsheet
template.
- Enhancements
-
• Changes to date formats.
-
• GUI modifications and enhancements.
-
• User search re-work.
-
• Changes to various text fields in the client.
- Fixes
-
• Fixed error where modals would sometimes appear beneath the site instead of as a popup.
-
• Fixed various spreadsheet mapping issues.
Deployment Date: 01.02.2019 (Click to expand/minimize)
Changes
- Features
- • Import of Ship Stores / Crew / Passenger data is now supported.
- Enhancements
-
• GUI changes
-
• Changes to port call overview information
-
• Improved edit views
- Fixes
Deployment Date: 13.12.2018 (Click to expand/minimize)
Changes
- Features
- • Edit User is now supported
- • Can deactivate/activate users (Prevents them from logging in to the system)
- Enhancements
-
• Changes to how search works (Returns more relevant results)
-
• Database maintenance and changes to make the client faster
-
• Added default search values for Users/Ships/Locations/Organization
-
• Changed 'Company' to 'Agent Company'
-
• You can now only select 'Agent Company' for a new user
-
• You can now only create organizations of type 'Agent Company' or 'RSO'
-
• Changes to the Create User page
-
• Can only select active ships when creating a new port call
-
• Merged several tables in the Port Call overview page
-
• You can create an organization in a modal from within the create user page
-
• Reduced loading times for port calls and the subsections
- Fixes
-
• Fixed issue where modals sometimes wouldn't open
-
• Fixed input types accross the client
-
• Country codes for flags were displaying wrong
-
• Fixed errors regarding creation of new users
-
• Removed all 'Agent Company' without any users in them (Has been migrated in earlier)
-
• Several DPG fixes
Deployment Date: 22.11.2018 (Click to expand/minimize)
Changes
- Features
- • DPG-FAL form implemented
- Enhancements
-
• Improved loading of port calls
-
• User Management (search and edit details)
-
• User Information changed to ‘Created By’ (person creating the ship call report)
-
• Listing of pax in summary screen
-
• Listing of crew in summary screen
-
• Listing of Cargo in summary screen
- Fixes
-
• Identity Document accepts alfa numeric values
-
• CallSign validation, 4-8 characters
-
• Ship Registry Number accepts alfa numeric values
-
• Changes in Ship Registration GUI (cosmetic)
-
• Location Code 2 char + 3 char
-
• Removed Article Code from Ship Stores
-
• Fixed some typos
-
• MMSI and IMO # validation
-
• Location Codes validation (unique code)
-
• Identity Document Issue/Expiry date required


There are three types of bees found in a hive:
queen bee, worker bee, and drone bee.
The queen bee has a life span of 3 – 5 years, and she lays eggs;
about 2,000 daily. She will only mate one time with the drones,
which are male; and she will remain fertile throughout her life span.
Worker bees are all female, but cannot lay eggs. The life span of a worker bee
born in the winter is 4-9 months; and if born in the summer;
she will only live 6 weeks. A large percentage of bees are worker bees.
They have several roles; hive cleaning, nurse, hive repairer, feed the larva,
hive guarder, and collector of pollen and nectar. The worker has a barbed
stinger, and she can only sting once, which results in death.
The drone is a male, and their only job is to mate with the queen,
which happens in summer. They have a life span of 40-50 days.
The drone can only mate once, and then they die; as their barbed sex organ
gets torn off during mating with the queen. Drones do not have stingers.
Since the drones do not mate during the winter, they are driven out of the hive
in the fall.


FORTRESS (1993) A Film Review Copyright Dragan Antulov 1999
In the mid-1980s, following the splendid debut in Hugh Hudson's GREYSTOKE and relative success of first HIGHLANDER film, it looked like Christopher Lambert's acting career might go somewhere. But, it wasn't meant to be, which became obvious following HIGHLANDER II. In this decade Christopher Lambert became associated with films with low budgets and even lower quality. Very often such films were science fiction, which meant that the fans of that genre learned the hard way what to evade anything starring Christopher Lambert. Whether it was because of real lack of talent, terrible miscasting or simple bad luck isn't important - the end result was almost always horrible. The same can be said for FORTRESS, 1993 science fiction film directed by Stuart Gordon, director who created cult following with his 1980s horror gorefests like REANIMATOR and FROM BEYOND.
The movie is set in 2018. For some undisclosed reason, USA introduced strict population control and couples are barred from having more than one child. Jake (Christopher Lambert) and Karen Brennick (Lori Laughlin) broke that law and are caught by authorities on the border. Sentenced to 31 years in prison, they are both thrown into Fortress, privately owned correctional facility, equiped with state-of-the-art futuristic technology and run by computer called Zed. Although equiped with gismos that regulate every aspect of inmates' lives and make any escape impossible, prison authorities often use violence. Jake survives many ordeals and earns respect of some inmates which would help him when he begins planing the escape. Such escape should become necessity, because the warden Poe (Kurtwood Smith) begins showing unhealthy interest in Karen.
After rather intriguing beginning and some interesting special effects that depict the futuristic settings of prison, this film soon starts sinking into mediocrity. The reason is in the screenplay that quickly degenerates into whole series of prison movie clichés and situations that are painfully predictable. By the time Brennick begins his escape from Fortress, those situations not only begin to look predictable, but utterly implausible too. Of course, film never tried to explain why the country that lacks resources to support its present population happens to spend bucketloads of money on ultra-expensive supertechnology with sole intention of keeping alive most useless and dangerous members of the society. The initially interesting plot is done even more wrong by stereotyped characters, played by not too interested or talented actors. Lori Laughlin, although physically attractive, shows the acting ability of sequoia. Kurtwood Smith as prison warden is rather uninspired, capable of solid, yet forgettable performance. Lambert's performance is also good, but even the bigger talent couldn't help this film, destined to end in oblivion.
RATING: 2/10 (-)
Review written on May 7th 1999
-- Dragan Antulov a.k.a. Drax Fido: 2:381/100 E-mail<EMAIL_ADDRESS>E-mail<EMAIL_ADDRESS>E-mail<EMAIL_ADDRESS>The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


As often as you specify, we send you up-to-the-minute ticket pricing for your favorite games, artists, and performances, right to your inbox. Included in the e-mail are rough price ranges (minimum and maximum) as well as the top 10 cheapest tickets we know about. If you want to see the entire selection, just follow the provided link.
Note: Ticket pricing represents availability on the secondary market, not primary sellers such as TicketMaster.
After signing up the first time, check your inbox.
Waiting for you will be a verification link. We require you verify the first sign-up you make so we don’t end up spamming anybody. Any further sign-ups you create on the same computer will not require verification.
Inboxtix is not only a useful service! It also serves as an example of what can be created using the TicketStumbler API. To that end, we've open-sourced this app so that those interested in building their own apps on top of TicketStumbler have an example to go by. Go grab it on github!
If you end up building something cool, be sure to let us know!


|
CMSIS-Zone
Version 1.1.0
System Resource Management
|
The CMSIS-Zone Utility user interface offers menus, toolbars, dialog boxes, and windows to manage the various aspects of your project.
The utility's GUI provides menus for selecting commands and toolbar buttons in the Zone Editor window:
Projects that are currently available in the Eclipse workspace are shown in the Project Explorer. When creating a new project, you will first find the .rzone and the .azone files here. Later, generator files and generated files are shown as well:
In the Project Explorer window, you manage the project files. The following files are shown:
| File name | Description |
|---|---|
project.azone | Project-level .azone file |
project.rzone | Project-level .rzone file |
zone.azone | Zone-level .azone file |
zone.rzone | Zone-level .rzone file |
*.ftl | Freemarker template file used to generate output |
helper.ftlinc | Helper file to generate Freemarker output |
*.sct, partition_* .h | Generated output files |
The Zone Editor shows .azone files in two different views: Resource map and Zone map.
The Resource map shows all resources available to that system or sub-system. By default, it shows the selected device, as well as lists of memories and peripherals:
The Zone map shows the same resources, but mapped to zones that have been created for the device:
Resources assigned to a zone are marked with colors:
| Color | Meaning |
|---|---|
| Green | Resource is assigned to one zone |
| Amber | Resource is assigned to multiple zones |
The Zone Editor window contains toolbar buttons that offer direct access to functionality of the utility:
| Button | Description |
|---|---|
| Tree View | Shows the resources as a tree |
| List View | Shows the resources as a simple list |
| Arrange memory regions | Arranges memory regions according to their sizes |
| Add new zone | Adds a new zone to the zone map |
| Generate | Generates CMSIS-Zone output files |


Honzi/Guides/Path of Exile
- Extra Ruthless
- Trials of Ascendancy:
- Normal:
- Act 1: The Lower Prison
- Act 2: The Crypt
- Act 2: The Chamber of Sins Level 2
- Act 3: The Crematorium
- Act 3: The Catacombs
- Act 3: The Imperial Gardens
- Cruel:
- Act 6: The Prison
- Act 7: The Crypt
- Act 7: The Chamber of Sins Level 2
- Merciless:
- Act 8: The Bath House
- Act 9: The Tunnel
- Act 10: The Ossuary
- Eternal: tier 6+ maps


Ben Maier is a sophomore Arts Technology Major and Music Minor at Illinois State University. He enjoys filming things and editing videos, as well as running his YouTube channel and uploading videos frequently. He is currently a member of the Illinois State Univeristy Big Red Marching Machine and Pusle Drumline.
Check out the social media pages linked below to find out even more about Ben!


BS6 Maruti S-Cross 1.6L Spied Again, Launch At 2020 Auto Expo?
by Surendhar MMaruti Suzuki S-Cross powered by a new BSVI 1.6-litre DDiS diesel engine could be introduced at the 2020 Auto Expo
Maruti Suzuki India Limited (MSIL) has a passenger UV portfolio comprising of Vitara Brezza, S-Presso and the S-Cross. While the S-Presso is the newest addition, the S-Cross has been around longer than the Vitara Brezza as it kick started the innings for Nexa premium dealerships.
While the sales at Nexa recently crossed the one million mark, the major contribution was from the Baleno as the S-Cross only played a decent role. The arrival of the facelift in late 2017 with exterior updates did help in recovery as the S-Cross’ sales numbers reached an average of 4,500 units for a certain period.
With the competition brewing up in mid-size SUV segment, the S-Cross has a clear disadvantage of being sold only with a diesel engine currently. The Fiat-sourced 1.3-litre four-cylinder unit won’t be there for long though as it will be discontinued ahead of the BSVI era coming into effect from April 2020.
The S-Cross will likely get a brand new petrol engine sooner rather than later and is expected to the 1.5-litre SHVS K15B petrol engine that is already BSVI compliant in models like Ertiga and XL6. Or, Maruti Suzuki might wait for the 2020 Auto Expo to introduce the new motor alongside the all-new 1.6-litre oil-burner.
The launch timeframe is subjected to different speculations but what we can observe is that the S-Cross is getting a new diesel engine, as evident from the second set of spy pictures we have posted here. Just a few days ago, we brought you the images of a test prototype and the same G451 stickered vehicle was seen again.
It carries emission testing equipment at the back and 1.6 badge on the tailgate while a closer look at the boot glass area reveals that the engine is indeed BSVI spec. The DDiS badge can also be noted just above the front fender. The S-Cross’ 1.6-litre Multijet DDiS 320 engine was discontinued in early 2016 and the new motor could retain the same power and torque outputs of 120 PS and 320 Nm.


This package fits a hierarchical spatial model for the generalized extreme value distribution with the option of model averaging over the space of covariates.
| Version: | 1.0 |
| Depends: | SpatialExtremes, msm, coda |
| Published: | 2014-05-21 |
| Author: | Alex Lenkoski |
| Maintainer: | Alex Lenkoski <alex at nr.no> |
| License: | GPL-2 | GPL-3 [expanded from: GPL] |
| NeedsCompilation: | no |
| CRAN checks: | spatial.gev.bma results |
| Reference manual: | spatial.gev.bma.pdf |
| Package source: | spatial.gev.bma_1.0.tar.gz |
| Windows binaries: | r-devel: spatial.gev.bma_1.0.zip, r-release: spatial.gev.bma_1.0.zip, r-oldrel: spatial.gev.bma_1.0.zip |
| OS X binaries: | r-release: spatial.gev.bma_1.0.tgz, r-oldrel: spatial.gev.bma_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=spatial.gev.bma to link to this page.


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use Beta | |
|---|---|
| com.google.common.annotations | Common annotation types. |
| com.google.common.base | Basic utility libraries and interfaces. |
| com.google.common.collect | This package contains generic collection interfaces and implementations, and other utilities for working with collections. |
| com.google.common.io | This package contains utility methods and classes for working with Java I/O, for example input streams, output streams, readers, writers, and files. |
| com.google.common.net | This package contains utility methods and classes for working with net addresses (numeric IP and domain names). |
| com.google.common.util.concurrent | Concurrency utilities. |
| Uses of Beta in com.google.common.annotations |
|---|
| Classes in com.google.common.annotations with annotations of type Beta | |
|---|---|
interface |
Beta
Signifies that a public API (public class, method or field) is subject to incompatible changes, or even removal, in a future release. |
| Uses of Beta in com.google.common.base |
|---|
| Classes in com.google.common.base with annotations of type Beta | |
|---|---|
class |
Ascii
Static methods pertaining to ASCII characters (those in the range of values 0x00 through
0x7F ), and to strings containing such characters. |
class |
CharMatcher
Determines a true or false value for any Java char value, just as Predicate does
for any Object . |
interface |
Equivalence<T>
A strategy for determining whether two instances are considered equivalent. |
class |
Equivalences
Contains static factory methods for creating Equivalence instances. |
interface |
Service
An object with an operational state, plus asynchronous Service.start() and
Service.stop() lifecycle methods to transfer into and out of this state. |
static class |
Service.State
The lifecycle states of a service. |
| Methods in com.google.common.base with annotations of type Beta | ||
|---|---|---|
static List<Throwable> |
Throwables.getCausalChain(Throwable throwable)
Gets a Throwable cause chain as a list. |
|
static
|
Suppliers.supplierFunction()
Returns a function that accepts a supplier and returns the result of invoking Supplier.get() on that supplier. |
|
static Exception |
Throwables.throwCause(Exception exception,
boolean combineStackTraces)
Rethrows the cause exception of a given throwable, discarding the original throwable. |
| Uses of Beta in com.google.common.collect |
|---|
| Classes in com.google.common.collect with annotations of type Beta | |
|---|---|
class |
AbstractLinkedIterator<T>
This class provides a skeletal implementation of the Iterator
interface for sequences whose next element can always be derived from the
previous element. |
interface |
Constraint<E>
A constraint that an element must satisfy in order to be added to a collection. |
class |
Constraints
Factories and utilities pertaining to the Constraint interface. |
class |
EvictionListeners
A collection of common eviction listeners. |
class |
ForwardingTable<R,C,V>
A table which forwards all its method calls to another table. |
class |
GenericMapMaker<K0,V0>
A class exactly like MapMaker , except restricted in the types of maps
it can build. |
class |
HashBasedTable<R,C,V>
Implementation of Table using hash tables. |
interface |
Interner<E>
Provides equivalent behavior to String.intern() for other immutable
types. |
class |
Interners
Contains static methods pertaining to instances of Interner . |
interface |
MapConstraint<K,V>
A constraint on the keys and values that may be added to a Map or
Multimap . |
class |
MapConstraints
Factory and utilities pertaining to the MapConstraint interface. |
interface |
MapEvictionListener<K,V>
An object that can receive a notification when an entry is evicted from a map. |
static interface |
Maps.EntryTransformer<K,V1,V2>
A transformation of the value of a key-value pair, using both key and value as inputs. |
class |
MinMaxPriorityQueue<E>
A double-ended priority queue, which provides constant-time access to both its least element and its greatest element, as determined by the queue's specified comparator. |
interface |
SortedMapDifference<K,V>
An object representing the differences between two sorted maps. |
class |
SortedMaps
Static utility methods pertaining to SortedMap instances. |
interface |
Table<R,C,V>
A collection that associates an ordered pair of keys, called a row key and a column key, with a single value. |
static interface |
Table.Cell<R,C,V>
Row key / column key / value triplet corresponding to a mapping in a table. |
class |
Tables
Provides static methods that involve a Table . |
class |
TreeBasedTable<R,C,V>
Implementation of Table whose row keys and column keys are ordered
by their natural ordering or by supplied comparators. |
class |
UnmodifiableListIterator<E>
A list iterator that does not support UnmodifiableIterator.remove() , UnmodifiableListIterator.add(E) , or
UnmodifiableListIterator.set(E) . |
| Methods in com.google.common.collect with annotations of type Beta | ||
|---|---|---|
static List<Character> |
Lists.charactersOf(CharSequence sequence)
Returns a view of the specified CharSequence as a List<Character> , viewing sequence as a sequence of Unicode code
units. |
|
static ImmutableList<Character> |
Lists.charactersOf(String string)
Returns a view of the specified string as an immutable list of Character values. |
|
static
|
Iterables.consumingIterable(Iterable<T> iterable)
Returns a view of the supplied iterable that wraps each generated Iterator through Iterators.consumingIterator(Iterator) . |
|
static
|
Iterators.consumingIterator(Iterator<T> iterator)
Returns a view of the supplied iterator that removes each element
from the supplied iterator as it is returned. |
|
static
|
ConcurrentHashMultiset.create(GenericMapMaker<? super E,? super Number> mapMaker)
Creates a new, empty ConcurrentHashMultiset using mapMaker
to construct the internal backing map. |
|
|
MapMaker.evictionListener(MapEvictionListener<K,V> listener)
Specifies a listener instance, which all maps built using this MapMaker will notify each time an entry is evicted. |
|
MapMaker |
MapMaker.expireAfterAccess(long duration,
TimeUnit unit)
Specifies that each entry should be automatically removed from the map once a fixed duration has passed since the entry's last access. |
|
abstract GenericMapMaker<K0,V0> |
GenericMapMaker.expireAfterAccess(long duration,
TimeUnit unit)
See MapMaker.expireAfterAccess(long, java.util.concurrent.TimeUnit) . |
|
MapMaker |
MapMaker.expireAfterWrite(long duration,
TimeUnit unit)
Specifies that each entry should be automatically removed from the map once a fixed duration has passed since the entry's creation. |
|
abstract GenericMapMaker<K0,V0> |
GenericMapMaker.expireAfterWrite(long duration,
TimeUnit unit)
See MapMaker.expireAfterWrite(long, java.util.concurrent.TimeUnit) . |
|
|
Ordering.greatestOf(Iterable<E> iterable,
int k)
Returns the k greatest elements of the given iterable according to
this ordering, in order from greatest to least. |
|
|
Ordering.leastOf(Iterable<E> iterable,
int k)
Returns the k least elements of the given iterable according to
this ordering, in order from least to greatest. |
|
static
|
Iterables.limit(Iterable<T> iterable,
int limitSize)
Creates an iterable with the first limitSize elements of the given
iterable. |
|
static
|
Iterators.limit(Iterator<T> iterator,
int limitSize)
Creates an iterator returning the first limitSize elements of the
given iterator. |
|
MapMaker |
MapMaker.maximumSize(int size)
Specifies the maximum number of entries the map may contain. |
|
abstract GenericMapMaker<K0,V0> |
GenericMapMaker.maximumSize(int maximumSize)
See MapMaker.maximumSize . |
|
static
|
Lists.reverse(List<T> list)
Returns a reversed view of the specified list. |
|
static
|
Iterables.skip(Iterable<T> iterable,
int numberToSkip)
Returns a view of iterable that skips its first
numberToSkip elements. |
|
static
|
Iterators.skip(Iterator<T> iterator,
int numberToSkip)
Calls next() on iterator , either numberToSkip times
or until hasNext() returns false , whichever comes first. |
|
protected boolean |
ForwardingList.standardAdd(E element)
A sensible default implementation of ForwardingCollection.add(Object) , in terms of
ForwardingList.add(int, Object) . |
|
protected boolean |
ForwardingMultiset.standardAdd(E element)
A sensible definition of ForwardingCollection.add(Object) in terms of ForwardingMultiset.add(Object, int) . |
|
protected boolean |
ForwardingCollection.standardAddAll(Collection<? extends E> collection)
A sensible definition of ForwardingCollection.addAll(java.util.Collection extends E>) in terms of ForwardingCollection.add(E) . |
|
protected boolean |
ForwardingMultiset.standardAddAll(Collection<? extends E> elementsToAdd)
A sensible definition of ForwardingCollection.addAll(Collection) in terms of ForwardingCollection.add(Object) and ForwardingMultiset.add(Object, int) . |
|
protected boolean |
ForwardingList.standardAddAll(int index,
Iterable<? extends E> elements)
A sensible default implementation of ForwardingList.addAll(int, Collection) , in
terms of the add method of ForwardingList.listIterator(int) . |
|
protected void |
ForwardingMap.standardClear()
A sensible definition of ForwardingMap.clear() in terms of the iterator
method of ForwardingMap.entrySet() . |
|
protected void |
ForwardingCollection.standardClear()
A sensible definition of ForwardingCollection.clear() in terms of ForwardingCollection.iterator() ,
using the iterator's remove method. |
|
protected void |
ForwardingMultiset.standardClear()
A sensible definition of ForwardingCollection.clear() in terms of the iterator
method of ForwardingMultiset.entrySet() . |
|
protected boolean |
ForwardingCollection.standardContains(Object object)
A sensible definition of ForwardingCollection.contains(java.lang.Object) in terms of ForwardingCollection.iterator() . |
|
protected boolean |
ForwardingSortedSet.standardContains(Object object)
A sensible definition of ForwardingCollection.contains(java.lang.Object) in terms of the first()
method of ForwardingSortedSet.tailSet(E) . |
|
protected boolean |
ForwardingMultiset.standardContains(Object object)
A sensible definition of ForwardingCollection.contains(java.lang.Object) in terms of ForwardingMultiset.count(java.lang.Object) . |
|
protected boolean |
ForwardingCollection.standardContainsAll(Collection<?> collection)
A sensible definition of ForwardingCollection.containsAll(java.util.Collection>) in terms of ForwardingCollection.contains(java.lang.Object)
. |
|
protected boolean |
ForwardingSortedMap.standardContainsKey(Object key)
A sensible definition of ForwardingMap.containsKey(java.lang.Object) in terms of the firstKey() method of ForwardingSortedMap.tailMap(K) . |
|
protected boolean |
ForwardingMap.standardContainsKey(Object key)
A sensible, albeit inefficient, definition of ForwardingMap.containsKey(java.lang.Object) in terms
of the iterator method of ForwardingMap.entrySet() . |
|
protected boolean |
ForwardingMap.standardContainsValue(Object value)
A sensible definition of ForwardingMap.containsValue(java.lang.Object) in terms of the iterator method of ForwardingMap.entrySet() . |
|
protected int |
ForwardingMultiset.standardCount(Object object)
A sensible, albeit inefficient, definition of ForwardingMultiset.count(java.lang.Object) in terms of
ForwardingMultiset.entrySet() . |
|
protected Set<E> |
ForwardingMultiset.standardElementSet()
A sensible definition of ForwardingMultiset.elementSet() in terms of the following
methods: ForwardingCollection.clear() , ForwardingCollection.contains(java.lang.Object) , ForwardingCollection.containsAll(java.util.Collection>) ,
ForwardingMultiset.count(java.lang.Object) , ForwardingCollection.isEmpty() , the size() and iterator()
methods of ForwardingMultiset.entrySet() , and ForwardingMultiset.remove(Object, int) . |
|
protected Set<Map.Entry<K,V>> |
ForwardingMap.standardEntrySet(Supplier<Iterator<Map.Entry<K,V>>> entryIteratorSupplier)
A sensible definition of ForwardingMap.entrySet() in terms of the specified Supplier , which is used to generate iterators over the entry set, and in
terms of the following methods: ForwardingMap.clear() , ForwardingMap.containsKey(java.lang.Object) ,
ForwardingMap.get(java.lang.Object) , ForwardingMap.isEmpty() , ForwardingMap.remove(java.lang.Object) , and ForwardingMap.size() . |
|
protected boolean |
ForwardingSet.standardEquals(Object object)
A sensible definition of ForwardingSet.equals(java.lang.Object) in terms of ForwardingCollection.size() and
ForwardingCollection.containsAll(java.util.Collection>) . |
|
protected boolean |
ForwardingMapEntry.standardEquals(Object object)
A sensible definition of ForwardingMapEntry.equals(Object) in terms of ForwardingMapEntry.getKey() and ForwardingMapEntry.getValue() . |
|
protected boolean |
ForwardingList.standardEquals(Object object)
A sensible definition of ForwardingList.equals(Object) in terms of ForwardingCollection.size()
and ForwardingCollection.iterator() . |
|
protected boolean |
ForwardingMap.standardEquals(Object object)
A sensible definition of ForwardingMap.equals(java.lang.Object) in terms of the equals
method of ForwardingMap.entrySet() . |
|
protected boolean |
ForwardingMultiset.standardEquals(Object object)
A sensible, albeit inefficient, definition of ForwardingCollection.size() in terms of
entrySet().size() and ForwardingMultiset.count(java.lang.Object) . |
|
protected int |
ForwardingSet.standardHashCode()
A sensible definition of ForwardingSet.hashCode() in terms of ForwardingCollection.iterator() . |
|
protected int |
ForwardingMapEntry.standardHashCode()
A sensible definition of ForwardingMapEntry.hashCode() in terms of ForwardingMapEntry.getKey()
and ForwardingMapEntry.getValue() . |
|
protected int |
ForwardingList.standardHashCode()
A sensible definition of ForwardingList.hashCode() in terms of ForwardingCollection.iterator() . |
|
protected int |
ForwardingMap.standardHashCode()
A sensible definition of ForwardingMap.hashCode() in terms of the iterator
method of ForwardingMap.entrySet() . |
|
protected int |
ForwardingMultiset.standardHashCode()
A sensible definition of ForwardingMultiset.hashCode() as entrySet().hashCode()
. |
|
protected int |
ForwardingList.standardIndexOf(Object element)
A sensible default implementation of ForwardingList.indexOf(java.lang.Object) , in terms of ForwardingList.listIterator() . |
|
protected boolean |
ForwardingMap.standardIsEmpty()
A sensible definition of ForwardingMap.isEmpty() in terms of the iterator
method of ForwardingMap.entrySet() . |
|
protected boolean |
ForwardingCollection.standardIsEmpty()
A sensible definition of ForwardingCollection.isEmpty() as !iterator().hasNext . |
|
protected Iterator<E> |
ForwardingList.standardIterator()
A sensible default implementation of ForwardingCollection.iterator() , in terms of
ForwardingList.listIterator() . |
|
protected Iterator<E> |
ForwardingMultiset.standardIterator()
A sensible definition of ForwardingCollection.iterator() in terms of ForwardingMultiset.entrySet()
and ForwardingCollection.remove(Object) . |
|
protected Set<K> |
ForwardingMap.standardKeySet()
A sensible definition of ForwardingMap.keySet() in terms of the following methods:
ForwardingMap.clear() , ForwardingMap.containsKey(java.lang.Object) , ForwardingMap.isEmpty() , ForwardingMap.remove(java.lang.Object) ,
ForwardingMap.size() , and the iterator method of ForwardingMap.entrySet() . |
|
protected int |
ForwardingList.standardLastIndexOf(Object element)
A sensible default implementation of ForwardingList.lastIndexOf(java.lang.Object) , in terms of
ForwardingList.listIterator(int) . |
|
protected ListIterator<E> |
ForwardingList.standardListIterator()
A sensible default implementation of ForwardingList.listIterator() , in terms of
ForwardingList.listIterator(int) . |
|
protected ListIterator<E> |
ForwardingList.standardListIterator(int start)
A sensible default implementation of ForwardingList.listIterator(int) , in terms
of ForwardingCollection.size() and ForwardingList.get(int) . |
|
protected boolean |
ForwardingQueue.standardOffer(E e)
A sensible definition of ForwardingQueue.offer(E) in terms of ForwardingCollection.add(E) . |
|
protected E |
ForwardingQueue.standardPeek()
A sensible definition of ForwardingQueue.peek() in terms of ForwardingQueue.element() . |
|
protected E |
ForwardingQueue.standardPoll()
A sensible definition of ForwardingQueue.poll() in terms of ForwardingQueue.remove() . |
|
protected void |
ForwardingMap.standardPutAll(Map<? extends K,? extends V> map)
A sensible definition of ForwardingMap.putAll(Map) in terms of ForwardingMap.put(Object, Object) . |
|
protected V |
ForwardingSortedMap.standardRemove(Object key)
A sensible definition of ForwardingMap.remove(java.lang.Object) in terms of the iterator() of the entrySet() of ForwardingSortedMap.tailMap(K) . |
|
protected V |
ForwardingMap.standardRemove(Object key)
A sensible, albeit inefficient, definition of ForwardingMap.remove(java.lang.Object) in terms of
the iterator method of ForwardingMap.entrySet() . |
|
protected boolean |
ForwardingCollection.standardRemove(Object object)
A sensible definition of ForwardingCollection.remove(java.lang.Object) in terms of ForwardingCollection.iterator() ,
using the iterator's remove method. |
|
protected boolean |
ForwardingSortedSet.standardRemove(Object object)
A sensible definition of ForwardingCollection.remove(java.lang.Object) in terms of the iterator()
method of ForwardingSortedSet.tailSet(E) . |
|
protected boolean |
ForwardingMultiset.standardRemove(Object element)
A sensible definition of ForwardingCollection.remove(Object) in terms of ForwardingMultiset.remove(Object, int) . |
|
protected boolean |
ForwardingCollection.standardRemoveAll(Collection<?> collection)
A sensible definition of ForwardingCollection.removeAll(java.util.Collection>) in terms of ForwardingCollection.iterator() ,
using the iterator's remove method. |
|
protected boolean |
ForwardingMultiset.standardRemoveAll(Collection<?> elementsToRemove)
A sensible definition of ForwardingCollection.removeAll(java.util.Collection>) in terms of the removeAll method of ForwardingMultiset.elementSet() . |
|
protected boolean |
ForwardingCollection.standardRetainAll(Collection<?> collection)
A sensible definition of ForwardingCollection.retainAll(java.util.Collection>) in terms of ForwardingCollection.iterator() ,
using the iterator's remove method. |
|
protected boolean |
ForwardingMultiset.standardRetainAll(Collection<?> elementsToRetain)
A sensible definition of ForwardingCollection.retainAll(java.util.Collection>) in terms of the retainAll method of ForwardingMultiset.elementSet() . |
|
protected int |
ForwardingMultiset.standardSetCount(E element,
int count)
A sensible definition of ForwardingMultiset.setCount(Object, int) in terms of ForwardingMultiset.count(Object) , ForwardingMultiset.add(Object, int) , and ForwardingMultiset.remove(Object,
int) . |
|
protected boolean |
ForwardingMultiset.standardSetCount(E element,
int oldCount,
int newCount)
A sensible definition of ForwardingMultiset.setCount(Object, int, int) in terms of
ForwardingMultiset.count(Object) and ForwardingMultiset.setCount(Object, int) . |
|
protected int |
ForwardingMultiset.standardSize()
A sensible, albeit inefficient, definition of ForwardingCollection.size() in terms of
ForwardingMultiset.entrySet() . |
|
protected List<E> |
ForwardingList.standardSubList(int fromIndex,
int toIndex)
A sensible default implementation of ForwardingList.subList(int, int) . |
|
protected SortedMap<K,V> |
ForwardingSortedMap.standardSubMap(K fromKey,
K toKey)
A sensible default implementation of ForwardingSortedMap.subMap(Object, Object) in
terms of ForwardingSortedMap.headMap(Object) and ForwardingSortedMap.tailMap(Object) . |
|
protected SortedSet<E> |
ForwardingSortedSet.standardSubSet(E fromElement,
E toElement)
A sensible default implementation of ForwardingSortedSet.subSet(Object, Object) in
terms of ForwardingSortedSet.headSet(Object) and ForwardingSortedSet.tailSet(Object) . |
|
protected Object[] |
ForwardingCollection.standardToArray()
A sensible definition of ForwardingCollection.toArray() in terms of ForwardingCollection.toArray(Object[]) . |
|
protected
|
ForwardingCollection.standardToArray(T[] array)
A sensible definition of ForwardingCollection.toArray(Object[]) in terms of ForwardingCollection.size() and ForwardingCollection.iterator() . |
|
protected String |
ForwardingMapEntry.standardToString()
A sensible definition of ForwardingObject.toString() in terms of ForwardingMapEntry.getKey() and ForwardingMapEntry.getValue() . |
|
protected String |
ForwardingMap.standardToString()
A sensible definition of ForwardingObject.toString() in terms of the iterator
method of ForwardingMap.entrySet() . |
|
protected String |
ForwardingCollection.standardToString()
A sensible definition of ForwardingObject.toString() in terms of ForwardingCollection.iterator() . |
|
protected String |
ForwardingMultiset.standardToString()
A sensible definition of ForwardingObject.toString() as entrySet().toString()
. |
|
protected Collection<V> |
ForwardingMap.standardValues()
A sensible definition of ForwardingMap.values() in terms of the following methods:
ForwardingMap.clear() , ForwardingMap.containsValue(java.lang.Object) , ForwardingMap.isEmpty() , ForwardingMap.size() ,
and the iterator method of ForwardingMap.entrySet() . |
|
static
|
Sets.symmetricDifference(Set<? extends E> set1,
Set<? extends E> set2)
Returns an unmodifiable view of the symmetric difference of two sets. |
|
static
|
Multimaps.transformEntries(ListMultimap<K,V1> fromMap,
Maps.EntryTransformer<? super K,? super V1,V2> transformer)
Returns a view of a ListMultimap whose values are derived from the
original multimap's entries. |
|
static
|
Maps.transformEntries(Map<K,V1> fromMap,
Maps.EntryTransformer<? super K,? super V1,V2> transformer)
Returns a view of a map whose values are derived from the original map's entries. |
|
static
|
Multimaps.transformEntries(Multimap<K,V1> fromMap,
Maps.EntryTransformer<? super K,? super V1,V2> transformer)
Returns a view of a multimap whose values are derived from the original multimap's entries. |
|
static
|
Multimaps.transformValues(ListMultimap<K,V1> fromMultimap,
Function<? super V1,V2> function)
Returns a view of a ListMultimap where each value is transformed by
a function. |
|
static
|
Multimaps.transformValues(Multimap<K,V1> fromMultimap,
Function<? super V1,V2> function)
Returns a view of a multimap where each value is transformed by a function. |
|
static
|
ImmutableSortedSet.withExplicitOrder(E firstElement,
E... remainingElementsInOrder)
Returns an immutable sorted set containing the provided elements in the same order. |
|
static
|
ImmutableSortedSet.withExplicitOrder(List<E> elements)
Returns an immutable sorted set containing the elements in the given list in the same order. |
| Uses of Beta in com.google.common.io |
|---|
| Classes in com.google.common.io with annotations of type Beta | |
|---|---|
interface |
ByteProcessor<T>
A callback interface to process bytes from a stream. |
class |
ByteStreams
Provides utility methods for working with byte arrays and I/O streams. |
class |
CharStreams
Provides utility methods for working with character streams. |
class |
Closeables
Utility methods for working with Closeable objects. |
class |
CountingInputStream
An InputStream that counts the number of bytes read. |
class |
CountingOutputStream
An OutputStream that counts the number of bytes written. |
class |
FileBackedOutputStream
An OutputStream that starts buffering to a byte array, but
switches to file buffering once the data reaches a configurable size. |
class |
Files
Provides utility methods for working with files. |
class |
Flushables
Utility methods for working with Flushable objects. |
class |
LimitInputStream
An InputStream that limits the number of bytes which can be read. |
interface |
LineProcessor<T>
A callback to be used with the streaming readLines methods. |
class |
LineReader
A class for reading lines of text. |
class |
NullOutputStream
Implementation of OutputStream that simply discards written bytes. |
class |
PatternFilenameFilter
File name filter that only accepts files matching a regular expression. |
class |
Resources
Provides utility methods for working with resources in the classpath. |
| Uses of Beta in com.google.common.net |
|---|
| Classes in com.google.common.net with annotations of type Beta | |
|---|---|
class |
HostSpecifier
A syntactically valid host specifier, suitable for use in a URI. |
class |
InetAddresses
Static utility methods pertaining to InetAddress instances. |
static class |
InetAddresses.TeredoInfo
A simple data class to encapsulate the information to be found in a Teredo address. |
class |
InternetDomainName
An immutable well-formed internet domain name, as defined by RFC 1035. |
| Uses of Beta in com.google.common.util.concurrent |
|---|
| Classes in com.google.common.util.concurrent with annotations of type Beta | |
|---|---|
class |
AbstractCheckedFuture<V,X extends Exception>
A delegating wrapper around a ListenableFuture that adds support for
the AbstractCheckedFuture.checkedGet() and AbstractCheckedFuture.checkedGet(long, TimeUnit) methods. |
class |
AbstractExecutionThreadService
Base class for services that can implement AbstractExecutionThreadService.startUp() , AbstractExecutionThreadService.run() and
AbstractExecutionThreadService.shutDown() methods. |
class |
AbstractFuture<V>
An abstract implementation of the Future interface. |
class |
AbstractIdleService
Base class for services that do not need a thread while "running" but may need one during startup and shutdown. |
class |
AbstractListenableFuture<V>
An abstract base implementation of the listener support provided by ListenableFuture . |
class |
AbstractService
Base class for implementing services that can handle AbstractService.doStart() and
AbstractService.doStop() requests, responding to them with AbstractService.notifyStarted()
and AbstractService.notifyStopped() callbacks. |
class |
Callables
Static utility methods pertaining to the Callable interface. |
interface |
CheckedFuture<V,X extends Exception>
A CheckedFuture is an extension of Future that includes
versions of the get methods that can throw a checked exception and
allows listeners to be attached to the future. |
class |
ExecutionList
A list of ( Runnable , Executor ) pairs that guarantees
that every Runnable that is added using the add method will be
executed in its associated Executor after ExecutionList.run() is called. |
class |
FakeTimeLimiter
A TimeLimiter implementation which actually does not attempt to limit time at all. |
class |
ForwardingListenableFuture<V>
A ForwardingFuture that also implements ListenableFuture . |
class |
ForwardingService
A Service that forwards all method calls to another service. |
class |
Futures
Static utility methods pertaining to the Future interface. |
interface |
ListenableFuture<V>
This interface defines a future that has listeners attached to it, which is useful for asynchronous workflows. |
class |
ListenableFutureTask<V>
A FutureTask that also implements the ListenableFuture
interface. |
class |
MoreExecutors
Factory and utility methods for Executor , ExecutorService , and ThreadFactory . |
class |
SimpleTimeLimiter
A TimeLimiter that runs method calls in the background using an ExecutorService . |
class |
ThreadFactoryBuilder
A ThreadFactory builder, providing any combination of these features: whether threads should be marked as daemon threads a naming format a thread priority an uncaught exception handler a backing thread factory If no backing thread factory is provided, a default backing thread factory is used as if by calling setThreadFactory( Executors.defaultThreadFactory() ) . |
interface |
TimeLimiter
Produces proxies that impose a time limit on method calls to the proxied object. |
interface |
UninterruptibleFuture<V>
A Future whose get calls cannot be interrupted. |
class |
ValueFuture<V>
A ListenableFuture whose result may be set by a ValueFuture.set(Object)
or ValueFuture.setException(Throwable) call. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


Be the first player to reach 100 points.
On a turn, a player rolls the die repeatedly until either:
If the player chooses to hold, all of the points rolled during that turn are added to his or her score.
My Github My twitter
© Created By John Gatheru


Apple Teases Its Black Friday 2019 Offers: Here’s What Has Been Revealed
by David PhelanEvery Black Friday for the last few years, Apple has joined the sales tumult with offers of its own. Last year, it broke with tradition by increasing the length of the event from one day to four. In the last few hours, a teaser page has appeared on the Apple website – and even then, you’ve got to look hard to find it: it’s here.
But this is not like some Black Friday ad where many of the best offers are unveiled in full detail. No, no, this is just enough, perhaps, to intrigue us, ready for the event itself on Friday.
Here’s what we know.
Apple’s event runs for four days
It starts on Friday, November 29 and ends on Cyber Monday, December 2.
Likely starts at midnight
Well, if it follows last year’s pattern, it will begin at 12.01AM Pacific (12.01AM GMT in the U.K.) and run for 96 continuous hours, ending at the very last second of Cyber Monday, again that’s Pacific Standard Time and GMT in the U.S. and U.K. respectively.
Huawei Beats Apple iPhone 11 Pro Max, Samsung Galaxy S10+ In New Rating
Forbes David Phelan
It’s all about the gift cards
Well, I suppose there could be more surprises to follow but for the last few years, Apple’s special shopping event has worked in a very specific way: buy something and get a gift card to spend in store.
How much?
Full details will emerge nearer to Friday or indeed probably on Friday itself. What we know right now is the value of the maximum gift card. On certain purchases, you’ll get a gift card of $200 (£160 U.K.) to spend in store. That’s the same maximum value as last November, and $50 (£40 U.K.) more than the maximum from the year before.
Apple Mac
Last year, the $200 gift card came with select purchases of Mac laptops and I predict it’ll be the same this year.
That doesn’t mean other purchases will attract the same gift card levels. The fact that the maximum value is the same as 2018 suggests to me that we may see similar levels of discount across the board.
Apple Watch and iPad
So, there’s probably going to be a $50 (£40 U.K.) card when you buy an Apple Watch, possibly only if you buy Series 3 rather than the latest model but we’ll see. A similar-value gift card came with select iPad and iPad mini purchases last year.
Apple iPad Pro
Customers who snagged an iPad Pro last year saw a $100 gift card come their way.
Apple iPhone
Last year, iPhone 7 and iPhone 8 purchases came with a $50 gift card. This year, I’d expect a similar value with iPhone XR purchases or just possibly with the iPhone 11 – but this is just conjecture for now: we’ll have to wait and see. Check back later in the week when I’ll nail down every offer in detail.
_________________________
Follow me on Instagram by clicking here: davidphelantech and Twitter: @davidphelan2009
More on Forbes
_________________________


Puerto Willams, Chile's most southern city, is the usual jumping off point for Antartica. It is situated on Navarino Island in the Beagle Channel.
Position 54° 55'55"S, 67° 36'28"W.
See full details on clearing into and out of Chile at Chile Formalities.
Arrival
Yachts entering the Beagle Channel area should contact the Chilean Navy on VHF Channel 16. Puerto Williams is a naval base, but yachts are welcomed there. Cruising boats are usually told to proceed directly into the small western basin, close to the airport, where there is a concrete dock. Shallow-drafted boats may come on its inside, or tie up alongside the Micalvi, a former supply ship, now used as a yacht club by the locals.
The port captain of Puerto William requires any yacht whose registration papers state their gross weight is in excess of 50 Tonnes, to use a harbour pilot. See comment below.
Recently "SAG" (the authorities responsible for avoiding alien flora and fauna arriving on Chilean soil) have started implementing a law that no fresh fruit, vegetables or meat can be brought into the country. Any on board will be confiscated and destroyed. Fines for not complying may be introduced. This law is enforced in the rest of Chile, however it has only been introduced in PW in 2016. This will cause problems for boats who visit Ushuaia for re-provisioning due to the unreliable supplies in Puerto Williams. See the Clearance section for more details.
Officials will visit the boat here, after which the captain must go to the port captain's office to complete formalities. It is essential that those for whom this is the first port of entry into Chile insist on being given the compulsory Customs certificate. Those who leave without it will have serious problems when clearing out of Chile.
Fees
See main Fees section for standard charges.
Departure
Yachts should inform the authorities of their intended route while in Chilean waters and, when practical, make a daily report on VHF Ch 16. In an effort to "more closely control foreign vessels", further Clearance rules apply for local trips from Puerto Williams (for exampe to the Horn and the glaciers and up the Beagle Channel). See Clearance departure section for more details.
Last updated January 2016.
There is an anchorage in Seno Lauta, with good holding, but exposed to both easterly and westerly winds. It is free, but requires permission from the Port Captain.
The most pleasant, and safest berths are at the Club Naval de Yates Micalvi. It is based in a small inlet at the western end of the harbour. Yachts moor alongside an old Chilean Navy ship that is grounded at Seno Lauta to serve as a Pontoon. Yacht club facilities (such as WiFi, showers, bathroom, electricity and Club House) are located in this historical ship.
This port can be closed in really bad weather.
A new Fisherman’s Coop Port, meant to open by 2015, is still under construction. According to the Mayor of Puerto Williams the fishermen want yachts to use the facilities to offset the costs of the maintenance. The project however looks to be a long way from opening.
Last updated January 2016.


I work as Senior Software Engineer with Mastercard's API team. I was previously working with Mastercard Labs and before that with Visa Labs. I graduated from National University of Singapore with a Masters degree in Computer Science.
I have a keen interest in varied technologies - Web applications, Android applications, Internet of Things, Machine Learning and Data Science
My work at Mastercard in Digital Payments and Labs involves innovating on new technologies in payments and building new experiences to pay. Using Mastercard's developer portal allow the access to new services to the whole ecosystem.
My previous work experiences in Visa, Mettl and Tally Solutions gives me a strong understanding of Web and Mobile applictions. I have worked in Data Science and Machine learning in Visa and worked in various languages and platforms at production level including - Java, Android, Python, NodeJs, Javascript, CSS, PHP and Hadoop.
My coursework at NUS included-
I completed my Engineering from Guru Gobind Singh Indraprastha University, Delhi. Academically, I have always been in top 10% of the class.
I have filed a total of 8 patents till now. Some of the patents that I have filed are-


--- layout: default title: About Us ---
Founded by the Serverless Stack team in 2017. We want to make sure your team has everything it needs to build great products.
We are lucky to have some of the greatest investors of Silicon Valley on our side.
Founded LinkedIn
Founded PayPal
Founded YouTube
Founded Yelp
Founded MySpace
Founded BitTorrent Inc.
Founded Hot or Not
Founded Hot or Not
Investor
Investor
Investors
Originally founded by the Serverless Stack team in San Francisco. We now run distributed teams across the globe. If you are passionate about developer tools, we would love for you to join our team!


Class: RubyJS.Range
| Defined in: | lib/corelib/range.coffee |
| Inherits: | RubyJS.Object |
| Includes: | RubyJS.Enumerable |
Overview
R.Range.new()
Class Method Summary
- + (void) new(start, end, exclusive = false) TODO: .new should BOX here:
Instance Method Summary
- - (void) constructor(start, end, exclusive = false) Constructor TODO: do not box here...
- - (void) '=='(other)
- - (?) begin(obj) Returns the first object in rng
- - (void) cover(obj) Returns true if obj is between beg and end, i.e beg <= obj <= end (or end exclusive when exclude_end? is true).
- - (void) '==='(other)
- - (Range, Enumerator) each(block) Iterates over the elements rng, passing each in turn to the block.
- - (?) end() Returns the object that defines the end of rng.
- - (true, false) exclude_end() Returns true if rng excludes its end value.
- - (obj, Array<obj>) first(n) Returns the first object in rng, or the first n elements.
- - (String) inspect() Convert this range object to a printable form (using inspect to convert the start and end objects).
- - (void) min(block) min → obj min {| a,b | block } → obj Returns the minimum value in rng.
- - (?) max(block) Returns the maximum value in rng.
- - (void) start()
- - (Range, Enumerator) step(step_size = 1, block) Iterates over rng, passing each nth element to the block.
- - (void) to_a()
Inherited Method Summary
Methods inherited from RubyJS.Object
.include, .__add_default_aliases__, #send, #respond_to, #to_enum, #tap
Included Method Summary
Methods included from RubyJS.Enumerable
Class Method Details
+ (void) new(start, end, exclusive = false)
TODO: .new should BOX here:
Constructor Details
- (void) constructor(start, end, exclusive = false)
TODO: do not box here...
Instance Method Details
- (void) '=='(other)
- (?) begin(obj)
Returns the first object in rng
- (void) cover(obj)
Returns true if obj is between beg and end, i.e beg <= obj <= end (or end exclusive when exclude_end? is true).
R.rng("a", "z").cover("c") #=> true
R.rng("a", "z").cover("5") #=> false
@param other
- (void) '==='(other)
- (Range, Enumerator) each(block)
Iterates over the elements rng, passing each in turn to the block. You can only iterate if the start object of the range supports the succ method (which means that you can’t iterate over ranges of Float objects).
If no block is given, an enumerator is returned instead.
R.rng(10, 15).each (n) ->
console.log n, ' '
# 10 11 12 13 14 15
- (?) end()
Returns the object that defines the end of rng.
R.rng(1,10).end() #=> 10
R.rng(1,10, true).end() #=> 10
- (true, false) exclude_end()
Returns true if rng excludes its end value.
- (obj, Array<obj>) first(n)
first(n) not yet implemented
Returns the first object in rng, or the first n elements.
- (String) inspect()
Convert this range object to a printable form (using inspect to convert the start and end objects).
- (void) min(block)
min → obj
min {| a,b | block } → obj
Returns the minimum value in rng. The second uses the block to compare values. Returns nil if the first value in range is larger than the last value
- (?) max(block)
Returns the maximum value in rng. The second uses the block to compare values. Returns nil if the first value in range is larger than the last value.
- (void) start()
- (Range, Enumerator) step(step_size = 1, block)
Iterates over rng, passing each nth element to the block. If the range contains numbers, n is added for each iteration. Otherwise step invokes succ to iterate through range elements. The following code uses class Xs, which is defined in the class-level documentation.
If no block is given, an enumerator is returned instead.
R.rng('a', 'f').step(2, (x) -> puts x) # => a c e R.rng('a', 'f').step(3).to_a() # => [a, d]
- (void) to_a()


WITNESS LIST State Affairs Committee April 15, 2003 - 8:00A HB 4 FOR: Anderson, Richard (TAPA), Napa, GA Bailey, Charles (Texas Hospital Association), Austin, TX Bonnen, Greg (Texas Association of Neurological Surgeons), Houston, TX Cooper, Brent (TAPA), Dallas, TX Durand, John (Tarrant Co. Medical Society), Fort Worth, TX Gadberry, Gavin (Texas Health Care Association), Amarillo, TX Hollon, Kim (Methodist Medical Center), Dallas, TX Hull, Mike (Texas Alliance for Patient Access), Austin, TX McGehee, Robert N. (Tarrant Co. Med Society/ TMA), Fort Worth, TX Myers Mitchell, Frances A. (Border Health Caucus), Mission, TX Parsley, Lee (Self), Austin, TX Rowald, Kent A. (Self), Houston, TX Stebbins, Dick (Texas HealthCare Coalition), Longview, TX Trabulsi, Jr., Richard J. (Texans for Lawsuit Reform), Houston, TX Traylor, Betty (TX Healthcare Assoc./IHS Theron Granger), Hughes Springs, TX Vinson, James R. (TAPA), Austin, TX Waldrop, Alan (Texans for Lawsuit Reform), Austin, TX Wilson, Bruce (The Physician Insurers Association of America), Rockville, MD Wylie, William E. (Self), Tyler, TX AGAINST: Bachus, Briana (Self), Castroville, TX Bachus, Kathleen (Self), Castroville, TX Bragg, David (AARP), Austin, TX Byrne, Dan (Texans for Civil Justice), Austin, TX Cherry, David E. (TEX-ABOTA Legislative & Education Fund, Inc.), Waco, TX Choate, Guy (Texas Trial Lawyers), San Angelo, TX Edwards, Libby (TANHR), Corpus Christi, TX Ferris, Beth (Texas Advocates for Nursing Home Residents), Austin, TX Fuqua, Cecil (Self), Roanoke, TX Harrison, Steve (Texas Trial Lawyers Association), Waco, TX Jacks, Tommy (TTLA), Austin, TX Kelly, Peter M. (Self), Houston, TX Korioth, Tony (TML Intergovernmental Risk Pool), Austin, TX Lane, Christopher E. (Medical Malpractice Defense (Bar)), Dallas, TX Lyon, Ted (Self), Mesquite, TX Miller, Doris (Self), Longview, TX Moore, Edward (TTLA), Dallas, TX Silver, Charles (Self), Austin, TX Sweeney, Paula (TTLA), Dallas, TX Tew, Brian (Self), Houston, TX Tutt, Kim (Self), Tyler, TX Registering, but not testifying: For: Berger, Ed (Seton Healthcare Network), Austin, TX Garza, Jesus (Seton Healthcare Network/Brackenridge Hospital), Austin, TX Jamison, Mazie M. (Children's Medical Center of Dallas), Dallas, TX Tolman, Russell K. (Cook Children's Health Care System), Ft. Worth, TX Against: Flores, Maria Luisa (Mexican American Bar Assn. of TX), Austin, TX McLin, Amy M. (Self), Boerne, TX Seale, Mark (National Citizens' Coaltion for Nursing Home Reform, Texas Advocates for Nursing Home Residents), Austin, TX Sylvester, Chaz (Self), Houston, TX Tracy, E. Todd (Self), Dallas, TX


Pirate (ARRR) is a cryptocurrency that solves the issue of financial privacy on the blockchain through forced anonymous transactions. Protect your wallet and transactions with Pirate’s completely anonymous network. With forced private transactions, your privacy cannot be compromised by another users’ activity on the network. If you wish to learn more, please join the official Pirate Discord at https://pirate.black/discord/ or message FishyGuts#5085, who will be happy to help out.
100 messages
Before 05-Dec-19 12:00 AM
GatewayBOT23-Nov-19 08:51 PM
[dscrd-prt] <CHMEX> you already know the bitcoin part because you wrote the first version
[dscrd-prt] <SatoriNakamoto> does pirate have anything to do with cryptonote?
[dscrd-prt] <CHMEX> no
[dscrd-prt] <SatoriNakamoto> no no, that was my cousin
[dscrd-prt] <SatoriNakamoto> craig satoshi wright
GatewayBOT23-Nov-19 09:03 PM
[dscrd-prt] <kaks> lol
[dscrd-prt] <mrlynch> maybe in the end we have a tree next upgrade is blossom
[dscrd-prt] <CHMEX> nice
GatewayBOT23-Nov-19 11:26 PM
[dscrd-prt] <house> @here
I'm looking for two writers to cover two topics
Comparison article for social media (Facebook, Twitter, Gab, Mastodon, etc)
Comparison article for email (Protonmail, Tutanota, Outlook, Thunderbird, etc)
The underlying theme is PRIVACY
Following the general-coverage article ... the series will drill-down into specific privacy projects and their advantages to the average user
Conditions
- 1000 ARRR payment per article
- 1000 word minimum
- solid command of english language
- work as an individual or as a team
- further work going forward
- Bonuses for excellence
- Deadline 4th DecemberEDIT:
The above work has now been assigned.
Please still indicate your interest as we have plenty more work going forward.
Best
house(edited)
GatewayBOT24-Nov-19 04:28 AM
[dscrd-prt] <Hember> I could make a comparison video about ARRR and some other currency. Maybe Beam.But that would be in Finnish. And I might add puppies.
[dscrd-prt] <Hember> I hope there will be puppies in the articles, too.
GatewayBOT24-Nov-19 05:38 AM
[dscrd-prt] <SatoriNakamoto> where's the bootstrap? i can't find it on official-links or the website
This article describes how you can start using PIRATE (ARRR) chain using command line interface (CLI) on different operating systems.
[dscrd-prt] <SatoriNakamoto> with bootstrap i keep getting "error in HDD, corrupt blocks, you need to update and if that doesn't work you need to resynch"
[dscrd-prt] <SatoriNakamoto> the 2nd thing on that guide is update komodo
[dscrd-prt] <mrlynch> pirate uses the komodo binaries
[dscrd-prt] <mrlynch> when applying bootstrap make sure the daemon is stopped
[dscrd-prt] <SatoriNakamoto> thanks it was stopped
[dscrd-prt] <SatoriNakamoto> i dont have komodo built, do i need to do that? it says update komodod with
cd komodo
git checkout dev
etc
[dscrd-prt] <SatoriNakamoto> i have only pirate folder
[dscrd-prt] <ComputerGenie > those instructions are written for using JL777/komodo, if you use PirateNetwork/pirate, then just make substitutions where appropriate
[dscrd-prt] <SatoriNakamoto> ... i should have thought of that
[dscrd-prt] <SatoriNakamoto> thank you
[dscrd-prt] <SatoriNakamoto> error: pathspec 'dev' did not match any file(s) known to git
[dscrd-prt] <SatoriNakamoto> i just installed from master yesterday. is this step necessary?
[dscrd-prt] <ComputerGenie > master is good to use
GatewayBOT24-Nov-19 12:51 PM
[dscrd-prt] <SatoriNakamoto> damn, i keep getting:
2019-11-24 12:31:09 init message: Rewinding blocks if needed...
2019-11-24 12:31:49 init message: Verifying blocks...
2019-11-24 12:31:49 Verifying last 288 blocks at level 3
2019-11-24 12:31:50 ERROR: CheckTransaction(): this is a private chain, only sprout -> taddr allowed until deadline
2019-11-24 12:31:50 ERROR: CheckBlock: CheckTransaction failed
2019-11-24 12:31:50 ERROR: VerifyDB(): *** found bad block at 641767, hash=000000002eba7530a61715931b138639da2260fe8b77bcff5b13bca60eb153c1
2019-11-24 12:31:50 : Corrupted block database detected.
error in HDD data, might just need to update to latest, if that doesnt work, then you need to resync
2019-11-24 12:31:50 Aborted block database rebuild. Exiting.
2019-11-24 12:31:50 Shutdown: In progress...
[dscrd-prt] <SatoriNakamoto> i tried with the bootstrap from 0x03 and north american server from @CHMEX , both got same error
[dscrd-prt] <SatoriNakamoto> welp, gotta synch from 0. see you in 4 days boys
[dscrd-prt] <SatoriNakamoto> lol
[dscrd-prt] <ComputerGenie > this is a private chain, only sprout -> taddr allowed until deadline
I'm not sure what you did or if your clock is a year off
[dscrd-prt] <ComputerGenie > that block was like 3 hrs ago and we passed the start of sapling almost a yr ago
[dscrd-prt] <SatoriNakamoto> i think my computer's on drugs
[dscrd-prt] <ComputerGenie > pathspec 'dev' did not match any file(s) known to git
looking back at that, what repo are you using? every repo I can find has a dev branch
[dscrd-prt] <SatoriNakamoto> i copy pasted the instructions from piratechain github
PirateChain. Contribute to PirateNetwork/pirate development by creating an account on GitHub.
[dscrd-prt] <SatoriNakamoto> git clone https://github.com/PirateNetwork/pirate --branch beta --single-branch
cd pirate
./zcutil/fetch-params.sh
# -j8 = using 8 threads for the compilation - replace 8 with number of threads you want to use; -j$(nproc) for all threads available
./zcutil/build.sh -j8
# This can take some time.
PirateChain. Contribute to PirateNetwork/pirate development by creating an account on GitHub.
[dscrd-prt] <ComputerGenie > follow what that says but use dev or master
[dscrd-prt] <SatoriNakamoto> ok thx
GatewayBOT24-Nov-19 01:34 PM
[dscrd-prt] <CHMEX> Looks like you have an outdated version of the binaries if the bootstrap did not work
[dscrd-prt] <ComputerGenie > PirateNetwork/pirate needs some pruning since master and dev are the only non-stale brances
[dscrd-prt] <ComputerGenie > @mrlynch
[dscrd-prt] <mrlynch> all branches were synced with jl777 repo at last major update
[dscrd-prt] <mrlynch> will sync again after this coming update
[dscrd-prt] <mrlynch> sorry, use master or dev
GatewayBOT24-Nov-19 02:25 PM
[dscrd-prt] <SatoriNakamoto> yeaaaaaaaa synched with the network!
[dscrd-prt] <SatoriNakamoto> that fixed it, thx guys
GatewayBOT24-Nov-19 02:39 PM
[dscrd-prt] <SatoriNakamoto> do i need to do
./komodod -ac_name=PIRATE -ac_supply=0 -ac_reward=25600000000 -ac_halving=77777 -ac_private=1 -addnode=<IP_ADDRESS> &
ever time or can i just do ./komodod -ac_name=PIRATE after the first time?
[dscrd-prt] <ComputerGenie > always all of the params
change a param and you're on a different chain
[dscrd-prt] <ComputerGenie > you can also make a short script for it (like a shortcut)


"Any type of pizza you want you name it they have got it plus they deliver it bundled with love"
'The pizza never gets better than this"
"I loved the service plus their delivery was on time I am a super impatient person that is why i totally loved their respect of time I got my order in exactly ten minutes as I had been notified after checking out"


Now that I am a postdoc scholar at the University of Kentucky (Go ‘Cats!), I am reflecting back on my experience as a Teaching Assistant.
One thing that was hard to discover, perhaps understandably, was the expected “stipend” of graduate teaching assistants at other universities I applied to.
For what it’s worth, I saved the information about our stipend. My department preferred that it not be public. But count your lucky stars you aren’t as poor as I was in 2012.
I can’t speak to what other departments do. Perhaps TAs make more, or have to work less, at public schools with lots of state funding or private universities with big endowments, but we were taken care of. Kentucky’s cost of living is quite low, plus we did side work.
Not me, but a good illustration of what philosopher grad students look like.
From the first year, the Buhler family “starving graduate student” status was somewhat alleviated by side work.
First, my wife worked part-time. she had our first baby the same week that school started, so this work did not begin until he was about six months old. over the following for years, she has worked an average of 15 hours a week tutoring and teaching.
Second, I took a very part-time tour guide job at a downtown attraction, which I worked full time during the summers. I occasionally taught high school courses at a local private 2-day school, and eventually began to “moonlight” at another university. I was making satisfactory progress, and so got permission from my advisor to send out resumes to local colleges for adjunct work. I lucked out and got a gig at Asbury because a friend was just leaving his adjunct post there, during the semester in 2014.
Third, we also were able to buy a duplex using money saved and gifted by parents. The rental income from one side of this duplex subsidized our mortgage and saved us a couple hundred a month from what we’d pay renting down the street.
Between these sources of income, we made it work.
Functionally, “TAs” are not teaching assistants but teachers.
Depending on the semester, they mostly don’t just grade or do recitations but full courses.
They are not adjuncts because they are salaried and have health insurance and some security, if they are making satisfactory progress in a program.
Graduate students are, functionally, low-paid junior professors.
They do not “assist” the teacher but teach; they do not receive a “stipend” but a salary.
I began in 2012 when there was a 2/1 or 1/2 teaching load. Graduate students could choose for the most part when they wanted to take on a lighter semester.
Immediately in 2013, however, we were given a pay raise and a heavier teaching load of 2/2. So while the total amount went up, the amount per class dropped down to a little better than adjunct professors, but far better if you factor in health insurance and tuition remission.
Thanks to good leadership, our stipend steadily rose over the years. This helped out my family a lot.
I can’t speak for future salaries because I am now paid differently as a postdoc. Next year, of course, I hope to have a full-time job somewhere. It remains for future graduate students to record – and if it is appropriate, share – their pay information for the benefit of posterity.


PyTorch and the Unknown CUDA Error
Table of Contents
The Problem
I recently decided to get back into using neural networks again and tried to update my docker container to get fastai up and running, but couldn't get CUDA working. After a while spent trying different configurations of CUDA, pytorch, pip, conda, and on and on I eventually found out that there's some kind of problem with using CUDA after suspending and then resuming your system (at least with linux/Ubuntu). This is a documentation of that particular problem and it's fixes (fastest but not necessarily the best answer: always shutdown or reboot the machine, don't suspend and resume).
The Symptom
This is what happens if I try to use CUDA after waking the machine from a suspend.
import torch
torch.cuda.is_available()
/home/athena/.conda/envs/neurotic-fastai/lib/python3.9/site-packages/torch/cuda/__init__.py:88: UserWarning: CUDA initialization: CUDA unknown error - this may be due to an incorrectly set up environment, e.g. changing env variable CUDA_VISIBLE_DEVICES after program start. Setting the available devices to be zero. (Triggered internally at /opt/conda/conda-bld/pytorch_1666642975993/work/c10/cuda/CUDAFunctions.cpp:109.) return torch._C._cuda_getDeviceCount() > 0
As you can see, the error message doesn't really give any useful information about what's wrong - there are a couple of suggestions but neither seems relevant or at least doesn't lead you to the fix.
The Disease and Its Cure
There's a post on the pytorch discussion boards about this error in which "ptrblck" says that he runs into this problem if his machine is put into the suspend state. While mentioning this he also says that restarting his machine fixes the problem, but restarting it every time seems to defeat the purpose of using suspend (and I'd have to walk to a different room to log in and decrypt the drive after restarting the machine - ugh, so much work).
Luckily, in a later post in the thread the same user mentions that you can also fix it by reloading the nvidia_uvm
kernel module by entering these commands in the terminal:
sudo rmmod nvidia_uvm
sudo modprobe nvidia_uvm
Which seems to fix the problem for me right at the moment, without the need to restart the machine.
print(torch.cuda.is_available())
False
Ummm… oops. Well, it did sort of fix one problem - the CUDA unknown error
, but now it's saying that CUDA isn't available on this machine. Every fix begets a new problem. Let's try it again after restarting the Jupyter kernel.
import torch
print(torch.cuda.is_available())
True
Okay, that's better, I guess. It feels a little inelegant to have to do this, but at least it seems to work.


After learning the basics of Ruby and ORMs, I’ve been working on a project leveraging the Sinatra development framework. Along with Activerecord, I’ve used it to build a simple blogging application and I will describe the process of developing it here.
The project uses basic Model View Controller architecture. It has a few simple models that interact with various routes in the controller which then composes and serves the different blog pages through the views.
Models:
The first thing I worked on were the models that would represent the data necessary for the blog to work using Activerecord. This includes Users
which would write and edit Posts
, which would in turn have Tags
. In addition, I used the model PostTags
as well, but only as an intermediary for a join table to connect Posts
and Tags
. This was necessary because a Post
has many Tags
, and a Tag
has many Posts
, and any time there’s a mutual ‘has many’ relationship between models, a join table is needed.
These associations provide a useful way to list different types of Posts
. All Posts
belong to a User
, so you can easily list all of a User
’s Posts
, or all of a Tag
’s Posts
as well. Providing an easy way to organize information is critical to building a successful application, and ActiveRecord provides ample ways of doing just that.
The Post
model code:
Controllers:
Unlike a framework like Rails, Sinatra has a unified router and controller. I used a separate controller for each model which helped organize all the different routes and actions. The Users
controller focuses on signing up and logging in Users
. The Posts
controller deals with the majority of the application’s functionality, namely the creation, editting, and deletion of Posts
as well as Tags
(since Tags
are created in the same page as Posts
). Finally, the Tags
and application controllers focus on a few utility tasks. As a whole, the controllers work together to facilitate the functionality of the website and process all the data.
An route/action to render the new post creation form:
Views:
Just like Rails, Sinatra uses ERB
files (Embedded Ruby) to dynamically generate html web pages and serve requested content. The views correspond to the routes/actions in the associated controllers, so there are views for showing a user page, displaying a login form, and so on. Using Bootstrap for basic frontend styling helps make the application look at least palatable (as opposed to hideous unstyled html). It may be a bit superficial, but it helps the application look like a complete thought.
The ERB code to display all the posts for a tag:
In conclusion, the project took longer than I expected due to the necessary refactoring to deal with things like processing the form data during post creation and editting as well all the individual gears necessary for even a simple web project like this involving a back end. It was certainly an educational experience and a good step towards learning to build professional grade applications.
You can find the source code for this project here on Github.


var delimiter: CharSequence
The delimiter that is used to separate the sequence's tokens from each other
delimiter - The delimiter that is used to separate the sequence's tokens from each other
delimiter
Author Michael Rapp
Since 2.1.0


UPfamDB : Core Pfam domains
A prototype of quick search of core pfam domains across 87,606 bacterial genomes
Submit


Data Swapping
How to swap the data of a chart during runtime
To make use of the swapping data feature, the chart has to first be initialized under a variable. You can find a guideline in the section usage on how to initialize and generate a chart. In this example we will initialize the chart under the variable "myChart", in order to later swap the data on the fly: var myChart = anchart3d.createChart() [...]
If you now want to change the data of a chart, you can use the swapData() method of the fluent api. Before you can apply the method, you have to first define the new data, which should be exchanged with the "old" data. Therefore, you simply use the data() method again, and pass the JSON - which contains your new data - as an argument. Finally, you can use swapData() to visualize the "new" data during runtime.
var swapOldData = function () { myChart.data(myNewData); myChart.swapData(); };
The function swapOldData, which can be seen in the second code snippet, can now be used in different ways. One example could be the usage of a button: <button onclick="swapOldData()">Swap data</button> As you can see, we have added an "onClick" event to the button, which will call our function from the first figure!


Looks like Hulu users can keep Add-ons with Disney+'s bundle after all
Source: Disney
What you need to know
- An update to Disney+ Founders Circle terms of service offers details about the bundle.
- The Disney+ bundle will link to Hulu or ESPN+ accounts by using the same email address.
- Once linked, monthly credits for the basic plan will be applied, but Add-ons can be managed separately.
Everyone is excited about Disney+'s launch tomorrow. The new streaming service is combining the best content from Disney, Pixar, Marvel, Star Wars, National Geographic and more. Fans and newcomers are excited about the new original shows and movies as well as the large catalog of existing content. Now all that's left is picking a plan.
Disney is a big company with multiple streaming services, so the company is offering a bundle with three services for one price. They will offer a bundle to give users Disney+, ESPN+ and ad-supported Hulu for $12.99 per month. As launch day approaches, details about the bundle are appearing online.
New Terms of Service related to the bundle have posted to the Disney+ Founders Circle, with information on linking the bundle with existing Hulu and ESPN+ accounts. These things are very lawyerly, and can be confusing, but the following passage from the Subscription Terms seems pretty clear.
If you already have any eligible Hulu subscription (purchased through or received from Hulu or any third-party other than Spotity) when you purchase the Bundle, you may keep and manage that subscription. You will continue to be billed by Hulu or such third-party that currently bills you for that Hulu subscription. You must subscribe to the Bundle with the same email address as associated with your existing Hulu subscription for Disney to provide you with a monthly credit against the Bundle price in an amount equal to the then-current retail price of Hulu's ad-supported plan (currently $5.99) for as long as you maintain that separate Hulu subscription.
What this appears to say is if you already have a Hulu account before you sign up, you can link it to your Disney+ bundle. You will do this by signing up for Disney+ with the same email address that you use for Hulu. Once you do, you will be billed the full Disney+ bundle price of $12.99, and then receive a monthly credit to your existing Hulu account for the $5.99 retail price of the ad-supported plan.
This means you could still manage your Hulu subscription separately. In theory, you could still use Hulu add-ons, like the No-Ad plan or premium channels like Showtime. Hulu would bill you for the remaining balance.
This is exactly what many of us have been hoping for regarding the bundle. It could be enticing to viewers who have the ad-free Hulu plan but still want to save by bundling. Remember that the Disney+ bundle isn't available for people who have promotions on their accounts, including the Hulu-Spotify deal, or ESPN+ annual plan. For a household like mine, where we already subscribe to Hulu and ESPN+ and are planning to add Disney+, this is a godsend.
A Whole New Bundle
Disney+
Looking to save with a bundle? Disney+ says "You're Welcome".
Disney+ is the streaming service for fans, families, and folks of all interests. When the bundle with Hulu and ESPN+ arrives, it will be a great option for deal-seekers too.
We may earn a commission for purchases using our links. Learn more.


WITNESS LIST Finance Committee April 10, 2003 - 9:00A Article III - General Academic Institutions ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III - Health-Related Institutions ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III - Special Provisions ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III - TX State Tech College System ON: Baisden, Debbie Senior Analyst (Legislative Budget Board), Austin, TX Article III, Higher Education ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Weilmaker, John Analyst (Legislative Budget Board), Austin, TX


>>> # This is a comment >>> numbers = [6, 3, 9, 1] >>> >>> sorted(numbers) [1, 3, 6, 9] >>> numbers [6, 3, 9, 1] >>> None < "3" Traceback (most recent call last): File "<stdin>", line 1, in <module> TypeError: '<' not supported between instances of 'NoneType' and 'str' >>> for x in [1, 2, 3] File "<stdin>", line 1 for x in [1, 2, 3] ^ SyntaxError: invalid syntax >>> for x in [1, 2, 3]: ... print(x) ... 1 2 3 >>> def foo(a, b): ... pass ... >>> class Foo(object): ... BAR = 12 ... ... def bar(self): ... pass >>> @decorated ... def thing(a, b, c): ... numbers = [1, 2, 3, 0.2, 0x12] ... x = sorted(numbers) ... ... raise AttributeError('string' + "string") ... ... for x in range(1, 10): ... while(True): ... try: ... b = numbers[0] ... except IndexError: ... break ...


6.S198 Assignment 2
Jenny Xue<EMAIL_ADDRESS>1.1) Model Builder (Problem 1)
-
You should see in the leftmost column of Model Builder that the initial model is marked “Invalid model”.
Why is the model invalid?
-
The model is invalid because the dimensions (shapes) of the layers don't match. The next step, which is flattening
the layer, solves this problem.
-
The classifications you are seeing are almost always wrong. Why is this?
What performance should you expect from this particular network, i.e., how often should you expect it to be correct?
Is this what you observe?
-
The classifications that we see is almost always wrong because the model is not yet trained. The probability of this network
being correct is 1/10 because there are 10 digits as options and the network is essentially making a guess. We observe random
classifications but the correctness is not always 10%.
1.2) Training (Problem 2)
-
What accuracy do you observe in training MNIST? How many inferences per second does the demo perform?
How many examples per second does it train? Then try the same thing with Fashion MNIST and document your findings.
-
After training about 5000 examples for MNIST, we observe a training accuracy of about 75%. The demo performs about 900-1200 inferences a second.
It trains about 905 examples a second.
-
After training about 5000 Fasion MNIST, we observe a training accuracy of about 73%. The demo performs about 1000-1400 inferences a second.
It trains about 698 examples a second.
-
What accuracy do you observe in training CIFAR-10 after letting it train for a minute or two.
-
After training about 30000 examples for CIFAR-10, we observe a training accuracy of about 40%. The demo performs about 500-700 inferences a second.
It trains about 765 examples a second.
-
Back to MNIST. Start training and you should see the accuracy plummet to zero, with terrible results. What’s going on?
-
I think this is because there are two linear layers one right after the other. We need to introduce some nonlinearity,
such as using a ReLU function. In general, cascading any number of linear FC layers is just equivalent to a single linear FC layer.
1.4) Activation Layer (Problem 3)
-
Train the new model. How well does it perform? Then make the first FC model wider by increasing the number of units to 100. Does this make a difference?
-
After training about 6000 examples for MNIST, we observe a training accuracy of about 54%. The demo performs about 1000-1200 inferences a second.
It trains about 500 examples a second.
-
Then make the first FC model wider by increasing the number of units to 100. Does this make a difference?
-
After training about 6000 examples for MNIST, we observe a training accuracy of about 78%. The demo performs about 700-1-00 inferences a second.
It trains about 492 examples a second. The model gradually performs better with more training and did better than when the first FC
model was only 10.
1.6) Exploring with Model Builder (Problem 4)
-
Train your MNIST model with 1,2,3,4, and 5 FC layers, with ReLU between them. For each, use the same hyperparameters, and the same number of
hidden units (except for the last layer). What were the training times and accuracy? Do you see any overfitting?
-
After training about 5000 examples for MNIST model with 1 FC layer, we observe a training accuracy of about 82%. The demo performs about 1000 inferences a second.
It trains about 580 examples a second.
-
Overfitting rarely happens.
Input -> Flatten -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for MNIST model with 2 FC layers, we observe a training accuracy of about 34%. The demo performs about 720 inferences a second.
It trains about 532 examples a second.
-
Overfitting happens only a couple of times.
Input -> Flatten -> FC(10) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for MNIST model with 3 FC layers, we observe a training accuracy of about 32%. The demo performs about 650 inferences a second.
It trains about 334 examples a second.
-
Overfitting happens only a couple of times.
Input -> Flatten -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for MNIST model with 4 FC layers, we observe a training accuracy of about 28%. The demo performs about 536 inferences a second.
It trains about 299 examples a second.
-
Overfitting happens quite a few times.
Input -> Flatten -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for MNIST model with 5 FC layers, we observe a training accuracy of about 31%. The demo performs about 456 inferences a second.
It trains about 258 examples a second.
-
The model constantly overfits.
Input -> Flatten -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> ReLU -> FC(10) -> Softmax -> Label
-
What can you conclude about how many layers to use?
-
Increasing the number of layers slowed down the training speed, but did not make the model more accurate. The model actually overfit more
as the number of layers increased. The model with only 1 FC layer was actually the most accurate and also had the highest training speed.
-
Build a model with 3 FC layers, with ReLU between them. Try making the first layer wide and the second narrow, and vice versa, using the same
hyperparameters as before. Which performs better? Why do you think this is?
-
Try the same experiments with Fashion MNIST and CIFAR-10. Do you get similar results?
-
After training about 5000 examples for Fasion MNIST model with first layer wide and second layer narrow, we observe a training accuracy of about 68%. The demo performs about 651 inferences a second.
It trains about 363 examples a second.
Input -> Flatten -> FC(100) -> ReLU -> FC(5) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for Fasion MNIST model with first layer narrow and second layer wide, we observe a training accuracy of about 23%. The demo performs about 757 inferences a second.
It trains about 380 examples a second.
Input -> Flatten -> FC(5) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for CIFAR-10 model with first layer wide and second layer narrow, we observe a training accuracy of about 28%. The demo performs about 535 inferences a second.
It trains about 319 examples a second.
Input -> Flatten -> FC(100) -> ReLU -> FC(5) -> ReLU -> FC(10) -> Softmax -> Label
-
After training about 5000 examples for CIFAR-10 model with first layer narrow and second layer wide, we observe a training accuracy of about 23%. The demo performs about 522 inferences a second.
It trains about 337 examples a second.
Input -> Flatten -> FC(5) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
The network gives very similar results with the first layer wide and second layer narrow being be the more accurate model.
2.1) Multilayer Models (Problem 5)
-
Perform some experiments to observe the effect of changing BATCH_SIZE and NUM_BATCHES. What can you say about the effect on the graph of cross entropies (the observed loss)?
Write a sentence or two describing your observations for your webpage.
-
No Change (BATCH_SIZE: 20, NUM_BATCHES: 50): Training Loss 1.93
-
Decrease Batch Size (BATCH_SIZE: 5, NUM_BATCHES: 50): Training Loss 2.05
-
Increase Batch Size (BATCH_SIZE: 50, NUM_BATCHES: 50): Training Loss 1.86
-
Decrease Num Batches (BATCH_SIZE: 20, NUM_BATCHES: 5): Training Loss 2.28
-
Increase Num Batches(BATCH_SIZE: 20, NUM_BATCHES: 100): Training Loss 1.63
-
Increasing the batch size and number of batches seems to decrease the training loss while
decreasing the batch size and number of batches seems to increase the training loss.
2.2) Training and Testing (Problem 6 & 7)
-
Look at some of the testing results and try to find examples of classifications where the system does
poorly and is even wrong. When you see interesting results, document them on your webpage.
-
Thick brush strokes cause the network to perform worse.
-
Slanted numbers cause the network to perform worse.
-
However, the network still did poorly on "well written" numbers, so there wasn't a distinct
pattern of what numbers were recognizable and what was not.
-
Experiment with changing the batch size and the number of batches to try to improve the testing results.
Give a brief description of what you tried, and the results.
 The best balance that I found was
a batch size of 100 and number of batches is 500, which gives a loss of 0.82 and accuracy of 86%.
-
Experiment to see how your new model does and briefly report on the results.
-
MNIST
-
Input -> Flatten -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.73, Last Accuracy: 75%
-
Input -> Flatten -> FC(100) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.75, Last Accuracy: 77%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.74, Last Accuracy: 71%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.71, Last Accuracy: 78%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.68, Last Accuracy: 75%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.73, Last Accuracy: 81%
-
In general, increasing the units in the Fully Connected layer and adding more Fully Connected layers increased the accuracy and
decreased the loss.
MNIST Code
-
Fasion MNIST
-
Input -> Flatten -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.69, Last Accuracy: 86%
-
Input -> Flatten -> FC(100) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.61, Last Accuracy: 83%
-
Input -> Flatten -> FC(100) -> ReLU6 -> FC(100) -> ReLU6 -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.66, Last Accuracy: 84%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(100) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.57, Last Accuracy: 85%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.47, Last Accuracy: 87%
-
Input -> Flatten -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(200) -> ReLU -> FC(10) -> Softmax -> Label
-
BATCH_SIZE: 100, NUM_BATCHES: 500: Last Loss 0.52, Last Accuracy: 86%
-
In general, increasing the units in the Fully Connected layer and adding more Fully Connected layers increased the accuracy and
decreased the loss. However, the loss and accuracy couldn't reach the levels of the MNIST images.
Fashion MNIST Code
2.3) Style Transfer Examples


--- layout: post title: Static libraries date: 2023-01-23 10:00:00 keywords: nativeaot teaser: Calling the multiply() function in a static library from C++ ord: 09500 ---
This is part of a series on Native AOT.
Previous -- Top -- Next
Buckle up folks, this part of the ride gets a little bumpy. As of .NET 7, using Native AOT with static libraries is implemented, but is not yet considered a supported and documented feature.
As mentioned previously, building a static library with Native AOT
is straightforward. Just set the
NativeLib
property to static
:
$ dotnet publish --property NativeLib=Static -r win-x64
And the code to call our multiply()
function is
no more complicated than it would normally be for whatever language
is in play. In this sample, we're using C++:
#include <cstdint> #include <stdio.h> extern "C" int32_t multiply(int32_t, int32_t); int main() { int32_t c = multiply(7, 6); printf("%d\n", c); return 0; }
Where things get tricky is when we try to link.
To be fair, the various command line options for any C++ compiler are usually arcane and complicated, so we'll try to blame Native AOT only for the complexity that it added to an already messy situation.
Using the Microsoft C++ compiler, our first attempt to build the program shown above might look something like the following:
cl.exe (compiler options) mul_main.cpp ../mul_cs/bin/Debug/net7.0/win-x64/publish/mul.lib (windows libraris)
I've omitted the usual compiler options and the long list of
Windows libraries so we can focus on the two things we really
care about. What we want is to compile the C++ snippet from
above, and link it with the static library containing our
multiply()
function, built by Native AOT.
 These symbols correspond to the various things that Native AOT code needs, a stripped-down form of the .NET runtime.
In principle, our trivial multiply()
function
should not need that stuff, but it is a degenerate case.
There are settings we could have used to
omit certain dependencies, but we didn't use those settings,
so Native AOT has assumed that this library will need all
the usual stuff.
So we need to add a bunch of static libraries to our link. When Native AOT building a dynamic library, this chore is performed automatically, because the .dll (or .so or .dylib) is built by the linker, but with a static library, we're deferring the actual link step until later.
But what libraries do we need? And where are they?
A few chapters ago, when we set things up for building
with Native AOT, we had to add the PublishAOT
property to our csproj
.
When the .NET SDK sees this property, it does a lot of work
behind the scenes, including adding references to several
nuget packages which contain the tools and libraries that
Native AOT needs. In the case of Windows, those libraries
are in the nuget package
runtime.win-x64.microsoft.dotnet.ilcompiler
.
I mentioned above that none of this is considered to be
a supported feature for .NET 7. In fact, the currently
suggested
way to figure this stuff out is to run a Native AOT build with
detailed logging and examine the output to see the actual
command line options for the C++ compiler.
That gives us the list of libraries, plus the fact that we
need to require the NativeAOT_StaticInitialization
symbol.
The final command line is just too ugly to show in a blog entry, but all the gory detail is in a BAT file in the sample code.
We end up with one self-contained executable file (which is still ridiculously large, grumble).
C:\Users\eric\dev\native-aot-samples\mul_cpp_win_static> dir Directory of C:\Users\eric\dev\native-aot-samples\mul_cpp_win_static ... 01/23/2023 09:53 AM 4,763,136 mul_main.exe ... C:\Users\eric\dev\native-aot-samples\mul_cpp_win_static> .\mul_main.exe 42
The code for this blog entry is available at:
https://github.com/ericsink/native-aot-samples/tree/main/mul_cpp_win_static


Split Milk
Log in
Split Milk
What is Split Milk?
Split Milk allows you to input your shopping list. You then tell us who bought what and if an item on the shopping list was shared by multiple individuals. We then tell you who owes what taking the hassle and awkwardness out of joint shopping.
Give It A Try


Contact-Pop for jQuery - Example
Contact-Pop replaces the links to your contact page with a pop-up form.
By default it pulls in any links that point to "/contact.php". Along with other options, this can be changed in contact-pop.js.
Click me to see Contact-Pop in action
However be careful with your paths, because Contact-Pop pulls in the href value, not the actual url, so "/contact.php", "contact.php" and "http://yoururl.com/contact.php" are all different.
Check out the original post for more info
Troubleshooting
The overlay pops up, but the form doesn't load
Make sure you are including this somewhere with PHP enabled, and that you have the correct path to contact-pop.php (this is set in contact-pop.js). If you upload the contact-pop directory to the public root of your website, it should work fine out of the box.
The overlay doesn't show
Make sure you are including the Javascript files correctly: Contact-Pop needs contact-pop.js as well as jquery.js (jquery-1.3.2.min.js works as well)
The overlay doesn't cover the entire page
Make sure that the margin/padding on your body and html tags are set to 0
Contact-Pop is removing the margin / padding from my page
Contact-Pop sets the margin and padding of the body and html elements to 0. If you need margin or padding, try assigning it to a wrapper.
Still having trouble?
If you are still having trouble and are convinced that the script isn't working correctly, please check here before writing me a nasty email. If you still need help, please contact me through my site JonRaasch.com.


   <title>CSCC - Common Sense Code Completion enhanced</title> <meta name="description" content="browser based code completion - now context aware"/> <link type="text/css" rel="stylesheet" href="/style.css"/>
Welcome to the CSCC demo.

 This is another demo for CSCC, Common Sense Code Completion. The original code is written by Martin Kool (@mrtnkl) from Quplo. Please read the Quplo blog for more details about CSCC.

 You are watching a version of CSCC containing fixes from Quplo code and some exciting additions, like context aware tags. Context aware tags are those that only appears inside another tag, for example "option" or "optgroup" tags inside "select".
 <select title="Try it now!"> </select>
 We use this enhanced code in production at Webpop, if you are a designer or web developer, don't forget to sign up for a beta test of Webpop!. :-)
 <form method="get" action="http://www.webpop.com/"> <input type="submit" value="Sign up now!"/> </form>


Biden Doesn’t Make It
Biden has only a few months left to his life He leaves us a little after the primaries end. Today is March 11.
Biden is Slightly Behind at the End Then Dies on Stage
Sanders wins the nomination.
Then becomes the President of the United States.
This was told me by the Angels, today.


Create horizontal forms with the grid by adding the .row
class to the .form-group
class and using the .col-*-*
classes to specify the width of your labels and controls. Be sure to add .col-form-label
to your <label>
s as well so they’re vertically centered with their associated form controls.


Articles
1,651 smashing members
A friendly community that keeps this website alive. With books, webinars, discounts and networking — for just 1 coffee a month. Join the family.
Already have an account? Sign in!11 DAYS AGO
Avoid Keyboard Event-Related Bugs In Browser-Based Transliteration
by Sandamal SiripathiNew on Smashing TV
A channel where seasoned developers show how they design, build, work and play. Coming up next: Building A Modern Electron App With React Hooks with Cassidy Williams (Mar 19).
Already have an account? Sign in!