The ENDFlib library of DeCE is written in an objective oriented manner, which provide an easy access to the ENDF-6 format files. There are three important classes defined in endflib.h. The first class is Record that is used for the HEAD and CONT records defined in ENDF-6. The second one is the main ENDF class, in which numerical data in a specific MT/MT section are stored. The last one is the dictionary class, ENDFDict. The dictionary class is used for controlling individual section in the ENDF-6 file to be processed, making a new dictionary section, and overall information of the file.
A record in ENDF-6 is a card image that has six data fields - two floating point data and four integers. Following ENDF-6 definition, DeCE defines this data structure as:
class Record{ public: double c1; double c2; int l1; int l2; int n1; int n2; };
The record-type data are used for the HEAD line in each MF/MT section, or the CONT (control) line that precedes a data block. Note that one data block may contain more than one CONT, depending on the MT/MT data structure.
All the member variables in the Record class are defined as public, and they will be zero-initialized by a constructor when no data are provided.
There is a member function setRecord() that set all six variables at one time.
void setRecord(double a, double b, int c, int d, int e, int f){ c1 = a; c2 = b; l1 = c; l2 = d; n1 = e; n2 = f; }
This class is to store entire data in one MF/MT section, so that each MF/MT section in DeCE is represented by this object. The class is defined as follows:
class ENDF{ private: int mat ; // ENDF MAT number int mf ; // ENDF MF number int mt ; // ENDF MT number Record head ; // Head Record DataSize size ; // ENDF data size int pos ; // pointer to current block int ni ; // current number of integer data int nx ; // current number of double data public: int *idata ; // integer data double *xdata ; // floating point data int **iptr ; // int pointer for the 2-dim array double **xptr ; // double pointer for the 2-dim array Record *rdata ; // pointer for 2-dim data CONT };
The MAT/MF/MT triplet, which is an ID of this section, is kept in private. The HEAD record is also private. The DataSize is the size of this object specified by S, M, or L.
The three integers, pos, ni, and nx, are hidden variables in the class, required a method to store integer/floating point data on memory, explained below. pos is a pointer to the data block currently the program is accessing, ni and nx are the counters of integer or floating point data elements currently stored in the data array. They are used for monitoring the total number of data points in endflib.cpp.
The numerical data are stored in this object in a one-dimensional mode. There are three types of data stored; integer, double, and Record. The integer and double data are also accessed as a two-dimensional array. For example;
N1 N2 N3 N4 N5 N6 ... N10 N11 N11 (0,0) (0,1) (0,2) (0,3) (1,0) (1,1) ... (2,0) (2,1) (2,2)
There are twelve numbers ( = ni) in the integer array idata, and the same are accessed by a 2dim array pointer iptr, like itpr[0][2]=N3, iptr[2][2]=N11. The pointer itpr[0] contains the address of idata[0].
The first index, 0, 1, and 2, is common to all the double and Recode arrays xptr and rdata, which means that an i-th data block has three relevant data sets iptr[i], xptr[i], and rdata[i]. Sometimes there is no corresponding int/double data block for a given i.
The MAT/MF/MT triplet as well as the HEAD record can be accessed by member functions. The setENDFhead() function resets all the counters pos, ni and nx. This is function should be called first, when a new section is created.
void setENDFmat(int n){ mat = n; } void setENDFmf (int n){ mf = n; } void setENDFmt (int n){ mt = n; } int getENDFmat() { return mat; } int getENDFmf () { return mf; } int getENDFmt () { return mt; } void setENDFhead(double c1, double c2, int l1, int l2, int n1, int n2){ head.setRecord(c1,c2,l1,l2,n1,n2); pos = ni = nx = 0; } void setENDFhead(Record r){ head = r; } Record getENDFhead(){ return head; }
class ENDFDict{ public: int mat ; // ENDF MAT number int sec ; // number of sections int *mf ; // ENDF MF number int *mt ; // ENDF MT number int *nc ; // Line count int *mod ; // MOD number int *id ; // ID for ENDF data on memory char tpid[67]; // Tape ID Record head ; // Tape HEAD Record Record cont[3] ; // CONT Records };
An object of ENDFDict class contains MAT number mat, Tape ID tpid, Tape header part (one HEAD and three CONTs) head, cont, total number of sections sec, and integer data arrays for each section mf, mt, nc, mod, and id. nc is the number of lines (in card image). The array id has special meanings, as given below.
In DeCE, one object is assigned to each section of an ENDF-6 file. For example, when sections are given in
ENDF lib[0]; // comment section MF=1, MT=451 ENDF lib[1]; // resonance parameters MF=2, MT=151 ENDF lib[2]; // total cross section MF=3, MT=1 ENDF lib[3]; // elastic cross section MF=3, MT=2 ENDF lib[4]; // capture cross section MF=3, MT=102 // elastic, no data MF=4, MT=2 // spectrum, no data MF=6, MT=102
sec is 7, and 5 sections out of 7 have real data on memory. The rest of two sections are in the dictionary, but DeCE has not allocated memory to store these sections. DeCE gives -1 to their ids. the arrays of mf, mt, and id may contain,
index MF MT ID 0 1 451 0 1 2 151 1 2 3 1 2 3 3 2 3 4 3 102 4 5 4 2 -1 6 6 102 -1
When one section is deleted, DeCE keeps this section on memory, but set id = -2. Now we delete MF/MT=3/2 and 4/2, and add a new section MF/MT=3/3 to which memory is allocated. sec becomes 8. The index for the new section will be 7, and the id is 5.
ENDF lib[5]; // nonelastic cross section MF=3, MT=3
index MF MT ID 0 1 451 0 1 2 151 1 2 3 1 2 3 3 2 -2 4 3 102 4 5 4 2 -2 6 6 102 -1 7 3 3 5
Finally DeCE prints out sections whose id are positive, in the ascending order of MF and MT.
Two member functions, scanDisc() and getID(), give status of each data block.
int scanDict(int n1, int n2){ int k = -1; for(int i=0 ; i<sec ; i++){ if( (mf[i]==n1) && (mt[i]==n2) ){ k = i; break; } } return(k); } int getID(int n1, int n2){ int k = -1; for(int i=0 ; i<sec ; i++){ if( (mf[i]==n1) && (mt[i]==n2) ){ k = id[i]; break; } } return(k); }
scanDict() looks up a given MF/MT in the dictionary, and if that section is found, it returns its index, otherwise -1. In the case of example above, scanDict(3,3) gives 7.
getID() is similar to scanDict(), but it returns the id of given section. scanDict(3,3) is 5.


Create a new EntityPose instance to represent the pose of an entity relative to a given reference frame. If no reference frame is specified, then the pose is based on the context's defaultReferenceFrame.
the reference frame to use
Create an entity that is positioned at the given cartographic location,
with an orientation computed according to the provided localToFixed
transform function.
For the localToFixed
parameter, you can pass any of the following:
Argon.Cesium.Transforms.eastNorthUpToFixedFrame
Argon.Cesium.Transforms.northEastDownToFixedFrame
Argon.Cesium.Transforms.northUpEastToFixedFrame
Argon.Cesium.Transforms.northWestUpToFixedFrame
Additionally, argon.js provides:
Argon.eastUpSouthToFixedFrame
Alternative transform functions can be created with:
Argon.Cesium.Transforms.localFrameToFixedFrameGenerator
Get the cartographic position of an Entity at the given time
Subscribe to pose updates for the given entity id
A Promise that resolves to a new or existing entity
Unsubscribe from pose updates for the given entity id
Generated using TypeDoc
A service for subscribing/unsubscribing to entities


Non-Technical Introductions
Non-Technical Videos (Very Intro)
* [Bitcoin explained and made simple](https://www.youtube.com/watch?v=s4g1XFU8Gto) (3m:24s) by [The Guardian](http://www.theguardian.com/)
* [The Essence of How Bitcoin Works (Non-Technical)](https://www.youtube.com/watch?v=t5JGQXCTe3c) (5m:24s) by [Curious Inventor](http://Patreon.com/CuriousInventor)
Non-Technical Videos (More Detail)
* [Blockchain University — Bitcoin & the Blockchain: An Introduction](https://www.youtube.com/watch?v=ZUoXUW9zVMs) (26m:16s) by [@ChristopherA](https://twitter.com/ChristopherA)
* [Bitcoin 101 - What is Bitcoin?](https://www.youtube.com/watch?v=Bhe61JaNFLU) (22m:32s) by [James D'Angelo WBN](https://www.youtube.com/channel/UCgo7FCCPuylVk4luP3JAgVw)
Non-Technical Videos (Intermediate & Related Topics)
* [Blockchain University — Bitcoin Keys Addresses and Wallets](https://www.youtube.com/watch?v=Ic76iSnCb_0) (1h:06m:43s) by [@ChristopherA](https://twitter.com/ChristopherA)
* [Bitcoin Sidechains](https://www.youtube.com/watch?v=6sXNVIaNL2Y) (5m:54s) by [Diginomics](https://diginomics.com/)
Non-Technical Articles
* [What is Bitcoin?](http://www.coindesk.com/information/what-is-bitcoin/) by CoinDesk
* [What is Bitcoin?](http://money.cnn.com/infographic/technology/what-is-bitcoin/) by CNN Money
* [The Impact of the Blockchain Goes Beyond Financial Services](https://hbr.org/2016/05/the-impact-of-the-blockchain-goes-beyond-financial-services) by Don an Alex Tapscott
Technical Videos
* [How Bitcoin Works in 5 Minutes (Technical)](https://www.youtube.com/watch?v=l9jOJk30eQs) (5m:25s) by [Curious Inventor](http://Patreon.com/CuriousInventor)
* [How Bitcoin Works Under the Hood](https://www.youtube.com/watch?v=Lx9zgZCMqXE) (22m:24s) by [Curious Inventor](http://Patreon.com/CuriousInventor)
* [Mechanics of Bitcoin](https://www.youtube.com/watch?v=t3hJsFpPmXs) (1h:19m:49s) by [Princeton
Bitcoin and Cryptocurrency Technologies Online Course](https://www.coursera.org/course/bitcointech)
* [Programming Bitcoin Youtube Channel](https://www.youtube.com/programmingbitcoin) by Murray
* [Coding Multi-Signature Addresses](https://www.youtube.com/watch?v=zIbUSaZBJgU) by D'Angelo
Technical Books
* [Mastering Bitcoin](https://github.com/aantonop/bitcoinbook) by Andreas M. Antonopoulos LLC
Technical Articles
* [Elliptic Curve Digital Signature Algorithm and its Applications in Bitcoin (http://cs.ucsb.edu/~koc/ecc/project/2015Projects/Malvik+Witzoee.pdf) by Arnt Gunnar Malvik and Bendik Witzoee
* [Programming Bitcoin Transaction Scripts](https://docs.google.com/document/d/1D_gi_7Sf9sOyAHG25cMpOO4xtLq3iJUtjRwcZXFLv1E/edit) by Kofler
* [Developer’s Introduction to Bitcoin](http://bitcoinmagazine.com/9249/developers-introduction-bitcoin/) by Buterin
* [How Bitcoin Works Under the Hood](http://www.imponderablethings.com/2013/07/how-bitcoin-works-under-hood.html) by Driscoll
* [Bitcoins the hard way: Using the raw Bitcoin protocol](http://www.righto.com/2014/02/bitcoins-hard-way-using-raw-bitcoin.html) by Shirriff
* [Bitcoin mining the hard way: the algorithms, protocols, and bytes](http://www.righto.com/2014/02/bitcoin-mining-hard-way-algorithms.html) by Shirriff
* [Cryptographic Currencies Crash Course (C4)](http://www2016.net/proceedings/companion/p1021.pdf) by Aljosha Judmayer and Edgar Weipp
* [The libbitcoin Tutorial](http://libbitcoin.dyne.org/doc/) by Taaki
* [How to Parse the Bitcoin Blockchain](http://codesuppository.blogspot.com/2014/01/how-to-parse-bitcoin-blockchain.html) by Ratcliff
* [Signing Offline Transactions](https://gist.github.com/jashmenn/9811205) by Maxwell
* [2 of 2 escrow example](https://gist.github.com/jashmenn/9811198) by Maxwell
* [2 of 3 multisig example](https://gist.github.com/jashmenn/9811185) by Andresen
* [How to decrypt messages in the blockchain from btcmsg](https://gist.github.com/ripper234/1625828) by ripper234
Sidechains are new blockchains, but are backed by Bitcoin rather than being an altcoin. Using "two-way pegging" these sidechains provide a method for developers to make changes and play around with blockchain rules in a separate blockchain, while keeping these coins linked to Bitcoin.
Introduction
* [Ask Dr. Bitcoin: What are Side-Chains](http://siliconangle.com/blog/2014/04/21/bitcoin-sidechains/)
* [Introduction To Sidechains and Blockchain 2.0](https://www.deepdotweb.com/2014/06/26/sidechains-blockchain-2-0/)
* [Sidechains, Treechains, the TL;DR](http://blog.greenaddress.it/2014/06/13/sidechains-treechains-the-tldr/) by Sanders
* [Side Chains: The How, The Challenges and the Potential](http://bitcoinmagazine.com/12349/side-chains-challenges-potential/) by Buterin
* [Sidechain Technical Feasibility Discussion](https://bitcointalk.org/index.php?topic=566704.0;all) (discussion)
* [Alternative Chains / merged mining](https://en.bitcoin.it/wiki/Alternative_Chains)
* The Initial Two-Way Pegging [proposal](http://sourceforge.net/p/bitcoin/mailman/message/32108143/) by Adam Back
* Blockstream Whitepaper [Enabling Blockchain Innovations with Pegged Sidechains](https://www.blockstream.com/sidechains.pdf)
* [Tree-chains preliminary<EMAIL_ADDRESS>by Todd
Tutorials
* [Sidechains: Alpha Sidechain Tutorial](http://blog.cryptoiq.ca/?p=395)
Projects
* [Sidechain Elements Project](https://github.com/ElementsProject/elementsproject.github.io/) - Open source github project investigating and experiment with various bitcoin sidechain concepts
Introduction
* [A Treatise on Altcoins](https://download.wpsoftware.net/bitcoin/alts.pdf)
Tutorials
* [How To Clone Scrypt Based Altcoins for Fun and Profit](http://devtome.com/doku.php?id=scrypt_altcoin_cloning_guide&rev=1391981820) by shakezula
Projects
* [CoinGecko](https://www.coingecko.com/en) has charts for a number of altcoins, but more importantly, attempts to measure developer and user community activity.
Javascript & Bitcoin
At Blockchain University we use a number of Javascript based examples to teach the more technical details of Bitcoin. You are not required to have an in-depth knowledge of Javascript, but learning some basics is very useful.
Setting Up on Mac
If using a Mac, you'll need some basic knowledge how to use the Terminal and the Mac's command line interface, and you'll need to install brew, node and git. A basic tutorial on how to do this is at https://github.com/ChristopherA/intro-mac-command-line
You can also use this script which sets up your Mac automatically, but the above teaches you how do to do it manually https://github.com/blockchainu/prepare-osx-for-blockchain-webdev
Introduction to Javascript
Javascript is in both server (node) and client (browser) development. Some basics of Javascript are common to both. Here are some resources for learning about Javascript that are generally applicable to both platform.
* [Learn Javascript](https://www.gitbook.com/book/gitbookio/javascript/details) - a free online book with interactive exercises.


This is new paragraph
This is paragraph
This is new paragraph
This is span paragraph
This is new span paragraph


|
|
Storage
LDA - Load A with M
LDX - Load X with M
LDY - Load Y with M
STA - Store A in M
STX - Store X in M
STY - Store Y in M
TAX - Transfer A to X
TAY - Transfer A to Y
TXA - Transfer X to A
TYA - Transfer Y to A
TSX - Transfer Stack Pointer to X
TXS - Transfer X to Stack Pointer
Bitwise
AND - AND M with A
EOR - Exclusive OR M with A
ORA - OR M with A
BIT - Test Bits in M with A
ASL - Shift Left One Bit (M or A)
LSR - Shift Right One Bit (M or A)
ROL - Rotate One Bit Left (M or A)
ROR - Rotate One Bit Right (M or A)
|
Math
ADC - Add M to A with Carry
SBC - Subtract M from A with Borrow
DEC - Decrement M by One
DEX - Decrement X by One
DEY - Decrement Y by One
INC - Increment M by One
INX - Increment X by One
INY - Increment Y by One
Branch
BCC - Branch on Carry Clear
BCS - Branch on Carry Set
BEQ - Branch on Result Zero
BNE - Branch on Result not Zero
BMI - Branch on Result Minus
BPL - Branch on Result Plus
BVC - Branch on Overflow Clear
BVS - Branch on Overflow Set
Jump
JMP - Jump to Location
JSR - Jump to Subroutine
RTS - Return from Subroutine
RTI - Return from Interrupt
|
Registers
CLC - Clear Carry Flag
SEC - Set Carry Flag
CLD - Clear Decimal Mode
SED - Set Decimal Mode
CLI - Clear Interrupt Disable Bit
SEI - Set Interrupt Disable Status
CLV - Clear Overflow Flag
CMP - Compare M and A
CPX - Compare M and X
CPY - Compare M and Y
Stack
PHA - Push A on Stack
PLA - Pull A from Stack
PHP - Push Processor Status on Stack
PLP - Pull Processor Status from Stack
System
BRK - Force Break
NOP - No Operation
|


#MozMeet
Bon Voyage towards Internet Privacy
Hosted by
Gauthamraj Elango
Mohankumar
Date : 16-02-2014
Venue : CSC Computer Institute , Perundurai
PRIVACY ? What's that ?
... Any Guesses ? ...
Protect our Data on the Internet
Need for Privacy
- The purpose of the Data Protection is to protect personal data
- serves to keep those who process the data responsible in how they handle and process the data
- Protect the data from the third party sites
- Secure the paswords from the hacker
How to be Secured ?
- Lightbeam - - See who tracks us online
- about:permissions - Set preferences for every website
- about:config - Play with Mozilla code
- about:privatebrowsing- No more cookies
- Webmaker Tools - Learn How the Web Works
Lightbeam
- Lightbeam is a Firefox add-on
- It enables you to see the first and third party sites you interact with on the Web
- It shows you the relationships between these third parties and the sites you visit
about:permissions
The Permissions Manager gives you easy access to the following
- Store passwords - Set Firefox can store passwords
- Share Location - Set Firefox share your location
- Set Cookies - How long websites can set cookies
- Open Pop-up windows - Allow or block pop-up windows
- Maintain Offline Storage - websites can store information on your computer for use when you are offline
- Fullscreen - Set whether or not websites can be displayed in full screen.
about:config
- It is used to customize the firfox
- we can add,modify and reset the preferences such as Speed up Firefox, Disable antivirus scanning, Open Javascript popups as tabs, Spell checking, etc
about:privatebrowsing
Private browsing can not save the following
- Visited pages
- Form and Search Bar entries
- Passwords
- Download List entries
- Cookies
- Cached Web Content and User Data
X-ray goggles
- It is easy to change the web page what we want
- X-Ray Goggles allow us to understand "what the web is made of" that is building block of web page
- To remix, change and share their favorite webpages
Need help ?
Contact
Gauthamraj Elango -<EMAIL_ADDRESS>/ @GauthRaj
Thank You !


High Scores
Time left 75 seconds
Coding Quiz Challenge
Select the correct answer from a list of four possible answers. You have 75 seconds to answer all questions. An incorrect answer incurs a 15 second time penalty. When ready, click start to test your knowledge! GOOD LUCK!
Start Quiz


Jump between magic hats to escape the clutches of an evil magician.
Rabbit Hop! was made during my Mobile Game Design class. This was a solo project, so I was responsible for all aspects (excluding the music, which were CC0/Public Domain).
An idle Game about the struggles of a video game developer.
Game Dev Simlator was the final project for my Mobile Game Design class. This was a solo project, so I was responsible for all aspects (excluding the background art, which were generated through Artbreeder, and thus are CC0/Public Domain).


This post presents a compilation of links to psychology papers; I have chosen papers I find intriguing particularly for working in class. All papers are open access (or a from open access repositories) which renders classroom work easier. The papers are collected from a broad range of topics but mostly with focus on general interest. The perspective is an applied one; I have not tried to select based on methodological rigor. The collection is structured along the well-known classification of psychological work: social, personality, cognitive. I have added ‘social media/ psychoinformatics’ as this reflects a topic I am quite interested in.
I am unsure about compilations of ‘must read’ psych articles, but I have found some. Such sites may provide a more succinct and broader perspective on much read or influential or interesting or high-qualitative science papers. Here’s a short list:
- Altmetric Top 100 - 2016 (filter on ‘studies in human society’)
- Altmetric Top 100 - 2015 (filter on ‘studies in human society’)
- Frontiers in Psychology (click on ‘most cited’)
Social psychology
- Meta-Milgram: An Empirical Synthesis of the Obedience Experiments
- Behavioral Priming: It’s All in the Mind, but Whose Mind?
- Always Gamble on an Empty Stomach: Hunger Is Associated with Advantageous Decision Making
- A Virtual Reprise of the Stanley Milgram Obedience Experiments
- The Power of Kawaii: Viewing Cute Images Promotes a Careful Behavior and Narrows Attentional Focus
- Non-Disruptive Tactics of Suppression Are Superior in Countering Terrorism, Insurgency, and Financial Panics
Personality/ Individual differences
- Loss of Control Increases Belief in Precognition and Belief in Precognition Increases Control Temptation at Work
- The Distance Between Mars and Venus: Measuring Global Sex Differences in Personality
- Personality, Gender, and Age in the Language of Social Media: The Open-Vocabulary Approach
- A Propaganda Index for Reviewing Problem Framing in Articles and Manuscripts: An Exploratory Study
- Are women better than men at multi-tasking?
- Business culture and dishonesty in the banking industry
- The Negative Association between Religiousness and Children’s Altruism across the World
- Does happiness itself directly affect mortality? The prospective UK Million Women Study
Cognitive psychology
- The Eyes Don’t Have It: Lie Detection and Neuro-Linguistic Programming
- Human language reveals a universal positivity bias


| SARSCOVIDB ID |
reference identification of the entry in the SARSCOVIDB. |
| gene name |
official gene name for each stored entry. |
| protein name |
official protein name for each stored entry. |
| host/sample |
host model used to generate SARS-COV-2 infection data. |
| sample |
description of the sample, such as if it is a human clinical sample (blood, urine, serum,
etc.) or experimental sample (cell line or animal tissue tested
in vitro).
|
| virus reference |
SARS-CoV-2 strain reference or geographic origin of the SARS-CoV-2 viral isolate or clinical sample. |
| methods |
methods used to measure gene expression at the level of RNA and/or protein after SARS-CoV-2 infection. |
| expression |
indicates the identified gene expression
status (up- and/or downregulated) in response to SARS-CoV-2 infection.
|
| article |
article title used as a data source. |
| DOI |
direct link to the original reference where the data came from. |
| type of sample |
indicates if the data were generated using clinical or experimental samples. |


Sunny
0°
No address
Wind
0 mph
Humidity
0%
Pressure
0 in
Cloudy
0°
No address
Wind
0 mph
Humidity
80%
Pressure
0 in
Rain
0°
No address
Wind
0 mph
Humidity
0%
Pressure
0 in


In the context of the Urban Data Challenge, the Urdacha team has put together what we hope you will find to be valuable tools in the treatment and mining of big data relating to transporation.
The goal of the Challenge is as follows:
The Urban Data Challenge seeks to harvest the innovative and creative power of communities around the world to explore urban data sets through visualization.
Our work revolves around three guiding principles:
Source code, the data files we built and much more information is available in the Urdacha GitHub repository:
Given that we are providing free open source tools available to anybody that needs them, it is essential the tools are complete and are in working order. ' + There is no deadloine or finish line for this type of work. You can track the progress of our ongoing efforts by clicking on 'Progress Reports' in the left menu.
The Urdacha team worked on the premise that cities are producing increasingly gigantic volumes of data on a daily basis. As we move forward, finding innovative ways to use and learn from this new wealth of information will allow us "unclog the arteries" with cities that are more interactive, that involve citizens in finding solutions to problems, that are more efficient, diverse and appealing.
Before we are able to do so, however, we are facing the challenge of processing these huge amounts of data, of bringing them down to a human scale, in addition to being constricted by the limitations of 2D.
Like the little girl in this video, we are still struggling with the limitations of 2D.
Through our project, we have been able to not only translate the datasets into meaningful information, but we have been able to create 3D visualization tools that let you double-click into the data. It helps you interact with your data and therefore your city. You can see, visualize, understand more information at the same time in a 3-Dimensional world.
The featured project today is called hAxis. hAxis provides users the opportunity for Exploratory Data Analysis through visualizations of real-time data feeds from three different cities. The possibilities in this 3D field are near limitless, and the only limitation of hAxis is the user (and bugs).
The main idea of hAxis is that it displays a certain number of "events" which you will see as conical symbols. These events can chart as many different metrics as are available in the dataset. hAxis therefore enables you to examine trends, to establish correlations, to identify problems, within a system.
When you first load hAxis, you will be greeted with what look like colorful tadpoles moving around. Each tadpole is a bus, color-coded by route, moving around San Francisco. The same data is available for Zurich and Geneva. The generic setting is bus route by longitude by latitude - but any number of metrics can be displayed.
A very rapidly approaching revision includes the ability to single out a number of specific events to display and highlight.
The inherent quality of hAxis and its limitless capabilities, depend on the understanding and vision of the user. Used well, hAxis enables you to compare and contrast data in ways previously impossible thanks to the wealth of information provided to us and 3D tools.
Because the interface is still in its young age, here are some ready-for-consumption stills from hAxis that demonstrate the capacity of this tool.
The first demonstration we have prepared for you is a look at the same metrics in all three cities.
The metrics chosen are:
This means that the images are showing you what is almost a skewed bell curve in the case of San Francisco and Geneva, representing passenger loads on different buses throughout the system. You will note in both cases that the majority of the loading and unloading occurs in the first half of the bus route, while on the second half of the journey the vehicle is much less full. Data for Zurich is probably in the same form but we have data for only about twenty percent of the journey and [as of this writing] it appears that there may be an error in the way we are matching up the two Zurich data sets. This error will be rectified in the next day or so. If we were watching hAxis display these metrics in real time, as you can for San Francisco here, we could see the progression of these metrics throughout the day.
The second demonstration is about the sort of information that can be found from the Readout section of hAxis.
In this scenario, we looked at the percent of times during the day a bus made a stop with zero passenger load:
In layman's terms, this means that in Geneva on October 10th 2012, 8% of buses had, throughout the day, zero passengers on board when they made a stop. If we go further, we see that 16% of buses made stops with a passenger load of 2 or fewer. The number is 13% for San Francisco, and 14% for Zurich.
The third demonstration is whatever you come up with! Head on over to hAxis to see what you can come up with (please allow a dozen seconds for data to load). Want to take it slow? Our Readme page might be a good start.
Urdacha has played around with a lot of different ideas before settling on hAxis. You might find some of these other projects fun:


--- author: Ryan categories: app date: '2009-11-18 21:45:53' link: http://blogs.nitobi.com/ryan/index.php/2009/11/18/phonegap-for-symbian-qt/ permalink: /2009/11/18/phonegap-for-symbian-qt/ slug: phonegap-for-symbian-qt status: publish title: 'PhoneGap for Symbian: Qt' type: post format: html ---
During the initial stages of working on PhoneGap for Symbian using Web Runtime, some limitations were brought to light due to the fact that Nokia's WRT is closed source: we are limited to the device functionality and platform support which Nokia has exposed. Nonetheless its a great technology and porting PhoneGap to WRT was a relatively quick win (taking in to account my having to re-learn javascript after 1 year of flailing abroad).
But over the last few weeks, while maintaining the latter, I've been researching/experimenting (don't even want to go far as say developing, as very little has been implemented) with Qt for Symbian. The crew at Nokia just released the Qt 4.6 release candidate on Nov 17th, and it includes a port of Webkit to Qt (QtWebkit), along with support for the Symbian/S60 platform, which is just the combination phonegap needs.
note my amazing javascript console, firebug is crap
So anyways I've got a PhoneGap Symbian Qt build (piggybacking off of the webkit demos included with Qt) which can open a local resource in a webview, and expose Qt Objects (and thus device functinoality) to javascript (via webframe->addtojavascriptwindowobject). I've implemented the most important API first, rather than the easiest: vibration. Ok it was actually the easiest.
Anyways there's other problems to tackle before implementation of more PhoneGap APIs:
XHRs seem to be getting blocked. I'm thinking its blocking what it considers a cross-domain XHR: a local html file to a remote server. I believe the support of this depends on the Webkit implementation(?)
I can't remember what else.
So if this looks interesting, help out the mobile developer community. Contribute. Its open source. Check out my very basic Getting Started doc, and get the code from my PhoneGap repo on Github (Symbian Qt branch). The .sis installer file is in there as well, so you could also just put it on your device to see a PhoneGap app that vibrates and thats about it. Really useful. I think you might need to install Qt libraries to your phone since I haven't packaged them in the app yet.


{% extends "base.html" %} {% block title %}
Medieval catalogues > BENEDICTINES: THE SHORTER CATALOGUES > Holme St Benet's > Leland, c. 1536-40
{% endif %}7 identified entries found.
All data was derived from the List of Identifications by Professor Richard Sharpe.
{% if not printing %}
A key to codes used in the List is available (opens in new tab).{% endif %}


#include <qtconcurrentreducekernel.h>
template<typename ReduceFunctor, typename ReduceResultType, typename T>
class QtConcurrent::ReduceKernel< ReduceFunctor, ReduceResultType, T >
QtConcurrent
◆ ReduceKernel()
template<typename ReduceFunctor, typename ReduceResultType, typename T>
◆ finish()
template<typename ReduceFunctor, typename ReduceResultType, typename T>
◆ runReduce()
template<typename ReduceFunctor, typename ReduceResultType, typename T>
◆ shouldStartThread()
template<typename ReduceFunctor, typename ReduceResultType, typename T>
◆ shouldThrottle()
template<typename ReduceFunctor, typename ReduceResultType, typename T>
The documentation for this class was generated from the following file:


{{ username }}'s comments | Hacker News
Hacker News
new
|
threads
|
ask
|
submit
Log in
| Log out
*
0 points by
{{ username }}
| {{ agoFunction(comment.created_at); }} |
parent
| on: {{ commentSubmission(comment.submission_id); }}
{{ comment.content }}


 A cute couple, zombies, a stoned hamster, and a cat with magic powers find out in Noir Films’ latest production, “Mates”. Hope you like it!
MATES KICKSTARTER.COM PROMOTIONAL VIDEO
This video was made to help raise funds for a Mates pilot episode.
HOMEFRONT
When the rich wage war, it is the poor who die.
-JEAN-PAUL SARTRE, The Devil and the Good Lord
This is a promotional short for a series called HomeFront, a show about what happens when everyday people are thrown into horrific circumstances. The series follows the crew of an old picket ship during the course of an exceptionally bloody war.  As the war turns against humanity, our heroes are forced to confront their darker natures and discover just how far astray from their moral values they are willing to go.
Generally speaking, an entity is referred to as a Person if he/she/it has a rich mental life in which they are capable of regarding themselves conceptually
in both the third and first person. While this may be a “good enough” description in most circumstances, it fails to distinguish,
as a fact-of-the-matter, between Persons and non-persons in all cases. For example, while the reader of this text is likely a Person, and the computer on
which I’ve written it is (hopefully) not, what about a dolphin? The definition above could certainly be construed to include dolphins and, in fact,
a wide variety of higher-order mammalian life. While I have no problem with idea of dolphin-personhood, it would be nice to know for certain whether or not
Douglas Adams was right and dolphins are, in fact, trying to tell us something.
Interestingly, an often ignored consequence of this notion of personhood is that, while all known instances of Persons are human, not all humans are Persons.
A fetus does not meet the criteria because it lacks the ‘rich mental life’ our definition requires. Neither does a human suffering from late-stage
Alzheimer’s disease or someone in a persistent vegetative state. This despite the fact that they are all living human beings. Moreover, if we accept this
definition of personhood, then we must also accept the fact that what we identify ourselves as (i.e. as Persons) is not a function our being human, but an
attribute of manner in which our human parts relate.
To date, the lack of an adequate understanding of the manner in which our parts relate (specifically the mind and body), has made the problem of personhood
particularly intractable. Consequently, we don’t have answer to the question what exactly am I referring to when I use the word “I”?
Given that we place so much importance on the rights and welfare of Persons, it seems to me a fundamental task to know exactly what one is.
Fortunately, a promising theory called Emergence may be our salvation. It describes how systems can engender distinct, more complex, processes that are irreducible
to their basal constituents. In a nutshell, something that’s Emergent is more than the sum of its parts.
If the Emergentists are correct and the mind is, in fact, an emergent property of the body, there may yet be a way to answer questions about personhood in a
fact-of-the-matter fashion. I use computers to study Emergence with the hope of better understanding what makes us Persons.


I've definitely been too focused on pleasure this second half of the year. I am happy that bootcamp is starting soon. Hopefully it will give me the definitive and difficult goal I'm looking for. This idea seems pretty solid. I'd see no reason to doubt that happiness can be built off these princaples.
Kindness, I'd say the most common ethical question I am regularly posed with is whether to be kind or how to be kind. My dad once said he wouldn't really care if I got in trouble at school as long as I never bullied anyone. Ambitiousness. I have a fear of giving up on dreaming. As a kid I placed goals for myself so high. Although now I realize I don't actually want to be a rockstar, I also don't want to give up my ability to dream. I think that with out limited lives the only logical thing to do is aim as high as you can dare to. Right and wrong. I don't think there is an objective morallity, but I think it'd be foolish to not act like there is. Because of that, I think we must be constantly trying to be a force for good, obviously the world isn't simple but if we stop checking our behaviour we start to lose a grip on reality.
I loved the excerise about predicting your future. It's such a powerful tool and it's also just fun to be optomistic and set high goals and posibilities..


Crop In this section, you must resize the captured image and save it in your list of Crops.
MAGNUM name must be unique...


Demos
Without Grouping
Selected Values in multiselect:
<hyper-multiselect
[inbound]="demo1"
(outbound)="refreshDemo1Values($event)"
[displayKey]="'dispVal'"
[allSelected]="true">
</hyper-multiselect>
this.demo1 = [{{'{'}}id: 1, dispVal: "Blue Jays"},
{{'{'}}id: 2, dispVal: "Maple Leafs"},
{{'{'}}id: 3, dispVal: "Raptors"},
{{'{'}}id: 4, dispVal: "Argos"}
];
public refreshDemo1Values(value: any): void {{'{'}}
this.demo1Vals = value;
}
With Grouping
Selected Values in multiselect:
<hyper-multiselect
[inbound]="demo2"
(outbound)="refreshDemo2Values($event)"
[displayKey]="'name'"
[groupBy]="'type'"
[allSelected]="true">
</hyper-multiselect>
this.demo2 = [{{'{'}} id: 1, name: "Rose Tyler", type: "companion" },
{{'{'}} id: 2, name: "Donna Noble", type: "companion" },
{{'{'}} id: 3, name: "Martha Jones", type: "companion" },
{{'{'}} id: 4, name: "Dalek", type: "enemy" }
];
public refreshDemo2Values(value: any): void {{'{'}}
this.demo2Vals = value;
}
Without Select All
Selected Values in multiselect:
<hyper-multiselect
[inbound]="demo1"
(outbound)="refreshDemo3Values($event)"
[displayKey]="'name'"
[groupBy]="'type'"
</hyper-multiselect>
this.demo3 = [{{'{'}} id: 1, name: "Rose Tyler", type: "companion" },
{{'{'}} id: 2, name: "Donna Noble", type: "companion" },
{{'{'}} id: 3, name: "Martha Jones", type: "companion" },
{{'{'}} id: 4, name: "Dalek", type: "enemy" }
];
public refreshDemo3Values(value: any): void {{'{'}}
this.demo3Vals = value;
}


InsnLine(line: Int)
A structure representing a line of code. Acts as a List of CtInsn.
line - The line that the accompanied CtInsn appear on.
line


[gecode-users] nextDesc in gecode 3.1.0
Christian Schulte
cschulte at kth.se
Mon Jun 1 13:55:00 CEST 2009
Hi Vincent,
What I did in the trunk is to make ds protected again and provide a top()
and empty() method. Does that work for you, or do you need anything else? I
really would like to keep ds protected as we might change to a different
datastructure for ds later.
I attached a patch (or get it from the trunk). Please let me know if there
is anything else you need.
Cheers
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Vincent Barichard
Sent: Monday, June 01, 2009 12:32 PM
To: Christian Schulte
Cc: 'gecode list'
Subject: Re: [gecode-users] nextDesc in gecode 3.1.0
Oups, I didn't see that the ds variable is already public in 3.1.
Sorry for my mistake.
Cheers,
Vincent
Le 1 juin 09 à 11:45, Christian Schulte a écrit :
> Which part of nextDesc do you need exactly?
>
> Wouldn't next() work for you? and then use top()? And yes, Node
> should be
> public, I'll do that in the trunk.
>
> Christian
>
> --
> Christian Schulte, www.ict.kth.se/~cschulte/
>
>
> -----Original Message-----
> From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On
> Behalf
> Of Vincent Barichard
> Sent: Friday, May 29, 2009 11:33 PM
> To: gecode list
> Subject: [gecode-users] nextDesc in gecode 3.1.0
>
> Hi,
>
> I downloaded Gecode 3.1.0 and I miss a method of 3.0.2. I used the
> nextDesc method of a path to get the next branching, but this method
> disapears in Gecode 3.1.0. Is there a way to get a branching desc or a
> node from a path ?
> Should I set the Node nested class to public ?
> Thanks for your help.
>
> Cheers,
> Vincent
>
> Vincent Barichard Université d'Angers (LERIA)
> Tel: 02 41 73 52 06 Département Informatique
> Fax: 02 41 73 50 73 H203
>
>
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
Vincent Barichard Université d'Angers (LERIA)
Tel: 02 41 73 52 06 Département Informatique
Fax: 02 41 73 50 73 H203
_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
-------------- next part --------------
A non-text attachment was scrubbed...
Name: vincent.patch
Type: application/octet-stream
Size: 2807 bytes
Desc: not available
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090601/877a085a/attachment.obj>
More information about the gecode-users
mailing list


The National Institute Of Engineering
Mysuru-570008,PH. NO. 0821-4004950/2480996
SEMESTER END EXAMINATION (SEE)
ADMISSION TICKET
- NAME: {{ details[1] }}
- USN: {{ details[2] }}
- SEMESTER: {{ details[3] }}
- BRANCH: {{ details[4] }}
| Date |
Regular/Repeater |
Subject Code |
Subject |
Time |
Room number-Seat number |
Invigilator's Signature |
{% for i in t_info: %}
{% for j in range(7): %}
| {{t_info[i][j]}} |
{% endfor %}
{% endfor %}
CONTROLLER OF EXAMINATION
PRINCIPAL
STUDENT
* Conditions of AEC apply
INSTRUCTIONS TO CANDIDATES
- 1. Candidates shall note carefully the date, time and title of the course to be held each day. They shall
take their places in the alloted examination room at least 10 minutes before the time fixed for the
commencement of the examination. A candidate should not be allowed after half an hour of the
schedule time.
- 2. Candidates shall search their pockets, desks and benches and handover to the Superintendent any
paper. Book or note which may find therein, before starting to answer the papers of their examination.
- 3. Candidates shall affix their signature in token of their receiving the answer book in the
Superintendent's dairy. They shall also affix their initials every time they receive an additional
Drawing/Graph sheet.
- 4. Candidates shall not be allowed to leave the examination room till the expiry of at least half an hour
after the question paper has been distributed. A candidate who leaves the room during the period
allotted for a paper shall not be allowed to return within the period.
- 5. Under no circumstances shall the candidates give their identity anywhere else other than in the
space provided to write the Register Number.
- 6. You are required to use the same Admission Ticket throughout the SEE. In case, if the Admission
Ticket is lost, you should get the duplicate from the examination section only by paying a penalty of
Rs. 100/-.
FOLLOWING ACT OF STUDENT ARE CONSIDERED AS MALPRACTICE
- 1. Any candidate having in his/her possession any Digital device(Advanced devices like Smart
Watches, Ear Phones, Bluetooth/WIFI Devices etc) or access to paper, books or notes which might,
possibly be of assistance to him/her or found giving or receiving assistance, or copying from any
paper, book or note or allowing any other candidate to copy from his/her answer book shall be
debarred for a period which may extend to 2 years.
- 2. Any candidate found guilty of deliberate previous arrangement to cheat in the examination, such as
smuggling another answer book sheets, imperonation or some other misconduct of a serious nature,
shall be debarred for a period which may extend to 5 years.


Project LIB
Name of Authorized User
Catalogue Management
Create Book Entry
Edit Book Entry
Delete Book Entry
About
Title
Author
Keywords
Create Book Entry
Title
Author
Section
Status
Batch
Size
Cancel
Edit Book Entry
Title
Author
Section
Status
Batch
Size
Cancel
Book Catalogue
ID
Title
Author
Status
ID
Title
Author
Status


_You've_Got_Mail_ (PG) **** (out of ****)
Of all the delights to be had while watching the enchanting romantic comedy _You've_Got_Mail_, none gave me more joy than the performance of co-lead Meg Ryan. The reigning queen of romantic comedy, Ryan, not so surprisingly, delivers another turn of irresistible charm as bookstore owner Kathleen Kelly. But what I paid conscious attention to this time around was the ease with which she tackles the deceptively simple-looking job of romantic comedienne. It's no easy task to project a natural blend of sweetness, strength, wit, and genuine, hard-earned heart, yet Ryan has effortlessly pulled it off year after year, in movie after movie--without ever receiving her rightful recognition from the critics.
Sadly, _You've_Got_Mail_ will likely not change that, but that's mostly because so much of the film is so good. The film reunites Ryan with her _Sleepless_in_Seattle_ partners Tom Hanks and director/co-writer (with sister Delia) Nora Ephron in a plot that, not so coincidentally, appears to be a variation of that 1993 blockbuster. Ryan's Kathleen owns the small children's bookstore The Shop Around the Corner, whose long life as a Manhattan neighborhood staple is threatened by the nearby opening of a Barnes and Noble-like superstore called Fox Books, owned by wealthy Joe Fox (Hanks). Naturally, it's hate at first sight for Joe and Kathleen, but little do they know that appears to be their first meeting really isn't--they have anonymously been conducting a romance over the Internet as "NY152" (Joe) and "Shopgirl" (Kathleen).
Now, it would have been easy--and completely understandable--for the Ephrons to completely mirror _Sleepless_'s proven formula to the letter, but they manage to come up with some wrinkles that are often as unpredictable as they are funny. The biggest deviation from _Sleepless_ is the increased interaction of Hanks and Ryan, who spent most of their last collaboration apart--which called into question if the two truly had any chemistry. _Mail_ proves once and for all that Hanks and Ryan are a screen duo for the ages, equally convincing trading comic barbs or longing glances. Their sparring sessions have real bite, and their more mellow moments are so warmly tender that only the coldest hearts won't be at least slightly moved.
This isn't to say that the film doesn't make a concession to what has become the Ryan romantic comedy formula--namely, a man she is already attached to, here in the form of Greg Kinnear's politically-minded reporter Frank Navasky. The new rub here is that Frank, while a bit stuck on himself, is a nice guy and a much more appealing romantic choice than ruthless businessman Joe, who, in turn, already has a partner of his own: Patricia Eden (Parker Posey), who works at a publishing house. While the nice and perky Kathleen is clearly better than the ever-frantic Patricia, it is easy to see why Joe would be with her; her high social station makes for a "comfortable" choice, and it is in line with his hard-as-nails attitude--which, of course, hides the truly gentle soul that he bears only to "Shopgirl."
Similarly, Hanks does a bang-up job playing (to use Joe's term) a "pill," but he has a natural gentleness that he buries just deep enough and gradually brings to surface as the film progresses. Ephron has said that _Mail_'s central question is "Can Mr. Wrong turn out to be Mr. Right?" and that evolution is made involving and convincing by Hanks, who instead of making Joe's progression from black to white, makes it a more realistic shift between opposite shades of grey.
Again, though, _Mail_ is ultimately the glowing Ryan's show.  This is especially the case in one late shot of her face, which displays surprise, disgust, anger, and ecstatic, teary delight--all in a matter of seconds. If that's not a difficult acting task, I don't know what is--and it comes to Ryan as second nature.
Cynics will probably dismiss _You've_Got_Mail_ as disposable fluff for suckers for shamelessly romantic hokum. If that truly is the case--and, admittedly, there's no evidence to suggest otherwise--then I wear the title of "sucker" with pride.
Michael Dequina
<EMAIL_ADDRESS>|<EMAIL_ADDRESS>Mr. Brown's Movie Site: http://welcome.to/mrbrown
CompuServe Hollywood Hotline: http://www.HollywoodHotline.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


DzonintWeb Developer - Software Engineer - IT Technician
Portfolio
About
I'm a full-stack developer who recently graduated from one of Belgrade's IT oriented colleges with experience in both startup and corporate environments where my contributions are impacting thousands of users.
eveNT Belgrade is a web portal for inhabitants and visitors of Belgrade dedicated to bringing up to date information about the latest cultural events from various categories.
The site has custom CMS for admins. They can perform CRUD operations on events and users.
(do note that the site is not running optimally due to limitations from free hosting service)
This was a college related project where we chose a website as a reference for our database. I chose Dotabuff, an online match analyzer for Dota 2.
The first part of project required creating a database and filling it with some data. I wrote the complete script inside text editor and created a PHP script which would take the data from OpenDota API (the same one used in DotaNT project) and create suitable SQL DML commands.
Unfortunately, the project required of database to have all normal forms fullfilled (by all I mean the first three). Denormalization was not allowed, thus I had to modify some of the original database script. Forcing a new "Matches_Account_Item" table drastically increased query time (given that each of 10 players can have up to 9 items per match and that there are ~400 matches inside the database, you can see how many potential records are there to be generated instead of simply holding items inside the "Matches_Account" table).
The second part of the project consisted of making several different queries of a different type.
The third and final part consisted of creating various database objects for the database - views, procedures, functions, triggers and scripts which would generate some of the errors like repeatable read and deadlock.
Fairly simple database. On top of the main form, there is a combo box which lists all donors, and upon selecting one of them their information is shown, along with the list of their donations in the grid view below.
To prevent potential accidents, all of the data shown on main form is locked, neither gridview nor user info can be edited from it.
User has an option of adding a donation or donor, which opens up a new form. Before new donation is entered in database, user must select from one of the existing donors to who the donation will be assigned to.
There are 3 reports in database. First one compiles a list of donors, listing their name, address, contact and e-mail. Second one lists all of the currently selected donor's donations. It contains the date of donation, amount and description, along with the number of times donor has donated and the total amount of books he donated. The third and last report makes a list out of all donations, and groups them by the month and year of donation. It contains description, donor name, date of donation and the amount.
The query is for data which needs to be pulled after user selects a donor from combo box.
NotesNT is a simple online note storage created for REST project assignment - it works by sending AJAX requests from pages while behaving according to the incoming responses.
The assignment was given to me by one of the Belgrade's IT companies and it asked of me to implement HTML/JS frontend and REST backend using any programming language or framework.
Nova Tehnika is a ADO.NET based CRUD application which was done as an college assignment. It consisted of creating a conceptual database model, translating it to relational database model, denormalization of it and implementation of CRUD via connected and disconnected architecture using System.Data.SqlClient namespace.


This page should redirect you to
https://sigpwny.github.io/newcomers
or join our SIGPwny Discord at https://discord.gg/cWcZ6a9 and ask for @Thomas


Holds the expansion of the abbreviation when an abbreviation hook function is called. At all other times it contains a null string.
Controls whether abbreviations are expanded. If set to true, abbreviations are checked and expanded as required, otherwise, no expansion takes place. This variable is buffer-specific and its state is displayed in the mode line of each window.
Controls the activity indicator. The activity indicator is a single letter code that is displayed at the bottom left-hand corner of the screen. The various codes are:
- x -- indicates that Emacs is initialising
- i -- indicates that Emacs is waiting for input
- b -- indicates that Emacs is busy working
- c -- indicates that Emacs is checkpointing
- c -- indicates that Emacs is journalling
To make room for the activity indicator, the Mini-buffer is moved over two columns to the right.
When set to true, the journal-recovercommand will update the screen while recovering the contents of a buffer. If animated-journal-recovery is false, the screen is updated after all the journal has been used to recover the buffer.
Controls what the visit-file function does if the buffer name it constructs is already in use. If it is non-zero, Emacs will ask for a new buffer name, or for Return to be typed which will overwrite the old buffer. If the variable is zero, a buffer name will be created by appending n to the buffer name, (where n is a unique sequence number).
ask-about-synchronise-for-none-modified-buffers « 0
Normally the synchronise-files commands always asks the user to confirm any change to a buffer.
If ask-about-synchronise-for-none-modified-buffers is 1 then synchronise-files will not ask for permission to delete or reread the contents of buffers that have not been modified.
auto-fill-hook « default-auto-fill-hook
Controls the calling of a function to fill the current line. The variable is set to the name of the function to be called to fill the line, or the null string if no function is to be called.
automatic-horizontal-scrolling « 0
When automatic-horizontal-scrolling is set to 1 emacs will automatic scroll the current window until dot is visible. Otherwise emacs will allow dot to be horizontally outside of the window.
auto-execute-hook « smart-auto-execute
If none of the auto-execute patterns match the file that has just been loaded then the MLisp function set in auto-execute-hook is called.
See also:


Preparation time
over 2 hours
Cooking time
over 2 hours
Ian's ornate charlotte russe is shaped to resemble Queen Victoria's crown.
For this recipe you will need a 23cm/9in springform cake tin, 4 large baking trays, 3 large piping bags, a 12mm/½in plain nozzle, a medium star nozzle and a small plain nozzle.
Line 4 large baking trays and a 23cm/9in springform cake tin with baking parchment. On one tray draw a 15cm/6in circle and 2 matching semicircles, 1 with a cross attached to the top. Draw 4 matching quarter circles. On 2 baking trays draw 35-40 9cm/3½in long lines spaced well apart. Finally draw a 23cm/9in circle on the remaining tray.
For the savoiardi, beat the egg whites until stiff peaks form when the whisk is removed. Gradually add 200g/7oz caster sugar, beating all the time. Beat for a couple of minutes until thick and well combined.
In a separate bowl, beat the egg yolks with the remaining caster sugar and the vanilla paste until pale and doubled in volume. Carefully fold the yolk mixture into the egg whites. Sift in the flour and carefully fold in.
Preheat the oven to 180C/160C Fan/Gas 4.
Spoon the mixture into a large piping bag fitted with a 12mm/½in plain nozzle. Start piping the shapes onto the templates. For the 23cm/9in circle pipe a spiral starting from the outside into the middle so it is entirely covered in batter (this will make the base). Pipe the outline of the other shapes and then pipe out at least 35 fingers making some of them a bit thinner than most.
Dust all the fingers and shapes with icing sugar and bake for approximately 20 minutes. Once cooked, carefully remove from the trays and set aside to cool on wire racks.
For the compôte, mix the rhubarb, stem ginger and caster sugar together on a baking tray.
For the bavarois cream, put the rhubarb on a baking tray and cover it with 150g/5½oz caster sugar. Roast both the trays of rhubarb for 15 minutes.
Put the milk, vanilla paste, the remaining 100g/3½oz caster sugar and half the cream in a large saucepan and bring to a simmer. Meanwhile, put the egg yolks in a mixing bowl and beat until doubled in volume and pale. Soak the gelatine in a dish of water.
Pour half the hot milk mixture onto the egg yolks, whisking all the time. Return all the mixture back to the pan and gently heat until thick enough to coat the back of a wooden spoon.
Squeeze out any excess water from the gelatine, then add it to the custard and mix thoroughly until dissolved.
Transfer the roasted rhubarb for the bavarois to a blender and pulse until smooth. Put the purée in a sieve and push through into the custard. Stir well and add a few drops of red food dye so it becomes a pale pink colour.
Whip the remaining 400ml/14fl oz double cream until soft peaks form when the whisk is removed. Gently stir into the custard. Put the ice in a large bowl of cold water. Put the saucepan in the iced water to reduce the temperature as quickly as possible. Once cold, put in the fridge until almost set.
For the compôte, soak the gelatine in cold water. Put the roasted rhubarb in a saucepan and gently warm through. Squeeze any excess water from the gelatine then add it to the pan. Stir until the gelatine is dissolved then set aside to cool.
To assemble the russe, line the collar of a 23cm/9in springform tin with baking parchment. Place the large circle of savoiardi on a serving plate and put the collar on top. Trim one end of the savoiardi fingers so they are all the same length.
Make a syrup by gently warming the caster sugar in 50ml/2fl oz water. Keep heating until the sugar is dissolved.
Dip each side of the savoiardi fingers in the syrup. Place the fingers cut-end down around the edge of the springform tin. They should be tightly packed so they remain upright without support. Pour half of the compôte into the bottom of the tin and put it in the fridge until set (alternatively freeze it for 30 minutes to speed up the process).
To assemble the crown that sits on top of the finished russe. Mix up the fondant icing sugar with a dribble of water to make a thick paste. Use this paste to 'glue' together the remaining savoiardi. First stick the quarter-circles together back to back, then stick the two semi-circles together in the same way (with the cross at the top). Allow to set.
When set, use the circle as the base of the crown and balance the semi-circle across the top with the two quarter-circles propping it up up – trim the tops and bottoms of the semi circles and quarter circles if need be. Use the icing to ‘glue’ the pieces into place and allow to set. Cover the paste with cling film.
When set, spray the crown with edible gold spray. Pipe a thin line of fondant along the seams the semi-circles and quarter-circles and top with silver balls.
When the bavarois cream is almost set, pour half of it on top of the compôte (in the ring savoiardi fingers) and put in the fridge or freezer until fully set.
For the ginger jelly, place the ginger in a pan with 400ml/14fl oz water and the sugar. Boil for approximately 5 minutes, then remove from the heat and add the lemon verbena. Set aside to cool slightly.
Soak the gelatine in a bowl of cold water for about 5 minutes. Pass the ginger syrup through a fine sieve. Squeeze any excess moisture from the gelatine then add to the ginger syrup. Chill until needed.
Once the layer of custard is set, put the remaining compôte on top and chill again until set.
When the compôte is set, put two-thirds of the remaining bavarois cream on top and chill to set.
Take the reserved bavarois cream and add a small amount of red food dye. Put it in a piping bag fitted with a small star nozzle and pipe a pattern on top of the custard. Chill to set.
When the ginger jelly is semi set, pour it on top of the layer of set custard. Gently smooth the surface.
To decorate the crown, stick the 2 large 'diamonds' on the centre of each side of the cross using the royal icing to glue them in place. Then use small diamonds to further decorate. Put the russe on a serving plate and remove the springform collar. Place the crown on top.
Put the remaining bavarois cream in a piping bag fitted with star nozzle and pipe stars around the base of the savoiardi fingers.
You need JavaScript to view this clip.
Folding
You need JavaScript to view this clip.
Whipping cream by hand
You need JavaScript to view this clip.
Whisking egg whites


The International Space Education Board (ISEB) program is a wonderful opportunity for students to have privileged access to events during the International Astronautical Congress (IAC), including interactive sessions with astronauts and top space personnels, such as heads of space agencies.
10 European students were awarded the ESA ISEB sponsorship for attending the IAC 2019 in Washington DC.
More information here.


Lua 5.3.2 released
Programando em Lua published
Lua Workshop 2016 to be held in San Francisco
site search


My Files
My Files
Favourites
Favourites
Settings
Settings
Profile
Account Settings
Logout
The Vault
Add New Files
Logout
Are you sure you want to logout?
Logout
Cancel


|
Name |
Institution |
Country |
|---|---|---|
| Anton Ianakiev (Professor) call_made | Nottingham Trent University | UK |
| Nigel Wright (Deputy Vice-Chancellor - Research and Innovation) call_made | Nottingham Trent University | UK |
| Ming Sun (Associate Dean for Research) call_made | Nottingham Trent University | UK |
| Ahmad Galadanci (Researcher) call_made | Nottingham Trent University | UK |
| Giorgio Cucca (Researcher) call_made | Nottingham Trent University | UK |
| Kevin Naik (Researcher) call_made | Nottingham Trent University | UK |
| Shubham (Researcher) call_made | Nottingham Trent University | UK |
| Robin Wiltshire (Technical Director) | BRE | UK |
| Svend Svendsen (Professor) call_made | Denmark Technical University | Denmark |
| Henrik Lund (Professor) call_made | Aalborg Technical University | Denmark |
| Ingo Weidlich (Professor) call_made | HafenCity University, Hamburg | Germany |
| Dr. Dietrich Schmidt | Fraunhofer IWES | Germany |
| Dr. Ralf-Roman Schmidt | Austrian Institute of Technology | Austria |
| Stefan Holler (Professor) call_made | HAWKGottinghen | Germany |
| Lygnerud , Kristina call_made | Halmstad University | Sweden |
| Simon Rees (Professor) call_made | University of Leeds | UK |
| Natasa Nord (Associate Professor) call_made | Norwegian Institute for Science and Technology | Norway |
| Jo Darkwa (Professor) call_made | Nottingham University | UK |
| Dr. Frank Dammel call_made | University of Darmstadt | Germany |
| Karl Ponweiser (Professor) call_made | Technical University Wien | Austria |
| Michael Kauffeld (Professor) call_made | Hochschule Karlsruhe | Germany |
| Dr. Etienne Saloux | CanmetENERGY | Canada |
| Dr. RolandBaviere | CEA tech | France |
| Mark Anderson call_made | ARUP | UK |
| Javier Martín Sanz call_made | Veolia | Spain |
| Ólafur Pétur Pálsson (Professor) call_made | University of Iceland | Iceland |
| Andres Siirde (Professor) call_made | Tallinn University of Technology | Estonia |
| Rolf Ulseth (Senior Adviser) call_made |
Norwegian University of Science and Technology
IEA DHC |
Norway |
| Jianjun Xia (Associate Professor) call_made | Tsinghua University | China |


--- layout: post tags: [Dependency Injection, Miscellaneous, Unit Testing] date: 2010-05-23 16:11:37 UTC title: "Upcoming talks spring 2010" --- {% include JB/setup %}
In the next couple of weeks I will be giving a couple of talks in Copenhagen.
At Community Day 2010 I will be giving two talks on respectively Dependency Injection and TDD.
In early June I will be giving a repeat of my previous CNUG TDD talk.


{{ proto.version | upper | trC('-',' ') }}
This version comprises the following Trello Cards from the IIDB Hypothesis Board
{{ helpers.linkList([ { url: 'https://trello.com/c/BRtH6PNy/70-training-provider-details', text: 'Training provider details (1)' }, { url: 'https://trello.com/c/X3jTi74r/31-users-providing-the-right-employer-contact-details', text: 'User providing the right contact details (1)' }, { url: 'https://trello.com/c/D02x2dUq/58-personal-details-name-etc', text: 'Personal details( 1)' }, { url: 'https://trello.com/c/9wElTVBG/69-dob', text: 'Date of birth (1)' }, { url: 'https://trello.com/c/y91wrJAA/59-telephone-number-sms', text: 'Telephone number and SMS (1)' }, { url: 'https://trello.com/c/9vL58e0z/42-how-the-information-is-being-used-and-shared', text: 'How the information is used and shared (1)' }, { url: 'https://trello.com/c/eFy7cGvh/50-gp-details-name-and-address', text: 'GP Details Name and Address (3)' }, { url: 'https://trello.com/c/7M2nBFjG/34-application-has-been-received-sent', text: 'Application has been received/sent (3)' }, { url: 'https://trello.com/c/hCJ9mqPY/38-contacting-others', text: 'Do you agree to us contacting others (5)' }, { url: 'https://trello.com/c/D314bU2d/36-what-was-the-accident-and-how-did-it-happen', text: 'What was the accident and how did it happen (7)' }, { url: 'https://trello.com/c/jgHemsZi/49-naming-convention', text: 'Challenges surround the name (7)' }, { url: 'https://trello.com/c/AvWI9FWv/29-gov-uk-content', text: 'Looking at Gov.uk content and ways into the service (7)' }, { url: 'https://trello.com/c/OW6tzqv1/24-users-giving-medical-consent-declaration-development', text: 'Consent for access to Medical records (7)' } ]) }}


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
IN THE HIGH COURT OF KERALA AT ERNAKULAM WP(C).No. 3454 of 2009(J) 1. K.P. ANILKUMAR, ... Petitioner Vs 1. STATE OF KERALA, REPRESENTED BY ... Respondent 2. THE MEMEBER SECRETARY,KERALA STATE 3. THE CHIEF ENVIRONMENTAL ENGINEER, 4. THE SECRETARY, ALANGADU GRAMA 5. THE ASSISTANT EXECUTIVE ENGINEER, 6. THE AIR (PREVENTION AND CONTROL OF For Petitioner :SMT.SUMATHY DANDAPANI (SR.) For Respondent : No Appearance The Hon'ble MR. Justice ANTONY DOMINIC Dated :03/02/2009 O R D E R ANTONY DOMINIC, J. ============== W.P.(C) NO. 3454 OF 2009 (J) ==================== Dated this the 3rd day of February, 2009 J U D G M E N T
Petitioner is the Managing Partner of a Dairy Farm. According to the petitioner, although he has all the licences, going by the averments in para 2 of the writ petition itself, the consent issued by the Pollution Control Board was valid only upto 2005. It is stated that since then there has been various inspections and on two occasions, the petitioner also has approached this Court.
2. As at present, the position is that, following the hearing that was conducted pursuant to Ext.P7 judgment, the Board issued Ext.P11, a direction under Section 33 A of the Water (Prevention and Control of Pollution) Act, 1974 requiring the petitioner to close the factory. Aggrieved by Ext.P11, petitioner filed Ext.P12 appeal before the 6th respondent and the said appeal is pending, but however, without any interim orders.
3. In the meantime, records show that there were certain complaints and Ext.P15 shows that there has been a further inspection on 22/1/2009. Noticing that, despite having no consent issued by the Board and ignoring Ext.P11, the unit was functioning, the Board issued Ext.P15, direction under Section 33A of the Act, requiring the 5th respondent to WPC 3454/09 :2 : disconnect the supply of electricity to the Dairy Farm.
4. Counsel submits that Ext.P12 appeal filed against Ext.P11, is scheduled to be heard by the 6th respondent on 5/2/2009 and that in the meanwhile, status quo as regards supply of power should be maintained.
5. In so far as the continuance of power supply is concerned, the disconnection is ordered by Ext.P15 and the validity of Ext.P15 has to be judged on the facts as stated in Ext.P15 itself. It is seen from the said order that the unit was ordered to be closed by Ext.P11 dated 18/12/2008. Subsequently, an inspection was conducted on 22/1/2009 and the unit was found to be functioning. It was in these circumstances the said direction has been issued. Admittedly, the unit does not have a consent issued in its favour since 2006. The functioning of the unit is also admitted by the petitioner and the details of the transaction as seen from Ext.P14 also supports this conclusion.
6. Resultantly, it can be seen that since 2006, the unit has been functioning without consent and that despite Ext.P11 order of closure issued on 18/12/2008, unit continued to function even on 22/1/2009, when the inspection was conducted. If that be so, Ext.P15 order cannot be faulted.
7. However, having regard to the fact that Ext.P12 appeal filed by WPC 3454/09 :3 : the petitioner against Ext.P11 order is pending and that the mater is now scheduled to be heard on 5/2/2009, I direct the 6th respondent to hear the appeal and dispose of the matter without any delay.
Writ petition is disposed of as above.
ANTONY DOMINIC, JUDGE Rp


Programm ‚Test of Non-random Distributions‚:
This programme separates significant and random distributions of orientation data. It uses the method of WOODCOCK & NAYLOR(1983).
For separation the eigenvalues of the orientation tensor and the number of data of a data set are used.


Accounting Rule Modify
Rule Name
Office
Description
Debit Rule Type
Fixed Debit Account
Debit Account Tag
Is Allow Multiple Debit Entries ?
Credit Rule Type
Fixed Credit Account
Credit Account Tag
Is Allow Multiple Credit Entries ?


Hello, stranger!
Welcomer to Runners Home
TM
Runners Home
TM
is dedicated to providing you with:
the most up-to date information on running races.
the best resources for runners.


Note
This tutorial was generated from a Jupyter notebook that can be downloaded here.
Exposure time integration¶
Here we’ll briefly discuss how to account for finite exposure time integration, which tends to smooth out occultation light curves. Unfortunately, there’s no analytic way (that I know of) to tackle this, so the thing to do is to oversample the light curve on a fine time grid and numerically integrate over the exposure window.
[3]:
import numpy as np
import starry
starry.config.lazy = False
starry.config.quiet = True
Creating a star-planet system¶
Let’s instantiate a simple Primary
object:
[4]:
star = starry.Primary(starry.Map(ydeg=0, udeg=2, amp=1.0), m=1.0, r=1.0)
And let’s give it some limb darkening:
[5]:
star.map[1] = 0.40
star.map[2] = 0.26
Here’s what that looks like:
[6]:
star.map.show()
Let’s now create a featureless hot Jupiter:
[7]:
planet = starry.kepler.Secondary(
starry.Map(2, amp=0), m=0, r=0.1, porb=1.0, ecc=0.3, w=30, t0=0,
)
Now that we have a star and a planet, we can instantiate the planetary system. By default, exposure time integration is disabled.
[8]:
sys = starry.System(star, planet)
Computing a transit light curve¶
We’re ready to compute a transit light curve. Let’s do this over 1000 cadences between \(t=-0.1\) and \(t=0.1\).
[10]:
%%time
time = np.linspace(-0.1, 0.1, 1000)
flux = sys.flux(time)
CPU times: user 5.21 ms, sys: 139 µs, total: 5.35 ms
Wall time: 4.18 ms
Cool – starry
computed 1,000 cadences in just a few ms. Let’s check it out:
[11]:
plt.plot(time, flux)
plt.xlabel("time [days]")
plt.ylabel("system flux");
Ok, now let’s enable exposure time integration. We have to instantiate a new System
object for this:
[12]:
sys_exp = starry.System(star, planet, texp=0.01, oversample=9, order=0)
We passed in the three keywords controlling exposure time integration. The first is texp
, the length of the exposure window in sys_exp.time_unit
(usually days). The second is oversample
, the factor by which the light curve is oversampled. The larger this number, the more accurate the model will be, at the cost of extra computation time. Finally, order
controls the order of the numerical integration: 0
for a centered Riemann sum (equivalent to the “resampling” procedure
suggested by Kipping 2010), 1
for the trapezoid rule, or 2
for Simpson’s rule.
Let’s compute the flux (and time the computation):
[14]:
%%time
flux_exp = sys_exp.flux(time)
CPU times: user 10.8 ms, sys: 0 ns, total: 10.8 ms
Wall time: 10.3 ms
That was a factor of a few slower than the original evaluation, but it’s not bad. Here’s the comparison of the two light curves:
[15]:
plt.plot(time, flux, label=r"$t_{exp} = 0$")
plt.plot(time, flux_exp, label=r"$t_{exp} = 0.01$")
plt.legend()
plt.xlabel("time [days]")
plt.ylabel("system flux");
Computing a phase curve¶
Exposure time integration also affects phase curves. Let’s give the planet a random map and compute its phase curve with and without exposure time integration. We’ll make the planet’s rotational period really short so we can clearly tell the difference between the two:
[16]:
planet.map.amp = 0.1
planet.prot = 0.05
planet.map[1:, :] = 0.1 * np.random.randn(planet.map.Ny - 1)
[17]:
planet.map.show()
Let’s grab just the planet flux (by passing total=False
to the flux
method and keeping only the second vector):
[18]:
%%time
flux = sys.flux(time, total=False)[1]
CPU times: user 4.55 ms, sys: 50 µs, total: 4.6 ms
Wall time: 3.74 ms
[19]:
%%time
flux_exp = sys_exp.flux(time, total=False)[1]
CPU times: user 8.87 ms, sys: 77 µs, total: 8.95 ms
Wall time: 8.56 ms
Here are the two light curves; it’s clear that the finite exposure time has smoothed out the phase curve.
[20]:
plt.plot(time, flux, label=r"$t_{exp} = 0$")
plt.plot(time, flux_exp, label=r"$t_{exp} = 0.01$")
plt.legend()
plt.xlabel("time [days]")
plt.ylabel("planet flux");


| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.io.output; | |
| 18 | ||
| 19 | import java.io.FilterOutputStream; | |
| 20 | import java.io.IOException; | |
| 21 | import java.io.OutputStream; | |
| 22 | ||
| 23 | /** | |
| 24 | * OutputStream which breaks larger output blocks into chunks. | |
| 25 | * Native code may need to copy the input array; if the write buffer | |
| 26 | * is very large this can cause OOME. | |
| 27 | * | |
| 28 | * @since 2.5 | |
| 29 | */ | |
| 30 | public class ChunkedOutputStream extends FilterOutputStream { | |
| 31 | ||
| 32 | /** | |
| 33 | * The default chunk size to use, i.e. {@value} bytes. | |
| 34 | */ | |
| 35 | private static final int DEFAULT_CHUNK_SIZE = 1024 * 4; | |
| 36 | ||
| 37 | /** | |
| 38 | * The maximum chunk size to us when writing data arrays | |
| 39 | */ | |
| 40 | private final int chunkSize; | |
| 41 | ||
| 42 | /** | |
| 43 | * Creates a new stream that uses the specified chunk size. | |
| 44 | * | |
| 45 | * @param stream the stream to wrap | |
| 46 | * @param chunkSize the chunk size to use; must be a positive number. | |
| 47 | * @throws IllegalArgumentException if the chunk size is <= 0 | |
| 48 | */ | |
| 49 | public ChunkedOutputStream(final OutputStream stream, final int chunkSize) { | |
| 50 | super(stream); | |
| 51 |
2
1. 2. |
if (chunkSize <= 0) { |
| 52 | throw new IllegalArgumentException(); | |
| 53 | } | |
| 54 | this.chunkSize = chunkSize; | |
| 55 | } | |
| 56 | ||
| 57 | /** | |
| 58 | * Creates a new stream that uses a chunk size of {@link #DEFAULT_CHUNK_SIZE}. | |
| 59 | * | |
| 60 | * @param stream the stream to wrap | |
| 61 | */ | |
| 62 | public ChunkedOutputStream(final OutputStream stream) { | |
| 63 | this(stream, DEFAULT_CHUNK_SIZE); | |
| 64 | } | |
| 65 | ||
| 66 | /** | |
| 67 | * Writes the data buffer in chunks to the underlying stream | |
| 68 | * | |
| 69 | * @param data the data to write | |
| 70 | * @param srcOffset the offset | |
| 71 | * @param length the length of data to write | |
| 72 | * | |
| 73 | * @throws IOException if an I/O error occurs. | |
| 74 | */ | |
| 75 | @Override | |
| 76 | public void write(final byte[] data, final int srcOffset, final int length) throws IOException { | |
| 77 | int bytes = length; | |
| 78 | int dstOffset = srcOffset; | |
| 79 |
2
1. write : changed conditional boundary → TIMED_OUT 2. write : negated conditional → KILLED |
while(bytes > 0) { |
| 80 | final int chunk = Math.min(bytes, chunkSize); | |
| 81 |
1
1. write : removed call to java/io/OutputStream::write → KILLED |
out.write(data, dstOffset, chunk); |
| 82 |
1
1. write : Replaced integer subtraction with addition → KILLED |
bytes -= chunk; |
| 83 |
1
1. write : Replaced integer addition with subtraction → KILLED |
dstOffset += chunk; |
| 84 | } | |
| 85 | } | |
| 86 | ||
| 87 | } | |
Mutations | ||
| 51 |
1.1 2.2 |
|
| 79 |
1.1 2.2 |
|
| 81 |
1.1 |
|
| 82 |
1.1 |
|
| 83 |
1.1 |


Photo captured by Oliver Conway on Unsplash
Photo captured by Bogomil Mihaylov on Unsplash
Photo captured by Jörg Angeli on Unsplash
Photo captured by Giuseppe Famiani on Unsplash
Photo captured by Mohammad Alizade on Unsplash
Photo captured by Pierre-Yves Burgi on Unsplash
Photo captured by Artiom Vallat on Unsplash


|
Java Management Extensions (JMX) Technology OverviewJava Management Extensions (JMX)
|
| Contents | Previous | Next |
1. Introduction to JMX Technology
Instrumenting Resources Using MBeans
3. Instrumenting Your Resources for JMX Technology
Java Virtual Machine Instrumentation
Protocol Adaptors and Connectors
5. Using JMX Connectors to Manage Resources Remotely
6. Discovery and Lookup Services
Getting Started With Lookup Services
Using the Service Location Protocol (SLP)
Using the Jini Network Technology
Using the Java Naming and Directory Interface (JNDI) API With an LDAP Backend
Java Management Extensions (JMX) Instrumentation and Agent Specification (JSR 3)
JMX Remote API Specification (JSR 160)
| Contents | Previous | Next |


Campaign highlights: Sturgeon and Johnson press the flesh out on the trail
Meanwhile, the former leader of the Liberal Democrats thinks a hung parliament is the most likely outcome on December 12.
Jeremy Corbyn was joined by senior party figures to hammer out the final details of the Labour manifesto amid mounting divisions over what stance will be taken on immigration.
Meanwhile, Boris Johnson went door-knocking in Mansfield and Nicola Sturgeon met voters and activists in Arbroath.
Here are some of the highlights of Saturday’s campaign trail:
– The Metropolitan Police is assessing allegations of electoral fraud
Scotland Yard said it received two allegations of electoral fraud and malpractice after claims the Tories offered peerages to senior Brexit Party figures to persuade them to stand down in the General Election.
Lord Falconer wrote to the Metropolitan Police Commissioner and the Director of Public Prosecutions calling for a probe into what he said were “exceptionally serious allegations”.
The Labour former lord chancellor said it should be investigated as a matter of urgency and must be looked at by police in order to maintain public confidence in the integrity of the election.
– A hung parliament, a referendum and another general election ahead, Sir Vince Cable predicts
The former leader of the Liberal Democrats thinks a hung parliament is the most likely outcome – “but hung in a different way, with more of us and more SNP”, he said.
Asked if a hung parliament means Mr Corbyn would get into Number 10, Sir Vince told Sophy Ridge on Sky News: “No it doesn’t and we’ve been absolutely clear we couldn’t possibly allow that to happen.
“It would probably be some more neutral figure and then leading into a referendum to resolve the Brexit issue and another general election soon after that.”
– The Conservatives and the Lib Dems are in competition over who will plant the most trees
Lib Dem leader Jo Swinson has insisted her party’s pledge to plant 60 million trees a year if it wins power is realistic.
The Lib Dems moved to put the environment at the centre of the election campaign as they doubled the 30 million tree-planting promise put forward by the Conservatives.
Meanwhile, former environment secretary Michael Gove blamed the Common Agricultural Policy for the Government not being able to meet its targets for planting trees.
– A Brexit Party MEP said that with the benefit of “hindsight”, maybe his party should not have stood down 317 candidates
Ben Habib has suggested his party may have made the wrong decision in standing down so many candidates.
“Well I think with the benefit of hindsight maybe we shouldn’t have stood 317 candidates down, with the benefit of hindsight, because the Tories haven’t responded positively to it.
“They haven’t stood down and assured a proper Leave mandate in Parliament,” he told Sophy Ridge on Sky News, adding that he will be surprised is his party does not win “at least five” seats.
– The Prime Minister can expect an unpleasant letter from a Mansfield resident if he does not deliver on his Brexit promise
Susan Kitchen, 71, held her dog Peggy while speaking to the PM about the UK’s withdrawal from the EU, as he knocked on doors in a bid to boost the election cause of Tory candidate Ben Bradley.
She told the PA news agency: “I told him I was worried about the deal he was making and asked him specifically if their laws could overrule our laws because that’s what I’ve heard.
“He said no, absolutely not, so I says to him if you’re wrong I’m going to write you a letter – and it won’t be pleasant.”
Tweet of the day
Jeremy Corbyn has hit back at Boris Johnson’s claim his plans to nationalise the UK’s broadband network are a “crazed communist scheme”.
Picture of the day
Video of the latest polling positions for the major parties
Here is a round-up of the average polling for the major UK parties over the past seven days.
What’s next?


Embedded Programming
Week 7 assignment is to program the hello board we build in the previous week of electronic design.
We have also to try to program this board with different method.
I do a lot of program in C but on other microcontroller like Microchip and MSP430 from TexasIinstrument.
But different compiler have different instruction set, semantics, and peripheral control.
For this reason, first of all I search a tutorial on AVR-GCC programming language and programming technique.
I found a useful tutorial that you can find below: in it there are all the thing I need to use makefile and learn a little about C programming for Atmel compiler.
Download the PDF tutorial AVR-GCC
Searching in the tutorial PDF I found a way to make a simple program who light up and turn of the led in toggle when the button is pressed, and it make a denounce on the button press event.
Firs of all I take a look at the make file (copied from the tutorial and the FabAcademy tutorial) I have modified in the file the name of the C file to build it with makefile.
PROJECT=debounceled
SOURCES=$(PROJECT).c
MMCU=attiny44
F_CPU = 20000000
CFLAGS=-mmcu=$(MMCU) -Wall -Os -DF_CPU=$(F_CPU)
$(PROJECT).hex: $(PROJECT).out
avr-objcopy -O ihex $(PROJECT).out $(PROJECT).c.hex;\
avr-size --mcu=$(MMCU) --format=avr $(PROJECT).out
$(PROJECT).out: $(SOURCES)
avr-gcc $(CFLAGS) -I./ -o $(PROJECT).out $(SOURCES)
program-bsd: $(PROJECT).hex
avrdude -p t44 -c bsd -U flash:w:$(PROJECT).c.hex
program-dasa: $(PROJECT).hex
avrdude -p t44 -P /dev/ttyUSB0 -c dasa -U flash:w:$(PROJECT).c.hex
program-avrisp2: $(PROJECT).hex
avrdude -p t44 -P usb -c avrisp2 -U flash:w:$(PROJECT).c.hex
program-avrisp2-fuses: $(PROJECT).hex
avrdude -p t44 -P usb -c avrisp2 -U lfuse:w:0x5E:m
program-usbtiny: $(PROJECT).hex
avrdude -p t44 -P usb -c usbtiny -U flash:w:$(PROJECT).c.hex
program-usbtiny-fuses: $(PROJECT).hex
avrdude -p t44 -P usb -c usbtiny -U lfuse:w:0x5E:m
program-dragon: $(PROJECT).hex
avrdude -p t44 -P usb -c dragon_isp -U flash:w:$(PROJECT).c.hex
And here is the file C of my simple project.
#include < avr/io.h>
#include < inttypes.h>
#ifndef F_CPU
#define F_CPU 20000000UL
/* quartz with 20 MHz */
#endif
#include < avr/delay.h>
/* defines _delay_ms () off avr libc version 1.2.0 */
inline uint8_t debounce(volatileuint8_t *port, uint8_t pin)
{
if(!(*port &(1<< pin)))
{
/* pin was pulled on mass, 100ms waits */
_delay_ms(100);
if(*port &(1<< pin))
{
/* give user time for releasing the button */
_delay_ms(100);
return 1;
}
}
return 0;
}
int main (void)
{
DDRA &= ~(1 << PA3); /* pin PB0 on input (button)*/
PORTA |=(1<< PA3); /* Pull-up resistance activate */
if(debounce(&PINA, PA3)) /* case button pressed to pin PB0..*/
PORTA = PINA ^ (1<< PA7); /* .. LED at Port PA7 on and/or switch off */
}
Download folder with the project
Here the terminal output of the programming via Fabisp of the fuses and after of the flash program.
Simone@ZIMOX:debounceled Simone$ sudo make program-usbtiny-fuses
Password:
avr-objcopy -O ihex debounceled.out debounceled.c.hex;\
avr-size --mcu=attiny44 --format=avr debounceled.out
AVR Memory Usage
----------------
Device: attiny44
Program: 166 bytes (3.8% Full)
(.text + .data + .bootloader)
Data: 0 bytes (0.0% Full)
(.data + .bss + .noinit)
avrdude -p t44 -P usb -c usbtiny -U lfuse:w:0x5E:m
avrdude: AVR device initialized and ready to accept instructions
Reading | ################################################## | 100% 0.00s
avrdude: Device signature = 0x1e9207
avrdude: reading input file "0x5E"
avrdude: writing lfuse (1 bytes):
Writing | ################################################## | 100% 0.00s
avrdude: 1 bytes of lfuse written
avrdude: verifying lfuse memory against 0x5E:
avrdude: load data lfuse data from input file 0x5E:
avrdude: input file 0x5E contains 1 bytes
avrdude: reading on-chip lfuse data:
Reading | ################################################## | 100% 0.00s
avrdude: verifying ...
avrdude: 1 bytes of lfuse verified
avrdude: safemode: Fuses OK (E:FF, H:DF, L:5E)
avrdude done. Thank you.
Simone@ZIMOX:debounceled Simone$ sudo make program-usbtiny
avr-objcopy -O ihex debounceled.out debounceled.c.hex;\
avr-size --mcu=attiny44 --format=avr debounceled.out
AVR Memory Usage
----------------
Device: attiny44
Program: 166 bytes (3.4% Full)
(.text + .data + .bootloader)
Data: 0 bytes (0.0% Full)
(.data + .bss + .noinit)
avrdude -p t44 -P usb -c usbtiny -U flash:w:debounceled.c.hex
avrdude: AVR device initialized and ready to accept instructions
Reading | ################################################## | 100% 0.01s
avrdude: Device signature = 0x1e9207
avrdude: NOTE: "flash" memory has been specified, an erase cycle will be performed
To disable this feature, specify the -D option.
avrdude: erasing chip
avrdude: reading input file "debounceled.c.hex"
avrdude: input file debounceled.c.hex auto detected as Intel Hex
avrdude: writing flash (166 bytes):
Writing | ################################################## | 100% 0.26s
avrdude: 166 bytes of flash written
avrdude: verifying flash memory against debounceled.c.hex:
avrdude: load data flash data from input file debounceled.c.hex:
avrdude: input file debounceled.c.hex auto detected as Intel Hex
avrdude: input file debounceled.c.hex contains 166 bytes
avrdude: reading on-chip flash data:
Reading | ################################################## | 100% 0.43s
avrdude: verifying ...
avrdude: 166 bytes of flash verified
avrdude: safemode: Fuses OK (E:FF, H:DF, L:5E)
avrdude done. Thank you.
All works fine and properly
After that I try to program the hello board with the Arduino IDE, for this reason I found a useful link with a tutorial to set all things in the IDE.
Here the tutorial to use FabISP as a programmer in the Arduino IDE and to set all the data for the attiny44
Afther following all the step to set the IDE to work properly i try to upload some example sketch and i make some of mine.
In the tools dropdown menu we have to select the USBtinyISP as a programmer, attiny as a device and 20Mhz as external clock.
The next slide show the program i made making some changes in the pins and settings
fading of 2 led in opposite direction
int led2 = 8; // the pin that the LED is attached to
int led1 = 7;
int brightness = 0; // how bright the LED is
int fadeAmount = 5; // how many points to fade the LED by
// the setup routine runs once when you press reset:
void setup() {
// declare pin 9 to be an output:
pinMode(led1, OUTPUT);
pinMode(led2, OUTPUT);
}
// the loop routine runs over and over again forever:
void loop() {
// set the brightness of pin 9:
analogWrite(led1, brightness);
analogWrite(led2, 255 - brightness);
// change the brightness for next time through the loop:
brightness = brightness + fadeAmount;
// reverse the direction of the fading at the ends of the fade:
if (brightness == 0 || brightness == 255) {
fadeAmount = -fadeAmount ;
}
// wait for 30 milliseconds to see the dimming effect
delay(30);
}
3 led rolling and changing frequency of the rolling at press of the button
const int buttonPin = 3; // the number of the pushbutton pin
int buttonState = 0; // variable for reading the pushbutton status
int timedelay =100;
// the setup function runs once when you press reset or power the board
void setup() {
// initialize digital pin 13 as an output.
pinMode(2, OUTPUT);
pinMode(7, OUTPUT);
pinMode(8, OUTPUT);
pinMode(buttonPin, INPUT);
}
// the loop function runs over and over again forever
void loop() {
buttonState = digitalRead(buttonPin);
if (buttonState == LOW) {
// turn LED on:
timedelay=timedelay+100;
if (timedelay >500) {
timedelay=100;
}
}
digitalWrite(2, HIGH); // turn the LED on (HIGH is the voltage level)
delay(timedelay); // wait for a second
digitalWrite(2, LOW); // turn the LED off by making the voltage LOW
delay(timedelay); // wait for a second
digitalWrite(7, HIGH); // turn the LED on (HIGH is the voltage level)
delay(timedelay); // wait for a second
digitalWrite(7, LOW); // turn the LED off by making the voltage LOW
delay(timedelay); // wait for a second
digitalWrite(8, HIGH); // turn the LED on (HIGH is the voltage level)
delay(timedelay); // wait for a second
digitalWrite(8, LOW); // turn the LED off by making the voltage LOW
delay(timedelay); // wait for a second
}
Download folder with the project for arduino IDE
After some text i found the delay time is not properly settend, it means thaht i put one second of delay and it will take like 20 second to change, i try to debug this and i found thaht it can be maybe a wrong calculation in the delay time with the attiny liubrary so i have to set the file of the clock speed og the attyny44 to 1Mhz instead of 20Mhz in the C:\Program Files\Arduino\hardware\attiny\avr\board.txt
attiny.menu.clock.external20=20 MHz (external)
attiny.menu.clock.external20.bootloader.low_fuses=0xfe
attiny.menu.clock.external20.bootloader.high_fuses=0xdf
attiny.menu.clock.external20.bootloader.extended_fuses=0xff
attiny.menu.clock.external20.build.f_cpu=1000000L


A Few More Things About Me...
If you're on this page that means you're curious to learn more about me, so I'll start by telling you a little more about my life. I have lived in Milford Massachusetts my entire life with my
Mom, Dad, and my younger sister Abby. From a young age I always had a love for electronics and I would go out of my way
to surround myself in them. Whether it was video games, or going inside of my Dad's old computers, they have always been
an important hobbie of mine along with the list of my other hobbies on the Home page.
Through my three years spent in this shop it has given me many oppurtunities to learn more about the things that interest me the most, Computers.
All the teaching I have recieved has allowed me to become well-educated in the field of IT; even to the point where I have built my own personal gaming computer.
Shop has definitly been an important piece in my life that is helping me push forward towords my goal of working in Cyber Security when I graduate.
As for my aspiration for the future, my dream job would have to be working around the things I love the most, which is computers. Specifically Cyber Security is what I am interest in the most.
I do believe that having some form of a College Education is very important to having a successful life and career, but my plans for out of High School is to jump right into the work force.
I'm currently working towords my CCENT Certification and during my Senior year I plan to go for my CCNA. In order to get this far ahead of the game I plan on taking the Cisco III course over
the summer in order to be able to complete Cisco IV during my final year of High School.


My Movie List
New Movie
Name
Image
Action
Adventure
Animation
Comedy
Detective
Fantasy
History
Horror
Musical
Pirate
Romantic
SCI-FI
War
Western
Release
save
clear list