‘Writing user interfaces without all that mucking about in hyperspace’
Npyscreen is a python widget library and application framework for programming terminal or console applications. It is built on top of ncurses, which is part of the standard library.
Wouldn’t it be really nice if asking the user to give you some information could be easy? As easy as:
MyForm = Form()
usrn_box = MyForm.add_widget(TitleText, name="Your name:")
internet = MyForm.add_widget(TitleText, name="Your favourite internet page:")
MyForm.edit()
# usrn_box.value and internet.value now hold the user's answers.
If you think so, this library is for you.
This is an example of a simple, one-screen application. More advanced applications would use the NPSAppManaged framework:
#!/usr/bin/env python
# encoding: utf-8
import npyscreen
class TestApp(npyscreen.NPSApp):
def main(self):
# These lines create the form and populate it with widgets.
# A fairly complex screen in only 8 or so lines of code - a line for each control.
F = npyscreen.Form(name = "Welcome to Npyscreen",)
t = F.add(npyscreen.TitleText, name = "Text:",)
fn = F.add(npyscreen.TitleFilename, name = "Filename:")
fn2 = F.add(npyscreen.TitleFilenameCombo, name="Filename2:")
dt = F.add(npyscreen.TitleDateCombo, name = "Date:")
s = F.add(npyscreen.TitleSlider, out_of=12, name = "Slider")
ml = F.add(npyscreen.MultiLineEdit,
value = """try typing here!\nMutiline text, press ^R to reformat.\n""",
max_height=5, rely=9)
ms = F.add(npyscreen.TitleSelectOne, max_height=4, value = [1,], name="Pick One",
values = ["Option1","Option2","Option3"], scroll_exit=True)
ms2= F.add(npyscreen.TitleMultiSelect, max_height =-2, value = [1,], name="Pick Several",
values = ["Option1","Option2","Option3"], scroll_exit=True)
# This lets the user interact with the Form.
F.edit()
print ms.get_selected_objects()
if __name__ == "__main__":
App = TestApp()
App.run()
This framework should be powerful enough to create everything from quick, simple programs to complex, multi-screen applications. It is designed to make doing the simple tasks very quick and to take much of the pain out of writing larger applications.
There is a very wide variety of default widgets - everything from simple text fields to more complex tree and grid views.
The focus of this library has always been to provide a rapid way to develop console applications. In general adding a control to the screen requires only one line of code.
Version 2.0pre88 introduces the ability of Forms to resize themselves when the terminal size changes. Previous versions had always assumed a fixed-sized terminal.
Current development is done on Python 3, but the code is kept compatible with modern releases of Python 2. Certain features related to unicode work better under Python 3.
It is designed to run using only the python standard library, and the only requirements are a working python (2.4 or above) installation and a working curses library. Npyscreen will therefore work on almost all common platforms, and even in the Cygwin environment on Windows.
From version 2.0pre47 onwards all text widgets should now support utf-8 text display and entry on utf-8 capable terminals. This fixes a long-standing limitation with the library, and makes it suitable for use in projects targeting non-English-speaking users.
As of version 2.0pre48 the library aims to be robust in dealing with unicode across all widgets. There are still a few places in the system where support for utf-8/unicode needs further work. Please file bug reports if you encounter them.
You might also like to look at http://excess.org/urwid/
Compared to npyscreen, urwid is more like a traditional, event-driven gui library, and targets other display devices as well as curses.


I'm Vladimir Pak Learn more
My Skills
Proud to be a freecodecamp student
Have a foundation of markup language
Know how to impliment Cascading Style Sheet
Learning other languages such as javaScript and jQuery
Yes, please!
I'm from Brooklyn, NY
Project #1
Project #2
Project #3


Honey Bee Colonies
Released August 1, 2018, by the National Agricultural Statistics Service (NASS), Agricultural Statistics Board, United States Department of Agriculture (USDA).
|
| Page |
File Name |
Table Description |
| |
hcny_all_tables.csv |
All tables in the report |
| 4 |
hcny_p04_t005.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: January 1, 2017 and January-March 2017 |
5 |
hcny_p05_t001.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: April 1, 2017 and April-June 2017 |
6 |
hcny_p06_t007.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: July 1, 2017 and July-September 2017 |
7 |
hcny_p07_t008.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: October 1, 2017 and October-December 2017 |
8 |
hcny_p08_t011.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: January 1, 2018 and January-March 2018 |
9 |
hcny_p09_t022.csv |
Number of Colonies, Maximum, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Five or More Colonies – States and United States: April 1, 2018 and April-June 2018 |
10 |
hcny_p10_t002.csv |
Colony Health Stressors with Five or More Colonies – States and United States: January-March 2017 |
11 |
hcny_p11_t013.csv |
Colony Health Stressors with Five or More Colonies – States and United States: April-June 2017 |
12 |
hcny_p12_t009.csv |
Colony Health Stressors with Five or More Colonies – States and United States: July-September 2017 |
13 |
hcny_p13_t010.csv |
Colony Health Stressors with Five or More Colonies – States and United States: October-December 2017 |
14 |
hcny_p14_t012.csv |
Colony Health Stressors with Five or More Colonies – States and United States: January-March 2018 |
15 |
hcny_p15_t023.csv |
Colony Health Stressors with Five or More Colonies – States and United States: April-June 2018 |
16 |
hcny_p16a_t003.csv |
Colonies Lost with Colony Collapse Disorder Symptoms with Five or More Colonies – United States: Quarterly January-December 2017 and 2018 |
16 |
hcny_p16b_t034.csv |
Number of Colonies, Lost, Percent Lost, Added, Renovated, and Percent Renovated with Inventory of Less than Five Colonies – United States: First of Quarter and Quarterly 2016 and 2017 |
17 |
hcny_p17a_t035.csv |
Colony Health Stressors with Less than Five Colonies – United States: Annual 2016 and 2017 |
17 |
hcny_p17b_t018.csv |
Colonies Lost with Colony Collapse Disorder Symptoms with Less than Five Colonies – United States: Annual 2016 and 2017 |


Form w/ disabled inputs
Email
Username
Password
Comments
Valid form?: {{ lf.form.valid }}
Submitted form?: {{ submitted }}
Email: {{ userForm.controls.email.value }}
Username: {{ userForm.controls.username.value }}
Password: {{ userForm.controls.password.value }}
Comments: {{ userForm.controls.comments.value }}


| Number of Classes | Line Coverage | Mutation Coverage |
|---|---|---|
| 11 | 99% | 98% |
| Name | Line Coverage | Mutation Coverage |
|---|---|---|
| EmbeddedTreeLineSubset3D.java | 100% |
100% |
| Line3D.java | 100% |
96% |
| LineConvexSubset3D.java | 100% |
100% |
| LineSpanningSubset3D.java | 100% |
100% |
| LineSubset3D.java | 100% |
100% |
| LinecastPoint3D.java | 100% |
87% |
| Linecastable3D.java | 100% |
100% |
| Lines3D.java | 96% |
100% |
| Ray3D.java | 100% |
100% |
| ReverseRay3D.java | 100% |
100% |
| Segment3D.java | 100% |
100% |


Sofrito
A savoury front-end base with tasty typographic, layout, performance and build ingredients.
More about the summary element
The summary element is a clickable and focusable element which can be used to show and hide the other children of the details element.


Process Coordination
Cpp
#include <atomic>
#include <iostream>
#include <thread>
#include <string>
#include <vector>
int main() {
std::string msg = "Hello, World!";
std::atomic_int index = -1;
std::vector<std::thread> threads;
for (auto i = 0; i < msg.length(); i++) {
threads.push_back(std::thread([ii = i, c = msg[i], &index]() {
while ((ii - 1) != index.load()) {
// busy wait
}
std::cout << c;
index.fetch_add(1);
}));
}
for (auto &t: threads) {
t.join();
}
}
Go
package main
import (
"fmt"
"sync"
)
func main() {
broadcastRegister := make(chan chan int, 1)
broadcastIn := make(chan int, 5)
go channelBroadcaster(broadcastRegister, broadcastIn)
var wg sync.WaitGroup
for i, c := range "Hello, World!" {
workerIn := make(chan int, 20)
broadcastRegister <- workerIn
wg.Add(1)
go coordinatedPrint(i, string(c), workerIn, broadcastIn, &wg)
}
broadcastIn <- -1
wg.Wait()
}
func channelBroadcaster(register chan chan int, in chan int) {
outs := make([]chan int, 0, 10)
for {
select {
case out := <- register:
outs = append(outs, out)
case index := <- in:
for _, out := range outs {
out <- index
}
}
}
}
func coordinatedPrint(index int, char string, in chan int,
out chan int, wg *sync.WaitGroup) {
defer wg.Done()
for {
prev_i := <- in
if (index - 1) == prev_i {
fmt.Print(char)
out <- index
break
}
}
}
What This Code Does
Given the string "Hello, World!"
each program must create as many concurrent
units (threads for C++, goroutines for Go) as there are characters. Then the threads
must coordinate (without the help of the main thread) to print out the characters in
order. The concurrent units may receive, at a minimum, the character they are responsible
for as well as the index of the character to print.
What's the Same
Both implementations use a similar approach (for the sake of comparison) to solve the problem. Each individual concurrency unit waits for the index to be one-less than the index they hold. That is to say, they are next in line to print out their character.
Also, both solutions wait, in the main function, for all concurrency units to finish their
processing. In the Go code, this is done with a sync.WaitGroup
and in the C++
code the join()
method is called on the threads.
What's Different
A LOT. Let's break it down.
The first thing to understand, before discussing code, is that the philosophies differ in the C++ and the Go community around concurrency. One of the creators of Go has been attributed with the following quote:
Don't communicate by sharing memory; share memory by communicating. — Rob Pike
To expand on this quote, in Go, it is more idiomatic to share state through the use of c)hannels. What is sent over the channels should not be shared between goroutines, that is to say data sent over channels is copied such that two goroutines do not point to the same location in memory. This share-nothing approach is a common way to avoid data-races when dealing with concurrent programming.
While these ideas are sound, they are not always typical in C++. Often, an application is written in C++ because performance is very important. When this is the case, and concurrent computation is involved, it is often the case that C++ code will share memory across threads to avoid the price in copying data.
Breaking Down Go
Because the go example aims to coordinate through message-passing, we make use of channels. Channels
can be thought of as synchronized queues. However channels do not, by default, support advanced queueing
patterns such as fan-out. Since every goroutine that is printing needs to communicate with all other
goroutines, we have to implement a simple broadcaster which will fan-out our messages for us
(channelBroadcaster
).
The use of a WaitGroup
is used to allow the main goroutine to wait for all the other
goroutines to exit. In this case, we are sharing memory by passing a pointer to the WaitGroup
to the goroutine. However, even though Go strives to avoid sharing memory, WaitGroup
comes from the Go stdlib's sync
package and is considered safe (as well as idiomatic).
Breaking Down C++
The C++ solution shares memory of the current print index by using a std::atomic_int
. Each
thread is launched via a lambda that captures the index, the current character, and a reference to the
index (references are similar to pointers in that they allow sharing of memory). Each thread performs a
busy-wait as long as the current value of the atomic integer is not what they are looking for
(index.fetch()
retrieves the current value of the int).
Once the main thread as launched all of the threads, it simply waits for all of the threads to exit by
calling join()
on the thread handles.
Some Conclusions
While sharing memory, for this particular (and contrived) example, does result in less code; the Go solution is arguably more efficient in that at no point are the goroutines spinning waiting for a message. The underlying Go scheduler is able to sleep the goroutine and wake it up when there is a message available on the channel. How does that work? Well, reading from the channel is a blocking operation, one which the Go scheduler is able to efficiently handle and not waist CPU resources waiting.


Home
Sales Insights
About Us
Contact Us
Welcome to pat's salmon cookies!
Add or Update location
location
minimum number of customer ber hour
maximum number of customer ber hour
average customers ber hour


Upcoming Events
Featured Bands: Severed Ties, Vivorum, & Hello Destroyer
Location: "The Fallout Shelter" (603 S. Broadway)
Date: 12/15
Time: 8pm-12am
About this Event: A night full of gentle strumming, good vibes, and stand up comedy. Come on out and show us what you got!!!
Location: The Jungle (304 N. Fell)
Date: 12/22
Time: 7pm-11pm


/*TempleOS has a feature that allows access to bytes and words of larger ints. See U64i union. The versions with "i" are internal data types. Use "I64" instead of "U64i" and you will have access to subbytes and subwords. Unfortunately, byte access causes the compiler to not use a reg for the variable. See ::/Demo/Lectures/FixedPoint.HC. */ I64 q=0xFEDCBA9876543210,q1; "q\t\t=%016X\n",q; q1=q.i16[2]; "q.i16[2]\t=%016X\n",q1; q1=q.u8[5]; "q.u8[5]\t\t=%016X\n",q1; q1=q.i32[1].u8[2]; "q.i32[1].u8[2]\t=%016X\n",q1; q1=q.i32[0].i8[1]; "q.i32[0].i8[1]\t=%016X\n",q1;


Dog locks owner out of car and rides in reverse circles for an hour
The owner stepped out of the car after making a wrong turn in Florida – then his pet stuck it in reverse.
A dog who got locked inside his owner’s car stuck it in reverse and rode in circles for an hour.
Police in Port St Lucie, Florida, said the owner stepped out of the car after making a wrong turn on to Edith Court.
Max, a black labrador, then accidentally put the car in reverse, causing it to circle the cul-de-sac for an hour, hitting a postbox and taking out a rubbish bin.
The owner handed police an extra car fob, but it did not work due to a dead battery, so officers opened the car by entering a code on a keypad on the driver’s side door.
Neighbour Anne Sabol said Max was in high spirits after being rescued, adding he “jumped out of the car, wagging his tail”.
Port St Lucie Police said: “No injuries were reported, and the car sustained minor damage. Max was fine, healthy and happy!”


http://action.vday.org/site/R?i=_ZS_mF7eYRHwhckX4i9iGA
http://action.vday.org/site/R?i=oSQN7PQDVb2E5CvdAMoHiA
http://action.vday.org/site/R?i=ZYQCc-bay9G2tLcqwIKjUQ
http://action.vday.org/site/R?i=EvMmmH7fZ0JiOat86nih6g
Two Weeks Until We RISE!
Can you feel it? Flashmobs, Marches, Zumba, Rallies, Dance Actions,
Sit-ins, Strikes - ONE BILLION people will rise and the earth is
already starting to shake!
http://action.vday.org/site/R?i=e72-bzWFrMkCrbhrjaZfpA
Are you ready? Don’t forget to:
Add your Rising to the Map
http://action.vday.org/site/R?i=Q6-QnGtyEOMDozpMLdZ0gA
Check out the Toolkit
http://action.vday.org/site/R?i=w5wxxyr9YmsVw7NPDnNOrw
Download the videos and music
http://action.vday.org/site/R?i=RMen3iKwJDyZVZV42V6KuA
GOOD READS by The Guardian & Jane Fonda!
Check out this latest piece in The Guardian on ONE BILLION RISING by
Jane Martinson, and V-Day Board member Jane Fonda’s inspiring article
on
One Billion Rising: ‘It’s like a feminist tsunami’ (The Guardian) >
http://action.vday.org/site/R?i=WyE5i99OjqRqndqWlJC-ew
ONE BILLION RISING by Jane Fonda >
http://action.vday.org/site/R?i=8TJubr-SMifoV_J5y_ufSA
WATCH: “I Am Rising…: Anoushka Shankar”
Anoushka Shankar is a renowned musician and composer. She recorded
this personal and poignant message from her home in London and we hope
you all will watch it!
http://action.vday.org/site/R?i=UQBF1Q1hOuchEknrjIkKCw
WATCH Anoushka Shankar’s “I Am Rising…”
video here >
http://action.vday.org/site/R?i=2ba0FXhudS_-cqfXFXqtsA
Want to share why YOU are rising?

* On Monday, February 4th there will be a ONE BILLION RISING
kick-off celebration in London: V-Day Board member Thandie
Newton will be performing alongside Eve Ensler and Grammy
nominated World Music artist Anoushka Shankar in “LONDON RISING”
at Cafe De Paris, Leicester Square London 8pm.
FIND out more & get tickets here >
http://action.vday.org/site/R?i=4mt8N5bbNxyfgw-2kvSMVA
* Argentinian Heavy Metal Guitarist Mario Ian is RISING!
CHECK out his TV Spot >
http://action.vday.org/site/R?i=iCNvfoVkuGMyEnPTTNC3Ig
* San Francisco Mayor Edwin M. Lee is RISING! Mayor Lee will join
District Attorney George Gascón, Board of Supervisors
President David Chiu, V-Day Executive Director Susan Celia Swan,
Commission on the
Status of Women President Julie Soo, and Filipina Women’s
Network
President Marily Mondejar at City Hall!
CHECK it out at
OneBillionRisingSF.org >
http://action.vday.org/site/R?i=5SktwHWQmtu_zusCz4dbWQ
* Bhutan is RISING!
WATCH them rehearse >
http://action.vday.org/site/R?i=o3DaxgG73ngyibM0BrYEJQ
* V-Day has partnered with Zumba Fitness! The global multimedia
fitness leader and creator of the acclaimed Zumba®
dance-fitness party is joining V-Day for a very special ONE
BILLION RISING event in downtown Los Angeles at LA Live’s Nokia
Plaza. This electrifying party, will get Los Angeles rising and
dancing with special guests including V-Day Board Member,
activist, and Academy Award winner Jane Fonda, Academy Award
winner Kathy Bates, and celebrity Zumba Instructor Gina Grant.
FIND out more here >
http://action.vday.org/site/R?i=SSNFyPQ93qf3P_roRUWCQw
* Breman organizers have created this great new video to highlight
their activities on 14 February! “"One Billion Rising” Aktion
auf dem Bremer Marktplatz am 14.02.13 von 16.00 - 17.00 Uhr. 1
Milliarde steht auf und tanzt gegen Gewalt an Frauen fuer
Wertschaetzung und Selbstbestimmung. Organisation Bremen: Edda
Lorna und Prisca Samani. Filmemacher: Hacky Hackbarth.“
WATCH here >
http://action.vday.org/site/R?i=OqXFrLSthiKKl3MerhtQ_g
* Maya Azucena, Morley, DJ Beverly Bond, Suheir Hammad, Rosie
Perez and more will take part in RISE NYC! This NYC finale
celebration will take place at the Hammerstein Ballroom in
Manhattan, where Eve Ensler performed The Vagina Monologues and
launched a global movement on Valentine’s Day 15 years ago. The
free party will be a celebration of the rising all across the
world.
FIND out more & get tickets here >
http://action.vday.org/site/R?i=sYfi-HRdkE1kvResV6AOPA
* Toronto City Councillor Kristyn Wong-Tam is RISING! "Over 50% of
Canadian women by the age of 16 will have experienced at least
one incident of sexual or physical violence. Why Would You Not
Take Action?”
WATCH her I Am Rising…“ video here >
http://action.vday.org/site/R?i=6iIa8o49c9aKfmoxvCT1Cg
* Israel organizers have created their own campaign song! Check
out these scenes from a flash-mob practice with original music
by One Billion Rising Israel!
WATCH here >
http://action.vday.org/site/R?i=3wsmiZgxTOyGjVss9X-xdg
* ONE BILLION RISING South Asia has released their New Delhi
RISING teaser.
CHECK it out here >
http://action.vday.org/site/R?i=cQxUND-u-pQVYImgth7ZMA
http://action.vday.org/site/R?i=2RUn5xgbQO_wWBXucYNm7Q
http://action.vday.org/site/R?i=-Ch0UwIVm-Ih8xZOkSsXPQ
http://action.vday.org/site/R?i=us1yXzTRMv33ng_IUXPXTQ
http://action.vday.org/site/R?i=c6Dm5iUezkjFS92l27-M0Q
http://action.vday.org/site/R?i=A-ADhCETkY1A71VtmOUNjg
unsubscribe
http://action.vday.org/site/CO?i=TAu8s8i6UFbAoRuDGS1He723cKMNaPLO&cid=1062
Powered By Convio


cymapgt\core\application\spreadsheet\SpreadsheetProcessor\SpreadsheetProcessor::addDrawingObject
function addDrawingObject() Take in a name and path for a drawing object (image), add it and attach it to a worksheet
Signature
public function addDrawingObject([string
$wSheetKey = '',
[string
$keyIsIndex = false,
[string
$objPath = '',
[string
$objName = 'imageObj']]]] )
Parameters
$wSheetKey
—
string
- This is the key of the worksheet, either associative or indexed
$keyIsIndex
—
string
- This is true if numeric key is expected, false if otherwise*
$objPath
—
string
- This is the filepath and filename to the drawing object being added
$objName
—
string
- The name of the drawing object
Returns
- mixed
- return array of object name and PHPExcel_Worksheet_Drawing object or false
| Line |
Task |
| 1582 |
USE data service to register correct location. Also see parameter default on function header |


exploreAT-conceptlights
Konzeptlichter/concept lights visually explores concepts occuring
in and across different questions
within individual questionnaires. In addition, information concept grouping within questionnaires as
well as collocation information is displayed.
Source can be found in Github.


There are over 16 million active daily users of Facebook in Nigeria! Imagine if you can reach just 1% of that market with your products and services, that is 160,000 sales of your product just from Facebook alone. Still following this example, if it cost you N5 to acquire a customer (CPA) and you make a profit of N100 on each product sale, that's an initial investment of N800,000 (N5 x 160,000) for a profit of N16,000,000 (N100 x 160,000). Now the above is just fictitious figures, but the amazing thing about the Internet is the incredibly low cost of customer acquisition, which enables a wider profit sometimes even after offering discounted sales.
If you would like to advertise online, contact us today, to review what platform will perform the most for your product. We currently run adverts on Facebook, Instagram,Twitter, LinkedIn, Google, Bing, and other Websites through Google Adwords.
Beyond Social Media page setups, postings and content management which we do in our Social Media Management service, we also run adverts on Social Media platforms, ranging from Facebook Advertising to Tweet boosting and Article exposures.
Social Media Adverts give your products and services more exposure beyond your immediate online circle of friends. So it is money well spent when it is targetted to a particular segmented by Age, Geographic location, Gender, and / or Interest.
Because SEO is organic, it usually takes between several weeks to several months for your website to start ranking on the front page of Google for the keywords you have selected. However, for immediate results across various websites, you should create an advert budget for Google Ads, this will enable you feature on Google Search Result pages, and the several thousand websites carrying Google Adsense, like Jumia and Konga does.
SEM covers Google Search Advertising and Google Banner Advertising


quickfix.field
Class SecurityTradingStatus
java.lang.Object
quickfix.Field<java.lang.Integer>
quickfix.IntField
quickfix.field.SecurityTradingStatus
- All Implemented Interfaces:
- java.io.Serializable
public class SecurityTradingStatus
- extends IntField
- See Also:
- Serialized Form
| Methods inherited from class java.lang.Object |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
FIELD
public static final int FIELD
- See Also:
- Constant Field Values
OPENING_DELAY
public static final int OPENING_DELAY
- See Also:
- Constant Field Values
TRADING_HALT
public static final int TRADING_HALT
- See Also:
- Constant Field Values
RESUME
public static final int RESUME
- See Also:
- Constant Field Values
NO_OPEN_NO_RESUME
public static final int NO_OPEN_NO_RESUME
- See Also:
- Constant Field Values
PRICE_INDICATION
public static final int PRICE_INDICATION
- See Also:
- Constant Field Values
TRADING_RANGE_INDICATION
public static final int TRADING_RANGE_INDICATION
- See Also:
- Constant Field Values
MARKET_IMBALANCE_BUY
public static final int MARKET_IMBALANCE_BUY
- See Also:
- Constant Field Values
MARKET_IMBALANCE_SELL
public static final int MARKET_IMBALANCE_SELL
- See Also:
- Constant Field Values
MARKET_ON_CLOSE_IMBALANCE_BUY
public static final int MARKET_ON_CLOSE_IMBALANCE_BUY
- See Also:
- Constant Field Values
MARKET_ON_CLOSE_IMBALANCE_SELL
public static final int MARKET_ON_CLOSE_IMBALANCE_SELL
- See Also:
- Constant Field Values
NOT_ASSIGNED
public static final int NOT_ASSIGNED
- See Also:
- Constant Field Values
NO_MARKET_IMBALANCE
public static final int NO_MARKET_IMBALANCE
- See Also:
- Constant Field Values
NO_MARKET_ON_CLOSE_IMBALANCE
public static final int NO_MARKET_ON_CLOSE_IMBALANCE
- See Also:
- Constant Field Values
ITS_PRE_OPENING
public static final int ITS_PRE_OPENING
- See Also:
- Constant Field Values
NEW_PRICE_INDICATION
public static final int NEW_PRICE_INDICATION
- See Also:
- Constant Field Values
TRADE_DISSEMINATION_TIME
public static final int TRADE_DISSEMINATION_TIME
- See Also:
- Constant Field Values
READY_TO_TRADE_START_OF_SESSION
public static final int READY_TO_TRADE_START_OF_SESSION
- See Also:
- Constant Field Values
NOT_AVAILABLE_FOR_TRADING_END_OF_SESSION
public static final int NOT_AVAILABLE_FOR_TRADING_END_OF_SESSION
- See Also:
- Constant Field Values
NOT_TRADED_ON_THIS_MARKET
public static final int NOT_TRADED_ON_THIS_MARKET
- See Also:
- Constant Field Values
UNKNOWN_OR_INVALID
public static final int UNKNOWN_OR_INVALID
- See Also:
- Constant Field Values
PRE_OPEN
public static final int PRE_OPEN
- See Also:
- Constant Field Values
OPENING_ROTATION
public static final int OPENING_ROTATION
- See Also:
- Constant Field Values
FAST_MARKET
public static final int FAST_MARKET
- See Also:
- Constant Field Values
SecurityTradingStatus
public SecurityTradingStatus()
SecurityTradingStatus
public SecurityTradingStatus(int data)


s is a spam page.
tokens
stopwords
index
postings
classification
supervised
tokens
stopwords
index
postings
classification
supervised
tokens
stopwords
index
postings
classification
supervised
tokens
stopwords
index
postings
classification
supervised


Execute custom business logic
XData has many features targeting this technology as not only ORM, but a full featured Data Access Layer. This is one of this features.
Custom logic defined as public property of XDataLogic<T> class descendant with type of CustomLogic<T>.
public class InvoiceLogic : XDataLogic<Invoice>
{
public CustomLogic<Invoice> TestCustomLogic => (objects => {
Log.Write(MessageType.Information,
() => $"TestCustomLogic called with {objects.Length} objects");
foreach (var invoice in objects)
{
var i = invoice;
invoice.PostData("testPost",
() => Encoding.UTF8.GetBytes(i.DocNumb));
var p = Encoding.UTF8.GetBytes(i.DocNumb);
var r = i.Callback("testCall", ref p);
Log.Write(MessageType.Information, () =>
@$"Call for \"{i.DocNumb}\" returned \"{r}\"
with data \"{(p == null ? null : Encoding.UTF8.GetString(p))}\"");
}
return true;
});
}
...
//Call example logic
var random = new Random();
return dataScope.GetRepository<Invoice>().ToArray().Execute(() => "TestCustomLogic",
"testPost".SetValue((Action<byte[]>)(data =>
Console.WriteLine("Post message received (data=\"{0}\")",
data == null ? null : Encoding.UTF8.GetString(data))))
.AsEnum().ToDictionary(),
"testCall".SetValue((Func<byte[], byte[]>)(data => {
Console.WriteLine("Call received \"{0}\")",
data == null ? null : Encoding.UTF8.GetString(data));
return random.NextDouble() >= 0.5 ? null : Encoding.UTF8.GetBytes(
$"reply for \"{(data == null ? null : Encoding.UTF8.GetString(data))}\"");
})).AsEnum().ToDictionary());
Programmer can develop data centric logic over some of mapped objects with ability to execute this logic in the middle ware layer of three-tier architecture on a dedicated server (or cluster). And this code can be simple and representable debugged in two-tier environment. Architecture can be switched by configuration! No code modification, no side effects... This feature is linked with Trigger logic and reached by Callbacks.
When code is organized using data mapping modules, data logic modules and client (or Web site) it can help programmer to keep module relations clean and get ready to changes, with no matter of middle-ware layer existence. And this rules are not dictated, You can use it or not. You can write this logic anywhere You architect to do. Nothing will be breaks, except of ability to use XData three-tier architecture. But if You really don't need it, what is wrong?


Venus is the second planet from the Sun, orbiting it every 224.7 Earth days. It has the longest rotation period (243 days) of any planet in the Solar System and rotates in the opposite direction to most other planets. It has no natural satellite. It is named after the Roman goddess of love and beauty. It is the second-brightest natural object in the night sky after the Moon.
Mean Distance from Sun(million km)
Period of Revolution
Period of Rotation at Equador
Eccentricity of Orbit
Equatorial diameter (km)
Mass
Density
Venus
108.2
224.7 d
243 d
0.007
12,104
0.82
5.2
QUICK VENUS FACTS
Venus does not have any moons or rings.
Venus is nearly as big as the Earth with a diameter of 12,104 km.
A year on Venus takes 225 Earth days.
DETAILED VENUS FACTS
A day on Venus lasts longer than a year. It takes 243 Earth days to rotate once on its axis (sidereal day). The planet’s orbit around the Sun takes 225 Earth days, compared to the Earth’s 365. A day on the surface of Venus (solar day) takes 117 Earth days.
Venus rotates in the opposite direction to most other planets. This means that Venus is rotating in the opposite direction to the Sun, this is also know as a retrograde rotation. A possible reason might be a collision in the past with an asteroid or other object that caused the planet to alter its rotational path. It also differs from most other planets in our solar system by having no natural satellites.
Venus is the second brightest object in the night sky. Only the Moon is brighter. With a magnitude of between -3.8 to -4.6 Venus is so bright it can be seen during daytime on a clear day.
Atmospheric pressure on Venus is 92 times greater than the Earth’s. While its size and mass are similar to Earth, the small asteroids are crushed when entering its atmosphere, meaning no small craters lie on the surface of the planet. The pressure felt by a human on the surface would be equivalent to that experienced deep beneath the sea on Earth.
Venus is often called the Earth’s sister planet. The Earth and Venus are very similar in size with only a 638 km difference in diameter, Venus having 81.5% of the Earth’s mass. Both also have a central core, a molten mantle and a crust.
Venus is the hottest planet in our solar system. The average surface temperature is 462 °C, and because Venus does not tilt on its axis, there is no seasonal variation. The dense atmosphere of around 96.5 percent carbon dioxide traps heat and causes a greenhouse effect.
The Russians sent the first mission to Venus. The Venera 1 space probe was launched in 1961, but lost contact with base. The USA also lost their first probe to Venus, Mariner 1, although Mariner 2 was able to take measurements of the planet in 1962. The Soviet Union’s Venera 3 was the first man-made craft to land on Venus in 1966.
At one point it was thought Venus might be a tropical paradise. The dense clouds of sulphuric acid surrounding Venus make it impossible to view its surface from outside its atmosphere. It was only when radio mapping was developed in the 1960s that scientists were able to observe and measure the extreme temperatures and hostile environment. It is thought Venus did once have oceans but these evaporated as the planets temperature increased.


You can read and write to files using the chrome.fileSystem API
This example allows you to select an image and show it in a modal window.
Custom context menu's can be created with the chrome.contextMenu API
Right click anywhere to see the context menu
Add a new context menu item:
Create notifications with the webkitNotifications API. Not a packaged app API, but still fun.
Getting video into a sandbox requires the use of a post message. You can get the stream in the extension and then sending it down frame by frame into the sanbox over postMessages.
You can use the chrome tts (text to speech) engine to say typed text using the chrome.tts API.
The chrome.idle API allows you to query the system to know if the user has gone idle for an amount of time that you specify, when they are active again, and if the machine has been locked.


👋 Hello [Cambridge_Parent]:
Imagine your [6-ish year old] received a letter out of the blue asking for help with a Missing Cat mystery?
What if your child saw a LOST CAT poster on the street near their house with THE VERY SAME Cat on it?
What if you [Cambridge_Parent] then received a text message to be read to your [6-ish year old] that was from the "Missing" Cat. And it said the Cat was not not was not missing at all, but actually.....
Hey Friends. We (Doyung & Jeff) are experimenting with a very local story/game for kids. We want to create an imaginary world for your child.
We'd put up signs in Cambridge, send some good old-fashion mail, and send 3-4 timely text messages to the collaborating caregiver to add plot points along the way.
These are immersive off-screen immersive stories. Our first prototype will last 5 days, is bound to the Cambridge, MA, and requires a smart phone and a mailing address.


|
UIST 2016 Lasting Impact Award
Jefferson Y. Han for Low-Cost Multi-Touch Sensing through Frustrated Total Internal Reflection published in UIST 2005.
UIST 2015 Lasting Impact Award
Saul Greenberg and Chester Fitchett for
Phidgets: Easy Development of Physical Interfaces through Physical Widgets,
published in UIST 2001.
UIST 2014 Lasting Impact Award
Per-Ola Kristensson and Shumin Zhai for
SHARK2: a large vocabulary shorthand writing system for pen-based computers,
published in UIST 2004.
UIST 2013 Lasting Impact Award
Jun Rekimoto and Katashi Nagao for
The World through the Computer:
Computer Augmented Interaction with Real World Environments,
published in UIST 1995.
UIST 2012 Lasting Impact Award
Paul H. Dietz and Darren Leigh for
Diamond Touch: A Multi-User Touch Technology, UIST 2001.
UIST 2011 Lasting Impact Award
Ken Hinckley, Jeff Pierce, Mike Sinclair, Eric Horvitz,
Sensing Techniques for Mobile Interaction, UIST 2000.
UIST 2010 Lasting Impact Award
Steven Feiner, Blair MacIntyre, Marcus Haupt, Eliot Solomon,
Windows on the world: 2D windows for 3D augmented reality, UIST 1993.
UIST 2009 Lasting Impact Award
Brygg Ullmer and Hiroshi Ishii for
The metaDESK: models and prototypes for tangible user interfaces, UIST 1997.
UIST 2008 Lasting Impact Award
Randy Pausch for his contributions to UIST, in particular for
SUIT: The Pascal of User Interface Toolkits,
by Randy Pausch, Nathaniel R. Young II, Robert DeLine (University of Virginia),
published in UIST 1991.
UIST 2007 Lasting Impact Award
Barry Arons for
SpeechSkimmer: Interactively Skimming Recorded Speech, published in UIST 1993.
UIST 2006 Lasting Impact Award
Ramana Rao, Stuart Card, Herbert Jellinek, Jock Mackinlay, and George Robertson for
The information grid: a framework for information retrieval and
retrieval-centered applications,
published in UIST 1992.
UIST 2005 Lasting Impact Award
Gord Kurtenbach and Bill Buxton, for
Issues in Combining Marking and Direct Manipulation Techniques,
published in UIST 1991.
UIST 2004 Lasting Impact Award
Bay-Wei Chang for his work on animation in user interfaces, in particular for
Animation: from cartoons to the user interface,
published in UIST 1993.
UIST 2003 Lasting Impact Award
Pierre Wellner for his early work on DigitalDesk, in particular for
The DigitalDesk calculator: tangible manipulation on a desk top display,
published in UIST 1991.
UIST'16 best paper award
Mathieu Le Goc, Lawrence H Kim, Ali Parsaei, Jean-Daniel Fekete, Pierre Dragicevic, Sean Follmer:
"Zooids: Building Blocks for Swarm User Interfaces"
UIST'16 best paper award
Artem Dementyev, Hsin-Liu (Cindy) Kao, Inrak Choi, Deborah Ajilo, Maggie Xu, Joseph A. Paradiso, Chris Schmandt, Sean Follmer:
"Rovables: Miniature On-Body Robots as Mobile Wearables"
UIST'16 best paper award
Gierad Laput, Robert Xiao, Chris Harrison:
"ViBand: High-Fidelity Bio-Acoustic Sensing Using Commodity Smartwatch Accelerometers"
UIST'16 best paper award
Joanne Leong, Patrick Parzer, Florian Perteneder, Teo Babic, Christian Rendl, Anita Vogl, Hubert Egger, Alex Olwal, Michael Haller:
"proCover: Sensory Augmentation of Prosthetic Limbs Using Smart Textile Covers"
UIST'15 best paper award
Simon Olberding (Max Planck Institute for Informatics),
Sergio Soto Ortega (Max Planck Institute for Informatics),
Klaus Hildebrandt (Max Planck Institute for Informatics),
Jurgen Steimle (Max Planck Institute for Informatics):
"Foldio: Digital Fabrication of Interactive and Shape-Changing Objects With Foldable Printed Electronics"
UIST'15 best paper award
Augusto Esteves (Lancaster University),
Eduardo Velloso (Lancaster University),
Andreas Bulling (Max Planck Institute for Informatics),
Hans Gellersen (Lancaster University):
"Orbits: Gaze Interaction for Smart Watches using Smooth Pursuit Eye Movements"
UIST'15 best paper award
Clemens Klokmose (Aarhus University),
James Eagan (Télécom ParisTech, CNRS),
Siemen Baader (Aarhus University),
Wendy Mackay (INRIA, Université Paris-Sud),
Michel Beaudouin-Lafon (Université Paris-Sud, CNRS):
"Webstrates: Shareable Dynamic Media"
UIST'14 best paper award
Ken Hinckley (Microsoft Research),
Michel Pahud (Microsoft Research),
Hrvoje Benko (Microsoft Research),
Pourang Irani (Microsoft Research, University of Manitoba),
Marcel Gavriliu (Microsoft Research),
François Guimbretière (Microsoft Research, Cornell University),
Xiang 'Anthony' Chen (Microsoft Research),
Fabrice Matulic (Microsoft Research),
William Buxton (Microsoft Research),
Andrew Wilson (Microsoft Research):
"Sensing Techniques for Tablet+Stylus Interaction"
UIST'14 best paper award
Daniela Retelny Stanford University,
Sébastien Robaszkiewicz Stanford University,
Alexandra To Stanford University,
Walter Lasecki (University of Rochester),
Jay Patel Stanford University,
Negar Rahmati Stanford University,
Tulsee Doshi Stanford University,
Melissa Valentine Stanford University,
Michael Bernstein Stanford University:
"Expert Crowdsourcing with Flash Teams"
UIST'14 best paper award
Simon Olberding, Michael Wessely, Jürgen Steimle (Max Planck Institute for Informatics, Saarland University):
"PrintScreen: Fabricating Highly Customizable Thin-film Touch-Displays"
UIST'13 best paper award
Christian Holz, Patrick Baudisch
(Hasso Platner Institute, Germany):
"Fiberio: A Touchscreen that Senses Fingerprints"
UIST'13 best paper award
Lining Yao, Ryuma Niiyama, Jifei Ou, Sean Follmer, Clark Della Silva, Hiroshi Ishii
(MIT Media Lab): "PneUI: Pneumatically Actuated Soft Composite Materials for Shape Changing Interfaces"
UIST'13 best paper award
Makoto Ono, Buntarou Shizuki, Jiro Tanaka (University of Tsukuba):
"Touch & Activate: Adding Interactivity to Existing Objects using Active Acoustic Sensing"
UIST'12 best paper award
Neel Joshi (Microsoft Research),
Sisil Mehta (Georgia Institute of Technology),
Eric Stollnitz (Microsoft Research),
Steven Drucker (Microsoft Research),
Hugues Hoppe (Microsoft Research),
Matt Uyttendaele (Microsoft Research),
Michael Cohen (Microsoft Research):
"Cliplets: Juxtaposing Still and Dynamic Imagery"
UIST'12 best paper award
Jeffrey Rzeszotarski (Carnegie Mellon University),
Aniket Kittur (Carnegie Mellon University):
"CrowdScape: Interactively visualizing crowd behavior and output"
UIST'12 best paper award
Sean Follmer (MIT Media Lab,
Daniel Leithinger (MIT Media Lab,
Alex Olwal (MIT Media Lab),
Nadia Cheng (MIT Media Lab),
Hiroshi Ishii (MIT Media Lab):
"Jamming User Interfaces: Programmable Particle Stiffness and Sensing for Malleable and Shape-Changing Devices"
UIST'11
best paper award
Karl D.D. Willis (Carnegie
Mellon University, Disney Research Pittsburgh),
Ivan Poupyrev (Disney
Research Pittsburgh), Scott E
Hudson (Carnegie Mellon
University), Moshe Mahler (Disney
Research Pittsburgh):
"SideBySide: Ad-hoc Multi-user Interaction with Handheld Projectors"
UIST'11
notable paper award
James Eagan, Michel
Beaudouin-Lafon, Wendy Mackay (INRIA,
LRI, Univ. Paris-Sud & CNRS):
"Cracking the Cocoa Nut: User Interface Programming at Runtime"
UIST'11
notable paper award
Manolis Savva (Stanford
University), Nicholas Kong (University
of California, Berkeley), Arti
Chhajta (Stanford University),
Li Fei-Fei (Stanford
University), Maneesh Agrawala (University
of California, Berkeley),
Jeffrey Heer (Stanford
University): "ReVision: Automated Classification, Analysis and Redesign
of Chart Images"
UIST'11
notable paper award
Raphael Wimmer (University
of Munich), Patrick Baudisch (Hasso
Plattner Institute): "Modular
and Deformable Touch-Sensitive Surfaces Based on Time Domain
Reflectometry"
UIST'10
best paper award
Jeffrey Bigham (University of
Rochester), Chandrika Jayant (University
of Washington), Hanjie Ji (University
of Rochester), Greg Little (MIT
CSAIL), Andrew Miller (University
of Central Florida), Robert C.
Miller (MIT CSAIL),
Robin Miller (University of
Rochester), Aubrey Tatarowicz (MIT
CSAIL), Brandyn White (University
of Maryland), Samuel White (University
of Rochester), Tom Yeh,
University of Maryland: "VizWiz: Nearly Real-Time Answers to Visual
Questions"
UIST'09
best student paper award
Michael S. Bernstein
(MIT CSAIL),
Greg Little (MIT CSAIL),
Robert C. Miller (MIT CSAIL),
Bjoern Hartmann UC Berkeley,
Mark S. Ackerman University
of Michigan, David R. Karger (MIT
CSAIL), David Crowell (MIT
CSAIL), Katrina Panovich (MIT
CSAIL): "Soylent: A Word
Processor with a Crowd Inside"
UIST'09
best paper award
Nicolas Villar, Shahram Izadi, Dan Rosenfeld, Hrvoje Benko, John
Helmes, Jonathan Westhues, Steve Hodges, Eyal Ofek, Alex Butler, Xiang
Cao, Billy Chen (Microsoft
Research Cambridge & Redmond, Microsoft Corp):
"Mouse 2.0: Multi-touch meets the Mouse"
UIST'09
best student paper award
Tom Yeh,
Tsung-Hsiang Chang, Robert C. Miller (MIT
CSAIL): "Sikuli:
Using GUI Screenshots for Search and Automation"
UIST'08
best paper award
Andrew Wilson, Shahram Izadi, Otmar Hilliges, Armando Garcia-Mendoza,
David Kirk: "Bringing Physics to the Surface"
UIST'08
best student paper award
Björn Hartmann, Loren Yu, Abel Allison, Yeonsoo Yang, Scott
Klemmer (Stanford University):
"Design As Exploration: Creating Interface Alternatives through
Parallel Authoring and Runtime Tuning "
UIST'07
best paper award
Steve Hodges, Shahram Izadi, Alex Butler, Alban Rrustemi, Bill Buxton:
"ThinSight: Versatile Multi-touch Sensing for Thin Form-factor Displays"
UIST
'06 best paper award
Björn
Hartmann, Scott Klemmer, Michael Bernstein, Leith Abdulla, Brandon
Burr, Avi Robinson-Mosher, and Jennifer Gee for their paper Reflective
Physical Prototyping through Integrated Design, Test, and Analysis
UIST
'06 best student paper award
Anastasia Bezeranios, Pierre Dragicevic, and Ravin Balakrishnan for
their paper Mnemonic
Rendering: An Image-Based Approach for Exposing Hidden Changes in
Dynamic Displays
UIST'05
best paper award:
Michael Bolin,
Matthew Webber, Philip Rha, Tom Wilson, Robert Miller: Automation and
Customization of Rendered Web Pages
UIST
'04 best paper awards:
Georg Apitz
& François Guimbretière (University of
Maryland): CrossY: A Crossing-Based Drawing Application
Tovi Grossman, Daniel Wigdor, Ravin Balakrishnan (University of
Toronto): Multi-Finger Gestural Interaction with 3D Volumetric Displays
UIST '03 best paper award:
Eric Saund, David
Fleet, Daniel Larner, James Mahoney (Palo Alto Research Center):
"Perceptually-Supported Image Editing of Text and Graphics"
UIST
'03 best student paper:
Bongwon Suh, Haibin
Ling, Ben Bederson, and David Jacobs (University of Maryland):
"Automatic Thumbnail Cropping and its Effectiveness"
UIST
'02 best paper award:
Takeo Igarashi
(University of Tokyo) & John F. Hughes (Brown University)
"Clothing Manipulation "
UIST
'02 best student paper:
Haowei Hsieh, Frank
Shipman (Texas A&M University): "Manipulating Structured
Information in a Visual Workspace,"
UIST '01 best paper award:
Saul Greenberg and
Chester Fitchett (University of Calgary): "Phidgets: Easy Development
of Physical Interfaces through Physical Widgets"
UIST '01 best
student paper
Blaine Bell,
Steven Feiner and Tobias Hoellerer (Columbia University): "View
Management for Virtual and Augmented Reality"
UIST '00 best paper award
Ken Hinckley, Jeff
Pierce, Mike Sinclair, and Eric Horvitz (Microsoft Research): "Sensing
Techniques for Mobile Interaction"
UIST '96: best
paper award
Alan Borning,
Richard Anderson, and Bjorn Freeman-Benson (University of Washington):
"Indigo: A Local Propagation Algorithm for Inequality Constraints"
UIST'16 People’s Choice Best Talk winners
Chiuan Wang, Hsuan-Ming Yeh, Bryan Wang, Te-Yen Wu, Hsin-Ruey Tsai, Rong-Hao Liang, Yi-Ping Hung, Mike Y. Chen
for
"CircuitStack: Supporting Rapid Prototyping and Evolution of Electronic Circuits"
Gierad Laput, Robert Xiao, Chris Harrison
for
"ViBand: High-Fidelity Bio-Acoustic Sensing Using Commodity Smartwatch Accelerometers"
UIST'15 People’s Choice Best Talk winner
Gierad Laput (Carnegie Mellon University) for "EM-Sense: Touch Recognition of Uninstrumented, Electrical and Electromechanical Objects"
UIST'14 People’s Choice Best Talk winner
Yuta Sugiura (Keio University) for "Graffiti fur: turning your carpet into a computer display",
UIST'14 People’s Choice Best Talk winner
James McCrae (University of Toronto) for "FlatFitFab: Interactive Modeling with Planar Sections"
UIST'14 People’s Choice Best Talk winner
Rubaiat Habib Kazi (Autodesk Research) for "Kitty: sketching dynamic and interactive illustrations".
UIST '16
Takeo Kanade (CMU)
Naoto Fukasawa (NAOTO FUKASAWA DESIGN)
UIST '15 Ramesh Raskar (MIT) Blaise Aguera y Arcas(Google)
UIST
'14 Mark Bolas (USC) Bret Victor (worrydream.com)
UIST '13 Raffaello D'Andrea (ETH Zurich)
UIST '12
Margaret Livingstone (Harvard)
UIST '11
Ge Wang (Stanford)
Dan Jurafsky (Stanford)
UIST
'10
Marvin Minsky (MIT)
Natalie Jeremijenko (NYU)
Jaron Lanier
UIST
'09
Stephen L. Macknik and Susana Martinez-Conde (Barrow Neurological
Institute)
Eric Paulos (CMU)
UIST
'08
Dan Olsen (BYU)
Cynthia Breazeal (MIT)
UIST
'07
David Woods Measuring
How Design Changes Cognition at Work
Jeremy Wolfe Capturing
the user's attention: Insights from the study of human vision
UIST
'06
Computing Versus Human Thinking Peter Naur (University of Copenhagen)
UIST
'05
Personal Computing in the 21st Century, Gary Starkweather
UIST
'04:
Mary Czerwinski
(Microsoft Research): Theory-driven design in HCI (slides)
UIST '03:
Ben Shneiderman
(University of Maryland): Creative Support Tools: A grand Challenge for
Interface Designers
Sandra Marshall (UC San Diego): New Techniques for Evaluating
Innovative Interfaces for Eye-tracking
UIST
'02:
Peter Wegner
(Brown University): Models of Interactive Computation
Jakub Wejchert (European Commission): The Disappearing Computer
Tony R. Martinez (Brigham Young University): Introduction to Machine
Learning and Neural Networks
UIST '01:
Jef Raskin: Making
Machines Fit for Human Consumption
Miguel Nicolelis (Duke University): Building Brain-machine Interfaces
to Restore Neurological Functions
UIST '00:
Eric Brewer
(Berkeley): User Interfaces in the Infrastructure Age
James D. Foley (Yamacraw): Economic Development--The New University
Imperative
UIST '99:
Seth Rosenthal
(Industrial Light + Magic): Motion Capture for Feature Films:
Challenges in Using Actors as Input for Digital Character Animation
Turner Whitted (Microsoft Research): Technologies for Computing Off the
Desktop
UIST '98:
Jim Waldo (Sun
Microsystems): The Jini Approach to Distributed Computing
Adele Goldberg (Neometron): Storytelling, Ping Pong, and Improvisation
UIST '97:
John Sibert
(George Washington University): Banff to Banff: A UISTful Restrospective
Jim Kajiya (Microsoft Research): Flows in the Convergence of Television
and Computing
UIST '96:
James Gosling
(SUN): Java: a Language Driven by a UI Vision
Fred Brooks (UNC Chapel Hill): 3-D User Interfaces: When Results Matter
UIST '95:
Maria Klawe
(University of British Columbia): Is Edutainment an Oxymoron?
Jim Morris (Carnegie Mellon University): Effective User Interfaces
Bill Buxton (Alias Research): Proximal Sensing: Supporting Context
Sensitive Interaction
UIST
'94
Don Norman (Apple
Computer): Trends in the Computer Industry: Life-Long Subscriptions,
Magical Cures, and Profits Along the Information Highway
Mark Weiser (Xerox PARC): Creating the Invisible Interface
UIST '93:
Terry Winograd
(Stanford University and Interval Research): From Virtual Reality to
Real Virtualities: Designing the Worlds In Which We Live
Bruce Tognazzini (SunSoft): CyberSpace in the New Millennium
UIST '92:
Raj Reddy
(Carnegie Mellon): User Interfaces in GigaPC Environments
Tony Hoeber (GO Corporation): Bringing the Computer into the World
UIST
'91:
Robert S. Williges
(Virginia Tech): Software Interfaces for Users with Special Needs
Andries van Dam (Brown University): Escaping Flatland
UIST
'90:
Stuart Card (Xerox
PARC): Information Workspaces
Elaine Rich (MCC AI Lab): Natural Language for Natural Access to Text
Data Bases
UIST '89:
Jim Thomas
(Battelle Pacific Northwest Laboratories)
Jaron Lanier (VPL Research)
ACM
UIST Father of UIST Award
2007
Presented to Dan R. Olsen Jr.
|


This page contains an index of all the surnames in the database. Selecting a link will lead to a list of individuals in the database with this same surname.
This page contains an index of all the surnames in the database. Selecting a link will lead to a list of individuals in the database with this same surname.


We are currently working on our new website. Subscribe to be notified and to get a sneak peak at what we are working on.


In 1962, when Uganda gained independence, the population was a mere 7 million people. By the beginning of the new millenium, the population had more than trippled to 23 million. Today, 16 years later, the population has grown to 39 Million.
Where does population go from here?


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD |
java.lang.Object java.lang.Enum<JProtocol> org.jnetpcap.protocol.JProtocol
public enum JProtocol
Enum table of core protocols supported by jNetPcap. Various constants are provided by this class and utility methods for working with protocol IDs, Bitmasks and Maps.
In the beginning with few network protocols defined and needed to be quickly identified, a single 64-bit usigned integer was big enough to encode presence of a protocol via bit encoding. However once that pool of usable bits began to be exhausted it was necessary to implement fast lookup using a better algorithm.
Since version 1.4, JProtocol class expanded the concept of protocol IDs.
Protocol ids are used to efficiently store information about the protocol
they identify. The ID of a protocol is used as a lookup in various tables
maintained by JRegistry
and native state structures. This provides
extremely performance.
One may think of an ID as a global array index, that is assumed to be within a certain range by all structures and objects in jNetPcap that can quickly lookup information based on that particular "ID".
However IDs are not suitable for bitmask type operations. The native structures in jNetPcap keep a running tally of which protocols are present in a packet by setting certain bits, with a 1 to 1 correspondence to a given protocol. The bitmasks are encoded in a special way to allow more then 64 protocols while still maintaining uniqueness for all protocols. As a matter of fact, the current encoding scheme can encode and represent up to 128 billion protocols without conflict. Here is a diagram of a 64-bit bitmask with its 2x32-bit fields.
[32-bit map-index][32-bit bitmask (1 bit per protocol)]Where map-index represents a group of protocols, and each bit in a bitmask corresponds to a protocol. The above encoding allows every single protocol to be recorded in a fast lookup bitmask without the possibility of a conflicts as long as each protocol is assigned a unique ID. IDs are easily convertible to bitmasks and visa versa.
In essence, numerical IDs are divided into 32-bit id groups. Then a bit can set for each protocol dissected within its own group. Most core protocols are defined within the first group (group 0), but not all.
There is however a restriction. The state structure keeps an array of
bitmasks and each protocol is mapped to a particular map-index. You can
combine any protocol map or ID into a single multi-bit bitmask as long as
each protocol being combined belongs to the same group. If there are 2
protocols in 2 different groups, then they can not be combined bitwise, and
one has to make to checks to see if each protocol is present. To make sure
that only compatible masks and ids are combined, 2 methods are provided
createMaskFromIds(int...)
and createMaskFromMasks(long...)
.
| Nested Class Summary | |
|---|---|
static interface |
JProtocol.Suite
A protocol suite. |
| Enum Constant Summary | |
|---|---|
ARP
Address Resolution Protocol. |
|
ETHERNET
DIX Ethernet2 header. |
|
HTML
Hyper Text Markup Language header. |
|
HTTP
Hyper Text Transmission Protocol header. |
|
ICMP
Internet Control Message Protocol header. |
|
IEEE_802DOT1Q
IEEE VLAN tag header. |
|
IEEE_802DOT2
IEEE LLC2 header. |
|
IEEE_802DOT3
IEEE 802.3 header type |
|
IEEE_SNAP
IEEE SNAP header. |
|
IP4
Ip version 4 header. |
|
IP6
Ip version 6 header. |
|
L2TP
Layer 2 tunneling protocol header. |
|
NULL_HEADER
NullHeader - loopback/null header |
|
PAYLOAD
Builtin header type that encapsulates the portion of the packet buffer not matched by any protocol header. |
|
PPP
Point to Point Protocol header. |
|
RTCP_APP
APP: Application-Defined RTCP Packet |
|
RTCP_BYE
BYE: Goodbye RTCP Packet |
|
RTCP_RECEIVER_REPORT
RR: Receiver Report RTCP Packet |
|
RTCP_SDES
SDES: Source Description RTCP Packet |
|
RTCP_SENDER_REPORT
SR: Sender Report RTCP Packet |
|
RTP
Realtime Transfer Protocol. |
|
SCTP
Stream Control Transport Protocol |
|
SCTP_ABORT
SCTP Abort Chunk |
|
SCTP_COOKIE
SCTP Cookie Echo/State Cookie Chunk |
|
SCTP_COOKIE_ACK
SCTP Cookie Acknowledgment Chunk |
|
SCTP_CWR
SCTP Congestion Window Reduced Chunk |
|
SCTP_DATA
SCTP Data Chunk |
|
SCTP_ECNE
SCTP Explicit Congestion Notification Echo Chunk |
|
SCTP_ERROR
SCTP Error Chunk |
|
SCTP_HEARTBEAT
SCTP Heartbeat Request Chunk |
|
SCTP_HEARTBEAT_ACK
SCTP Heartbeat Acknowledgment Chunk |
|
SCTP_INIT
SCTP Init Chunk |
|
SCTP_INIT_ACK
SCTP Init Acknowledgment Chunk |
|
SCTP_SACK
SCTP Selective Acknowledgement Chunk |
|
SCTP_SHUTDOWN
SCTP Shutdown Chunk |
|
SCTP_SHUTDOWN_ACK
SCTP Shutdown Acknowledgment Chunk |
|
SCTP_SHUTDOWN_COMPLETE
SCTP Shutdown Complete Chunk |
|
SDP
Session Data Protocol. |
|
SIP
Session Intiation Protocol. |
|
SLL
Linux cooked sockets. |
|
TCP
TCP/IP header. |
|
UDP
UDP/IP header. |
|
WEB_IMAGE
An Image header transmitted via http. |
| Field Summary | |
|---|---|
static int |
ARP_ID
The Constant ARP_ID. |
static int |
BITMAP_GROUP0
MAP GROUP 0 |
static int |
BITMAP_GROUP1
BITMAP GROUP 1 |
static int |
BITMAP_GROUP2
BITMAP GROUP 2 |
static long |
BITMASK_GROUP_MASK
Bitmask to mask off the "group bits" portion. |
static long |
BITMASK_PROTCOL_MASK
Bitmask to mask off the "protocol bits" portion. |
static int |
ETHERNET_ID
The Constant ETHERNET_ID. |
static int |
HTML_ID
The Constant HTML_ID. |
static int |
HTTP_ID
The Constant HTTP_ID. |
static int |
ICMP_ID
The Constant ICMP_ID. |
static int |
IEEE_802DOT1Q_ID
The Constant IEEE_802DOT1Q_ID. |
static int |
IEEE_802DOT2_ID
The Constant IEEE_802DOT2_ID. |
static int |
IEEE_802DOT3_ID
The Constant IEEE_802DOT3_ID. |
static int |
IEEE_SNAP_ID
The Constant IEEE_SNAP_ID. |
static int |
IP4_ID
The Constant IP4_ID. |
static int |
IP6_ID
The Constant IP6_ID. |
static int |
L2TP_ID
The Constant L2TP_ID. |
static int |
LAST_ID
The Constant LAST_ID. |
static int |
NULL_HEADER_ID
NullHeader - loopback/null header |
static int |
PAYLOAD_ID
The Constant PAYLOAD_ID. |
static int |
PPP_ID
The Constant PPP_ID. |
static int |
RTCP_APP_ID
APP: Application-Defined RTCP Packet |
static int |
RTCP_BYE_ID
BYE: Goodbye RTCP Packet |
static int |
RTCP_RECEIVER_REPORT_ID
RR: Receiver Report RTCP Packet |
static int |
RTCP_SDES_ID
SDES: Source Description RTCP Packet |
static int |
RTCP_SENDER_REPORT_ID
SR: Sender Report RTCP Packet |
static int |
RTP_ID
The Constant RTP_ID. |
static int |
SCTP_ABORT_ID
The Constant SCTP_ABORT_ID. |
static int |
SCTP_COOKIE_ACK_ID
The Constant SCTP_COOKIE_ACK_ID. |
static int |
SCTP_COOKIE_ID
The Constant SCTP_COOKIE_ID. |
static int |
SCTP_CWR_ID
The Constant SCTP_CWR_ID. |
static int |
SCTP_DATA_ID
The Constant SCTP_DATA_ID. |
static int |
SCTP_ECNE_ID
The Constant SCTP_ECNE_ID. |
static int |
SCTP_ERROR_ID
The Constant SCTP_ERROR_ID. |
static int |
SCTP_HEARTBEAT_ACK_ID
The Constant SCTP_HEARTBEAT_ID. |
static int |
SCTP_HEARTBEAT_ID
The Constant SCTP_HEARTBEAT_ID. |
static int |
SCTP_ID
The Constant SCTP_ID. |
static int |
SCTP_INIT_ACK_ID
The Constant SCTP_INIT_ACK_ID. |
static int |
SCTP_INIT_ID
The Constant SCTP_INIT_ID. |
static int |
SCTP_SACK_ID
The Constant SCTP_SACK_ID. |
static int |
SCTP_SHUTDOWN_ACK_ID
The Constant SCTP_SHUTDOWN_ACK_ID. |
static int |
SCTP_SHUTDOWN_COMPLETE_ID
The Constant SCTP_SHUTDOWN_COMPLETE_ID. |
static int |
SCTP_SHUTDOWN_ID
The Constant SCTP_SHUTDOWN_ID. |
static int |
SDP_ID
The Constant SDP_ID. |
static int |
SIP_ID
The Constant SIP_ID. |
static int |
SLL_ID
The Constant SLL_ID. |
static int |
TCP_ID
The Constant TCP_ID. |
static int |
UDP_ID
The Constant UDP_ID. |
static int |
WEB_IMAGE_ID
The Constant WEB_IMAGE_ID. |
| Method Summary | |
|---|---|
static int |
createId(int map,
int index)
Given a packet header bitmask, creates a numerical ID that can be used for array lookups |
static long |
createMaskFromIds(int... ids)
Safely combines multiple MASKS into a single mask suitable for OR with header-map-bitmasks. |
static long |
createMaskFromMasks(long... masks)
Safely combines multiple MASKS into a single mask suitable for OR with header-map-bitmasks. |
static long |
createMaskFromProtocols(JProtocol... protocols)
Safely combines multiple MASKS into a single mask suitable for OR with header-map-bitmasks. |
long |
getBitmask()
|
java.lang.Class<? extends JHeader> |
getClazz()
Gets the main class for the network header of this protocol. |
PcapDLT[] |
getDlt()
Gets the corresponding Pcap defined Data Link Type. |
int |
getGroup()
|
java.lang.Class<? extends JHeader> |
getHeaderClass()
Gets the header class. |
java.lang.String |
getHeaderClassName()
Gets the header class name. |
int |
getId()
Gets a unique runtime numerica ID of this protocol assigned by jNetStream. |
static int |
idToGroup(int id)
Gets the map-group index to which the given ID should be mapped |
static long |
idToMask(int index)
Encodes a linear protocol index (a JRegistry index), into a bitmask based ID. |
static boolean |
isCoreProtocol(java.lang.Class<? extends JHeader> c)
Checks the supplied header by class if its is one of jNetPcap's core protocol set. |
static boolean |
isCoreProtocol(int id)
Checks the supplied ID if its is one of jNetPcap's core protocol set. |
static int |
maskToGroup(long mask)
Gets the map-group index from a bitmask |
static int |
maskToId(long mask)
Converts a mask to a numerical ID |
static JProtocol |
valueOf(java.lang.Class<? extends JHeader> c)
Converts a protocol header to a JPRotocol constant. |
static JProtocol |
valueOf(int id)
Converts a protocol header to a JPRotocol constant. |
static JProtocol |
valueOf(Pcap pcap)
Gets the numerical ID of the data link header for the open pcap handle. |
static JProtocol |
valueOf(PcapDLT dlt)
Gets the numerical ID of the data link header for supplied pcap dlt constant. |
static JProtocol |
valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name. |
static JProtocol[] |
values()
Returns an array containing the constants of this enum type, in the order they are declared. |
| Methods inherited from class java.lang.Enum |
|---|
clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Enum Constant Detail |
|---|
public static final JProtocol PAYLOAD
public static final JProtocol ETHERNET
public static final JProtocol IP4
public static final JProtocol IP6
public static final JProtocol TCP
public static final JProtocol UDP
public static final JProtocol IEEE_802DOT3
public static final JProtocol IEEE_802DOT2
public static final JProtocol IEEE_SNAP
public static final JProtocol IEEE_802DOT1Q
public static final JProtocol L2TP
public static final JProtocol PPP
public static final JProtocol ICMP
public static final JProtocol HTTP
public static final JProtocol HTML
public static final JProtocol WEB_IMAGE
public static final JProtocol ARP
public static final JProtocol SIP
public static final JProtocol SDP
public static final JProtocol RTP
public static final JProtocol SLL
public static final JProtocol SCTP
public static final JProtocol SCTP_DATA
public static final JProtocol SCTP_INIT
public static final JProtocol SCTP_INIT_ACK
public static final JProtocol SCTP_SACK
public static final JProtocol SCTP_HEARTBEAT
public static final JProtocol SCTP_HEARTBEAT_ACK
public static final JProtocol SCTP_ABORT
public static final JProtocol SCTP_SHUTDOWN
public static final JProtocol SCTP_SHUTDOWN_ACK
public static final JProtocol SCTP_ERROR
public static final JProtocol SCTP_COOKIE
public static final JProtocol SCTP_COOKIE_ACK
public static final JProtocol SCTP_ECNE
public static final JProtocol SCTP_CWR
public static final JProtocol SCTP_SHUTDOWN_COMPLETE
public static final JProtocol NULL_HEADER
public static final JProtocol RTCP_SENDER_REPORT
public static final JProtocol RTCP_RECEIVER_REPORT
public static final JProtocol RTCP_SDES
public static final JProtocol RTCP_BYE
public static final JProtocol RTCP_APP
| Field Detail |
|---|
public static final long BITMASK_PROTCOL_MASK
public static final long BITMASK_GROUP_MASK
public static final int BITMAP_GROUP0
public static final int PAYLOAD_ID
public static final int ETHERNET_ID
public static final int IP4_ID
public static final int IP6_ID
public static final int TCP_ID
public static final int UDP_ID
public static final int IEEE_802DOT3_ID
public static final int IEEE_802DOT2_ID
public static final int IEEE_SNAP_ID
public static final int IEEE_802DOT1Q_ID
public static final int L2TP_ID
public static final int PPP_ID
public static final int ICMP_ID
public static final int HTTP_ID
public static final int HTML_ID
public static final int WEB_IMAGE_ID
public static final int ARP_ID
public static final int SIP_ID
public static final int SDP_ID
public static final int SLL_ID
public static final int NULL_HEADER_ID
public static final int BITMAP_GROUP1
public static final int SCTP_ID
public static final int SCTP_DATA_ID
public static final int SCTP_INIT_ID
public static final int SCTP_INIT_ACK_ID
public static final int SCTP_SACK_ID
public static final int SCTP_HEARTBEAT_ID
public static final int SCTP_HEARTBEAT_ACK_ID
public static final int SCTP_ABORT_ID
public static final int SCTP_SHUTDOWN_ID
public static final int SCTP_SHUTDOWN_ACK_ID
public static final int SCTP_ERROR_ID
public static final int SCTP_COOKIE_ID
public static final int SCTP_COOKIE_ACK_ID
public static final int SCTP_ECNE_ID
public static final int SCTP_CWR_ID
public static final int SCTP_SHUTDOWN_COMPLETE_ID
public static final int RTP_ID
public static final int RTCP_SENDER_REPORT_ID
public static final int RTCP_RECEIVER_REPORT_ID
public static final int RTCP_SDES_ID
public static final int RTCP_BYE_ID
public static final int RTCP_APP_ID
public static final int BITMAP_GROUP2
public static final int LAST_ID
| Method Detail |
|---|
public static JProtocol[] values()
for (JProtocol c : JProtocol.values()) System.out.println(c);
public static JProtocol valueOf(java.lang.String name)
name
- the name of the enum constant to be returned.
java.lang.IllegalArgumentException
- if this enum type has no constant
with the specified name
java.lang.NullPointerException
- if the argument is nullpublic java.lang.Class<? extends JHeader> getHeaderClass()
public java.lang.String getHeaderClassName()
public static boolean isCoreProtocol(int id)
id
- numerical ID of the header as assigned by JRegistry
public static boolean isCoreProtocol(java.lang.Class<? extends JHeader> c)
c
- class name of the header to check
public static JProtocol valueOf(java.lang.Class<? extends JHeader> c)
c
- header class to convert
public static JProtocol valueOf(int id)
id
- numerical ID of the header assigned by JRegistry
public static JProtocol valueOf(Pcap pcap)
pcap
- open Pcap handle
public static JProtocol valueOf(PcapDLT dlt)
dlt
- pcap dlt constant
public PcapDLT[] getDlt()
public int getId()
public long getBitmask()
public int getGroup()
public final java.lang.Class<? extends JHeader> getClazz()
public static long idToMask(int index)
index
- zero based linear JRegistry protocol index (table index).
Allowed values are from 0 to 1024.
public static final int createId(int map, int index)
map
- map group to create the ID forindex
- zero based index within the group (0 to 31)
public static final int maskToGroup(long mask)
mask
- mask to extra map-group index
public static final int idToGroup(int id)
id
- id to use from map-group index calculation
public static int maskToId(long mask)
mask
- mask containing a single protocol bit encoded
public static long createMaskFromMasks(long... masks)
masks
- masks to combine
public static long createMaskFromProtocols(JProtocol... protocols)
protocols
- protocols to combine
public static long createMaskFromIds(int... ids)
masks
- masks to combine
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD |


To develop a web app and chrome extension that converts an inputted URL to a humourous Shakespeare quote that can be shared with others.
We felt that most of the existing URL shorteners create URLs that are hard to memorize. They were also not intuitive to use and weren't quick enough to generate a URL on the go.
We developed a web application and chrome extension based on a local webserver using flask (programmed in Python). We connected a database of of 50 funny Shakespeare quotes and designed the front end in HTML, CSS, Javascript and JQuery. The chrome extension serves the purpose of speeding up the process of generating a custom URL.
We developed a web application and chrome extension based on a local webserver using flask (programmed in Python). We connected a database of of 50 funny Shakespeare quotes and designed the front end in HTML, CSS, Javascript and JQuery. The chrome extension serves the purpose of speeding up the process of generating a custom URL.
The team wanted to create a tool none of us had ever experienced making before. We all agreed that making a Google Chrome extension would be a fun project to do, despite not knowing what it would entail. The function of our extension is simple and fun: after being downloaded to a browser, the user can click on the little Shakespeare icon and find their current browser tab URL embedded within an input field in the pop-up window. Through methods described below, by submitting the form the URL is then extended into an Shakespeare quote.


Firefighters study carcinogen exposure
FAIRFAX COUNTY, Va. (AP) - Firefighters in Virginia are taking part in a study aimed at finding ways to reduce their exposure to carcinogens.
WTOP-FM reports that the Fairfax County Fire and Rescue Department is partnering with the National Fire Protection Association Research Foundation on a four-phase study. Part of the focus of the study will be on how chemicals can cling to breathing equipment used by firefighters.
Firefighters are exposed to toxic chemicals released into the air by burning buildings and vehicles. According to a National Institute for Occupational Safety and Health study, firefighters are twice as likely to get skin and testicular cancer and mesothelioma.
Information from: WTOP-FM, http://www.wtop.com
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


Copyright 2006 by The BioBike Team (contact<EMAIL_ADDRESS>So, what is a function?
A function is just a little piece of code that does a little thing.
The plus sign (+) is a function that adds things together and returns the result:
Well, pretty close, actually, but it's really a way of thinking that
we're talking about, not just what you do, precisely.
Huh?
Okay, let's start with something simple. Suppose that you had a whole
series of numbers that you wanted to do the same thing to each one.
Here are some numbers:
Lisp has a special function for applying the same function to every
element in a list (and returning a list of the results, which is what
we're after). Let's see it in action first, and then examine how we
use it:
So, you mean, we could have given mapcar any function?
That's right -- any function that expects just one argument. Let's try
some others:
Now, maybe that doesn't seem too weird to you, in which case either
you're not paying attention, or you may already have reached The Zen
of Lisp -- true enlightenment.... (I'm guessing the former! :-)
So, let's look at some other meta-functions:
Another common meta-function is SORT. Sort takes a list, and ... well,
sorts them. (Duh!) Sort needs to know how to sort them --
low-to-high, or high-to-low, so one of its arguments is the
function that compares two numbers, and tells sort which way to
arrange them.
Watch (and notice the #' use!):
Yes, we (or, rather, the designers of Lisp) could very easily have
done that, but let's take a slightly more complex case. Suppose that
we have a set of genes... Let's get a small set just to play with:
One way to do this might be to use mapcar to get the sequences, and
then mapcar again to get the length of the sequences, like this:
Then we could use this function to sort the list of genes, just like we did above:
Think about it for a minute, and then come back....
Figured out a way to do it yet? Maybe so, but I'll bet it's not as simple as this:
This time we gave SORT two functions. The first one was the way
to sort (by #'> -- that is, so that the largest things are first). The
second function is indicated by the optional argument :KEY. :KEY tells
sort what function to use on each element in the list in order to
get the value that will be used to sort. That is, we told sort to
take each gene, get it's sequence length (using our function GENELEN)
and then sort the genes based upon the #'> function applied to those
values (i.e., the gene lengths).
The :KEY argument to sort is very useful! Let's say, for
example for some weird reason you want to alphebetize the genes by
their sequence:
One thing that you might well ask is: Do I have to create my functions
separately, and then pass the names to mapcar and sort all the time,
like we did with pi-times and genelen? What if I just want to do a
one-time-only complex calculation, and apply that?
There are a number of answers to this, some simple and some
complex. (The simplest answer is: You can always do it by creating a
separate function, so if you don't get what's about to come next,
don't worry too much.)
There is a way to create what are called "anonymous functions"
-- that is, functions that don't have names -- that are just created
for one-time use. The way that you do this is by using a special lisp
function called LAMBDA. (Don't worry about why it's
called lambda -- that's a very long and mostly irrelevant story.) Just
like #' makes functions, lambda makes functions too, but lambda
doesn't need the name of the function -- it can just make a function
in place!
Let's revisit some of our examples using LAMBDA instead of having to
create functions.
Here's how you might do PI-TIMES without having to create a separate
function:
(By the way, sometimes you'll see lambda without #' It turns out that
you don't need to use #' if you have lambda, but we do it as a
convention, and it makes it easier to see where the functions are in
reading through the code.)
Cool! So, see, you don't need to create a function every time you need
to do something fancy, just rev one up on the fly, using Lambda!
Why (you might well ask) would I want to write my own meta
function?!
Good question. There are lots of situations where this is extremely
useful. A common example is where you want to write a function that
operates on frames. Recall from previous lessons that the slots in
frames are accessed by accessors, like #^genes, or #^organism. These
are functions, which is why you can write:
Basically what we want to do is:
Given this, we can translate the above code to make it a little more
specific:
Examples using our new function (pay careful attention to when we use
#'... when #^... (only on slot accessors!) and when we need
#'(lambda...)):
Copyright 2006 by The BioBike Team (contact<EMAIL_ADDRESS>Introduction: What is a function?
This lesson discusses the concept of "functions" in Lisp. This is
probably the hardest, and most important lesson in the whole
series. If you study it carefully, and understand it, you will be on
the path toward true enlightenment (at least as far as programming
goes....)
>> (+ 3 4)
:: 7
Of course, you can create your own functions too:
>> (defun pi-times (n) (* n 3.14159))
:: PI-TIMES
>> (pi-times 2.71828)
:: 8.5397215
Okay, that wasn't so hard! Is that all there is to enlightenment?
Functions are First Class!
Functions in Lisp have a sort of life of their own. In computer
jargon, they are called "first class objects", which means that in
addition to using them, like we did just above when we used the +
function, or creating new ones like pi-times, you can
manipulate functions -- pass them around, apply them to things
under program control, and even create new functions in the middle of
running programs!
>> (setf my-numbers '(1 3 5 7 9))
Now, suppose that you wanted to do pi-times to each one of them. One
way to do it would be to write a loop and call pi-times over and over,
like this:
>> (loop for n in my-numbers
>> collect (pi-times n))
:: (3.14159 9.42477 15.707951 21.99113 28.274311)
Or, you could write a recursive function that did the same thing (sort
of like the factorial function from another lesson, only it collects
up the results):
>> (defun pi-times-all (list)
>> (cond ((null list) nil)
>> (t (cons (pi-times (first list))
>> (pi-times-all (rest list))))))
>> (pi-times-all my-numbers)
:: (3.14159 9.42477 15.707951 21.99113 28.274311)
The point is that you want to take some function, in this case pi-times
and apply it over and over to every number in my-list.
>> (mapcar #'pi-times my-numbers)
:: (3.14159 9.42477 15.707951 21.99113 28.274311)
All that mapcar does is the exact same thing that either the
collecting loop or the recursive function did above, but notice that
there's a weird new piece of syntax: #' (called "pound quote"). #' is
a function constructor -- it takes whatever is after it, and gets the
function associated with it. If you do #'pi-times separately, you'll
get this weird-looking thing:
>> #'pi-times
:: #<Function PI-TIMES>
Now, let's think about what that MAPCAR did up there, because if you
think about a little, it did something pretty amazing -- we gave it an
arbitrary function (pi-times, in this case), and it applied that
function to every element in the list. Think about that for a
moment.... A function that takes a function and applies it.
>> (mapcar #'- my-numbers)
:: (-1 -3 -5 -7 -9)
>> (mapcar #'sqrt my-numbers)
:: (1.0 1.7320508 2.236068 2.6457512 3.0)
>> (mapcar #'list my-numbers)
:: ((1) (3) (5) (7) (9))
>> (mapcar #'oddp my-numbers)
:: (T T T T T)
;;; [ODDP returns true (T) if the number it's given is odd.]
Meta-Functions do things with other functions!
So, mapcar is a sort of "meta-function" -- it's a function that takes
another function, applies it to every element in a list, and returns a
new list of the results of the applications.
>> (sort '(1 3 2 4 3 5 4 6) #'>)
:: (6 5 4 4 3 3 2 1)
>> (sort '(1 3 2 4 3 5 4 6) #'<)
:: (1 2 3 3 4 4 5 6)
;;; Here's a good one:
>> (sort '("jeff" "sue" "dave" "andy" "walt") #'string> )
:: ("walt" "sue" "jeff" "dave" "andy")
>> (sort '("jeff" "sue" "dave" "andy" "walt") #'string< )
:: ("andy" "dave" "jeff" "sue" "walt")
You probably don't really see why we need this; can't sort just figure
out that what it's sorting is a set of numbers, and use > or <, or
that it's sorting a set of strings and use string> or string< ....
couldn't sort just "do the right thing"? Why couldn't we just have a
sort-up and a sort-down that just "do the right thing"?
>> (setf genes (first-n 5 (#^genes s6803)))
:: (#$S6803.slr0612 #$S6803.slr0613 #$S6803.sll0558 #$S6803.sll1214
#$S6803.sll1213)
If you examine these, you'll see that they have many properties, like
a "From" and "To" property that indicates where they are in the
genome, and a property that tells us how many transmembrane spans
there are, and many other properties. Also, there are all kinds of
functions that you can apply to genes, for example to get their
sequence:
>> (extract-sequence (first genes))
:: "TTGATTGCGTTGAATAAAACTCCCCAAACCATTGTTTTTTACAAA..."
Let's say that we wanted to sort these genes (or all genes) by
some weird property, like, say, the sequence length.
>> (mapcar #'extract-sequence genes)
::
("TTGATTGCGTTGAATAAAACTCC..."
"ATGTCCTATCTAATCGCTGTGGT..."
"ATGTCTGATAATTTGACCGAACT..."
"ATGGTTAATACCCTCGAAAAGCC..."
"ATGCTTTCCCTAGAAAATCAACG...")
>> (mapcar #'length *)
:: (693<PHONE_NUMBER> 939)
;;; Which, of course, is just the same as:
>> (mapcar #'length (mapcar #'extract-sequence genes))
:: (693<PHONE_NUMBER> 939)
A slightly nicer way to do that is to make a function that gets the
length of a gene sequence:
>> (defun genelen (gene) (length (extract-sequence gene)))
And mapcar that:
>> (mapcar #'genelen genes)
:: (693<PHONE_NUMBER> 939)
(Not only is this nicer, but it's more efficient because it doesn't
have to run down the list twice!)
>> (sort * #'>)
:: (1077 939 702 693 522)
...Hmmmm...Okay, but wait a minute... how are we going to get back to
the genes themselves -- we don't know how sort rearranged
them.... This is going to be a bit of a problem.
>> (sort genes #'> :key #'genelen)
:: (#$S6803.sll1214 #$S6803.sll1213 #$S6803.sll0558 #$S6803.slr0612
#$S6803.slr0613)
[It's right, you can check it out from the above lengths, if you like.]
I can hear you thinking: WHOA!
Lambda creates anonymous functions
So that's the first step along the path to Lisp Nirvana. Now let's
take the second step.
>> (mapcar #'(lambda (n) (* 3.14159 n)) my-numbers)
:: (3.14159 9.42477 15.707951 21.99113 28.274311)
Notice the anonymous Lambda function:
(mapcar #'(lambda (n) (* 3.14159 n)) my-numbers)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
And here's our gene length sort, but without having to create the
genelen function:
>> (sort genes #'> :key #'(lambda (gene) (length (extract-sequence gene))))
:: (#$S6803.sll1214 #$S6803.sll1213 #$S6803.sll0558 #$S6803.slr0612
#$S6803.slr0613)
"Lambda functions" (i.e., anonymous functions) look exactly
like normal functions, but the don't have names. They have some other
useful properties that we'll see in a moment.
Writing your own meta-functions
Above we used the meta-functions MAPCAR and SORT. There are lots of
built-in meta-functions, but you can also write your own; that is,
write a function that takes another function as an argument, like
MAPCAR takes a function to map over the argument, and SORT takes a
sorting function and a key function.
>> (#^genes s6803)
:: ...long list of genes...
Let's say that we wanted to write a function (here just in the sense
of DEFUN'ing it) that operates on an arbitrary slot of a
frame. Suppose, for example, that selected genes based on some
calculated property, say the length, or the GC v. AT ratio, or some
such thing. We saw an example of that above when we sorted by length
(using SORT and passing in a lambda function that computed the length
of the sequence).
(loop for gene in list-of-genes
when (THE-GIVEN-TEST gene)
collect gene)
When a function is executed, we say that the function is
applied to its arguments. For example, when you do: (+ 1 2) and
get 3, the #'+ function is applied to a list of two arguments: 1 and 2
(or, in list form: '(1 2)). Another way to say this is that the
function #'+ is called with its two arguments. Unsurprisingly,
Lisp has functions that do both of these things, called APPLY and FUNCALL:
>> (+ 1 2)
:: 3
>> (apply #'+ '(1 2))
:: 3
>> (funcall #'+ 1 2)
:: 3
Which one you use (APPLY or FUNCALL) depends on whether you have all
the arguments, or you have a list of arguments, but generally speaking
it doesn't matter -- whichever one is convenient.
(loop for gene in list-of-genes
when (funcall THE-GIVEN-TEST gene)
collect gene)
And so here's our function:
>> (defun get-genes (organism test)
>> (loop for gene in (#^genes organism)
>> when (funcall test gene)
>> collect gene))
Note that the argument TEST will be given either a #'... or #'(lambda
...) form, just like we did with SORT or MAPCAR, and that function
will be expected to accept just one argument, run the test, and return
T or NIL. (Recall that anything but NIL counts the same as T.)
;;; Find the genes in Synechococcus pcc. 6803 that start at a position
;;; greater than 3.5M nt into the genome.
>> (get-genes s6803
>> #'(lambda (gene)
>> (> (#^from gene) 3500000)))
:: ...a long list of genes...
;;; (Check these by inspecing the FROM slots of a few of them!)
;;; (Actually, this is a little silly because these genomes are
;;; circular, so position is a little arbitrary.)
;;; Create a function that computes the GC/AT content of the nt
;;; sequence of a gene:
>> (defun gc/at (gene)
>> (let* ((sequence (extract-sequence gene)))
>> (/ (count #\C sequence)
>> (1+ (count #\A sequence)))))
;;; (The 1+ protects against division by zero.)
;;; Now use it to find genes with abnormally high (much greater than 1.0)
;;; or low (much less than 1.0) gc/at content:
>> (get-genes s6803
>> #'(lambda (gene)
>> (< (gc/at gene) 0.25)))
:: ... list of genes ...
;;; Inspect these genes. See anything interesting about them?
Notice a pattern in the above: We have a function that does a
calculation on a gene, and then we use either > or < and a value to
compare. This suggests that we can simplify our function as follows:
>> (defun get-genes-2 (organism calcfn comparefn limit)
>> (loop for gene in (#^genes organism)
>> as value = (funcall calcfn gene)
>> when (funcall comparefn value limit)
>> collect gene))
;;; Now we can do the same thing more simply:
>> (get-genes-2 s6803 #^from #'> 3500000)
>> (get-genes-2 s6803 #'gc/at #'< 0.25)
So, we've written our own meta-functions! Now what? Well, we'll see
meta functions used over and over throughout these lessons... At least
now you'll know what you're looking at, even if you don't ever
actually write your own.


We take students and high schoolers, like you, and we connect them to NGOs and organisations who post opportunities with us.
Simple as that. Create an account with us now to start off.
Alternatively, if you want to help out, drop a message here.
We are constantly on the look out for new opportunities and if you are in a position to help us expand our opportunities, register below to post any openings at your organisation.
Alternatively, if you aren't sure if high school students are capable enough to intern, leave us your contact details and we will get in touch.
Kunal Mishra contributed extensively to the front-end design of this website. Most pages were made possible due to his tenacity. His ability of finding innovative workarounds contribute to the team's strength. For Kunal, WorkTeen is a portal to help his fellow classmates, most of whom are still pondering ideas for their CAS project. His capacity at WorkTeen involves maintaining and upgrading the user experience.
An IBDP year 2 student, Aayush thought of WorkTeen after he completed his CAS requirements and sat down to reflect upon his experience. He then developed and designed the website with the other co-founders. When he isn’t making any changes to the code or prototyping new features, Aayush dabbles in the design of promotional content, write new posts for the WorkTeen Blog or seek new opportunities to put up
Yathannsh is an IBDP year 1 student, who can be identified as the Chief Technology Head of the website. Frustrated seeing his seniors start non-profits impaired with morals and reasons just for IB CAS hours made him passionate about WorkTeen's cause. His significant experience in multiple web technologies contributes towards enhancing the user experience and building new features. He also heads WorkTeen's operations in Jaipur.
Abhijoy is an IBDP year 2 student, who can be identified as the head of communications and business at WorkTeen. His eye for design and knowledge gained as a student of Visual Art has been useful in defining many elements of the user interface. His role includes contacting various corporates to find internship opportunities and at the same time, expanding WorkTeen’s reach by utilising his extensive social circle.
The blog is a collection of the founders' musings on feature updates, the entrepreneurial journey and occassionally, social commentary. It also features guest entries by students who write about their experience at an internship undertaken through WorkTeen.
Read up to see what's new, and for updates to the WorkTeen story.


home
/
Tech & Products
/
about
/
Trouble Shooting
/
Services
/
Datasheets
Die Plates
Knife Holders
Die Adapters
Knives
[ X ]
TCT
[ X ]
HPG
[ X ]
API
[ X ]
ACE
[ X ]
DOR
[ X ]
BMS
[ X ]
SMX


In today’s busy schedule everyone is short on time. There is a need for a reliable person who can manage our daily activities and help us to lead a simple and easy life. This need made me and my team comprising of Akshay, Suhas and Suhas to come up with a smart and versatile robot which could fill this void. And thus, this project titled 'Design and development of smart robots to serve as personal assistants' and codenamed 'Mr. Robot' was born. What started as my final year engineering thesis project in 2015, I believe today has grown much bigger than that.
Diving into technicalities, we set out to build a robot which is versatile in nature and whose capabilities can be increased with time. On the hardware side, we made use of an SBC named Odroid XU4 to act as brain supported closely by an Arduino Mega. We incorporated sensors such as Microsoft Kinect, IR, ultrasonic sensors etc to help robot gain knowledge of the external world. Mobility for the robot was provided using differential drive system powered by two high torque motors. The robot also has an arm for manipulation. On the software side, the whole architecture was based on ROS.
Speaking about robot's capabilities, the robot could move autonomously, pick and place objects and also interact with humans through an intelligent interactive voice system. Check out the playlist below to get a small glimpse of some of the capabilities of Mr. Robot.
Last but not the least, I am grateful for the support provided by my professors especially Dr. T N Nagabhushan for this project and also to our sponsor Microsoft.


Producer, director Marks dies; helmed ‘Perry Mason’ episodes
LOS ANGELES (AP) - Longtime producer and director Arthur Marks, who helmed many episodes of the “Perry Mason” TV series and produced several hit blaxpoitation films, has died. He was 92.
Marks died Nov. 13 at his home in Woodland Hills, California, his son Paul said Saturday.
Arthur Marks’ grandparents and parents worked in the film business, and he grew up in it.
Marks was the director and producer of 80 episodes of “Perry Mason.”
He made several films aimed at black audiences in the 1970s. They include “Detroit 9000,” which was re-released in theaters in 1998 by Quentin Tarantino, and two films starring actress Pam Grier: “Friday Foster” and “Bucktown.”
Marks said his main goal was to make “a film that will damn well entertain for 120 minutes … with excitement, passion and a heart-moving story.”
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


| Industrial Explanation | Computer Science Explanation |
|---|---|
|
If you have some functions that you want to get called whenever your data changes, you should use Propagate-JS. It helps you to avoid manually setting up callbacks When you use it, your views update automatically when your models do. Check out this demo/tutorial. |
Propagate-JS performs a call stack trace to compute the transitive closure over the data dependency graph. It is reactive programming for the browser. The primary goal is to implement Incremental Computing in JavaScript without external dependencies. |
API | Demos |
|
propagate() is a new global. Call propagate with a function and it returns a tracing version of that function. You must call the returned function at least once for tracing to begin. It will be called again whenever any of its traced dependencies change. Call propagate with any other argument (data, ie: string, number, etc) and it returns a setter-accessor. Call the accessor with no arguments to retrieve the latest value; call it with a single argument to set the value (and implicitly re-evaluate all traced functions that depend on this value.) |
The demos happen to use jQuery to manipulate the DOM, but it is not required to use Propagate-JS. The Shopping Cart is a simple example, extremely well documented. Reading through the code presented at the bottom is a great first step in learning about Propagate-JS Colors is a more complex example. shows integration with a jQuery plugin that performs color calculation |
Related Work
- Knockout JS, Backbone JS, SproutCore, Objective-J, Flex
- Desktop: WPF, Spreadsheets.
Copyright (c) 2010 Aaron Blohowiak


GenerateMetadata¶
-
class
utils.metadata.
GenerateMetadata
(fname, instr, instr_cfg=None)¶ Bases:
object
Class for generating and storing relevant metadata for each file
- Parameters
Attributes Summary
Name of FITS file
Instrument name
Instrument specific configuration object
Dictionary used to store relevant metadata
Full path to corresponding telemetry file for
fname
Methods Summary
Parse the FITS header and retrieve important keywords
get_observatory_info
([time_delta])Compute the lat/lon and altitude of HST.
Parse the WCS information to determine the telescope pointing
Attributes Documentation
-
fname
¶ Name of FITS file
-
instr
¶ Instrument name
-
instr_cfg
¶ Instrument specific configuration object
-
metadata
¶ Dictionary used to store relevant metadata
Methods Documentation
-
get_image_data
()¶ Parse the FITS header and retrieve important keywords
This will store the following keywords:
date-obs
expstart
expend
exptime
flashdur
(if it exists)time-obs
date-obs
andtime-obs
are combined into a single string in ISO format (YYYY-MM-DD HH:MM:SS).exptime
andflashdur
are combined with thereadout_time
of the detector to compute the total integration time.
-
get_observatory_info
(time_delta=None)¶ Compute the lat/lon and altitude of HST.
Using the expstart and expend, generate a series MJD dates that correspond to 1 minute intervals. Calculate the lat/lon and altitude at each time step.
-
get_wcs_info
()¶ Parse the WCS information to determine the telescope pointing
This method will record all of the WCS information stored in the header.


Let me look at your key there. Nope, it's wrong.  Check your spellings and try again. If it's not your fault, you can blame your browser (especially if it's of the IE persuasion). If that doesn't work, I have a corner right here for you to cry in.
If you feel offended or think that this shouldn't be an error, ">shoot us a love letter and let us know you saw this.


Recorded with ♥ by mrmrs. The site is built with nkd and tachyons.
If you like this project, you might also like Vimgifs


--- layout: page title: About permalink: /about/ description: Missy is a nationally certified and state licensed Occupational Therapist, Certified Driving Rehab Specialist, and Driving Instructor.. ---
Missy is a nationally certified and state licensed Occupational Therapist, Certified Driving Rehab Specialist, and Driving Instructor.
With over 25 years of experience working with diverse populations across the lifespan, most of her focus has been on supporting and empowering persons/families dealing with invisible differences. Her primary goal is helping those who are underserved by healthcare and educational system limitations.
Missy's OT Driving Rehabilitation experience began in 2001 at North Kansas City Hospital. There she completed clinical evaluation and potential to drive assessments with adults due to age-related or disability factors including Diabetes, Stroke, Dementia, Alzheimer’s, Brain Injury, Amputation, and Orthopedic challenges.
In 2002, Missy began pediatric practice emphasis. She opened a specialty pediatric OT clinic with educational support services in 2013. At that time, she created a driving readiness therapy program for teens.
She quickly expanded service scope to include young drivers. Due to a shortage of driving rehab specialists, Missy recognized the need to serve more adults. She began additional training and mentorship in the field related to current standards and practices in driver rehabilitation.
Missy has trained Region XIII OTs in their role with teen driving safety. She has written a safe driving blog for DriveItHome.org and was invited to speak at the National Transportation and Highway Safety Conference of 2017.
She is an ADED member, CDRS, AOTA listed driving rehab provider, and Carfit OT technician.
Missy is AOTA educated in the highest level of Community Mobility and Driving with adults and adolescents. She has completed advanced OT/DRS training by Adaptive Mobility Services, the professional training called "Behind the Wheel with ADHD", and UFL online course work. Missy promotes safe driving across the field through various volunteer roles.


Project Title
One Paragraph of project description goes here
Getting Started
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
Prerequisites
What things you need to install the software and how to install them
Give examples
Installing
A step by step series of examples that tell you have to get a development env running
Say what the step will be
Give the example
And repeat
until finished
End with an example of getting some data out of the system or using it for a little demo
Running the tests
Explain how to run the automated tests for this system
Break down into end to end tests
Explain what these tests test and why
Give an example
And coding style tests
Explain what these tests test and why
Give an example
Deployment
Add additional notes about how to deploy this on a live system
Built With
- Dropwizard - The web framework used
- Maven - Dependency Management
- ROME - Used to generate RSS Feeds
Contributing
Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests to us.
Versioning
We use SemVer for versioning. For the versions available, see the tags on this repository.
Authors
- Billie Thompson - Initial work - PurpleBooth
See also the list of contributors who participated in this project.
License
This project is licensed under the MIT License - see the LICENSE.md file for details
Acknowledgments
- Hat tip to anyone who’s code was used
- Inspiration
- etc


{% extends "base.html" %} {% block content %} {{ params["heading"] }} Name: Class: All {% for i in range(12) %} {{"Class "+(i+1)|string}} {% endfor %} Section: All Section A Section B Section C Section D Science Commerce Humanities Registration ID: Month: All Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec Advanced Pay Status: All Paid Not Paid Search Update Sl. No. Name Class Section Reg ID Paid Date Nothing to show {% endblock %}


Assembly
| Type | Summary |
|---|---|
| ApplicationContextOptions | Application context configuration options. |
| ClientOptions | Models configuration options for OpenIdConnect clients. |
| CryptographyOptions | Cryptography configuration options. |
| DiagnosticsOptions | Represents a diagnostics sub-system configuration. |
| Error | Generic error model. |
| ErrorCollection | A collection of Errors. |
| FormatterOptions | Formatter configuration options. |
| FormatterOptionsCollection | A collection of FormatterOptions. |
| KeyValueOption | A Key/Value option that allows any extended setting options. |
| KeyValueOptionCollection | A collection of KeyValueOptions. |
| LogLevel | Defines the level of log entries. |
| LogTargetOptions | Log target configuration. |
| LogTargetOptionsCollection | A collection of LogTargetOptions. |
| Settings | Models a settings file. |
| StatusMessage | StatusMessage is the model for showing messages to the user. |
| StatusMessageType | Define the type of status messages. |
| TraceTargetOptions | Trace target configuration. |
| TraceTargetOptionsCollection | A collection of TraceTargetOptions. |
In this document


This is index
routing maps
/ -> index.html
/support -> support.html
/about -> about.html
otherwise -> RouteNotFound.html


Based in Chicago. I love playing tennis and loud music.
I'm a happy person that loves cats and climbing on mountains.
I get my inspiration from nature and objects around me. I have a passion to colors,typography and skateboards.
Based in Chicago. I love playing tennis and loud music.