Data Types | |
| interface | math_floordivision |
| interface | math_sort |
| interface | prototypeMultisetConstraint |
Public Member Functions | |
| real(8) function, public | math_wigner3j (j1, j2, j3, m1, m2, m3) |
| This function calculates the value of a Wigner-3j symbol. The equation used is equation 1.5 in "The 3j and 6j symbols" by Manuel Rotenber, R. Bivins, N.Metropolis and John K. Wooten, JR 1959, The Technology Press, Massachusett. More... | |
| real(8) function, dimension(3), public | math_cart2spher (vec) |
| Converts cartesian coordinates to spherical coordinates. More... | |
| real(8) function, dimension(3), public | math_spher2cart (rvec) |
| Converts spherical coordinates to cartesian coordinates. More... | |
| pure integer function, public | math_fact (n) |
| Returns the factorial of n. More... | |
| pure integer(8) function, public | math_comb (n, k) |
| taken from http://orion.math.iastate.edu/burkardt/f_src/combo/combo.html COMB computes the combinatorial coefficient C(N,K). More... | |
| integer function, public | math_multisetnumber (nElems, sGroups) |
| Number of combinations with repetitions. More... | |
| recursive subroutine, public | math_multisets (nElems, sGroups, items, constrainFunction) |
| Builds the combinations with repetitions. More... | |
| logical function, public | math_isodd (n) |
| logical function, public | math_iseven (n) |
| real(8) function, public | math_fixprecision (x, prec) |
| real(8) function, public | math_erfinv (x_in) |
| pure real(8) function, public | math_ustep (x) |
| pure real(8) function, public | math_ubox (x) |
| pure real(8) function, public | math_sinc (x) |
| Unnormalized sinc function. More... | |
| pure real(8) function, public | math_nsinc (x) |
| Normalized sinc function. More... | |
| real(8) function, public | math_erftophat (t, t0, w, dw) |
| t Independent variable (time) t0 Position of its center w tophat width of the pulse w turn-on/turn-off time More... | |
| real(8) function, public | math_average (array) |
| real(8) function, public | math_stdev (array) |
| logical function, public | math_isnan (x) |
| The result has the value true if the value of x is NaN; otherwise, false. More... | |
| subroutine, public | math_test () |
| Test method. More... | |
Public Attributes | |
| real(8), parameter, public | math_pi = acos(-1.0_8) |
| real(8), parameter, public | math_inf =<PHONE_NUMBER>9999999.0_8 |
| complex(8), parameter, public | math_i = cmplx(0.0_8, 1.0_8) |
Private Member Functions | |
| real *8 function | minusonetothe (j) |
| subroutine | math_isort (array, indexes) |
| indexing array so that array(indexes(j)), j=1..n is in ascending numerical order. method is heapsort, see also subroutine hpsort. taken from numerical recipies, p 233. More... | |
| subroutine | math_rsort (array, indexes) |
| indexing array so that array(indexes(j)), j=1..n is in ascending numerical order. method is heapsort, see also subroutine hpsort. taken from numerical recipies, p 233. More... | |
| recursive subroutine | multisetsbase (nElems, sGroups, items, nChosen, at) |
| Internal function. More... | |
| pure real(8) function | math_rfloordivision (x, y) |
| pure real(8) function | math_ifloordivision (x, y) |
| logical function | mystrconstrain (multisetPositions, current) |
| This is only necessary for Math_test method. More... | |
| logical function | myintconstraindebug (multisetPositions, current) |
| This is only necessary for RandomUtils_test method. More... | |
| logical function | myintconstrain (multisetPositions, current) |
| This is only necessary for RandomUtils_test method. More... | |
| logical function | mymassconstrain (multisetPositions, current) |
| This is only necessary for RandomUtils_test method. More... | |
Private Attributes | |
| integer, dimension(:), allocatable | kmulticombchosen |
| integer(8) | kmulticombiterator = -1 |
| logical | kmulticombfirsttime = .true. |
| integer, dimension(:), allocatable | ids |
| procedure(prototypemultisetconstraint), pointer, private | msconstraint |
| logical | ismultisetlocated = .false. |
| integer, dimension(:), allocatable | myiarray |
| real(8), private | erfinv_a3 = -0.140543331_8 |
| real(8), private | erfinv_a2 = 0.914624893_8 |
| real(8), private | erfinv_a1 = -1.645349621_8 |
| real(8), private | erfinv_a0 = 0.886226899_8 |
| real(8), private | erfinv_b4 = 0.012229801_8 |
| real(8), private | erfinv_b3 = -0.329097515_8 |
| real(8), private | erfinv_b2 = 1.442710462_8 |
| real(8), private | erfinv_b1 = -2.118377725_8 |
| real(8), private | erfinv_b0 = 1.0_8 |
| real(8), private | erfinv_c3 = 1.641345311_8 |
| real(8), private | erfinv_c2 = 3.429567803_8 |
| real(8), private | erfinv_c1 = -1.62490649_8 |
| real(8), private | erfinv_c0 = -1.970840454_8 |
| real(8), private | erfinv_d2 = 1.637067800_8 |
| real(8), private | erfinv_d1 = 3.543889200_8 |
| real(8), private | erfinv_d0 = 1.0_8 |
| real(8) function, public math_::math_average | ( | real(8), dimension(:), intent(in), allocatable | array | ) |
| real(8) function, dimension(3), public math_::math_cart2spher | ( | real(8), dimension(3), intent(in) | vec | ) |
| pure integer(8) function, public math_::math_comb | ( | integer, intent(in) | n, |
| integer, intent(in) | k | ||
| ) |
taken from http://orion.math.iastate.edu/burkardt/f_src/combo/combo.html COMB computes the combinatorial coefficient C(N,K).
Real arithmetic is used, and C(N,K) is computed directly, via Gamma functions, rather than recursively.
C(N,K) is the number of distinct combinations of K objects chosen from a set of N distinct objects. A combination is like a set, in that order does not matter.
Examples: The number of combinations of 2 things chosen from 5 is 10.
C(5,2) = ( 5 * 4 * 3 * 2 * 1 ) / ( ( 3 * 2 * 1 ) * ( 2 * 1 ) ) = 10.
The actual combinations may be represented as:
(1,2), (1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,4), (3,5), (4,5).
Formula: C(N,K) = N! / ( (N-K)! * K! )
Modified: 16 June 1999
Author: John Burkardt
| [in] | n | integer N, the value of N. |
| [in] | m | integer K, the value of K. output real CNK, the value of C(N,K) |
| real(8) function, public math_::math_erfinv | ( | real(8), intent(in) | x_in | ) |
| real(8) function, public math_::math_erftophat | ( | real(8) | t, |
| real(8) | t0, | ||
| real(8) | w, | ||
| real(8) | dw | ||
| ) |
| pure integer function, public math_::math_fact | ( | integer, intent(in) | n | ) |
| real(8) function, public math_::math_fixprecision | ( | real(8), intent(in) | x, |
| integer, intent(in) | prec | ||
| ) |
|
private |
| logical function, public math_::math_iseven | ( | integer, intent(in) | n | ) |
| logical function, public math_::math_isnan | ( | real(8), intent(in) | x | ) |
| logical function, public math_::math_isodd | ( | integer, intent(in) | n | ) |
|
private |
| integer function, public math_::math_multisetnumber | ( | integer, intent(in) | nElems, |
| integer, intent(in) | sGroups | ||
| ) |
| recursive subroutine, public math_::math_multisets | ( | integer, intent(in) | nElems, |
| integer, intent(in) | sGroups, | ||
| integer, dimension(:,:), intent(inout), allocatable | items, | ||
| procedure(prototypemultisetconstraint), optional | constrainFunction | ||
| ) |
Builds the combinations with repetitions.
A sGroups-combination with repetitions, or sGroups-multicombination, or multiset of size sGroups from a set S is given by a sequence of sGroups not necessarily distinct elements of S, where order is not taken into account.
| [in] | nElems | Number of elements |
| [in] | sGroups | size of the groups |
| [out] | items | final groups |
example: if S={a,b,c} then the combination of these elements in groups of two elements are 1) aa 2) ab 3) ac 4) bb 5) bc 6) cc
| pure real(8) function, public math_::math_nsinc | ( | real(8), intent(in) | x | ) |
|
private |
|
private |
| pure real(8) function, public math_::math_sinc | ( | real(8), intent(in) | x | ) |
| real(8) function, dimension(3), public math_::math_spher2cart | ( | real(8), dimension(3), intent(in) | rvec | ) |
| real(8) function, public math_::math_stdev | ( | real(8), dimension(:), intent(in), allocatable | array | ) |
| pure real(8) function, public math_::math_ubox | ( | real(8), intent(in) | x | ) |
| pure real(8) function, public math_::math_ustep | ( | real(8), intent(in) | x | ) |
| real(8) function, public math_::math_wigner3j | ( | real(8), intent(in) | j1, |
| real(8), intent(in) | j2, | ||
| real(8), intent(in) | j3, | ||
| real(8), intent(in) | m1, | ||
| real(8), intent(in) | m2, | ||
| real(8), intent(in) | m3 | ||
| ) |
This function calculates the value of a Wigner-3j symbol. The equation used is equation 1.5 in "The 3j and 6j symbols" by Manuel Rotenber, R. Bivins, N.Metropolis and John K. Wooten, JR 1959, The Technology Press, Massachusett.
The function has been tested for all sets, where j1d=j2d=5/2 and j3d={0, 2, 4}, and m1d+m2d+m3d=0 It has been tested to give zero for some vanishing terms If you should want to use it for higher js than the ones I have tested you might have to do something to avoid overflow in the expression with the many factorials
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |
| complex(8), parameter, public math_::math_i = cmplx(0.0_8, 1.0_8) |
| real(8), parameter, public math_::math_inf =<PHONE_NUMBER>9999999.0_8 |
|
private |
|
private |


Utilities
Options from the Utilities menu require a selection in the main Browser window.
Utilities menu options include:
• Display in Minibrowser displays selected items in the Minibrowser window. This option is convenient when you want to browse the source code for selected entities.
• Show Attributes opens a viewer and shows all the attributes of the selected entity. The list of attributes is a general inventory of all attributes stored in the model. Values appear for those attributes which are relevant to your selection. This option is a convenient way to examine metrics for an entity.
• Copy copies selected entity to another pane.


{% assign faqUrl = site.baseurl | append: '/faq' %}
{% assign AngularUrl = site.baseurl | append: '/faq' %}
{% assign resourcesUrl = site.baseurl | append: '/faq' %}
Tentative schedule (all times listed in Central Time)
Friday evening, July 24
- 6:15 - 6:30 - attendee check in
- 6:30 - 8:30 - tools installation party
Saturday all-day, July 25
- 9:15 - 9:30 - check in, meet your group
- 9:30 - 10:15 - opening announcements and overview of Angular
- 10:15 - 12:15 - coding, yoga
- 12:15 - 1:00 - lunch break
- 1:00 - 5:00 - coding, yoga, lightning talks, Q&A with Angular team
- 5:20 - 5:45 - closing announcements, sponsor presentations, raffle prizes, and goodbyes


At Least 5 People, Including 3 Tourists, Injured in Stabbing Attack in Jerash, Jordan - Reports
Jerash is located north of the capital Amman and is known for the ruins of the walled Greco-Roman settlement of Gerasa, just outside the present-day city.
Three Spanish tourists have been stabbed along with a security person near the Roman ruins in Jerash, Jordan, state newspaper al-Rai reported citing security sources.
Three Mexicans, one Swiss, and four Jordanians were injured in the stabbing incident at the tourist spot, Jordanian Health Minister Saad Fayez Jaber was reported as saying.
According to Jordanian police, a man that stabbed several tourists has been arrested. Preliminary reports say that the tourists are Mexican passport holders and that all the injuries are serious. Reports say that the injured people have been taken to a hospital and are receiving treatment.
The security services have already begun to investigate the incident to find out the circumstances surrounding the matter.
In August, unknown gunmen reportedly opened fire on a bus with tourist guides near the historic Jordanian town of Petra.


Given a vector of Taylor series coefficients of sufficient length as input, the function returns the numerator and denominator coefficients for the Padé approximant of appropriate order.
| Version: | 0.1-4 |
| Imports: | utils |
| Suggests: | testthat |
| Published: | 2015-07-29 |
| Author: | Avraham Adler [aut, cph, cre] |
| Maintainer: | Avraham Adler <Avraham.Adler at gmail.com> |
| BugReports: | https://bitbucket.org/aadler/pade/issues |
| License: | GPL-2 | GPL-3 | BSD_2_clause + file LICENSE [expanded from: GPL (≥ 2) | BSD_2_clause + file LICENSE] |
| URL: | https://bitbucket.org/aadler/pade |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| In views: | NumericalMathematics |
| CRAN checks: | Pade results |
| Reference manual: | Pade.pdf |
| Package source: | Pade_0.1-4.tar.gz |
| Windows binaries: | r-devel: Pade_0.1-4.zip, r-release: Pade_0.1-4.zip, r-oldrel: Pade_0.1-4.zip |
| OS X binaries: | r-release: Pade_0.1-4.tgz, r-oldrel: Pade_0.1-4.tgz |
| Old sources: | Pade archive |
Please use the canonical form https://CRAN.R-project.org/package=Pade to link to this page.


Health-Watcher
Update Employee
Login:
##LOGIN##
Name:
New password:
Repeat new password:
Current password:
##CLOSE##


| HBASE-15234 |
ReplicationLogCleaner can abort due to transient ZK issues |
Critical |
master, Replication |
Gary Helmling |
Gary Helmling |
| HBASE-15582 |
SnapshotManifestV1 too verbose when there are no regions |
Trivial |
master, snapshots |
Matteo Bertozzi |
Matteo Bertozzi |
| HBASE-15485 |
Filter.reset() should not be called between batches |
Major |
. |
Phil Yang |
Phil Yang |
| HBASE-15587 |
FSTableDescriptors.getDescriptor() logs stack trace erronously |
Major |
. |
Enis Soztutar |
Enis Soztutar |
| HBASE-15591 |
ServerCrashProcedure not yielding |
Major |
. |
Jerry He |
Jerry He |
| HBASE-15627 |
Miss space and closing quote in AccessController#checkSystemOrSuperUser |
Minor |
security |
huaxiang sun |
huaxiang sun |
| HBASE-15621 |
Suppress Hbase SnapshotHFile cleaner error messages when a snaphot is going on |
Minor |
snapshots |
huaxiang sun |
huaxiang sun |
| HBASE-15636 |
hard coded wait time out value in HBaseTestingUtility#waitUntilAllRegionsAssigned might cause test failure |
Minor |
integration tests, test |
Stephen Yuan Jiang |
Stephen Yuan Jiang |
| HBASE-15622 |
Superusers does not consider the keytab credentials |
Critical |
security |
Matteo Bertozzi |
Matteo Bertozzi |
| HBASE-15674 |
HRegionLocator#getAllRegionLocations should put the results in cache |
Major |
. |
Elliott Clark |
Heng Chen |
| HBASE-15670 |
Add missing Snapshot.proto to the maven profile for compiling protobuf |
Major |
. |
Enis Soztutar |
Enis Soztutar |
| HBASE-15645 |
hbase.rpc.timeout is not used in operations of HTable |
Critical |
. |
Phil Yang |
Phil Yang |
| HBASE-15676 |
FuzzyRowFilter fails and matches all the rows in the table if the mask consists of all 0s |
Major |
Filters |
Rohit Sinha |
Matt Warhaftig |
| HBASE-15613 |
TestNamespaceCommand times out |
Major |
. |
Enis Soztutar |
Enis Soztutar |
| HBASE-15755 |
SnapshotDescriptionUtils and SnapshotTestingUtils do not have any Interface audience marked |
Major |
. |
ramkrishna.s.vasudevan |
Matteo Bertozzi |
| HBASE-15738 |
Ensure artifacts in project dist area include required md5 file |
Blocker |
build, community |
Sean Busbey |
Nick Dimiduk |
| HBASE-15596 |
hbAdmin is not closed after LoadIncrementalHFiles completes |
Minor |
. |
Ted Yu |
Heng Chen |
| HBASE-15801 |
Upgrade checkstyle for all branches |
Major |
build |
Duo Zhang |
Duo Zhang |
| HBASE-15742 |
Reduce allocation of objects in metrics |
Major |
. |
Phil Yang |
Phil Yang |
| HBASE-15811 |
Batch Get after batch Put does not fetch all Cells |
Blocker |
Client |
stack |
stack |
| HBASE-15615 |
Wrong sleep time when RegionServerCallable need retry |
Major |
Client |
Guanghao Zhang |
Guanghao Zhang |
| HBASE-15827 |
Backport HBASE-15125 'HBaseFsck's adoptHdfsOrphan function creates region with wrong end key boundary' to 1.2 |
Major |
. |
Ted Yu |
Ted Yu |
| HBASE-15824 |
LocalHBaseCluster gets bind exception in master info port |
Major |
. |
Enis Soztutar |
Enis Soztutar |
| HBASE-15841 |
Performance Evaluation tool total rows may not be set correctly |
Minor |
. |
Jerry He |
Jerry He |
| HBASE-15850 |
Localize the configuration change in testCheckTableLocks to reduce flakiness of TestHBaseFsck test suite |
Major |
hbck |
Stephen Yuan Jiang |
Stephen Yuan Jiang |
| HBASE-15617 |
Canary in regionserver mode might not enumerate all regionservers |
Minor |
. |
Andrew Purtell |
Sanjeev Lakshmanan |
| HBASE-15465 |
userPermission returned by getUserPermission() for the selected namespace does not have namespace set |
Minor |
Protobufs |
Xiang Li |
Xiang Li |
| HBASE-15856 |
Cached Connection instances can wind up with addresses never resolved |
Critical |
Client |
Gary Helmling |
Gary Helmling |
| HBASE-14818 |
user_permission does not list namespace permissions |
Minor |
hbase |
Steven Hancz |
Xiang Li |
| HBASE-15873 |
ACL for snapshot restore / clone is not enforced |
Critical |
. |
Ted Yu |
Ted Yu |
| HBASE-15880 |
RpcClientImpl#tracedWriteRequest incorrectly closes HTrace span |
Major |
tracing |
Mikhail Antonov |
Mikhail Antonov |
| HBASE-11625 |
Reading datablock throws "Invalid HFile block magic" and can not switch to hdfs checksum |
Major |
HFile |
qian wang |
Appy |
| HBASE-15693 |
Reconsider the ImportOrder rule of checkstyle |
Major |
build |
Duo Zhang |
Duo Zhang |
| HBASE-15920 |
Backport submit-patch.py to branch-1 and earlier branches. |
Minor |
. |
Appy |
Appy |
| HBASE-15955 |
Disable action in CatalogJanitor#setEnabled should wait for active cleanup scan to finish |
Major |
master |
Stephen Yuan Jiang |
Stephen Yuan Jiang |
| HBASE-15954 |
REST server should log requests with TRACE instead of DEBUG |
Major |
. |
Enis Soztutar |
Enis Soztutar |
| HBASE-15698 |
Increment TimeRange not serialized to server |
Blocker |
. |
James Taylor |
Ted Yu |
| HBASE-15957 |
RpcClientImpl.close never ends in some circumstances |
Major |
Client, rpc |
Sergey Soldatov |
Sergey Soldatov |
| HBASE-15975 |
logic in TestHTableDescriptor#testAddCoprocessorWithSpecStr is wrong |
Trivial |
test |
huaxiang sun |
huaxiang sun |
| HBASE-15946 |
Eliminate possible security concerns in RS web UI's store file metrics |
Major |
. |
Sean Mackrory |
Sean Mackrory |
| HBASE-14644 |
Region in transition metric is broken |
Major |
. |
Elliott Clark |
huaxiang sun |
| HBASE-16016 |
AssignmentManager#waitForAssignment could have unexpected negative deadline |
Major |
. |
Stephen Yuan Jiang |
Stephen Yuan Jiang |
| HBASE-15746 |
Remove extra RegionCoprocessor preClose() in RSRpcServices#closeRegion |
Minor |
Coprocessors, regionserver |
Matteo Bertozzi |
Stephen Yuan Jiang |
| HBASE-16032 |
Possible memory leak in StoreScanner |
Major |
. |
Yu Li |
Yu Li |
| HBASE-16062 |
Improper error handling in WAL Reader/Writer creation |
Major |
. |
Vladimir Rodionov |
Vladimir Rodionov |
| HBASE-16012 |
Major compaction can't work due to obsolete scanner read point in RegionServer |
Major |
Compaction, Scanners |
Guanghao Zhang |
Guanghao Zhang |
| HBASE-15976 |
RegionServerMetricsWrapperRunnable will be failure when disable blockcache. |
Major |
. |
Liu Junhong |
Jingcheng Du |
| HBASE-16129 |
check_compatibility.sh is broken when using Java API Compliance Checker v1.7 |
Major |
test |
Dima Spivak |
Dima Spivak |
| HBASE-16093 |
Splits failed before creating daughter regions leave meta inconsistent |
Critical |
master, Region Assignment |
Elliott Clark |
Elliott Clark |
| HBASE-15925 |
compat-module maven variable not evaluated |
Blocker |
build |
Nick Dimiduk |
Sean Busbey |
| HBASE-16238 |
It's useless to catch SESSIONEXPIRED exception and retry in RecoverableZooKeeper |
Minor |
Zookeeper |
Allan Yang |
|
| HBASE-16360 |
TableMapReduceUtil addHBaseDependencyJars has the wrong class name for PrefixTreeCodec |
Minor |
mapreduce |
Matteo Bertozzi |
Jing Pu Chen |


08/13/2009 10:00:36 ¶ ● Politicians and diapers should be changed often and for the same reason Mark Twain


At Miss Darsey's,
We offer a wide range of cleaning services that will help you keep your home feeling comfortable and organised.
Our services include, but are not limited to:
If you want a clean that classy call Miss Darsey's
At Miss Darsey's,
We offer a wide range of cleaning services that will help you keep your home feeling comfortable and organised.
Our services include, but are not limited to:


--- layout: post title: 'LIFT07: Blowing the web apart, Ivan Pope' date: 2007-02-09 00:00:00 categories: digital-media interfaces-&-interaction ---
LIFT07: Blowing the web apart, Ivan Pope
Giving a "User-Generated Talk". The talk is a "widget embedded into the conference". Was an artist, entrepreneur and anarchist. "I've never blown up anything".
Widgets are everything that goes between the HTML tags. "I'm not a coder or designer, so this is a bit obscure to me". Everything there is a fragment of content, assembled by the makers.
Interested in how you fragment every piece of content, take every item down to its smallest part. Let consumers decide how it can be used. Every component of web pages should be widgetised so it can "reassemble itself". "Pick up the fragments and recomposite them into something similar to what you started with".
You can see people mucking around already, on sites like MySpace, on weblogs or on start pages like Netvibes. Blog software and social networks stop you from doing what you want here.
Moderator: there's a movement in SF of trying to widgetise the web, driven from San Francisco: microformats.
Q: The idea of widgets sounds great, but how does this affect advertising? What happens if end-users just aggregate widgets from different sites?
IP: We need to work out the answer to that question. Working out biz models for individual widget companies isn't the point. Advertising, possible. Content owners need to attach monetisation opportunity to their content as it goes out. I want a world where I don't put my stuff into my blog, I want to put my blog into my stuff (?). Blogs should be a set of widgets, dropped into a container.
Q: This is an interesting idea, a transition from page paradigm of the web to a flow paradigm.
IP: It's backwards and forwards, it's a swirl.
(The backchannel degenerates into a discussion on blowing midgets apart)


Silver Guidelines
Below is a list of guidelines that have been added to this prototype system:
Guideline 1-1-1: Non-Visual Text - All non-text content that is presented to the user has a text alternative that serves the equivalent purpose
Guideline 1-1-2: Audio-only and Video-only Time Based Media - For prerecorded audio-only and prerecorded video-only media, the following are true, except when the audio or video is a media alternative for text and is clearly labeled
Guideline 2-1-2: Keyboard (Understanding) - All functionality of the content is operable through a keyboard interface without requiring specific timings for individual keystrokes, except where the underlying function requires input that depends on the path of the user's movement and not just the endpoints


Wikipedia is a multilingual online encyclopedia created and maintained as an open collaboration project by a community of volunteer editors, using a wiki-based editing system. It features exclusively free content and no commercial ads, and is owned and supported by the Wikimedia Foundation, a non-profit organization funded primarily through donations. It was launched in on January 2001 by Jimmy Wales and Larry Sanger. Wikipedia has more than 53 million articles which 1.5 billion users every month. It currently stands on the seventh rank for the world's popular websites.


ADMB Files
Normal random effects
|
|
|
|
Model description
It is customary to assume that random effects are normally distributed.
Skrondal and Rabe-Hesketh (2004, Section 14.2) consider a measurement error problem, and
compare the following two models:
- Random effects normally distributed
- Non-parametric model for the random effects
A description of the model and data is given here. The non-parametric model 2)
indicates that the random effects distribution is skewed to the right.
In this example we show: 1) how to implement the model with normal random effects in ADMB-RE (diet.tpl) and 2)
how to modify the the program to obtain skewed random effects (diet_sk.tpl).
Only a small number of changes are needed to modify the ADMB-RE code to
implement the skewed random effects.
Results
By looking at the result files (diet.par and diet_sk.par) we observe the following:
- The estimated parameters under the normal model match very closely the estimates in
Table 14.1 of Skrondal and Rabe-Hesketh (2004).
- The log-likelihood value for the normal model is -1372.35, while the log-likelihood for the model with
skewed random effects is -1326.49. Hence, given that the skewed model only contains one extra parameter,
it gives a much better fit to data.
References
Skrondal and Rabe-Hesketh (2004), Generalized Latent Variable Modeling: Multilevel,
Longitudinal and Structural Equation Models. Chapman & Hall
|


Why you should use ES modules?
Hi! My name is João Paulo.
But you can call me JP 🤙
Front end developer at Grupo Globo
One of the maintainers of Clappr
I really love Rio Carnival
"The concept of modularity is used primarily to reduce complexity by breaking a system into varying degrees of interdependence and independence across and "hide the complexity of each part behind an abstraction and interface."
Baldwin, C.Y.; Clark, K.B. (2000). "Chapter 3: What Is Modularity?" - Design Rules: The power of modularity
Modules maximize code reusability, since one module can be imported by another module.
Modules explicitly define their imports and exports. So, they can be easily composed.
Allows multiple people to work individually in on project while not bottle-necking each other. Also if one of the modules breaks, instead of replacing the whole project, you just have to replace the individual module that broke.
A benefit already linked to the use of modules is the fact that the code has a much better organization, since we can create modules with unique responsibilities.

MDN Web Docs Glossary: Definitions of Web-related terms - Tree shaking
The use of tree shaking is much more difficult for dynamic cases and in some cases, it becomes impraticable.
Currently, it's possible to use ES modules without any module bundler or transpiler in the majority of Browsers (!!!)
In fact, this presentation is using <script type="module">
Now, I hope you will react like this when the subject is ES modules:


--- title: Boston Piano Lessons layout: base ---
Boston piano lessons are offered at 18 Mead St. Allston, MA 02134. Studio lessons are filling up fast, so please don't hesitate to schedule your first free lesson! My Contact Info


Places to...
Remember
Breathe
Live it
Learn
All
Navigation
Places
People
Stories
ABOUT
CONTACT
Around me
100m
500m
1000m


Leonardo Bonucci renews Juventus contract until 2024
by FSA EditorItaly defender Leonardo Bonucci stunningly left Juventus for AC Milan in 2017 but has now doubled down on his second spell with the club.
Leonardo Bonucci has signed a contract extension with Juventus running until June 2024, the Serie A champions have confirmed.
Italy centre-back Bonucci is in his second spell at Juve, having stunned the football world with a €42million switch to AC Milan in 2017.
However, the 32-year-old was back in Turin for the start of the following campaign and he has now committed for the next four-and-a-half seasons.
Initially signed from Bari in 2010, Bonucci has made 376 appearances and scored 17 times for the Bianconeri.
He has proved a pivotal figure under Maurizio Sarri, who was installed as Juventus head coach before the start of the 2019-20 season.
Bonucci is an ever-present in Serie A and the Champions League this term, while also featuring for the national team throughout their unblemished qualification campaign for Euro 2020.
Monday’s 9-1 thrashing of Armenia was Bonucci’s 95th cap for Italy.
Juve are also reported to be closing in on contract renewals for goalkeeper Wojciech Szczesny and winger Juan Cuadrado.


This event consists of 2 rounds. The first round will be an ordinary competitive programming round where the contestants will be given a desktop application and a PDF (for the second member of the team). The questions will be the same in the App and in the pdf.
The contestants are required to solve the questions and enter the output in the application which will be tested. A correct answer will award the team a certain number of points which is predetermined based on the difficulty of the question. The top 8 - 10 teams qualify for the final round.
The second round will have a new concept of Super Powers. Each time is again presented with questions and PDFs like earlier. Super Powers will be earned by teams by solving a question/ set of questions. A Super Power can be used to be advantageous to the user. For example; a super power may let the user replace a medium question with an easy question, or will allow the user to freeze (stop coding) for a certain period of time.
A random Super Power will be given to each team at the beginning of the round and can be used only 15 minutes after the commencement of the event. A Super Power can be achieved by solving a certain question/ set of questions (based on difficulty). The final results will be based on the total number of points scored.


Helena Bonham Carter had a sleepover at Windsor Castle with Daniel Craig
Cape Town – Helena Bonham Carter once had a sleepover at Windsor Castle with Daniel Craig and Queen Elizabeth.
The 53-year-old who takes over the role of Princess Margaret from Vanessa Kirby in the third season of The Crown on Netflix shared that she has personal ties with the princess. Her uncle Mark Bonham Carter once dated Margaret when he was a Grenadier Guard in Windsor, reports the DailyMail. She even has photos of the pair together.
In a new interview with Radio Times Helena further reveals that she once had a sleepover at the castle with Daniel Craig and Rachel Weisz about ten years ago.
During the stayover, she had dinner with the Queen, got a royal tour from Her Royal Highness and Prince Philip, and slept in Prince Charles' room, according to the DailyMail.
To play the role of the late princess the Alice in Wonderland actress said she visited a psychic to reach Margaret.
She went on to say that she received positive feedback from the princess who died in 2002.
The new season of The Crown premiers on Netflix on 17 November.
According to the streaming service the new season will see Queen Elizabeth (Olivia Colman) and her family struggle to meet the challenges of a rapidly changing Britain. From cold-war paranoia, through to the jet-set and the space age - the exuberance of the 1960s and the long hangover of the 1970s - Elizabeth and the royals must adapt to a new, more liberated, but also more turbulent world.
WATCH THE TRAILER HERE:
Compiled by Leandra Engelbrecht. (Sources: DailyMail, RadioTimes, Channel24, Netflix)


Garmin Connect users create vast amounts of personal data each day. Workouts, sleep, steps, all-day heart rate, locations, and more. What if you could do more with your data?
Your data stored with Garmin has the potential to give you innovative insights into your health, fitness, and activities. Unlocking ways that you can improve your performance, measure personal growth, and celebrate the achievement of your goals.
But you can't access your data.
Today, using Garmin Connect's API is locked behind a $5,000 paywall. This prevents you and other creative teams from unleashing the insights behind your fitness data.
It is a way for your fitness data, with your permission, to be accessed by other applications or used in your own personal analysis. The map behind was generated by the folks at Strava Labs using aggregated workout tracking data.
Just think what you could do with your own data. But you can't, because of Garmin's $5000 paywall.
You could also use any of these applications, created by small teams, which have been limited by Garmin's ransom for your data.
Other fitness services Strava, Runkeeper, Fitbit and more make your fitness data usable in the way you best see fit. For free.
Isn't it time Garmin gave you the freedom to use your own data without a $5,000 admission fee?
But don't just take our word for it.
The Guardian
How activity trackers remove our rights to our most intimate data"It's bad enough that APIs usually offer access to a limited amount of data, but Garmin now ransoms it out at $5,000 a go. This means small software developers and coders who might want to design an app, or even someone who wants to get a complete dataset into a spreadsheet, have to pay through the nose for the right to do so. That’s hardly accessible to the not-for-profits and passionate bedroom coders who do some of the most interesting and innovative work in this brave new data rich world."
Read More at The Guardian
DC RAINMAKER
Counterpoint: Understanding why the Garmin AutoSync rollout isn’t necessarily great for consumers"Virtually every one of these apps start as a hobbyist project first. It’s usually one person doing something they love that slowly grows into something more. Which is actually how virtually every company ever starts. If Garmin was smart about it, they can harness the power of these hobbyists/apps to show off the power of the Garmin device ecosystem – thus indirectly making it more appealing to buy Garmin devices than competitor devices."
Read More at DC RAINMAKER
Let Garmin know that it is time for the paywall to end.
Let them know you want access to your data.


Hot Restaurant!
Make your reservation
View Tables
Home
Table Reservation
Name
Phone Number
Email
Unique ID
Submit
Control Panel
Clear Reservation Table |
View Reservations


--- layout: page description: "Let's learn how to code and build projects using free onlilne resources." htmlTitle: "Let's learn to code together." --- {% for post in paginator.posts %}


--- layout: page weight: 0 title: Joomla navigation: show: true ---
Joomla supports sending email over SMTP. To have Joomla relay email through SendGrid go to Site > Global Configuration and change:


Network play works by player A running the Emulator and player B running the Guest:
At least one player must to ensure that port forwarding is enabled on their router for UDP traffic, on ports 7000 and 7001. If both players can forward these ports, the chance of a successful connection is improved.
Agree on who should run the Emulator. Generally, the player with the better network upload speeds should do this.
Choose a code name and share this by email, instant message, text message, smoke signal, or however you choose. It’s not especially important what this code is, and you can use the same one over and over again if you like. They are only retained until the connection has been made, at which point the +F Relay Service forgets it again.
Players A and B both choose the Connect option from the Network menu, and enter the code name in the pop-up.
After a short while, the pop-up should disappear and the Emulator’s screen should be shared with the Guest.
The guest can use the keys Q, A, O, P and M as a Kempston joystick controller.
Status messages below the display will show the current connection status. The colour of the message indicates the overall quality of the connection:


There are a lot of date pickers out there, but why have an old and boring calendar when you can have a modern and slick date selector?
Meet DateSelect, a new way to select dates on your forms.
Just grab the JS and CSS files, include them on your HTML file and you're set.
<link rel="stylesheet" href="css/jquery.dateselect.css">

This awesome plugin has two operation modes: automatic or manual.
In automatic mode you'll just have to add a data-*
attribute and the plugin will do all thee work (but for this to work, you must have also a valid HTML 5 DOCTYPE).
If you can't (or don't want to) add a DOCTYPE you can still use the good old $('#input').dateSelect()
to bind your input fields.
HTML
<input type="text" name="date1" id="date1" class="form-control" data-select="date">  <button class="btn btn-primary" type="button" data-toggle="select"></button>
Result
In manual mode, you'll have to call the $.dateSelect.show()
method to open the date picker.
 It's up to you!
Just include the jQuery MouseWheel plugin and it will automagically make it work.
This software is released under the MIT license.
Copyright © 2014 biohzrdmx
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Fork the repo, add an interesting feature or fix a bug and send a pull request.
As was said earlier, this works on Chrome, Firefox and Opera. IE8+ should work too, but we aren't officially supporting it (maybe IE10, but it's still a buggy, crappy browser; please let them die alone).
Safari shouldn't have any problem, after all it's just another webkit flavor.
Lead coder: biohzrdmx (github.com/biohzrdmx)


Technical analysis - moving averages (pynance.tech.movave
)¶
-
pynance.tech.movave.
bollinger
(eqdata, **kwargs)[source]¶ Bollinger bands
Returns bolldf, smadf where bolldf is a DataFrame containing Bollinger bands with columns ‘Upper’ and ‘Lower’ and smadf contains the simple moving average.
Parameters: eqdata : DataFrame
Must include a column specified in the selection parameter or, if no selection parameter is given, a column ‘Adj Close’.
window : int, optional
Lookback period.
multiple : float, optional
Multiple of standard deviation above and below sma to use in calculating band value. Defaults to 2.0.
selection : str, optional
Column of eqdata on which to calculate bollinger bands. Defaults to ‘Adj Close’.
Returns: bolldf : DataFrame
Dataframe containing columns ‘Upper’ and ‘Lower’ describing the given multiple of standard deviations above and below simple moving average for the lookback period.
smadf : DataFrame
Simple moving average given the specified lookback.
-
pynance.tech.movave.
ema
(eqdata, **kwargs)[source]¶ Exponential moving average with the given span.
Parameters: eqdata : DataFrame
Must have exactly 1 column on which to calculate EMA
span : int, optional
Span for exponential moving average. Cf. pandas.stats.moments.ewma and additional Pandas documentation.
outputcol : str, optional
Column to use for output. Defaults to ‘EMA’.
selection : str, optional
Column of eqdata on which to calculate ema. If eqdata has only 1 column, selection is ignored, and ema is calculated on that column. Defaults to ‘Adj Close’.
Returns: emadf : DataFrame
Exponential moving average using the given span.
-
pynance.tech.movave.
ema_growth
(eqdata, **kwargs)[source]¶ Growth of exponential moving average.
Parameters: eqdata : DataFrame
span : int, optional
Span for exponential moving average. Defaults to 20.
outputcol : str, optional.
Column to use for output. Defaults to ‘EMA Growth’.
selection : str, optional
Column of eqdata on which to calculate ema growth. If eqdata has only 1 column, selection is ignored, and ema growth is calculated on that column. Defaults to ‘Adj Close’.
Returns: out : DataFrame
Growth of exponential moving average from one day to next
-
pynance.tech.movave.
growth_volatility
(eqdata, **kwargs)[source]¶ Return the volatility of growth.
Note that, like
pynance.tech.simple.growth()
but in contrast tovolatility()
,growth_volatility()
applies directly to a dataframe like that returned bypynance.data.retrieve.get()
, not necessarily to a single-column dataframe.Parameters: eqdata : DataFrame
Data from which to extract growth volatility. An exception will be raised if eqdata does not contain a column ‘Adj Close’ or an optional name specified by the selection parameter.
window : int, optional
Window on which to calculate volatility. Defaults to 20.
selection : str, optional
Column of eqdata on which to calculate volatility of growth. Defaults to ‘Adj Close’
outputcol : str, optional
Column to use for output. Defaults to ‘Growth Risk’.
Returns: out : DataFrame
Dataframe showing the volatility of growth over the specified window.
-
pynance.tech.movave.
ratio_to_ave
(window, eqdata, **kwargs)[source]¶ Return values expressed as ratios to the average over some number of prior sessions.
Parameters: eqdata : DataFrame
Must contain a column with name matching selection, or, if selection is not specified, a column named ‘Volume’
window : int
Interval over which to calculate the average. Normally 252 (1 year)
selection : str, optional
Column to select for calculating ratio. Defaults to ‘Volume’
skipstartrows : int, optional
Rows to skip at beginning in addition to the window rows that must be skipped to get the baseline volume. Defaults to 0.
skipendrows : int, optional
Rows to skip at end. Defaults to 0.
outputcol : str, optional
Name of column in output dataframe. Defaults to ‘Ratio to Ave’
Returns: out : DataFrame
-
pynance.tech.movave.
sma
(eqdata, **kwargs)[source]¶ simple moving average
Parameters: eqdata : DataFrame
window : int, optional
Lookback period for sma. Defaults to 20.
outputcol : str, optional
Column to use for output. Defaults to ‘SMA’.
selection : str, optional
Column of eqdata on which to calculate sma. If eqdata has only 1 column, selection is ignored, and sma is calculated on that column. Defaults to ‘Adj Close’.
-
pynance.tech.movave.
volatility
(eqdata, **kwargs)[source]¶ Volatility (standard deviation) over the given window
Parameters: eqdata : DataFrame
window : int, optional
Lookback period. Defaults to 20.
outputcol : str, optional
Name of column to be used in returned dataframe. Defaults to ‘Risk’.
selection : str, optional
Column of eqdata on which to calculate volatility. If eqdata has only 1 column, selection is ignored, and volatility is calculated on that column. Defaults to ‘Adj Close’.
Returns: risk : DataFrame
Moving volatility with the given lookback.


http://www.edge-security.com/theHarvester.php
http://www.mavetju.org/unix/dnstracer-man.php
http://www.paterva.com/web5/
[Censys](https://www.censys.io/) | Censys continually monitors every reachable server and device on the Internet, so you can search for and analyze them in real time
[Shodan](http://shodan.io/) | Shodan is the world's first search engine for Internet-connected devices.
[WiGLE](https://wigle.net/index) | Maps and database of 802.11 wireless networks, with statistics, submitted by wardrivers, netstumblers, and net huggers.
[Zoomeye](https://www.zoomeye.org/) | search engine for cyberspace that lets the user find specific network components(ip, services, etc.)


US Navy warships sail through South China Sea, defying China, officials say
by Bradford BetzTwo U.S. Navy warships sailed through the South China Sea this week, a move likely to inflame tensions in a region caught between the U.S. and China’s competing influence.
The littoral combat ship Gabrielle Giffords on Wednesday came within 12 nautical miles of islands claimed by China, Cmdr. Reann Mommsen, spokeswoman for the U.S. Navy’s Seventh Fleet, told Reuters.
That was followed on Thursday by the destroyer Wayne E. Meyer, challenging restrictions on passage through the Paracel Islands – which are occupied by China, Mommsen said.
KISSINGER, IN BEIJING, WARNS US-CHINA TRADE WAR COULD SPARK CONFLICT WORSE THAN WWI
At a meeting of defense ministers in Bangkok earlier this week, Chinese Defense Minister Wei Fenghe urged the U.S. to “stop flexing muscles in the South China Sea and to not provoke and escalate tensions in the South China Sea.”
On Wednesday, U.S. Defense Secretary Mark Esper accused China of using coercion and intimidation against smaller Asian nations to impose its will in the South China Sea. He urged Vietnam and others in the region to push back.
CLICK HERE TO GET THE FOX NEWS APP
"We will not accept attempts to assert unlawful maritime claims at the expense of law-abiding nations," Esper said in a speech to the Diplomatic Academy of Vietnam, a government university.
The Associated Press contributed to this report.


{% extends 'companies/base.html' %} {% load bootstrap3 %} {% load static %} {% block content %}
({{ company.avg_rating|floatformat:2 }} out of 5)
Sorry. There are currently no companies listed on this site.


My Work
cortisolmatters.com
Online resource a part of a rebranding campaign.
Pug.js, Sass, JavaScript, Foundation, Node.js
horizant.com
A one stop for both physicians and their patients to learn about Horizant. Dynamically shows different content depending on where the user has been on the site.
Pug.js, Sass, JavaScript, Foundation, Node.js, Parsley.js, In-house made API
belbuca.com/hcp
A website update to Azure
Pug.js, Sass, JavaScript, Foundation, Node.js, Parsley.js, In-house made API
My first company project!
Pug.js, Sass, JavaScript, Foundation, Node.js
Early/Experimental Work
Along with this portfolio site, here are some code you can checkout out on github.
Giphy Search Engine
Find GIFs for your favorite shows
What's for Dinner
Find a dinner recipe and a movie to watch all in one place!
Habibi
What to find a friend? It's all here!
Burger App
Create and eat burgers!


Returns information about a segment.
get-segment
--application-id <value>
--segment-id <value>
[--cli-input-json <value>]
[--generate-cli-skeleton <value>]
--cli-input-json (string) Performs service operation based on the JSON string provided. The JSON string follows the format provided by --generate-cli-skeleton. If other arguments are provided on the command line, the CLI values will override the JSON-provided values.
--generate-cli-skeleton (string) Prints a JSON skeleton to standard output without sending an API request. If provided with no value or the value input, prints a sample input JSON that can be used as an argument for --cli-input-json. If provided with the value output, it validates the command inputs and returns a sample output JSON for that command.
SegmentResponse -> (structure)
ApplicationId -> (string)
The ID of the application to which the segment applies.CreationDate -> (string)
The date the segment was created in ISO 8601 format.Dimensions -> (structure)
The segment dimensions attributes.
Attributes -> (map)
Custom segment attributes.
key -> (string)
value -> (structure)
AttributeType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Behavior -> (structure)
The segment behaviors attributes.
Recency -> (structure)
The recency of use.
Duration -> (string)
The length of time during which users have been active or inactive with your app. Valid values: HR_24, DAY_7, DAY_14, DAY_30RecencyType -> (string)
The recency dimension type: ACTIVE – Users who have used your app within the specified duration are included in the segment. INACTIVE – Users who have not used your app within the specified duration are included in the segment.Demographic -> (structure)
The segment demographics attributes.
AppVersion -> (structure)
The app version criteria for the segment.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
DeviceType -> (structure)
The device type criteria for the segment.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Make -> (structure)
The device make criteria for the segment.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Model -> (structure)
The device model criteria for the segment.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Platform -> (structure)
The device platform criteria for the segment.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Location -> (structure)
The segment location attributes.
Country -> (structure)
The country filter according to ISO 3166-1 Alpha-2 codes.
DimensionType -> (string)
The type of dimension: INCLUSIVE – Endpoints that match the criteria are included in the segment. EXCLUSIVE – Endpoints that match the criteria are excluded from the segment.Values -> (list)
The criteria values for the segment dimension. Endpoints with matching attribute values are included or excluded from the segment, depending on the setting for Type.
(string)
Id -> (string)
The unique segment ID.ImportDefinition -> (structure)
The import job settings.
ExternalId -> (string)
A unique, custom ID assigned to the IAM role that restricts who can assume the role.Format -> (string)
The format of the endpoint files that were imported to create this segment. Valid values: CSV, JSONRoleArn -> (string)
The Amazon Resource Name (ARN) of an IAM role that grants Amazon Pinpoint access to the endpoints in Amazon S3.S3Url -> (string)
A URL that points to the Amazon S3 location from which the endpoints for this segment were imported.Size -> (integer)
The number of endpoints that were successfully imported to create this segment.LastModifiedDate -> (string)
The date the segment was last updated in ISO 8601 format.Name -> (string)
The name of segmentSegmentType -> (string)
The segment type: DIMENSIONAL – A dynamic segment built from selection criteria based on endpoint data reported by your app. You create this type of segment by using the segment builder in the Amazon Pinpoint console or by making a POST request to the segments resource. IMPORT – A static segment built from an imported set of endpoint definitions. You create this type of segment by importing a segment in the Amazon Pinpoint console or by making a POST request to the jobs/import resource.Version -> (integer)
The segment version number.


Changeset 102 for mystic/examples
- Timestamp:
- 02/20/09 14:16:13 (7 years ago)
- Location:
- mystic/examples
- Files:
-
- 8 edited
-
sam_corana2.py (modified) (2 diffs)
-
sam_mogi.py (modified) (3 diffs)
-
sam_rosenbrock.py (modified) (2 diffs)
-
sam_zimmermann.py (modified) (2 diffs)
-
test_mogi.py (modified) (2 diffs)
-
test_rosenbrock.py (modified) (2 diffs)
-
test_rosenbrock2.py (modified) (2 diffs)
-
test_zimmermann.py (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
mystic/examples/sam_corana2.py
r97 r102 12 12 #from test_corana import * 13 13 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 14 from mystic.termination import IterationRelativeTolerance as IRT14 from mystic.termination import CandidateRelativeTolerance as CRT 15 15 from mystic import getch, Sow 16 16 … … 44 44 solver = fmin(2) 45 45 solver.SetRandomInitialPoints([0,0],[2,2]) 46 solver.Solve(Corana2, termination= IRT(), StepMonitor = simplex)46 solver.Solve(Corana2, termination=CRT(), StepMonitor = simplex) 47 47 sol = solver.Solution() 48 48 -
mystic/examples/sam_mogi.py
r97 r102 10 10 from test_mogi import * 11 11 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 12 from mystic.termination import IterationRelativeTolerance as IRT12 from mystic.termination import CandidateRelativeTolerance as CRT 13 13 from mystic import getch, Sow 14 14 … … 66 66 solver = fmin(len(xinit)) 67 67 solver.SetInitialPoints(xinit) 68 solver.Solve(cost_function, termination= IRT(), StepMonitor = simplex)68 solver.Solve(cost_function, termination=CRT(), StepMonitor = simplex) 69 69 sol = solver.Solution() 70 70 print sol … … 84 84 solver = fmin(len(xinit)) 85 85 solver.SetInitialPoints(xinit) 86 solver.Solve(cost_function, termination= IRT(), StepMonitor = simplex)86 solver.Solve(cost_function, termination=CRT(), StepMonitor = simplex) 87 87 sol = solver.Solution() 88 88 print sol -
mystic/examples/sam_rosenbrock.py
r97 r102 13 13 from test_rosenbrock import * 14 14 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 15 from mystic.termination import IterationRelativeTolerance as IRT15 from mystic.termination import CandidateRelativeTolerance as CRT 16 16 from mystic import getch, Sow 17 17 … … 45 45 solver = fmin(len(xinit)) 46 46 solver.SetInitialPoints(xinit) 47 solver.Solve(rosen, termination= IRT(), StepMonitor = simplex)47 solver.Solve(rosen, termination=CRT(), StepMonitor = simplex) 48 48 sol = solver.Solution() 49 49 -
mystic/examples/sam_zimmermann.py
r97 r102 13 13 from test_zimmermann import * 14 14 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 15 from mystic.termination import IterationRelativeTolerance as IRT15 from mystic.termination import CandidateRelativeTolerance as CRT 16 16 from mystic import getch, Sow 17 17 … … 42 42 solver = fmin(2) 43 43 solver.SetRandomInitialPoints([0,0],[7,7]) 44 solver.Solve(CostFunction, termination= IRT(), StepMonitor = simplex)44 solver.Solve(CostFunction, termination=CRT(), StepMonitor = simplex) 45 45 sol = solver.Solution() 46 46 -
mystic/examples/test_mogi.py
r97 r102 111 111 112 112 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 113 from mystic.termination import IterationRelativeTolerance as IRT113 from mystic.termination import CandidateRelativeTolerance as CRT 114 114 from scipy.optimize import leastsq, fmin_cg 115 115 # … … 128 128 solver = fmin(len(point)) 129 129 solver.SetInitialPoints(point) 130 solver.Solve(cost_function, IRT(), EvaluationMonitor = esow, StepMonitor = simplex)130 solver.Solve(cost_function, CRT(), EvaluationMonitor = esow, StepMonitor = simplex) 131 131 sol = solver.Solution() 132 132 -
mystic/examples/test_rosenbrock.py
r97 r102 16 16 from mystic.models import rosen 17 17 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 18 from mystic.termination import IterationRelativeTolerance as IRT18 from mystic.termination import CandidateRelativeTolerance as CRT 19 19 from mystic import Sow 20 20 … … 52 52 solver = fmin(len(xinit)) 53 53 solver.SetInitialPoints(xinit) 54 solver.Solve(rosen, IRT(), EvaluationMonitor = esow, StepMonitor = ssow)54 solver.Solve(rosen, CRT(), EvaluationMonitor = esow, StepMonitor = ssow) 55 55 sol = solver.Solution() 56 56 print sol -
mystic/examples/test_rosenbrock2.py
r97 r102 26 26 from mystic.tools import VerboseSow 27 27 stepmon = VerboseSow(10) 28 from mystic.termination import IterationRelativeTolerance as IRT28 from mystic.termination import CandidateRelativeTolerance as CRT 29 29 30 30 from mystic.scipy_optimize import fmin, NelderMeadSimplexSolver … … 34 34 solver.SetStrictRanges(min,max) 35 35 solver.enable_signal_handler() 36 solver.Solve(rosen,termination= IRT(xtol=1e-5),StepMonitor=stepmon)36 solver.Solve(rosen,termination=CRT(xtol=1e-5),StepMonitor=stepmon) 37 37 print solver.Solution() 38 38 -
mystic/examples/test_zimmermann.py
r97 r102 52 52 from mystic import Sow 53 53 from mystic.scipy_optimize import NelderMeadSimplexSolver as fmin 54 from mystic.termination import IterationRelativeTolerance as IRT54 from mystic.termination import CandidateRelativeTolerance as CRT 55 55 56 56 simplex = Sow() … … 60 60 solver = fmin(len(xinit)) 61 61 solver.SetInitialPoints(xinit) 62 solver.Solve(CostFunction, IRT(), EvaluationMonitor = esow, StepMonitor = simplex)62 solver.Solve(CostFunction, CRT(), EvaluationMonitor = esow, StepMonitor = simplex) 63 63 sol = solver.Solution() 64 64 print "fmin solution: ", sol
Note: See TracChangeset
for help on using the changeset viewer.


About South Ayrshire
South Ayrshire (Scots: Sooth Ayrshire; Scottish Gaelic: Siorrachd Inbhir Àir a Deas, pronounced [ˈʃirˠəxk iɲiˈɾʲaːɾʲ ə tʲes̪]) is one of thirty-two council areas of Scotland, covering the southern part of Ayrshire. It borders onto Dumfries and Galloway, East Ayrshire and North Ayrshire.
Following the 2017 council election, the Labour Party and the Scottish National Party (SNP) announced an agreement to control the council, supported by both independent councillors, despite the fact that the Conservatives emerged as the largest single party on the council with twelve of the twenty-eight elected members, with the SNP's Douglas Campbell serving as Leader of the Council and Labour's Helen Moonie returning as Provost
The administrative boundaries were formed in 1996 as a direct successor to the Kyle and Carrick district council area, with the district of Dalmellington – located along the south-east of Kyle and Carrick – being transferred over to the newly formed East Ayrshire Council area.


| deflate_stream/1 | Compress a bit stream using the zlib/deflate algorithm. |
| get_head_info/1 | When called with a file path string, this returns a tuple of info on the jpeg at the file path location. |
| get_png_content/1 | opens the PNG file indicated by the calling parameter and returns a tuple like [Params, MoreParams, Palette, Image2 , Alpha_channel]. |
| inflate_stream/1 | Decompress a bit stream using the zlib/deflate algorithm. |
| mk_images/4 | mk_images takes a list of images and turns them into PDF XObjects to go into the PDF document. |
| process_header/1 | It can also follow the following pattern:. |
deflate_stream(Data) -> any()
Compress a bit stream using the zlib/deflate algorithm
get_head_info(File::Filepath) -> {jpeg_head, {Width, Height, Number_of_components, Precision}}
When called with a file path string, this returns a tuple of info
on the jpeg at the file path location. The tuple is like the following
get_png_content(File) -> any()
opens the PNG file indicated by the calling parameter and returns a tuple like [Params, MoreParams, Palette, Image2 , Alpha_channel]. This has the Parameters that descibe the image and the content of the image as appropriate for the type of PNG. Palette has the color palatte for indexed color images. Image2 has the image pixels. Alpha_channel has the transparaency overlay to control the display of the Image2 pixels.
inflate_stream(Data) -> any()
Decompress a bit stream using the zlib/deflate algorithm
mk_images(T::Images, I::Count, Is::[], Os::[]) -> {Free, XObjects, O0s}
mk_images takes a list of images and turns them into PDF XObjects to go into the PDF document.
process_header(Any::Jpeg) -> {jpeg_head, {Width, Height, Number_of_components, Precision}}
It can also follow the following pattern:
process_header(image content) ->{png_head,{Width, Height, Color_type, Data_precision}}, {params, Compression, Filter_method, Interface_method}, Palette, Image, Alpha_channel].
Same as get_head_info except it is called with a binary that holds the content of a JPG file. This returns a tuple of info on the jpeg. The tuple is like the followingGenerated by EDoc, Jun 15 2010, 14:11:28.


Publications
2021
-
IROS
A Joint Imitation-Reinforcement Learning Framework for Reduced Baseline Regret.
In Proceedings of the 34th International Conference on Intelligent Robots and Systems (IROS 2021)
2021.
2019
-
Springer
FreeStyle: A Sketch-Based Wireframing Tool.
2019.
-
ITSC
Vision Based Localization for Infrastructure Enabled Autonomy.
In 2019 IEEE Intelligent Transportation Systems Conference (ITSC)
2019.
2021
- IROS
A Joint Imitation-Reinforcement Learning Framework for Reduced Baseline Regret.
In Proceedings of the 34th International Conference on Intelligent Robots and Systems (IROS 2021) 2021.
2019
- Springer
FreeStyle: A Sketch-Based Wireframing Tool.
2019.
- ITSC
Vision Based Localization for Infrastructure Enabled Autonomy.
In 2019 IEEE Intelligent Transportation Systems Conference (ITSC) 2019.


Class RetryStrategy
A retry strategy that determines the number of retry attempts and the interval between retries.
Inheritance
Namespace: Cadru.TransientFaultHandling.RetryStrategies
Assembly: Cadru.TransientFaultHandling.dll
Syntax
public abstract class RetryStrategy : object
Constructors
| Improve this Doc View SourceRetryStrategy(String, Boolean)
Initializes a new instance of the RetryStrategy class.
Declaration
protected RetryStrategy(string name, bool firstFastRetry)
Parameters
| Type | Name | Description |
|---|---|---|
| System.String | name | The name of the retry strategy. |
| System.Boolean | firstFastRetry | true to immediately retry in the first attempt; otherwise, false. The subsequent retries will remain subject to the configured retry interval. |
Fields
| Improve this Doc View SourceDefaultClientRetryCount
Represents the default number of retry attempts.
Declaration
public static readonly int DefaultClientRetryCount
Field Value
| Type | Description |
|---|---|
| System.Int32 |
DefaultFirstFastRetry
Represents the default flag indicating whether the first retry attempt will be made immediately, whereas subsequent retries will remain subject to the retry interval.
Declaration
public static readonly bool DefaultFirstFastRetry
Field Value
| Type | Description |
|---|---|
| System.Boolean |
DefaultRetryInterval
Represents the default interval between retries.
Declaration
public static readonly TimeSpan DefaultRetryInterval
Field Value
| Type | Description |
|---|---|
| TimeSpan |
Properties
| Improve this Doc View SourceFastFirstRetry
Gets or sets a value indicating whether the first retry attempt will be made immediately, whereas subsequent retries will remain subject to the retry interval.
Declaration
public bool FastFirstRetry { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Boolean |
Name
Gets the name of the retry strategy.
Declaration
public string Name { get; }
Property Value
| Type | Description |
|---|---|
| System.String |
Methods
| Improve this Doc View SourceGetShouldRetry()
Returns the corresponding ShouldRetry delegate.
Declaration
public abstract ShouldRetry GetShouldRetry()
Returns
| Type | Description |
|---|---|
| ShouldRetry | The ShouldRetry delegate. |


The Mostly Harmless Book Group:
'The Dog Stars'
by Peter Heller
We meet once a month to read and discuss books that are in the sci-fi/fantasy genre, although we've been told we push the boundaries on our definition of the genre so be warned!
Read More Here...
Monday, Sept. 29th, 6pm
at Longfellow Books
The International Book Group:
'Unwanted'
by Kristina Ohlsson
We meet once a month to read mysteries from
around the world and taste food from the book's
home country.
Read More Here...
Tuesday, October 28th, 6pm
at Longfellow Books
The International Book Group:
'Wild'
by Cheryl Strayed
*Sponsored by Flatbread Pizza*
Box 'o' Chocolates Book Group:
We meet once a month to eat pizza, drink some beer
and chat about our latest book pick. We read a little
bit of everything so come by, share your thoughts,
and tell us what you want to read next
Read More Here...
Wednesday, October 8th, 7pm
at Longfellow Books
Cook Book Book Club
'Vietnamese Home Cooking'
by Charles Phan
On a monthly basis, we meet to discuss books about food. We alternate between paperback memoirs and new hardcover cookbooks.
We politely request that before the meeting, you make at least one recipe from any cookbook being discussed.
Read More Here...
Thursday, September 18th, 6pm
MEETING OFFSITE!


Manage your own and view others' tasks.
This portlet holds all the tasks you are currently working on. Only 3 tasks may be worked upon at once. Trying to start a fourth task will fail. The columns are the same as in the Overview.
The summary tells you the size of all your current tasks.


- IAddReceiverType - Interface in common
-
Common data type for adding receiver.
- IChatRoom - Interface in common
-
A generalized chat room interface that defines a set of operations of a chat room.
- ICmd2ModelAdapter - Interface in common
-
This adapter is for the externally-sourced commands to interact with the local model
- IComponentFactory - Interface in common
-
A factory for creating desired GUI components.
- IExceptionStatusType - Interface in common
-
IExceptionStatusType is a sub interface of IFailureStatusType,
defines a concrete failure status due to exception
- IExtVisitor<R,I,P,H extends IExtVisitorHost<I,? super H>> - Interface in provided.extvisitor
-
Interface that defines an extended visitor that has specific types for its
return value, R, its index value, I, its input parameters, P, and its
host, H.
- IExtVisitorCmd<R,I,P,H extends IExtVisitorHost<I,? super H>> - Interface in provided.extvisitor
-
Interface that defines a command used by AExtVisitor that has specific
types for its return value, R, its index value, I, its input parameters, P,
and its host, H.
- IExtVisitorHost<I,H extends IExtVisitorHost<I,? extends H>> - Interface in provided.extvisitor
-
An interface defining a host for an IExtVisitor who can visit this type of host.
- IFailureStatusType - Interface in common
-
Common data type for failure status.
- IInstallCmdType - Interface in common
-
Common data type for transmitting command between remote peers.
- ImageCmd - Class in lm44_yb22.model.cmd
-
- ImageCmd(ICmd2ModelAdapter) - Constructor for class lm44_yb22.model.cmd.ImageCmd
-
- ImageType - Class in lm44_yb22.model.dataType
-
- ImageType() - Constructor for class lm44_yb22.model.dataType.ImageType
-
- IMainModel2MiniMVCAdpt - Interface in lm44_yb22.model
-
- IMainModelMainAdapter - Interface in lm44_yb22.model
-
- IMainViewAdapter - Interface in lm44_yb22.view
-
- IMiniModel2MiniViewAdpt - Interface in lm44_yb22.model
-
- IMiniModelAdapter - Interface in lm44_yb22.model
-
- IMiniViewAdapter - Interface in lm44_yb22.view
-
- IMixedDataDictionary - Interface in provided.mixedData
-
Abstract mixed data dictionary interface
A mixed data dictionary can hold multiple value types and retrieve those
values in a type-safe manner.
- index - Variable in class lm44_yb22.model.dataType.RequestCmdType
-
- init() - Method in class lm44_yb22.model.Receiver
-
- InstallCmdCmd - Class in lm44_yb22.model.cmd
-
- InstallCmdCmd(DataPacketAlgo<String, String>, Receiver) - Constructor for class lm44_yb22.model.cmd.InstallCmdCmd
-
- InstallCmdType - Class in lm44_yb22.model.dataType
-
- InstallCmdType(DataPacketAlgoCmd<?>) - Constructor for class lm44_yb22.model.dataType.InstallCmdType
-
- IReceiver - Interface in common
-
IReceiver defines a receiver in a chat room, which corresponds to a user (More accurately, a remote user's chat room) in the remote.
- IReceiverAdapter - Interface in lm44_yb22.model
-
- IRejectionStatusType - Interface in common
-
IRejectionStatusType is a sub interface of IFailureStatusType,
defines a concrete failure status due to rejection.
- IRemoveReceiverType - Interface in common
-
Common data type for removing receiver.
- IRequestCmdType - Interface in common
-
Common data type for sending a message that
a specific command is needed for processing a certain type of data packet.
- IRMI_Defs - Interface in provided.rmiUtils
-
Definitions for use in RMI programs
Note that "Client" and "Server" here do NOT refer to a client-server architecture,
rather they are just identifiers to differentiate one side from the other.
- IRMIUtils - Interface in provided.rmiUtils
-
Utility interface used to abstract and encapsulate the configuration,
initialization and shutdown of RMI as well as provide utilities for
accessing remote and local Registries and get the local IP address.
- IUser - Interface in common
-
IUser interface defines a set of operations of a user in our chatApp
IUser is NOT transmitted to anyone.


New Project, Monday
Toggle Navigation
npm On-Site
npm Private Packages
npm Open Source
documentation
support
the
docs
these are the docs your looking for
Guides
How npm Works
Installation and Setup
Using Packages
Publishing Packages
Private Packages and Organizations
npm Enterprise
CLI Reference


diff = {}
(->
A namespace to store the functions on
diff = {}
(->
Creates a clone or copy of an array or object (or simply returns a string/number/boolean which are immutable) Does not provide deep copies.
diff.clone = (value, deep) ->
if Array.isArray(value)
if deep
return value.map (value) -> diff.clone value, deep
else
return value.slice()
else if value and typeof value is 'object'
if value.valueOf() isnt value
return new value.constructor value.valueOf()
else
copy = {}
for key, objValue of value
objValue = diff.clone objValue, deep if deep
copy[key] = objValue
return copy
else
value
Diffs two values, returning a truthy value if there are changes or false
if there are no changes. If the two
values are both arrays or both objects, an array of changes (splices or change records) between the two will be
returned. Otherwise true
will be returned.
diff.values = (value, oldValue) ->
If an array has changed calculate the splices
if Array.isArray(value) and Array.isArray(oldValue)
splices = diff.arrays value, oldValue
return if splices.length then splices else false
If an object has changed calculate the chnages and call the callback
else if value and oldValue and typeof value is 'object' and typeof oldValue is 'object'
Allow dates and Number/String objects to be compared
valueValue = value.valueOf()
oldValueValue = oldValue.valueOf()
Allow dates and Number/String objects to be compared
if typeof valueValue isnt 'object' and typeof oldValueValue isnt 'object'
return valueValue isnt oldValueValue
else
changeRecords = diff.objects value, oldValue
return if changeRecords.length then changeRecords else false
If a value has changed call the callback
else
return diff.basic value, oldValue
Diffs two basic types, returning true if changed or false if not
diff.basic = (value, oldValue) ->
if value and oldValue and typeof value is 'object' and typeof oldValue is 'object'
Allow dates and Number/String objects to be compared
valueValue = value.valueOf()
oldValueValue = oldValue.valueOf()
Allow dates and Number/String objects to be compared
if typeof valueValue isnt 'object' and typeof oldValueValue isnt 'object'
return diff.basic valueValue, oldValueValue
If a value has changed call the callback
if typeof value is 'number' and typeof oldValue is 'number' and isNaN(value) and isNaN(oldValue)
return false
else
return value isnt oldValue
Diffs two objects returning an array of change records. The change record looks like:
{
object: object,
type: 'deleted|updated|new',
name: 'propertyName',
oldValue: oldValue
}
diff.objects = (object, oldObject) ->
changeRecords = []
Goes through the old object (should be a clone) and look for things that are now gone or changed
for prop, oldValue of oldObject
value = object[prop]
Allow for the case of obj.prop = undefined (which is a new property, even if it is undefined)
continue if value isnt undefined and not diff.basic value, oldValue
If the property is gone it was removed
unless `(prop in object)`
changeRecords.push newChange object, 'deleted', prop, oldValue
continue
if diff.basic value, oldValue
changeRecords.push newChange object, 'updated', prop, oldValue
Goes through the old object and looks for things that are new
for prop, value of object
continue if `prop in oldObject`
changeRecords.push newChange object, 'new', prop
if Array.isArray(object) and object.length isnt oldObject.length
changeRecords.push newChange object, 'updated', 'length', oldObject.length
changeRecords
Creates a change record for the object changes
newChange = (object, type, name, oldValue) ->
object: object
type: type
name: name
oldValue: oldValue
EDIT_LEAVE = 0
EDIT_UPDATE = 1
EDIT_ADD = 2
EDIT_DELETE = 3
Diffs two arrays returning an array of splices. A splice object looks like:
{
index: 3,
removed: [item, item],
addedCount: 0
}
diff.arrays = (value, oldValue) ->
currentStart = 0
currentEnd = value.length
oldStart = 0
oldEnd = oldValue.length
minLength = Math.min(currentEnd, oldEnd)
prefixCount = sharedPrefix(value, oldValue, minLength)
suffixCount = sharedSuffix(value, oldValue, minLength - prefixCount)
currentStart += prefixCount
oldStart += prefixCount
currentEnd -= suffixCount
oldEnd -= suffixCount
if currentEnd - currentStart is 0 and oldEnd - oldStart is 0
return []
if nothing was added, only removed from one spot
if currentStart is currentEnd
return [ newSplice(currentStart, oldValue.slice(oldStart, oldEnd), 0) ]
if nothing was removed, only added to one spot
if oldStart is oldEnd
return [ newSplice(currentStart, [], currentEnd - currentStart) ]
a mixture of adds and removes
distances = calcEditDistances(value, currentStart, currentEnd, oldValue, oldStart, oldEnd)
ops = spliceOperationsFromEditDistances distances
splice = undefined
splices = []
index = currentStart
oldIndex = oldStart
for op in ops
if op is EDIT_LEAVE
if splice
splices.push splice
splice = undefined
index++
oldIndex++
else if op is EDIT_UPDATE
splice = newSplice(index, [], 0) unless splice
splice.addedCount++
index++
splice.removed.push oldValue[oldIndex]
oldIndex++
else if op is EDIT_ADD
splice = newSplice(index, [], 0) unless splice
splice.addedCount++
index++
else if op is EDIT_DELETE
splice = newSplice(index, [], 0) unless splice
splice.removed.push oldValue[oldIndex]
oldIndex++
splices.push(splice) if splice
splices
find the number of items at the beginning that are the same
sharedPrefix = (current, old, searchLength) ->
for i in [0...searchLength]
return i if diff.basic current[i], old[i]
return searchLength
find the number of items at the end that are the same
sharedSuffix = (current, old, searchLength) ->
index1 = current.length
index2 = old.length
count = 0
while count < searchLength and not diff.basic current[--index1], old[--index2]
count++
count
newSplice = (index, removed, addedCount) ->
index: index
removed: removed
addedCount: addedCount
spliceOperationsFromEditDistances = (distances) ->
i = distances.length - 1
j = distances[0].length - 1
current = distances[i][j]
edits = []
while i > 0 or j > 0
if i is 0
edits.push EDIT_ADD
j--
continue
if j is 0
edits.push EDIT_DELETE
i--
continue
northWest = distances[i - 1][j - 1]
west = distances[i - 1][j]
north = distances[i][j - 1]
if west < north
min = if west < northWest then west else northWest
else
min = if north < northWest then north else northWest
if min is northWest
if northWest is current
edits.push EDIT_LEAVE
else
edits.push EDIT_UPDATE
current = northWest
i--
j--
else if min is west
edits.push EDIT_DELETE
i--
current = west
else
edits.push EDIT_ADD
j--
current = north
edits.reverse()
edits
calcEditDistances = (current, currentStart, currentEnd, old, oldStart, oldEnd) ->
“Deletion” columns
rowCount = oldEnd - oldStart + 1
columnCount = currentEnd - currentStart + 1
distances = new Array(rowCount)
“Addition” rows. Initialize null column.
for i in [0...rowCount]
distances[i] = new Array(columnCount)
distances[i][0] = i
Initialize null row
for j in [0...columnCount]
distances[0][j] = j
for i in [1...rowCount]
for j in [1...columnCount]
unless diff.basic current[currentStart + j - 1], old[oldStart + i - 1]
distances[i][j] = distances[i - 1][j - 1]
else
north = distances[i - 1][j] + 1
west = distances[i][j - 1] + 1
distances[i][j] = if north < west then north else west
distances
).call(this)
chip.diff = diff


GUI.GetY (widgetID : int) : int
This function is used in conjunction with GUI.GetWidth and GUI.GetHeight to determine the bounds of a widget. The entire widget should always fit in the box (GUI.GetX, GUI.GetY) - (GUI.GetX + GUI.GetWidth - 1, GUI.GetY + GUI.GetHeight - 1)
The position and size of a widget is known only after it has been drawn to the screen. Attempting to get the location or dimesions of the widget may cause an uninitialized variable error.
import GUI in "%oot/lib/GUI"
procedure BoxWidget (widgetID : int)
var x, y, width, height : int
x := GUI.GetX (widgetID)
y := GUI.GetY (widgetID)
width := GUI.GetWidth (widgetID)
height := GUI.GetHeight (widgetID)
Draw.Box (x 1, x 1, x + width, y + height, red)
Draw.Box (x 2, x 2, x + width + 1, y + height + 1, red)
end BoxWidget
var title : int := GUI.CreateLabel (20, 20, "Frame This!")
BoxWidget (title)
This means that you can only call the function by calling GUI.GetX, not by calling GetX.


--- layout: post title: CFMX/Java integration tags: [] status: publish type: post published: true meta: {} ---
There is nothing quite like learning by example and Pete Freitag has kindly pointed to a few of his examples on accessing Java methods from within ColdFusion MX.
For more info on all the Java methods available to cfmx look no further than the Java Api documentation.


A fun little side project that I got carried away with. Hint: look in the console for now. World.tick() will advance the world. Inspect the world to see what has happened.
The map. Calculated using relative values, representing the density of monsters, heroes, and towns as R, G, and B repsectively. So then, in a world with a tile of 2 and 1 monsters, the 1st tile would be fully bright, while the second would only be as half as bright.


Specifying AMRClaw run-time parameters in setrun.py¶
It may be useful to look at a specific example, e.g. Sample setrun.py module for AMRClaw.
Note: Many parameters have changed name since Version 4.X and some new ones have been added. See Changes to input parameters in setrun.py from 4.x to 5.0 for a summary.
To convert a Version 4.x setrun.py file to Version 5.0, see Converting from Clawpack 4.6 to 5.0.
Input¶
setrun takes a single argument claw_pkg that should be set to amrclaw.
Output¶
rundata, an object of class ClawRunData, created in the setrun file with the commands:
from clawpack.clawutil import clawdata
rundata = clawdata.ClawRunData(claw_pkg, num_dim)
The rundata object has an attribute rundata.clawdata whose attributes are described in Specifying classic run-time parameters in setrun.py.
In addition, for AMRClaw rundata has an attribute rundata.amrdata whose attributes are described below.
Run-time parameters¶
The parameters needed in 2 space dimensions (ndim=2) are described. In 3d there are analogous parameters in z required, as mentioned below.
In addition to the parameters in rundata.clawdata (see Specifying classic run-time parameters in setrun.py), the AMR parameters that can be set are the following attributes of rundata.amrdata:
Special AMR parameters¶
- amr_levels_max : int
Maximum levels of refinement to use.
- refinement_ratios_x : list of int
Refinement ratios to use in the x direction.
Example: If num_cells[0] = 10 and refinement_ratios_x = [2,4] then the Level 1 grid will have 10 cells in the x-direction, Level 2 patches will be refined by a factor of 2, and Level 3 will be refined by 4 relative to Level 2 (by 8 relative to Level 1).
- refinement_ratios_y : list of int
Refinement ratios to use in the y direction.
- refinement_ratios_t : list of int
Refinement ratios to use in time. For an explicit method, maintaining the Courant number usually requires refining in time by the same factor as in space (or the maximum of the refinement ratio in the different space directions).
Note: Rather than specifying this list, in GeoClaw it is possible to set to set variable_dt_refinement_ratios = True so refinement ratios in time are chosen automatically. This might be ported to AMRClaw?
- aux_type : list of str, of length num_aux
Specifies the type of variable stored in each aux variable. These are used when coarsening aux arrays. Each element can be one of the following (but at most one can be ‘capacity’):
- ‘center’ for cell-centered values (e.g. density)
- ‘capacity’ for a cell-centered capacity function (e.g. cell volume)
- ‘xleft’ for a value centered on the left edge in x (e.g. normal velocity u)
- ‘yleft’ for a value centered on the left edge in y (e.g. normal velocity v)
- flag_richardson : boolean
Determines whether Richardson extrapolation will be used as an error estimator. If True, patches will be coarsened by a factor of 2 each time regridding is done and the result from a single step on the coarsened patch with double the time step will be compared to the solution after 2 steps on the original patch in order to estimate the error.
- flag_richardson_tol : float
When flag_richardson == True, cells will be flagged for refinement if the absolute value of the estimated error exceeds this value.
When flag_richardson == False, this value is not used.
- flag2refine : boolean
Determines whether the subroutine flag2refine is used to flag cells for refinement.
- flag2refine_tol : float
When flag2refine == True, the default library version flag2refine.f checks the maximum absolute value of the difference between any component of q in this cell with the corresponding component in any of the neighboring cells. The cell is flagged for refinement if the maximum value is greater than this tolerance.
- regrid_interval : int
The number of time steps to take on each level between regridding to the next finer level.
- regrid_buffer_width : int
The number of points to flag for refining around any point flagged by error estimation or flag2refine. This buffer zone is to insure that waves do not leave the refined region before the next regridding and so is generally chosen based on the value of regrid_interval, typically to be the same value since waves can travel at most one grid cell per time step.
- clustering_cutoff : float between 0 and 1
Cut-off used in clustering flagged points into rectangular patches for refinement. Clusters are chosen to minimize the number of patches subject to the constraint:
(# flagged pts) / (total # of cells refined) < clustering_cutoff
If clustering_cutoff is close to 1, only flagged cells will be refined, which could lead to many 1 x 1 patches.
The default value 0.7 usually works well.
- verbosity_regrid : int
Additional information is printed to the terminal each time regridding is done at this level or coarser. Set to 0 to suppress regridding output.
- regions : list
List of lists of the form [minlevel,maxlevel,t1,t2,x1,x2,y1,y2]. See Specifying AMR regions
Debugging flags for additional printing¶
Setting one or more of these to True will cause additional information to be written to the file fort.amr in the output directory.
- dprint : boolean
Print domain flags
- eprint : boolean
Print error estimation flags
- edebug : boolean
Print even more error estimation flags
- gprint : boolean
Print grid bisection and clustering information
- nprint : boolean
Print proper nesting output
- pprint : boolean
Print projection of tagged points
- rprint : boolean
Print regridding summary
- sprint : boolean
Print space/memory output
- tprint : boolean
Print time step info on each level
- uprint : boolean
Print update/upbnd information


Blokkus
2 Players
3 Players
4 Players
Built by
Andy Le
and
Amos Yu
. Inspired by
Blokus
from Mattel Games.
Rules of the game
Code


Consent form for participation in this online experiment
Center for Adaptive Behavior and Cogntion (ABC)
THIS STUDY HAS BEEN APPROVED BY THE MPI ETHICS BOARD
Designed by: Charley Wu
Email: cwu[at]mpib-berlin[dot]mpg[dot]de
Description of Task
This study is part of a research project conducted by Charley Wu at the Max Planck Institute for Human Development, investigating how people search in an unknown environment. For this purpose you will be asked to perform a simple computer task in which you learn about hidden rewards.
Please read the instruction carefully and try to perform as well as you can. A bonus of up to $1.50 will be granted based on your performance, along with a basic fee of $0.50 for completing the study. There will be no payment if the study is not completed. The study will on average last about 10 minutes.
Data Privacy
The Max Planck Institute for Human Development is an institution that promotes scientific research. Our work adheres strictly to regulations governing protection of privacy. The information requested in the study will be kept confidential and archived and scientifically processed in accordance with the Data Privacy Act. Personal data will not be passed on to any third parties. The data will be used solely for research purposes and solely within the Max Planck Institute for Human Development or in cooperation with the Max Planck Institute. Experimental data will be handled with utmost discretion. Participation in the study is voluntary and you are able to end your participation at any time. You can revoke your consent to use your data at any time from that date forward.
By clicking on the button below, you agree to the following:
I have read and accept the terms and conditions listed above and consent to participate in this study.
I understand that I am free to withdraw from the study without penalty if I so wish and I consent to the processing of my experimental data for the purposes of this study only and that it will not be used for any other purpose.
I understand that such information will be treated as strictly confidential and handled in accordance with the provisions of the German Data Privacy Act.
I understand that the information I have submitted will be published as a report. Confidentiality and anonymity will be maintained and it will not be possible to identify me from any publications.
I understand that I am being paid for my assistance in this research.
Instructions:
Please read the following instructions very carefully:
In the following study, you will be presented with a series of 16 different environments to explore, depicted as a row of boxes. By clicking on any of the boxes, you will earn points associated with each unique box. For each row of boxes, you will have either 5 or 10 clicks, with the number of remaining clicks displayed on the page. When you run out of clicks, you will start a new trial on the next unexplored environment.
Each environment starts with a single box revealed. Use your mouse to click and reveal new box, which will display a number corresponding to the number of points you gain. Revealed tiles are also color coded, as a visual aid to help you in this task. Darker colors correspond to larger rewards. Previously revealed boxes can also be reselected, although there may be small changes in the point value.
It is your task to gain as many points as possible across all 16 environments. You will be assigned a bonus of up to $1.50 based on your total score in each environment.
Important! Points are clustered along the row of boxes, such that boxes with high-value points tend to appear close to each other and boxes with low-value points tend to appear close to each other. All payoffs are greater than zero, with the maximum payoff differing between environments.
Below, we show some examples of what the distribution of points are like, with the darker boxes indicating higher point values.
Instructions:
Please read the following instructions very carefully:
In the following study, you will be presented with a series of 16 different environments to explore, depicted as a row of boxes. By clicking on any of the boxes, you will earn points associated with each unique box. For each row of boxes, you will have either 5 or 10 clicks, with the number of remaining clicks displayed on the page. When you run out of clicks, you will start a new trial on the next unexplored environment.
Each environment starts with a single box revealed. Use your mouse to click and reveal new box, which will display a number corresponding to the number of points you gain. Revealed tiles are also color coded, as a visual aid to help you in this task. Darker colors correspond to larger rewards. Previously revealed boxes can also be reselected, although there may be small changes in the point value.
It is your task to learn where the largest reward is in each of the 16 environments. You will be assigned a bonus of up to $1.50 based on the largest value you reveal in each environment.
Important! Neighboring boxes tend to have similar point values, such that boxes with high-value points tend to appear close to each other and boxes with low-value points tend to appear close to each other. All payoffs are greater than zero, with the maximum payoff differing between environments.
Below, we show some examples of what the distribution of points are like, with the darker boxes indicating higher point values.
Only when you answered all the question correctly will you be able to start the study.
Very good. You have answered all questions correctly and can now start the study.
Goal: Gain as many points as possible.
Goal: Learn where the largest reward is.
Summarized Instructions:
I. Below you see a row of 30 boxes. When you click on a box, the points of that box are revealed and its value will be displayed. Revealed boxes are colored, corresponding to the point value.
II. Boxes can be repeatedly clicked, although there may be small variations in the points earned. The most recently uncovered point value is displayed, while the history of revealed points can be viewed by hovering your mouse over the box.
III. The points of a box depends upon where it is located, with neighboring boxex tending to have similar point values.
IV. On top of the row of boxes, you can see how many clicks you have left, the number of environments left to explore, and the amount of bonus you have currently earned.
V. There are 16 different environments with either 5 or 10 clicks in each (alternating).
Reward Earned on Current Trial: $0.00
Number of environments left: 16
Number of clicks left: 10

You have finished exploring this environment. You have 15 more environments to explore.
You have run out of clicks for this environment. Please click the tile where you believe the largest reward is located.
Thank you for completing our study.
Please check that your MTurk ID is correct. If not entered correctly, you may not be able to receive your bonus.
How old are you?
years
What's your gender?
Female
Male
Thank you for participating in our experiment.
You have achieved a bonus of $0.00
To earn your base fee of $0.50, please copy and paste the following completion code into the Amazon MTurk window for this HIT: s6wZ7ziQ9


about total management?
Total Management is a free, tabless, W3C-complain-compliant web design layout by Template World. This template has been tested and proven compatible with all major browser environments and operating systems. You are free to modify the design
to suit your tastes in any way you like.
We only ask you to not remove "Design by Template World" and the link http://www.templateworld.com from the footer of the template
If you are interested in seeing more of our free web template designs feel free to visit our website, Template World. We intend to add a least 25 new free templates in the coming month.


Colchester broadband company slams Labour's 'free full-fibre' plans
by Sarah ChambersLabour's ambitious plan to roll out free, universal full-fibre broadband across the country has come under fire from an alternative network provider.
Lloyd Felton, chief executive of County Broadband, based at Colchester, fears the proposal could delay or even derail existing full-fibre investment, and called for a mix of public and private investment as "the only realistic strategy".
"The announcement highlights the importance of full fibre access for all," he said.
MORE - Firm 'stronger' after adopting four-day week, says boss
But he added: "It also shows an alarming lack of understanding about the complex nature of full fibre rollouts and the fact that, unlike by comparison the rail industry that operates rail franchises, the industry has already invested billions of pounds in building its own infrastructure over which the service is delivered, in direct competition to BT."
County Broadband - which is backed by £46m in private investment from Aviva Investors - is building new fibre-to-the-premises (FTTP) hyperfast networks across rural Essex and Norfolk.
"This proposal would almost certainly lead to delays or at worst derailment of existing full fibre investment and new network roll-outs," he said.
"It is broad-brush, and makes no mention of how customers would be served and supported, and provides no recognition for what has been achieved by the many Alternative Network providers (AltNets) who are currently active in providing a competitive full fibre solution.
"The competitive nature of the current market in the UK has meant consumers already benefit from one of the lowest cost broadband services in Europe.
"Broadband is an essential utility and whilst we share the ambition to bring future-ready full fibre connectivity to every home and business, we believe a mix of public and private investment is the only realistic strategy to deliver the service efficiently, without the need to bring significant cost to the public purse."
The firm is aiming to provide connection access to around 40,000 premises by the end of 2020.


Try out bromb and the endpoint by clicking on this link. Might not work when deployed with deno, but the config and submission endpoints work
Note: The trigger link is set to/exampleOrganization/exampleProject
. If you modified the
widgetConfig.json
file and thereby removed the config for the
example organization and project, the widget won't work.