Sheet1
| DOWNHILL |
BEGINNER |
MEN |
MASTER |
40-49 |
ONE-DAY |
Jorgenson |
Chris |
403 |
|
7:06 |
1st |
| DOWNHILL |
BEGINNER |
MEN |
MASTER |
40-49 |
ONE-DAY |
Thead |
Cobey |
409 |
|
999 |
999 |
| DOWNHILL |
EXPERT |
MEN |
SENIOR |
19-29 |
B0110253 |
Williams |
Cal |
13 |
|
4:53 |
1st |
| DOWNHILL |
EXPERT |
MEN |
SENIOR |
19-29 |
|
Ortega |
Joe |
5 |
|
5:33 |
2nd |
| DOWNHILL |
EXPERT |
MEN |
SENIOR |
19-29 |
ANNUAL |
Marks |
Kail |
23 |
|
5:41 |
3rd |
| DOWNHILL |
EXPERT |
MEN |
SENIOR |
19-29 |
ANNUAL |
Andrews |
Kyle |
6 |
|
10:32 |
4th |
| DOWNHILL |
EXPERT |
MEN |
MASTER |
30-39 |
B0008385 |
Curran |
Jim |
99 |
|
6:11 |
1st |
| DOWNHILL |
EXPERT |
MEN |
MASTER |
50-99 |
ANNUAL |
Hamilton |
Larry |
8 |
|
7:04 |
2nd |
| DOWNHILL |
JUNIOR |
MEN |
JUNIOR |
17-18 |
|
Sheets |
Casey |
406 |
|
7:24 |
1st |
| DOWNHILL |
SPORT |
MEN |
SENIOR |
19-29 |
|
Denman |
Troy |
222 |
|
5:23:00 |
1st |
| DOWNHILL |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Jam |
Burke |
213 |
|
6:30 |
5th |
| DOWNHILL |
SPORT |
MEN |
MASTER |
30-39 |
ONE-DAY |
Montoya |
Leo |
215 |
|
5:45 |
3rd |
| DOWNHILL |
SPORT |
MEN |
MASTER |
30-39 |
B0172532 |
Witt |
Jason |
216 |
|
999 |
999 |
| DOWNHILL |
SPORT |
MEN |
MASTER |
40-49 |
B0148201 |
Mysse |
Steve |
201 |
|
6:03 |
4th |
| DOWNHILL |
SPORT |
MEN |
MASTER |
50-99 |
B0031827 |
Schuff |
Leonard |
203 |
|
5:42 |
2nd |
| DOWNHILL |
SPORT |
WOMEN |
SENIOR |
19-29 |
|
Rogers |
Cheyenne |
352 |
|
7:58 |
1st |
| DOWNHILL |
SPORT |
WOMEN |
MASTER |
30-39 |
|
Rydquist |
Sue |
349 |
|
8:00 |
2nd |
| CROSS-COUNTRY |
BEGINNER |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Uhre |
Judd |
421 |
|
32:51:00 |
1st |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
30-39 |
ONE-DAY |
Best |
Dave |
402 |
|
35:16:00 |
2nd |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
40-49 |
|
Spaid |
Tom |
400 |
|
35:29:00 |
3rd |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
40-49 |
ONE-DAY |
Sullivan |
Chris |
401 |
|
39:34:00 |
5th |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
40-49 |
ONE-DAY |
Thead |
Cobey |
409 |
|
28:46:00 |
1st |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
40-49 |
ONE-DAY |
Gomez |
Rick |
413 |
|
31:22:00 |
2nd |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
50-99 |
ONE-DAY |
Winner |
Randy |
416 |
|
35:42:00 |
4th |
| CROSS-COUNTRY |
BEGINNER |
MEN |
MASTER |
50-99 |
ONE-DAY |
Hinckly |
Dan |
417 |
|
999 |
999 |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
SENIOR |
19-29 |
ONE-DAY |
Baker |
Christina |
355 |
|
28:29 |
1st |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
SENIOR |
19-29 |
ONE-DAY |
Stielow |
Jennifer |
356 |
|
40:18 |
2nd |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
SENIOR |
19-29 |
ONE-DAY |
Gilley |
Allison |
357 |
|
48:43 |
3rd |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
SENIOR |
19-29 |
|
Hall |
Amy |
358 |
|
1:01:09 |
4th |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
MASTER |
30-39 |
ONE-DAY |
Kirkness |
Shelly |
360 |
|
54:30 |
2nd |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
MASTER |
30-39 |
ONE-DAY |
Sullivan |
Marsha |
351 |
|
1:05:36 |
3rd |
| CROSS-COUNTRY |
BEGINNER |
WOMEN |
MASTER |
30-39 |
ONE-DAY |
Wilson |
Vanessa |
354 |
|
41:22 |
1st |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
|
Petrone |
Kevin |
1 |
|
999 |
999 |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
B0110253 |
Williams |
Caz |
13 |
|
999 |
999 |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
|
Mundt |
Shane |
11 |
|
2:00:37 |
2nd |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
B0176438 |
Rucker |
Jim |
12 |
|
1:49:37 |
1st |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
B0118322 |
Ford |
Parker |
14 |
|
999 |
999 |
| CROSS-COUNTRY |
EXPERT |
MEN |
SENIOR |
19-29 |
B0002749 |
Barry |
Shawn |
15 |
|
2:07:01 |
3rd |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B0130581 |
Hall |
Jeff |
3 |
|
2:16:21 |
5th |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B0040304 |
Smith |
Todd |
4 |
|
1:56:42 |
1st |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B0080182 |
Sicz |
Wayne |
33 |
|
1:57:50 |
2nd |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B0008385 |
Curran |
Jim |
99 |
|
2:32:53 |
6th |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B0150981 |
Peacock |
Brent |
1 |
|
2:12:48 |
4th |
| CROSS-COUNTRY |
EXPERT |
MEN |
MASTER |
30-39 |
B135867 |
Piva |
Orlando |
16 |
|
2:11:02 |
3rd |
| CROSS-COUNTRY |
EXPERT |
WOMEN |
MASTER |
40-49 |
B0008730 |
Davies |
Mary Ann |
100 |
|
2:03:11 |
1st |
| CROSS-COUNTRY |
EXPERT |
WOMEN |
SENIOR |
19-29 |
|
Davies |
Jessica |
101 |
|
1:49:45 |
1st |
| CROSS-COUNTRY |
EXPERT |
WOMEN |
SENIOR |
19-29 |
B0153626 |
Ducharme |
Lisa |
102 |
|
2:01:09 |
2nd |
| CROSS-COUNTRY |
EXPERT |
WOMEN |
SENIOR |
19-29 |
B0104315 |
Villasenor |
Tierra |
103 |
|
2:19:06 |
3rd |
| CROSS-COUNTRY |
Junior |
MEN |
Junior |
X |
B0172534 |
Schultz |
Andy |
407 |
|
1:06:33 |
3rd |
| CROSS-COUNTRY |
Junior |
MEN |
Junior |
X |
B81248842 |
Rowe |
Denny |
420 |
|
1:02:57 |
1st |
| CROSS-COUNTRY |
Junior |
MEN |
Junior |
X |
ONE-DAY |
Lee |
Ryan |
412 |
|
1:25:25 |
5th |
| CROSS-COUNTRY |
Junior |
MEN |
Junior |
X |
|
Onken |
Logan |
415 |
|
1:06:33 |
2nd |
| CROSS-COUNTRY |
Junior |
MEN |
Junior |
X |
|
Schultz |
Sam |
418 |
|
1:06:33 |
4th |
| CROSS-COUNTRY |
JUNIOR |
MEN |
JUNIOR |
13-14 |
ONE-DAY |
Ringer |
Robby |
408 |
|
33:08 |
3rd |
| CROSS-COUNTRY |
JUNIOR |
MEN |
JUNIOR |
13-14 |
B0150772 |
Sicz |
David |
500 |
|
33:18 |
4th |
| CROSS-COUNTRY |
JUNIOR |
MEN |
JUNIOR |
13-14 |
B0174246 |
Winner |
Cris |
419 |
|
29:11 |
1st |
| CROSS-COUNTRY |
JUNIOR |
MEN |
JUNIOR |
11-12 |
|
Hense |
Doug |
414 |
|
55:36 |
5th |
| CROSS-COUNTRY |
JUNIOR |
MEN |
JUNIOR |
14-15 |
ONE-DAY |
Kelso |
Michael |
411 |
|
30:25 |
2nd |
| CROSS-COUNTRY |
JUNIOR |
WOMEN |
JUNIOR |
13-14 |
ONE-DAY |
Sullivan |
Sabina |
359 |
|
1:05:32 |
1st |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
|
Sundstrom |
Eric |
202 |
|
1:21:35 |
4th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Russell |
Jason |
214 |
|
1:51:32 |
10th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
|
Denman |
Troy |
222 |
|
1:20:22 |
3rd |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Walkoviak |
Sam |
217 |
|
1:31:59 |
8th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Walsh |
Brooks |
221 |
|
1:54:09 |
11th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Warner |
Derek |
224 |
|
1:24:18 |
7th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Prigge |
Justin |
225 |
|
1:19:08 |
2nd |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
ONE-DAY |
Warren |
Eric |
228 |
|
1:43:06 |
9th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
B0162732 |
Canning |
Barrett |
229 |
|
1:22:11 |
6th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
B0013907 |
Grant |
Mike |
233 |
|
1:21:54 |
5th |
| CROSS-COUNTRY |
SPORT |
MEN |
SENIOR |
19-29 |
B0184299 |
Saday |
Joshua |
234 |
|
1:13:46 |
1st |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
ONE-DAY |
Coon |
Steve |
206 |
|
1:24:15 |
5th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Thompson |
Brian |
207 |
|
1:19:21 |
2nd |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0081077 |
Hansen |
Keith |
209 |
|
1:26:40 |
6th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Szabo |
Luke |
211 |
|
1:29:46 |
7th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0116226 |
Heldt |
Rick |
212 |
|
1:31:11 |
8th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0172532 |
Witt |
Jam |
216 |
|
1:37:09 |
11th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0112683 |
McClanahan |
Sam |
218 |
|
1:24:13 |
4th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Kavert |
Eric |
219 |
|
1:47:51 |
13th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Wither |
Bryan |
220 |
|
1:32:05 |
9th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0096672 |
Summerford |
Dale |
226 |
|
1:17:58 |
1st |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
ONE-DAY |
Wilson |
Chris |
227 |
|
1:21:15 |
3rd |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Hanse |
David |
232 |
|
1:56:17 |
15th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
ONE-DAY |
Keener |
Joe |
235 |
|
1:49:44 |
14th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
|
Melives |
Doug |
223 |
|
1:39:53 |
12th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
30-39 |
B0158812 |
Weiss |
Derek |
236 |
|
1:36:21 |
10th |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
40-49 |
B0148201 |
Mysse |
Steve |
201 |
|
1:42:12 |
3rd |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
40-49 |
B0148195 |
Andrews |
Paul |
208 |
|
1:25:53 |
2nd |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
40-49 |
ANNUAL |
Louk |
Don |
210 |
|
1:23:40 |
1st |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
40-49 |
B0174673 |
Roach |
Richard |
230 |
|
999 |
999 |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
40-49 |
|
Debus |
Keigh |
237 |
|
999 |
999 |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
50-99 |
B0115571 |
Conner |
Barry |
2 |
|
1:34:46 |
2nd |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
50-99 |
B0031827 |
Schuff |
Leonard |
231 |
|
1:28:34 |
1st |
| CROSS-COUNTRY |
SPORT |
MEN |
MASTER |
50-99 |
B0174588 |
Simons |
Jim |
205 |
|
2:13:49 |
3rd |
| CROSS-COUNTRY |
SPORT |
WOMEN |
MASTER |
30-39 |
|
Rydquist |
Sue |
349 |
|
1:35:49 |
1st |
| CROSS-COUNTRY |
SPORT |
WOMEN |
SENIOR |
19-29 |
|
Rogers |
Cheyenne |
352 |
|
1:44:23 |
2nd |
Last Updated on 8/28/2001
By Jcrouch


Queue length: {{ uploader.queue.length }}
Select files...
File uploading progress:
File insertion progress:


Created by Froilan Miranda
Git is a widely used source code management system for software development. It is a distributed revision control system with an emphasis on speed, data integrity, and support for distributed, non-linear workflows.
This command creates an empty Git repository - basically a .git directory with subdirectories for objects, refs/heads, refs/tags, and template files.
//Transform the current directory into a Git repository.
git init
//Create an empty Git repository in the specified directory.
git init <directory>
This command updates the index using the current content found in the working tree, to prepare the content staged for the next commit.
//Stage all changes in <files> for the next commit.
git add <files>
//Stage all changes in <directory> for the next commit.
git add <directory>
Displays paths that have differences between the index file and the current HEAD commit, paths that have differences between the working tree and the index file, and paths in the working tree that are not tracked by Git (and are not ignored by gitignore).
//List which files are staged, unstaged, and untracked.
git status
Stores the current contents of the index in a new commit along with a log message from the user describing the changes.
 In this module, we’re only concerned with the first configuration.
//Check out a previous version of a file.
git checkout <commit> <file>
Remove the specified file from the staging area, but leave the working directory unchanged.
//Remove the specified file from the staging area
git reset <file>
Remove files from the index, or from the working tree and the index.
//Remove files from the index
git rm <file>
//Remove files from the index
git rm --cached <file>
This command displays committed snapshots. It lets you list the project history, filter it, and search for specific changes.
 In this module, we’re only concerned with the second & third configurations.
//Update working directory to match the specified commit.
git checkout <commit>
//Update working directory to match the specified branch
git checkout <branch-name>
Remove files from the index, or from the working tree and the index.
//Remove files from the index
git rm <file>
//Remove files from the index
git rm --cached <file>
Existing branches are listed; the current branch will be highlighted with an asterisk.
//List all of the branches in your repository.
git branch
//Create a new branch called <branch>.
//This does not check out the new branch.
git branch <branch-name>
//Delete the specified branch.
git branch -d <branch-name>
//Rename the current branch
git branch -m <branch-name>
Join two or more development histories together
//Merge the specified branch into the current branch.
//Git will determine the merge algorithm automatically
git merge <branch-name>
.md is markdown. README.md is used to generate the html summary you see at the bottom of projects. Github has their own flavor of Markdown.
Specifies intentionally untracked files to ignore
SSH keys are a way to identify trusted computers without involving passwords. You can generate an SSH key and add the public key to your GitHub account by following the procedures outlined in this section.
Clone a repository into a new directory
//Clone the repository located at <repo> onto the local machine.
git clone <repo>
//Clone the repository located at <repo> into the folder
//called <directory> on the local machine.
git clone <repo> <directory>
Updates remote refs using local refs, while sending objects necessary to complete the given refs.
//Push the specified branch to <remote>,
//along with all of the necessary commits and internal objects.
git push <remote> <branch>
Download objects and refs from another repository
//Fetch all of the branches from the repository.
git fetch <remote>
Incorporates changes from a remote repository into the current branch.
//Fetch the specified remote’s copy of the current branch and
//immediately merge it into the local copy.
git pull <branch-name>
//Git manual
git help
git help <command>


3 R packages
The packages that contain the main functionalities of ShinyDataSHIELD are the following.
- DSI: The DataSHIELD Interface (DSI) handles the connections to the databases.
- DSOpal: DSOpal is an extension of DSI to connecto to Opal servers.
- dsBaseClient: Implementation of the base package R functions to obtain non-disclosive returns from the Opal servers (Example: Base package function
as.factor
is implemented asds.asFactor
). - dsOmicsClient: Functions to perform non-disclosive omic analysis using BioConductor packages on the Opal servers.
On the following table, all the packages required by ShinyDataSHIELD are shown along the versions used during development.
| Package | Version |
|---|---|
| DSI | 1.1.0 |
| DSOpal | 1.1.0 |
| dsBaseClient | 6.0.1 |
| dsOmicsClient | 1.0.0 |
| shinydashboard | 0.7.1 |
| shiny | <IP_ADDRESS> |
| shinyalert | 1.1 |
| DT | 0.13 |
| data.table | 1.12.8 |
| shinyjs | 1.1 |
| shinyBS | 0.61 |
| shinycssloaders | 0.3 |
| stringr | 1.4.0 |


|
CMSIS-Zone
Version 1.1.0
System Resource Management
|
This single processor demo application shows how to do the MPU Protection. Using CMSIS-Zone, it generates:
The application itself shows how to isolate network stack threads from the user application.
The MCBSTM32F400.azone file of that project has the following configuration settings:
Execution
.Net
, Main
, RTX
, Blinky
, Timer
, Idle
CODE
, RAM_SHARED
, RAM_NET
, RAM_MAIN
, RAM_PRIVILEGED
, RAM_EVR
, RAM_BSD
, RAM_LED
, RAM_ADC
, RAM_TIMER
, and RAM_IDLE
The zones use common Flash region for all the application code but different SRAM regions to segregate thread data. To generate the output, click on the Generate button in the Zone Editor tool bar. This creates the following files in the ftl_gen
directory:
| Template File | Generated File | Description |
|---|---|---|
| dump_fzone.txt.ftl | dump_fzone.txt | Contains the complete model |
| helper.ftlinc | N/A | Helper template file with FTL functions. |
| mem_layout.h.ftl | mem_layout.h | Header file that contains the memory region definitions, for example for the linker scatter file. |
| mputable.c.ftl | mputable.c | MPU Table data definition. |
| mputable.h.ftl | mputable.h | MPU Table data declaration. |
| scatter.sct.ftl | scatter.sct | Example scatter file for MPU protection. |
These files can be used in any IDE to create the final application. In the following, the usage in Arm Keil MDK is described.
The example project can be loaded, built and debugged in µVision by performing the following steps:
The projects Blinky_Net use the files generated in CMSIS-Zone as follows:
| File | Description |
|---|---|
| mem_layout.h | Input for the linker scatter files. |
| mputable.c | MPU Table data definition. |
| mputable.h | MPU Table data declaration. |
| scatter.sct | Initial template for scatter file. |
As explained previously, the #defines in mem_layout.h
can be used to create generic scatter files that are easy to update once changes in the CMSIS-Zone project happen. Using the mem_layout.h file from CMSIS-Zone, the following scatter file is used in the Blinky_Net
project, which is based on the generated scatter file template (scatter.sct):
The data segments of segregated software components have been allocated to distinct memory regions.


| # | Url (click to see details) |
|---|---|
| 1. | Click crawl only this page to find links on page |
(This usually takes around 30-45 seconds)
(You must recrawl entire website to update this data)
| # | Status Code | Url (click to see details) |
|---|---|---|
| {{i.number}} | {{i.status_code}} | {{ i.url }} |


You know, you could get the Perl Weekly right in your mailbox. Every Week.
Free of charge!
|
Issue #206 - 2015-07-06 - Just take our money! latest | archive | by Gabor Szabo
Don't miss the next issue!
Tweet | ||
| ||
|
Announcements
| ||
| ||
| ||
| ||
|
| ||
| ||
|
Articles
| ||
| ||
|
Code
| ||
| ||
| ||
| ||
|
Web
| ||
| ||
| ||
|
CPAN
| ||
| ||
|
Grants
| ||
| ||
|
Perl 6
| ||
| ||
| ||
| ||
|
| ||
| ||
| ||
|
Weekly collections
| ||
|
| ||
|
Perl Maven Articles
| ||
| ||
|
You know, you could get the Perl Weekly right in your mailbox. Every Week.
Just ONE e-mail each Monday. Easy to unsubscribe. No spam. Your e-mail address is safe.
|


function Ninja(){ this.swung = false; this.swingSword = function(){ return !this.swung; }; } Ninja.prototype.swingSword = function(){ return this.swung; }; var ninja = new Ninja(); assert(ninja.swingSword(), "Called the instance method, not the prototype method."); #1 Creates an instance variable #2 Creates an instance method #3 Defines a prototypes method #4 Constructs a Ninja The precedence of the initialization operations is important and goes as such: 1. Properties are bound to the object instance from the prototype. 2. Properties are bound to the object instance within the constructor function.


See Below
The compareTo()
method takes a reference to another
Monster
as a parameter.
class Monster implements Comparable<Monster> { . . . public int compareTo( Monster other ) { .... more goes here ... } }
Typically, only some of the instance variables of a complex object
are used by compareTo()
.
Say that you want monsters to be listed in ascending order
of hit points.
Monsters with the same number of hit points are ordered
by ascending strength.
Here is a partially completed method that does that:
It is easy to get this backwards.
What you want is for compareTo(Monster other)
int
when the monster that owns the method
is less than the other
monster.
Fill in the blanks.


--- layout: post title: mozy backup service ---
I've been trying the free account this week. I've backed up 1.6 GB of data.It took, with given interruptions of a normal work day, about 4 days tobackup this amount of Data.
I am beginning to think that the world of offline remote backups is still alittle bit away!


MATH
Making Math Accessible
Producing Math With Voice
The ability to produce math is not and should not have the requirement of health and wealth.
General Resources
-
LaTeX: What Is It and Why Do We Need It?
As accessed 29 March 2019
From our experience, we have found that many college instructors, students, and researchers are very familiar with LaTeX. Therefore, teaching LaTeX to blind students is highly advantageous for preparing them to enter the mainstream scientific environment. As is true with the Nemeth Code for Braille Mathematics, students learn bits and pieces of LaTeX as they need them. For example, during algebra courses they will only learn LaTeX for such notions as powers and roots. In calculus, they will learn the LaTeX codes for integrals and derivatives. In this manner, mastery of LaTeX is achieved as students advance in mathematical and other scientific training. The highly consistent and logical nature of the LaTeX syntax is similar to the structure of other programming languages, and therefore provides students with an excellent introduction to the general theory of computer programming.
-
Dictating LaTeX With Voice (Reddit Discussion Thread)
As accessed 29 March 2019
-
Math Talk
As accessed 29 March 2019


{% load staticfiles %}
Welcome to the completed polls app!
Who do you think is the greatest Canadian?
{% if latest_question_list %}
{% for question in latest_question_list %}
{{ question.question_text }}
{% endfor %}
{% else %}
No polls are available.
{% endif %}


| Package | Description |
|---|---|
| com.mypurecloud.sdk.v2.model |
| Modifier and Type | Method and Description |
|---|---|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.actualLengthSecs(Integer actualLengthSecs)
Total duration in seconds for all actually worked activities
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.adherencePercentage(Double adherencePercentage)
Total adherence percentage for this user, in the scale of 0 - 100
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.adherenceScheduleSecs(Integer adherenceScheduleSecs)
Duration of schedule in seconds included for adherence percentage calculation
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.conformanceActualSecs(Integer conformanceActualSecs)
Total actually worked duration in seconds for OnQueue activities
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.conformancePercentage(Double conformancePercentage)
Total conformance percentage for this user, in the scale of 0 - 100.
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.conformanceScheduleSecs(Integer conformanceScheduleSecs)
Total scheduled duration in seconds for OnQueue activities
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.dayStartOffsetSecs(Integer dayStartOffsetSecs)
Start of day offset in seconds relative to query start time
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.exceptionCount(Integer exceptionCount)
Total number of adherence exceptions for this user
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.exceptionDurationSecs(Integer exceptionDurationSecs)
Total duration in seconds of adherence exceptions for this user
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.impactSeconds(Integer impactSeconds)
The impact duration in seconds of current adherence state for this user
|
HistoricalAdherenceDayMetrics |
HistoricalAdherenceDayMetrics.scheduleLengthSecs(Integer scheduleLengthSecs)
Total duration in seconds for all scheduled activities
|
| Modifier and Type | Method and Description |
|---|---|
List<HistoricalAdherenceDayMetrics> |
HistoricalAdherenceQueryResult.getDayMetrics() |
| Modifier and Type | Method and Description |
|---|---|
HistoricalAdherenceQueryResult |
HistoricalAdherenceQueryResult.dayMetrics(List<HistoricalAdherenceDayMetrics> dayMetrics)
Adherence and conformance metrics for days in query range
|
void |
HistoricalAdherenceQueryResult.setDayMetrics(List<HistoricalAdherenceDayMetrics> dayMetrics) |
Copyright © 2021. All rights reserved.


Root Discovery
(discovery results)
Signing Discovery
(jsonsign discovery results)
Signing Debug
JSON blob to sign:
Signed blob:
Verification details:
{"camliVersion": 1, "camliType": "whatever", "foo": "bar"}


Software development engineer heavily focusing on user-friendly UX and data visualization in large-scale web application development with modern technology. Global business insight and more than 5 years of international operation support experience in the Tech, Engineering & biotech industries. Well-versed in the latest hands-on technical programming expertise and tools.
GPA: 3.73
GPA: 3.54


About me
- foooomio
- Web Developer
- Kyoto, Japan
- April 20, 1992
Identifications
Works
View Background Image
Web extension that adds "View background image" to the context menu.
Nicorepo Filter
Web extension that adds a function to filter nicorepos to niconico.
Pikopikoplanet SPACE
SPARQL queries sharing service.
Contributions
IM@Study
Developer community of THE IDOLM@STER fans.
im@sparql
Linked Open Data platform for THE IDOLM@STER series.
Work Experience
Gurunavi, Inc.
Web Application Engineer, Tokyo, April 2015 - December 2017
Education
Shiga University
Bachelor of Economics, 2015
Course of Information Systems
Awards
LOD Community Award &
Enjoyably SPARQL (B Inc.) Award
Linked Open Data challenge Japan 2020, December 2020
Misc.
Keikenchi Map
Prefectures of Japan that I have visited in my life.
Amazon Wishlist
My wishlist on Amazon.co.jp.


Before Change
// Create and fit classifier
params = {"epochs": 5, "batch_size": BATCH_SIZE}
classifier = CNN(im_shape, dataset="mnist")
classifier.compile({"loss": "categorical_crossentropy", "optimizer": "adam", "metrics": ["accuracy"]})
classifier.fit(x_train, y_train, **params)
// Create FGSM attacker
adv = FastGradientMethod(classifier, session)
After Change
// Create and fit classifier
params = {"nb_epochs": 2, "batch_size": BATCH_SIZE}
classifier = self.classifier_k
// Create FGSM attacker
adv = FastGradientMethod(classifier)
x_adv = adv.generate(x_test)
preds = classifier.predict(x_adv)
acc = np.sum(np.argmax(preds, axis=1) == np.argmax(y_test, axis=1)) / y_test.shape[0]
// Perform adversarial training
adv_trainer = AdversarialTrainer(classifier, adv)
adv_trainer.fit(x_train, y_train, **params)
// Evaluate that accuracy on adversarial sample has improved
preds_adv_trained = adv_trainer.classifier.predict(x_adv)
acc_adv_trained = np.sum(np.argmax(preds_adv_trained, axis=1) == np.argmax(y_test, axis=1)) / y_test.shape[0]
print("\nAccuracy before adversarial training: %.2f%%" % (acc * 100))
print("\nAccuracy after adversarial training: %.2f%%" % (acc_adv_trained * 100))
@staticmethod
def _cnn_mnist_tf(input_shape):


'Never' - Agent hits out at Wolves transfer speculation
Wolverhampton Wanderers transfer latest | Patrick Cutrone has already been linked with a move away from Molineux
by Alex Dicken, https://www.facebook.com/alexdickenjournalist/?fref=tsPatrick Cutrone’s agent has quashed rumours the striker could be about to quit Wolverhampton Wanderers.
Italy striker Cutrone, who scored twice for his nation’s under-21s in a 3-0 win over Iceland on Saturday, only joined Wolves from AC Milan in the summer.
The 21-year-old signed a four-year contract at Molineux and has already become a hugely popular figure with supporters.
Cutrone has scored just two goals in 19 appearances, but most of those outings have come from the bench under Nuno Espirito Santo.
And rumours have surprisingly surfaced to suggest Cutrone could return to Italy with Sampdoria reportedly interested.
But Cutrone’s agent, Donato Orgnoni, has laughed off those claims and insists his client is only focused on life at his new club.
“We’ve never thought of leaving Wolves,” he told SampNews. “I don’t understand why certain news comes out. He remains in England one hundred percent.”


CULTURAL INSTITUTIONS
From Museums to Cultural Centers, Miami's impact in the arts is nothing short of remarkable. To learn more about Cultural Institutions in Miami, hover over a card to flip it.
Back to Menu
Little Haiti Cultural Center
Located in the heart of Miami’s Little Haiti neighborhood, the LHCC broke ground in 2006 and serves to preserve Afro-Caribbean cultures.
Adrienne Archt Center
One of the largest performing centers in the country, the center was designed by Cesar Pelli and opened in 2006.
Vizcaya Gardens
Built between 1914 and 1923, the home and gardens of James Deering is known for it’s Mediterranean Revival architecture and elaborate Italian Renaissance gardens.
Cuban Museum of Diaspora
The Museum showcases artists, thinkers, and creators from the large and diverse Cuban diaspora.
Miami Children's Museum
Established in 1983, the museum’s current facility has hosted over 5 million guests since it’s opening in 2003.
Downtown Cultural Center
Home to the central branch of the Miami-Dade Public Library and HistoryMiami, the cultural center was designed by Philip Johnson in 1983.


 I also like to make things work and do stuff.
 I also like to make things work and do stuff.
Windows desktop and server editions - Active Directory - Exchange - Physical servers, Cloud, and Office 365 host - Networking, both Wired and Wi-Fi infrastructure -


Colorful Wars
Colorful
Warrior
use
the
Left
and Right
Arrows or A
and D
keys to move, Spacebar
to shoot.
Click here to my Facebook page, click the game to pause and take a break. Follow me on CodePen
Colorful
Warrior
use
the
Left
and Right
Arrows or A
and D
keys to move, Spacebar
to shoot.
Click here to my Facebook page, click the game to pause and take a break. Follow me on CodePen


?6
7
8
9
10
the
New
York
copyright
reserved
botanical
Garden
PLANTS
OF
BAHAMA
ISLANDS
Ludwigia
repens
J.
R.
Forst.
Grand
Bahama:
in
water
and
mud
of
marsh
area
near
Pan
Am
Operational
Station,
Freetown.
May
23,
1975
D.
S.
Correll
¤
John
Popenoe
45386
Herbarium
FAIRCHILD
TROPICAL
GARDEN
W
Yo
E
BOTANICA
ga
R
N
E
D
Ludwigia
repens
Forst.
Determined
by
Ching-I
Peng
1981
Missouri
Botanical
Garden
01447685
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


US actor James Van Der Beek announces wife has suffered a miscarriage
The star of Dawson’s Creek revealed the news during an episode of Dancing With The Stars.
US actor James Van Der Beek has announced his wife has suffered a miscarriage.
The star of teen drama Dawson’s Creek said wife Kimberly lost the couple’s sixth child on the weekend.
Van Der Beek announced the news during an episode of Dancing With The Stars.
In a video message, the 42-year-old said: “My wife Kimberly and I went through every expecting parent’s worst nightmare. We lost the baby.
“The little soul that we had expected to welcome into our family took a shortcut to whatever lies beyond.
  It makes you more human.”
Van Der Beek admitted he did not expect to be taking part in Monday’s episode of Dancing With The Stars, but revealed Kimberly convinced him to dance.
He and his professional partner Emma Slater were awarded a score of 27/30 from the judges, though it was not enough to save them from being eliminated.
The actor, who revealed he and Kimberly were expecting a new arrival last month, is also father to Olivia, nine, Joshua, seven, Annabel Leah, five, Emilia, three and one-year-old Gwendolyn.
Van Der Beek, who played Dawson Leery in six seasons of Dawson’s Creek from 1998 to 2003, addressed the loss on Instagram.
He said he and Kimberly were “Wrecked. Devastated. In shock.”
He said: “That’s how we’re feeling right now after the soul we thought we were going to welcome into our family in April… has taken a short cut to whatever lies beyond this life.
“We’ve been through this before, but never this late in the pregnancy, and never accompanied by such a scary, horrific threat to @vanderkimberly and her well-being. Grateful that she’s now recovering, but we’ve only just begun unpacking the layers of this one.”
He thanked friends and co-workers for support, adding “Grieving AND counting our blessings today.”
Van Der Beek, whose film roles include Varsity Blues and The Rules Of Attraction, married Kimberly in 2010.


Gold
Package Price 1000 PKR
Daily Ads 10
Signup Bouns 2 Paid Ads
Ad Time 20 secound
Per Paid Ad Price 10 Pkr
Referral Earning 60% 540 PKR$
Unlimited Referral
Minimum Withdraw 1000 (instant)
Pacakge Expire Life Time
Starter
Package Price 170 PKR
Daily Ads 10
Signup Bouns 2 Paid Ads
Ad Time 20 secound
Per Paid Ad Price 10 Pkr
Referral Earning 60% 90 PKR$
Unlimited Referral
Minimum Withdraw 300 (instant)
Pacakge Expire Life Time
Standard
Package Price 340 PKR
Daily Ads 10
Signup Bouns 2 Paid Ads
Ad Time 10 secound
Per Paid Ad Price 10 Pkr
Referral Earning 60% 180 PKR$
Unlimited Referral
Minimum Withdraw 500 (instant)
Pacakge Expire Life Time


Toy industry calls unsafe-toys list misleading
by Associated PressBOSTON (AP) — The Latest on the release of a toy safety group’s annual worst toys list (all times local):
11:30 a.m.
The toy industry is dismissing a safety group’s annual worst toys list as misleading and needlessly frightening to parents.
The Toy Association says World Against Toys Causing Harm doesn’t run safety tests on the toys.
In contrast, the industry trade group says all toys sold in the U.S. must meet more than 100 “rigorous safety tests and standards” by law.
The association represents most of the toy makers named on WATCH’s list. It also suggests parents buy toys from reputable stores and online sellers.
A high-powered Nerf gun, ice cream-scented Nickelodeon slime and a plastic Power Rangers claw are among the toys topping the list released Tuesday by WATCH.
The Massachusetts-based nonprofit has been issuing the lists ahead of the holidays for more than four decades.
RELATED: World Against Toys Causing Harm unveils its 2019 list of 10 worst toys
___
10:15 a.m.
A Nerf gun, ice cream-scented Nickelodeon slime and a plastic Power Rangers claw are among the toys making a consumer safety group’s annual list of worst toys for the holidays.
World Against Toys Causing Harm, or WATCH, unveiled its list Tuesday at a Boston children’s hospital.
A realistic toy machine gun, the Pogo Trick Board, a yeti teddy bear and a pull-along caterpillar toy for infants also made the list.
The Massachusetts-based nonprofit says many of the products present choking, eye and other safety hazards found in poorly designed toys.
It also cites the products for having inconsistent and inadequate warning labels.
The industry trade group The Toy Association didn’t immediately respond to an email seeking comment. In the past, it has dismissed the list as biased and inaccurate.


C:\Windows\System32\drivers\etc\
hosts
file for editing (may require admin privledges){{ip}} {{domain}}
/etc/hosts
file for editing (may require root privledges){{ip}} {{domain}}
Note: you'll need to revisit step #1 every time the VM is assigned a new IP address.
Use the ifconfig
command to check or reload this page.
{{appgen_url}}
in your host web browser to begin. Note: There are several accounts pre-set on this machine (including the unix, database and django account),
All of which have a username & password of "madrona" & "madrona".


What is Blue Story about and who is in the cast?
Blue Story is proving to be one of the most controversial British films in years.
The film, directed by Andrew ‘Rapman’ Onwubolu – has found itself at the centre of a storm after an all-out brawl broke out during a showing of the film in Birmingham.
Armed police were on the scene after people with machetes at Star City, in the Nechells area of the city were reported, shortly after 5.30pm on Saturday.
A group of more than 100 people were there, with ‘pockets of fighting’ breaking out as families queued to see Frozen 2.
The incident has led to reports that the film is being pulled from Vue cinemas across the country.
Just what is Blue Story about and who is in the cast?
What is Blue Story about?
Blue Story is about friends Timmy and Marco who become rivals in a vicious postcode war between South London’s Peckham and Deptford.
Advertisement Advertisement
The pair were best friend who went to school together before being drawn into a world of violence – something altogether too real in London today.
It’s a follow-up to Rapman’s hugely successful YouTube series Shiro’s Story.
Who stars in Blue Story?
The film stars a lot of home-grown London actors, like Stephen Odubola and Michael Ward who play Timmy and Marco.
Michael Ward is one of the most well-known cast members from the film, having starred in Netflix’s Top Boy and BBC’s The A List.
Other stars include EastEnders’ Khali Best and Gold Digger’s Karla-Simone Spence.
The film’s director, Rapman, has spoken out about how jealousy of his success has caused him to leave his hometown,


Use the netparam command to select the network parameters:
| Caution | |
|
netparam writes its settings into non-volatile flash memory on the probe. Each time you enter a netparam command, wait for the core> prompt to re-appear before entering the next command. |
|
To configure a dynamic IP address, perform these steps.
Procedure
netparam bootconfig dhcp[:hostname]
DHCP is the default setting. If you specify a hostname for the probe, the probe will attempt to register the host name with the DHCP server, that will then update any name servers on the network.
This section covers the set up of a static IP address for the Sourcery Probe Professional. If you are unfamiliar with IP address concepts, refer to the section Step-by-Step Guide to Configuring a Static IP.
| Note | |
|
Because this is a proven method to add a probe to a TCP/IP network, we recommend using it if you have any network communication problems. |
|
To enter the IP and optional netmask in flash, perform the following steps.
Procedure
Example B-1. Probe Entries in a hosts File for a Windows Host Environment
| Note | |
|
You should create or update the hosts file on the network server or on each local workstation that requires access to the probe. |
|
netparam static_ip_address nnn.nnn.nnn.nnn
[:mmm.mmm.mmm.mmm]
Where nnn.nnn.nnn.nnn represents the IP address and mmm.mmm.mmm.mmm represents the subnet mask.
The simplest networks consist of one or more subnets. Routers forward network traffic from one point on the network to another across these subnets.
If the probe uses DHCP to automatically acquire its network settings, it is most likely that a default gateway setting was acquired and the probe will be accessible on other subnets.
However, when using a static IP configuration or where the DHCP configuration is incomplete, you might need to provide additional routing information, including:
If you are using a static IP configuration, or your DHCP configuration does not specify a default gateway, you can manually enter the IP address of the default gateway to use. This gateway must be accessible on your local subnet.
A default gateway entry must specify the IP address of the first gateway that network traffic from the probe crosses. Failing to specify gateway information can cause problems with the probe's discovery feature. This gateway must be aware of the network’s complete route table. Use the following netparam syntax:
netparam add_route <IP_ADDRESS> gateway_ip 1
For gateway_ip, provide the IP address of the router or gateway in dot notation. The default value is <IP_ADDRESS>.
| Note | |
|
If you enter static routes in the probe, they are not updated automatically. You must update these routes if changes in the network topology affect the static routes. |
|
Before entering static routes, make a map of all gateway paths between the probe, as a starting point, and each workstation that must have access to it.
To change an existing routing entry. perform the following steps.
Procedure
netparam delete_route host_ip
netparam add_route host_ip gateway_ip hop_#
| Note | |
|
When you enter static routes into the probe, static routes are not updated automatically. You must update these routes if changes in network topology affect the static routes. |
|
Before entering static routes, make a map of all gateway paths between the probe, as a starting point, and each workstation must have access to it.
To enter a static route or default gateway, perform the following steps.
Procedure
netparam add_route host_ip gateway_ip hop_#
NOTE: Wait for the core> prompt between each netparam entry.
Example B-2. Static Route Example
Figure B-1 shows three class “C” networks joined together by a single IP router, making each probe accessible from three workstations (elmer, tweety, and brutus).
Figure B-1. Example Network with 1 Router
No static routing information is required to make a probe accessible from a workstation local to it on a network. For example, the probe goofy on network <IP_ADDRESS> communicates directly with workstation elmer.
When static routing is used, a routing entry is required on a probe for each workstation on a non-local network that accesses it. The probe goofy requires two entries, one for workstation tweety on network <IP_ADDRESS> and one for workstation brutus on network <IP_ADDRESS>.
Each static route entry is made using a netparam command and consists of a network address and a host address. The netparam commands for the static route entries for probe goofy are:
netparam add_route <IP_ADDRESS> <IP_ADDRESS> 1
netparam add_route <IP_ADDRESS> <IP_ADDRESS> 1
Each of the three probe hosts must have a static route entry for each remote workstation that accesses it.
To delete a static route, use the netparam command:
core> netparam delete_route 1
SIOCADDRT: Network is unreachable
core> netparam
ethernet_address = 00:04:9F:00:FF:80
bootconfig = static:MEGJ
static_ip_address = <IP_ADDRESS>:<IP_ADDRESS>
static_dns_server = <IP_ADDRESS>
static_hosts = <none>
static_routes = destination gateway metric
--------------- --------------- ------
default <IP_ADDRESS> 1
core> netparam delete_route default
core> netparam
ethernet_address = 00:04:9F:00:FF:80
bootconfig = static:MEGJ
static_ip_address = <IP_ADDRESS>:<IP_ADDRESS>
static_dns_server = <IP_ADDRESS>
static_hosts = <none>
static_routes = <none>
core>


For the fig-swirl: Melt butter over medium heat in a saucepan. Add brown sugar and stir to dissolve. Halve all of the figs and toss in the saucepan with water and lemon juice. Cook over medium heat, stirring frequently, until you have a chunky-jammy misture. Add salt with one or two stirs, set aside and let cool completely.
Ice cream: In a small pot over medium heat, combine milk, and granulated sugar until sugar is completely dissolved and the milk is just barely lukwarm. Whisk in the egg yolks. Set misture in the fridge and wait until the fig misture is cooled.
Using an ice cream machine, pour liquids into the forzen basin and process according to manufacturer instructions, i.e.,let spin and thicken for 20 minutes before adding mascarpone, fig jam mixture, and the nuts. Continue to process for +/-10 minutes. Pour semi-frozen misture into a pyrex dish or glass tupperware. Freeze for at least two hours before serving.


LOGO
( Imagine that here is a logo )
Press INTRO to start
Select a category
Play a Quiz about technology
Create your own quiz
Upload a custom quiz
aaa
bbb
ccc
ccc
Other Question !
Restart Game
Share your score
Question 1/10
Answer A
Answer B
Answer C
Answer D
Please complete all spaces
Select the correct answer
A
B
C
D
Next Question
Download your custom Quiz Here and share it with your friends :D
Download!


Coder Projects are simple, fun, and sneakily educational things that can all be made with an online environment called Glitch. Browse the list below to see what catches your eye, or if you feel inspired, contribute your own project to the site.
These projects were originally created by Google Creative Labs - Coder for Pi which used a Raspberry Pi and a special Coder App for development. This particular website is a remix of that, to bring you the same tutorials (and hopefully new tutorials later on!) but without the need for a Raspberry Pi. That means the instructions in the tutorials needed to be converted to use an online environment called Glitch where you can write your code. If the "Open Project" button is purple that means it is converted and you're good to go! If you feel confident in being able to read the original tutorials and still use Glitch click on the yellow "Open Project" button and it will take you to the original tutorial.
Converted Project Non-converted ProjectDo you have a favorite recipe that you want to share with the world? With this project we will use code to write a recipe that looks as good as it tastes.
A great project for: Foodies, chefs, sandwich aficionados, and anyone looking to learn the basics of web design and Coder.
Open ProjectPaint makes a mess. Code is so much cleaner. Use this project to recreate a classic Modern artwork, Piet Mondrian’s Composition II in Red, Blue, and Yellow in your browser with CSS and HTML.
A great project for: Modern art buffs, aspiring art forgers and anyone that is interested in drawing with nothing but code.
Open ProjectMake a simple game to play with your friends and family. See if you can find all the penguins without waking the yeti!
A great project for: Penguin watchers, yeti hunters, puzzle lovers, and anyone that wants to challenge someone to a battle of adorable wits.
Open Project Being converted, check back soon! Nov 1st 2017Got a story to tell? Have some great text and images you want to put together? This project will give you the pieces to turn them into a webcomic while teaching you some new skills along the way.
A great project for: Comic fans, writers, anyone that wants to use images and text in fun ways online.
Open ProjectEver wish you could control the universe? Well now you can pretend with this project. Change day into night and back again with the click of a mouse and learn a whole new programming language along the way.
A great project for: Sunbathers, night owls, and anyone that is looking to make big changes with the push of a button.
Open ProjectLet’s turn it up. This project will transform your browser into a simple instrument that you can use to make music.
A great project for: Musicians, music lovers, or anyone that has a song in their heart that they want a computer to play.
Open ProjectWhat time is it? You’ll finally be able to answer that question after you’ve built this simple clock.
A great project for: Punctual people, chronically-late people, or anyone that wants to turn their browser into a clock.
Open ProjectDrawing with code can be a walk in the park with the help of Javascript and the handy drawing library Two.js. In just a few lines of code your browser becomes your sketchbook.
A great project for: Dog lovers, doodlers, and javascript junkies.
Open ProjectCoder Projects are Coder apps and instructional step-by-step guides designed to get new programmers excited about making things with code. They range from introductory lessons on the basic web stuff Coder utilizes (HTML, CSS, Javascript) to more complex projects that show what code can do.
Coder projects are perfect for anyone new to coding, or helping someone else learn.
Need some more help?
Coder projects are designed to be fun and educational excercises but they won’t replace full-blown lessons and web development courses. If you’d like to dig deeper there are tons of great resources out there for learning the languages of the web. Codecademy and Khan Academy are two of our favorites, and you can find lots more at Code.org.
We’re looking for new Coder Projects. If you have an interesting project made with Coder that you think would help and inspire others, please send it our way.
Coder Projects on Github


Package
Class
Use
Tree
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes
A
C
D
E
G
I
L
M
N
P
R
S
T
V
A
actionPerformed(ActionEvent)
- Method in class src.
GUI.Controls
C
Candidates
- Enum in
src
Use enum types to represent a fixed set of constants.
Candidates(String, BigInteger, String)
- Constructor for enum src.
Candidates
col
- Variable in class src.
GUI
columnNames
- Static variable in class src.
GUI
control
- Variable in class src.
GUI
createAndShowGUI()
- Static method in class src.
GUI
Create the GUI and show it.
D
data
- Static variable in class src.
GUI
doDecrypt(BigInteger)
- Method in class src.
PaillierCryptosystemUtil
From the API,the method toByteArray(), returns a byte[] containing the two's-complement representation of this BigInteger.
doEncrypt(BigInteger[])
- Method in class src.
PaillierCryptosystemUtil
This method calls the actual encryption method and converts the output from it into BigInteger[] .
drawingArea
- Static variable in class src.
GUI
E
encrypt(byte[], PublicKey)
- Method in class src.
PaillierCryptosystemUtil
The method does the encryption by passing the bytes array and the Paillier Public key as parameters.
EvoteTable
- Variable in class src.
GUI
exp
- Variable in enum src.
Candidates
G
getExp()
- Method in enum src.
Candidates
getKeyComponent(String)
- Method in class src.
PaillierCryptosystemUtil
Get the n-modulus or r from the PublicKey object.
getMaximumSize()
- Method in class src.
GUI.Controls
getMaximumSize()
- Method in class src.
GUI
getName()
- Method in enum src.
Candidates
getPreferredSize()
- Method in class src.
GUI.Controls
getPreferredSize()
- Method in class src.
GUI
getProduct(BigInteger[])
- Method in class src.
GUI
Method for calculating the product of all ciphertexts .
getrRandom()
- Method in class src.
PaillierCryptosystemUtil
Getter for the r random number for each encryption.
getTally(BigInteger)
- Method in class src.
GUI.Controls
Returned the reversed sum of the voters messages.
getValue()
- Method in enum src.
Candidates
getVoteSum()
- Method in class src.
GUI
Method to get all the data that is true - the choice of each voter, and to calculate the sum for each voter that need to be encrypted.
GUI
- Class in
src
Simple GUI for representing the Paillier Cryptosystem homomorphic properties.
GUI()
- Constructor for class src.
GUI
Constructor invoke UIManager.LookAndFeelInfo for better GUI view .
GUI.Controls
- Class in
src
Class responsible for the JButtons and JTextArea with Listeners for the state change.
GUI.Controls()
- Constructor for class src.
GUI.Controls
GUI.MyTableModel
- Class in
src
GUI.MyTableModel()
- Constructor for class src.
GUI.MyTableModel
I
itemStateChanged(ItemEvent)
- Method in class src.
GUI.Controls
L
label
- Static variable in class src.
GUI
M
main(String[])
- Static method in class src.
GUI
N
name
- Variable in enum src.
Candidates
P
PaillierCryptosystemUtil
- Class in
src
This class does encryption and decryption, also contains supported methods.
PaillierCryptosystemUtil()
- Constructor for class src.
PaillierCryptosystemUtil
The constructor PaillierCryptosystemUtil is responsible for adding the Paillier Provider, initialise the key size and generate public and private keys.
privKey
- Variable in class src.
PaillierCryptosystemUtil
processVoting
- Variable in class src.
GUI
pubKey
- Variable in class src.
PaillierCryptosystemUtil
R
retrieveTally(BigInteger)
- Method in class src.
GUI
Method to chop down the result in order to get the vote results.
row
- Variable in class src.
GUI
rRandom
- Variable in class src.
PaillierCryptosystemUtil
S
screen
- Static variable in class src.
GUI
serialVersionUID
- Static variable in class src.
GUI.Controls
serialVersionUID
- Static variable in class src.
GUI.MyTableModel
serialVersionUID
- Static variable in class src.
GUI
src
- package src
start
- Variable in class src.
GUI
T
table
- Variable in class src.
GUI.MyTableModel
textArea
- Variable in class src.
GUI
V
value
- Variable in enum src.
Candidates
valueOf(String)
- Static method in enum src.
Candidates
Returns the enum constant of this type with the specified name.
values()
- Static method in enum src.
Candidates
Returns an array containing the constants of this enum type, in the order they are declared.
A
C
D
E
G
I
L
M
N
P
R
S
T
V
Package
Class
Use
Tree
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes


Mobile First has become the de-facto standard for building modern sites. But in a world where everyone is mobile, an always-on connection isn't something we can rely on. It's time to start thinking Offline First.
This tutorial will show you how to add offline functionality to your site in under 10 minutes. When you're done, your visitors will no longer be greeted with an error screen when they visit your site with no connection... Instead you'll be able to control the content and experience they get.
We'll start with a simple site, and add the offline features to it:

<meta charset="UTF-8">
<title>Lonely Globe Advisor</title>

Top Hotels in Rome

Villa Domus - Via Piacenza 9, Rome, Italy

Hotel Trivelli - Piazza Barberini 11, Rome, Italy

Our sample site, Lonely Globe Advisor, offers visitors a list of the top hotels in Rome, with user ratings and an address.
But what happens if our user just landed in Rome and doesn't have a local data plan?
Well, he'll be out of luck.
We can control the experience our users get when they are offline with 2 simple steps:

<meta charset="UTF-8">
<title>Lonely Globe Advisor</title>

Top Hotels in Rome

Villa Domus - Via Piacenza 9, Rome, Italy

Hotel Trivelli - Piazza Barberini 11, Rome, Italy

In the code above we simply told UpUp to display some simple HTML the next time a user can't access our site.
With just this tiny bit of code, we've added an offline experience for our site, and allowed our users to see the best hotels in Rome… even when they can't access the web.
UpUp uses ServiceWorkers to determine when network requests fail. A ServiceWorker is a special script that runs in the browser in the background, and can see the status of network requests.
When the user first visits your site, UpUp registers a ServiceWorker with your browser, and gives it a list of files to cache for later.
The next time the user visits your site, the ServiceWorker listens for network errors. If a network request fails, and the ServiceWorker finds that file in the cache, it will return that file, as if it came from the network.
While this is already quite impressive, it still doesn't look anything like our online version. Let's improve the offline version with more content and our design.
We'll begin by moving our offline content to a separate file. This will make it much easier to update and maintain, and we'll no longer have to include the entire content of the offline site on every page.

<meta charset="UTF-8">
<title>Lonely Globe Advisor</title>

Top Hotels in Rome

Villa Domus - Via Piacenza 9, Rome, Italy

Hotel Trivelli - Piazza Barberini 11, Rome, Italy

Now the content our users see when they are offline, is the contents of offline.html
. This is just a simple HTML file, no different than any other page on our site.
Our offline.html
file contains two css files: bootstrap.min.css
and offline.css
. Let's make sure these are cached and available to our users when they are offline:

<meta charset="UTF-8">
<title>Lonely Globe Advisor</title>

Top Hotels in Rome

Villa Domus - Via Piacenza 9, Rome, Italy

Hotel Trivelli - Piazza Barberini 11, Rome, Italy

For security reasons, the browser only lets UpUp's ServiceWorker see network requests within its scope.
The scope that the ServiceWorker can affect is determined by where you placed upup.min.js
and upup.sw.min.js
. For example, if you place it on https://yoursite.com/js/upup.sw.min.js
, UpUp will only be able to show your offline content when users try to look at the /js/
directory.
This is why it is important to place both files on the same server as your content, and not in a subdirectory. This should idealy be in the root of your site (e.g. https://yoursite.com/upup.min.js).
With just one command and two settings, we can create rich offline experiences for our users. These can be as simple as the examples above, or as robust as a full single page application using frameworks like AngularJS, with content customized for each user, videos and even files the user can access while offline.

To preserve the user's security and privacy, ServiceWorkers can only detect requests over a secure connection.
During development you can use UpUp through localhost or file (e.g. both http://localhost/
and file:///Users/tal/index.html
are ok), but to deploy it to production you'll need to have HTTPS set up on your server.
This is a requirement for many new web technologies, and SSL certificates go for as little as $5, so don't let that stop you… progress is coming.
UpUp plays nicely with all browsers, progressively enhancing browsers that support Service Workers, while leaving users with older browsers unaffected.
UpUp currently supports Chrome 40+, Opera 27+ and Firefox 41+. If your users are using a different browser, they simply won't notice anything different.


CSPICE_GFOCLT determines time intervals when an observer sees one target
body occulted by, or in transit across, another.
The surfaces of the target bodies may be represented by triaxial
ellipsoids or by topographic data provided by DSK files.
Given:
Parameters-
All parameters described here are declared in the header file
SpiceGF.h. See that file for parameter values.
SPICE_GF_CNVTOL
is the convergence tolerance used for finding endpoints of
the intervals comprising the result window.
SPICE_GF_CNVTOL is used to determine when binary searches
for roots should terminate: when a root is bracketed
within an interval of length SPICE_GF_CNVTOL, the root is
considered to have been found.
The accuracy, as opposed to precision, of roots found
by this routine depends on the accuracy of the input
data. In most cases, the accuracy of solutions will be
inferior to their precision.
Arguments-
occtyp the string naming the type of occultation to find.
Note that transits are considered to be a type of
occultation.
[1,c1] = size(occtyp); char = class(occtyp)
Supported values and corresponding definitions are:
'FULL' denotes the full occultation
of the body designated by
'back' by the body designated
by 'front', as seen from
the location of the observer.
In other words, the occulted
body is completely invisible
as seen from the observer's
location.
'ANNULAR' denotes an annular
occultation: the body
designated by 'front' blocks
part of, but not the limb of,
the body designated by 'back',
as seen from the location of
the observer.
'PARTIAL' denotes a partial,
non-annular occultation: the
body designated by 'front'
blocks part, but not all, of
the limb of the body
designated by 'back', as seen
from the location of the
observer.
'ANY' denotes any of the above three
types of occultations:
'PARTIAL', 'ANNULAR', or
'FULL'.
'ANY' should be used to search
for times when the body
designated by 'front' blocks
any part of the body designated
by 'back'.
The option 'ANY' must be used
if either the front or back
target body is modeled as
a point.
Case and leading or trailing blanks are not significant in
the string 'occtyp'.
front the string naming the target body that occults---that
is, passes in front of---the other. Optionally, you may
supply the integer NAIF ID code for the body as a
string. For example both 'MOON' and '301' are
legitimate strings that designate the Moon.
[1,c2] = size(front); char = class(front)
The 'front' string lacks sensitivity to case, leading
and trailing blanks.
fshape the string naming the geometric model used
to represent the shape of the front target body.
[1,c3] = size(fshape); char = class(fshape)
'ELLIPSOID' Use a triaxial ellipsoid model
with radius values provided via the
kernel pool. A kernel variable
having a name of the form
'BODYnnn_RADII'
where nnn represents the NAIF
integer code associated with the
body, must be present in the kernel
pool. This variable must be
associated with three numeric
values giving the lengths of the
ellipsoid's X, Y, and Z semi-axes.
'POINT' Treat the body as a single point.
When a point target is specified,
the occultation type must be
set to 'ANY'.
'DSK/UNPRIORITIZED[/SURFACES = <surface list>]'
Use topographic data provided by DSK files to
model the body's shape. These data must be
provided by loaded DSK files.
The surface list specification is optional. The
syntax of the list is
<surface 1> [, <surface 2>...]
If present, it indicates that data only for the
listed surfaces are to be used; however, data
need not be available for all surfaces in the
list. If absent, loaded DSK data for any surface
associated with the target body are used.
The surface list may contain surface names or
surface ID codes. Names containing blanks must
be delimited by double quotes, for example
SURFACES = "Mars MEGDR 128 PIXEL/DEG"
If multiple surfaces are specified, their names
or IDs must be separated by commas.
See the Particulars section below for details
concerning use of DSK data.
The combinations of the shapes of the target bodies
`front' and `back' must be one of:
One ELLIPSOID, one POINT
Two ELLIPSOIDs
One DSK, one POINT
Case and leading or trailing blanks are not
significant in the string `fshape'.
fframe the string naming the body-fixed, body-centered reference
frame associated with the front target body. Examples
of such names are 'IAU_SATURN' (for Saturn) and
'ITRF93' (for the Earth).
[1,c4] = size(fframe); char = class(fframe)
If the front target body is modeled as a point, 'fframe'
should be left empty or blank.
The 'fframe' string lacks sensitivity to case, leading
and trailing blanks.
back the string naming the target body that is occulted
by---that is, passes in back of---the other.
Optionally, you may supply the integer NAIF ID code
for the body as a string. For example both 'MOON' and
'301' are legitimate strings that designate the Moon.
[1,c5] = size(back); char = class(back)
The 'back' string lacks sensitivity to case, leading
and trailing blanks.
bshape the string naming the shape specification for the body
designated by 'back'. The supported options are those for
'fshape'. See the description of 'fshape' above for
details.
[1,c6] = size(bshape); char = class(bshape)
bframe the string naming the body-fixed, body-centered
reference frame associated with the ''back'' target body.
Examples of such names are 'IAU_SATURN' (for Saturn)
and 'ITRF93' (for the Earth).
[1,c7] = size(bframe); char = class(bframe)
If the back target body is modeled as a point, 'bframe'
should be left empty or blank.
The 'bframe' string lacks sensitivity to case, leading
and trailing blanks.
abcorr the string indicating the aberration corrections to to apply
to the state of the target body to account for one-way
light time. Stellar aberration corrections are
ignored if specified, since these corrections don't
improve the accuracy of the occultation determination.
[1,c8] = size(abcorr); char = class(abcorr)
This routine accepts the same aberration corrections as does
the CSPICE routine cspice_spkezr. See the abcorr.req
for a detailed description of the aberration correction
options. For convenience, the options are listed below:
'NONE' Apply no correction.
'LT' "Reception" case: correct for
one-way light time using a Newtonian
formulation.
'LT+S' "Reception" case: correct for
one-way light time and stellar
aberration using a Newtonian
formulation.
'CN' "Reception" case: converged
Newtonian light time correction.
'CN+S' "Reception" case: converged
Newtonian light time and stellar
aberration corrections.
'XLT' "Transmission" case: correct for
one-way light time using a Newtonian
formulation.
'XLT+S' "Transmission" case: correct for
one-way light time and stellar
aberration using a Newtonian
formulation.
'XCN' "Transmission" case: converged
Newtonian light time correction.
'XCN+S' "Transmission" case: converged
Newtonian light time and stellar
aberration corrections.
The 'abcorr' string lacks sensitivity to case, and to embedded,
leading and trailing blanks.
obsrvr the name of the observing body. Optionally, you
may supply the ID code of the object as an integer string.
For example, both 'EARTH' and '399' are legitimate
strings to supply to indicate the observer is Earth.
[1,c9] = size(obsrvr); char = class(obsrvr)
Case and leading or trailing blanks are not significant in
the string 'obsrvr'.
step the step size to use in the search. 'step' must be shorter
than any interval, within the confinement window, over which
the specified occultation condition is met. In other words,
'step' must be shorter than the shortest occultation event
the user wishes to detect; 'step' must also be shorter than
the shortest time interval between two occultation events that
occur within the confinement window (see below). However,
'step' must not be *too* short, or the search will take
an unreasonable amount of time.
[1,1] = size(step); double = class(step)
The choice of 'step' affects the completeness but not
the precision of solutions found by this routine; the
precision is controlled by the convergence tolerance.
See the discussion of the parameter SPICE_GF_CNVTOL for
details.
'step' has units of TDB seconds.
cnfine the SPICE window that confines the time
period over which the specified search is conducted.
'cnfine' may consist of a single interval or a collection
of intervals.
[2m,1] = size(cnfine); double = class(cnfine)
In some cases the confinement window can be used to
greatly reduce the time period that must be searched
for the desired solution. See the Particulars section
below for further discussion.
room the maximum number of intervals to return in 'result'.
Note: this value should equal at least the number of expected
intervals. Recall two double precision values define
an interval.
[1,1] = size(room); int32 = class(room)
the call:
result = cspice_gfoclt( occtyp, front, fshape, fframe, ...
back, bshape, bframe, abcorr, ...
obsrvr, step, cnfine, room)
returns:
result the SPICE window of intervals, contained within the
confinement window 'cnfine', on which the specified
constraint is satisfied.
[2n,1] = size(result); double = class(result)
If no times within the confinement window satisfy the
constraint, 'result' will return with cardinality zero.
Any numerical results shown for this example may differ between
platforms as the results depend on the SPICE kernels used as input
and the machine specific arithmetic implementation.
Example(1):
Find occultations of the Sun by the Moon (that is, solar
eclipses)as seen from the center of the Earth over the month
December, 2001.
Use light time corrections to model apparent positions of Sun
and Moon. Stellar aberration corrections are not specified
because they don't affect occultation computations.
We select a step size of 3 minutes, which means we
ignore occultation events lasting less than 3 minutes,
if any exist.
MAXWIN = 1000;
TIMFMT = 'YYYY-MON-DD HR:MN:SC.###### (TDB) ::TDB ::RND';
%
% Load kernels.
%
cspice_furnsh( 'standard.tm' );
%
% Store the time bounds of our search interval in
% the cnfine confinement window.
%
et = cspice_str2et( { '2001 DEC 01 00:00:00 TDB', ...
'2002 JAN 01 00:00:00 TDB'} );
cnfine = cspice_wninsd( et(1), et(2) );
%
% Select a 3-minute step. We'll ignore any occultations
% lasting less than 3 minutes.
%
step = 180.;
occtyp = 'any';
front = 'moon';
fshape = 'ellipsoid';
fframe = 'iau_moon';
back = 'sun';
bshape = 'ellipsoid';
bframe = 'iau_sun';
obsrvr = 'earth';
abcorr = 'lt';
result = cspice_gfoclt( occtyp, front, fshape, fframe, ...
back, bshape, bframe, ...
abcorr, obsrvr, step, cnfine, ...
MAXWIN);
%
% List the beginning and ending times in each interval
% if result contains data.
%
for i=1:numel(result)/2
[left, right] = cspice_wnfetd( result, i );
output = cspice_timout( [left,right], TIMFMT );
if( isequal( left, right) )
disp( ['Event time: ' output(1,:)] )
else
disp( ['From : ' output(1,:)] )
disp( ['To : ' output(2,:)] )
disp( ' ')
end
end
%
% It's always good form to unload kernels after use,
% particularly in Matlab due to data persistence.
%
cspice_kclear
MATLAB outputs:
From : 2001-DEC-14 20:10:14.196213 (TDB)
To : 2001-DEC-14 21:35:50.318416 (TDB)
Example(2):
Find occultations of Titan by Saturn or of Saturn by
Titan as seen from the center of the Earth over the
last three months of 2008. Search for every type
of occultation.
Use light time corrections to model apparent positions of
Saturn and Titan. Stellar aberration corrections are not
specified because they don't affect occultation computations.
We select a step size of 15 minutes, which means we
ignore occultation events lasting less than 15 minutes,
if any exist.
MAXWIN = 1000;
TIMFMT = 'YYYY-MON-DD HR:MN:SC.###### (TDB) ::TDB ::RND';
OCCTYP = {'FULL', 'ANNULAR', 'PARTIAL', 'ANY' };
%
% Load kernels.
%
cspice_furnsh( 'standard.tm' );
cspice_furnsh( 'sat288.bsp' );
%
% Store the time bounds of our search interval in
% the cnfine confinement window.
%
et = cspice_str2et( { '2008 SEP 01 00:00:00 TDB', ...
'2009 JAN 01 00:00:00 TDB'} );
cnfine = cspice_wninsd( et(1), et(2) );
%
% Select a 15-minute step. We'll ignore any occultations
% lasting less than 15 minutes.
%
step = 900.;
%
% The observation location is the Earth.
%
obsrvr = 'earth';
shape = 'ellipsoid';
abcorr = 'lt';
for i=1:numel(OCCTYP)
%
% For each type, do a search for both transits of
% Titan across Saturn and occultations of Titan by
% Saturn.
%
for j=1:2
if isequal(j,1)
front = 'TITAN';
fframe = 'IAU_TITAN';
back = 'SATURN';
bframe = 'IAU_SATURN';
else
front = 'SATURN';
fframe = 'IAU_SATURN';
back = 'TITAN';
bframe = 'IAU_TITAN';
end
result = cspice_gfoclt( OCCTYP(i), ...
front, shape, fframe, ...
back, shape, bframe, ...
abcorr, obsrvr, step, cnfine, ...
MAXWIN);
fprintf( 'Condition : %s\n', char(OCCTYP(i)) )
fprintf( 'Occultation of : %s\n', back )
fprintf( 'by : %s\n\n', front )
%
% List the beginning and ending times in each interval
% if result contains data.
%
count = numel(result)/2;
if isequal(count,0)
fprintf( 'Result window is empty.\n\n' )
else
for k=1:count
[left, right] = cspice_wnfetd( result, k );
output = cspice_timout( [left,right], TIMFMT );
if( isequal( left, right) )
disp( ['Event time: ' output(1,:)] )
else
disp( ['From : ' output(1,:)] )
disp( ['To : ' output(2,:)] )
disp( ' ')
end
end
end
%
% We've finished displaying the results of the
% current search.
%
end
%
% We've finished displaying the results of the
% searches using the current occultation type.
%
end
%
% It's always good form to unload kernels after use,
% particularly in Matlab due to data persistence.
%
cspice_kclear
MATLAB outputs:
Condition : FULL
Occultation of : SATURN
by : TITAN
Result window is empty.
Condition : FULL
Occultation of : TITAN
by : SATURN
From : 2008-OCT-27 22:08:01.627053 (TDB)
To : 2008-OCT-28 01:05:03.375237 (TDB)
From : 2008-NOV-12 21:21:59.252263 (TDB)
To : 2008-NOV-13 02:06:05.053051 (TDB)
From : 2008-NOV-28 20:49:02.402832 (TDB)
To : 2008-NOV-29 02:13:58.986344 (TDB)
From : 2008-DEC-14 20:05:09.246177 (TDB)
To : 2008-DEC-15 01:44:53.523002 (TDB)
From : 2008-DEC-30 19:00:56.577073 (TDB)
To : 2008-DEC-31 00:42:43.222909 (TDB)
Condition : ANNULAR
Occultation of : SATURN
by : TITAN
From : 2008-OCT-19 21:29:20.599088 (TDB)
To : 2008-OCT-19 22:53:34.518737 (TDB)
From : 2008-NOV-04 20:15:38.620369 (TDB)
To : 2008-NOV-05 00:18:59.139979 (TDB)
From : 2008-NOV-20 19:38:59.647712 (TDB)
To : 2008-NOV-21 00:35:26.725909 (TDB)
From : 2008-DEC-06 18:58:34.073269 (TDB)
To : 2008-DEC-07 00:16:17.647040 (TDB)
From : 2008-DEC-22 18:02:46.288290 (TDB)
To : 2008-DEC-22 23:26:52.712459 (TDB)
Condition : ANNULAR
Occultation of : TITAN
by : SATURN
Result window is empty.
Condition : PARTIAL
Occultation of : SATURN
by : TITAN
From : 2008-OCT-19 20:44:30.326772 (TDB)
To : 2008-OCT-19 21:29:20.599088 (TDB)
From : 2008-OCT-19 22:53:34.518737 (TDB)
To : 2008-OCT-19 23:38:26.250580 (TDB)
From : 2008-NOV-04 19:54:40.339331 (TDB)
To : 2008-NOV-04 20:15:38.620369 (TDB)
From : 2008-NOV-05 00:18:59.139979 (TDB)
To : 2008-NOV-05 00:39:58.612936 (TDB)
From : 2008-NOV-20 19:21:46.689523 (TDB)
To : 2008-NOV-20 19:38:59.647712 (TDB)
From : 2008-NOV-21 00:35:26.725909 (TDB)
To : 2008-NOV-21 00:52:40.604704 (TDB)
From : 2008-DEC-06 18:42:36.100544 (TDB)
To : 2008-DEC-06 18:58:34.073269 (TDB)
From : 2008-DEC-07 00:16:17.647040 (TDB)
To : 2008-DEC-07 00:32:16.324244 (TDB)
From : 2008-DEC-22 17:47:10.776723 (TDB)
To : 2008-DEC-22 18:02:46.288290 (TDB)
From : 2008-DEC-22 23:26:52.712459 (TDB)
To : 2008-DEC-22 23:42:28.850543 (TDB)
Condition : PARTIAL
Occultation of : TITAN
by : SATURN
From : 2008-OCT-27 21:37:16.970175 (TDB)
To : 2008-OCT-27 22:08:01.627053 (TDB)
From : 2008-OCT-28 01:05:03.375237 (TDB)
To : 2008-OCT-28 01:35:49.266507 (TDB)
From : 2008-NOV-12 21:01:47.105499 (TDB)
To : 2008-NOV-12 21:21:59.252263 (TDB)
From : 2008-NOV-13 02:06:05.053051 (TDB)
To : 2008-NOV-13 02:26:18.227358 (TDB)
From : 2008-NOV-28 20:31:28.522707 (TDB)
To : 2008-NOV-28 20:49:02.402832 (TDB)
From : 2008-NOV-29 02:13:58.986344 (TDB)
To : 2008-NOV-29 02:31:33.691598 (TDB)
From : 2008-DEC-14 19:48:27.094229 (TDB)
To : 2008-DEC-14 20:05:09.246177 (TDB)
From : 2008-DEC-15 01:44:53.523002 (TDB)
To : 2008-DEC-15 02:01:36.360243 (TDB)
From : 2008-DEC-30 18:44:23.485899 (TDB)
To : 2008-DEC-30 19:00:56.577073 (TDB)
From : 2008-DEC-31 00:42:43.222909 (TDB)
To : 2008-DEC-31 00:59:17.030569 (TDB)
Condition : ANY
Occultation of : SATURN
by : TITAN
From : 2008-OCT-19 20:44:30.326772 (TDB)
To : 2008-OCT-19 23:38:26.250580 (TDB)
From : 2008-NOV-04 19:54:40.339331 (TDB)
To : 2008-NOV-05 00:39:58.612936 (TDB)
From : 2008-NOV-20 19:21:46.689523 (TDB)
To : 2008-NOV-21 00:52:40.604704 (TDB)
From : 2008-DEC-06 18:42:36.100544 (TDB)
To : 2008-DEC-07 00:32:16.324244 (TDB)
From : 2008-DEC-22 17:47:10.776723 (TDB)
To : 2008-DEC-22 23:42:28.850543 (TDB)
Condition : ANY
Occultation of : TITAN
by : SATURN
From : 2008-OCT-27 21:37:16.970175 (TDB)
To : 2008-OCT-28 01:35:49.266507 (TDB)
From : 2008-NOV-12 21:01:47.105499 (TDB)
To : 2008-NOV-13 02:26:18.227358 (TDB)
From : 2008-NOV-28 20:31:28.522707 (TDB)
To : 2008-NOV-29 02:31:33.691598 (TDB)
From : 2008-DEC-14 19:48:27.094229 (TDB)
To : 2008-DEC-15 02:01:36.360243 (TDB)
From : 2008-DEC-30 18:44:23.485899 (TDB)
To : 2008-DEC-31 00:59:17.030569 (TDB)
This routine provides a simple interface for conducting searches for
occultation events.
This routine determines a set of one or more time intervals
within the confinement window when a specified type of
occultation occurs. The resulting set of intervals is returned as
a SPICE window.
Below we discuss in greater detail aspects of this routine's
solution process that are relevant to correct and efficient
use of this routine in user applications.
The Search Process
==================
The search for occultations is treated as a search for state
transitions: times are sought when the state of the `back' body
changes from "not occulted" to "occulted" or vice versa.
Step Size
=========
Each interval of the confinement window is searched as follows:
first, the input step size is used to determine the time separation
at which the occultation state will be sampled. Starting at the left
endpoint of the interval, samples of the occultation state will be
taken at each step. If a state change is detected, a root has been
bracketed; at that point, the "root"--the time at which the state
change occurs---is found by a refinement process, for example, via
binary search.
Note that the optimal choice of step size depends on the lengths
of the intervals over which the occultation state is constant:
the step size should be shorter than the shortest occultation
duration and the shortest period between occultations, within
the confinement window.
Having some knowledge of the relative geometry of the targets and
observer can be a valuable aid in picking a reasonable step size.
In general, the user can compensate for lack of such knowledge by
picking a very short step size; the cost is increased computation
time.
Note that the step size is not related to the precision with which
the endpoints of the intervals of the result window are computed.
That precision level is controlled by the convergence tolerance.
Convergence Tolerance
=====================
Once a root has been bracketed, a refinement process is used to
narrow down the time interval within which the root must lie. This
refinement process terminates when the location of the root has been
determined to within an error margin called the "convergence
tolerance." The convergence tolerance used by this routine is set
via the parameter SPICE_GF_CNVTOL.
The value of SPICE_GF_CNVTOL is set to a "tight" value so that the
tolerance doesn't limit the accuracy of solutions found by this
routine. In general the accuracy of input data will be the limiting
factor.
To use a different tolerance value, a lower-level GF routine such as
gfocce_c must be called. Making the tolerance tighter than
SPICE_GF_CNVTOL is unlikely to be useful, since the results are
unlikely to be more accurate. Making the tolerance looser will speed
up searches somewhat, since a few convergence steps will be omitted.
However, in most cases, the step size is likely to have a much
greater effect on processing time than would the convergence
tolerance.
The Confinement Window
======================
The simplest use of the confinement window is to specify a time
interval within which a solution is sought.
The confinement window also can be used to restrict a search to
a time window over which required data (typically ephemeris
data, in the case of occultation searches) are known to be
available.
In some cases, the confinement window be used to make searches
more efficient. Sometimes it's possible to do an efficient search
to reduce the size of the time period over which a relatively
slow search of interest must be performed. See the "CASCADE"
example program in gf.req for a demonstration.
Using DSK data
==============
DSK loading and unloading
-------------------------
DSK files providing data used by this routine are loaded by
calling cspice_furnsh and can be unloaded by calling cspice_unload or
cspice_kclear. See the documentation of cspice_furnsh for limits on
numbers of loaded DSK files.
For run-time efficiency, it's desirable to avoid frequent
loading and unloading of DSK files. When there is a reason to
use multiple versions of data for a given target body---for
example, if topographic data at varying resolutions are to be
used---the surface list can be used to select DSK data to be
used for a given computation. It is not necessary to unload
the data that are not to be used. This recommendation presumes
that DSKs containing different versions of surface data for a
given body have different surface ID codes.
DSK data priority
-----------------
A DSK coverage overlap occurs when two segments in loaded DSK
files cover part or all of the same domain---for example, a
given longitude-latitude rectangle---and when the time
intervals of the segments overlap as well.
When DSK data selection is prioritized, in case of a coverage
overlap, if the two competing segments are in different DSK
files, the segment in the DSK file loaded last takes
precedence. If the two segments are in the same file, the
segment located closer to the end of the file takes
precedence.
When DSK data selection is unprioritized, data from competing
segments are combined. For example, if two competing segments
both represent a surface as a set of triangular plates, the
union of those sets of plates is considered to represent the
surface.
Currently only unprioritized data selection is supported.
Because prioritized data selection may be the default behavior
in a later version of the routine, the UNPRIORITIZED keyword is
required in the `fshape' and `bshape' arguments.
Syntax of the shape input arguments for the DSK case
----------------------------------------------------
The keywords and surface list in the target shape arguments
`bshape' and `fshape' are called "clauses." The clauses may
appear in any order, for example
"DSK/<surface list>/UNPRIORITIZED"
"DSK/UNPRIORITIZED/<surface list>"
"UNPRIORITIZED/<surface list>/DSK"
The simplest form of the `method' argument specifying use of
DSK data is one that lacks a surface list, for example:
"DSK/UNPRIORITIZED"
For applications in which all loaded DSK data for the target
body are for a single surface, and there are no competing
segments, the above string suffices. This is expected to be
the usual case.
When, for the specified target body, there are loaded DSK
files providing data for multiple surfaces for that body, the
surfaces to be used by this routine for a given call must be
specified in a surface list, unless data from all of the
surfaces are to be used together.
The surface list consists of the string
"SURFACES = "
followed by a comma-separated list of one or more surface
identifiers. The identifiers may be names or integer codes in
string format. For example, suppose we have the surface
names and corresponding ID codes shown below:
Surface Name ID code
------------ -------
"Mars MEGDR 128 PIXEL/DEG" 1
"Mars MEGDR 64 PIXEL/DEG" 2
"Mars_MRO_HIRISE" 3
If data for all of the above surfaces are loaded, then
data for surface 1 can be specified by either
'SURFACES = 1'
or
'SURFACES = "Mars MEGDR 128 PIXEL/DEG"'
Double quotes are used to delimit the surface name because
it contains blank characters.
To use data for surfaces 2 and 3 together, any
of the following surface lists could be used:
'SURFACES = 2, 3'
'SURFACES = "Mars MEGDR 64 PIXEL/DEG", 3'
'SURFACES = 2, Mars_MRO_HIRISE'
'SURFACES = "Mars MEGDR 64 PIXEL/DEG", Mars_MRO_HIRISE'
An example of a shape argument that could be constructed
using one of the surface lists above is
'DSK/UNPRIORITIZED/SURFACES = "Mars MEGDR 64 PIXEL/DEG", 3'
For important details concerning this module's function, please refer to
the CSPICE routine gfoclt_c.
MICE.REQ
DSK.REQ
GF.REQ
SPK.REQ
CK.REQ
TIME.REQ
WINDOWS.REQ
-Mice Version 2.0.0, 04-APR-2017, EDW (JPL), NJB (JPL)
Header update to reflect support for use of DSKs.
Edited I/O section to conform to NAIF standard for Mice documentation.
-Mice Version 1.1.0, 12-MAY-2012, EDW (JPL)
Renamed the argument 'size' to 'room'. "size" is a Matlab function
name and it's seriously dumb to use a function name word as an argument
name.
Edited I/O section to conform to NAIF standard for Mice documentation.
Header updated to describe use of cspice_gfstol.
-Mice Version 1.0.0, 15-APR-2009, EDW (JPL)
GF occultation search
|


- insert(Invoice) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.InvoiceDao
-
- insert(List<Invoice>) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.InvoiceDao
-
- insert(Job) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.JobDao
-
- insert(List<Job>) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.JobDao
-
- insert(Quote) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.QuoteDao
-
- insert(List<Quote>) - Method in interface com.bluecirclesquare.projecthelper2.model.dao.QuoteDao
-
- Invoice - Class in com.bluecirclesquare.projecthelper2.model.entity
-
This is the entity invoice.class that lists all the fields, with the necessary setters and getters
needed to populate ProjectDatabase.class the database
- Invoice() - Constructor for class com.bluecirclesquare.projecthelper2.model.entity.Invoice
-
- InvoiceDao - Interface in com.bluecirclesquare.projecthelper2.model.dao
-
This is the dao InvoiceDao.class that is used for accessing invoice records
- InvoicesFragment - Class in com.bluecirclesquare.projecthelper2.view
-
This is the InvoicesFragment class that inflates the view to populate the items held by
the recyclerview
- InvoicesFragment() - Constructor for class com.bluecirclesquare.projecthelper2.view.InvoicesFragment
-
- InvoiceViewAdapter - Class in com.bluecirclesquare.projecthelper2.adapter
-
This is the InvoiceViewAdapter.class that uses RecyclerView to populate list items
- InvoiceViewAdapter(Context, List<Invoice>) - Constructor for class com.bluecirclesquare.projecthelper2.adapter.InvoiceViewAdapter
-
Gets the list of invoices from the adapter
- InvoiceViewAdapter.Holder - Class in com.bluecirclesquare.projecthelper2.adapter
-
Holds the fields that will be populated by the recyclerview


DID - Duplicate Import Declarations
There should be only one import declaration that imports a particular class/package.
Wrong
import java.io.*;
import java.io.*;
import java.sql.Time;
import java.sql.Time;
class DID {
}
Tip: Delete duplicate declarations


A very simple single page application
Push the button to log in
Login
Results of Login will be displayed below:


Starneo-Go is Your newest guied in Dublin, This website is built with the hope in granting whoever using it to enjoy playing Video/Mobile Games on the Go in Dublin! The work on the website started on the second week of November 2018.
Starneo-Go is Your newest guied in Dublin, This website is built with the hope in granting whoever using it to enjoy playing Video/Mobile Games on the Go in Dublin! The work on the website started on the second week of November 2018.


If you're using nginx webserver with php running in fastcgi mode, you can use nginx fastcgi cache to reduce strain
that feeds puts on your server and at the same time greatly improve feeds performance.
The feeds will generate only once in a while and stored in the cache until they expire.
While not expired the feed will be served from the cache as static file
without any need for time and resource consuming tasks.
For more information about configuration below go to nginx fastcgi documentation page.
To start caching you first must define cache path anywhere in 'http' section of your nginx.conf file.
fastcgi_cache_path /tmp/nginx/cache
levels=1:2 keys_zone=fastcgi_cache:32m max_size=256m inactive=60m;
To enable cache for the feeds only and not for your entire website use nginx's map directive.
map $request_uri $nocache {
default 1;
~/feeds/ 0;
}
Then put the following inside .php location(where fastcgi_pass directive is located) of your 'server' directive in nginx.conf.
add_header X-FastCGI-Cache $upstream_cache_status;
fastcgi_ignore_headers Cache-Control Expires Set-Cookie;
fastcgi_cache_key "$scheme$request_method$host$request_uri$cookie_user_selected_lang";
fastcgi_cache fastcgi_cache;
fastcgi_no_cache $nocache;
fastcgi_cache_valid 200 10m;
fastcgi_cache_use_stale updating error timeout invalid_header http_500;
With this settings cache expires after 10 minutes so your feed only needed to be generated once in 10 minutes.
To adjust expiration time you can change 'fastcgi_cache_valid 200 10m' string to a different value.
You can use web-sniffer to check that your cache is working.
Put http://example.com/feeds/atom in HTTP(S)-URL field and
leave other settings default, then enter the captcha and click Submit.
You should see 'X-FastCGI-Cache: MISS' in HTTP Response Header section.
Click submit again and check that X-FastCGI-Cache header changed to 'X-FastCGI-Cache: HIT'.
This confirms that second response came from cache.


brain wrote:Nokia 3210 :-)
ALL-STAR-CHRONIC wrote:Comment below on your first ever Mobile Phone! :D .
Mine was Nokia 3310 (Also know as the BRICK!)
http://lh6.googleusercontent.com/public/0QQ4L9pPZbXXJ0OYGAN6cygESPBPDVgywLYCRer97AwmaiCWqBrcAHlXq8wzImWcYmrGB7u14H--91THVZ0tFSQVES5T1Kljd5yBrn4m1a6J2vUVwjVKoLfj0CkD0Q


Alexander Pierce - Web Developer Member since Nov. 2012
You are about to delete one track, this procedure is irreversible.
Do you want to proceed?


How to get presale tickets for the Westlife shows in Falkirk and Inverness next year
Ticket presales to see the Irish band start on Tuesday - here are all the details on how to access them
by Linda HowardWestlife may not be playing Glasgow or Edinburgh as part of their ‘Stadiums in the Summer’ 2020 tour, but you will be able to see them in Falkirk and Inverness.
Nicky Byrne, Shane Filan, Mark Feehily and Kian Egan will perform at Falkirk Stadium , Grangemouth and Tulloch Caledonian Stadium , Inverness next June.
Fans will be treated to the global pop kings performing all of their greatest hits including 'Swear It Again', ‘Flying Without Wings’ and ‘You Raise Me Up’ as well as sensational up-tempo new songs from their forthcoming new album ‘Spectrum’.
The ‘ Stadiums in the Summer ’ announcement follows the phenomenal success of Westlife's remarkable comeback and comes as the band prepares to release their brand new album ‘Spectrum’ on November 15.
And if you pre-order ‘Spectrum’ on any format before 4pm on Monday, November 4 you’ll receive a unique passcode for early access tickets to Westlife’s UK Summer 2020 tour.
If you have already pre-ordered the album from the official Westlife store, you are automatically eligible for presale access.
Codes will be emailed from 6pm on Monday, November 4 ahead of the presale starting on Tuesday, November 5 at 9am - fans will be able ti buy up to 8 tickets on a single code.
Tickets go on general sale at 9am on Friday, November 8 through Ticketmaster , but there are a number of presales starting on Tuesday along with the album pre-order access - you’ll find all the details below.
Westlife presale tickets for Falkirk and Inverness
Tuesday, November 5 - 9am
- Album pre-order - you can buy ‘Spectrum’ here at Westlife.com
- Tickets: Ticketaster l Buy here
Wednesday, November 6 - 9am
- O2 Priority
- Tickets: Ticketaster l Buy here
Thursday, November 7 - 9am
- Gigs in Scotland
- Tickets: Ticketaster l Buy here
Thursday, November 7 - 9am
- Live Nation
- Tickets: Ticketaster l Buy here
Tickets go on general sale at 9am on Friday, November 8 through Ticketmaster here .
Stadiums in the Summer Tour
- 19 June 2020 - Norwich - Carrow Road
- 21 June 2020 - Peterborough - The Weston Homes Stadium
- 26 June 2020 - Cardiff - Cardiff City Stadium
- 27 June 2020 - Falkirk - The Falkirk Stadium
- 28 June 2020 - Inverness - Inverness Caledonian Stadium
- 03 July 2020 - Southampton - The Ageas Bowl
- 04 July 2020 - Plymouth - Home Park
- 05 July 2020 - Colwyn Bay - Stadium Zipworld
- 10 July 2020 - Hull - Hull College Craven Park Stadium
- 11 July 2020 - Colchester - Castle Park
- 12 July 2020 - Gloucester - Kingsholm Stadium
- 16 July 2020 - Leicester - Fischer County Ground
- 17 July 2020 - Kent - The Spitfire Ground
- 18 July 2020 - Durham - Emirates Riverside
- 22 August 2020 - London - Wembley Stadium


Service Jam is a design-driven hackathon also known as "jams" and a global movement on design thinking, prototyping and service design. It was a weekend of fun and creativity amongst 100 participating cities. The final design is what you make of 2017's theme "Hello? lo? o? o."
We kicked off the hackathon with our interpretation of "Hello".
My first thought was chat bot. I see chat bot as part engagement and part automation, the former to engage users in a world of interaction dominated by text messages and the latter for streamlining customer service tasks.
As I seeked like-minded individuals to join my team, I merged my idea with another on the automation of dining experiences. Because we thought, why not merge based on the commonality of health?
We started by framing a "How might we" problem statement. The trick is to keep the question open and not write the problem statement to fit the solution. Because, well, our user research findings eventually proved this first problem statement irrelevant.
Our hackathon venue sits in an interesting mix of warehouse spaces and residentials. This pre-determined our user profiles, but given a 48-hour time frame, we worked with what we had.
We hit up a soccer field close by and interviewed students and parents by the bleachers to understand their take on eating healthy when dining out.
For those who want healthy options and to diet, they just eat at home. For others, they always make a conscious effort to eat healthy at home and when they're out. The problem, however, is eating healthy at work can be difficult.
The beauty of design thinking is we fail but iterate quickly.
Based on our user research, we identified one key behavior that inspired our winning solution: People usually skip breakfast on work days. That later became our team name #NoMoreBS, short for No More Breakfast Skippers.
Based on that, we did another round of user research and stumbled upon the concepts of employee motivation.
Team managers want to keep their staff and employees engaged. Staff and employees, on the other hand, sometimes stress eat or struggle to feel inspired at work. It was then we realized that breakfast treats could be one of the ways to motivate them.
With that, we reframed our problem statement.
Hello Box is a staff and employee wellness subscription program for team leads and managers to bring zombies (demotivated staff and employees) back to life and prevent them from becoming zombies.
Wellness refers to three main pillars - Health for physical health, Smarts for mental health, and Happiness for all of the above.
Healthy Breakfast Plans for your Staff and Employees
S M A R T S
Workshops to Stimulate Creativity & Innovation
H A P P I N E S S
The Ultimate Wellness Plan for Health and Smarts
Depending on your team and organization's needs, you can subscribe to all three tiers complete with nutritious breakfast plans and creative thinking workshops, or simply one tier's worth of Smarts.
Team #NoMoreBS from left to right: Gordon Lee, Samson Ng, Me, Herbert Lee and Leo Chak
48 hours, many iteration and mad prototyping had paid off! We won the hackathon and earned ourselves the name "Quickest & Dirtiest" prototype thanks to the Playdough and breakfast catering box.
Designing for services is more than mobile app interfaces. It's about physical interactions and the intanigble emotions. And more importantly, it's okay to fail or not know what you're building. Just get back on your feet quick and keep prototyping.
Check out the Hackathon Series:


404 Page Not Found
Sorry, but the page you were trying to view does not exist.
Tryck här för att fortsätta handla
Sorry, but the page you were trying to view does not exist.
Tryck här för att fortsätta handla


Research
Laboratories - Theory of Computation
Learn about Computation Research
Computational Learning Laboratory
342 Smith Hall, Professor John Case.
The members of the Computational Learning Laboratory do theoretical, mathematical work regarding abstract machine models of, among other things, learning and self-modeling.
LinBox Laboratory
119 Elkton Road, Professor David Saunders, Research Associate Professor David Wood.
We design algorithms and high performance implementations for exact linear algebra computation. Exact linear algebra with matrices of integers is harder than the more widely used approximate linear algebra in floating point. Our work contributes to LinBox, a software library for solving exact systems exactly. It is developed by a team of researchers in the US, France, and Canada.
Network Management and Optimization Laboratory
342 Smith Hall, Professors Adarsh Sethi and Errol Lloyd.
Network management involves the design of techniques for the monitoring and control of computer networks to ensure optimal performance and resource utilization. We focus on fault management whose aim is to detect, diagnose, localize, and recover from hardware and software failures and performance bottlenecks that may plague a network. We are also interested in the management of wireless networks including methods for managing mobility to provide seamless operation of network services.
In network optimization we aim to provide provably optimal or near optimal solutions to a range of power specification and control problems arising in wireless ad hoc and sensor networks. The primary focus is on topology control (assigning power levels to network nodes so as to achieve a specified network topology) in both stationary and mobile networks. Additional work includes the study of relay node placement and of power back off as a collision resolution mechanism.