macro-carousel
demos
Basic usage
Default navigation (previous/next)
Custom navigation (previous/next)
Pagination (dots)
Custom pagination (dots)
Infinite loop
Disable pointer events (a.k.a. drag)
Multiple slides per view
Auto focus
Reduced motion
Consuming the
macro-carousel-selected-changed
event
Adding/removing slides
Layout options
Responsive
No slides
Avoiding flashing content (loading strategies)
ES5
Back to code


Vaccines Progress
This graph is based on the latest government vaccine figures found here: https://coronavirus.data.gov.uk/.
New figures are usually published by 5pm. My algorithm grabs these numbers, and then updates the graph shown below, at 6pm (to allow for delays) everyday.


Web XR - GeoDomes
I’m launching a series of interactive called GeoDomes. It’s a 3d geodome that you place in the real world. you can create an entire virtual world inside of these and then give people the co-ordinates so that they can experience it. You can put these anywhere in the world as long as you know the co-ordinates but you can also use am in image or marker to trigger the GeoDome to appear. I built an interface to make it easy for anyone to create a geodome. Just 3 buttons and your done
Pick your project type
Please, select a project type.


|
UniversalDanmakuEngine
alpha 1.3.0
|
Struct that contains informations of key mapping More...
Public Attributes | |
| KeyCode | moveUp |
| KeyCode | moveDown |
| KeyCode | moveLeft |
| KeyCode | moveRight |
| KeyCode | shoot |
| KeyCode | slowMode |
Struct that contains informations of key mapping
Definition at line 57 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.moveDown |
Definition at line 60 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.moveLeft |
Definition at line 61 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.moveRight |
Definition at line 62 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.moveUp |
Definition at line 59 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.shoot |
Definition at line 63 of file UDEPlayer.cs.
| KeyCode SansyHuman.UDE.Object.UDEPlayer.KeyMappingInfo.slowMode |
Definition at line 64 of file UDEPlayer.cs.


Job Buster help:
This page shows the work results of Job Buster application. For more info please look at the recent talk.
For each spotted peak of job failures a top of recognized job clusters are shown. The color coding depends on an impact factor - walltime * cores loss. Each tile is clickable and goes to jobs selection.
* First number is the walltime lost within the peak. Second is the same value calculated over all analysed statistics
{% endif %}


BEFORE THE MADURAI BENCH OF MADRAS HIGH COURT DATED : 25/01/2007 CORAM : THE HONOURABLE Mr.JUSTICE DHARMA RAO ELIPE and THE HONOURABLE Mr.JUSTICE P.P.S.JANARTHANA RAJA W.P. (MD)NO.1277 OF 2006 and W.P.M.P.Nos.1432 & 3672 of 2006 of 2006. P.Krishnan .. Petitioner Vs 1.Tamil Nadu Pollution Control Board rep. by its Member Secretary 76, Mount Road, Guindy, Chennai 600 032. 2.The District Environment Engineer, Tamil Nadu Pollution Control Board, Tirnelveli 10. 3.The Commissioner Mannur Panchayat Union, Mannur, Tirunelveli District. 4.South India Bottling Company pvt. Ltd., Alsa Mall, 4 & 6, 3rd Floor, 149, Montieth Road, Egmore, Chennai 600 008. 5.State Industries Promotion Corporation of Tamil Nadu Ltd., (SIPCOT) 19-A, Rukmani Lakshmipathy Road, Egmore, Chennai 600 008. .. Respondents The above Writ Petition was filed under Article 226 of The Constitution of India praying for the issuance of a Writ of Certiorari to call for the records relating to the impugned Consent Order No.81/2004 dated 3.3.2005 - Proceedings No.DEE/TNV/F 1050/O/L/A/2005 dated 3.3.2005 passed by the respondents 1 & 2 and quash the same. !For Petitioner : Mr.G.R.Swaminathan ^For Respondents : Mr.R.Raman 1and 2 For 3rd Respondent : Mr.K.Mahendran For 4th Respondent : Mr.G.Masilamani, Sr.Counsel for Mr.K.Mthuramalingam For 5th Respondent : Mr.G.Praburajdurai for Mr.V.Ramalingam :ORDER
(Order of the Court was made by DHARMA RAO ELIPE, J.) The above writ petition was filed against the impugned Consent Order No.81/2004 dated 3.3.2005 - Proceedings No.DEE/TNV/F/1050/L/A/2005 dated 3.3.2005 passed by the first and second respondents in favour of the fourth respondent to start an Industry, on the ground that though the fourth respondent submitted an application dated 28.2.2005, the first respondent Board without observing the just formality of holding enquiry, in a mechanical manner ought not to have issued the Consent Order dated 3.3.2005. Therefore, it is contended by the learned counsel for the petitioner that the consent given by the first respondent was in contravention of Section 25 of the Water (Prevention and Control of Pollution) Act, 1974.
2.To test the veracity of the contention raised by the learned counsel for the petitioner, we have gone through the provisions of law applicable to the above said Act. Section 25 of the Act contemplates the restrictions on new outlets and new discharges. Subject to the provisions of this section, no person shall, without the previous consent of the State Board,-
a)establish or take any steps to establish any industry, operation or process, or any treatment and disposal system or any extension or addition thereto, which is likely to discharge sewage or trade effluent into a stream or well or sewer or on land; or
b)bring into use any new or altered outlet for the discharge of sewage; or
c)begin to make any new discharge or sewage:
Further sub section 2 of Section 25 of the Act contemplates that an application for consent of the State Board under sub-section (1) shall be made in such form, contain such particulars and shall be accompanied by such fees as may be prescribed. Sub section 3 of Section 25 of the Act is relevant for the purpose that the State Board may make such inquiry as it may deem fit in respect of the application for consent referred to in sub-section (1) of Section 25 of the Act and in making any such inquiry, shall follow such procedure as may be prescribed.
3.Therefore, the writ petition relying on sub section 3 of Section 25 of the Act contemplates for making such application for grant of consent of the Board in making any such inquiry as it may deem fit in respect of the application for consent referred to sub section 1 of Section 25 of the Act. In the case on hand, the fourth respondent admittedly was already granted permission to start the industry.
4.As seen from the counter filed by the fourth respondent, the fourth respondent applied for consent for establishing the unit to produce the following soft drink products by utlizing the water supplied by SIPCOT.
1. Coco Cola
2. Fanta
3. Limca
4. Thums Up
5. Carbonated/no carbonated
6. Spirte
7. Maza In the counter it is stated that the fourth respondent applied for consent to establish the soft drink manufacturing unit in the site of SIPCOT near Pirancheri Village of Tirunelveli District and the first respondent vide letter dated 25.10.2004 asked fourth respondent to furnish certain additional particulars. Thereafter, the fourth respondent also made a revised application dated 29.10.2004 to the first respondent. Thereafter on 21.10.2004 SIPCOT has agreed to supply 600 KLD of water to the fourth respondent subject to the availability. After secrutinising and complying with all the procedures, the first respondent issued the Consent Order to establish the unit under Section 25 of the Water (Prevention and Control of Pollution) act, 1974 as amended under Section 21 of the Air (Prevention and Control of Pollution) Act, 1981, vide proceedings dated 19.11.2004. Therefore, the fourth respondent obtained fresh allotment of water supply from SIPCOT vide letter dated 22.2.2005 and thereby the quantity of water supply was enhanced from 600 KLD to 900 KLD. Thereafter, on the basis of above additional water supply, on 28.2.2005 the fourth respondent applied for consent with the revised proposal on the treatment and disposal of domestic sewage and trade effluent. Since the original application dated 14.10.2003 was considered after thorough enquiry, the first respondent issued the revised consent to establish the unit for the enhanced production capacity vide proceedings dated 3.3.2005.
5.With regard to the counter filed by the first and second respondents, it is stated that as per the application submitted by the fourth respondent, enquiry was already conducted on 17.2.2006 to start the Industry as per Section 25 of the of the Water (Prevention and Control of Pollution) Act, 1974 and that the consent was given in accordance with the conditions laid down under section 25 of the Act.
6.The learned counsel for the fourth respondent in support of his contention submitted that the fourth respondent's unit falls under the category of food and beverage which was classified as orange category of Industries and hence there was no necessity of public hearing under the Environmental Impact Assessment Notification issued in the year 1994 by the Government of India.
7.After hearing the counsel appearing for parties and considering the fact that as on today, the above said Industry has not started its production, we cannot interfere with the utilisation of water supplied by SIPCOT. The main issue in the writ petition is with regard to the Consent Order given as per Section 25 of the Act on the basis of the application dated 28.2.2005 by respondents 1 and 2 on 3.3.2005 and the objection is that the consent was given without any proper enquiry as required under sub-section 3 of Section 25 of the act. But as stated above, the consent was given by the respondents 1 & 2 on 3.3.2005, only after conducting enquiry for expansion of the Industry. Therefore, it is open to the Board to conduct the public hearing if they deem it is necessary. Further, we notice that as per Section 27 of the Act the refusal or withdrawal of consent lies with the State board and as per Section 28 of the Act, any person aggrieved by an order made by the State Board under Section 25 of 26 or section 27 may, within thirty days from the date on which the order is communicated to him, prefer an appeal to the State Government, But the petitioner without availing the effective alternative remedy, straight away approached this Court. Therefore, on this ground also, the writ petition is liable to be dismissed.
8.We find no reason to interfere with the orders passed by the respondent Nos.1&2 in the writ petition and therefore the same is dismissed. No costs. Consequently, connected Miscellaneous Petitions are closed.
TO
1.The Member Secretary Tamil Nadu Pollution Control Board 76, Mount Road, Guindy, Chennai 600 032.
2.The District Environment Engineer, Tamil Nadu Pollution Control Board, Tirnelveli 10.
3.The Commissioner Mannur Panchayat Union, Mannur, Tirunelveli District.
4.South India Bottling Company pvt. Ltd., Alsa Mall, 4 & 6, 3rd Floor, 149, Montieth Road, Egmore, Chennai 600 008.
5.State Industries Promotion Corporation of Tamil Nadu Ltd., (SIPCOT) 19-A, Rukmani Lakshmipathy Road, Egmore, Chennai 600 008.


Koica planning to lend support in mine clearing
by Soth KoemsoeunThe Korea International Cooperation Agency (Koica) said on Wednesday it has embarked on a feasibility study – Project of Mine Action for Human Development Programme in Cambodia – to advance community development in villages that have been deemed mine-free.
“Upon the key findings, the Koica Cambodia office will report to its headquarters to select the priority projects for implementation in 2021.
“If this project passes selection, it will be implemented in Cambodia for 60 months from 2021 until 2025 with a total budget of $10 million,” Koica said.
On Thursday, Ly Thuch, the senior minister in charge of Special Missions and secretary-general of CMAA, said the government welcomed Koica’s humanitarian aid and development efforts.
Cambodia needs more funds to carry out mine and ordnance clearance activities across the country, Thuch said.
“We will implement the work of mine clearance in three provinces along the border – Battambang, Pailin and Banteay Meanchey. [The three provinces] are considered to be having the most mines in Cambodia.
“I hope that the Koica’s funds will help a large number of Cambodian people in these priority provinces,” he said.
He said for over 20 years, the authority had successfully removed mines from 1,900sq km. At present, the mine authority still needed more funds to carry out anti-person or anti-tank mine clearance plans until its target completion in 2025.
This year, more than 60 victims have been killed, injured, or disabled because of mines and ordnance explosion.


Messages
The meeting is cancelled
New product launch
Upcoming board meeting
Notifications
Just now
Private message
2 days ago


We'll find out if Boneworks is the future of VR on December 10
*Cracks Knuckles*
by Jordan DevoreStress Level Zero just announced a December 10, 2019 release date for Boneworks on Steam, and it's the kind of game that can sell itself with a single gif. (Okay, actually, let's make that two.)
It's the kind of game that comes with a "Hey, you should probably have prior VR experience" warning.
It's the kind of game you just want to explore, unwrap, and exist in.
I don't know if Boneworks will live up to expectations – people have been drawing parallels to Half-Life 2, which is no small feat – but I'm convinced it'll be an unforgettable physics-driven experience. Assuming, of course, you have a Valve Index (or a technophile friend to mooch off of). The game is also coming to Vive and Oculus Rift, but it makes the strongest case with Valve's Knuckle controllers.
I feel like we're peering into the eventual promise of VR gaming here: worlds that give you near-total control of your surroundings and encourage you to think outside the box every step of the way.
 That's enough on its own.
Boneworks [Steam]


killbelow - send a signal to all descendant processes
#include <sys/killbelow.h>
int killbelow(int signal, int timeout);
killbelow() sends the signal signal to all descendant processes. The timeout argument specifies the maximal interval in miliseconds to wait until there are no descendant processes.
killbelow() is most useful if a process calling it is a reaper for its descendant processes. Reaper status can be aquired by using procctl(2) with PROC_REAP_ACQUIRE or prctl(2) with PR_SET_CHILD_SUBREAPER.
Signal will be delivered to every descendant process even if its user ID is different from the process calling killbelow().
On success, a value of 0 is returned; meaning that there are no running descendant processes. A value of 1 indicates that the call timed out and there is at least one descendant process left.
On error, -1 is returned, and errno is set appropriately.
killbelow() will fail and no signal will be sent if:
Unprivileged processes don't have instruments to reliably terminate all its descendant processes. That functionality is especially missing in scripts. A script can have processes in its sub-process tree, that have different user ID aquired by calling sudo(1)/doas(1). However it can't even terminate such processes.
chroot(2), cgroups(7) and jail(8) usually need higher privileges or interfacing with a separate daemon.
Process groups and sessions are not a solution, because every process can call setpgid(2) or setsid(2).
On Linux a partial solution, that should cover most cases is to use pid_namespaces(7).
Name is intended to convey a meaning of sending of a signal to processes below in the process tree.
Author of this page is aware, that he possibly does not understand Unix or English.
if (killbelow(SIGTERM, 5000) > 0) {
killbelow(SIGKILL, 0);
}
reinvent it, poorly.


This site was created by Andrew Evans
The site is for wine enthusiasts and lets you share and save your favorites.
It's built with Angular, Firebase, Twilio, and is Open Source with the MIT License.
It is dedicted to Miss Rey Evans. She enjoys cuddling, playing, and chewing on cardboard. When asked her opinion of this site and she said it was...
PUUURRRRFFFEECT
Here she is in all her glory....


JSJaC Simple Client
Login
Jabber Server
(this probably won't be user editable in your real world application)
Jabber Server Domain Name
Username
Password
Register new account
Incoming:
Send Message
To:
*


Games
Games we created so far. Each game is free (as in beer) and open-source. We never put any advertising nor IAP in our games.
We made them because is’t our hobby not a job. If you like what we made and want to support us check donation page.
Games we created so far. Each game is free (as in beer) and open-source. We never put any advertising nor IAP in our games.
We made them because is’t our hobby not a job. If you like what we made and want to support us check donation page.


NHS Penalty Charge Notice
Penalty charge reference 639820475 {{pcnnumber}}
Details from the prescription
Prescription for:
Jane Doe
Address
3 Old Street, Town, City NE1 123
Prescription collected on or between:
1 July 2017 and 31 July 2017
Exemption selected:
Box L - "You were named on a current HC2 charges certificate” (NHS Low Income Scheme for full help)
Amounts due
Prescription charges: £8.60
Penalty charge: £50
Total due: £58.60
You have 4 weeks to pay (by 30 September 2017) or an additional penalty of up to £50 will be added to these charges.
Pay the penalty charge
You can pay all or part of the penalty charge now. The minium payment is £8.60. If you pay the minimum payment today there will be no further charges for 28 days.
Challenge the penalty charge
You can challenge this penalty charge if:
- between 1 July 2017 and 31 July 2017, you were entitled to free NHS health costs, or
- had a valid NHS exemption or prescription prepayment, or
- had a valid reason not to pay


My weird walk to work
If you like this post and would like to read more of my posts,
Subscribe!The walk
Intro
I’m sure a few other people do, or try to do this, so I’m not sure how unusual it is, but I thought I’d post about it regardless. I walk to work. Almost everyday. And usually (like a good engineer ;) ), if I do something repeatedly, I try to optimize it. With code, with life. So, now that it’s been a few months of walking to work in Seattle, I think I can present my learnings.
The process
I began by timing myself, so I have a fair idea of how long I take to get to work. This lets me leave as late as possible (not a morning person) while hopefully making it for meetings. After a few days of timing myself, I realized that traffic lights were the biggest factor in how much time it takes me to get to work. I could walk slowly or run, but if I didn’t make the light, I was blocked.
As a result, an interesting strategy is to stay diagonally opposite from your end-point (that way you can take the traffic light to the front, even if the one to side is blocked - or vice versa).
The only other useful decision is deciding between stop signs that let you through with a consistent delay, or traffic lights which may let you through with no delay (although you should stop and look both ways before crossing in any case).
The route
Now, on to the specific intersections. The first useful intersection is the blue dot. If I get on the other side of this road (north of E Pike St), then I can avoid the light at Boren & Pike. If I miss this (and walk at normal pace), I incur a delay of around 10-15 seconds. That’s boring. Now, for the fun part.
It might seem like taking every traffic light that is open is going to be optimal (greedy approach), but the world doesn’t work that way (as stated earlier). This brings us to the second interesting intersection - the green dot. Here, if I stay to the east of Boren, I get to cross Pine BEFORE I would have if I was on the west of Boren. That’s because cars on Boren take a left turn and so, the signal for pedestrians changes later. So, it is always beneficial to stay on the east of Boren (going north) at this intersection.
Next up is the black squiggly line, which until recently was blocked due to construction. This meant I had to get on the west of Boren before this. That can usually be achieved at either of the two intersections prior to it (on Pine or Olive Way). Then, you might have to cross at a red light (no idea why the light is red for both vehicles & pedestrians).
The next decision is whether to cross back across Boren at Howell or not. This is only worth it if you can’t cross Howell, or you want to take the bus (pink). If Howell is not crossable (red light), then cross on Boren, and walk till the bus stop. A good way to figure out if the bus is coming (without an app) is to see how many people are around. If there’s no one, walking is probably going to be quicker (in that case, cross at Denny to the other side). If the bus is coming, take it down Fairview & get to work.
It is usually good to be able to see the lights in front of you, so that if you are in a rush, you can run and make it. It is not possible to time the first light (the blue dot), but once you get onto Boren, you can time it almost perfectly so you hit all the lights correctly to Denny. This involves going straight on Boren till the black squiggly line and timing your crossing of Olive Way so you cross without stopping at Howell. Another partly unnecessary red light (at times red for both pedestrians & vehicles) appears just south of the pink mark). Then, you can jog on Fairview (west side of the pink mark) to cross Denny in one go from the west of Boren.
Google Maps initially suggested crossing at the yellow dot (now blocked), but that was near impossible to cross, and waiting for an opening in traffic was slower than crossing at the traffic light. Bad Google!
The way back
On the way back, I don’t optimize much as I am usually tired (and it is uphill). The only decision I make is not to go straight on Boren as I live east of Boren and I prefer stop signs to traffic lights at that point :)
Conclusion
You can save upto 5 minutes everyday, and get to your meetings on time! If you find this weird, you are probably not alone. I also read on the way to work, thus getting in around 30 mins of reading a day).


LEARN. SHARE. CONNECT. We live by this motto. ITNEXT SUMMIT 2018 is an event where innovative companies and people will demystify their products and knowledge, showing the tech behind the solutions of tomorrow. With the Summit, we extend our community and create another great opportunity for connecting, broadening and deepening knowledge! We will showcase the tech and skills necessary to build a scalable application in a time where time-to-market is one of the most critical factors. So enjoy our inspirational business track to hear about success and lessons learned from market leaders. If you are looking for more tech-savvy talks and hands-on sessions, join our technical track where we will discuss next-gen frontend development, backend development, network, cybersecurity, cloud-native infrastructure, data engineering and low-code development.


Logged in: {{user}}
View Users(Admin Only)
Logout
Basketball App
Welcome Home
Player Information
Player Statistics
Player Injury
Team
Team Statistics
Coach
Divisions
Attendance
Referee Information
Champions
Search Player
Search Team


If an app doesn't work for you,
it doesn't work!
Why? Technology developers make websites, mobile apps, and other tools specifically for Miami-Dade County residents. As part of the CUTGroup, you'll help developers make their software better -- which will help make people's lives better.
Who? You! We are looking for residents from all over Miami-Dade County, who use different types of devices, browsers, and operating systems. No tech experience necessary!
Don't forget to tell your friends!
Where? Testing will happen all over Miami-Dade County in different locations. A network of more than 250 places in the city where internet and computer access, digital skills training, and online learning resources are available – for free.


Please check back in late December for our new Manifold website.
The new site will provide details about the platform, installation and setup instructions, as well as documentation describing how to incorporate Manifold editions into your existing production processes.
In the meantime, please read about recent releases on our
development blog and view our
staging site for an example of Manifold in action.
Follow Manifold's day-to-day development on
Github.


Kube-OIDC-Proxy Demo
menu
Kube-OIDC-Proxy Demo
This demo will help you to understand the use cases for
kube-oidc-proxy
.
#CONTENT#


This example shows an alternative way of defining dimension or metric filters by using functions from the ganalytics
package. The current development version of googleAnalyticsR
supports filters defined with ganalytics
. ganalytics
provides functions that makes it easy to define filters using natural R language operators. As of the most recent update to this site, this requires a “dev” (development) version of two packages(both packages exist on CRAN, but they require the dev versions to use the examples here):
googleAnalyticsR
ganalytics
This actually means this example has the incidental educational value of showing how to use packages from GitHub! You can read up on the purpose of ganalytics
– developed by Johann de Boer – on GitHub. But, in short, it’s intended to “support R users in defining reporting queries using natural R expressions instead of being concerned about API technical intricacies like query syntax, character code escaping and API limitations.”
This example requires development versions of the googleAnalyticsR
(>=<IP_ADDRESS>00) and ganalytics
(>=<IP_ADDRESS>00) R packages available on GitHub, so the setup code below is a bit different (it has some additional code for loading a couple of packages from GitHub).
Be sure you’ve completed the steps on the Initial Setup page before running this code.
For the setup, we’re going to load a few libraries, load our specific Google Analytics credentials, and then authorize with Google.
# Load the necessary libraries. These libraries aren't all necessarily required for every
# example, but, for simplicity's sake, we're going ahead and including them in every example.
# The "typical" way to load these is simply with "library([package name])." But, the handy
# thing about using the approach below -- which uses the pacman package -- is that it will
# check that each package exists and actually install any that are missing before loading
# the package.
if (!require("pacman")) install.packages("pacman")
pacman::p_load(tidyverse, # Includes dplyr, ggplot2, and others; very key!
devtools, # Generally handy
googleVis, # Useful for some of the visualizations
scales) # Useful for some number formatting in the visualizations
# A function to check that a sufficiently current version of a specific package is
# installed and loaded. This isn't particularly elegant, but it works.
package_check <- function(package, min_version, github_location){
# Check if ANY version of the package is installed. This is clunky, but p_load_current_gh
# wasn't playing nice (and this does need some conditional checking.)
if(package %in% rownames(installed.packages())){
# IF a version of the package is already installed, then check the *version* of that
# package to make sure it's current enough. If it'snot, then re-install from GitHub
if(packageVersion(package) < min_version) {
devtools::install_github(github_location)
}
} else {
devtools::install_github(github_location)
}
# Load the package
library(package, character.only = TRUE)
}
# As needed, install and load googleAnalyticsR and ganalytics from GitHub
package_check("googleAnalyticsR", "<IP_ADDRESS>01", "MarkEdmondson1234/googleAnalyticsR")
package_check("ganalytics", "<IP_ADDRESS>00", "jdeboer/ganalytics")
# Authorize GA. Depending on if you've done this already and a .ga-httr-oauth file has
# been saved or not, this may pop you over to a browser to authenticate.
ga_auth(token = ".ga-httr-oauth")
# Set the view ID and the date range. If you want to, you can swap out the Sys.getenv()
# call and just replace that with a hardcoded value for the view ID. And, the start
# and end date are currently set to choose the last 30 days, but those can be
# hardcoded as well.
view_id <- Sys.getenv("GA_VIEW_ID")
start_date <- Sys.Date() - 31 # 30 days back from yesterday
end_date <- Sys.Date() - 1 # Yesterday
If that all runs with just some messages but no errors, then you’re set for the next chunk of code: pulling the data.
In this example, we’ll define the following filters: * Device category is desktop or tablet - a dimension filter using an OR condition. * New visitors using either a desktop or tablet device - a dimension filter involving both an AND and an OR condition. * At least one goal completion or transaction - a metric filter using an OR condition.
The above list of filters will be defined using ganalytics
expressions as follows:
# Device category is desktop or tablet - a dimension filter using an OR condition.
desktop_or_tablet <- Expr(~deviceCategory == "desktop") | Expr(~deviceCategory == "tablet")
# New visitors using either a desktop or tablet device - a dimension filter involving both an AND and an OR condition.
new_desktop_and_tablet_visitors <- Expr(~userType == "new") & desktop_or_tablet
# At least one goal completion or transaction - a metric filter using an OR condition.
at_least_one_conversion <- Expr(~goalCompletionsAll > 0) | Expr(~transactions > 0)
We can now use googleAnalyticsR
to pull the data. Chances are, the table below will only show a desktop row. That’s because the site we use for this doesn’t have a ton of traffic, and it rarely gets tablet conversions! But, trust us, this would return multiple rows on a site with more traffic and conversions.
# Pull the data
results <- google_analytics(
viewId = view_id,
date_range = c(start_date, end_date),
metrics = c("users", "sessions", "goalCompletionsAll", "transactions"),
dimensions = c("deviceCategory", "userType"),
dim_filters = new_desktop_and_tablet_visitors,
met_filters = at_least_one_conversion
)
# Display the results
results
| deviceCategory | userType | users | sessions | goalCompletionsAll | transactions |
|---|---|---|---|---|---|
| desktop | New Visitor | 3433 | 3416 | 12 | 0 |
This site is a sub-site to dartistics.com


Arbitrary Style Transfer in the Browser
This site may have problems functioning on mobile devices. Don't worry, you can still read the description below!
Stylize an image
Combine two styles
Upload
Record
Style image size
Select a style
Select from file
Random image from wikiart.org
udnie
stripes
bricks
clouds
towers
sketch
seaport
red_circles
zigzag
Stylization strength
Loading stylization model. Please wait..
Style A Size
Select a style
Select from file
Random image from wikiart.org
udnie
stripes
bricks
clouds
towers
sketch
seaport
red_circles
zigzag
Style B Size
Select a style
Select from file
Random image from wikiart.org
udnie
stripes
bricks
clouds
towers
sketch
seaport
red_circles
zigzag
Content image size
Select content
Take a picture
Select from file
stata
diana
golden_gate
beach
chicago
statue_of_liberty
Stylization Ratio
Loading stylization model. Please wait..
[Fast] Distilled MobileNet style model (9.6MB)
[High quality] Original Inceptionv3 style model (36.3MB)
[Fast] Separable_conv2d transformer (2.4MB)
[High quality] Original transformer model (7.9MB)
Take a snapshot!
×


Simple State Manager (SSM for short) is a javascript state manager for responsive websites. It is built to be light weight, has no dependencies (except javascript of course) and aims to be really easy to simply drop into your project ready to use.
DownloadAs a state manager, SSM allows you to target different javascript towards different states of your site. It allows you to define as many states as your site requires and allows you to have independent Enter, Leave and Resize events for each of the states.
To get started with SSM the first step is to include it in your project, you can do this in two ways
bower install SimpleStateManager
With Simple State Manager you can add multiple states based on your needs, the most simple way to add a state is to simply pass the information about your state to SSM using ssm.addState
. You are able to add as many states as you need, your states are able to overlap and your states can each have their own onEnter
, onLeave
and onResize
events. It is important to remember that the if you do not pass minWidth and maxWidth values they will revert to the default values (0 for minWidth and 99999 for maxWidth)
ssm.addState({ id: 'mobile', maxWidth: 767, onEnter: function(){ console.log('enter mobile'); } }); ssm.addState({ id: 'tablet', minWidth: 768, maxWidth: 1023, onEnter: function(){ console.log('enter tablet'); } }); ssm.addState({ id: 'desktop', minWidth: 1024, onEnter: function(){ console.log('enter desktop'); } });
If you wish to use one command to add multiple states using one command you can use ssm.addStates to which you should pass an array of states.
ssm.addStates([ { id: 'mobile', maxWidth: 767, onEnter: function(){ console.log('enter mobile'); } }, { id: 'tablet', minWidth: 768, maxWidth: 1023, onEnter: function(){ console.log('enter tablet'); } }, { id: 'desktop', minWidth: 1024, onEnter: function(){ console.log('enter desktop'); } } ]);
Sometimes it may be necessary to remove a state, if we have the id for the state we can easily remove the state, to remove the mobile state from our above example we simply use:
ssm.removeState('mobile');
Or if you want to remove multiple at the same time
ssm.removeStates(['tablet', 'mobile']);
Once you have finished setting up your states you should run ssm.ready()
which will setup the states.
ssm.ready();
As SSM is chaninable you can fire the ssm.ready()
method by simply adding .ready()
onto your original command
ssm.addState({ id: 'mobile', maxWidth: 767, onEnter: function(){ document.getElementById('hero').style.backgroundColor = "#daa23e"; } }).ready();
In SimpleStateManager options we pass to our states are called config options, we are able to add new config options to SimpleStateManager using ssm.addConfigOption
ssm.addConfigOption({name:"maxWidth", test: function(){ if(typeof this.state.maxWidth === "number" && this.state.maxWidth >= this.browserWidth){ return true; } else{ return false; } }});
This is the same method that SimpleStateManager uses to add the maxWidth config option so the example above is taken direct from the SimpleStateManager source. As you will notice we can use this
to access the state we are testing to determine whether the test should pass or fail.
Some simple examples of tests that you could add to SimpleStateManager are:
| Method | Description |
|---|---|
| ssm.addState | Add a new state, expects an object literal, properties avaliable - id (optional), minWidth (optional), maxWidth (optional), onEnter (optional), onResize (optional), onLeave (optional) |
| ssm.updateState | Update an existing state, expects two parameters, firstly the id of the state you wish to update and secondly an object literal of updated settings, properties avaliable - id (optional), minWidth (optional), maxWidth (optional), onEnter (optional), onResize (optional), onLeave (optional) |
| ssm.addStates | Add multiple new states, expects an array of object literals, properties avaliable - id (optional), minWidth (optional), maxWidth (optional), onEnter (optional), onResize (optional), onLeave (optional) |
| ssm.removeState | Remove a state, expects one property, the id of the state to be removed. |
| ssm.removeStates | Remove multiple states, expects an array of strings |
| ssm.removeAllStates | Clears all states from SSM |
| ssm.getStates | By default ssm.getStates() will return all the states added to SSM however you optionally can pass an array of ID's of the states you want e.g ssm.getStates([ 'mobile' ,'desktop']); |
| ssm.getCurrentStates | Get the currently applied states |
| ssm.ready | Tells the page that states have been added and we can fire the onEnter event for the current state/states. |
| ssm.getBrowserWidth | Get the current value of the browser width |
| ssm.setResizeTimeout | Set the value of the timeout used for the resize debounce |
| ssm.getResizeTimeout | Get the current value the resize timeout |
| ssm.addConfigOption | SSM allows you to define new rules by which a state can be enabled and disabled using ssm.addConfigOption . The method takes an object with 2 values as the parameter, firstly the name of the config option and secondly the method to test the option. Please note the test must return true or false to allow SSM to know if the test has passed or failed. A typical example of how you can add a test ssm.addConfigOption({name: "minHeight", test: function(){ return true; } }); |
One of the core features we integrated into SimpleStateManager 2.x is that we expose a lot more API's to access some of the values that are used everyday in responsive sites. The benefit of this is that it means SSM can be extended with new plugins that add extra functionality with ease.
If you decide to distribute your plugins and you add them to bower, please prefix the name of your plugin with SSM-
so that they are easy to find.
;(function ( $, window, document, undefined ) { var pluginName = "defaultPluginName", defaults = { propertyName: "value" }; // The actual plugin constructor function Plugin ( element, options ) { this.init(); } Plugin.prototype = { init: function(){ } } if(!ssm[pluginName]){ ssm[pluginName] = new Plugin(); } })( jQuery, window, document );
There are a growing number of official plugins for SimpleStateManager
While working on SSM 2.0 we explored ways in which we could make SSM easier to debug, we started by making a lot more of the SSM variables accessable however we wanted to take it a step further. Due to security restrictions of the browser a Chrome Extension wouldn't work so instead we decided to create a simple bookmarklet which adds a debugger to the page.
The debugger is very much an early alpha build and will be improved over time.
To get started with the SSM 2.0 debugger simply drag the SimpleStateManager Bookmarklet to your bookmarks bar
There are a number of browsers that we have tested support, as we test more browsers we will update this list
SimpleStateManager follows Semantic Versioning 2.0.0
Anybody is welcome to contribute to this project, this is a community led library and you can get involved in the following ways
Typically master is the latest version of SSM, new features are pushed into branches and when a branch has been fully tested and all the features are complete it will be merged into master. The milestone assigned in GitHub should be used for the branch name.
License: MIT (http://www.opensource.org/licenses/mit-license.php)
The MIT License (MIT)
Copyright (c) 2013 Jonathan Fielding
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


{{Infobox prepared food | name = Prinzregententorte | image = | caption = A slice of prinzregententorte | alternate_name = | country = Germany | region = Bavaria | creator = | course = | type = Cake | served = | main_ingredient = Sponge cake, chocolate buttercream, chocolate glaze | variations = | calories = | other = }}
Prinzregententorte is a Bavarian torte, which consists of at least six, mostly seven, thin layers of sponge cake interlaid with chocolate buttercream and a topping of apricot jam upon the very last. The exterior is covered in a dark chocolate glaze.
The Prinzregententorte is very popular in Bavaria, available in cake shops all year round.
Contents |
The cake is named after Prince Regent Luitpold, who was prince regent of Bavaria beginning in 1886. Its exact origin remains in dispute; among those claimed as its creators are the prince regent's cook, Johann Rottenhoeffer, the baker Anton Seidl, and the baking firm of Heinrich Georg Erbshäuser.
Typically, the cake consists of very thin layers of sponge cake, each approximately {{convert|25|cm}} in diameter, with chocolate buttercream on each side. Apricot jam may be added to the topmost layer, and the whole cake is covered in dark chocolate.
{{no footnotes|date=February 2013}}
{{Cakes}} {{Chocolate desserts}}


Weekly news quiz: Tax denials, Christmas lights and 'outdated cultural depictions'
by Stephen McNeiceAnother week, a lot of news: the election campaign has picked up pace in the UK, while public impeachment hearings are now underway in the US.
Back home, it was a bad week for Fine Gael TD Maria Bailey as she was deselected for the general election in her constituency.
Meanwhile, one of the biggest social media talking points of the week in Ireland was a surprisingly controversial choice for Dublin's Christmas lights...
Test your knowledge of all these stories and more with our weekly news quiz...


The Form.io form builder interface allows you to embed a form builder within your application, which generates a JSON schema of the form created.
One of the features of builder that user can change different options.
For example language. Options can be provided via [options]
property.
<form-builder [form]="form" [options]="options"></form-builder>
Options can be look like:
exprort const options = {
language: 'en',
i18n: {
jp: {
'Label': 'ラベル',
'Label Position': 'ラベルの位置',
'Placeholder': 'プレースホルダー',
'Description': '説明文'
}
}
}
Also builder can be updated with the new options via
[rebuild]
<form-builder [form]="form" [options]="options" [rebuild]="rebuildEmitter.asObservable()"
Rebuid emitter can be Observable and used to set the new options like this:
this.rebuildEmitter.next(this.options)


@* * Copyright 2019 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import uk.gov.hmrc.play.views.html.helpers._ @import uk.gov.hmrc.cbcrfrontend.views.html._ @import uk.gov.hmrc.cbcrfrontend.model.CBCId @import uk.gov.hmrc.cbcrfrontend.controllers.routes @import helper._ @import uk.gov.hmrc.cbcrfrontend.config.FrontendAppConfig @import tags._ @(form:Form[_])(implicit request: Request[_], messages: Messages, lang: Lang, config:FrontendAppConfig) @isError= @{form.hasErrors} @main_template(Messages("start.mainHeading")) {


Sturmian words
07 Sep 2017Hi, this is the second post by Pablo Rotondo. This one is about sturmian words, and sometimes refers to the first post about continued fractions, that you can found here.
Sturmian words are infinite words ${\bf{u}}=u_0u_1\ldots\in \mathcal{A}^\infty$ (sequences of symbols $u_i$ from an alphabet $\mathcal{A}$) that have numerous characterizations, as the coding of digital lines, as rotation sequences, minimal complexity sequences…
A first definition
Definition [Sturmian word] Consider $\alpha,\beta \in [0,1)$ with $\alpha$ irrational. We define infinite words and by
and
for each $n\in \mathbb{N}$. A binary word ${\bf{u}} \in {0,1}^\infty$ is Sturmian if and only if it is of the form , or for some $\alpha,\beta$ as above. The irrational number $\alpha$ is called the slope of the word $\bf{u}$.
Remark Observe that if ${\bf{u}}=\underline{s}_{\alpha,\beta}$
where denotes the number of ones in the word. Thus $\alpha$ represents the frequency of ones. Clearly the same result is true when by the same argument.
Sturmian words as circle rotations
The above definition can be seen more intuitively as the binary coding of the trajectory of a point on a circle of circumference $1$. This circle is realized as the interval $[0,1]$ identifying $0$ and $1$, that is, taking fractional parts $x\mapsto {x}$ or, equivalently, modulo one $x\mapsto x \bmod 1$.
Indeed, observe that
for some integer $m$. By taking $\bmod 1$ it is immediately seen that this means that
A similar definition can be done for by reversing the close-open in the border of the intervals. In terms of the circle, this reads: start from a point on the circle and rotate an arc-length of $\alpha$ on each discrete time , then code the resulting points by $1$ when they belong to and $0$ when they belong to .
Factors of Sturmian words.
The finite patterns appearing within our infinite words ${\bf{u}}$ are a fundamental object of study in the field of Combinatorics of Words. We say that $w\in {0,1}^m$ is a factor of ${\bf{u}}$ if, for some index $i\geq 0$, we have
and say that $m$ is its length.
We have seen that digits in a Sturmian word ${\bf{u}}$ correspond to intervals $I_0$ and $I_1$, this process can be iterated to explain what happens with larger factors $w\in {0,1}^m$. The result being that factors are in correspondance with the circle intervals delimited by
modulo $1$.
Remark [Complexity of a Sturmian word] Since $\alpha$ is irrational, the points
modulo $1$ are all distinct.
Thus the the above points delimit $m+1$ circle intervals: we have $m+1$ factors $w\in {0,1}^m$ of length $m$ appearing in $\bf{u}$. This is the smallest possible number of factors of length $m$ in the sense that, if we had at most $m$ factors of length $m$ for some $m$, our words would be eventually periodic.
The intervals-factor correspondence is independent from $\beta$. In particular, the set of factors of length $m$ appearing within ${\bf{u}}$ depends only on the choice of $\alpha$. Furthermore, the sequence ${n\alpha}$ is equidistributed (also known as uniform distribution $\bmod. 1$) meaning that the proportion of the time it spends on an interval $I$ tends to its length . Thus the initial point $y_0=\beta$ is not really important for our purposes.
The smallest (least frequent) interval delimited by
in fact corresponds to the one given by $0$ and , where , and has length , by the Theorem of the Best approximation section in the previous post.