Building Spark with Maven
- Spark Tests in Maven
- Setting up JVM Memory Usage Via Maven
- Using With IntelliJ IDEA
- Building Spark Debian Packages
Building Spark using Maven Requires Maven 3 (the build process is tested with Maven 3.0.4) and Java 1.6 or newer.
Building with Maven requires that a Hadoop profile be specified explicitly at the command line, there is no default. There are two profiles to choose from, one for building for Hadoop 1 or Hadoop 2.
for Hadoop 1 (using <IP_ADDRESS>) use:
$ mvn -Phadoop1 clean install
for Hadoop 2 (using 2.0.0-mr1-cdh4.1.1) use:
$ mvn -Phadoop2 clean install
It uses the scala-maven-plugin which supports incremental and continuous compilation. E.g.
$ mvn -Phadoop2 scala:cc
…should run continuous compilation (i.e. wait for changes). However, this has not been tested extensively.
Spark Tests in Maven
Tests are run by default via the scalatest-maven-plugin. With this you can do things like:
Skip test execution (but not compilation):
$ mvn -DskipTests -Phadoop2 clean install
To run a specific test suite:
$ mvn -Phadoop2 -Dsuites=spark.repl.ReplSuite test
Setting up JVM Memory Usage Via Maven
You might run into the following errors if you’re using a vanilla installation of Maven:
[INFO] Compiling 203 Scala sources and 9 Java sources to /Users/me/Development/spark/core/target/scala-2.9.3/classes...
[ERROR] PermGen space -> [Help 1]
[INFO] Compiling 203 Scala sources and 9 Java sources to /Users/me/Development/spark/core/target/scala-2.9.3/classes...
[ERROR] Java heap space -> [Help 1]
To fix these, you can do the following:
export MAVEN_OPTS="-Xmx1024m -XX:MaxPermSize=128M"
Using With IntelliJ IDEA
This setup works fine in IntelliJ IDEA 11.1.4. After opening the project via the pom.xml file in the project root folder, you only need to activate either the hadoop1 or hadoop2 profile in the “Maven Properties” popout. We have not tried Eclipse/Scala IDE with this.
Building Spark Debian Packages
It includes support for building a Debian package containing a ‘fat-jar’ which includes the repl, the examples and bagel. This can be created by specifying the deb profile:
$ mvn -Phadoop2,deb clean install
The debian package can then be found under repl/target. We added the short commit hash to the file name so that we can distinguish individual packages build for SNAPSHOT versions.


Hi. Have any of you tried to display emonTH data on EmonLCD display for outdoor min/max temperature display.
I am trying to use the "if (node_id == 19)" '19 being the Emonth.
Will I need to create a typedef struct for the emonTH?
for the emontx there is a
"typedef struct { int power1, power2, power3, Vrms; } PayloadTX; // neat way of packaging data for RF comms
PayloadTX emontx";"
when looking at the next part of the loop, it seems that i can get the data directly as
"rf12_data[1], rf12_data[2], rf12_data[3]" is used to set the RTC.
I get a bit lost here, as i cant find any examples that is doing this, and is too unexperienced in how to send, format and receive data via the RFM12b.
Any suggestions on how to get this done ?
Future development of the system is to add another emonth to show if the garage door is open or closed, also on the EmonLCD.
My plan is to display the outdoor temperature, as well as water temperature in a outdoor spa on the EmonLCD, plus modifying the Solar PV sketch to display power usage for my heatpump, outdoor spa, and waterheater.
Re: Displaying EmonTH data on emonLCD for outdoor temp monitoring.
You're on the right lines. You need to create a struct - identical to the one inside the emonTH code - to receive the transmitted data in the GLCD sketch.
Then lower down in the GLCD sketch, you'll need to copy the section of code for the emonTx and change it to suit the TH node number and data structure. Give it a different name to the emonTx one, of course.
Inside loop( ), you'll access the data as emonth.temp, emonth.humidity, etc.
If you are confused by the way the received data is mapped onto the structure, see here: RFM12B - Part 2 - Sending Data Between Modules. You'll need to scale the values to display correctly.


We buy systems!
- aggregate granular e-business
- mesh visionary content
- enable best-of-breed solutions
- drive integrated methodologies
- maximize real-time content
- strategize global solutions
- target interactive vortals
- drive compelling platforms
- syndicate best-of-breed eyeballs


class: center, middle # Lambda Expressions and the Stream API in Java 8 ## A Quick Overview Matt Wittmann --- # Introduction * Some functional-programming concepts have been introduced in Java 8 * The lambda-expression syntax was introduced to support the new Stream API * The Stream API offers an alternative approach to programming: as a series of transformations on data --- # Functional Programming * Theoretical backing is the lambda calculus, an alternative theory of computation by Alonzo Church * Often contrasted with imperative programming along with declarative programming more generally * Java 8 borrows functional concepts but cannot be said to be a functional language --- # Some Key Concepts in Functional Programming * **Immutability:** Declared variables do not change. * **Referential transparency:** An expression can be replaced by the value it results in. * **First-class functions:** Functions are values like numbers, strings, and objects and can be passed as arguments to other functions or returned from other functions. * **Higher-order functions:** These functions take a function as an argument.  * **No side-effects:** Function application does not mutate some implicit global state or environment. --- # Lambda Expression Syntax * Java 8 provides some syntactic sugar to represent anonymous functions. * Under the hood, these are anonymous classes implementing a *functional interface*. * New type-inferencing bridges the syntactical gap. * Methods with the appropriate shape can be referenced as functions, too. * The arrow operator (`->`) is used to separate the parameter list from the function body in a lambda expression. * For zero arguments, an empty parameter list (`()`) is provided. * If a lambda expression's function body needs multiple statements, curly braces and semicolons should be used, and the `return` expression must be made explicit. --- # Example ``` int[] numbers = { 1, 2, 3 }; // This: java.util.Arrays.stream(numbers) .map(number -> ++number) .forEach(System.out::println); // Is equivalent to: for (int number : numbers) { ++number; System.out.println(number); } ``` --- # Desugaring the Syntax ``` stream.map(number -> ++number); // Can also be written as: stream.map(number -> { return ++number; }); // Or as: stream.map(new IntUnaryOperator() { @Override public int applyAsInt(int number) { return ++number; } }); // It's all just anonymous classes! ``` --- # More on Functional Interfaces * Any interface with one and only one abstract method is automatically a functional interface * This can be enforced at compile time with the<EMAIL_ADDRESS>annotation * Many interfaces you know and love from the Java API have been given this annotation like: * `java.util.concurrent.Callable` * `java.lang.Runnable` * Java 8 has added numerous new functional interfaces to support a more functional style of programming and the Stream API, including specialized versions meant to work with unboxed primitive types * `java.util.function.Function` * `java.util.function.BiFunction` * `java.util.function.IntFunction` * `java.util.function.IntUnaryOperator` --- # The Stream API * The killer app for lambda expressions * An abstraction representing a series of values that can be processed * Backed by a collection, array, generator, etc. * "Laziness seeking," as [the JavaDocs](https://docs.oracle.com/javase/8/docs/api/java/util/stream/package-summary.html#package.description) put it, meaning there is a preference to evaluate only what's needed at the time; this is critical for *infinite streams* * Transformations on underlying values are made using methods implementing common higher-order functions * Specialized stream types exists to stream the primitive types --- # Some Higher-Order Functions in the Stream API * **map:** Transforms each value into another value using a given function. * **filter:** Returns a substream of elements that match the given predicate. * **flatMap:** Performs a transformation on the value that yields a stream; all the separate streams are in turn flattened into only one stream. * **reduce:** Optionally takes some identity (baseline) value as a starting point and applies a function to repeatedly reduce the stream down to one single value; the function takes two arguments: the current value and some accumulated result. The function passed to `reduce` must have the mathematical property of *associativity*. * **max**, **min:** Finds the maximum and minimum value respectively using the given comparator. * **forEach:** Does something for each element of the stream. This can be a smell that the code is not closely aligned with the functional paradigm as it is inherently relying on a side-effect. * **collect:** Performs a kind of reduction. This can be used to, for example, transform a stream into a new list or other collection type. Several collectors are predefined.


Chapter 7 Univariate transformations
7.1 Transformed random variables
In this chapter, starting with a random variable \(Y\), we define a new random variable \(U = U(Y)\). We want to be able to determine the distribution of the transformed random variable \(U\).
We have already studied one method for finding the distribution of a transformed random variable, when that transformation is linear (\(U = a + bY\) for suitable constants \(a\) and \(b\)). In that case, if we have the moment generating function of \(Y\), we can use Theorem 3.2 to find the moment generating function of \(U\).
However, we are often interested in non-linear transformations. For example, we have seen (in Proposition 6.6) an example where we squared a \(N(0, 1)\) random variables to obtain a new random variable with \(\chi^2_1\) distribution, i.e. we had a transformation of the form \(U = Y^2\).
We begin with two simple examples.
Example 7.1 Suppose \(Y\) has pdf \[f(y) = 2y, \quad \text{for $0 < y < 1$}.\] Let \(U = Y^2\). What is the distribution of \(U\)?
Let \(G(.)\) and \(g(.)\) be the cdf and pdf of \(U\). We have \[G(u) = P(U \leq u) = P(Y^2 \leq u) = P(Y \leq \sqrt{u}) = F(\sqrt{u}).\] So \[\begin{align*} g(u) &= \frac{dG(u)}{du} = \frac{dF(\sqrt{u})}{du} = f(\sqrt{u}) \frac{1}{2 \sqrt{u}} \\ &= 2 \sqrt{u} \frac{1}{2 \sqrt{u}} = 1 \quad \text{for $0 < u < 1$,} \end{align*}\] which is the pdf of a \(U(0, 1)\) distribution. So \(U \sim U(0, 1)\).Example 7.2 Suppose \(Y \sim U(0, 1)\). Let \(U = -\log{Y}\). What is the distribution of \(U\)?
Let \(G(.)\) and \(g(.)\) be the cdf and pdf of \(U\). We have \[\begin{align*} G(u) &= P(U \leq u) = P(-\log Y \leq u) \\ &= P(\log Y \geq -u) = P(Y \geq e^{-u}) \\ &= 1 - P(Y < e^{-u}) = 1 - F(e^{-u}) \\ &= 1 - e^{-u}, \quad \text{for $0 < u < \infty$.} \end{align*}\] So \[g(u) = \frac{dG(u)}{du} = e^{-u}, \quad \text{for $u > 0$},\] which we recognise as the pdf of an exponential distribution with rate parameter \(1\), so \(U \sim \text{exponential}(1)\).7.2 One-to-one transformations of continuous random variables
Proof (Theorem 7.1). Let \(F(.)\) and \(f(.)\) be the cdf and pdf of \(Y\), and let \(G(.)\) and \(g(.)\) be the cdf and pdf of \(U\). Suppose \(U = h(Y)\) is a one-to-one function with inverse \(Y = w(U)\). Since \(h(.)\) is one-to-one, we may conclude that is is either an increasing or a decreasing function, and we split the proof into two cases.
Case 1: \(h(.)\) is an increasing function. Then \[G(u) = P(U \leq u) = P(h(Y) \leq u) = P(Y \leq w(u)),\] since \(h(.)\) is increasing. So \(G(u) = F(w(u))\), and \[g(u) = f\left(w(u)\right) \frac{dw(u)}{du} = f\left(w(u)\right) \frac{dy}{du} = f\left(w(u)\right) \left|\frac{dy}{du}\right|,\] since \(\frac{dy}{du} > 0\).
Case 2: \(h(.)\) is a decreasing function. Then \[G(u) = P(U \leq u) = P(h(Y) \leq u) = P(Y \geq w(u)),\] since \(h(.)\) is decreasing. So \(G(u) = 1 - F(w(u))\), and \[g(u) = - f\left(w(u)\right) \frac{dw(u)}{du} = f\left(w(u)\right) \left(- \frac{dy}{du}\right) = f\left(w(u)\right) \left|\frac{dy}{du}\right|,\] since \(\frac{dy}{du} < 0\).Example 7.3 (Kinetic energy of gas molecules) Gas molecules move about with varying velocity which has, according to the Maxwell-Boltzmann law, a pdf given by \[f(v) = c v^2 e^{-\beta v^2}, \quad v > 0,\] where \(c\) is a constant to ensure the pdf integrates to \(1\). The kinetic energy is given by \(U = \frac{1}{2} m V^2\), where \(m\) is the mass of the molecule. What is the pdf of \(U\), the kinetic energy of the molecule?
The domain of \(U\) is \(0 < u < \infty\). For \(v > 0\), \(h(v) = \frac{1}{2} m v^2\) is a one-to-one function, as it is increasing with \(v\). So we may apply Theorem 7.1 to find the pdf \(g(.)\) of \(U\).
We have \(u = \frac{1}{2} m v^2\), so the inverse transformation is \(v = \sqrt{\frac{2u}{m}}\), and \[\frac{dv}{du} = \frac{\sqrt{2}}{2 \sqrt{um}} = \frac{1}{\sqrt{2 u m}} > 0 \quad \text{for $u > 0$}.\] So \(U\) has pdf \[\begin{align*} g(u) &= f \left(\sqrt{\frac{2u}{m}} \right) \frac{1}{\sqrt{2um}} \\ &= c \cdot \frac{2u}{m} e^{-\beta\frac{2u}{m}} \frac{1}{\sqrt{2um}} \\ &= c \sqrt{2u} m^{-\frac{3}{2}}e^{-\beta\frac{2u}{m}} \quad \text{for $u > 0$.} \end{align*}\] We see that \[g(u) \propto u^{\frac{1}{2}} e^{-\beta\frac{2u}{m}} = u^{\frac{3}{2} - 1} e^{-\theta u}\] with \(\theta = 2\beta / m\). So, by comparison with Equation (6.1), \(U \sim \text{gamma}(3/2, 2 \beta/m)\).7.3 Generating samples from any distribution
An immediate corollary of Proposition 7.1 allows us to use a sample from a \(U(0, 1)\) distribution to generate a sample from any other continuous distribution:
In fact, we can use the same method to find samples from a discrete distribution. To do this, we first need to define what we mean by \(F^{-1}(.)\), as the cdf \(F(.)\) is constant between points in the domain, and so is not an invertible function.
For instance, if \(Y \sim \text{binomial}(2, 0.5)\), then we can plot the cdf of \(Y\):
curve(pbinom(x, 2, 0.5), from = -1, to = 3,
xlab = "y", ylab = "cdf F(y)", n = 1001)
In this example, if we ask for \(F^{-1}(0.25)\), then it is not immediately clear what this means, as \(F(y) = 0.25\) for all \(0 \leq y < 1\).
We define \(F^{-1}(.)\) by the quantile function \[\begin{equation} F^{-1}(u) = \inf\{y \in \mathbb{R}: F(y) \geq u\}, \tag{7.1} \end{equation}\]for \(u \in (0, 1)\). In our example, we now have \(F^{-1}(0.25) = 0\). If \(F(.)\) is an invertible function, then this definition agrees with the usual inverse we saw before.
Equipped with this definition of \(F^{-1}(.)\), we may now rewrite Corollary 7.1 to apply to any distribution:


{% blocktrans %}{{ coverage_boundary }} has a total building coverage of{% endblocktrans %}
{% include "coverage_formatted.html" with coverage=coverage_boundary.coverage hide_info=True %}
{% blocktrans with total_coverage_gain=coverage_boundary.total_coverage_gain|floatformat:0 oldest_timestamp=coverage_boundary.oldest_timestamp|date:"SHORT_DATE_FORMAT"|localize %}compared to basemap.at. That's a difference of ~{{ total_coverage_gain }} % since {{ oldest_timestamp }}.{% endblocktrans %}


{% extends "emails/base.html" %} {% block content %}
Hi {{ user.volunteer.name }},
Are you available to cook with The People's Pantry this week? We currently have {{ num_requests}} requests from people in need across Toronto.
We'd love your help!
{% include "emails/_call_to_action.html" with link=call_to_action_url text="Sign up now" %} {% endblock %}


--- author: Capulet categories: app date: '2011-02-25 17:47:53' permalink: /2011/02/25/support-subscriptions-now-available/ slug: support-subscriptions-now-available status: publish title: Support Subscriptions Now Available! type: post format: html ---
Need PhoneGap tech support? Annual support subscriptions are now available for hackers, development shops and large enterprises.
Till now, PhoneGap app developers have relied on the public Google group, Twitter and help docs for tech support. Training webinars have also been popular. Though these channels work well for some, the new paid support subscriptions guarantee a higher level of service.
PhoneGap support packages start at $249 and include:
A Pro license costs $5000/year and covers up to five developers on a team. Enterprise licenses are also available.
Check out the PhoneGap support subscription packages here.


Does the price of tuition affect the overall enrollment of public and private universities?
What is the relationship between employment and education attained?
What does the unemployment rate look like based on education attained?


The VisionAir 3D Stent Architect is a medical web application that provides a design interface for physicians to create patient-specific silicon airway stents.
Pending 510k, not available for sale within the United States
3D Stents can be tailored to match any individual patient anatomy. This breakthrough eliminates the need for onsite modification: no cutting, no stitching, and no gluing.
VisionAir 3D provides a streamlined process from CT upload to stent design. Our sphere design interface provides a tool to design stents with precision and ease.
3D Stent Prescriptions are manufactured in medical grade silicone as one cohesive patient-specific implant.
Control the angulation at any position to contour a stent's shape to the complexities of any airway anatomy.
Adjust the inner diameter of the stent at any point from 6.0mm - 18.0mm
Bifurcated structure minimizes migration.
At VisionAir Solutions, we acknowledge that each patient is unique. This is why we believe that reimagining the airway stent is crucial for the future of interventional airway treatment.
Our company strives to work with leading pulmonologists to deliver the essential tools that will allow them to meet the needs of any individual.
<EMAIL_ADDRESS>Tel:<PHONE_NUMBER> x 102
7100 Euclid Ave #180, Cleveland, OH 44103


Preparation time
30 mins to 1 hour
Cooking time
30 mins to 1 hour
Serves
Serves 6
Dietary
Preheat the oven to 200C/400F/Gas 6.
For the mousse, place the chocolate pieces and warm water in a large heatproof bowl and sit it over a pan of barely simmering water, making sure the bowl doesn't touch the water below.
Keep the heat at its lowest setting and allow the chocolate to melt slowly.
Remove from the heat and stir thoroughly until the chocolate is smooth and glossy.
Let the mixture cool; then mix in the egg yolks thoroughly with a wooden spoon.
In a clean bowl, whisk the egg whites until soft peaks form when the whisk is removed from the bowl. Gradually whisk in the sugar and continue whisking until the whites are glossy.
Using a metal spoon, fold the egg whites into the chocolate mixture, taking care not to knock the air out of the egg whites. Set aside in a cool place.
For the tuile, you will need six small round biscuit cutters.
Cut a long thin rectangle the size of the cutter out of the card to leave a rectangular-shaped hole. Now cut a circle-shaped hole from the card (the same size as the cutter) from the centre of the cutter.
Whisk the cocoa powder and water together to make a loose paste in a small bowl. Set aside.
Place the butter and icing sugar into a separate bowl and beat until smooth, light and fluffy. Gradually add the egg whites to the mix, and then fold in the flour.
Line a baking tray with a non-stick baking mat. Brush the cocoa paste over the mat to give a light coating. Set the remaining cocoa paste aside.
Place the template on top of this and spread the tuile mix very thinly over the holes with a palette knife, then lift off the template, leaving two perfect shapes. Repeat to make six sets (or more if you have enough of the mixture).
Bake in the oven for 4-5 minutes until lightly coloured around the edges. Remove from the oven and cool for one minute.
To assemble the tuile boxes, flip the edge of one of the rectangular tuiles up, and using one of the cutters, roll the tuile around the outside of the cutter to create a cylinder. Repeat with the remaining cutters and tuile pieces. Leave to cool slightly; then remove the cutters to cool completely. Allow the round lids to cool flat.
For the vanilla cream, place the cream, icing sugar and vanilla seeds into a bowl and whisk until soft peaks form when the whisk is removed from the bowl.
To serve, brush a strip across the centre of each plate with the cocoa paste. Place the tuile cylinder in the centre of each and fill with the reserved chocolate mousse. Top with a few raspberries and place the tuile lid on at an angle to just cover. Spoon the vanilla cream alongside.


THE OUT-OF-TOWNERS
Reviewed by Harvey Karten, Ph.D. Paramount Pictures Director: Sam Weisman Writer: Marc Lawrence Cast: Steve Martin, Goldie Hawn, Mark McKinney, John Cleese, Gregory Jbara, Philip E. Johnson, Daniel Parker, Ernie Sabella
They say that travel is broadening. Taking a journey outside of your home state exposes you to cultures and life styles other than your own. This is true. Travel has the added benefit of allowing you to turn inward as well, affording new perspectives on your life and home and your relationships with your loved ones. "The Out-of-Towners" seeks to prove this premise. This is the story of a marriage which has fallen into a rut when the last of the children leaves the nest, and how a journey of just a few hundred miles bequeaths to its two pilgrims some new perspectives not so much on cultures outside of their own provincial town but on their very own connection to each other.
Neil Simon's play was first adapted to the screen some thirty years ago. That screen version featured Jack Lemmon and Sandy Dennis as two people married two score and four years, whose trip from Ohio to New York is charged with so many blemishes that the very disasters serve to strengthen their marriage. Full of dated humor even then, the 1970 version directed by Arthur Hiller would not appear a fitting vehicle for a sequel. Nor can two of our finest comic actors, Steve Martin and Goldie Hawn, breathe life into this tired concoction of predictable country-mouse-visits-the-big-city theme. Though Marc Lawrence's version changes some of the details of the Hiller interpretation, the structure remains intact and so does the outmoded humor. In fact Steve Martin, whose talent for portraying what showbiz biographer Ephraim Katz calls "his likeable, self-mocking split personae, forever wavering between vulnerability and overconfidence, between frenzied cheeriness and pathetic heartbreak," fails to ignite the screen, owing to director Sam Weisman's incapacity at comic timing. Nor does Martin develop much chemistry with Ms. Hawn who, despite being almost exactly the same age as the prematurely gray Martin, could virtually pass for his daughter.
The story is propelled by a job interview that Ohio resident Henry Clark (Steve Martin) has with a mid-town Manhattan advertising agency. As his daughter had left the nest some time back and his son has just followed suit, Henry and his wife of 27 years, Nancy (Goldie Hawn), are vaguely uncomfortable. What will they now have to talk about? The excursion to the Big Apple gives them enough material to keep their conversation flowing for years to come.
During the relatively brief duration of the movie, Henry and Nancy suffer a diversion of their flight to Boston; a missed train connection; lost luggage; a Manhattan mugging from a man whom they believe to be Andrew Lloyd Webber; a failure to get a hotel room given their lack of money; a zany therapy session into which they have wandered; and stomachs growling with insatiable hunger. They are chased by police on horseback; are observed having sex in Central Park by New York's mayor (played by Rudy as himself); and dangle dangerously on a hotel veranda twenty-two stories above the city.
While Neil Simon's show was never one of his better efforts, the work should have been left interred along with several other frolics of the world's most economically successful playwright, along with "The Odd Couple" and "Barefoot in the Park." John Cleese turns in an encouraging performance as a cynical clerk in a posh Manhattan hotel-- recreating his role as Basil Fawlty on one of TV's most rollicking comedies. But his high-kicking dance in drag is as antiquated today as is Steve Martin's duck-walking romp on city streets while high on speed, waddling to the soundtrack beat of "The Age of Aquarius."
A few scenes, nevertheless, begin to catch fire, particularly one involving the couple's attempted theft of a New York Times outside an apartment door (reminiscent of Jack Lemmon's similar aspiration in "The Prisoner of Second Avenue") and a sex therapy session that could have come out of the Bob Newhart TV show, featuring Cynthia Nixon as a nymphomaniac.
"The Out-of-Towners" is the second script adapted by the pen of Marc Lawrence, whose "Forces of Nature" was released just weeks ago. While Steve Martin and Goldie Hawn are immeasurably more charming than Ben Affleck and Sandra Bullock, "The Out-of-Towners" gives them little more than recycled pap for their considerable talents.
Rated PG-13. Running Time: 85 minutes. (C) 1999 Harvey Karten
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


On Feb 1, 2006, at 7:37 PM, David Hyatt wrote:
While reworking images I ran into something that
really concerns me.
WebElementImageKey is a key added to the elementAtPoint
dictionary and the key's value is an NSImage. Unfortunately we use
CGImageRef now. What
this means is that as you move the mouse around a web page we are
aggressively mallocing NSImages that then move into our image cache and
stay around until the CGImageRef goes away (which could be a long
time).
I think this is terrible but am not sure how to fix
it. I assume this key is
public API. Could we
change the key's value to be a CGImageRef instead? Could we just eliminate the
key in favor of a DOM extension method for accessing an
NSImage?
dave
(hyatt@apple.com)


STEM Collaboratory 2016
Toggle navigation
Home
Logout
HTML DETAILED
Data Visulization
UI DESIGN
JAVASCRIPT I
JAVASCRIPT II
INTRO TO D3
REFERRENCES
PREV
1/8
NEXT


--- layout: archive title: Zulip Chat Archive permalink: /stream/113489-new-members/topic/Ali.html ---
@Ali Barkhordarian welcome
Is he also from Kevin's gang?
yes
nice
Welcome!
Last updated: Apr 24 2020 at 19:02 UTC


{{ 'Map for device id' | trans }} {{input.selectedDevice.device_id}}
{{ 'Total # of reports (with loc)' | trans }} : {{reports.length}}
{{ 'From' | trans }} {{reports[0].timestamp | date:'HH:mm:ss' }} {{ 'to' | trans }} {{reports[reports.length-1].timestamp | parseDate | date:'HH:mm:ss' }}
{{ 'on' | trans }} {{reports[0].timestamp | date:'dd-MMM-yyyy'}}


Code Download
Kinect and Depthkit
Depthkit Template Download
Interactivity part 1
To get started with interactivity we can add a gazed based cursor. To create a cursor we will create a
camera.
Then we add a entity with the cursor component with a -1 on the z axis so it places it in front of the
camera. Cursor Documentation
Let's look at c.html
We can use the Event Set
Component to respond to cursor events.
Let's look at c1.html
The event-set component also has a _target: property which can affect onther object
Let's look at c1.html again
Animation has a startEvents
property that listens for on it's own.
Let's look at c2.html
The Cursor acts like a mouse and uses
mouse events which are listed in the documentation.
Other VR controllers offer different events.
Interaction and
Controllers
In checkpoint.html we combine the cursor with Checkpoint Controls
for a movement system
Physics
Look at Phys1.html and we will look at a basic physics setup
Look at Phys2.html and Phys3.html
To make the last 2 scenes I used the randomizer component and the entity generator component
I want to walk you through how to do this so lets start by reviewing Mixins look at mix1.html
now lets look at entgen.html and walk through it
Now we can revisit Phys3.html and Phys2.html
Maya Basics
Painting with Substance painter
Taking a screenshot:
To take a 360° (equirectangular) screenshot, press ctrl + alt + shift + s on the keyboard.
To take a normal (perspective) screenshot, press ctrl + alt + s on the keyboard.
Components of A-Frame’s entity-component framework are JavaScript modules that can be mixed, matched,
and composed onto entities
to build appearance, behavior, and functionality. We can register component in JavaScript and and add it
to an a-entity tag. Components are configurable, reusable, and shareable. Most code in an A-Frame
application should live within components.
You use the AFRAME.registerComponent() function to register a component, do this before
Have a look at comp.html
You can also define an AFRAME.registerComponent() in a seperate file
Have a look at the content of the template folder
Default functions of a component
Inside the comp_template folder, look at the file mycomponent.js
This is a boilerplate that show all the built in functions that a-frame gives us
Today we will start with init() which is called once when the component is first plugged into
its
entity.
We’ll go over examples on writing components. The examples will do mostly trivial things at first but
will will build up
in complexity as we go.
Let's look at the code in 15.html
After the entity is attached and initialized, it will initialize our hello-world component. The
wonderful thing about components
is that they are called only after the entity is ready.
Defining Properties with the Schema
The schema defines the properties of its component. As an analogy, if we think of a component as
a function, then a component’s properties are like its function arguments.
Have a look at 16.html and try uncommenting line 33
Lets look at the Component API reference to see the schema type available
We can add an element to the scene using document.createElement(),setAttribute() and
.appendChild()
Have a look at 17.html
In 18.html we combine the last lesson with multiple schema propeties and entities
Let's take a look
Let's take a look at Lesson 19.html, in this example we append the animation atrribute
The Audio
Analyzer Component
Audio Reactivity
Let's look at curve3/index.html this is a template to get started with the Audio Analyzer Component
Shader Materials, Shaders are small graphics programs that run on the graphics card.
Let's look at shader/index.html
Writing shaders from scratch is a bit tricky but there is a site called https://shaderfrog.com/,
where we can start playing around with them export them for use in our scene. Create an account to
begin.
We will use the https://github.com/msj121/aframeFrogShaders
addon to use the exported shader as a material in our scene.


A Nyzo block without transactions is 188 bytes. Each transaction increases the size of the block by an amount that
depends on the transaction type and length of the sender-data field. The fields of a block are:
blockchain version
2 bytes
16-bit unsigned integer of the blockchain version
height
6 bytes
48-bit unsigned integer distance from Genesis block, which has a height of 0
previous block hash
32 bytes
double-SHA-256 of the previous block signature
start timestamp
8 bytes
64-bit Unix timestamp of the start of the block, in milliseconds
verification timestamp
8 bytes
64-bit Unix timestamp of when the verifier creates the block, in milliseconds
transaction count
4 bytes
32-bit unsigned integer of the number of transactions in the block
transactions
variable
standard transactions are 154 to 186 bytes each
balance-list hash
32 bytes
double-SHA-256 of the balance list
verifier identifier
32 bytes
Ed25519 public key of the verifier that created this block
verifier signature
64 bytes
Ed25519 signature of all other fields, signed by the verifier's private key


{{ partial "default_head.html" . }} Sorry, we've misplaced that URL or it's pointing to something that doesn't exist. Head back home to try finding it again. {{ partial "default_foot.html" . }}


jQuery UI Tests
Unit Tests
Unit tests exist for all functionality in jQuery UI. The unit tests can be run locally (some tests require a web server with PHP) to ensure proper functionality before committing changes. The unit tests are also run on TestSwarm for every commit.
Visual Tests
Visual tests only exist in cases where we can't verify proper functionality with unit tests. These may be either purely visual or just hard to automate. Most visual tests will provide a description of what is happening on the page and what to look for.


The following are other resource(s) related to this project.
Telegram to chatbot - Click
Github for Project Details - Click
Github for Visualization (future work of improvement for visualization) - Click


The game was originally a class project hacked together with Flixel over a couple weeks. This version is the Phaser port of that initial version. It is also currently in beta testing, so please 'fiddle' with the settings and provide feedback in the issue tracker. Check back sometime for the final release. We have mobile aspirations!
For education purposes, the entire project is open source. You can even read the annotated source here. Your support in any $ amount is welcome! Donate here.


(comment: As originally posted on the OUBS Blog)

There are a number of ways of doing this and I for one do believe that only a very small part of this has anything to do with financials. Then again, financials are important and it’s good to have a well grounded foundation. So there we go. What can one do?

Value to Assets

Publilius Syrus pointed out ‘A thing is worth whatever the buyer will pay for it.’ and this in itself does depend on a lot of different factors. So what are a company’s assets worth? You need to determine the book value and then move from there as you might want to put a slightly different valuation on assets than how they are presented on the balance sheet.

Book value will tell you how much the company is worth to the ordinary shareholders, meaning the value of the assets minus that of the liabilities to third parties. Some call it book value of equity, others shareholders’ funds or net asset value. You can also look at that per share and if there are options that might be exercised, then this will increase the number of shares and hence the fully diluted book value per share will be lower.

In the end, the book value and assets held will be valued somewhere between the historic cost of assets and the current market value. You might need to adjust that.

Tangible assets are normally depreciated according to some estimates or revalued in case of land that does not wear out for example. In case market value goes below depreciated book value, these assets will be revalued to reflect market value in the books, even though this will never be accurate.

In some countries (e.g. USA, France, Germany), property is always inclueded at historic cost, leading to a book value potentially way below current value. In the UK, the move to include these assets at current value was done because sometimes companies were taken over and their assets sold at a profit. Now the true value of the assets is made clear to the market and not only to those people looking very very carefully. Return on assets shrinks then though and this means that some companies prefer to lease.

While most of the time interest on debt is an expense, some countries allow it to be capitalised for construction projects.

Intangible assets like R&D expenses and brand values are sometimes a very high value inside a company but are hard to value. The capitalisation of brands like Coca-Cola might give a clearer picture to the market value of the company. In the UK, you can capitalise brands if you bought them but not if you build them, bringing in the role of goodwill. This goodwill would be the difference of the price paid for a company and its book value and this difference can appear on the buying company’s balance sheet.

With goodwill it is important if and how it needs to be written off. If this needs to be done against the income statement then the earnings per share will be reduced, making it less attractive to pay high goodwill at acquisition.

[This again shows that it is of major importance to look at the cash flow statement!!!]

Off-balance sheet items can be leases, pension assets or liabilities which can be mentioned in the notes only. Leasing can be seen as just another form of conventional debt. This lead to finance leases now needing to be included in the balance sheet if more than 90% of the value of the asset is paid during the lease period. Companies do need to disclose year by year changes in pension fund values. In Germany you need to remember that companies do quasi capitalise pension fund money on the balance sheet, meaning that when comparing them to non-Germany companies you need to find out which amounts of money really do belong to shareholders. Enron is a good case where off-balance sheet transactions hid too many things.

Calculate like this:

 Book value of assets + Adjustment for replacement cost on inventory, plant and equipment + Overfunding of pension fund + Undervaluation of intangibles = Adjusted book vlaue of assets - Current liabilities - Long-term liabilities - Contingent legal liabilities = Adjusted book value of equity

Market Multiples

This is another method of valueing a company and it is almost dead simple and makes comparison easy. You start with the market multiples of public companies, with large companies giving you a good idea and small companies a less good one. The problem is that the bid and ask spread in smaller companies is bigger as the market maker has a more difficult task to sell or buy back the trade after completion. [Boy are market makers fun things ;)]

There are some more comments to make though. Stock exchanges tell us that any price can also not be a ‘fair market price’, with a fair one implying at least the semi-strong form of efficient markets. In emerging markets, the quality of information available is also hard. Also, the market price implies that you can sell or buy the shares at this price, which also depends on the volume you are talking about. You will have a big problem buying 30% of Microsofts outstanding shares without the price going up ;) Last but not least, a share price is always quoted at a specific time, which can be different at any other.

Further factors influence a stock price: - Shareholder loyalty - Additional benefits - Employee loyalty - Premium for control - Fashion

Specific multiples include …

… Dividend yield ignored capital gains or loss. It is now seen that not paying dividends increases capital gains and vice versa, and dividends should only be paid if they can be better employed elsewhere by the shareholders.

… Price to book implies that investores are willing to pay x times the book value because of the growth potential. This is rather meaningless on its own but insightful when compared to other companies or over time or to an index.

… Tobin’s Q is an interesting one being about whether to set up a company from scratch or buying one. It is calculated via (Market Captitalisation) / (Replacement cost of assets net of liabilities). If it is below 1, you better buy the company, and if it is over 1 you should do it yourself. Other people argue that with the increase of intangible assets, Tobin’s Q can be above 1 on average, also for an entire market. [One might argue that with a lot of hope in the market you go above 1, when hope wains, you go low… really low.]

… The PE multiple is a calculated by (Share price) / Earnings per share = (Market capitalisation) / (Earnings for shareholders). The higher this ratio the more bullish the shareholders have to be about the company. A higher PE ratio is often attached to companies with a high quality of earnings, meaning a very steady flow of earnings and earnings growth. When comparing across countries take into account diffferences in their account standards, as well as different economic cycles. Also take into account atypical drops or rises in earnings as well as potential provisions.

… Price to cash flow should be calculated by on (Share price) / (Cash flow per share) where: Cash flow = Operating cash flow + Other Income + Interest received - Interest payable - Taxation Cash flow can be very volatile in relation to earnings though, as there is no depreciation for example.

… Enterprise value (EV) to EBITDA looks at the entire enterprise and kind of at a cash flow before capital expenditure. EV is normally defined as market value of both debt and equity and preference shares or convertibles minus minority interests. You need to decide whether to include short term debt, meaning as to whether to consider it funding or a temporary thing. EV/EBITDA tends to be more stable than price to cash flow. The higher the number the higher the exptected margin and the expected growth. It is also attractive because it is independent on the capital structure and depreciation policies.

Discounted cash flow

Shares traded on the stock market should reflect the value of the company, meaning that discounting the future cash flows to the share price should lead to a zero net present value. [Sounds good doesn’t it? ;)]

You can either do it at an equity level, meaning dividends, or the enterprise level. You need to take into account cash flows before financing but after taxes discounting them typically by the WACC. You then subtract the value of debt and minority interests from that value. The OUBS gives you a spread sheet to try to work through all of this and they suggest several steps:

Determine the time horizon for your forecast

Look at economic and business cycle

Consider positive and negative growth

Conside the time of above-average returns

Forecast operating cash flows

Determine value drivers (e.g. change in sales, NOP/sales, sales/NPPE, …)

Estimate historc, current and future ratios

Decide on cash/investment policy

Determine residual value

Decide on value methodology (eg. EV/EBIDTA ratio in the future, or growth in perpetuity)

Estimate the WACC including the determination of debt/equity ratio.

Discount the cash flows

Determine enterprise value

Determine equity value

Conduct sensitivity analysis

Potentially prepare related financial statements.

Valuation in context

Sometimes valuation is very critical. A closer look is taken at them here…

… Regulation will have an effect with some companies as to how to value the company, for example in cases of previously state-owned companies that have now gone public and still have a quasi monopoly that needs to be regulated.

… New issues (flotation or primary issues are when a company goes public the first time) can be done in several ways. For example a price might be fixed before the new issue based on the value of the company as a going concern or a little below that. A new method mostly used in the US is called book building and is about managing the indications of interest by investors to get the highest price. Fees in the US can be as high as 5% of gross proceeds. It is also argued that return for investors on new issues will be not so high in the long term, partly as analysts will be over-optimistic in their forecasts, especially if their company has some hand in the offereing ;)

… Privatisations The valuation here very much depends on the terms of just that privatisation, including the regulatory environment and targets they are set or restrictions imposed. BT in the UK had to limit price rises to the cost of inflation -x%. Anther option than an issue is used in Germany a lot, being a trade sale. This means that the company is auctioned off to a private company which will provide both money and management. Another example would be Deutsche Telekom, issuing 600 million shares in a book building method with two-thirds earmarked for German investors.

… Mergers and Acquisitions mostly really have been partial of full take-overs with real mergers only coming in the late 1990s. The idea was in global markets you need to have a given size. A+B is worth more than A and B on its own.  Earlier equity was common in a buy, but now debt is more common because it is generally cheaper and might even be tax deductible. Lots of take-overs fail though, but they are still done, partly because organic growth has reached its limit.

… Restructuring is about the idea of releasing value back to shareholders. If the underlying assets are believed to be worth more than the market valuation of the company, then a leveraged buyout (LBO) backed by financiers can take-over the company and split it up. Another form is the management buyout (MBO) or management buy-in (MBI) or the hybrid transaction of new and old management being called BIMBO.


Contents
Topographic data
load bluff_data;
x=bluff_data(:,1);
y=bluff_data(:,2);
z=bluff_data(:,3);
plot3(x,y,z,'.')
gx=0:4:264;
gy=0:4:400;
g=gridfit(x,y,z,gx,gy);
figure
colormap(hot(256));
surf(gx,gy,g);
camlight right;
lighting phong;
shading interp
line(x,y,z,'marker','.','markersize',4,'linestyle','none');
title 'Use topographic contours to recreate a surface'
Fitting a trigonometric surface
clear
n1 = 15;
n2 = 15;
theta = rand(n1,1)*pi/2;
r = rand(1,n2);
x = cos(theta)*r;
y = sin(theta)*r;
x=x(:);
y=y(:);
x = [[0 0 1 1]';x;x;1-x;1-x];
y = [[0 1 0 1]';y;1-y;y;1-y];
figure
plot(x,y,'.')
title 'Data locations in the x-y plane'
z = sin(4*x+5*y).*cos(7*(x-y))+exp(x+y);
xi = linspace(0,1,51);
[xg,yg]=meshgrid(xi,xi);
zgd = griddata(x,y,z,xg,yg);
figure
surf(xi,xi,zgd)
colormap(hot(256))
camlight right
lighting phong
title 'Griddata on trig surface'
zgrid = gridfit(x,y,z,xi,xi);
figure
surf(xi,xi,zgrid)
colormap(hot(256))
camlight right
lighting phong
title('Gridfit to trig surface')
The trig surface with highly different scalings on the x and y axes
xs = x/100;
xis = xi/100;
ys = y*100;
yis = xi*100;
[xg,yg]=meshgrid(xis,yis);
zgd = griddata(xs,ys,z,xg,yg);
figure
surf(xg,yg,zgd)
colormap(hot(256))
camlight right
lighting phong
title 'Serious problems for griddata on badly scaled trig surface'
zgrids = gridfit(xs,ys,z,xis,yis,'autoscale','on');
figure
surf(xis,yis,zgrids)
colormap(hot(256))
camlight right
lighting phong
title 'Gridfit (automatically scaled) on trig surface'
Warning: Duplicate x-y data points detected: using average of the z values.
Fitting the "peaks" surface
clear
n = 100;
x = (rand(n,1)-.5)*6;
y = (rand(n,1)-.5)*6;
z = peaks(x,y);
xi = linspace(-3,3,101);
zpgf = gridfit(x,y,z,xi,xi);
[xg,yg]=meshgrid(xi,xi);
zpgd = griddata(x,y,z,xg,yg,'cubic');
figure
surf(xi,xi,zpgd)
colormap(jet(256))
camlight right
lighting phong
title 'Griddata (method == cubic) on peaks surface'
figure
surf(xi,xi,zpgf)
colormap(hsv(256))
camlight right
lighting phong
title('Gridfit to peaks surface')
Using tiles in gridfit
n = 100000;
x = rand(n,1);
y = rand(n,1);
z = x+y+sin((x.^2+y.^2)*10);
xnodes = 0:.00125:1;
ynodes = xnodes;
[zg,xg,yg] = gridfit(x,y,z,xnodes,ynodes,'tilesize',120,'overlap',0.25);
surf(xg,yg,zg)
shading interp
colormap(jet(256))
camlight right
lighting phong
title 'Tiled gridfit'


--- layout: archive --- {{ content }}
I am a passionate data scientist who excels at machine learning, exploratory analysis, and data visualization.
I hold a bachelor's degree in mathematics from the University of California, Santa Barbara and a master's degree in Data Science from the University of San Francisco.
I am currently a Data Engineer with Saama Technologies where I integrate new sources of customer data into our Life Science Analytics Cloud clinical development platform and always work to improve the efficiency and stability of our data pipelines.
Before joining Saama, I was a Data Engineering Rookie with Under Armour Connected Fitness. I analyzed runner route popularity and designed algorithms to identify changes in user activity from GPS time series data.
I previously worked with the National Center for Ecological Analysis and Synthesis where I contributed to open source R packages for managing submissions to the Arctic Data Center. In addition, I used R and Python to clean and aggregate data from National Science Foundation funded research projects to prepare them for publication.
When I am not doing data science, I like to get outdoors. I am passionate about traveling and learning about different parts of the world.
In my free time, I enjoy learning new skills by working on personal projects. They can be found here.


| Figure 1 |
Map of the study area showing (A) cities at the west margin ... |
| Figure 2 |
Annual trend (2000–2014) in river discharge (m 3 s −1) (A) o ... |
| Figure 3 |
Temperature (°C) (A) and accumulated precipitation (mm) (B) ... |
| Figure 4 |
Wind roses chart with wind speed (m s −1) and direction, cor ... |
| Figure 5 |
Anomalies of the ENSO3.4 index for the time series of 2001–2 ... |
| Figure 6 |
Cyanobacteria blooms or non-blooms estimates published and o ... |


Dramatic footage captured of an Audi Q7 crashing into a van in Preesall
A dramatic crash in Preesall has been captured on a dash camera
by James GravesFootage appears to show a crash which happened on Saturday, December 7 shortly before 8pm when an Audi Q7 has crashed into a Citroen Berlingo van on Park Lane as the van was trying to turn into Unsworth Avenue.
The force of the crash sent the Citroen spinning into a BMW M3 which was trying to come out of Unsworth Avenue.
Despite the serious crash, the Audi appears to continue down Park Lane.
Lancashire Police was unable to provide any details of the incident
Were you or do you know anyone involved in the crash? Please contact our newsdesk on (01253) 361727


Offriamo la migliore food in citta.
The app was created in 2017 whose main aim was to reduce the cost of one cooking when they are not in their homes.
Through the app one can make the order online easily at affordable prices which has been of great value to our customers.
We have our branhes at different areas in Nairobi such as in Karen which is our headquater.
A new branch has also been opened in Mombasa near Mikindani area.


Iterators for linear subclasses#
The classes below are iterators returned by the functions
M.linear_subclasses()
and M.extensions()
.
See the documentation of these methods for more detail.
For direct access to these classes, run:
sage: from sage.matroids.advanced import *
See also sage.matroids.advanced
.
AUTHORS:
Rudi Pendavingh, Stefan van Zwam (2013-04-01): initial version
Methods#
- class sage.matroids.extension.CutNode#
Bases:
object
An internal class used for creating linear subclasses of a matroids in a depth-first manner.
A linear subclass is a set of hyperplanes \(mc\) with the property that certain sets of hyperplanes must either be fully contained in \(mc\) or intersect \(mc\) in at most 1 element. The way we generate them is by a depth-first search. This class represents a node in the search tree.
It contains the set of hyperplanes selected so far, as well as a collection of hyperplanes whose insertion has been explored elsewhere in the search tree.
The class has methods for selecting a hyperplane to insert, for inserting hyperplanes and closing the set to become a linear subclass again, and for adding a hyperplane to the set of forbidden hyperplanes, and similarly closing that set.
- class sage.matroids.extension.LinearSubclasses#
Bases:
object
An iterable set of linear subclasses of a matroid.
Enumerate linear subclasses of a given matroid. A linear subclass is a collection of hyperplanes (flats of rank \(r - 1\) where \(r\) is the rank of the matroid) with the property that no modular triple of hyperplanes has exactly two members in the linear subclass. A triple of hyperplanes in a matroid of rank \(r\) is modular if its intersection has rank \(r - 2\).
INPUT:
M
– a matroid.line_length
– (default:None
) an integer.subsets
– (default:None
) a set of subsets of the groundset ofM
.splice
– (default:None
) a matroid \(N\) such that for some \(e \in E(N)\) and some \(f \in E(M)\), we have \(N\setminus e= M\setminus f\).
OUTPUT:
An enumerator for the linear subclasses of M.
If
line_length
is notNone
, the enumeration is restricted to linear subclassesmc
so containing at least one of each set ofline_length
hyperplanes which have a common intersection of rank \(r - 2\).If
subsets
is notNone
, the enumeration is restricted to linear subclassesmc
containing all hyperplanes which fully contain some set fromsubsets
.If
splice
is notNone
, then the enumeration is restricted to linear subclasses \(mc\) such that if \(M'\) is the extension of \(M\) by \(e\) that arises from \(mc\), then \(M'\setminus f = N\).EXAMPLES:
sage: from sage.matroids.extension import LinearSubclasses sage: M = matroids.Uniform(3, 6) sage: len([mc for mc in LinearSubclasses(M)]) 83 sage: len([mc for mc in LinearSubclasses(M, line_length=5)]) 22 sage: for mc in LinearSubclasses(M, subsets=[[0, 1], [2, 3], [4, 5]]): ....: print(len(mc)) 3 15
Note that this class is intended for runtime, internal use, so no loads/dumps mechanism was implemented.
- class sage.matroids.extension.LinearSubclassesIter#
Bases:
object
An iterator for a set of linear subclass.
- class sage.matroids.extension.MatroidExtensions#
Bases:
LinearSubclasses
An iterable set of single-element extensions of a given matroid.
INPUT:
M
– a matroide
– an elementline_length
(default:None
) – an integersubsets
(default:None
) – a set of subsets of the groundset ofM
splice
– a matroid \(N\) such that for some \(f \in E(M)\), we have \(N\setminus e= M\setminus f\).
OUTPUT:
An enumerator for the extensions of
M
to a matroidN
so that \(N\setminus e = M\). Ifline_length
is notNone
, the enumeration is restricted to extensions \(N\) without \(U(2, k)\)-minors, wherek > line_length
.If
subsets
is notNone
, the enumeration is restricted to extensions \(N\) of \(M\) by element \(e\) so that all hyperplanes of \(M\) which fully contain some set fromsubsets
, will also span \(e\).If
splice
is notNone
, then the enumeration is restricted to extensions \(M'\) such that \(M'\setminus f = N\), where \(E(M)\setminus E(N)=\{f\}\).EXAMPLES:
sage: from sage.matroids.advanced import * sage: M = matroids.Uniform(3, 6) sage: len([N for N in MatroidExtensions(M, 'x')]) 83 sage: len([N for N in MatroidExtensions(M, 'x', line_length=5)]) 22 sage: for N in MatroidExtensions(M, 'x', subsets=[[0, 1], [2, 3], ....: [4, 5]]): print(N) Matroid of rank 3 on 7 elements with 32 bases Matroid of rank 3 on 7 elements with 20 bases sage: M = BasisMatroid(matroids.named_matroids.BetsyRoss()); M Matroid of rank 3 on 11 elements with 140 bases sage: e = 'k'; f = 'h'; Me = M.delete(e); Mf=M.delete(f) sage: for N in MatroidExtensions(Mf, f, splice=Me): print(N) Matroid of rank 3 on 11 elements with 141 bases Matroid of rank 3 on 11 elements with 140 bases sage: for N in MatroidExtensions(Me, e, splice=Mf): print(N) Matroid of rank 3 on 11 elements with 141 bases Matroid of rank 3 on 11 elements with 140 bases
Note that this class is intended for runtime, internal use, so no loads/dumps mechanism was implemented.


Begin - to begin is half the work, let half still remain; again begin this, and thou wilt have finished.
Life is too short to re-invent the wheel. We just want to crack on and build great products.
But there is so much to do in addition to the code.
This is why this template was put together. To make your life (a little) easier by showing you how to write a Python Flask application.
It can be easily deployed onto AWS.
And is free to all.
So enjoy.


Money Play. How should Red play 54?
pips Red=178 White=170
(CorrectAnswer= 0/0, ErrorScore= 0)
This is a fairly rare beast – the double back game.
Neither player has many checkers in the attack zone so a certain amount of liberty can be taken.
Not hitting here would be a terrible mistake. Always remember the prime rule of back games – don’t play them unless you have to! Here Red should try to win by going forwards. The first step is 21/17* and then it is merely a question of the 5.
Maybe the gut reaction is 21/16 but correct is 23/18, playing to make an advanced anchor. As noted above Red should not fear White’s attack and as he doesn’t want to play a 2-pt anchor game now is a great time to get off that point. 23/18, 21/17* it is.
Neither player has many checkers in the attack zone so a certain amount of liberty can be taken.
Not hitting here would be a terrible mistake. Always remember the prime rule of back games – don’t play them unless you have to! Here Red should try to win by going forwards. The first step is 21/17* and then it is merely a question of the 5.
Maybe the gut reaction is 21/16 but correct is 23/18, playing to make an advanced anchor. As noted above Red should not fear White’s attack and as he doesn’t want to play a 2-pt anchor game now is a great time to get off that point. 23/18, 21/17* it is.
1. Cubeful 2-ply 23/18 21/17* Eq.: -0.078 0.490 0.119 0.003 - 0.510 0.156 0.009 2. Cubeful 2-ply 21/17* 21/16 Eq.: -0.205 (-0.127) 0.459 0.109 0.003 - 0.541 0.176 0.012 3. Cubeful 2-ply 23/14 Eq.: -0.334 (-0.256) 0.416 0.087 0.003 - 0.584 0.167 0.008 4. Cubeful 0-ply 21/17* 13/8 Eq.: -0.346 (-0.268) 0.417 0.106 0.003 - 0.583 0.205 0.019 5. Cubeful 0-ply 23/18 6/2 Eq.: -0.399 (-0.321) 0.403 0.085 0.002 - 0.597 0.203 0.013


ZwWdP vom 14.12.2010
|
Zeit |
Interpret |
Titel |
|
20 Uhr |
Aztec Camera |
Walk Out To Winter |
|
|
Fyfe Dangerfield |
She Needs Me |
|
|
Rumer |
Am I Forgiven |
|
|
Nouvelle Vague |
L'Aventurier |
|
|
Thievery Corporation |
Gentle Dissolve (Shawn Lee Mix) |
|
|
plus49 |
Rock On |
|
|
Violens |
Violent Sensation Descends |
|
|
John Lennon |
#9 Dream |
|
|
Acid Jazz Alliance |
Shaft In Acton |
|
|
David Bowie |
Miracle Goodnight |
|
|
Freda Payne |
Happy Heart |
|
|
The Autumn Defense |
Don't Know |
|
|
Paisley & Charlie |
Snow Blitz |
|
|
A Forest Mighty Black |
Rebirth |
|
21 Uhr |
Police |
Invisible Sun |
|
|
The Superimposers |
Christmas Again |
|
|
Giorgio Tuma |
Gorni Koala |
|
|
Natalie Prass |
No Better Time |
|
|
Treefight For Sunlight |
Riddles And Rhymes |
|
|
Grandaddy |
The Crystal Lake |
|
|
Moon Safari |
Bluebells |
|
|
The Bongolian |
Talking Synth |
|
|
John Schroeder |
Hungry For Love |
|
|
Peggy Lee |
So What's New |
|
|
Fabienne Delsol |
And I Have Learned To Dream |
|
|
The Ocean Tango |
Azimuth |
|
|
Timebox |
Beggin' |
|
|
Chet Atkins |
Slick |
|
22 Uhr |
Lazyboy & Roddy Frame |
Western Skies |
|
|
Aretha Franklin |
Day Dreaming |
|
|
Justin Bieber |
U Smile Ambient |
|
|
The Shins |
Weird Divide |
|
|
Neil Diamond |
Halleluiah |
|
|
Seahawks |
Astral Winds |
|
|
Moon Safari |
To The Sail Of The Sunset |
|
|
Marc Almond |
Happy Heart |
|
|
Sandie Shaw |
Lay Lady Lay |
|
|
Wayne Hill |
Left Bank Two |
|
|
Bart Davenport |
Better Days Ahead |
|
|
The Superimposers |
Chasing Christmas |
|
|
Rumer |
Come To Me High |
|
|
Marc Almond |
The London Boys |
|
|
Dean & Britta |
International Velvet Redux |
|
|
Groove Armada |
Fly me to the moon |


My mindful conversation went well! I took the opportunity to impliment these skills while having an important conversation about health and habits with someone I care about. By looping back and also dipping into myself, I was able to make sure she felt heard while expressing her desire for change, while also being able to advocate my comfort levels around how our relationship holds those new choices. It was a very healthy, affirming experience for us both. :)
What the author calls "looping," I know as "active listening." It's a practice I've kept front and center in my emotional toolbox for the last 8 years since the module on Quaker Practices during my time in Contemplative school.
SIY is an amazing resource, and I so appreciate getting the chance to reflect and share these learning styles within our modules and cohort! If anyone wnats to give a whirl to these conversation practices, I'd love to jump in with you.


Preparation time
less than 30 mins
Cooking time
less than 10 mins
Serves
Makes 24
These really easy canapés have saved the day, not only when people drop by my house unannounced but also when I fancy a quick snack myself of an evening. It is great to get creative with these, see what it is your cupboard and fridge and experiment with what works.
Preheat the oven to 190C/375F/Gas 5.
Trim the ends of the baguette and cut it into diagonal slices about 2cm/1in thick. Place on a large baking sheet, drizzle with oil and bake for 7-8 minutes.
For the tomato, basil and mint variation, roughly chop the tomatoes and place in a small bowl. Drizzle a little oil over, rip up the basil and mint leaves and add them along with salt, pepper and sugar to taste. Toss everything together.
For the white bean variation, put the cannellini beans in a small bowl, add a good drizzle of oil, seasoning and then mash roughly with a fork. Cut the slices of prosciutto in half.
Finally, for the goats’ cheese variation, mash the goats’ cheese with a fork in a small bowl and season, to taste with salt and freshly ground black pepper. Cut the figs into eight pieces.
Remove the crostini from the oven. They should be just crisp. Cut the garlic clove in half and rub the cut edge all over their tops.
Now to assemble, simply spoon the tomato mixture onto eight of the crostini.
Arrange the rocket on eight more and dollop the mashed cannellini beans on top. Lightly scrunch the prosciutto up and arrange on top of each one.
Finally, spread the goats’ cheese over the remaining eight crostini, arrange a couple of pieces of fig on top of each, scatter the mint leaves over and drizzle with a little balsamic and honey.
Arrange the crostini on a large serving platter or cake stand and serve.


Class Methods in Ruby
December 6, 2014
Class methods are methods defined on a class object, as opposed to instances of the class. These methods are accessible through the class object, but not through the individual instances of that class. Let's examine a Books
class which includes a class method for finding the book
object with the most pages.
class Books attr_reader :title attr_accessor :page_count def initialize(string) @title = string end def Books.largest(*books) books.max_by(&:page_count) end end book1 = Books.new("The Name of the Wind") book1.page_count = 1000 book2 = Books.new("Bossypants") book2.page_count = 100 book3 = Books.new("Dune") book3.page_count = 300 largest = Books.largest(.book1, book2, book3) puts largest.title => "The Name of the Wind"
Notice that defining the class method includes the reference to the class object: Books.largest
. The method takes a number of book
objects and returns the book with the largest page count. We still use instance methods when we set the page count and access the title of the largest book.
The purpose of class methods is to fill the role of methods that cannot be performed on individual instances of the class. For example, the built-in new
method is a class method, because until an instance has been created, we cannot send it a method call! So new
must be called on the class to first create the instance. In the Books
example above, it would not make sense to ask an individual book
instance to find the largest book out of all of them. It makes much more sense to ask the entire class of Books
to find the largest book
object. Creating a class method is thus partly a design decision.
Let's extend our class to incorporate a method that will alphabetize our books by title and then return the first book. Because it makes more sense to ask the class to alphabetize all the books, as opposed to asking one book
object to alphabetize all instances, we'll use another class method.
class Books attr_reader :title attr_accessor :page_count def initialize(string) @title = string end def Books.largest(*books) books.max_by(&:page_count) end def Books.alpha_first(*books) alpha_array = books.sort_by(&:title) alpha_array[0] end end book1 = Books.new("The Name of the Wind") book2 = Books.new("Bossypants") book3 = Books.new("Dune") first_book = Books.alpha_first(book1, book2, book3) puts first_book.title => "Bossypants"
Notice that the class method Books.alpha_first
takes an array of books and returns the first element in a sorted array of book
objects that is alphabetized by title. As such, we call the instance method title
on the book
object in order to get it to return just its title.
In conclusion, class methods are methods called on the class object. They represent methods that are not called on instances of a class, but on the class itself, for design and practical purposes.


At the News Lab, we strongly believe in the importance of quality journalism—original, fact-based reporting that spreads knowledge and has the power to improve people’s lives—and the journalists who produce it. We believe in Google's capacity to be a positive force in helping journalists strengthen digital storytelling and produce more in-depth reporting. And, we see ourselves as the voice for journalism inside Google—to ensure that the interests, needs, and concerns of journalists are surfaced and reflected in the products and services we offer as a company.
The News Integrity Initiative at the CUNY Graduate School of Journalism is a project to improve people’s lives by building trust in journalism, combating disinformation, and nurturing constructive, inclusive and respectful public conversations.
Through grants, applied research, events and workshops, we provide support for journalism that listens, responds to, and meaningfully reflects the needs and goals of the communities it serves. Our vision is for people to feel powerful — to feel visible, valued, and engaged in their communities — because they are armed with news and information that strengthens their sense of ownership and opportunities in the places where they live and work, empowers them to participate in community decision-making, and deepens their understanding of and empathy for people of all backgrounds and experiences.
For more information, visit www.newsintegrity.com
The Democracy Fund is a bipartisan foundation established by eBay founder and philanthropist Pierre Omidyar to help ensure that our political system can withstand new challenges and deliver on its promise to the American people. Subscribe to the Local Fix, a project of Democracy Fund’s Public Square program, for a weekly email roundup of the best writing on journalism, paired with concrete advice, tools, and resources for people who care about local news.


public static class LSL.StreamOutlet
extends java.lang.Object
| Constructor and Description |
|---|
LSL.StreamOutlet(LSL.StreamInfo info) |
LSL.StreamOutlet(LSL.StreamInfo info,
int chunk_size) |
LSL.StreamOutlet(LSL.StreamInfo info,
int chunk_size,
int max_buffered)
Establish a new stream outlet.
|
| Modifier and Type | Method and Description |
|---|---|
void |
close()
Close the outlet.
|
boolean |
have_consumers()
Check whether consumers are currently registered.
|
LSL.StreamInfo |
info()
Retrieve the stream info provided by this outlet.
|
void |
push_chunk(byte[] data) |
void |
push_chunk(byte[] data,
double timestamp) |
void |
push_chunk(byte[] data,
double[] timestamps) |
void |
push_chunk(byte[] data,
double[] timestamps,
boolean pushthrough) |
void |
push_chunk(byte[] data,
double timestamp,
boolean pushthrough) |
void |
push_chunk(double[] data) |
void |
push_chunk(double[] data,
double timestamp) |
void |
push_chunk(double[] data,
double[] timestamps) |
void |
push_chunk(double[] data,
double[] timestamps,
boolean pushthrough) |
void |
push_chunk(double[] data,
double timestamp,
boolean pushthrough) |
void |
push_chunk(float[] data) |
void |
push_chunk(float[] data,
double timestamp) |
void |
push_chunk(float[] data,
double[] timestamps) |
void |
push_chunk(float[] data,
double[] timestamps,
boolean pushthrough)
Push a chunk of multiplexed samples into the outlet.
|
void |
push_chunk(float[] data,
double timestamp,
boolean pushthrough)
Push a chunk of multiplexed samples into the outlet.
|
void |
push_chunk(int[] data) |
void |
push_chunk(int[] data,
double timestamp) |
void |
push_chunk(int[] data,
double[] timestamps) |
void |
push_chunk(int[] data,
double[] timestamps,
boolean pushthrough) |
void |
push_chunk(int[] data,
double timestamp,
boolean pushthrough) |
void |
push_chunk(short[] data) |
void |
push_chunk(short[] data,
double timestamp) |
void |
push_chunk(short[] data,
double[] timestamps) |
void |
push_chunk(short[] data,
double[] timestamps,
boolean pushthrough) |
void |
push_chunk(short[] data,
double timestamp,
boolean pushthrough) |
void |
push_chunk(java.lang.String[] data) |
void |
push_chunk(java.lang.String[] data,
double timestamp) |
void |
push_chunk(java.lang.String[] data,
double[] timestamps) |
void |
push_chunk(java.lang.String[] data,
double[] timestamps,
boolean pushthrough) |
void |
push_chunk(java.lang.String[] data,
double timestamp,
boolean pushthrough) |
void |
push_sample(byte[] data) |
void |
push_sample(byte[] data,
double timestamp) |
void |
push_sample(byte[] data,
double timestamp,
boolean pushthrough) |
void |
push_sample(double[] data) |
void |
push_sample(double[] data,
double timestamp) |
void |
push_sample(double[] data,
double timestamp,
boolean pushthrough) |
void |
push_sample(float[] data) |
void |
push_sample(float[] data,
double timestamp) |
void |
push_sample(float[] data,
double timestamp,
boolean pushthrough)
Push an array of values as a sample into the outlet.
|
void |
push_sample(int[] data) |
void |
push_sample(int[] data,
double timestamp) |
void |
push_sample(int[] data,
double timestamp,
boolean pushthrough) |
void |
push_sample(short[] data) |
void |
push_sample(short[] data,
double timestamp) |
void |
push_sample(short[] data,
double timestamp,
boolean pushthrough) |
void |
push_sample(java.lang.String[] data) |
void |
push_sample(java.lang.String[] data,
double timestamp) |
void |
push_sample(java.lang.String[] data,
double timestamp,
boolean pushthrough) |
boolean |
wait_for_consumers(double timeout)
Wait until some consumer shows up (without wasting resources).
|
public LSL.StreamOutlet(LSL.StreamInfo info, int chunk_size, int max_buffered)
info
- The stream information to use for creating this stream. Stays constant over the lifetime of the outlet.chunk_size
- Optionally the desired chunk granularity (in samples) for transmission. If unspecified,
each push operation yields one chunk. Inlets can override this setting.max_buffered
- Optionally the maximum amount of data to buffer (in seconds if there is a nominal
sampling rate, otherwise x100 in samples). The default is 6 minutes of data.public LSL.StreamOutlet(LSL.StreamInfo info, int chunk_size)
public LSL.StreamOutlet(LSL.StreamInfo info)
public void close()
public void push_sample(float[] data, double timestamp, boolean pushthrough)
data
- An array of values to push (one for each channel).timestamp
- Optionally the capture time of the sample, in agreement with local_clock(); if omitted, the current time is used.pushthrough
- Optionally whether to push the sample through to the receivers instead of buffering it with subsequent samples.
Note that the chunk_size, if specified at outlet construction, takes precedence over the pushthrough flag.public void push_sample(float[] data, double timestamp)
public void push_sample(float[] data)
public void push_sample(double[] data, double timestamp, boolean pushthrough)
public void push_sample(double[] data, double timestamp)
public void push_sample(double[] data)
public void push_sample(int[] data, double timestamp, boolean pushthrough)
public void push_sample(int[] data, double timestamp)
public void push_sample(int[] data)
public void push_sample(short[] data, double timestamp, boolean pushthrough)
public void push_sample(short[] data, double timestamp)
public void push_sample(short[] data)
public void push_sample(byte[] data, double timestamp, boolean pushthrough)
public void push_sample(byte[] data, double timestamp)
public void push_sample(byte[] data)
public void push_sample(java.lang.String[] data, double timestamp, boolean pushthrough)
public void push_sample(java.lang.String[] data, double timestamp)
public void push_sample(java.lang.String[] data)
public void push_chunk(float[] data, double timestamp, boolean pushthrough)
data
- A rectangular array of values for multiple samples.timestamp
- Optionally the capture time of the most recent sample, in agreement with local_clock(); if omitted, the current time is used.
The time stamps of other samples are automatically derived based on the sampling rate of the stream.pushthrough
- Optionally whether to push the chunk through to the receivers instead of buffering it with subsequent samples.
Note that the chunk_size, if specified at outlet construction, takes precedence over the pushthrough flag.public void push_chunk(float[] data, double timestamp)
public void push_chunk(float[] data)
public void push_chunk(double[] data, double timestamp, boolean pushthrough)
public void push_chunk(double[] data, double timestamp)
public void push_chunk(double[] data)
public void push_chunk(int[] data, double timestamp, boolean pushthrough)
public void push_chunk(int[] data, double timestamp)
public void push_chunk(int[] data)
public void push_chunk(short[] data, double timestamp, boolean pushthrough)
public void push_chunk(short[] data, double timestamp)
public void push_chunk(short[] data)
public void push_chunk(byte[] data, double timestamp, boolean pushthrough)
public void push_chunk(byte[] data, double timestamp)
public void push_chunk(byte[] data)
public void push_chunk(java.lang.String[] data, double timestamp, boolean pushthrough)
public void push_chunk(java.lang.String[] data, double timestamp)
public void push_chunk(java.lang.String[] data)
public void push_chunk(float[] data, double[] timestamps, boolean pushthrough)
data
- A rectangular array of values for multiple samples.timestamps
- An array of timestamp values holding time stamps for each sample in the data buffer.pushthrough
- Optionally whether to push the chunk through to the receivers instead of buffering it with subsequent samples.
Note that the chunk_size, if specified at outlet construction, takes precedence over the pushthrough flag.public void push_chunk(float[] data, double[] timestamps)
public void push_chunk(double[] data, double[] timestamps, boolean pushthrough)
public void push_chunk(double[] data, double[] timestamps)
public void push_chunk(int[] data, double[] timestamps, boolean pushthrough)
public void push_chunk(int[] data, double[] timestamps)
public void push_chunk(short[] data, double[] timestamps, boolean pushthrough)
public void push_chunk(short[] data, double[] timestamps)
public void push_chunk(byte[] data, double[] timestamps, boolean pushthrough)
public void push_chunk(byte[] data, double[] timestamps)
public void push_chunk(java.lang.String[] data, double[] timestamps, boolean pushthrough)
public void push_chunk(java.lang.String[] data, double[] timestamps)
public boolean have_consumers()
public boolean wait_for_consumers(double timeout)
public LSL.StreamInfo info()


Package io.ciera.runtime.template.util
Interface T
-
- All Known Implementing Classes:
TImpl
public interface T
The T utility provides tools for working with RSL templates. The utility maintains a stack of String buffers. Each buffer accumulates content asappend
andinclude
calls are made. The buffer is cleared whenclear
andbody
calls are made. Multiple buffers can be managed at once on the stack usingpush_buffer
andpop_buffer
calls.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description default void
append(Object o)
Append an object to the current buffer.void
append(String s)
Append a string to the current buffer.String
body()
Clear the current buffer and return the contents as a String.void
clear()
Clear the current buffervoid
emit(String file)
Clear the current buffer and emit the contents to a file specified byfile
.void
include(String file, Object... symbols)
Include an RSL template.void
pop_buffer()
Remove the current buffer and replace it with the next buffer on the buffer stack.void
push_buffer()
Store the current buffer on the buffer stack and replace it with a new buffer.void
set_output_directory(String dir)
Set the root directory for emitting files.default String
sub(String format, Object o)
Perform a format substitution.String
sub(String format, String s)
Perform a format substitution.
-
-
-
Method Detail
-
append
void append(String s)
Append a string to the current buffer.- Parameters:
s
- the string value to append
-
append
default void append(Object o)
Append an object to the current buffer. By default, the object gets converted to a String using the standardtoString
method before being added to the buffer.- Parameters:
o
- the object to append
-
body
String body()
Clear the current buffer and return the contents as a String.- Returns:
- the contents of the buffer
-
clear
void clear()
Clear the current buffer
-
emit
void emit(String file) throws XtumlException
Clear the current buffer and emit the contents to a file specified byfile
.- Parameters:
file
- the name of the output file relative to the configured output directory- Throws:
XtumlException
- if the file cannot be opened for writing- See Also:
set_output_directory(java.lang.String)
-
include
void include(String file, Object... symbols) throws XtumlException
Include an RSL template. The in-scope variables in the location where invoked will be captured and passed as the list ofsymbols
.- Parameters:
file
- the template file to include relative to the root template directorysymbols
- the list of symbols to pass to the template. When invoked from OAL, this list is composed by capturing all in-scope variables in the context where it was invoked.- Throws:
XtumlException
- if an error occurs during template evaluation
-
pop_buffer
void pop_buffer()
Remove the current buffer and replace it with the next buffer on the buffer stack.
-
push_buffer
void push_buffer()
Store the current buffer on the buffer stack and replace it with a new buffer.
-
set_output_directory
void set_output_directory(String dir)
Set the root directory for emitting files.- Parameters:
dir
- the root location for template output
-
sub
String sub(String format, String s) throws XtumlException
Perform a format substitution. The following format characters are supported:u
(upper) - make all characters upper casec
(capitalize) - make the first character of each word capitalized and all other characters of a word lowercasel
(lower) - make all characters lowercase_
(underscore) - change all whitespace characters to underscore charactersr
(remove) - remove all whitespaceo
(corba) - make the first word all lowercase, make the first character of each following word capitalized and all other characters of the words lowercase. Characters other than a-Z a-z 0-9 are ignoredt
(pass-through)
format
parameter will be evaluated as a format character sequentially left to right.- Parameters:
format
- the string of format characters representing operations to performs
- the string to format- Returns:
- a formatted string
- Throws:
XtumlException
- if an invalid format character is passed
-
sub
default String sub(String format, Object o) throws XtumlException
Perform a format substitution. By default, the object gets converted to a String using the standardtoString
method before being passed to thesub
method.- Parameters:
format
- the string of format characters representing operations to performo
- the object to format- Returns:
- a formatted string
- Throws:
XtumlException
- if an invalid format character is passed
-
-


SSSD_KRB5_LOCATOR_PL
Section: SSSD Manual pages (8)Updated: 06/22/2012
Index Return to Main Contents
NAME
sssd_krb5_locator_plugin - the configuration file for SSSDDESCRIPTION
The Kerberos locator plugin sssd_krb5_locator_plugin is used by the Kerberos provider of sssd(8) to tell the Kerberos libraries what Realm and which KDC to use. Typically this is done in krb5.conf(5) which is always read by the Kerberos libraries. To simplify the configuration the Realm and the KDC can be defined in sssd.conf(5) as described in sssd-krb5.conf(5)
sssd(8) puts the Realm and the name or IP address of the KDC into the environment variables SSSD_KRB5_REALM and SSSD_KRB5_KDC respectively. When sssd_krb5_locator_plugin is called by the kerberos libraries it reads and evaluates these variables and returns them to the libraries.
NOTES
Not all Kerberos implementations support the use of plugins. If sssd_krb5_locator_plugin is not available on your system you have to edit /etc/krb5.conf to reflect your Kerberos setup.
If the environment variable SSSD_KRB5_LOCATOR_DEBUG is set to any value debug messages will be sent to stderr.
SEE ALSO
sssd-krb5(5), sssd.conf(5), sssd(8)
AUTHORS
The SSSD upstream - http://fedorahosted.org/sssd
Index
This document was created by man2html, using the manual pages.
Time: 05:34:30 GMT, December 24, 2015


|
| Value |
Description |
Notes |
|
| 01 |
Manifestation of |
Product X is or includes a manifestation of work Y |
| 02 |
Derived from |
Product X is or includes a manifestation of a work derived (directly) from related work Y in one or more of the ways specified
in ISTC rules. This relation type is intended to enable products with a common ‘parent’ work to be linked without specifying
the precise nature of their derivation
|
| 03 |
Related work is derived from this |
Product X is a manifestation of a work from which related work Y is (directly) derived in one or more of the ways specified
in ISTC rules (reciprocal of code 02)
|
| 04 |
Other work in same collection |
Product X is a manifestation of a work in the same collection as related work Y |
| 05 |
Other work by same contributor |
Product X is a manifestation of a work by the same contributor(s) as related work Y |
|


./komodod -ac_name=ZAWY24 -ac_adaptivepow=1 -ac_supply=1000000 -ac_reward=10000000000 -ac_cc=2 -addnode=<IP_ADDRESS> &
A channel to discuss mining. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
Cryptoon07-Dec-18 08:14 PM
@Alecandro there are some pools in the pinned messages, I think komodominingpools also has a notary node (someone correct me if I’m wrong)
ComputerGenie 👴👴👴07-Dec-18 08:46 PM
Inb4 @ComputerGenie 👴👴👴 tells you to solomine
I've, literally, searched the world over and never found a pool that paid me more than my own....
Alecandro07-Dec-18 08:58 PM
Captain_Jack08-Dec-18 03:20 AM
@ComputerGenie 👴👴👴 you set up your own pool? I'm thinking about that...is it worth it with 300kh/s?(edited)
I've got a 4 core vps...going to give it a shot...sounds like a friday night project
Our 2nd raffle is up now for a Z9 mini or $ARRR !
To enter:
-Like this post
-Retweet and tag three friends
-Give us your best slogan for Pirate and our commitment to privacy to win a secret prize
To get credit for this and other entries, visit this link.
https://t.co/rMN...
Likes
106
Give us a follow and entered!
FishyGuts08-Dec-18 06:41 AM
If it’s for pirate @Captain_Jack we are releasing a new mining pool software within a week. May want to wait for that? Yeah @blackjok3r ?
blackjok3r08-Dec-18 06:42 AM
Should already work for sapling
If not I have a pool that does
But it foes not work with pirate
djiwo7508-Dec-18 06:56 AM
Hey there.. Does any1 could help me setup my adroid wallet for bcmonster and the url
For the zcash
FishyGuts08-Dec-18 08:15 AM
Feck me...
 Setting this up again on a VPS running on 4 core with more mem now. @blackjok3r good to know there is new pool version coming soon @FishyGuts
blackjok3r08-Dec-18 08:32 AM
You can use the komodo boot strap to use a lower mem vps
Sorry don't have link on phone
Captain_Jack08-Dec-18 08:34 AM
ok . I'll dig that up...i have a big boy vps for now(edited)
thanks again for your quick response...you are all over this (edited)
FishyGuts08-Dec-18 09:10 AM
This isn't good is it?
@blackjok3r
blackjok3r08-Dec-18 09:14 AM
Need further up
That's not the actual error
FishyGuts08-Dec-18 09:17 AM
cannot allocate memory.
Server too weak?
Captain_Jack08-Dec-18 09:47 AM
~/komodo/src$ ./assetchains
./assetchains: line 5: pubkey.txt: No such file or directory
Alright08-Dec-18 11:28 AM
@Captain_Jack don't run ./assetchains. It will sync all the assetchains that are dpow'd
Which is like 35 chains at least
SHossain08-Dec-18 03:53 PM
@Andrei [ᴬᴸᵀᴾᴼᴼᴸ.ᴾᴿᴼ] Please send me your address to receive sapling ready pool bounty that jl777 offered.
@blackjok3r@webworker01 also please send me your address to receive bounty. jl777 was generous towards you contribution too.
I've tested @blackjok3r's knomp on a test chain and the transition went smooth along with payment.
Well done you all.

This operation is pending. You will be notified when when it has finished.
1
1
1
ComputerGenie 👴👴👴08-Dec-18 04:01 PM
is it just me or does "pouting_cat" look more "angry" than "pouting"?
SHossain08-Dec-18 04:08 PM
i guess, it is both
Andrei [ᴬᴸᵀᴾᴼᴼᴸ.ᴾᴿᴼ]08-Dec-18 05:01 PM
@SHossain Thank you very much! RFpjLt8v9Tqd1gbMmUbjf6391quK5iLCm1
any KMD or assetchain pool-operator that didn't receive yet the Pool-Operator role, post here please.
ComputerGenie 👴👴👴08-Dec-18 07:44 PM
ty
SHossain08-Dec-18 08:48 PM
@Pool-Operator Please update your pool with latest Komodo source which is sapling ready and make sure your pool software is sapling ready too. If you are running assetchain pool as well, after updating Komodo, just restart all the daemons. Remember to this before 15 Decembe. Otherwise, you are risking to go on fork. Please post here once your pool is sapling ready.
1. Navigate to your Komodo directory.
cd ~/komodo
2. Make sure you don't have any changes made to the source and reset it. This will ensure clean source and shouldn't create issue while pulling the latest source in the next step.
git reset --hard
3.  Clean the source directory.
make clean
5. Update the source. (If you’ve made any changes to the source code, this step may not pull the latest source. Please make sure you used the step above to eliminate this issue.)
git pull
6. Fetch updated zcash sapling params
./zcutil/fetch-params.sh
7. Compile the latest binary.
./zcutil/build.sh -j$(nproc)
Start your daemon as usual. (If you have not stopped the Komodo daemon before compiling, please stop the daemon now and start it again.)
8. Verify the update
./Komodo-cli -ac_name=COIN getinfo
Please look for the KMDversion in the output of the above call, which should display:
"KMDversion": "0.3.1",(edited)
any issues regarding update, please post here as well
1
Laviathon -bcmonster.com08-Dec-18 08:49 PM
Done
SHossain08-Dec-18 08:49 PM
Thank you very much.
altpool.pro also updated
@Laviathon -bcmonster.com since you update the code of Komodo, PIRATE and ZEX daemon should be sapling ready too. all you need to do is restart those daemon to run latest.
Laviathon -bcmonster.com08-Dec-18 08:56 PM
Different servers Going to have to do them all.
1
ComputerGenie 👴👴👴08-Dec-18 08:57 PM
are we sure that red is a good color choice?
SHossain08-Dec-18 09:01 PM
i'll change that
changed
1
SHossain08-Dec-18 09:24 PM
@forkwitch@dukeleto@jeezy please update your pools. check the first pinned post for update steps if needed. let's get sapling ready. any questions don't hesitate to ask
Alright08-Dec-18 09:30 PM
@ComputerGenie 👴👴👴 grey best colour
SHossain08-Dec-18 09:33 PM
@ComputerGenie 👴👴👴 is your chickenpool sapling ready?
ComputerGenie 👴👴👴08-Dec-18 09:33 PM
@Alright for me it wasn't a "best" or "worst" thing as much as red kinda implies "watch out this guy might be 'bad'"
Alright08-Dec-18 09:34 PM
chickenpool in production?
ComputerGenie 👴👴👴08-Dec-18 09:35 PM
@SHossain the parts of it work are, yes
I'm in the process of treating it like an improperly healed broken bone (needs to be rebroken in order to reset it properly)
Alright08-Dec-18 09:35 PM
what's the website again?
ComputerGenie 👴👴👴08-Dec-18 09:35 PM
the website for chickenpool is chickenpool.com
SHossain08-Dec-18 09:35 PM
ok. i take it that you will be sapling ready completely before the fork happens
Jules - coinblockers.com08-Dec-18 09:37 PM
What’s a sapling ready pool bounty?
ComputerGenie 👴👴👴08-Dec-18 09:38 PM
yes, KMD and "normal" assetchains will be 100% ready before the 15th and functioning on the 15th
the private-only and other feature mods that I have in store may or may not be ready by then
@Jules - coinblockers.com there was a bounty to the 1st person that had a sapling ready test pool running
Jules - coinblockers.com08-Dec-18 09:38 PM
Oh wow
How could I miss that
ComputerGenie 👴👴👴08-Dec-18 09:39 PM
it only lasted like 50 minutes before it was claimed
may have been a bit longer but definitely less than a few hrs(edited)
SHossain08-Dec-18 09:44 PM
Any pool becomes sapling ready, please let me know(edited)
Jules - coinblockers.com08-Dec-18 09:45 PM
Will do, if I have some minutes later when arriving at home.
SHossain08-Dec-18 09:45 PM
Thanks. take your time
let us know if you need any help.
plenty of sapling ready operators are here to help
Jules - coinblockers.com08-Dec-18 09:46 PM
Not for node variant
But if someone is good in C, ckpool could need some adoption of new coins
SHossain08-Dec-18 09:47 PM
who runs komodopool.com?
ComputerGenie 👴👴👴08-Dec-18 09:47 PM
@Jules - coinblockers.com there is a version of that in the works, but mine will not be done before likely March
SPLNS specifically
Jules - coinblockers.com08-Dec-18 09:48 PM
Rly? I just was gonna start to jump in it. Another option I was thinking about is the btc.com pool backend
And Miningcore was not my fav of all options.
ComputerGenie 👴👴👴08-Dec-18 09:49 PM
I haven't put too much work into it yet because like all things ck it lacks frontend and I am soooo not a ui guy
Jules - coinblockers.com08-Dec-18 09:49 PM
UI shouldn’t be a problem
If the API works properly
ComputerGenie 👴👴👴08-Dec-18 09:50 PM
obviously you've not seen my attempts
Jules - coinblockers.com08-Dec-18 09:51 PM
What UI you prefer? I’ve seen ck uses php, I’m more thinking about something more flexible like node
But php will do aswell if you use some more modern framework
ComputerGenie 👴👴👴08-Dec-18 09:53 PM
I haven't given it too much thought I'm still tweeking a few things in the SPLNS section and trying to figure out how to explain it to people (it tends to confuse a lot of folks almost instantly)
Jules - coinblockers.com08-Dec-18 09:56 PM
Shouldn’t matter unless it pays fair
ComputerGenie 👴👴👴08-Dec-18 09:58 PM
Shouldn’t matter unless it pays fair
imo, the rampdown is too long
NutellaLicka08-Dec-18 11:26 PM
Anyone know why I'd be getting -bash: ./komodo-cli: No such file or directory in my /komodo/src directory after updating to master branch
SHossain08-Dec-18 11:26 PM
compile again
that means, compiling didnt' work
just run ./zcutil/build.sh -j$(nproc) again
NutellaLicka08-Dec-18 11:30 PM
thanks
I am not required to stop my daemon prior to compiling, correct?


Gazeify is a SDK service that processes visual and haptic data into statistical user engagement metrics. Software designers and developers are able to use this SDK to improve the overall experience of their mobile applications
Experienced the most innovative and convenient way to scale up your mobile application business
No addtional hardware, simple front camera on your phone is all!
Capure users eye motion and predict with heatmap on your app screen!
Access our analytical dashboard to know your users‘ taste!
From SDK to Web, we protect your security!
We are growing fast! Tell us any questions, opportunities or your favorite music!


Tip: Press the "Esc" key to exit full screen.
Note: Internet Explorer 10 and earlier does not support fullscreen mode.


Hancock, Maine
Hancock Heights
ESTATES
Hancock, Maine
ESTATES
Three single-floor buildings with three units each, completed in Fall 2018, feature two bedrooms, one bathroom, and maintenance free living.
This 1984 high quality Oxford home has been well maintained.
It's convenient location at Hancock Heights Estates on Route 1 just outside of
Ellsworth provides the safety of a community and the services. Mowing, plowing,
water, sewer and trash disposal are included in monthly lot rent of $390.
2
Bedrooms, 1 Bath. Washer and dryer and other appliances included. New Heat pump
provides for cooling and heating. New storage shed. Recently painted inside and
new flooring throughout. New skirting. Paved parking for two vehicles. No large
dogs. Call Naomi at<PHONE_NUMBER>.
New lots at Hancock Heights are being developed for homes purchased from us, but we also sell homes to be located outside Hancock Heights.


There was an enticing news item on the radio this morning. Here are the bare bones of the story—no doubt further details are available in the newspapers, but I don't really want to know. This has a beauty of its own:
A brain surgeon at a British hospital has been suspended from duty. His crime? He took a second helping of soup from the staff canteen and did not pay for it. His defence? He was just getting some extra croutons. The matter has been raised in the House of Lords.


| File | Statements | Branches | Functions | Lines | |||||
|---|---|---|---|---|---|---|---|---|---|
| compiler.js | 84.13% | 53/63 | 76.32% | 29/38 | 90% | 9/10 | 85.25% | 52/61 | |
| date-formatter.js | 100% | 23/23 | 100% | 2/2 | 100% | 12/12 | 100% | 23/23 | |
| date-parser.js | 97.16% | 171/176 | 94.79% | 91/96 | 97.5% | 39/40 | 98.14% | 158/161 | |
| debounce.js | 96.67% | 29/30 | 62.5% | 10/16 | 100% | 8/8 | 96.55% | 28/29 | |
| dimensions.js | 87.8% | 72/82 | 81.03% | 47/58 | 100% | 9/9 | 88.89% | 72/81 | |
| parse-options.js | 97.73% | 43/44 | 75% | 9/12 | 100% | 9/9 | 97.73% | 43/44 | |
| raf.js | 7.14% | 1/14 | 15.38% | 2/13 | 0% | 0/5 | 7.14% | 1/14 |


Technology inspired Invitation to interview panel
You have been invited to the interview panel for Technology inspired on 27 July 2017.
Innovate UK is to invest up to £9 million in Technology inspired.
Please review the details of this competition before the interview panel.
Are you able to attend the interview panel?
You should reject this invitation if you are unavailable.


Tracking physcially world, and map it in the virtual timeline.
Cipher and Decipher classical and modern cryptography.


Start from Scratch (start with a blank form)
Load from File (load a file from your computer)
Load from Submitted Dataset UDI:
Load from External URL URL: