YouTube video uploads using the Scala Play Framework
I didn't see anything on Stack Overflow or the Internet that worked and I hope this would help if anyone was looking for something.
I used the "offline" pattern because I wanted to allow users to upload to a single YouTube account that I had setup for the website.
Three to this process:
- site would need to authenticate with Googlbe, obtain the OAuth2 access and especially refresh tokens, and store these in database;
- whenever user wants to upload a video, site would need to: a) check if the access token from 1 has expired, if it has, obtain a new one using the refresh token (won't need any re-authentication); b) with the access token, upload the video to YouTube
To do 1, an admin page signs in to YouTube to obtain an authentication code:
def signInUrl: String = {
val state = UUID.randomUUID()
val parameters = Map(
"client_id" -> clientId,
"redirect_uri" -> redirectUri,
"scope" -> "https://www.googleapis.com/auth/youtube.upload",
"response_type" -> "code",
"state" -> state,
"access_type" -> "offline")
val queryString = parameters.map(p => s"${p._1}=${p._2}").mkString("&")
s"$authUrl?$queryString"
}
Then obtain the OAuth2 access and refresh tokens using the code from above:
def newTokens(code: String): Future[Tokens] = {
for {
accessResponse <- WS.url(tokenUrl)
.post(Map("client_id" -> Seq(clientId),
"client_secret" -> Seq(clientSecret),
"grant_type" -> Seq("authorization_code"),
"code" -> Seq(code),
"redirect_uri" -> Seq(redirectUri)))
} yield {
// TODO: the below is for the offline pattern...
// for online, we'd add it to user's request object
println(s"New tokens JSON: ${accessResponse.json}")
val tokens = accessResponse.json.as[Tokens]
println(s"New tokens: $tokens")
// TODO: use database instead of a variable here?
this.tokens = Some(tokens)
tokens
}
}
Store the access, expires and refresh tokens to database.
To do 2(a), the upload page checks if the access token has expired and refresh it if necessary:
def refreshToken(tokens: Tokens): Future[Tokens] = {
if (tokens.expires.getTime > System.currentTimeMillis()) {
Future.successful(tokens)
} else {
for {
r <- WS.url(tokenUrl)
.post(Map("client_id" -> Seq(clientId),
"client_secret" -> Seq(clientSecret),
"grant_type" -> Seq("refresh_token"),
"refresh_token" -> Seq(tokens.refreshToken.get)))
} yield {
r.json.as[Tokens]
}
}
}
To do 2(b), upload video with the access token, using YouTube's two-part process of firstly obtaining the URL to upload to and then uploading to the URL:
def upload(video: File, details: VideoDetails): Future[JsValue] = {
for {
// NOTE: using stored tokens for the offline pattern...
// for online pattern, we'd get it from user's request object
tokens <- refreshToken(this.tokens.get)
upload <- WS.url(uploadUrl)
.withHeaders("Authorization" -> s"Bearer ${tokens.accessToken}")
.withQueryString("uploadType" -> "resumable", "part" -> "status, snippet")
.post(Json.obj(
"snippet" -> Json.obj(
"title" -> details.title,
"description" -> details.description
),
"status" -> Json.obj(
"privacyStatus" -> "private"
)))
location = upload.header("location").get
meta <- WS.url(location)
.withHeaders("Authorization" -> s"Bearer ${tokens.accessToken}")
.post(video)
} yield {
this.tokens = Some(tokens)
meta.json
}
}
Hope this helps.


JDon.org
Component/Service Quick Start
writer : banq jegg
Sample DEMO: http://www.jdon.com/testWeb/
Sample Source Download: click here(samples-simple.jar)
The first Jdon Application
Only need two annotations(@Service or @Component):
@Service("helloService")
public class HelloServiceImpl implements HelloService
..
the client call the service's code:
HelloService helloService = (HelloService) WebAppUtil.getService("helloService", req);
String result = helloService.hello(myname);
all source in JdonFramework/examples/testWeb
More Annotation
@Poolable: get a instance from the class's object pooing, Object Pooling - Determinism vs. Throughput
@Stateful:its instance lifecycle is user session scope
@Singleton: get a singleton instance form the class
ABC
In JdonFramework, there is a configuration XML file that named jdonframework.xml. in it, we can configure our class, the format as below:
<pojoService name="your service name " class="full class "/>
or
@Service("your service name")
"class" is the class full name, include the package; "name" can be any text that will be used in our client code.
if we have a class TestServicePOJOImp as below:
@Poolable
//@Service("testService")
public class TestServicePOJOImp implements TestService{
private JdbcDAO jdbcDao;
public TestServicePOJOImp(JdbcDAO jdbcDao) {
this.jdbcDao = jdbcDao;
}
public void createUser(EventModel em) {
....
}
}
interface TestService code:
public interface TestService {
void createUser(EventModel em);
}
|
when we finished these codes, we need create a XML file that named jdonframework.xml under project source directotry:
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE app PUBLIC "-//JDON//DTD Framework 2005 1.0 //EN" "http://www.jdon.com/jdonframework.dtd">
<app>
<services>
<pojoService name="testService" class="com.jdon.framework.test.service.TestServicePOJOImp"/>
</services>
</app>
|
at last, if we invoke TestServicePOJOImp in client code such as Jsp/Servlet or struts action,the invoking code as below:
TestService testService = (TestService) WebAppUtil.getService("testService ", request);
testService.createUser(em);
|
so the good point is that: if we replace TestServicePOJOImp with AnotherTestServicePOJOImp , only need modify jdonframework.xml, not need change our client codes.
thera is another big good point that Ioc or DI means Dependency Injection, maybe you have find a details about TestServicePOJOImp that it has a constructor method:
public TestServicePOJOImp(JdbcDAO jdbcDao) {
this.jdbcDao = jdbcDao;
}
if we donot create the JdbcDAO instance, how can we create TestServicePOJOImp instance?don't worry, the framework help us and it do these, but we need add a new configuration item in jdonframework.xml, as below:
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE app PUBLIC "-//JDON//DTD Framework 2005 1.0 //EN" "http://www.jdon.com/jdonframework.dtd">
<app>
<services>
<pojoService name="testService" class="com.jdon.framework.test.service.TestServicePOJOImp"/>
<!-- new configuration item or annotation @Component in JdbcDAO class -->
<component name="jdbcDAO" class="com.jdon.framework.test.dao.JdbcDAO"/>
</services>
</app>
|
until now, you maybe have understand JdonFramework what to do.
How starting the framework?
there are two ways to starting the framework in our web project.
first way: web.xml configuration:
<context-param>
<param-name> modelmapping-config </param-name>
<param-value> jdonframework.xml </param-value>
</context-param>
……
<listener>
<listener-class>com.jdon.container.startup.ServletContainerListener</listener-class>
</listener>
|
second way: struts-config.xml(you must know struts 1.2)
<plug-in className="com.jdon.strutsutil.InitPlugIn">
<set-property property="modelmapping-config" value="jdonframework.xml" />
</plug-in>
|
Mor DEATILS
Startup the jdonframework
When using jdon framework at first time, you need to get it started in project application, since jdon’s CRUD development functions are built on struts1.2, so if you want to utilize this part of function, you need to employ InitPlugIn built in Struts to start up jdonframework.xml
At present, JDon has integrated with Struts’ presentation layer, so you can start up jdonframework.xml by using plugin in struts. The advantage of doing this is that you can implement the multi-module development with struts. A struts project may contain several function modules. Every function module is got involved in several other components from web page presentation (struts configuration and tiles configuration), module design to server side persistency. Jdon can start up jdonframework.xml by using plugin in struts to support this kind of multi-modlue development.
Configuration method 1:
Jdon framework has provided a default implementing class to plugin which is com.jdon.strutsutil.IniPlugIn, you can also implement plugin by the needs of you own. In struts-config.xml (or other struts module configuration files such as struts-config-admin.xml and so on), you can configure plugin’s implementing class:
Please see the following configuration snippet.
<plug-in className="com.jdon.strutsutil.InitPlugIn">
<set-property property="modelmapping-config" value="jdonframework.xml" />
</plug-in> |
The main purpose of InitPlugIn class is to read the modelmapping-config’s value which is the name of jdonframework configuration file defined by you.
File name could be arbitrary, for example, you can use news.jdonframework.xml to represent that jdonframework.xml is under the package news. com.jdon.app.myframework.xml is representing that myframework.xml is under the package com.jdon.app.
Usually, you can put jdonframework.xml in the web application’s class path, for example, WEB-INF/classess.
You can configure more then one jdonfremework.xml in plugin like the following:
<plug-in className="com.jdon.strutsutil.InitPlugIn">
<set-property property="modelmapping-config"
value="com.jdon.framework.test.model.models.xml,
com.jdon.framework.test.service.services.xml,
com.jdon.framework.test.dao.dao.xml" />
</plug-in> |
Also, you can set them within their struts-config.xml files respectively.
Configuration method 2
If you are not using struts, you can start up jdon framework by setting web.xml. Here is an example.
<context-param>
<param-name> modelmapping-config </param-name>
<param-value> jdonframework.xml </param-value>
</context-param>
……
<listener>
<listener-class>com.jdon.container.startup.ServletContainerListener</listener-class>
</listener>
|
Param-value in the above example could have more than one value separated by commons like the following:
<context-param> <param-name>modelmapping-config </param-name> <param-value>com.jdon.framework.test.model.models.xml, com.jdon.framework.test.service.services.xml, com.jdon.framework.test.dao.dao.xml</param-value> </context-param>
|
models.xml and services.xml dao.xml are multi configuration, sample see JiveJdon3.0
Please note, if you are not using struts, com.jdon.framework.test.model.models.xml within para-name is invalid, yet com.jdon.framework.test.service.services.xml is still valid, which is set component container that you can also regard it as components.
Interceptor configuration
when you develope a interceptor,
you need this step.
When Jon framework is starting up, it will use container.xml and aspect.xml under META-INF in jdonframework.jar by default. If you need to extend Jdon framework, for example, you have developed some small components, such as formula functions, chart components or some general functions and you need load these components as starting up, or expect them configurable and replaceable as our wish, you can integreated them into jdon. There are two ways to go. (It is not the must)
First Step :
define you own component configuration file and interceptor component configuration file, which name much be mycontainer.xml and myaspect.xml, these two files must be put in the system class path or packed in your jar file, this jar file could also be deployed together with jdon framework’s jar file
Second Step:
You can define it in web.xml in your web application, here is an example:
<context-param>
<param-name>containerConfigure</param-name>
<param-value>WEB-INF/mycontainer.xml</param-value>
</context-param>
……
<context-param>
<param-name>aspectConfigure</param-name>
<param-value>WEB-INF/myaspect.xml</param-value>
</context-param>
|
So your mycontainer.xml file and myaspect.xml file must be put in WEB_INF directory in your web application, yet file names could be arbitrary. In User-defined configuration file, corresponding settings in container.xml and aspect.xml could be overwritten; however the setting name should be the same.
Jdonframework configuration
In this article, I am going to show you how to get job done within jdonframework.xml for class testService.
We called a class instance invoked by client (Servlet/Jsp/Action) as below.
TestService testService = (TestService) WebAppUtil.getService("testService", request); |
"testService" is the class name of "TestService". it should be configured in jdonframework.xml
<pojoService name="testService" class="com.jdon.framework.test.service.TestServicePOJOImp"/>
|
There are two types of service class. One is common java class or JavaBeans, all of which called POJO. The other is EJB-regulation-complied classes which could be simply called EJB. Any of these two type class could be used as service class, hence there will be two corresponding service configurations for POJO and EJB done by pojoService and ejbService respectively.
POJOs configuration
There are two basic properties in pojoService, name and class. Property class is for putting POJO’s full name. Property Name is used to put the actual service name invoked in the program, conventionally written as similarly to the class name. Please see the source code in JdonFrameworkEJB or Ioc under Traning directory of JdonSample.
POJO Service configuration:
<pojoService name="testService" class="com.jdon.framework.test.service.TestServicePOJOImp"/>
|
Not all of classes are servered for the client directly (jsp/Servlet), that is to say some classes are not invoked by jsp/servlet or presentation frame layer, but invoked by service classes, these kinds of class we called component class annotated as component in configuration file. Note: in EJB framework, component class is managed by EJB container, so you do not need to any configuration in JdonFramework any more.
POJO Component configuration:
<component class="com.jdon.framework.test.dao.JdbcDAO" name="jdbcDAO"/>
|
We often need to define some constants and parameters in some classes, so we can do like this:
<component class="com.jdon.framework.test.dao.JdbcDAO" name="jdbcDAO">
<constructor value="java:/TestDS"/>
</ component >
|
As you can see, JdbcDao’s constructor has a string parameter. When you initialize an instance of JdbcDao, String “java:/TestDs”(DataSource JNDI Name) will be passed into constructor automatically.
By taking advantage of good point above, we can conveniently utilize xml file to define business logic. For example, we can defined the email format in jdonframework.xml so that email content could be altered easily according the customers’ needs. It is much better and flexible than get this information hard coded in the program.
Here is an example:
<component name="emailDefine"
class="com.jdon.jivejdon.service.imp.account.EmailDefine">
<constructor value="Jdon username and password"/>
<constructor value="Welcome on jdon.com. Your account has been validated. Thank you!"/>
<constructor value="Jdon.com "/>
<constructor value="Thank you, Jdon team."/>
<constructor<EMAIL_ADDRESS></component>
|
|


See: Description
| Class | Description |
|---|---|
| CanonMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
CanonMakernoteDirectory . |
| CanonMakernoteDirectory |
Describes tags specific to Canon cameras.
|
| CanonMakernoteDirectory.AFInfo | |
| CanonMakernoteDirectory.CameraSettings | |
| CanonMakernoteDirectory.FocalLength | |
| CanonMakernoteDirectory.Panorama | |
| CanonMakernoteDirectory.ShotInfo | |
| CasioType1MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
CasioType1MakernoteDirectory . |
| CasioType1MakernoteDirectory |
Describes tags specific to Casio (type 1) cameras.
|
| CasioType2MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
CasioType2MakernoteDirectory . |
| CasioType2MakernoteDirectory |
Describes tags specific to Casio (type 2) cameras.
|
| DataFormat |
An enumeration of data formats used in the TIFF IFDs.
|
| ExifIFD0Descriptor |
Provides human-readable string representations of tag values stored in a
ExifIFD0Directory . |
| ExifIFD0Directory |
Describes Exif tags from the IFD0 directory.
|
| ExifInteropDescriptor |
Provides human-readable string representations of tag values stored in a
ExifInteropDirectory . |
| ExifInteropDirectory |
Describes Exif interoperability tags.
|
| ExifReader |
Decodes Exif binary data, populating a
Metadata object with tag values in ExifSubIFDDirectory ,
ExifThumbnailDirectory , ExifInteropDirectory , GpsDirectory and one of the many camera makernote directories. |
| ExifSubIFDDescriptor |
Provides human-readable string representations of tag values stored in a
ExifSubIFDDirectory . |
| ExifSubIFDDirectory |
Describes Exif tags from the SubIFD directory.
|
| ExifThumbnailDescriptor |
Provides human-readable string representations of tag values stored in a
ExifThumbnailDirectory . |
| ExifThumbnailDirectory |
One of several Exif directories.
|
| FujifilmMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
FujifilmMakernoteDirectory . |
| FujifilmMakernoteDirectory |
Describes tags specific to Fujifilm cameras.
|
| GpsDescriptor |
Provides human-readable string representations of tag values stored in a
GpsDirectory . |
| GpsDirectory |
Describes Exif tags that contain Global Positioning System (GPS) data.
|
| KodakMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
KodakMakernoteDirectory . |
| KodakMakernoteDirectory |
Describes tags specific to Kodak cameras.
|
| KyoceraMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
KyoceraMakernoteDirectory . |
| KyoceraMakernoteDirectory |
Describes tags specific to Kyocera and Contax cameras.
|
| NikonType1MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
NikonType1MakernoteDirectory . |
| NikonType1MakernoteDirectory |
Describes tags specific to Nikon (type 1) cameras.
|
| NikonType2MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
NikonType2MakernoteDirectory . |
| NikonType2MakernoteDirectory |
Describes tags specific to Nikon (type 2) cameras.
|
| OlympusMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
OlympusMakernoteDirectory . |
| OlympusMakernoteDirectory |
The Olympus makernote is used by many manufacturers (Konica, Minolta and Epson...), and as such contains some tags
that appear specific to those manufacturers.
|
| PanasonicMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
PanasonicMakernoteDirectory . |
| PanasonicMakernoteDirectory |
Describes tags specific to Panasonic and Leica cameras.
|
| PentaxMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
PentaxMakernoteDirectory . |
| PentaxMakernoteDirectory |
Describes tags specific to Pentax and Asahi cameras.
|
| SigmaMakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
SigmaMakernoteDirectory . |
| SigmaMakernoteDirectory |
Describes tags specific to Sigma / Foveon cameras.
|
| SonyType1MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
SonyType1MakernoteDirectory . |
| SonyType1MakernoteDirectory |
Describes tags specific to Sony cameras that use the Sony Type 1 makernote tags.
|
| SonyType6MakernoteDescriptor |
Provides human-readable string representations of tag values stored in a
SonyType6MakernoteDirectory . |
| SonyType6MakernoteDirectory |
Describes tags specific to Sony cameras that use the Sony Type 6 makernote tags.
|
Copyright © 2003-2012 Drew Noakes. All Rights Reserved.


-
Initial Patient Population =
- AND: "Patient Characteristic Birthdate: birth date" >= 18 year(s) starts before start of "Measurement Period"
- AND:
- OR: "Occurrence A of Procedure, Performed: Primary THA Procedure" <= 180 day(s) ends before start of "Measurement Period"
- OR: "Occurrence A of Procedure, Performed: Primary THA Procedure" <= 185 day(s) ends after start of "Measurement Period"
- AND:
- OR:
- AND: "Encounter, Performed: Outpatient Consultation" <= 180 day(s) ends before start of "Occurrence A of Procedure, Performed:
Primary THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Outpatient Consultation" >= 60 day(s) ends after end of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Outpatient Consultation" <= 180 day(s) ends after end of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- OR:
- AND: "Encounter, Performed: Face-to-Face Interaction" <= 180 day(s) ends before start of "Occurrence A of Procedure, Performed:
Primary THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Face-to-Face Interaction" >= 60 day(s) ends after end of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Face-to-Face Interaction" <= 180 day(s) ends after end of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- OR:
- AND: "Encounter, Performed: Office Visit" <= 180 day(s) ends before start of "Occurrence A of Procedure, Performed: Primary
THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Office Visit" >= 60 day(s) ends after end of "Occurrence A of Procedure, Performed:
Primary THA Procedure"
- AND: "Occurrence B of Encounter, Performed: Office Visit" <= 180 day(s) ends after end of "Occurrence A of Procedure, Performed:
Primary THA Procedure"
-
Denominator =
- AND: "Initial Patient Population"
-
Denominator Exclusions =
- AND:
- OR:
- AND: "Occurrence A of Diagnosis, Active: Fracture - Lower Body" < 1 day(s) starts before start of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- AND: "Occurrence A of Diagnosis, Active: Fracture - Lower Body" >= 1 hour(s) ends after start of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- AND: "Occurrence B of Diagnosis, Active: Fracture - Lower Body" < 1 day(s) starts before start of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- AND: "Occurrence B of Diagnosis, Active: Fracture - Lower Body" >= 1 hour(s) ends after start of "Occurrence A of Procedure,
Performed: Primary THA Procedure"
- OR:
- AND NOT: "Diagnosis, Active: Severe Dementia" ends before start of "Measurement Period"
- AND: "Diagnosis, Active: Severe Dementia" starts before or during "Measurement Period"
-
Numerator =
- AND: "Functional Status, Result: Functional Status Assessment for Hip Replacement" <= 180 day(s) ends before start of "Occurrence
A of Procedure, Performed: Primary THA Procedure"
- AND: "Occurrence B of Functional Status, Result: Functional Status Assessment for Hip Replacement" >= 60 day(s) ends after
end of "Occurrence A of Procedure, Performed: Primary THA Procedure"
- AND: "Occurrence B of Functional Status, Result: Functional Status Assessment for Hip Replacement" <= 180 day(s) ends after
end of "Occurrence A of Procedure, Performed: Primary THA Procedure"
-
Denominator Exceptions =
-
"Diagnosis, Active: Fracture - Lower Body" using "Fracture - Lower Body Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>7)"
-
"Diagnosis, Active: Severe Dementia" using "Severe Dementia Grouping Value Set (2.16.840.1.113883.3.526.3.1025)"
-
"Encounter, Performed: Face-to-Face Interaction" using "Face-to-Face Interaction Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>8)"
-
"Encounter, Performed: Office Visit" using "Office Visit Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>1)"
-
"Encounter, Performed: Outpatient Consultation" using "Outpatient Consultation Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>8)"
-
"Functional Status, Result: Functional Status Assessment for Hip Replacement" using "Functional Status Assessment for Hip Replacement Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>9)"
-
"Patient Characteristic Birthdate: birth date" using "birth date LOINC Value Set (2.16.840.1.113883.3.560.100.4)"
-
"Procedure, Performed: Primary THA Procedure" using "Primary THA Procedure Grouping Value Set (2.16.840.1.113883.3.464.1<IP_ADDRESS>6)"
-
"Patient Characteristic Ethnicity: Ethnicity" using "Ethnicity CDC Value Set (2.16.840.1.114<IP_ADDRESS>7)"
-
"Patient Characteristic Payer: Payer" using "Payer Source of Payment Typology Value Set (2.16.840.1.114<IP_ADDRESS>91)"
-
"Patient Characteristic Race: Race" using "Race CDC Value Set (2.16.840.1.114<IP_ADDRESS>6)"
-
"Patient Characteristic Sex: ONC Administrative Sex" using "ONC Administrative Sex Administrative Sex Value Set (2.16.840.1.1137<IP_ADDRESS>)"


By William Shakespeare
All that glitters is not gold - The Merchant of Venice
Amazon
Myntra
Ajio
Amazon
Myntra
Ajio
This is a link to GitHub!


Foundation
Foundation is the most advanced responsive front-end framework in the world. You can quickly prototype and build sites or apps that work on any kind of device with Foundation, which includes layout constructs (like a fully responsive grid), elements and best practices.
To get started, check out http://foundation.zurb.com/docs
Quickstart
To get going with Foundation you can:
- Download the latest release
- Install with Bower:
bower install foundation
- Install with npm:
npm install foundation-sites
Documentation
Foundation uses Assemble.io and Grunt to generate its documentation pages. Documentation can also be run from your local computer:
View documentation locally
You'll want to clone the Foundation repo first and install all the dependencies. You can do this using the following commands:
git clone git@github.com:zurb/foundation.git
cd foundation
npm install -g grunt-cli bower
npm install
bower install
bundle install
Then just run grunt build
and the documentation will be compiled:
foundation/
├── dist/
│ └── ...
├────── docs/
│ └── ...
Copyright (c) 2015 ZURB, inc.


A Review of The Leprechaun Companion
The Leprechaun Companion is a wonderfully illustrated and imaginative book. It was written by Nigel Suckling, though you would be hard-pressed to actually find a copy with that name on it. He wrote this particular book under the pen name, Niall Macnamara, the name given to him by the leprechauns.
I originally purchased this book in order to read a bit more about Magpie, a modern variation of brandub. Brandub is an Irish variant of hneftafl played on a 7x7 board. The author takes brandub and reimagines it with a leprechaun theme. The king is replaced with a leprechaun who is only allowed to move one space at a time due to the weight of his pot of gold. The defenders are the leprechaun’s friends assisting him to escape to a corner and the attackers are thieves trying to steal the gold. Gameplay is essentially the same as brandub with this exception (one space moves for the king piece) and the leprechaun needs to be surrounded on 4 sides in order to be captured (or 3 sides if standing next to the central square, corner squares or edge).
This book turned out to be a pleasant surprise. Not only did it contain this cute backstory about Magpie (the leprechaun’s favorite game), it also included a comprehensive set of rules with diagrams and two beautiful usable boards in the inside covers (you will need to provide your own pieces).
The chapters are filled with delightful illustrations and stories about these magical little creatures. The author brings you into a world where fairies are real and you better pay attention to the leprechaun living in your house. Though not exactly a children’s book, the mix of fantasy, history and Irish folklore will certainly entertain the child in you.


Instances
Original file location http://gl.iphix.net/files.htm
by SAMBUICHI Professional Engineer's Office
This page is generaed with jQuery


Various R programming tools for model fitting.
| Version: | 2.18.1 |
| Depends: | R (≥ 1.9.0) |
| Imports: | MASS, gdata |
| Suggests: | gplots, gtools, Matrix, nlme, lme4 (≥ 0.999999-0) |
| Published: | 2018-06-25 |
| Author: | Gregory R. Warnes, Ben Bolker, Thomas Lumley, and Randall C Johnson. Contributions from Randall C. Johnson are Copyright (2005) SAIC-Frederick, Inc. Funded by the Intramural Research Program, of the NIH, National Cancer Institute, Center for Cancer Research under NCI Contract NO1-CO-12400. |
| Maintainer: | Gregory R. Warnes <greg at warnes.net> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Materials: | NEWS ChangeLog |
| In views: | Multivariate, SocialSciences |
| CRAN checks: | gmodels results |
| Reference manual: | gmodels.pdf |
| Package source: | gmodels_2.18.1.tar.gz |
| Windows binaries: | r-devel: gmodels_2.18.1.zip, r-release: gmodels_2.18.1.zip, r-oldrel: gmodels_2.18.1.zip |
| OS X binaries: | r-release: gmodels_2.18.1.tgz, r-oldrel: gmodels_2.18.1.tgz |
| Old sources: | gmodels archive |
| Reverse depends: | NominalLogisticBiplot |
| Reverse imports: | CADStat, oii, pamm, papeR, spdep, tableone |
| Reverse suggests: | httk, RcmdrPlugin.NMBU, Sleuth2, Sleuth3, vcdExtra |
Please use the canonical form https://CRAN.R-project.org/package=gmodels to link to this page.


{% macro _change_type_confirmation(type) %} {% trans -%} Changing the event type to {{ type }} will change the look of the event page and may disable some features not available for the new event type. {%- endtrans %} {% endmacro %} {% macro _render_change_event_type(event, event_types) %}


Niamh Mulcahy off to New York ahead of perfect match with Ger Brennan
These are exciting times for Niamh Mulcahy.
Earlier this month, she collected a Liberty Insurance Camogie All-Star — her first after 15 years of breaking scoring records with Limerick.
That award, in turn, has led to this week’s trip to New York where she will play alongside the best and brightest talents the sport has to offer.
The celebrations won’t end there, with Mulcahy set to marry Clare football legend Gary Brennan next month.
Mulcahy though is keen to share the glory of that All-Star statuette: “Getting the All-Star has probably made other people a lot more happy than it has made me.
“My parents are delighted, club managers and trainers over the years, coaches and managers with Limerick over the years from underage through to senior, “ said Mulcahy who was Young Player of the Year in 2007.
But Mulcahy admits that there is one bonus of being an All-Star winner this weekend.
“I was fortunate enough to get to go to Madrid two years ago when there were a lot of double All-Stars with Cork and Kilkenny.
It’s probably a bit nicer this year, having an award, you don’t feel as much as a fraud going!
“It’s brilliant and Gaelic Park is synonymous with GAA outside of Ireland. I’ve relations in New York that are involved and they’re looking forward to the game as well.”
Another member of the travelling party, Kilkenny’s Edwina Keane got married last weekend. And Mulcahy admits she is relishing her own big day.
“Once Gary is there to meet me at the altar, it’s all done now,” she says with a smile.


|
%%(G \circ F)(\vec{X})%%
|
Functions | |
| float | gofxmath::NormalizeAngle (float angle) |
| Normalize the angle to the range of [-PI,PI). More... | |
| float | gofxmath::FastSinApprox (float angle) |
| Fast sine approximation. More... | |
| float | gofxmath::FastCosApprox (float angle) |
| Fast cosine approximation. More... | |
| float | gofxmath::FastTanApprox (float angle) |
| Fast tangent approximation. More... | |
| float | gofxmath::FastCotApprox (float angle) |
| Fast cotangent approximation. More... | |
| template<FloatPrecision precisionLevel = FloatPrecision::HIGH> | |
| float | gofxmath::SinApprox (float angle) |
| Sine Approximation. More... | |
| template<FloatPrecision precisionLevel = FloatPrecision::HIGH> | |
| float | gofxmath::CosApprox (float angle) |
| Cosine approximation. More... | |
| template<FloatPrecision precisionLevel = FloatPrecision::HIGH> | |
| float | gofxmath::TanApprox (float angle) |
| Tangent approximation. More... | |
| template<FloatPrecision precisionLevel = FloatPrecision::HIGH> | |
| float | gofxmath::CotApprox (float angle) |
| Cotangent Approximation. More... | |
| template<FloatPrecision precision = FloatPrecision::HIGH> | |
| bool | gofxmath::ApproxEqual (float left, float right) |
| Check for approximate equality of two floating point numbers. More... | |
| bool | gofxmath::IsNaN (float val) |
| Check if the given float value is NaN. More... | |
| bool | gofxmath::IsInfinity (float val) |
| Check if the given float value is positive or negative infinity. More... | |
|
inline |
Check for approximate equality of two floating point numbers.
| precision | The precision level to use for the approximation. |
| left | The left float. |
| right | The right float. |
|
inline |
Cosine approximation.
| precisionLevel | The precision level to use for the approximation. |
| angle | The angle for which to approximate the cosine. |
|
inline |
Cotangent Approximation.
| precisionLevel | The precision level to use for the approximation. |
| angle | The angle for which to approximate the cotangent. |
|
inline |
Fast cosine approximation.
| angle | The angle for which to approximate the cosine. |
|
inline |
Fast cotangent approximation.
| angle | The angle to calculate the cotangent. |
|
inline |
Fast sine approximation.
| angle | The angle to approximate the sine for. |
|
inline |
Fast tangent approximation.
| angle | The angle for which to approximate the tangent. |
|
inline |
Check if the given float value is positive or negative infinity.
| val | The float value to check. |
|
inline |
Check if the given float value is NaN.
| val | The float value to check. |
|
inline |
Normalize the angle to the range of [-PI,PI).
| angle | The angle to normalize. |
|
inline |
Sine Approximation.
| precisionLevel | The precision level to use for the approximation. |
| angle | The angle for which to approximate the sine. |
|
inline |
Tangent approximation.
| precisionLevel | The precision level to use for the approximation. |
| angle | The angle for which to approximate the tangent. |


Assignment6
HW6_2015.pdf
assignment6.Rmd
assignment6.docx
assignment6.html
assignment6.md
assignment6.pdf
case0702.csv


--- tags: - 基础算法-二分 - DP-杂题 grammar_cjkRuby: true catalog: true layout: post header-img: "img/header/P28.jpg" preview-img: "/img/preview/P28.jpg" ---
标签：二分，DP
You are given an array ofn integersa1... an. The cost of a subsegment is thenumber of unordered pairs of distinct indices within the subsegment thatcontain equal elements. Split the given array intok non-intersectingnon-empty subsegments so that the sum of their costs is minimum possible. Eachelement should be present in exactly one subsegment.
Input
The first line contains two integersnand k (2 ≤ n ≤ 105, 2 ≤ k ≤ min (n, 20)) — the length of the array and the number of segments youneed to split the array into.
The next line containsn integers a1, a2, ..., an (1 ≤ ai ≤ n) — the elements of the array.
Output
Print single integer: the minimum possibletotal cost of resulting subsegments.
Examples
Input
7 3
1 1 3 3 3 2 1
Output
1
Input
10 2
1 2 1 2 1 2 1 2 1 2
Output
8
Input
13 3
1 2 2 2 1 2 1 1 1 2 2 1 1
Output
9
Note
In the first example it's optimal to splitthe sequence into the following three subsegments: [1], [1, 3], [3, 3, 2, 1]. The costs are 0, 0 and 1, thus the answer is 1.
In the second example it's optimal to splitthe sequence in two equal halves. The cost for each half is 4.
In the third example it's optimal to splitthe sequence in the following way: [1, 2, 2, 2, 1], [2, 1, 1, 1, 2], [2, 1, 1]. The costs are 4,4, 1.
题意：给定：长度为N的序列a[1..N]，使其分成k个连续子序列
求：分割的最小代价，代价的定义为sum{每个连续子序列中出现的重复数对个数}
二分+动态规划
F数组记录答案，g数组记录二分时的状态
Code
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<=b;i++) #define dep(i,a,b) for(int i=a;i>=b;i--) #define mem(x,num) memset(x,num,sizeof x) #define LL unsigned long long using namespace std; const int maxn=100006,inf=0x3f3f3f; int n,k,a[maxn],t[maxn],p,q; LL f[maxn],g[maxn],now;//防止答案过大，用long long存储 void solve(int l1,int r1,int l2,int r2){ //以l1,r1为标准范围进行二分 if(l1>r1)return; int mid=(l1+r1)/2,temp=min(r2,mid); LL mv=1e19; while(q<mid)now+=t[a[++q]]++; while(p>temp+1)now+=t[a[--p]]++; while(q>mid)now-=--t[a[q--]]; while(p<temp+1)now-=--t[a[p++]];//使p,q不断接近now和temp+1 dep(i,temp,l2){ int x=a[i]; now+=t[a[--p]]++; if(now+f[i-1]<mv)mv=now+f[i-1],temp=i;//选取最小的now+f[i-1]替换mv } g[mid]=mv; solve(l1,mid-1,l2,temp); solve(mid+1,r1,temp,r2); } int main() { scanf("%d%d",&n,&k); rep(i,1,n)scanf("%d",&a[i]); mem(f,inf); f[0]=0; rep(i,1,k){ p=1,q=now=0; mem(t,0); solve(i,n,i,n); memcpy(f,g,sizeof f); } printf("%I64d\n",f[n]); return 0; }


WITNESS LIST State Affairs Committee April 1, 1997-1:30P SB 323 Registering, but not testifying: For: Smith, Tom (Public Citizen TX), Austin On: Bailey-Taylor, Shelia (SOAH), Austin SB 358 For: Ensweiler, Richard (TX Credit Union League), Farmers Branch Hunter, Mike (Indp. Bankers Assn), Victoria Lederer, John (Dallas Teach CU), Lewisville Mann, Linda (Matag.Co. Teachers CU), Bay City On: Feeney, Harold (TX Credit Union Commis.), Austin Hopson, Steve (Sunset Commission), Austin Thomas, Cynthia (TX Public Policy Fd.), Irving Registering, but not testifying: For: Anderson, Ronald (SW Resource CU), Baytown Base, Gary (Community CU), Plano Boatright, Anne (Capitol CU), Smithville Brinkman-Doughty,Suzy (NAFT Credit Union), Pharr Brown, James (TCUL Credit Union), Dallas Calloway, Lynda (Hous.Teamster CU), Houston Cameron, Betty (Co. & Muni. CU), Edinburg Cauley, Jim (SW Resource CU), Baytown Chism, Suzanne (PHS Credit Union), Dallas Cogswell, Billy (Neches Fed. CU), Nederland Davis, Barbara (Hous.Muni Emp. CU), Houston Davis, Gary (Choco. Bayou CU), Alvin Ewing, Leon (SA Teachers Credit Unio), San Antonio Gibson, Joyce (Dallas City Emp. CU), Richardson Kleiber, Ayn (Houston Police CU), Kingwood McKnight, Sally (Houston CU), Missouri City Pennington, Dee (Dallad Fed. CU), Dallas Pistor, William (Galleria Credit Union), Dallas Reed, Ron (Ft. Worth TELCO CU), Arlington Rodgers, Kelly (TX Bankers Assn.), Austin Rogers, Robert (Educ. Employers CU), Colleyville Schneider, Rob (Consumers Union), Austin Spark, Jim (Texins CU), Richardson Storch, Donald (USE Credit Union), Magnolia Wells, Kristi (Randolph-Brooks CU), Cedar Park Woodward, Ernest (1st Educators CU), Houston Wyatt, Robert (Brownsville Teach. CU), Brownsville SB 510 For: VanPelt III, Lester (Republican Party of TX), Austin Registering, but not testifying: For: Lucero, Homero (Bexar Co. Commission Ct), Austin SB 657 For: Andrade, Hope (VIA Metro. Transit), San Antonio Malmsten, Mark (Self), Kingsbury Wolff, Nelson (Austin-SA Corridor), San Antonio On: Griebel, Thomas (TXDOT), Austin Registering, but not testifying: For: Barton, Bill (TX Railroad Assn.), Austin Brewer, Phil (Round Rock C of C), Round Rock DeArrigunaga, Ray (VIA Metro. Transit), San Antonio Olsen, Ron (Union Pacific), Austin Smith, Peggy (City of Round Rock), Austin Workman, Mike (Self), Austin SB 755 For: Hinojosa, Walter (TX AFL-CIO), Austin Against: Howden, Robert (Natl. Fed. of Indep.Bus), Austin Kamm, Robert (TX Assn. of Bus. & CofC), Austin Knepp, Christopher (TX Employ. Law Council), Austin Registering, but not testifying: For: Warren, Bill (TX Public Empl. Assn.), Austin On: Skorupa, Chester (TWC), Austin SB 965 For: Flores, Henry (TX Telephone Assn), Austin Kroger, Stephanie (TX Indus. Energy Cons.), Austin Seidlitz, Curtis (Assn.of Elec. Cos.), Austin Smith, Tom (Public Citizen of TX), Austin Witcher, Mark (AT & T), Austin On: McKay, Ginny (Comptroller's Office), Austin Registering, but not testifying: For: Brown, Brooke (TX Telephone Assn.), Austin Messer, Bill (TX Chemical Council), Austin Moore, Julie (Occidental Chem. Corp), Austin Sellers, Tom (DuPont/Conoco), Austin On: Winters, Clint (Comptroller's Office), Austin Wood, III, Pat (PUC), Austin SB 1065 For: Fox, Dan (TU Electric), Dallas On: Bynog, George (TDLR), Austin Registering, but not testifying: For: Miller, Scott (Houston Light.& Power), Austin Seidlitz, Curtis (Assn. of Elec. Cos ofTX), Austin Sheeran, Kevin (TX Apartment Assn), Austin SB 1101 For: Kneeland, Carole (TX Assc of Broadcasters), Austin Walter, Paul (Free. Info Found of TX), Dallas Woodford, Suzy (Common Cause TX), Austin Against: McGookey, Doreen (City of Dallas), Dallas On: Anderson, Ken (Self), Georgetown SB 1177 Registering, but not testifying: On: Procter, Dan (Sec. of State's Office), Austin SB 1190 Registering, but not testifying: For: Wood, Karen (Baylor University), Waco On: Joyner, Guy (Sec. of State's Office), Austin SB 1370 For: Briesemeister, Janee (Consumers Union), Austin Kroger, Stephanie (TX Coali. Comp. Electri), Austin Smith, Tom (Public Citizen TX), Austin Against: McGoldrick, Joseph (Assn of Elec. Cos of TX), Houston Registering, but not testifying: For: Mintz, David (TX Apartment Assn), Austin Moore, Julie (Occidental Chem. Corp.), Austin Sellers, Tom (DuPont/Conoco), Austin Wright, R.L. (Union Carbide Corp.), Victoria Against: Seidlitz, Curtis (Assn of Elec. Cos of TX), Austin SB 1371 For: Kroger, Stephanie (TX Coali for Comp.Elec), Austin Mintz, David (TX Apartment Assn), Austin Against: McGoldrick, Joseph (Assn of Elec Cos of TX), Houston Registering, but not testifying: For: Messer, Bill (McDonald's Corp.), Austin Moore, Julie (Occidental Chemical), Austin Moore, Mickey (TX Retailers Assn.), Austin Sellers, Tom (DuPont/Conoco), Austin Smith, Tom (Public Citizens TX), Austin Wright, R.L. (Union Carbide Corp.), Victoria Against: Seidlitz, Curtis (Assn of Elec Cos of TX), Austin SB 1386 On: Seidenberg, Edward (TX State Library), Austin Registering, but not testifying: For: Smith, Mark (TX Library Assn.), Austin SCR 27 For: Rudy, K.C. (River Legacy Foundation), Arlington


|
[Arjovsky et al., 2017]
|
Arjovsky, M., Chintala, S., and Bottou, L. (2017).
Wasserstein generative adversarial networks.
In International Conference on Machine Learning, pages
214--223.
|
|
[Goodfellow et al., 2014]
|
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D.,
Ozair, S., Courville, A., and Bengio, Y. (2014).
Generative adversarial nets.
In Advances in Neural Information Processing Systems 27, pages
2672--2680. Curran Associates, Inc.
|
|
[Gulrajani et al., 2017]
|
Gulrajani, I., Ahmed, F., Arjovsky, M., Dumoulin, V., and Courville, A. C.
(2017).
Improved training of wasserstein gans.
In Advances in Neural Information Processing Systems 30, pages
5767--5777. Curran Associates, Inc.
|
|
[Karras et al., 2020]
|
Karras, T., Laine, S., Aittala, M., Hellsten, J., Lehtinen, J., and Aila, T.
(2020).
Analyzing and improving the image quality of stylegan.
In Proceedings of the IEEE/CVF Conference on Computer Vision and
Pattern Recognition, pages 8110--8119.
|
|
[Mescheder et al., 2018]
|
Mescheder, L., Geiger, A., and Nowozin, S. (2018).
Which training methods for gans do actually converge?
In International Conference on Machine Learning, pages
3481--3490. PMLR.
|
|
[Mescheder et al., 2017]
|
Mescheder, L., Nowozin, S., and Geiger, A. (2017).
The numerics of gans.
Advances in Neural Information Processing Systems,
30:1825--1835.
|
|
[Milgrom and Segal, 2002]
|
Milgrom, P. and Segal, I. (2002).
Envelope theorems for arbitrary choice sets.
Econometrica, 70(2):583--601.
[ DOI ]
|
|
[Munk et al., 2020]
|
Munk, A., Harvey, W., and Wood, F. (2020).
Assisting the adversary to improve gan training.
arXiv:2010.01274 [cs, stat].
[ arXiv ]
|
|
[Nagarajan and Kolter, 2017]
|
Nagarajan, V. and Kolter, J. Z. (2017).
Gradient descent gan optimization is locally stable.
Advances in Neural Information Processing Systems,
30:5585--5595.
|
|
[Zhou et al., 2019]
|
Zhou, S., Gordon, M., Krishna, R., Narcomey, A., Fei-Fei, L. F., and
Bernstein, M. (2019).
Hype: A benchmark for human eye perceptual evaluation of generative
models.
In Advances in Neural Information Processing Systems, pages
3449--3461.
|


Viewers architecture
The viewers give the capability to view SAP Crystal Reports and export report files to other formats. This section introduces the viewers SDK, and discusses the main system components involved in viewing reports.
In this section:
Java viewers SDK
How the viewers work with your reporting application
How do I choose an appropriate viewer?


and the []. for with virus are viral IL- antiviral SARS-CoV- also against has immune infection effective respiratory can which {background replication treatment from could have cells coronavirus influenza patients IL-, margin role inflammatory {border-style Chinese cytokines COVID- Med antibodies but host px;} that #ffffff;} acute response severe type TCM effects other some drug human novel therapeutic through The cell expression inhibition inhibits cytokine disease not pro-inflammatory this China activity anti-inflammatory been infections inhibitors injection such their combination inflammation may potential protein receptor syndrome these while Approved agents further high inhibit lung pathway IFN-Î± IFN-Î» Immunol activities based clinical development found hepatitis including innate many pneumonia strategies were COVID-. HCV Interferon RNA Res activation available biological due effect function immunity infected major monoclonal more peptide px; responses secretion spike structural study therapy traditional two via {font-family Coronavirus IFN MERS-CoV Therapeutic [], al. critical drugs during enhance font-size health helpful kinase levels like limitations mice natural peptides prevention was well Based COVID-, East Fig.Â Middle RBD SARS-CoV SARS-CoV-; both cases chronic components control directly double; effects, epithelial having immune-modulatory important improves injury its mechanism medicines number options outbreak prevent production rapid resistance several spread studies targeting therapies thus use used vaccine virus, Commons Creative Ethnopharmacol IFNs PA-MSHA SARS TNF-Î±, Wang another antibody attachment border-color border-width caused cells, cells. chemokines family first help indicated induces infection, interferon mainly medicine play plays potent primary protective rate reducing regulating shown signaling significant solid; suppresses synthesis vitro {font-style {font-weight (TCM) DNA Drug Engl HBV HIV IFN-Î³, Infect Not Rev SARS-CoV; Traditional Virol adaptive al.A al.IL- application approaches approved because bold complete complications controlled courier; crucial dysfunction early effectively effector em; enhances epidemics flavonoids gene herpes identified identify ill immunotherapy increases infection. interferons lethal modulating mortality most neutralizing one only past pathogenesis prevents produced proliferation promotes protection pt;} public recent reduce release restrict review safety severity significantly simplex specific survival syncytial trial viruses without


Yangon Technological University
Mandalay Technological University
Pyay Technological University
Technological University, Bhamo
Technological University, Dawei
Technological University, Hinthada
Technological University, Hmawbi
Technological University, Hpa-An
Technological University, Kalay
Technological University, Kyaingtong
Technological University, Kyaukse
Technological University, Lashio
Technological University, Loikaw
Technological University, Magway
Technological University, Mandalay
Technological University, Yamethin
Technological University, West Yangon


100% Original items are available at company.
Return within 3 days of recieving your order.
Get free delivery for every on more than one price
Pay online through multiple options(card/Net Banking)
Privacy policy
Terms of use
Return Policy
Discount Coupons
About us
Contact us
Career
Affiliate
Facebook
Twitter
Instagram
Linkedin
Made with by Suneela,Akshat,Mrityunjay


|
Konnekt
Anin-memorygraph-store
|
#include <graph.h>
Public Member Functions | |
| graph () | |
| std::shared_ptr< vertex > | createVertex () |
| std::shared_ptr< edge > | createEdge (std::shared_ptr< vertex > v1, std::shared_ptr< vertex > v2) |
| std::vector< std::shared_ptr< vertex > > | findVertex (std::string label) |
| std::vector< std::shared_ptr< edge > > | findEdges (std::shared_ptr< vertex > v1, std::shared_ptr< vertex > v2) |
| std::string_view | getDot () |
| const dijkstra_result | shortest_path (std::shared_ptr< vertex > v1, std::shared_ptr< vertex > v2) |
| size_t | size () |
Represents a graph in memory. Contains nodes and edges.
|
inline |
|
inline |
Create a new edge connected to given vertices Returns: A shared pointer to the new edge
|
inline |
Create a new vertex in the graph Returns: A shared pointer to the new vertex object
|
inline |
Find an edge between two given vertices Returns a list of edges that exist between two verticies. It is unlikely that there will be more than one edge.
Probably slowish with lots of edges because linear search :(
|
inline |
Find a vertex by label. Returns: A list of verticies with the given label. If none are found, the list is empty.
|
inline |
Generates a dot/graphviz graph of the stored graph. This has to walk the graph, and can be very expensive on large graphs.
|
inline |
Calculate the shortest path between two nodes if it exists.
Returns a 'dijkstra_result' object.
|
inline |


Counter
| Library: |
Memory |
| Introduced: |
2.3.0 |
| Appearance: |
|
Behavior
The counter holds a single value, whose value is emitted on the output
Q. Each time the clock input (diagrammed with a triangle on the
component's south edge) triggers according to its Trigger attribute,
the value in the counter may update based on
the two inputs on the component's west edge: The upper input is called
load and the lower is called count, and they are
interpreted as follows.
| load | count | trigger action |
| 0 or z | 0 |
The counter remains unchanged. |
| 0 or z | 1 or z |
The counter increments. |
| 1 | 0 |
The counter loads the value found at the
D input. |
| 1 | 1 or z |
The counter decrements. |
The range of counting can be configured using the Maximum
Value attribute. When the counter reaches this value, the next
increment wraps the counter back to 0; and if it is at 0,
then a decrement will wrap the counter around back to its maximum value.
In addition to the output Q, the component also includes a
single-bit output carry. This is 1 whenever the counter is at its
maximum and the load and count inputs indicate that the
component should increment on the next step - or when the counter is at 0
and the load and count inputs indicate to decrement at
the next step.
The clear input resets the counter's value to 0 (all
zeroes) asynchronously; that is, as long as the clr input
is 1, the value is pinned to 0, regardless of the clock input.
Pins
- East edge, labeled Q (output, bit width matches Data Bits attribute)
- Outputs the value currently stored by the counter.
- East edge, lower pin (output, bit width 1)
- Carry: When load and count indicate to increment,
this output is 1 whenever the counter is at its maximum. When load
and count indicate to decrement, this output is 1 whenever the
counter is at 0. At all other times, this output is 0.
- West edge, top pin (input, bit width 1)
- Load: When this is 1 while the count input is 0, the counter
will load the value found at the data input at the next clock
trigger - or, if the count input happens to be 1, the counter's
value will decrement.
- West edge, middle pin labeled D
(input, bit with matches Data Bits attribute)
- Data: When the clock triggers while load is 1
and count is 0, the counter's value changes to the value found at
this input.
- West edge, lower pin labeled ct (input, bit width 1)
- Count: When this is 1 or unconnected, the value in the counter increments
whenever the clock input is triggered - or it decrements if the load
input happens to also be 1.
- South edge, indicated with a triangle (input, bit width 1)
- Clock: At the instant that this is triggered as specified by the Trigger
attribute, the counter updates as indicated by the load and
count inputs.
- South edge, labeled 0 (input, bit width 1)
- Clear: When 0 or undefined, this input has no effect.
As long as it is 1, the counter's value is asynchronously pinned to 0. This
occurs asynchronously - that is, without regard to the current clock input
value. As long as this is 1, the other inputs have no effect.
Attributes
When the component is selected or being added,
Alt-0 through Alt-9 alter its Data Bits
attribute.
- Data Bits
- The bit width of the value emitted by the component.
- Maximum Value
- The maximum value, at which point the counter will set its carry output.
- Action On Overflow
- The behavior when the counter attempts to increment beyond the maximum value
or decrement beyond 0. Four possible actions are supported:
- Wrap around
- The next value is 0 (if incrementing - the maximum value if decrementing)
- Stay at value
- The counter's value remains at the maximum (or 0 if decrementing)
- Continue counting
- The counter continues incrementing/decrementing, keeping the number of bits
as provided by the Data Bits attribute
- Load next value
- The next value is loaded from the D input.
- Trigger
- Configures how the clock input is interpreted. The value
rising edge
indicates that the counter should update its value at the instant when the
clock rises from 0 to 1. The falling edge
value indicates that it should
update at the instant the clock falls from 1 to 0.
- Label
- The text within the label associated with the component.
- Label Font
- The font with which to render the label.
Poke Tool Behavior
Clicking the counter brings keyboard focus to the component
(indicated by a red rectangle), and typing hexadecimal digits will
change the value stored in the counter.
Text Tool Behavior
Allows the label associated with the component to be edited.
Back to Library Reference


David Uli
www.daviduli.com
2412 Basswood Drive, San Ramon CA 94582
<EMAIL_ADDRESS>T:<PHONE_NUMBER>
W:<PHONE_NUMBER>
www.github.com/NorCalDavid
ABOUT ME
I am a full-stack web developer
who is excited to return to the
tech community after spending
10+ years working in corporate
and field operations, human
resources and retail management.
I am inspired by clean, readable
code and I am looking for
opportunities to develop
innovative solutions to the
operational challenges facing
enterprises.
SKILLS
• Ruby, JavaScript,
AJAX, JQuery
• HTML5/CSS3
• Rails, Sinatra, EmberJS
• Git, Github, Git Worflow
• TDD (RSpec and Jasmine)
• PostgreSQL, SQLite, Active Record
• Agile Development
• Object-Oriented / MVC Design
PROJECTS
Active Schema Designer [ Live || Github ]
Led a team of 4 to develop a tool for building database schemas directly in the
browser and provides the ability to save and export schema designs.
Active Schema Designer automatically build the Active Record model and
migration files with all of the appropriate validations and relationship
SmartSync [ Live || Github ]
Home automation controller that is currently in development.
SmartSync will
interface with the Insteon API and provide full control of all Insteon Smart Home
Devices as well as several other home control devices.
EXPERIENCE
Dev Boot Camp, San Francisco, CA
May 2015-Oct 2015
Completed a 19-week immersive coding boot camp comprising of 1000+ hours learning Ruby, Rails, JavaScript,
HTML5/CSS3 and accompanying tools and frameworks.
Emphasis on optimal learning, group projects, pair-programming, industry practices and concepts (Agile, Version
Control, TDD, OOP), and emotional intelligence.
Ross Stores Inc.,
Dublin, CA
November 2008 – March 2015
Manager of Brand Maintenance and Repair
(April 2013-Present)
Developed Microsoft Access Database to automate and streamline the accounts payable, field reporting and
quality control processes.
Directly manage a team of seven employees responsible for quality control and execution of maintenance and
repair programs supporting over 1,300 Ross and dd’s Stores across the United States.
Tested and implemented the Customized Janitorial Program, tailoring services based on store volume metrics.
This is the largest change to the program in Ross’ history.
Responsible for the development and management of a $34 million expense budget, conducting monthly forecast
adjustments and reconciliation.
Negotiate and administer all service provider contracts.
Initiate and conduct RFP (Request for Proposal) processes
when necessary.
Manager of New Stores/New Market Entry
(June 2011-April 2013)
Facilitated over 180 new store openings, relocations and store closing activities.
Directly managed a team of two employees.
Created the company’s “New Store Opening Kit” including detailed manuals for employee training and
development, comprehensive instructions for store setup and operation, and resources for new store managers.
Proactively worked with business partners to identify opportunities for expense savings and process
improvements.


{{ courseCommitteeEvaluationForm.sectionIActionsRecommendations}}
{{ courseCommitteeEvaluationForm.sectionIIActionsRecommendations }}
{{courseCommitteeEvaluationForm.recommendationsForCourseImprovement }}
{{ courseCommitteeEvaluationForm.recommendationsToCENProgramGovernance }}
{{courseCommitteeEvaluationForm.sectionIIIRecommendationsComments}}
Outcome:({{this.outcomeID}}) {{this.outcomeName}}Number of students: {{this.courseOutcomeAssessmentForm.numberOfStudents}} |
Evaluation:(satisfactory, unsatisfactory, weaknesses, identified, suggestedimprovements, remarks) |
| 1. Instruments Chosen | {{this.outcomeEvaluation.instrumentsChosen}} |
| 2. Likert Scale Threshold(s) | {{this.outcomeEvaluation.likertScaleThresholds}} |
| 3. Sample Graded Student Work | {{this.outcomeEvaluation.sampleGradedStudentWork}} |
| 4. Percentage of Students Achieving Outcome {{this.courseOutcomeAssessmentForm.percentOfStudentsAchievingOutcomeAdequately}} | {{this.outcomeEvaluation.percentageOfStudentsAchievingOutcome}} |
| 5. Average Likert Value {{this.courseOutcomeAssessmentForm.averageLikertScaleValue}} | {{this.outcomeEvaluation.averageLikertValue}} |
| 6. Achievement of Outcome | {{this.outcomeEvaluation.achievementOfOutcome}} |
| 7. Suggested Improvements on Achieving Outcome | {{this.outcomeEvaluation.suggestedImprovements}} |
1. To perform *qualitative* analysis of the quantitative data of the outcomes assessed.
2. To document the participation of several faculty in the evaluation of those assessments.
3. To examine and evaluate the various quantitative criteria used, the instruments chosen, the Likert scale values, and sample student graded work.
4. To generate recommendations in three categories:
(a) Recommendations to future instructors.
(b) Recommendations to curriculum governance.
(c) Recommendations on improvement of the process.
(a) an ability to apply knowledge of mathematics, statistics, computer science, and electrical engineering as it applies to computer hardware and software
(b) an ability to design and conduct experiments, as well as to organize, analyze and interpret data.
(c) an ability to design hardware and software systems, components, or processes to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability.
(d) an ability to function on multi-disciplinary teams.
(e)an ability to identify, formulate, and solve hardware and software computer engineering problems, accounting for the interaction between hardware and software.
(f) an understanding of professional, legal, and ethical issues and responsibilities.
(g) an ability to communicate effectively in speech and in writing, including documentation of hardware and software systems.
(h) the broad education necessary to understand the impact of engineering solutions in a global, economic, environmental, and societal context
(i) a recognition of the need for, and an ability to engage in life-long learning.
(j) a knowledge of contemporary issues.
(k) an ability to use the techniques, skills, and modern engineering tools necessary for computer engineering practice.
(l) an ability to apply engineering and management knowledge and techniques to estimate time and resources needed to complete a computer engineering project .


Overview
The database can be started either as a main program of as part of an EPICS V3 IOC.
Start as a main program
mrk> pwd
/home/epicsv4/master/exampleCPP/database
mrk> bin/$EPICS_HOST_ARCH/exampleDatabaseMain
Start it as part of an EPICS V3 IOC:
mrk> pwd
/home/epicsv4/master/exampleCPP/database/iocBoot/exampleDatabase
mrk> ../../bin/$EPICS_HOST_ARCH/exampleDatabase st.cmd
The database has both iocCore DBRecords and pvDatabase PVRecords.
Since pvaSrv is also started, the DBRecords can be accesed via either channelAccess or pvAccess.
For example both caget and pvget can be used to access the DBRecords.
V4 PVRecords
These are the names of the channels that are available if the database is started as
a main program or as part of a V3 IOC.
The following are the PVRecords plus helloRPC, which is accessed via channelRPC:
PVRboolean
PVRbooleanArray
PVRbyte
PVRbyteArray
PVRdouble
PVRdouble01
PVRdouble01Array
PVRdouble02
PVRdouble02Array
PVRdouble03
PVRdouble03Array
PVRdouble04
PVRdouble04Array
PVRdouble05
PVRdouble05Array
PVRdoubleArray
PVRdumbPowerSupply
PVRenum
PVRfloat
PVRfloatArray
PVRhelloPutGet
PVRhelloRPC
PVRint
PVRintArray
PVRlong
PVRlongArray
PVRremoveRecord
PVRrestrictedUnion
PVRrestrictedUnionArray
PVRshort
PVRshortArray
PVRstring
PVRstringArray
PVRstructureArray
PVRtraceRecord
PVRubyte
PVRubyteArray
PVRuint
PVRuintArray
PVRulong
PVRulongArray
PVRushort
PVRushortArray
PVRvariantUnion
PVRvariantUnionArray
V3 DB Records
If the database is started as a V3 IOC, the following DBRecords are present:
DBRbo00
DBRbo01
DBRstring00
DBRstring01
DBRstring02
DBRstring03
DBRstring04
DBRstring05
DBRstring06
DBRstring07
DBRstring08
DBRstring09
DBRbyteArray01
DBRdoubleArray
DBRdoubleArray01
DBRfloatArray01
DBRintArray01
DBRshortArray01
DBRstringArray01
DBRenum01
DBRmbbo00
DBRmbbo02
DBRcalc00
DBRcounter01
DBRmbbiwierd
DBRint00
DBRint01
DBRao01
DBRdouble00
DBRdouble01
DBRdouble02
DBRdouble03
DBRdouble04
DBRdouble05
DBRdouble06
DBRdouble07
DBRdouble08
DBRdouble09
database/src/pv
This directory has the following files:
- exampleHelloRecord.h
- Header file for exampleHelloRecord.cpp
- exampleHelloRPC.h
- Header file for exampleHelloRPC.cpp
- exampleDatabase.h
- Header file for exampleDatabase.cpp
database/src
This directory has the following files:
- exampleHelloRecord.cpp
- Code for an example that is accessed via channelPutGet
- exampleHelloRPC.cpp
- Code for an example that is accesed via channelRPC
- exampleDatabase.cpp
- Code that creates many PVRecords.
Most are soft records but also exampleHelloRecord and exampleHelloRPC.
The code is described in the following sub - section.
- exampleDatabaseRegister.dbd and exampleDatabaseRegister.cpp
- Code that allows the PVRecords to be part of a V3 IOC.
This is the code that supports the exampleDatabase
shell command in database/iocBoot/exampleDatabase/st.cmd
- exampleDatabaseMain.cpp
- Code that allows the PVRecords to be available via a standalone main program.
database/src/code/exampleDatabase.cpp
This has a number of private methods:
- createRecords
- Given a scalarType this creates an NTScalar and an NTScalarArray record
of the specified type.
- createStructureArrayRecord
- Creates a record with a value field that is a structureArray.
- createRestrictedUnionRecord
- Creates a record with a value field that is a regulav.
- createVariantUnionRecord
- Creates a record with a value field that a structureArray.
- createRestrictedUnionArrayRecord
- Creates a record with a value field that a structureArray.
- createVariantUnionArrayRecord
- Creates a record with a value field that a structureArray.
- createDumbPowerSupplyRecord
- Creates a record with a value field that a structureArray.
ExampleDatabase::create
is a static method of ExampleDatabase that creates all the PVRecords that make up the
example database.
It:
- createRecords
- This is called for each scalarType.
- addRecord for PVRenum
- Creates PVRenum
- createStructureArrayRecord
- Creates PVRstructureArray
- createRestrictedUnionRecord
- Creates PVRrestrictedUnion
- createVariantUnionRecord
- Creates PVRvariantUnion
- createRestrictedUnionArrayRecord
- Creates PVRrestrictedUnionArray
- createVariantUnionArrayRecord
- Creates PVRvariantUnionArray
- createDumbPowerSupplyRecord
- Creates PVRdumbPowerSupply
- addRecord for PVRhelloPutGet
- Creates PVRhelloPutGet
- registerService for helloRPC
- Creates helloRPC
database/ioc
database/ioc/Db
This has V3 record templates for creating DBRecords.
They are used when the example database is started as part of a V3 IOC.
database/ioc/src
This has:
- exampleDatabaseInclude.dbd
-
This has the following:
- include "base.dbd"
- This is from iocCore
- include "PVAServerRegister.dbd"
- This is to create the iocsh commmand startPVAServer
- include "registerChannelProviderLocal.dbd"
- This is to start local provider from pvDatabaseCPP
- include "dbPv.dbd"
- This is to start pvaSrv
- include "exampleDatabaseRegister.dbd"
- This is to create the iocsh commmand exampleDatabase
- exampleDatabaseMain.cpp
database/iocBoot/exampleDatabase
This is where the example database is started as part of a V3 IOC.
st.cmd is like a normal startup file except for:
- exampleDatabase
- This creates the PVRecords.
- startPVAServer
- This starts the local channel provider and pvAccess


The XVI Club is the alumni association of the Cambridge University Lacrosse Club. We organise alumni events and provide advice and financial support to CULC.
The XVI Club is named after an old society within the lacrosse club which was limited to the 16 most senior players.
Join the XVI Club Donate onlineJoin us every year for the annual Varsity Match against Oxford in February.
Each May we roll back the clock and take on the current students in a friendly game.
After the Alumni Match we host our annual black-tie dinner in Cambridge.
Generous financial gifts from alumni help push CULC to Varsity victory
To become a member, select a package below to set up a regular donation to the XVI Club. All of our memberships renew automatically - you will be taken to a secure payment page hosted by GoCardless to set up a Direct Debit.
We keep in touch via email. If you don't already receive our messages then sign up below.
Want to hear more and can't wait for the next event? That's great! Send us an email and one of the XVI Club Trustees will get back to you.


n3m0
Live data from an autonomous boat!
Map loading...
Current Status
Loading data...
No data loaded yet...
Photo Request Status
Data is loading...
No data loaded...
Click map then button
Request Photo
a
b
c
d
e
f


Additional Libraries on GitHub¶
These are libraries and drivers available in separate GitHub repos. They are designed for use with CircuitPython and may or may not work with MicroPython.
Bundle¶
We provide a bundle of all our libraries to ease installation of drivers and their dependencies. he bundle is primarily geared to the Adafruit Express line of boards which will feature a relatively large external flash. With Express boards, its easy to copy them all onto the filesystem. However, if you don’t have enough space simply copy things over as they are needed.
The bundles are available on GitHub.
To install them:
- Download and unzip the latest zip thats not a source zip.
- Copy the
lib
folder to theCIRCUITPY
orMICROPYTHON
.
Foundational Libraries¶
These libraries provide critical functionality to many of the drivers below. It
is recommended to always have them installed onto the CircuitPython file system in
the lib/
directory. Some drivers may not work without them.
Helper Libraries¶
These libraries build on top of the low level APIs to simplify common tasks.
Drivers¶
Drivers provide easy access to sensors and other chips without requiring a knowledge of the interface details of the chip itself.
- NeoPixel
- SimpleIO
- RGB Displays
- SD Card
- Analog-to-digital converters: ADS1015 and ADS1115
- DS3231 Real-time Clock (Precision RTC)
- DS1307 Real-time Clock (5V RTC Breakout)
- PCF8523 Real-time Clock (Adalogger RTC)
- TCS34725 Color Sensor
- TSL2561 Light Sensor
- PCA9685 Motor and Servo Controllers
- HT16K33 LED Matrices and Segment Displays
- IS31FL3731 Charlieplexed LED Matrix
- MAX7219 LED Matrix


Date of Measurement |
Height/Length (cm) |
Weight (kg) |
Head Circumference (cm) |
BMI (kg/m^2) |
|---|---|---|---|---|
{{log_entry.date_of_measurement}} |
{{log_entry.length}} |
{{log_entry.weight}} |
{{log_entry.head_circumference}} |
{{log_entry.bmi}} |


--- title: Kevoree 1.2.0 is out layout: post published: true ---
Kevoree 1.2.0 is out ! This stable version includes many bug fixes and supports Arduino nodes out-of-the-box ! The team now concentrates on the next 1.3 version wich will bring support for cloud infrastructures, Kinect device and node type extensions ... Stay tuned ;-) !


| FLINK-4259 |
Unclosed FSDataOutputStream in FileCache#copy() |
Minor |
. |
Ted Yu |
Neelesh Srinivas Salian |
| FLINK-4289 |
Source files have executable flag set |
Minor |
. |
Ufuk Celebi |
Ufuk Celebi |
| FLINK-4296 |
Scheduler accepts more tasks than it has task slots available |
Critical |
JobManager, TaskManager |
Maximilian Michels |
Till Rohrmann |
| FLINK-4290 |
CassandraConnectorTest deadlocks |
Critical |
Streaming Connectors |
Stephan Ewen |
Stephan Ewen |
| FLINK-4298 |
Clean up Storm Compatibility Dependencies |
Major |
Storm Compatibility |
Stephan Ewen |
Stephan Ewen |
| FLINK-4285 |
Non-existing example in Flink quickstart setup documentation |
Minor |
Documentation, Examples |
Tzu-Li (Gordon) Tai |
Stephan Ewen |
| FLINK-4292 |
HCatalog project incorrectly set up |
Critical |
Batch Connectors and Input/Output Formats |
Stephan Ewen |
Stephan Ewen |
| FLINK-4307 |
Broken user-facing API for ListState |
Blocker |
Streaming |
Stephan Ewen |
Stephan Ewen |
| FLINK-4219 |
Quote PDSH opts in start-cluster.sh |
Major |
Startup Shell Scripts |
Greg Hogan |
Greg Hogan |
| FLINK-4314 |
Test instability in JobManagerHAJobGraphRecoveryITCase.testJobPersistencyWhenJobManagerShutdown |
Major |
. |
Ufuk Celebi |
|
| FLINK-4297 |
Yarn client can't determine fat jar location if path contains spaces |
Major |
YARN Client |
Maximilian Michels |
Maximilian Michels |
| FLINK-4304 |
Jar names that contain whitespace cause problems in web client |
Major |
Web Client |
Timo Walther |
Timo Walther |
| FLINK-3138 |
Method References are not supported as lambda expressions |
Major |
Core |
Stephan Ewen |
Timo Walther |
| FLINK-4226 |
Typo: Define Keys using Field Expressions example should use window and not reduce |
Trivial |
Documentation |
Ahmad Ragab |
|
| FLINK-4276 |
TextInputFormatTest.testNestedFileRead fails on Windows OS |
Trivial |
Batch Connectors and Input/Output Formats, Tests |
Chesnay Schepler |
Chesnay Schepler |
| FLINK-4291 |
No log entry for unscheduled reporters |
Trivial |
Metrics |
Chesnay Schepler |
Chesnay Schepler |
| FLINK-4332 |
Savepoint Serializer mixed read()/readFully() |
Critical |
State Backends, Checkpointing |
Stephan Ewen |
Stephan Ewen |
| FLINK-4333 |
Name mixup in Savepoint versions |
Trivial |
State Backends, Checkpointing |
Stephan Ewen |
Stephan Ewen |
| FLINK-4337 |
Remove unnecessary Scala suffix from Hadoop1 artifact |
Major |
Build System |
Stephan Ewen |
Stephan Ewen |
| FLINK-4316 |
Make flink-core independent of Hadoop |
Major |
Core |
Stephan Ewen |
Stephan Ewen |
| FLINK-4342 |
Fix dependencies of flink-connector-filesystem |
Major |
Streaming Connectors |
Stephan Ewen |
Stephan Ewen |
| FLINK-4270 |
'as' in front of join does not work |
Major |
Table API & SQL |
Timo Walther |
Jark Wu |
| FLINK-4236 |
Flink Dashboard stops showing list of uploaded jars if main method cannot be looked up |
Major |
Job-Submission |
Gary Yao |
Maximilian Michels |
| FLINK-4385 |
Union on Timestamp fields does not work |
Major |
Table API & SQL |
Timo Walther |
Jark Wu |
| FLINK-4394 |
RMQSource: The QueueName is not accessible to subclasses |
Major |
Streaming Connectors |
Dominik Bruhn |
Dominik Bruhn |
| FLINK-4309 |
Potential null pointer dereference in DelegatingConfiguration#keySet() |
Minor |
. |
Ted Yu |
Sunny T |
| FLINK-4388 |
Race condition during initialization of MemorySegmentFactory |
Major |
Core |
Stephan Ewen |
Stephan Ewen |
| FLINK-4293 |
Malformatted Apache Headers |
Minor |
. |
Stephan Ewen |
Chesnay Schepler |
| FLINK-4411 |
[py] Chained dual input children are not properly propagated |
Minor |
Python API |
Chesnay Schepler |
Chesnay Schepler |
| FLINK-4412 |
[py] Chaining does not properly handle broadcast variables |
Major |
Python API |
Chesnay Schepler |
Chesnay Schepler |
| FLINK-4409 |
class conflict between jsr305-1.3.9.jar and flink-shaded-hadoop2-1.1.1.jar |
Minor |
Build System |
Renkai Ge |
Stephan Ewen |
| FLINK-4021 |
Problem of setting autoread for netty channel when more tasks sharing the same Tcp connection |
Major |
Network |
Zhijiang Wang |
Zhijiang Wang |
| FLINK-4425 |
"Out Of Memory" during savepoint deserialization |
Major |
State Backends, Checkpointing |
Sergii Koshel |
|
| FLINK-4454 |
Lookups for JobManager address in config |
Minor |
Client |
Maximilian Michels |
Maximilian Michels |
| FLINK-4417 |
Checkpoints should be subsumed by CheckpointID not, by timestamp |
Major |
State Backends, Checkpointing |
Stephan Ewen |
ramkrishna.s.vasudevan |
| FLINK-4453 |
Scala code example in Window documentation shows Java |
Trivial |
Documentation |
Fabian Hueske |
Jark Wu |
| FLINK-4437 |
Lock evasion around lastTriggeredCheckpoint may lead to lost updates to related fields |
Major |
. |
Ted Yu |
|
| FLINK-4341 |
Kinesis connector does not emit maximum watermark properly |
Blocker |
Streaming Connectors |
Scott Kidder |
Tzu-Li (Gordon) Tai |
| FLINK-4488 |
Prevent cluster shutdown after job execution for non-detached jobs |
Minor |
YARN Client |
Maximilian Michels |
Maximilian Michels |
| FLINK-4486 |
JobManager not fully running when yarn-session.sh finishes |
Major |
YARN Client |
Niels Basjes |
Maximilian Michels |
| FLINK-4526 |
ApplicationClient: remove redundant proxy messages |
Major |
YARN Client |
Maximilian Michels |
Maximilian Michels |
| FLINK-4271 |
There is no way to set parallelism of operators produced by CoGroupedStreams |
Major |
DataStream API |
Wenlong Lyu |
Jark Wu |
| FLINK-4567 |
Enhance SerializedThrowable to properly preserver cause chains |
Major |
. |
Stephan Ewen |
Stephan Ewen |
| FLINK-4566 |
ProducerFailedException does not properly preserve Exception causes |
Major |
Network |
Stephan Ewen |
Stephan Ewen |
| FLINK-4570 |
Scalastyle Maven plugin fails undeterministically |
Major |
Build System |
Maximilian Michels |
Maximilian Michels |
| FLINK-4073 |
YARNSessionCapacitySchedulerITCase.testTaskManagerFailure failed on Travis |
Critical |
Tests |
Till Rohrmann |
Maximilian Michels |
| FLINK-4436 |
Unclosed DataOutputBuffer in Utils#setTokensFor() |
Minor |
. |
Ted Yu |
|


Melvin Udall is a heartless man. He spends his days inside of his spacious Manhattan apartment writing romance novels. It also seems that Melvin will never change. One day he dines ar his favorite restaurant, and is a little TOO mean to his normal waitress (the only waittress that will serve him), Carol (played to perfection by a lovely and sexy Helen Hunt.)  To make matters considerably worse, Melvin has Obsessive Compulsive Disorder.   Soon Simon is sadly beaten by thieveing burglars, and Ray (Cuba Gooding, Jr.), Simon's agent, takes the dog, Verdell, to Melvin, so that Melvin can dogsit him. And through the dog and a rather heartwrenching car trip that involves Simon, Carol, and himself, Melvin learns to emerge from his cantakerous shell. Jack Nicholson gives yet another Oscar-caliber performance as the film's cynical lead, and is back at work, not playing a goofy U.S. president or a comic book villian, but instead playing Jack Nicjolson, and playing him full force. All of this adds up to this year's funniest comedy, a creative, witty, and scathing film from James L. Brooks, and Brooks gets award-worthy performances from the entire cast.
AS GOOD AS IT GETS MPAA CLASSIFICATION: PG-13 RATING: **** (out of four) RUNNING TIME: 132 min.
(c) 1998 MSTFAN Productions
Jason Bacon<EMAIL_ADDRESS>The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Permalink
Please sign in to comment.
Showing
with
33 additions
and 20 deletions.
- +8 −9 gitcommands.go
- +6 −8 gui.go
- +19 −3 main.go
0 comments on commit
f6a9c72


I provide a set of methods for reading binary data with ActionScript
3.0.
|
|
__init__(self,
decoder)
x.__init__(...) initializes x; see x.__class__.__doc__ for signature |
source code
|
|
bool
|
|
int
|
|
number
|
readDouble(self)
Reads an IEEE 754 double-precision floating point number from the
data stream. |
source code
|
|
number
|
readFloat(self)
Reads an IEEE 754 single-precision floating point number from the
data stream. |
source code
|
|
int
|
|
str
|
readMultiByte(self,
length,
charset)
Reads a multibyte string of specified length from the data stream
using the specified character set. |
source code
|
|
|
|
|
uint
|
|
uint
|
|
uint
|
|
uint
|
|
str
|
|
str
|
readUTFBytes(self,
length)
Reads a sequence of length UTF-8 bytes from the data
stream and returns a string. |
source code
|
|
|
Inherited from object :
__delattr__ ,
__getattribute__ ,
__hash__ ,
__new__ ,
__reduce__ ,
__reduce_ex__ ,
__repr__ ,
__setattr__ ,
__str__
|


Publishing Ghost Blog to Github Pages
I like simplicity. I also believe that simple things are really beautiful. I recently migrate my blog from Wordpress to Git pages. It gives me ultimate freedom to customize my blog. I am a NodeJS…
I like simplicity. I also believe that simple things are really beautiful. I recently migrate my blog from Wordpress to Git pages. It gives me ultimate freedom to customize my blog. I am a NodeJS…
Docker is an awesome and powerful tool for developing and deploying your apps. According to Docker official website, Docker is Docker is an open platform for developers and sysadmins to build, ship, and run distributed…
Responsive design is known to all. To achieve responsiveness we generally use media queries. But I feel media queries are some kind of CSS Hack. It is really annoying when I need to work with…
Here is the simple chunk of code to replace a particular section in a file asynchronously. fs.readFile(filePath, 'utf8', function(err, data) { if (err) { return console.log(err); } var result = data.replace(your-regex-or-text,replacement-text)…
Very simple and really awesome solution that I found on stackoverflow In ES2015 import mkdirp from 'mkdirp' import fs from 'fs' import { dirname } from 'path' function writeFile (path, contents, cb) { mkdirp(dirname(path), (err) =>…


Welcome to Burning Waters!
12 Feb 2019Well hello there! This is the first ever post on our new website! I put this together with free tools in just a couple of hours and I can show everyone how to make posts, or we can throw the whole thing in the trash. I’m not worried about google finding us and, honestly, I think it is more important to be able to share with the right people than get cached with any emphasis on SEO. plus this is on github and we should get cached anyway!


Please upload your input file
Select a color for localization:
Select a color for Score:
Select from example file :
One Protein One Localization
One Protein Multiple Localizations
Multiple Proteins and Localizations
Or
Select a text file :


{% extends "layout.html" %} {% block content %}
This is where it starts to slow down. Eventually as the cell number goes down it speeds back up. It only checks cells that are alive so less cells means quicker.
How large it really can go is dependant on what is running it. An ipad would have a hard time running this 60x60 but can handle the previous just fine. A decent desktop will run the below.


Agile development uses four clear delivery methods to bring structure to any project: versions, sprints, epics, and user stories
- A version is a set of features and fixes released together as a single update to your product. Assigning issues to versions helps you plan the order in which new features (stories) for your product will be released to your customers. A version can be made up of multiple sprints
- A sprint is a set period of time during which specific work has to be completed and made ready for review
- An epic captures a large body of work. It is essentially a large user story that can be broken down into a number of smaller stories. It may take several sprints to complete an epic.
- A user story (represented as an issue in Jira) captures a description of a feature from an end-user perspective. The user story describes the type of user, what they want and why. A user story helps to create a simplified description of a requirement. User stories are broken up into individual tasks that make up the story (represented as sub-tasks in Jira)


Drake + Tory Lanez Busted Flaming Each Other W/ Savage Trolling: “Too Busy Waiting For Frank Ocean To Perform”
by Angie DareOVO Sound boss Drake and Tory Lanez are showing no mercy.
On Saturday, a savage post surfaced of Drake and Tory playfully going at each other with epic digital jabs.
Earlier this week, Tory weighed-in on Drake getting booed at last Sunday’s Camp Flog Gnaw music festival in California.
On Monday, Drizzy trolled fans by joking about signing a decade-long residency at Tyler, the Creator‘s annual event.
A few hours prior, Tyler addressed fans going off on Drake with massive boos during his surprise Sunday night set.


public static class ShadowMediaPlayer.MediaInfo
extends java.lang.Object
Class specifying information for an emulated media object. Used by ShadowMediaPlayer when setDataSource() is called to populate the shadow player with the specified values.
| Modifier and Type | Field and Description |
|---|---|
int |
duration |
java.util.TreeMap<java.lang.Integer,org.robolectric.shadows.ShadowMediaPlayer.RunList> |
events
Map that maps time offsets to media events.
|
| Constructor and Description |
|---|
MediaInfo()
Creates a new
MediaInfo object with default duration (1000ms) and default preparation delay (0ms). |
MediaInfo(int duration,
int preparationDelay)
Creates a new
MediaInfo object with the given duration and preparation delay. |
| Modifier and Type | Method and Description |
|---|---|
int |
getPreparationDelay()
Retrieves the current preparation delay for this media.
|
void |
removeEvent(ShadowMediaPlayer.MediaEvent event)
Removes the specified event from the playback schedule at all playback offsets where it has been scheduled.
|
void |
removeEventAtOffset(int offset,
ShadowMediaPlayer.MediaEvent event)
Removes the specified event from the playback schedule at the given playback offset.
|
ShadowMediaPlayer.MediaEvent |
scheduleBufferUnderrunAtOffset(int offset,
int length)
Schedules a simulated buffer underrun event to run at the specified playback offset.
|
ShadowMediaPlayer.MediaEvent |
scheduleErrorAtOffset(int offset,
int what,
int extra)
Schedules an error event to run at the specified playback offset.
|
void |
scheduleEventAtOffset(int offset,
ShadowMediaPlayer.MediaEvent event)
Schedules a generic event to run at the specified playback offset.
|
ShadowMediaPlayer.MediaEvent |
scheduleInfoAtOffset(int offset,
int what,
int extra)
Schedules an info event to run at the specified playback offset.
|
void |
setPreparationDelay(int preparationDelay)
Sets the current preparation delay for this media.
|
public int duration
public java.util.TreeMap<java.lang.Integer,org.robolectric.shadows.ShadowMediaPlayer.RunList> events
Map that maps time offsets to media events.
public MediaInfo()
Creates a new MediaInfo
object with default duration (1000ms) and default preparation delay (0ms).
public MediaInfo(int duration, int preparationDelay)
Creates a new MediaInfo
object with the given duration and preparation delay. A completion callback event is scheduled at duration
ms from the end.
duration
- the duration (in ms) of this emulated media. A callback event will be scheduled at this offset to stop playback simulation and invoke the completion callback.preparationDelay
- the preparation delay (in ms) to emulate for this media. If set to -1, then ShadowMediaPlayer.prepare()
will complete instantly but ShadowMediaPlayer.prepareAsync()
will not complete automatically; you will need to call ShadowMediaPlayer.invokePreparedListener()
manually.public int getPreparationDelay()
Retrieves the current preparation delay for this media.
public void setPreparationDelay(int preparationDelay)
Sets the current preparation delay for this media.
preparationDelay
- the new preparation delay (in ms).public void scheduleEventAtOffset(int offset, ShadowMediaPlayer.MediaEvent event)
Schedules a generic event to run at the specified playback offset. Events are run on the thread on which the MediaPlayer
was created.
offset
- the offset from the start of playback at which this event will run.event
- the event to run.public ShadowMediaPlayer.MediaEvent scheduleErrorAtOffset(int offset, int what, int extra)
Schedules an error event to run at the specified playback offset. A reference to the actual MediaEvent that is scheduled is returned, which can be used in a subsequent call to removeEventAtOffset(int, org.robolectric.shadows.ShadowMediaPlayer.MediaEvent)
.
offset
- the offset from the start of playback at which this error will trigger.what
- the value for the what
parameter to use in the call to onError()
.extra
- the value for the extra
parameter to use in the call to onError()
.public ShadowMediaPlayer.MediaEvent scheduleInfoAtOffset(int offset, int what, int extra)
Schedules an info event to run at the specified playback offset. A reference to the actual MediaEvent that is scheduled is returned, which can be used in a subsequent call to removeEventAtOffset(int, org.robolectric.shadows.ShadowMediaPlayer.MediaEvent)
.
offset
- the offset from the start of playback at which this event will trigger.what
- the value for the what
parameter to use in the call to onInfo()
.extra
- the value for the extra
parameter to use in the call to onInfo()
.public ShadowMediaPlayer.MediaEvent scheduleBufferUnderrunAtOffset(int offset, int length)
Schedules a simulated buffer underrun event to run at the specified playback offset. A reference to the actual MediaEvent that is scheduled is returned, which can be used in a subsequent call to removeEventAtOffset(int, org.robolectric.shadows.ShadowMediaPlayer.MediaEvent)
.
This event will issue an onInfo()
callback with MediaPlayer.MEDIA_INFO_BUFFERING_START
to signal the start of buffering and then call ShadowMediaPlayer.doStop()
to internally pause playback. Finally it will schedule an event to fire after length
ms which fires a MediaPlayer.MEDIA_INFO_BUFFERING_END
info event and invokes ShadowMediaPlayer.doStart()
to resume playback.
offset
- the offset from the start of playback at which this underrun will trigger.length
- the length of time (in ms) for which playback will be paused.public void removeEventAtOffset(int offset, ShadowMediaPlayer.MediaEvent event)
Removes the specified event from the playback schedule at the given playback offset.
offset
- the offset at which the event was scheduled.event
- the event to remove.removeEvent(ShadowMediaPlayer.MediaEvent)
public void removeEvent(ShadowMediaPlayer.MediaEvent event)
Removes the specified event from the playback schedule at all playback offsets where it has been scheduled.
event
- the event to remove.removeEventAtOffset(int,ShadowMediaPlayer.MediaEvent)


|
MOTS Finder
Find non-star-shaped MOTSs
|
Helper to find the initial MOTSs for a Brill-Lindquist-like metric. More...
Public Member Functions | |
| def | __init__ (self, metric, out_base=None, suffix='', kw) |
| Create an initial guess helper object. More... | |
| def | find_AH (self, m1, m2, d, hname='AH', kw) |
| Find the apparent horizon (AH). More... | |
| def | find_individual (self, hname, m, z, kw) |
| Find one of the two individual MOTSs. More... | |
| def | find_inner (self, c_AH, start_ex=-0.01, max_step=0.05, min_step=0.005, jump_mult=1, jump_offset=(), num=60, hname='inner', unload=True, back_kw=None, kw) |
| Try to find the inner MOTS by walking along an area-expansion curve. More... | |
| def | find_individuals (self, m1, m2, d, kw_top=None, kw_bot=None, unload=True, plot=False, plot_opts=None, kw) |
| Find the two individual MOTSs. More... | |
| def | find_four_MOTSs (self, m1, m2, d, kw_AH=None, kw_top=None, kw_bot=None, kw_inner=None, unload=True, plot=False, plot_opts=None, kw) |
| Find the two individual and the two common MOTSs. More... | |
| def | unload_data (self) |
| Unload any numerical data from the metric to free memory. More... | |
Public Attributes | |
| metric | |
| The metric supplied during construction. More... | |
| out_base | |
| The output base folder for storing (interim) results. More... | |
| suffix | |
| Suffix to use for filenames. More... | |
| opts | |
| Additional options for the .findmots.find_mots() calls. More... | |
Private Member Functions | |
| def | _find_inner (self, c_AH, start_ex, max_step, min_step, jump_mult, jump_offset, num, hname, back_kw, kw) |
| Implements find_inner(). | |
| def | _unload_after (self, unload=True) |
| Context to temporarily fix the evaluator(s) of used expressions. | |
| def | _find (self, hname, suffix='', unload=True, preset='discrete1', kw) |
| Construct the configuration and call find_mots(). | |
Helper to find the initial MOTSs for a Brill-Lindquist-like metric.
Note that the metric itself can be arbitrary (except it must be axisymmetric), so even non-time-symmetric metrics are supported. However, the ability to find the initial MOTSs depends on how well the actual metric resembles the Brill-Lindquist case. Most importantly, the apparent horizon and the two individual MOTSs have to be found using an assumed coordinate distance d
of the singularities and approximate individual (bare) masses m1
and m2
. The inner common MOTS is then found by walking along the area-expansion curve from the apparent horizon inward.
See the package documentation for motsfinder.axisym.initialguess for more information and examples.
| def __init__ | ( | self, | |
| metric, | |||
out_base = None , |
|||
suffix = '' , |
|||
| kw | |||
| ) |
Create an initial guess helper object.
| metric | The metric of the slice to find MOTSs in. Note that any non-zero extrinsic curvature has to be supplied by the metric as specified by the interface motsfinder.metric.base._ThreeMetric. |
| out_base | Optional folder to write interim results to. If given, a subfolder {out_base}/init is created and all found MOTSs and CESs are stored there. |
| suffix | Optional suffix for all files written. |
| **kw | Additional keyword arguments supplied to all .findmots.find_mots() calls. A notable one is verbose , which controls the printed output of all methods of this class. |
| def find_AH | ( | self, | |
| m1, | |||
| m2, | |||
| d, | |||
hname = 'AH' , |
|||
| kw | |||
| ) |
Find the apparent horizon (AH).
This is based on a (crude) estimate of the coordinate radius of the AH based on the bare masses and mutual coordinate distances of the two punctures.
| def find_four_MOTSs | ( | self, | |
| m1, | |||
| m2, | |||
| d, | |||
kw_AH = None , |
|||
kw_top = None , |
|||
kw_bot = None , |
|||
kw_inner = None , |
|||
unload = True , |
|||
plot = False , |
|||
plot_opts = None , |
|||
| kw | |||
| ) |
Find the two individual and the two common MOTSs.
Based on a Brill-Lindquist-like configuration given by m1
, m2
, d
, this method tries to find all the four MOTSs that can individually be obtained using find_AH(), find_individual() and find_inner(). See their documentation for more info.
| m1,m2 | Bare masses of the two punctures (i.e. Brill-Lindquist mass parameters). These do not need to be very accurate, they are just used for the initial round spheres' coordinate radii. |
| d | Rough coordinate distance of the punctures on the z-axis. Note that currently the punctures need to be approximately the same coordinate distance from the origin. |
| kw_AH,kw_top,kw_bot,kw_inner | Optional arguments for the individual find_...() calls. |
| unload | Whether to unload any numerical data from the metric afterwards. Default is True . |
| plot | Whether to plot the found MOTSs. Default is False . |
| plot_opts | Options supplied to the plotting command. |
| **kw | Common options for all find_...() calls. These are overridden by the individual kw_... arguments. |
| def find_individual | ( | self, | |
| hname, | |||
| m, | |||
| z, | |||
| kw | |||
| ) |
Find one of the two individual MOTSs.
| hname | "Name" of this MOTS. Should be either "top" or "bot" . |
| m | Bare mass of the puncture (i.e. Brill-Lindquist mass parameter). Does not need to be very accurate, it is just used for the initial round sphere's coordinate radius. |
| z | Rough coordinate location of the puncture on the z-axis. |
| **kw | Further keyword arguments used in the .findmots.find_mots() call. These override any keyword arguments given upon object construction. |
| def find_individuals | ( | self, | |
| m1, | |||
| m2, | |||
| d, | |||
kw_top = None , |
|||
kw_bot = None , |
|||
unload = True , |
|||
plot = False , |
|||
plot_opts = None , |
|||
| kw | |||
| ) |
Find the two individual MOTSs.
This calls find_individual() once for the top and once for the bottom MOTS and returns the resulting curves.
| m1,m2 | Bare masses of the two punctures (i.e. Brill-Lindquist mass parameters). These do not need to be very accurate, they are just used for the initial round spheres' coordinate radii. |
| d | Rough coordinate distance of the punctures on the z-axis. Note that currently the punctures need to be approximately the same coordinate distance from the origin. |
| kw_top,kw_bot | Extra arguments used in the .findmots.find_mots() call for finding the top and bottom MOTSs, respectively. |
| unload | Whether to unload any numerical data from the metric afterwards. Default is True . |
| plot | Whether to plot the found MOTSs. Default is False . |
| plot_opts | Options supplied to the plotting command. |
| **kw | Common options for both find_individual() calls. These are overridden by the individual kw_... arguments. |
| def find_inner | ( | self, | |
| c_AH, | |||
start_ex = -0.01 , |
|||
max_step = 0.05 , |
|||
min_step = 0.005 , |
|||
jump_mult = 1 , |
|||
jump_offset = () , |
|||
num = 60 , |
|||
hname = 'inner' , |
|||
unload = True , |
|||
back_kw = None , |
|||
| kw | |||
| ) |
Try to find the inner MOTS by walking along an area-expansion curve.
See figure 13 in [1] for an example and description of area-expansion curves. The idea here is basically that we start at the AH (the bottom dot at expansion zero) and walk along the curve to end up at the inner common MOTS. To accomplish this, we find constant expansion surfaces (CESs) of increasingly negative expansion until we are close to the minimum expansion. Extrapolating the previous shape change, we "jump" over the minimum and then find CESs of increasing expansion. This then leads to the inner common MOTS. This jump is currently done based on simple heuristics and hence is not robust, i.e. it may fail in particular situations. Usually, however, simply tweaking the jump_mult
parameter suffices to "make the jump".
Upon successful steps in expansion, the step size is increased by the "golden ratio" ((1+sqrt(5))/2
) to speed up the process. Failing steps are retried with a smaller step size. If the smallest step size has been reached this way, we define the current expansion as "close
enough" to the actual minimum and try to make the jump. Note that if this happens on our way back up to zero expansion, the MOTS probably does not exist and we give up instead.
A useful strategy for tweaking the settings in case the inner MOTS is not found successfully is to first let this function produce and store interim results up to the point it fails. Then, rerun it with the argument plot_steps=True
to see what the issue is. In most cases, the jump is either too large or too small and a human can easily identify the required changes to the strategy and tweak the jump_mult
parameter. In some cases (depending on how far apart the AH and inner MOTS already are), it may also be necessary to reduce or increase the scale of the minimum and/or maximum expansion step sizes using min_step
and max_step
, respectively. Other things to try include reducing the linear_regime_threshold
and/or step_mult
. As a last resort, you may specify jump_offset
coefficient to directly influence the shape of the jumped to guess.
| c_AH | Apparent horizon to start the CES progression. |
| start_ex | First (negative) expansion to try to find a CES for. This also becomes the first expansion step size tried. Default is -0.01 . |
| max_step | Maximum expansion step size. Default is 0.05 . |
| min_step | Smallest expansion step size. Default is 0.005 . |
| jump_mult | Factor by which to multiply the last shape change for jumping. Default is 1.0 . |
| jump_offset | Coefficients added to the horizon function for making the jump. |
| num | Resolution used for the curves during the search. Default is 60 . No check is done to ensure this resolution is sufficient to satisfy any tolerance for the expansion, i.e. the resulting surfaces are not necessarily accurate MOTSs. However, they should be ideal starting points for finding more accurate MOTSs. |
| hname | Name of this MOTS. Default is "inner" . |
| unload | Whether to unload any numerical data from the metric after finding the MOTS (or failing to find it). Default is True . Has no effect for metrics without an unload_data() method. |
| back_kw | Keyword arguments to update the search parameters with after a successful jump. Can be used, e.g., to increase the resolution on the way back up to the inner MOTS. |
| **kw | Additional keyword arguments supplied to the .findmots.find_mots() call. These may (partially) be overridden by back_kw applied after the jump. |
References
[1] D. Pook-Kolb, O. Birnholtz, B. Krishnan and E. Schnetter. "Existence and stability of marginally trapped surfaces in black-hole spacetimes." Physical Review D 99.6 (2019): 064005.
| def unload_data | ( | self | ) |
Unload any numerical data from the metric to free memory.
Note that this has no effect in case the metric does not have an unload_data()
method, as is the case for analytical metrics.
| metric |
The metric supplied during construction.
| opts |
Additional options for the .findmots.find_mots() calls.
| out_base |
The output base folder for storing (interim) results.
| suffix |
Suffix to use for filenames.


Switch To
Matrix Calculator
Mayan Abacus
Japanese Abacus
Chinese Abacus
Vertical Abacus
DNA Calculator
DNA Practice
Horizontal Abacus
Music Tool
Slide Abacus
Really Simple To-do List
Math Practice
Draggable/Slidable Abacus
Help
0
0
0
0
0
0
0
0
0
0
©YodaMaul Inc. 2014