WHO(1) User Commands WHO(1) NAME who - show who is logged on SYNOPSIS who [OPTION]... [ FILE | ARG1 ARG2 ] DESCRIPTION Print information about users who are currently logged in. -a, --all same as -b -d --login -p -r -t -T -u -b, --boot time of last system boot -d, --dead print dead processes -H, --heading print line of column headings --ips print ips instead of hostnames. with --lookup, canonicalizes based on stored IP, if available, rather than stored hostname -l, --login print system login processes --lookup attempt to canonicalize hostnames via DNS -m only hostname and user associated with stdin -p, --process print active processes spawned by init -q, --count all login names and number of users logged on -r, --runlevel print current runlevel -s, --short print only name, line, and time (default) -t, --time print last system clock change -T, -w, --mesg add user's message status as +, - or ? -u, --users list users logged in --message same as -T --writable same as -T --help display this help and exit --version output version information and exit If FILE is not specified, use /var/run/utmp. /var/log/wtmp as FILE is common. If ARG1 ARG2 given, -m presumed: `am i' or `mom likes' are usual. AUTHOR Written by Joseph Arceneaux, David MacKenzie, and Michael Stone. REPORTING BUGS Report who bugs to<EMAIL_ADDRESS>GNU coreutils home page: <http://www.gnu.org/software/coreutils/> General help using GNU software: <http://www.gnu.org/gethelp/> Report who translation bugs to <http://translationproject.org/team/> COPYRIGHT Copyright © 2011 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>. This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. SEE ALSO The full documentation for who is maintained as a Texinfo manual. If the info and who programs are properly installed at your site, the command info coreutils 'who invocation' should give you access to the complete manual. GNU coreutils 8.12.197-032bb September 2011 WHO(1)


For a large aspect-ratio, circular cross section tokamak, the on a magnetic surface is nearly constant, . The poloidal angle dependence of the magnetic field can be neglected, i.e., , and . Using these, the safety factor in Eq. (29) is approximated to
| (503) |


Financial Statements
GL Account Summary
Running Balances
Balance Sheet
Account Analysis/Summary
General Ledger
Chart Of Accounts
General Ledger
General Ledger Trial Balance
Reports And Financial Statements
Current Filter:
{{journalFilter.description}}
Filter By
Accounting Period
Search Query
Today
Yesterday
This Week
This Month
This Quarter
This Year
Specify Date Range
Select Period
{{period.PeriodAlias}}
Pick Date Ranges
Enter Search Query
Set Filter


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 4
Dietary
For the green curry paste, place all of the paste ingredients into a mortar and pound with a pestle until they form a paste. (You will not need all of the paste; store unused portion in a tightly covered jar in the fridge for up to two weeks.).
For the skewers, mix three tablespoons of the green curry paste together with one tablespoon of the groundnut oil until well combined.
Cut the tofu and aubergine into 1.25cm/½ inch cubes and thread onto the wooden skewers, alternating the tofu and aubergine along the skewer. Lay the skewers flat on a plate and pour over the curry paste mixture to coat well, rubbing the aubergine and tofu all over. Cover with cling film and leave to marinate for at least 30 minutes, or overnight if possible, in the fridge.
Preheat the grill to medium.
Brush the vegetables with the remaining groundnut oil and cook under the grill for 8-10 minutes, turning once, or until the skewers are golden-brown all over. Set aside.
For the satay sauce, heat the oil in a small pan and fry the shallot, garlic, chillies and spices for 4-5 minutes, or until the shallot and garlic are softened.
Mix the peanut butter with a little warm water to make a thinner paste and add to the pan, followed by the coconut milk. Bring to the boil, then simmer for 6-8 minutes, or until the sauce thickens. Season, to taste, with lime juice and salt. Divide the sauce equally among four smalll bowls.
Serve the skewers on individual plates with a small bowl of satay sauce on the side.


| Interface | Description |
|---|---|
| CollectionContainer<T> | |
| CollectionContainerVisitor<T> | |
| Internals | |
| Internals.Pointer<K,V> |
a marker interface for objects that identify contained maps - so that
getting the keys of a specific map does not require a specific method for
each map nor does it require the map to be copied and returned
|
| Internals.SimplePointer<K> |
a marker interface for objects that identify contained sets
|
| OWLDataFactoryInternals |
| Class | Description |
|---|---|
| AbstractInMemOWLOntologyFactory |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Nov-2006 |
| AbstractInternalsImpl |
this class encapsulates all lazily built indexes
|
| ClassAxiomByClassPointer | |
| EmptyInMemOWLOntologyFactory |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Nov-2006 |
| ImplUtils |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 16-Mar-2007 |
| InitVisitorFactory | |
| InitVisitorFactory.InitCollectionVisitor<K> | |
| InitVisitorFactory.InitIndividualVisitor<K extends OWLObject> | |
| InitVisitorFactory.InitVisitor<K> | |
| InternalsImpl | |
| InternalsNoCache | |
| MapPointer<K,V extends OWLAxiom> | |
| OWL2DatatypeImpl |
Author: Matthew Horridge
Stanford University Bio-Medical Informatics Research Group Date: 24/10/2012 |
| OWLAnnotationAssertionAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 25-Nov-2006 |
| OWLAnnotationImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 19-Dec-2006 |
| OWLAnnotationPropertyDomainAxiomImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLAnnotationPropertyImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 14-Jan-2009 |
| OWLAnnotationPropertyRangeAxiomImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLAnonymousClassExpressionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLAnonymousIndividualImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 15-Jan-2009 |
| OWLAsymmetricObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLCardinalityRestrictionImpl<R extends OWLPropertyRange,P extends OWLPropertyExpression<R,P>,F extends OWLPropertyRange> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLClassAssertionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLClassAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 05-Dec-2006 |
| OWLClassExpressionImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 29-Dec-2009 |
| OWLClassImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 25-Oct-2006 |
| OWLDataAllValuesFromImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataCardinalityRestrictionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataComplementOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataExactCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataFactoryImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataFactoryInternalsImpl | |
| OWLDataHasValueImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataIntersectionOfImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLDataMaxCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataMinCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataOneOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataPropertyAssertionAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataPropertyCharacteristicAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataPropertyDomainAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataPropertyImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataPropertyRangeAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataSomeValuesFromImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDatatypeDefinitionAxiomImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 24-Mar-2009 |
| OWLDatatypeImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDatatypeRestrictionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDataUnionOfImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLDeclarationAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDifferentIndividualsAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDisjointClassesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDisjointDataPropertiesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDisjointObjectPropertiesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLDisjointUnionAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLEntityCollectionContainerCollector |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 13-Nov-2006 A utility class that visits axioms, class expressions etc. |
| OWLEquivalentClassesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLEquivalentDataPropertiesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLEquivalentObjectPropertiesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLFacetRestrictionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 11-Jan-2007 |
| OWLFunctionalDataPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLFunctionalObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLHasKeyAxiomImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLImportsDeclarationImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLIndividualAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 05-Dec-2006 |
| OWLIndividualImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 25-Oct-2006 |
| OWLIndividualRelationshipAxiomImpl<P extends OWLPropertyExpression<?,?>,O extends OWLPropertyAssertionObject> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLInverseFunctionalObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLInverseObjectPropertiesAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 29-Nov-2006 |
| OWLIrreflexiveObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImplBoolean |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImplDouble |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImplFloat |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImplInteger |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLiteralImplNoCompression |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLLogicalAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 05-Dec-2006 |
| OWLNamedIndividualImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 15-Jan-2009 |
| OWLNaryBooleanClassExpressionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLNaryClassAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLNaryDataRangeImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 17-Jan-2009 |
| OWLNaryIndividualAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLNaryPropertyAxiomImpl<P extends OWLPropertyExpression<?,?>> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLNegativeDataPropertyAssertionImplAxiom |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLNegativeObjectPropertyAssertionAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectAllValuesFromImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectCardinalityRestrictionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectComplementOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectExactCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectHasSelfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectHasValueImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 25-Oct-2006 |
| OWLObjectIntersectionOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectInverseOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectMaxCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectMinCardinalityImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectOneOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyAssertionAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyCharacteristicAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyDomainAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyExpressionImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectPropertyRangeAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectSomeValuesFromImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLObjectUnionOfImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLOntologyImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLOntologyIRIMapperImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 14-Nov-2006 Manual IRI mapper |
| OWLOntologyManagerImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 27-Oct-2006 |
| OWLPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 05-Dec-2006 |
| OWLPropertyDomainAxiomImpl<P extends OWLPropertyExpression<?,?>> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLPropertyExpressionImpl<R extends OWLPropertyRange,P extends OWLPropertyExpression<R,P>> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLPropertyRangeAxiomImpl<P extends OWLPropertyExpression<?,?>,R extends OWLPropertyRange> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLQuantifiedDataRestrictionImpl | |
| OWLQuantifiedObjectRestrictionImpl | |
| OWLQuantifiedRestrictionImpl<R extends OWLPropertyRange,P extends OWLPropertyExpression<R,P>,F extends OWLPropertyRange> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLReflexiveObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLRestrictionImpl<R extends OWLPropertyRange,P extends OWLPropertyExpression<R,P>,F> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSameIndividualAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSubAnnotationPropertyOfAxiomImpl |
Author: Matthew Horridge
The University of Manchester Information Management Group Date: 25-Mar-2009 |
| OWLSubClassOfAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSubDataPropertyOfAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSubObjectPropertyOfAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSubPropertyAxiomImpl<P extends OWLPropertyExpression<?,?>> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLSubPropertyChainAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 22-Nov-2006 |
| OWLSymmetricObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLTransitiveObjectPropertyAxiomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLUnaryPropertyAxiomImpl<P extends OWLPropertyExpression<?,?>> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| OWLValueRestrictionImpl<R extends OWLPropertyRange,P extends OWLPropertyExpression<R,P>,V extends OWLObject> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 26-Oct-2006 |
| ParsableOWLOntologyFactory |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 14-Nov-2006 An ontology factory that creates ontologies by parsing documents containing concrete representations of ontologies. |
| SWRLAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLBinaryAtomImpl<A extends SWRLArgument,B extends SWRLArgument> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLBuiltInAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLClassAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLDataPropertyAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLDataRangeAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLDifferentIndividualsAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 18-Feb-2007 |
| SWRLIndividualArgumentImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLLiteralArgumentImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLObjectPropertyAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLRuleImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLSameIndividualAtomImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 18-Feb-2007 |
| SWRLUnaryAtomImpl<A extends SWRLArgument> |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| SWRLVariableImpl |
Author: Matthew Horridge
The University Of Manchester Bio-Health Informatics Group Date: 15-Jan-2007 |
| Enum | Description |
|---|---|
| OWLDataFactoryInternalsImpl.Buildable |


Introduction
Hello everyone! My name is Matt and this is my webpage for my Code201 class for CodeFellows. My hobbies include playing video games and watching anime.Education History
- CodeFellows (2021-Present)
- University of Washington (2010-2018)
Job History
- Senior Game Advisor - Gamestop
- Customer Specialist - Best Buy
- Cashier/Night Stocker - Costco
Goals
- Learn to Code
- Land a Job
- Retire
Top ten places I want to visit:
- Mont Saint Michel - France
- Neushwanstein Castle - Germany
- Sapporo Snow Festival - Japan
- Villa Escudero - Phillipines
- Cenote Ik Kil, Yucatan Peninsula - Mexico
- Civita di Bagnoregio - Italy
- Belogradchik - Bulgaria
- Murren - Switzerland
- Cable car at Gelmerbahn - Switzerland
- Quinta Da Ragaleira - Portugal


All About Me!
Home
This is me:
I am a married 21 year old from South Jordan, Utah. I am currently a student at Neumont College and I work part-time at a golf course called Mountain View Golf Course. My family is my wife and I, we live in South Jordan, Utah.
This is my Partner in Crime:
Kirsten is currently a student at Utah Valley University. She is on the dance team for UVU and is studying to be a nurse. She loves the outdoors and tries to make everything she does the funnest thing ever.
How we Met:
Kirsten's cousin, Wyatt, is one of my best friends. One day he told me that his cousin was on the UVU dance team and I was sold. We went on our first date in October and we were married June 2019.


| Description | Status | VIM Order | VIM Sent | MTA | Scheduled Date | Received Date | Sample | Initial Amount | Last Used On | Last Used Amount | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| {{reagent.id}} | {{reagent.description}} | {{reagent.status}} | {{reagent.scheduledDate}} | {{reagent.receivedDate}} | {{reagent.Sample.description}} | {{reagent.initialAmount}} | {{reagent.lastUsedOn}} | {{reagent.lastUsedAmount}} |


TTN
WELCOME ABOARD
Growth Opportunities.
Hello NEWERS. How ARE You?
change all div elements with p elements


We have a fantastic team of developers and collaborators: David Muller, Robert Hovden, Peter Ercius, Yi Jiang, Elliot Padgett, Barnaby Levin, Colin Ophus, Shawn Waldon, Chris Harris, Cory Quammen, Robert Maynard, Utkarsh Ayachit, Sebastien Jourdain, Matt McCormick, Alvaro Sanchez, TJ Corona, Berk Geveci, Martin Turner, Dula Parkinson, ...
Also funding from the Department of Energy, Office of Science under contract DE-SC0011385


Automated Tester
google.com yahoo.com facebook.com yelp.com bing.com apple.com ebay.com hulu.com basecamphq.com amazon.com
Go


TieredMenu displays submenus in nested overlays.
TieredMenu uses the common menumodel api to define its items, visit MenuModel API for details.
TieredMenu requires nested menuitems as its model.
Menu is inline by default, popup mode is also supported by enabling popup property and calling toggle method by passing the event from the anchor element.
Transition of the open and hide animations can be customized using the showTransitionOptions and hideTransitionOptions properties, example below disables the animations altogether.
| Name | Type | Default | Description |
|---|---|---|---|
| model | array | null | An array of menuitems. |
| popup | boolean | false | Defines if menu would displayed as a popup. |
| appendTo | any | null | Target element to attach the overlay, valid values are "body" or a local ng-template variable of another element. |
| style | string | null | Inline style of the component. |
| styleClass | string | null | Style class of the component. |
| baseZIndex | number | 0 | Base zIndex value to use in layering. |
| autoZIndex | boolean | true | Whether to automatically manage layering. |
| autoDisplay | boolean | false | Whether to show a root submenu on mouse over. |
| showTransitionOptions | string | .12s cubic-bezier(0, 0, 0.2, 1) | Transition options of the show animation. |
| hideTransitionOptions | string | .1s linear | Transition options of the hide animation. |
| Name | Parameters | Description |
|---|---|---|
| toggle | event: browser event | Toggles the visibility of the popup menu. |
| show | event: browser event | Displays the popup menu. |
| hide | - | Hides the popup menu. |
Following is the list of structural style classes, for theming classes visit theming page.
| Name | Element |
|---|---|
| p-tieredmenu | Container element. |
| p-menu-list | List element. |
| p-menuitem | Menuitem element. |
| p-menuitem-text | Label of a menuitem. |
| p-menuitem-icon | Icon of a menuitem. |
| p-submenu-icon | Arrow icon of a submenu. |
None.


Exec plugin on linux
This is a (no reading allowed!) 60 second copy/paste guided example. Full plugin docs here.
This demo writes and uses a somewhat ridiculous
exec plugin (written in bash) that generates a
ConfigMap
.
This is a guide to try it without damaging your current setup.
requirements
- linux, git, curl, Go 1.13
Make a place to work
DEMO=$(mktemp -d)
Create a kustomization
Make a kustomization directory to hold all your config:
MYAPP=$DEMO/myapp
mkdir -p $MYAPP
Make a deployment config:
cat <<'EOF' >$MYAPP/deployment.yaml
apiVersion: apps/v1
kind: Deployment
metadata:
name: the-deployment
spec:
replicas: 3
template:
spec:
containers:
- name: the-container
image: monopole/hello:1
command: ["/hello",
"--port=8080",
"--date=$(THE_DATE)",
"--enableRiskyFeature=$(ENABLE_RISKY)"]
ports:
- containerPort: 8080
env:
- name: THE_DATE
valueFrom:
configMapKeyRef:
name: the-map
key: today
- name: ALT_GREETING
valueFrom:
configMapKeyRef:
name: the-map
key: altGreeting
- name: ENABLE_RISKY
valueFrom:
configMapKeyRef:
name: the-map
key: enableRisky
EOF
Make a service config:
cat <<EOF >$MYAPP/service.yaml
kind: Service
apiVersion: v1
metadata:
name: the-service
spec:
type: LoadBalancer
ports:
- protocol: TCP
port: 8666
targetPort: 8080
EOF
Now make a config file for the plugin you’re about to write.
This config file is just another k8s resource
object. The values of its apiVersion
and kind
fields are used to find the plugin code on your
filesystem (more on this later).
cat <<'EOF' >$MYAPP/cmGenerator.yaml
apiVersion: myDevOpsTeam
kind: SillyConfigMapGenerator
metadata:
name: whatever
argsOneLiner: Bienvenue true
EOF
Finally, make a kustomization file referencing all of the above:
cat <<EOF >$MYAPP/kustomization.yaml
commonLabels:
app: hello
resources:
- deployment.yaml
- service.yaml
generators:
- cmGenerator.yaml
EOF
Review the files
ls -C1 $MYAPP
Make a home for plugins
Plugins must live in a particular place for kustomize to find them.
This demo will use the ephemeral directory:
PLUGIN_ROOT=$DEMO/kustomize/plugin
The plugin config defined above in
$MYAPP/cmGenerator.yaml
specifies:
apiVersion: myDevOpsTeam kind: SillyConfigMapGenerator
This means the plugin must live in a directory named:
MY_PLUGIN_DIR=$PLUGIN_ROOT/myDevOpsTeam/sillyconfigmapgenerator
mkdir -p $MY_PLUGIN_DIR
The directory name is the plugin config’s apiVersion followed by its lower-cased kind.
A plugin gets its own directory to hold itself, its tests and any supplemental data files it might need.
Create the plugin
There are two kinds of plugins, exec and Go.
Make an exec plugin, installing it to the
correct directory and file name. The file name
must match the plugin’s kind (in this case,
SillyConfigMapGenerator
):
cat <<'EOF' >$MY_PLUGIN_DIR/SillyConfigMapGenerator
#!/bin/bash
# Skip the config file name argument.
shift
today=`date +%F`
echo "
kind: ConfigMap
apiVersion: v1
metadata:
name: the-map
data:
today: $today
altGreeting: "$1"
enableRisky: "$2"
"
EOF
By definition, an exec plugin must be executable:
chmod a+x $MY_PLUGIN_DIR/SillyConfigMapGenerator
Install kustomize
Per the instructions:
curl -s "https://raw.githubusercontent.com/\
kubernetes-sigs/kustomize/master/hack/install_kustomize.sh" | bash
mkdir -p $DEMO/bin
mv kustomize $DEMO/bin
Review the layout
tree $DEMO
Build your app, using the plugin
XDG_CONFIG_HOME=$DEMO $DEMO/bin/kustomize build --enable_alpha_plugins $MYAPP
Above, if you had set
PLUGIN_ROOT=$HOME/.config/kustomize/plugin
there would be no need to use XDG_CONFIG_HOME
in the
kustomize command above.


Membership System
Project II: Bootstrap Web Application
Home
Sign Up
Sign In
Membership System
Project II: Bootstrap Web Application.
Sign Up
Sign In


Ongoing Animes
- 91 Days Episode 10
- Active Raid: Kidou Kyoushuushitsu Dai Hachi Gakari 2nd Episode 11
- Aggressive Retsuko Episode 23
- Aikatsu Stars! Episode 23
- Amaama to Inazuma Episode 12
- Amanchu! Episode 11
- Ange Vierge Episode 11
- Ansatsu Kyoushitsu (TV) 2nd Season Episode 25
- Arslan Senki (TV): Fuujin Ranbu Episode 8
- B-Project: Kodou*Ambitious Episode 11
- Bananya Episode 12
- Battery Episode 9
-
HOTBerserk (2016) Episode 12
- Beyblade Burst Episode 24
- Binan Koukou Chikyuu Bouei-bu LOVE! LOVE! Episode 11
- Bonobono (2016) Episode 24
- Brotherhood: Final Fantasy XV Episode 5
- Cardfight!! Vanguard G: Stride Gate-hen Episode 23
- Cheer Danshi!! Episode 10
-
HOTD.Gray-man Hallow Episode 12
- Danganronpa 3: The End of Kibougamine Gakuen - Mirai-hen Episode 11
- Danganronpa 3: The End of Kibougamine Gakuen - Zetsubou-hen Episode 10
- Days (TV) Episode 12
- Detective Conan Movie 19: The Hellfire Sunflowers
-
HOTDragon Ball Super Episode 58
- Endride Episode 22
-
HOTFairy Tail (2014) OVA 1
- Fate/kaleid liner Prisma☆Illya 3rei!! Episode 11
- Folktales from Japan Episode 232
- Fudanshi Koukou Seikatsu Episode 11
- Fukigen na Mononokean Episode 12
- Future Card Buddyfight 100 Episode 50
- Future Card Buddyfight DDD Episode 25
-
HOTGintama (2015) Gintama Jump Special Anime Festa 2015
- Gintama: Aizome Kaori-hen OVA
- Gyakuten Saiban: Sono "Shinjitsu", Igi Ari! Episode 23
- Handa-kun Episode 11
- Hatsukoi Monster Episode 12
-
NewHeybot! Episode 1
- Hitori no Shita: The Outcast Episode 11
-
NewJewelpet: Attack Chance!? Episode 3
- Kamisama Minarai: Himitsu no Cocotama Episode 30
- Kono Bijutsubu ni wa Mondai ga Aru! Episode 11
- Kuromukuro Episode 24
- Kyoukai no Rinne (TV) 2nd Season Episode 24
- Love Live! Sunshine!! Episode 12
- Mahou Shoujo? Naria☆Girls Episode 11
- Mahoutsukai no Yome: Hoshi Matsu Hito Episode 1
- Mahoutsukai Precure! Episode 31
- Masou Gakuen HxH Episode 11
- Mob Psycho 100 Episode 11
- Mobile Suit Gundam Unicorn RE:0096 Episode 22
- Monster Strike Mermaid Rhapsody
-
HOTNewNanatsu no Taizai: Seisen no Shirushi Episode 3
-
HOTNaruto Shippuuden Episode 475
- Nejimaki Seirei Senki: Tenkyou no Alderamin Episode 11
- New Game! Episode 12
-
NewOnara Gorou Episode 5
-
HOTOne Piece Episode 756
- Orange Episode 12
- Ozmafia!! Episode 11
-
NewPlanetarian: Chiisana Hoshi no Yume Episode 5
-
NewPokemon Generations Episode 2
- Pokemon XY&Z Episode 38
- Puzzle & Dragons Cross Episode 12
- Qualidea Code Episode 11
- Ragnastrike Angels Episode 12
- Re:Petit kara Hajimeru Isekai Seikatsu Episode 12
- Re:Zero kara Hajimeru Isekai Seikatsu Episode 25
-
NewRegalia: The Three Sacred Stars Episode 4
- Rewrite Episode 12
- Rilu Rilu Fairilu: Yousei no Door Episode 26
- Saiki Kusuo no Psi-nan (TV) Episode 57
- Scared Rider Xechs Episode 11
- Servamp Episode 11
-
HOTShokugeki no Souma: Ni no Sara OVA 1
- Shounen Ashibe: Go! Go! Goma-chan Episode 16
- Sousei no Onmyouji Episode 23
- Taboo Tattoo Episode 12
- Tales of Zestiria the X Episode 11
- Thunderbolt Fantasy Episode 11
- Time Travel Shoujo: Mari Waka to 8-nin no Kagakusha-tachi Episode 11
- Tsukiuta. The Animation Episode 11
- Youkai Watch Movie
- Yu-Gi-Oh! Arc-V Episode 121
Newly Added
Legal Disclaimer, Privacy and DMCA
Legal Disclaimer
The author is not responsible for any contents linked or referred to from his pages - If any damage occurs by the use of information presented there, only
the author of the respective pages might be liable, not the one who has linked to these pages.Anime1.com doesn't host any content
All Anime1.com does is link or embed content that was uploaded to popular Online Video hosting sites like Veoh.com / Megavideo.com / Youtube.com / Google Video. All youtube/veoh/megavideo/googlevideo users signed a contract with the sites when they set up their accounts wich forces them not to upload illegal content. By clicking on any Links to videos while surfing on Anime1.com you watch content hosted on third parties and Anime1.com cant take the responsibility for any content hosted on other sites.
We do not upload any videos nor do we know who and where videos are coming from. We do not promote any illegal conduct of any kind. Links to the videos are
submitted by users and managed by users.
DMCA Notice of Copyright Infringement
Anime1.com is an online service provider as defined in the Digital Millennium Copyright Act.
We provide legal copyright owners with the ability to self-publish on the Internet by uploading, storing and displaying various types of media. We do not
actively monitor, screen or otherwise review the media which is uploaded to our servers by users of the service.
We take copyright violation very seriously and will vigorously protect the rights of legal copyright owners.
If you are the copyright owner of content which appears on the Anime1.com website and you did not authorize the use of the content you must notify us in
writing in order for us to identify the allegedly infringing content and take action.
We will be unable to take any action if you do not provide us with the required information
, so please fill out all fields accurately and completely. You may make a written notice via e-mail, facsimile or postal mail to our DMCA
Agent as listed below. Your written notice must include the following:
- Specific identification of the copyrighted work which you are alleging to have been infringed. If you are alleging infringement of multiple copyrighted works with a single notification you must submit a representative list which specifically identifies each of the works that you allege are being infringed.
- Specific identification of the location and description of the material that is claimed to be infringing or to be the subject of infringing activity with enough detailed information to permit us to locate the material. You should include the specific URL or URLs of the web pages where the allegedly infringing material is located.
- Information reasonably sufficient to allow us to contact the complaining party which may include a name, address, telephone number and electronic mail address and signature at which the complaining party may be contacted.
- A statement that the complaining party has a good faith belief that use of the material in the manner complained of is not authorized by the copyright owner, its agent or the law.
- A statement that the information in the notification is accurate, and under penalty of perjury that the complaining party is authorized to act on behalf of the owner of an exclusive right that is allegedly infringed.
Written notice should be sent to our designated agent as follows:
DMCA AGENT Email:
dmca [at] anime1.com
Also check out the Frequently Asked Questions (and Answers) about DMCA Safe Harbor Provisions
Privacy Policy
For each visitor to our Web page, our Web server automatically recognizes only the consumer's domain name, but not the e-mail address (where possible).
We collect the IP address and domain name and e-mail address (where possible)
of visitors to our Web page, the e-mail addresses of those who communicate with us via e-mail.
The information we collect is used to improve the content of our Web page, used to notify consumers about updates to our Web site.
We allow third-party companies to serve ads and/or collect certain anonymous information when you visit our web site. These companies may use non-personally identifiable information (e.g., click stream information, browser type, time and date, subject of advertisements clicked or scrolled over) during your visits to this and other Web sites in order to provide advertisements about goods and services likely to be of greater interest to you. These companies typically use a cookie or third party web beacon to collect this information. To learn more about this behavioral advertising practice or to opt-out of this type of advertising, you can visit networkadvertising.org.
With respect to cookies: We use cookies to record user-specific information on what pages users access or visit, record past activity at a site in order to provide better service when visitors return to our site and Third Party cookies e.g. "Google".
Google cookies
- When you visit Anime1.com
send one or more cookies - a small file containing a string of characters - to your computer that uniquely identifies your browser.
use cookies to improve the quality of their service by storing user preferences and tracking user trends, such as how people search. Most browsers are initially set up to accept cookies, but you can reset your browser to refuse all cookies or to indicate when a cookie is being sent. However, some Google features and services may not function properly if your cookies are disabled.
If you do not want to receive e-mail from us in the future, please let us know by sending us e-mail at the above address.
From time to time, we may use customer information for new, unanticipated uses not previously disclosed in our privacy notice. If our information practices change at some time in the future we will post the policy changes to our Web site to notify you of these changes and provide you with the ability to opt out of these new uses. If you are concerned about how your information is used, you should check back at our Web site periodically.
Upon request we provide site visitors with access to no information that we have collected and that we maintain about them.
With respect to security: We have appropriate security measures in place in our physical facilities to protect against the loss, misuse or alteration of information that we have collected from you at our site.If you feel that this site is not following its stated information policy, you may contact us.
Anime1.com Network


§601-5 Independence of judiciary. The judiciary branch and the several judges and other judicial officers thereof shall be independent of both the executive and legislative departments. The governor shall have no power to interfere with, alter, or overrule any order, writ, judgment, or decision of any court, judge, or other judicial officer, except in the exercise of the power to grant reprieves and pardons in pursuance of law. [L 1892, c 57, §2; am L 1903, c 32, §1; RL 1925, §2212; RL 1935, §3571; RL 1945, §9272; RL 1955, §213-2; HRS §601-5; am L 1974, c 159, §17]
Cross References
See Const. art. VI.
Rules of Court
See JC Canon 1.
Attorney General Opinions
Laws governing hours of work, vacation, etc., of all public employees do not by coverage of employees in judiciary department impair the judicial power. Att. Gen. Op. 63-20.
Case Notes
No court ought to give an order of which it would be unable to compel the enforcement. 5 H. 669 (1878).
Court cannot supply a want in the law, or legislate and make law. 8 H. 478 (1892).


North American Shared Print Initiative Facilitated by OCLC Sustainable Collection Services (SCS)
Since 2013, 145 academic libraries spanning fourteen U.S. states and five Canadian provinces have made formal retention commitments using SCS tools and services. These represent the foundation of the North American shared print collection.
These institutions have collectively identified 7.6 million distinct editions (titles), representing 19.7 million print holdings, for long-term retention.
Shared print initiatives facilitated by OCLC and SCS are also starting to take hold internationally, with programs underway in the United Kingdom and Australia.
Titles Retained
- ≤ 20k
- > 500k
Tapping on a group below will bring it into focus.
Tap Overview to see all groups.
Shared Print Overview
Member Libraries
145
Member Libraries
Academic libraries of all sizes have participated in these shared print programs, from theology libraries to ARL’s. Together, they have worked to agree on criteria for retention, and have typically accepted responsibility for retention commitments in proportion to the size of their collections.
7.6
Distinct Editions
In SCS processes, title statistics are counted in two ways: by distinct OCLC numbers (identifying holdings set by other libraries on the same edition) and by OCLC Work ID (identifying clusters of OCLC numbers that relate to the same work). The statistics here represent distinct OCLC numbers. For convenience, think of these as titles.
19.7
Title Holdings
Because these shared print programs are independent, multiple libraries are making commitments to the same titles. And in some programs, multiple holdings of the same title are committed based on usage and other factors. For convenience, think of these as copies. On average, the community has retained 2.5 copies of every title (though of course the actual retentions vary).
Search the Shared Print Collection
Most shared print initiatives have focused first on retention of titles scarcely held in the country, region, state or group. This strategy assures that the titles most at risk are secured first. The context of holdings in other libraries provided by WorldCat informs these decisions, and helps prioritize each group’s work.
Increasingly, it will be important to know, for a given title, what retention commitments are in place. While much of this work will be done in batches or programmatically, OCLC SCS recognize that collection strategists may benefit from the ability to explore the collective shared print collection interactively. The search box below demonstrates one such possibility. You can use it to explore the sample collection. Below each title is a color-coded list of the programs that have committed to retain that title.
-
Henley, Patricia. The Hummingbird House. 3rd ed., MacMurray, 1999.
- EAST 15yr
-
Henley, Patricia. Lorem ipsum dolor sit amet, consectetur adipisicing elit. Molestiae aspernatur non assumenda, necessitatibus repellat. Repellat quas cumque iure aperiam qui incidunt accusantium ex, voluptatem deserunt delectus omnis doloremque optio earum. 3rd ed., MacMurray, 1999.
- EAST 15yr
- SCELC 15yr
- ALI15yr
-
Henley, Patricia. Lorem ipsum dolor sit amet, consectetur adipisicing elit. Molestiae aspernatur non assumenda, necessitatibus repellat. Repellat quas cumque iure aperiam qui incidunt accusantium ex, voluptatem deserunt delectus omnis doloremque optio earum. 3rd ed., MacMurray, 1999.
- MI-SPI 15yr
- COPPUL15yr
Collaborative Decisions, Made Possible with GreenGlass
SCS analysts and the GreenGlass decision-support software have facilitated shared print monographs initiatives since 2012. GreenGlass employs visualizations and modeling tools to enable groups of libraries to experiment with retention criteria, iterate various scenarios in real time, and to reach consensus quickly. GreenGlass helps inform decisions, and its modeling capabilities allow the group to balance commitments equitably among group members.
For inquiries regarding SCS support for shared print initiatives, please contact our SCS sales specialists Pete Zeimet<EMAIL_ADDRESS>or Kate Howe (howek@oclc.org).


Seems your browser doesn't support Javascript! Websocket relies on Javascript being enabled. Please enable Javascript and reload this page!
STOMP client status:
Foo Topic
Subscribe
Unsubscribe
Bar Topic
Subscribe
Unsubscribe


When running this sample on multiple devices, you can use the PeerWatcher from PeerFinder to find peers to connect to using a StreamSocket. Click 'Advertise' (on both devices) and then click 'Start Watching for Peers' to dynamically discover nearby peers as they become visible. The list will continue to update until you connect or click 'Stop Watching for Peers'. Click 'Connect To a Peer' to initiate the connection.
No peers found!


Provide "infinite" comics based in xkcd service, this is just for fun : )
To access Click Here
2 - Translate words
This app translates words and phrases in multiple languges
The params are (pass in URL): languageConverted, languageToConvert and text.
The answer comes in Json format ({answer: phrase_translated})
Url example /translate?languageConverted=pt&languageToConvert=en&text=hello+friend
To access Click Here


Check developer console window
This tests compares lisan vs regex approach when there is no need for interpolation


Film review by Kevin Patterson
GATTACA Rating: *** (out of four) Director: Andrew Niccol Screenplay: Andrew Niccol Starring Cast: Ethan Hawke, Uma Thurman, Jude Law
As we near the end of the millennium, one of the most popular topics in modern narrative fiction has been how humankind's recent technological and scientific advances might change certain things we take for granted about life. Andrew Niccol, who has since gained notoriety for his screenplay of THE TRUMAN SHOW, puts in his two cents on the subject with GATTACA, a science-fiction film in which all procreation is artificial, genetically engineered for the best possible results. Vincent (Ethan Hawke), the protagonist of GATTACA, was conceived naturally, and has a heart condition which the family's doctor predicted would kill him by the age of thirty.
Vincent, and others like him, are labeled "invalids." Discrimination against them is not sanctioned by the law, but it goes on as a matter of routine nonetheless. The only way that he can hope to succeed at his lifelong dream of going on a mission into outer space is to assume the identity of another valid who, for whatever reason, can no longer fulfill his or her place in society. An underground figure helps him locate Jerome Morrow (Jude Law), who has been paralyzed in an accident, and the two of them come to an agreement. Jerome will supply Vincent with the necessary genetic samples to make the impersonation hold up under investigative scrutiny, and in return Vincent will continue to provide for his lavish lifestyle through income from his new position at Gattaca, the future equivalent of NASA.
Thematically, the most obvious note that GATTACA strikes is a cautionary one about genetic engineering: Niccol seems to have been inspired at least partly by the seminal BLADE RUNNER, in which scientists created quasi-human "Replicants" who were then simply shut off or killed when they became inconvenient. However, there's also a parallel between the world of GATTACA and our own, in which discrimination is technically illegal but nevertheless occurs on a regular basis. Vincent is surprised to discover, when he applies at Gattaca, that his "interview" consists of a urine test, and I would not be shocked to learn that interviews for some socially marginalized groups last just about as long at certain American companies.
Niccol also does a good job handling the science fiction elements of the story. The futuristic set design, with its cold, metallic interiors, is impressive and conveys a sense of technological menace without being too overdone or outlandish. The technology is also pretty believable: both artificial fertilization and the genetic testing and cataloguing through bodily samples are within the realm of today's science. GATTACA also manages to recapture some of the wonder of space travel that has been diluted in modern culture by all the bug-monster alien invasions and "hyperspace jumps" that tend to dominate science fiction. It keeps the science simple and believable (Vincent's mission is a trip to Mars), and focuses on its human implications rather than on special effects.
GATTACA does unfold rather awkwardly at times. There's a long narration from Vincent near the beginning that only serves to make brain-poundingly obvious what would have eventually become evident anyway. A murder mystery is introduced, apparently to provide Vincent with cause for fear of discovery (since the detectives' DNA investigation could turn up evidence of an "invalid" at Gattaca), but it fails to generate much tension: it's just another expository device. There's also a sibling rivalry, which occupies too many of the film's closing moments for a subplot that had disappeared after the introductory narration, and a romance between Vincent and a co-worker (Uma Thurman) that is fairly formulaic.
The triumphs of GATTACA are to be found mostly in the care with which Niccol has designed his future world: the science is very plausible, the visual design is outstanding, and the issues raised by the film are good food for thought. It would have been better if he had found a more smoothly flowing story to frame in this world, but his conception of it is still enough to qualify GATTACA as one of the more interesting recent science fiction films.

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


| Properties' Summary |
long
DataCaption |
specifies how the captions of data points are displayed. |
string
LabelSeparator |
[ OPTIONAL ]
specifies a string that is used to separate the parts of a data label (caption)
|
long
NumberFormat |
[ OPTIONAL ]
specifies a number format for the display of the value in the data label
|
long
PercentageNumberFormat |
[ OPTIONAL ]
specifies a number format for the display of the percentage value in the data label
|
long
LabelPlacement |
[ OPTIONAL ]
specifies a relative position for the data label
|
long
SymbolType |
[ OPTIONAL ]
specifies the type of symbols if the current chart type
supports the usage of symbols.
|
string
SymbolBitmapURL |
[ OPTIONAL ]
In charts that support symbols, you can set this property to
any valid URL that points to a graphic file. This graphic is
then used as symbol for each data point.
|
long
SegmentOffset |
[ OPTIONAL ]
the offset by which pie segments in a PieDiagram
are dragged outside from the center. This value is given in
percent of the radius.
|
| Properties' Details |
DataCaption
long DataCaption;
- Description
- specifies how the captions of data points are displayed.
- See also
- ChartDataCaption
|
|
LabelSeparator
string LabelSeparator;
- Usage Restrictions
- optional
- Description
- specifies a string that is used to separate the parts of a data label (caption)
|
|
NumberFormat
long NumberFormat;
- Usage Restrictions
- optional
- Description
- specifies a number format for the display of the value in the data label
|
|
PercentageNumberFormat
long PercentageNumberFormat;
- Usage Restrictions
- optional
- Description
- specifies a number format for the display of the percentage value in the data label
|
|
LabelPlacement
long LabelPlacement;
- Usage Restrictions
- optional
- Description
- specifies a relative position for the data label
- See also
- DataLabelPlacement
|
|
SymbolType
long SymbolType;
- Usage Restrictions
- optional
- Description
- specifies the type of symbols if the current chart type
supports the usage of symbols.
- See also
- ChartSymbolType
|
|
SymbolBitmapURL
string SymbolBitmapURL;
- Usage Restrictions
- optional
- Description
- In charts that support symbols, you can set this property to
any valid URL that points to a graphic file. This graphic is
then used as symbol for each data point.
When you query this value you get an internal URL of the
embedded graphic.
- See also
- ChartSymbolType
|
|
SegmentOffset
long SegmentOffset;
- Usage Restrictions
- optional
- Description
- the offset by which pie segments in a PieDiagram
are dragged outside from the center. This value is given in
percent of the radius.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


settings
search
star_border
Evans Carol
Let's go to the meeting.
3
10:30
Whalberg Mark
Hello!
1
10:30
May Ester
Let's meet at 11:00 am.
2
10:30
Miller Martin
Hi, please send me the project.
4
10:30
Padovan Clara
It's LATE!!!!
10:30
Smith Jhon
No it's ok!!
10:30
Matafioli Teresa
Call Me!! NOW!
10:30
Bruni Carla
I don't know.
10:30
Di Maio Matteo
Graet!
10:30
Angelini Giorgia
Remember to bring the material for the presentation of the project.
10:30
Bonfiglio Alberto
Hi! I'm late. Remember to backup yesterday's work because a storm is coming and the UPS is not connected.
10:30
add
Logout
Provvisorio


As an officer in the Ground Duty (Technical) Branch, you propel and manage your team to ensure that the Indian Air Force remains airworthy. You would be incharge of some of the most sophisticated equipment in the world by joining one of the sub branches based on your qualification.
General Eligibility for Aeronautical Engineering Branch are (applicable for men and women):
After completion of Engineering degree or while in your final year/semester of Engineering
For both Men and Women. Permanent Commission (for men) / Short Service Commission (For men and women)
Marks - Must have scored a minimum of 60% marks or equivalent in any one of the qualifications listed.
Final year students are eligible to apply provided they do not have any present backlog at the time of AFSB testing and they produce provisional/ original degree issued by the University as per the date stipulated in the advertisement.
  Eligible only when a candidate should have minimum of 60% marks each in Physics and Mathematics at 10+2 level and have undergone any one of the following educational qualifications:-
A minimum of four year graduation / integrated post-graduation qualification in Engineering / Technology from recognised university
OR
Cleared Section A and B examination of Associate Membership of Institution of Engineers (India)
OR
Cleared Section A and B examination of Aeronautical Society of India
OR
Graduate membership examination of the Institute of Electronics and Telecommunication Engineers by actual studies
With a minimum of 60% marks or equivalent in the following disciplines.
(i) Communication Engineering
(ii) Computer Engineering / Technology
(iii) Computer Engineering & Application
(iv) Computer Science and Engineering / Technology
(v) Electrical and Computer Engineering
(vi) Electrical and Electronics Engineering
(vii) Electrical Engineering
(viii) Electronics Engineering / Technology
(ix) Electronics Science and Engineering
(x) Electronic
(xi) Electronics and Communication Engineering
(xii) Electronics and Computer Science
(xiii) Electronics and/ or Telecommunication Engineering
(xiv) Electronics and / or Telecommunication Engineering (Microwave)
(xv) Electronics and computer Engineering
(xvi) Electronics Communication and Instrumentation Engineering
(xvii) Electronics Instrument & Control
(xviii) Electronics Instrument & Control Engineering
(xix) Instrumentation & Control Engineering
(xx) Instrument & Control Engineering
(xxi) Information Technology
  Eligible only when a candidate should have minimum of 60% marks each in Physics and Mathematics at 10+2 level and have undergone any one of the following educational qualifications:-
A minimum of four year degree graduation / integrated post-graduation qualification in Engineering / Technology from recognised university
OR
Cleared Section A and B examination of Associate Membership of Institution of Engineers (India)
OR
Cleared section A and B examination of Aeronautical Society of India by actual studies
With a minimum of 60% marks or equivalent in the following disciplines:-
1. Aerospace Engineering
2. Aeronautical Engineering
3. Aircraft Mainternance Engineering
4. Mechanical Engineering
5. Mechanical Engineering and Automation
6. Mechanical Engineering (Production)
7. Mechanical Engineering (Repair and Maintenance)
8. Mechatronics
9. Industrial Engineering


/**
* Copyright 2017 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import { assert } from '../util/assert';
import { ResourcePath } from './path';
export class DocumentKey {
constructor(readonly path: ResourcePath) {
assert(
DocumentKey.isDocumentKey(path),
'Invalid DocumentKey with an odd number of segments: ' +
path.toArray().join('/')
);
}
isEqual(other: DocumentKey | null): boolean {
return (
other !== null && ResourcePath.comparator(this.path, other.path) === 0
);
}
toString(): string {
return this.path.toString();
}
static EMPTY = new DocumentKey(new ResourcePath([]));
static comparator(k1: DocumentKey, k2: DocumentKey): number {
return ResourcePath.comparator(k1.path, k2.path);
}
static isDocumentKey(path: ResourcePath): boolean {
return path.length % 2 === 0;
}
/**
* Creates and returns a new document key with the given segments.
*
* @param path The segments of the path to the document
* @return A new instance of DocumentKey
*/
static fromSegments(segments: string[]): DocumentKey {
return new DocumentKey(new ResourcePath(segments.slice()));
}
/**
* Creates and returns a new document key using '/' to split the string into
* segments.
*
* @param path The slash-separated path string to the document
* @return A new instance of DocumentKey
*/
static fromPathString(path: string): DocumentKey {
return new DocumentKey(ResourcePath.fromString(path));
}
}
|


Χαίρετ’ ὦ ἐλθόντες.
I've reproduced a list of recent posts here for your reading pleasure:
…or you can find more in the archives.


MacOS Quick Start¶
1. Download COGS¶
COGS runs on the open source .NET Core platform. You will need to Download .NET Core 2.1 and install it
Next, install COGS as a dotnet tool on your system by downloading the latest stable version.
user$ dotnet tool install -g cogs
Note
Alternatively, you can install the latest development build using this command.
user$ dotnet tool install -g --add-source https://ci.appveyor.com/nuget/cogs/ cogs
After the tool is installed, you can now run cogs from your command prompt.
user$ cogs --help
2. Initialize a Model¶
Let’s initialize a sample model. On the command line, switch to a directory where you will create your model. Then, run the following.
user$ cogs cogs-new MyModel
Let’s see what’s in the directory that COGS created
user$ cd MyModel
The output directory listing show us what COGS created
MyModel user$ ls -l
total 8
drwxr-xr-x 4 user staff 136 Aug 9 15:34 CompositeTypes
drwxr-xr-x 4 user staff 136 Aug 9 15:34 ItemTypes
drwxr-xr-x 4 user staff 136 Aug 9 15:34 Settings
drwxr-xr-x 4 user staff 136 Aug 9 15:34 Topics
-rw-r--r-- 1 user staff 17 Aug 9 15:34 readme.md
The folder and files listed above contain everything we need to specify our model
3. Generate a Schema and Documentation¶
Now, Let’s create an XML Schema to represent the skeleton model that COGS created for us
user$ cogs publish-sphinx MyModel output/sphinx
user$ cd output/sphinx
user$ make html
user$ cd build/html
Note
If you get error no module name sphinx
, you probbably need to install sphinx to your python
using the command python3 -m pip install sphinx
, provided you are using python3
Here is the output of the directory listing
html user$ ls -l
total 64
drwxr-xr-x@ 6 user staff 204 Aug 9 2017 _sources
drwxr-xr-x@ 25 user staff 850 Aug 9 2017 _static
drwxr-xr-x@ 5 user staff 170 Aug 9 2017 composite-types
-rw-r--r--@ 1 user staff 4447 Aug 9 2017 genindex.html
-rw-r--r--@ 1 user staff 5407 Aug 9 2017 index.html
drwxr-xr-x@ 5 user staff 170 Aug 9 2017 item-types
-rw-r--r--@ 1 user staff 323 Aug 9 2017 objects.inv
-rw-r--r--@ 1 user staff 4842 Aug 9 2017 search.html
-rw-r--r--@ 1 user staff 992 Aug 9 2017 searchindex.js
drwxr-xr-x@ 3 user staff 102 Aug 9 2017 topics
4. Make the Model Yours¶
You are now up and running with COGS. Make the model your own by following the Modeler’s Guide. Learn about the publishing to other formats in the Technical Guide.


| Class | Description |
|---|---|
| BlockPartitioner |
Default partitioner used for all binary block rdd operations in order
to enable sufficient local aggregation independent of the aggregation
direction (row/col-wise).
|
| BroadcastObject<T extends CacheBlock> | |
| CorrMatrixBlock | |
| DatasetObject | |
| FrameReblockBuffer | |
| IndexedMatrixValue | |
| LazyIterableIterator<T> |
This class is a generic base class for lazy, single pass iterator classes
in order to simplify the implementation of lazy iterators for mapPartitions
use cases.
|
| LineageObject | |
| PartitionedBlock<T extends CacheBlock> |
This class is for partitioned matrix/frame blocks, to be used as broadcasts.
|
| PartitionedBroadcast<T extends CacheBlock> |
This class is a wrapper around an array of broadcasts of partitioned matrix/frame blocks,
which is required due to 2GB limitations of Spark's broadcast handling.
|
| RDDObject | |
| ReblockBuffer | |
| RowMatrixBlock | |
| SerLongWritable |
Wrapper for LongWritable in order to make it serializable as required for
shuffle in spark instructions.
|
| SerText |
Wrapper for Text in order to make it serializable as required for
shuffle in spark instructions.
|
Copyright © 2021 The Apache Software Foundation. All rights reserved.


Heads or Tails
Game only works on main net, etc.
Select coin side
Amount of Ether to bet
(~
0.00
$)
50% chance to win
ETH (~
$)
Jackpot
Recent Games
Address
Amount bet [ETH]
Bet on
Won/Lost
Jackpot [ETH]
Contract address:


--- title: "Gokhan Ciflikli" output: html_document ---
👋 I’m Gökhan.
I have 15 years of experience working in tech, open-source software development (Quanteda Initiative), and applied research. I currently lead a Data & Analytics function at a London based tech scaleup. I am also a Senior Visiting Fellow at the LSE Data Science Institute, where I spearhead research at the intersection of social policy and generative AI ethics.
I am passionate about aligning technical work with the needs of the business to maximise the ROI on data initiatives. I enjoy mentoring data engineers, research scientists, and business analysts to accelerate their growth.
I publish a weekly newsletter on technical team management aimed at middle managers called TeamCraft. I also post about open-source MLOps tools in the Python ecosystem. I used to publish case studies on data visualisation and predictive modelling in my R blog, however it lays dormant since 2018.
I support and champion cognitive diversity. Since 2020, I have been assisting the Tech Talent Charter to run and analyse their annual Diversity in Tech surveys.
I am a computational social scientist by training and occasionally publish research on gender bias, academic indicators, behavioural interventions in surveys, and armed conflict dynamics.
It is the chief characteristic of the religion of science that it works. —Asimov


Name
Email address
Phone number
Password
Repeat Password
Company Name
Country
Choose
list 1
list 2
Create Free Account
Name
Email address
Phone number
Password
Repeat Password
Company Name
Country
Choose
list 1
list 2
Create Free Account


With your contribution I will make this app the ultimate music app!
1. The in-app subscription for The Jukebox App's Monthly Subscription is auto-renewable which means that once purchased it will be auto-renewed every month until you cancel it, 24 hours prior to the end of the current period.
2. The duration of the subscription to support the app is 1 Month with a charge of $1.99 every month.
3. Your Google Account will be charged for renewal within 24-hours prior to the end of the current period with the cost of $1.99.
4. You can manage your Subscription and Auto-Renewal by going to your Account Settings.
5. By closing this window, should you subscribe, you agree to the above terms.
6. Upon subscription termination, any un-used time remaining in the subscription will be automatically forfeited.
Privacy Policy


Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.
The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.
This algorithm is not suitable for large data sets as its average and worst case complexities are of Ο(n2), where n is the number of items.
Consider the following depicted array as an example.
For the first position in the sorted list, the whole list is scanned sequentially. The first position where 14 is stored presently, we search the whole list and find that 10 is the lowest value.
So we replace 14 with 10. After one iteration 10, which happens to be the minimum value in the list, appears in the first position of the sorted list.
For the second position, where 33 is residing, we start scanning the rest of the list in a linear manner.
We find that 14 is the second lowest value in the list and it should appear at the second place. We swap these values.
After two iterations, two least values are positioned at the beginning in a sorted manner.
The same process is applied to the rest of the items in the array.
Following is a pictorial depiction of the entire sorting process −
#include <stdio.h> #include <stdbool.h> #define MAX 7 int intArray[MAX] = {4,6,3,2,1,9,7}; void printline(int count) { int i; for(i = 0;i < count-1;i++) { printf("="); } printf("=\n"); } void display() { int i; printf("["); // navigate through all items for(i = 0;i < MAX;i++) { printf("%d ", intArray[i]); } printf("]\n"); } void selectionSort() { int indexMin,i,j; // loop through all numbers for(i = 0; i < MAX-1; i++) { // set current element as minimum indexMin = i; // check the element to be minimum for(j = i+1;j < MAX;j++) { if(intArray[j] < intArray[indexMin]) { indexMin = j; } } if(indexMin != i) { printf("Items swapped: [ %d, %d ]\n" , intArray[i], intArray[indexMin]); // swap the numbers int temp = intArray[indexMin]; intArray[indexMin] = intArray[i]; intArray[i] = temp; } printf("Iteration %d#:",(i+1)); display(); } } void main() { printf("Input Array: "); display(); printline(50); selectionSort(); printf("Output Array: "); display(); printline(50); }
If we compile and run the above program, it will produce the following result −
Input Array: [4 6 3 2 1 9 7 ] ================================================== Items swapped: [ 4, 1 ] Iteration 1#:[1 6 3 2 4 9 7 ] Items swapped: [ 6, 2 ] Iteration 2#:[1 2 3 6 4 9 7 ] Iteration 3#:[1 2 3 6 4 9 7 ] Items swapped: [ 6, 4 ] Iteration 4#:[1 2 3 4 6 9 7 ] Iteration 5#:[1 2 3 4 6 9 7 ] Items swapped: [ 9, 7 ] Iteration 6#:[1 2 3 4 6 7 9 ] Output Array: [1 2 3 4 6 7 9 ] ==================================================


Shows your current status and to which repositories you have access.
Log out and clear session.
Create a new repository on GitHub and GitBox.
Find GitBox/GitHub users and show their access levels.
Have a question for us? Here's where to get help.
Often someone has already asked your question. Check here for answers to common problems.
Please wait...


Click the record button to start a new recording, or upload a json file containing profiler data.
Interact to preview change detection. Clicking stop ends this Profiler recording.
Click Save Profile to save your recording or click refresh to clear the current recording.


Jeremiah 30:13
There is none to plead thy cause, that thou mayest be bound up: thou hast no healing medicines.


Connect with friends and the world around you on Facebook.
See photos and updates from friends in News Feed
Share what's new in your life on your Timeline.
Find more of what you're looking for with Facebook Search.
Sign Up
It’s free and always will be.
Birthday
By clicking Sign Up, you agree to our Terms, Data Policy and Cookies Policy. You may receive SMS Notifications from us and can opt out any time.
Create a Page for a celebrity, band or business.


Stockcare
Log In
use your email and password to sign in
Log In
Sign up
Please provide all the correct info to create an account
Sign Up
Create Account
or
Log In
Please, Log In
or
Create Account


Adding Syntax Highlighting in Flutter Cookbook App
Posted on February 06, 2020 in Flutter
Target Audience: Beginner
Recipe: Displaying code snippets for Flutter Cookbook code recipes.
Focus Widget: syntax_highlighter
plugin
Checkout the companion video tutorial:
Lets's go!
pubspec.yaml
dependency
Add syntax_highlighter
plugin dependency as below:
dependencies:
flutter:
sdk: flutter
#Highlighting syntax in code snippets for code recipes
syntax_highlighter: ^0.1.0
#To provide Floating Action widget to zoom in and out code snippet text
animated_floatactionbuttons: ^0.1.0
-
syntax_highlighter
plugin: This plugin is used to highlight syntax in code snippets for code recipes. -
animated_floatactionbuttons
plugin: This plugin is used to provide Floating Action widget to zoom in and out code snippet text.
CodeFileWidget: A StatefulWidget
to display Code snippet
Class CodeFileWidget
is a StatefulWidget
. It's responsible to display underlying code for a Flutter code recipe.
This class takes four parameters to populate appropriate code snippet in CodeFileWidget
.
recipeName
: Code recipe's name to display in the appBar at the top.pageName
: This is used to routing purposes. In this particular app, this is a required parameter to navigate the recipe's code and its preview and vice versa.codeFilePath
: This is the location of code file in the code. For example:lib/pdf/
. Don't forget to add this path inassets
section ofpubspec.yaml
file like below:
assets:
- lib/pdf/
codeGithubPath
: This is the externalhttps://
link to code's file in Github repo.
class CodeFileWidget extends StatefulWidget {
final String recipeName;
final String pageName;
final String codeFilePath;
final String codeGithubPath;
CodeFileWidget(
{this.recipeName, this.pageName, this.codeFilePath, this.codeGithubPath});
@override
CodeFileWidgetState createState() {
return CodeFileState();
}
}
class CodeFileWidgetState extends State<CodeFileWidget> {
double scaleFactorText = 1.0;
@override
Widget build(BuildContext context) {
...
);
}
List<Widget> codepreviewActions(String codeContent) {
...
}
Widget highlightCodeSyntax(String codeContent, BuildContext context) {
...
}
}
Next, we'll go over the each of the three methods of CodeFileWidgetState
. Please note that default scale factor value for text is set to 1: double scaleFactorText = 1.0;
Building screen
First, we'll build the main interface to display code snippet.
AppBar: The App Bar has an action to open the external link to Github repository file. Title displays the recipe name.
FutureBuilder
: FutureBuilder
loads the file contents of the passed codeFilePath
file. It shows the CircularProgressIndicator
widget while file contents are loading. Once the data is available, highlightCodeSyntax(...)
method takes the file contents and highlights syntax.
AnimatedFloatingActionButton
: AnimatedFloatingActionButton
is used to show actions to zoom_in and zoom_out code, and to navigate to the demo view.
@override
Widget build(BuildContext context) {
return Scaffold(
appBar: AppBar(
leading: IconButton(
icon: Icon(Icons.arrow_back),
onPressed: () => Navigator.pop(context),
),
title: Text(widget.recipeName),
actions: <Widget>[
IconButton(
icon: Icon(Icons.open_in_new),
onPressed: () => UrlUtils.open(this.widget.codeGithubPath),
)
],
),
body: FutureBuilder(
future: rootBundle.loadString(widget.codeFilePath) ??
'Error loading code file ${this.widget.codeFilePath}',
builder: (BuildContext context, AsyncSnapshot<String> snapshot) {
if (snapshot.hasData) {
return Scaffold(
body: Padding(
padding: EdgeInsets.all(4.0),
child: highlightCodeSyntax(snapshot.data, context),
),
floatingActionButton: AnimatedFloatingActionButton(
fabButtons: codepreviewActions(),
colorStartAnimation: Colors.blue,
colorEndAnimation: Colors.cyan,
animatedIconData: AnimatedIcons.menu_close,
),
);
} else {
return Center(child: CircularProgressIndicator());
}
},
),
);
}
Adding actions
Now, add actions like zoom_in, zoom_out, and navigating to code recipe demonstration.
-
Zooming Out:
scaleFactorText
's value is decreased by0.1
every time 'Zoom out' widget is tapped. That means text is made smaller. -
Zooming In:
scaleFactorText
's value is increased by0.1
every time 'Zoom out' widget is tapped. That means text is made bigger. You can see more text at a time. -
Navigating to Code demo: Tapping on this action opens the code recipe demonstration screen.
List<Widget> codepreviewActions() {
return <Widget>[
//making text smaller
FloatingActionButton(
heroTag: "zoom_out",
child: Icon(Icons.zoom_out),
tooltip: 'Zoom out',
onPressed: () => setState(() {
this.scaleFactorText = max(0.8, this.scaleFactorText - 0.1);
}),
),
//making text bigger
FloatingActionButton(
heroTag: "zoom_in",
child: Icon(Icons.zoom_in),
tooltip: 'Zoom in',
onPressed: () => setState(() {
this.scaleFactorText += 0.1;
}),
),
FloatingActionButton(
heroTag: "open_page",
child: Icon(Icons.slideshow),
tooltip: 'See Demo',
onPressed: () => Navigator.popAndPushNamed(
context,
widget.pageName,
arguments: ScreenArguments(widget.recipeName, widget.pageName,
widget.codeFilePath, widget.codeGithubPath),
),
),
];
}
Highlighting code syntax
This is the main method which is responsible to highlight syntax for the code file. Plugin provides SyntaxHighlighterStyle
class to help provide the correct theme for the current platform's theme (light vs dark).
Container
widget is used to display the code snippet using BoxConstraints.expand()
constraints.
Scrollbar
widget uses two nested SingleChildScrollView
widgets. First one provides the vertical scrolling by default. Second SingleChildScrollView
sets its scrollDirection
property to Axis.horizontal
to provide horizontal scrolling.
RichText
widget uses textScaleFactor
property to adapt the variable value for scaleFactorText
.
TextSpan
widget uses monospace
fontFamily to show code in a readable view.
Plugin's DartSyntaxHighlighter
class uses the chosen SyntaxHighlighterStyle
to render file content using proper syntax highlighting.
Widget highlightCodeSyntax(String codeContent, BuildContext context) {
final SyntaxHighlighterStyle style =
Theme.of(context).brightness == Brightness.dark
? SyntaxHighlighterStyle.darkThemeStyle()
: SyntaxHighlighterStyle.lightThemeStyle();
return Container(
constraints: BoxConstraints.expand(),
child: Scrollbar(
child: SingleChildScrollView(
child: SingleChildScrollView(
scrollDirection: Axis.horizontal,
child: RichText(
textScaleFactor: this.scaleFactorText,
text: TextSpan(
style: TextStyle(fontFamily: 'monospace', fontSize: 12.0),
children: <TextSpan>[
DartSyntaxHighlighter(style).format(codeContent)
],
),
),
),
),
),
);
}
Source code repo
-
Recipe source code for
CodeFileWidget
class is available here -
Flutter Cookbook project's source code is available here
References:
Happy cooking with Flutter :)
Liked the article ? Couldn't find a topic of your interest ? Please leave comments or email me about topics you would like me to write ! BTW I love cupcakes and coffee both :)
Follow me at twitter


After the trials with VTK (see A - Graphical Display) I basically gave up, until I saw a posting from Kitware announcing a new release of ParaView, version 5.9.
Since the work with VTK had issues with Python 3.7, but the new ParaView would hopefully work with Python 3.8 as available on OpenBSD, I thought to give it a try.
This is a “thick-client” “multi-paradigm” “3D-” and “2D-” and “animation” viewer for science and engineering data.
OK, but what is it really?
ParaView gives you selectivity on a multi-valued dataset (such as pressure, temperature, flows in a 3D space). You choose “pressure” for display in a 3D space, then rotate the resulting scene so you can see where pressure varies. Pressure is colour-coded so you can see high- and low-pressure regions.
Then you change from pressure to velocity and see a different view.
Mostly, the data originates from simulations generated from 3D modelling software such as OpenFOAM, Ansys, weather simulators, and so on.
ParaView has it’s own data structures as well as supporting the native formats for dozens of engineering and scientific software packages. This is based on the VTK visualization system and uses the VTK data format.
A short description of the VTK data format is: an XML file with embedded binary (or base64-coded) data describing points in space, an optional set of links between the points which describes a 2D triangular mesh or sets of 3D tetrahedrals, and values such as pressure, temperature, velocity etc at each point or tetrahedral.
Look at the Paraview website for example images.
The download is not small, about 63MB of xz-compressed C++ and C code. It takes about as long as you can imagine, or perhaps longer, to compile.
Being so big, it has many many compile options. My prior experience analyzing the VTK code helped out here. There were several issues:
The third-party library analysis was directly useful; five items needed to be used from OpenBSD ports or base to make it work (jpeg, lz4, png, tiff and glew).
The category was easy, x11, with a secondary of graphics.
The Qt version and related libraries took a bit of iteration, as Qt has several names for the same things and sometimes embeds some named features into a common library. The Makefile has these figured out.
The WANTLIB and LIB_DEPENDS / RUN_DEPENDS was determined by porting tools, again after some iterations.
For the result, see my posting at New: x11/paraview on @ports.
Paraview is well-integrated with Python (version 3.8). It defines a separate python instance (“pvpython”) with access to numerous ParaView and VTK python modules, most of which are implemented in C++.
As usual with python, the python integration code and related shared libraries are
located at /usr/local/lib/python3.8/site-packages/paraview/
.
The relevent shared objects are located in paraview/modules/
and
are named *.so under the site-packages/paraview
directory.
However, ParaView itself is also composed of a large number of standard
shared object files, located in /usr/local/lib
. Thus there are many
shared objects delivered in a ParaView build.
When you look these over, many of the python shared objects
have similar names to the ParaView shared
objects at /usr/local/lib/. For example,
vtkRemotingApplication.so
for python and
libvtkRemotingApplication.so.0.0
in /usr/local/lib
.
So why is this an issue? It has to do with how Paraview is built (with cmake), and how OpenBSD manages shared-library versions to suit itself, rather than the arbitrary and unpredictable version numbering of thousands of different package originators.
When OpenBSD compiler tools (including cmake, which is modified for OpenBSD) create a shared object, they use linker options to change the version number from whatever is defined by the original source file. The OpenBSD-specific version is given in the SHARED_LIBS symbol in the Makefile.
When the shared object name matches a name in the SHARED_LIBS list (found in the port Makefile), the shared object version number is modified. The expectation is this file will appear in /usr/local/lib (or a subdirectory), and so it is created with trailing .so.NN.MM version numbers from the SHARED_LIBS list.
The ParaView python modules .so
have the same basename as the ParaView shared
objects .so.NN.MM
. This is unusual: I haven’t found any other python package in
OpenBSD ports or other linux distributions that duplicates names this way.
Usually the python modules have names distinct from any shared objects.
As a result, uniquely for OpenBSD, the python module shared objects
are renamed and
versioned by the modified cmake tools. And this breaks the pvpython
tools – they can’t find site-packages/paraview/xyz.so
because it
has been renamed to xyz.so.0.0
.
You might consider this a bug, as OpenBSD cmake is (making the linker) modify
files that are
not named libxxxx.so
. The matching algorithm in cmake is quite general;
rather that post a bugfix I did a workaround.
The Makefile is thus modified to undo the renaming for python modules in the vtkmodules and paraview modules directories. This is done by patching the cmake_install file. We also adjust the softlinks for the same files.
For reference, the cmake patch for OpenBSD is at cmake patch.
The compilation takes about an hour or so on an up-to-date 8-core Ryzen with 16GB memory. (I also built it on a Raspberry Pi 4, but had to set it single-threaded compile due to limited memory. That took a day.)
The limiting factor is compiling xmltools, included with ParaView, which requires a huge amount of RAM to build (2+GB).
The ParaView-compatible data formats are very application specific. Since I wasn’t running any of the relevent tools, I had to adapt the data sources I did have to what Paraview could read.
The astrophysics package called Arepo generates hdf5 files. An hdf5 file consists of named arrays (and scalars) embedded in a single file. Converting these to the .vtu file format took some doing (directly via the pvpython program didn’t quite work). Eventually I found the evtk package which converts numpy arrays (in turn, created by the python h5py module) to VTK compatible files.
As an (abbreviated) example, consider this fragment:
import sys
import numpy as np
import h5py
from evtk.hl import pointsToVTK
fn = sys.argv[1]
arepo=h5py.File(fn,"r")
points = arepo["PartType1"]["Coordinates"]
velocity = arepo["PartType1"]["Velocity"]
dmdensity = arepo["PartType1"]["DMDensity"]
datadict = {}
datadict["Velocity"] = arepo["PartType1"]["Velocity"][()]
datadict["DMDensity"] = arepo["PartType1"]["DMDensity"][()]
ofn="x.vtu"
pointsToVTK(ofn,
np.ravel(points[:,0],order='F'),
np.ravel(points[:,1],order='F'),
np.ravel(points[:,2],order='F'),
data = datadict)
The h5py module reads the given .hdf5 file. This file is something like a python dictionary, and is processed the same way, as you can see with the points, velocity and dmdensity expressions.
The evtk function pointsToVTK
requires some unusual inputs, requiring
separate x, y and z coordinates (rather than an array of xyz). Once
you supply a points array, the data dictionary defines any additional
scalar values at each point.
A vector definition at each point is also possible.
The result looks something like this:
Porting big complicated software is not entirely impossible, you just need perserverence and some coincident supporting tools.
February 2021/March 2021.
OpenBSD Numerics Experience - 1 - RNG
OpenBSD Numerics Experience - 2 - RNG floats
OpenBSD Numerics Experience - 3 - FFTW
OpenBSD Numerics Experience - 4 - CAF
OpenBSD Numerics Experience - 5 - MPI Networking
OpenBSD Numerics Experience - 6 - Memory Models
OpenBSD Numerics Experience - 7 - Python Image Display
OpenBSD Numerics Experience - 8 - RNGs, again
OpenBSD Numerics Experience - 9 - Nim
OpenBSD Numerics Experience - A - Graphical Display
OpenBSD Numerics Experience - B - ParaView
OpenBSD Numerics Experience - C - Numerical Debugging
OpenBSD Numerics


The name of the project is Scholarly Search Engine
It is a software that takes in input a file in a particular format (CSV) and allows one to run particular search operations
The input CSV file describes some metadata of existing scholarly articles published in a few academic journals
The project must be implemented by a group of people
You need to
form groups of at least 3 and at most 4 people
choose a name for the group (yes: a name) - it will be used to publish the ranks of the best-performing projects (more info later)
communicate the name of the group and its members (including their emails) to me by sending an email at<EMAIL_ADDRESS>All groups must be ready by next Monday (11 December)
from <group_name> import * class ScholarlySearchEngine(): def __init__(self, source_csv_file_path): self.data = process_data(source_csv_file_path) def search(self, query, col, is_number, partial_res=None): result_data = do_search(self.data, query, col, is_number, partial_res) return result_data def pretty_print(self, result_data): list_of_strings = do_pretty_print(self.data, result_data) return list_of_strings def publication_tree(self, author): pub_tree = do_publication_tree(self.data, author) return pub_tree def top_ten_authors(self): list_of_tuples = do_top_ten_authors(self.data) return list_of_tuples def coauthor_network(self, author): coauth_graph = do_coauthor_network(self.data, author) return coauth_graph
You have to develop a Python file named as your group, where spaces are substituted by underscores and the whole file is lowercase
E.g.: group Best group ever, file best_group_ever.py
The import statement must specify the module implemented by the file
E.g.: from best_group_ever import *
Each group has to implement the six functions that have been highlighted in red in the previous slide
An example of input will be provided for testing the software
def process_data(source_csv_file_path)
It takes in input a comma separated value (CSV) file, and return a data structure containing all the data included in the CSV is some form
The data can be preprocessed, changed according to some empirical rule, ordered in a certain way, etc.
These data will be automatically provided in input to the other functions
| title | authors | doi | abstract | categories | keywords | journal | volume | references | figures | tables | year |
|---|---|---|---|---|---|---|---|---|---|---|---|
| The appropriation of GitHub for curation | Yu, Wu; Na, Wang; Jessica, Kropczynski; John M., Carroll | 10.7717/peerj-cs.134 | GitHub is a widely used online collaborative software [...] | Human-Computer Interaction; Software Engineering | Curation; GitHub; Appropriation | PeerJ Computer Science | 3 | 36 | 1 | 1 | 2017 |
| ... | ... | ... | ... | ... | ... | ... | ... | ... | ... | ... | ... |
| ... | ... | ... | ... | ... | ... | ... | ... | ... | ... | ... | ... |
authors (list of strings): Given Name 1, Family Name 1; Given Name 2, Family Name 2; ...
categories (list of strings): category 1; category 2; ...
keywords (list of strings): keyword 1; keyword 2; ...
def do_search(data, query, col, is_number, partial_res=None)
data: the data returned by process_data
query: the textual query (type: string)
col: the name of the column of the data in which to search (type: string)
is_number: says if the content of the column (and, implicitly, of the query) should be interpreted as numbers instead of simple strings (type: boolean)
partial_res: if not None
, they are a reduced set of data on which the query should be applied
Return a selection of the data processed before which answer to the query
The query is a string that actually can contains a quite complex set of operations, according to the following ones:
boolean operator: and, or, not<tokens 1> <operator> <tokens 2>
comparison operator: <, >, <=, >=<operator> <tokens>
Examples:
World Wide Web and not Artificial Intelligence: search for the field containing World Wide Web
and not containing Artificial Intelligence
< 2016 or > 2017: search for the field containing a value lesser than 2016
or greater than 2017
Multiple wildcards *
can be used, e.g. World*Web
looks for all the string that matches with the word World
followed by zero or more characters, followed by the word Web
(examples: World Wide Web
, World Spider Web
, etc.)
All searches are case insensitive – e.g. searching for World
will match also strings that contain world
It must be possible to execute another do_search
on the partial data returned by a previous execution of the same function
do_pretty_print(data, result_data)
data: the data returned by process_data
result_data: the set of data returned by a previous run of the function do_search
Return a list of strings for each of the result contained in result_data
according to the following format:
<Family Name 1> <Given Name Initials 1>, [...], <Family Name N> <Given Name Initials N>. (<year>). <title>. <journal> <volume>. https://doi.org/<doi>
E.g.: Wu Y, Wang N, Kropczynski J, Carroll JM. (2017) The appropriation of GitHub for curation. PeerJ Computer Science 3. https://doi.org/10.7717/peerj-cs.134
do_publication_tree(data, author)
data: the data returned by process_data
author: the complete name (i.e. given name and family name) of the author for which one wants to retrieve its publication tree
Return all the publications written by such author described by the following tree:
root node: author name
children of root node: as many node as many years of author's publication
children of an year node: the result of the do_pretty_print
function applied to the particular article written by the author and published in that year
do_top_ten_authors(data)
data: the data returned by process_data
Return a list of tuples with two items each, where the first item is a string representing the author full name and the second item is the number of papers it has published
The tuple in the list are sorted in descending order, starting from the author with most publication
do_coauthor_network(data, author)
data: the data returned by process_data
author: the complete name (i.e. given name and family name) of the author for which one wants to retrieve its coauthor network
Return a graph having a central node for the input author and a series of additional connected nodes for each other person who co-authored a paper with the input author, where the weight of the arc connecting the input author with his co-author is the number of paper they have co-authored together
The project, i.e. the implementation of the six functions including any additional ancillary function developed, must be included in a single file named as your group, e.g. best_group_ever.py
The file must be sent by email to me at<EMAIL_ADDRESS>Submission: 2 days before the exam session (the whole group must attend the session) – e.g. send the project the 21st of January for discussing it on the session of the 23rd of January
Your project will be compared with the others in terms of efficiency (i.e. time needed for addressing specific tasks)
Maximum score = c-score + e-score + o-score = 16
All projects will run on a large CSV file
Correctness of the result: c-score <= 4
Efficiency of the software: e-score <= 4; projects ranked according to the time spent for addressing various tasks
e-score = 4
e-score = 3
e-score = 2
Oral colloquium: -8 <= o-score <= 8; it is a personal score, each member of the group has its own
At least 2 for passing the exam, otherwise an additional effort is required (new function)


Creates 'Table 1', i.e., description of baseline patient characteristics, which is essential in every medical research. Supports both continuous and categorical variables, as well as p-values and standardized mean differences. Weighted data are supported via the 'survey' package. See 'github' for a screen cast. 'tableone' was inspired by descriptive statistics functions in 'Deducer' , a Java-based GUI package by Ian Fellows. This package does not require GUI or Java, and intended for command-line users.
| Version: | 0.9.3 |
| Imports: | survey, MASS, e1071, zoo, gmodels, nlme, lmerTest, labelled, methods |
| Suggests: | survival, testthat, Matrix, dummies, Matching, reshape2, ggplot2, knitr, geepack, lme4 |
| Published: | 2018-04-29 |
| Author: | Kazuki Yoshida, Justin Bohn. |
| Maintainer: | Kazuki Yoshida <kazukiyoshida at mail.harvard.edu> |
| License: | GPL-2 |
| URL: | https://github.com/kaz-yos/tableone |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | tableone results |
| Reference manual: | tableone.pdf |
| Vignettes: |
Introduction to tableone Using standardized mean differences |
| Package source: | tableone_0.9.3.tar.gz |
| Windows binaries: | r-devel: tableone_0.9.3.zip, r-release: tableone_0.9.3.zip, r-oldrel: tableone_0.9.3.zip |
| OS X binaries: | r-release: tableone_0.9.3.tgz, r-oldrel: tableone_0.9.3.tgz |
| Old sources: | tableone archive |
| Reverse imports: | cvcrand |
| Reverse suggests: | RcmdrPlugin.EZR, rpsftm |
Please use the canonical form https://CRAN.R-project.org/package=tableone to link to this page.