Cool Longhorn Diagrams from the PDC
Here. Check out the Longhorn Architecture Diagram and the WinFX Namespace Diagram from the PDC for a look at what we're building. Also, check out an early snapshot of the WinFS Schema:
http://download.microsoft.com/download/2/7/a/27ab8218-e3d8-4261-b8e4-6ffc7bd8f199/winfsschemadiagram.vsd


ENTRAPMENT A movie review by Joe Barlow (c) Copyright 1999
STARRING: Sean Connery, Catherine Zeta-Jones, Ving Rhames, Will Patton DIRECTOR: John Amiel WRITERS: Ron Bass and William Broyles RATED: PG-13 RELEASED: 1999
RATING: *** (out of a possible ****)
"Entrapment" is a sneaky little movie-- a child, if you will, with one hand perpetually stuck in the cinematic cookie jar. So taken was I with the film's flash and style that it wasn't until driving home after the screening that I realized just how disjointed the story was. Plot twists that appeared plausible (if unlikely) while watching the film shed their coherence when subjected to mental instant-replay. Is that enough to derail the movie? I didn't think so, but I suppose that's up to the individual viewer.
To say much about the plot is to risk spoiling the surprise ending(s), so I must tread carefully. Suffice it to say that professional burglar Robert "Mac" MacDougal (Sean Connery) and insurance agent Virginia 'Gin' Baker (Zeta-Jones), who also dabbles in theft, team up to pull two big jobs which could net them a paycheck in excess of eight billion dollars. Can they trust each other? Certainly not, and this problem forms the cornerstone of the entire second half of the film. But damn, it's fun watching them try.
The movie itself is skillfully directed by John Amiel, who infuses the story with plenty of action and entertaining moments. Nor is the script without merit: in addition to some great Lawrence Block-type burglar humor, "Entrapment" is one of the few films of recent years that seems to have a pretty good grasp of how computers work. It's also the first story to do something intelligent and interesting with the concept of the Year 2000 bug. The movie's failing, and it's not necessarily a fatal one, is a lack of coherence. Clever pay-offs are sacrificed numerous times for cheap action-film cliches. Nothing new here.
Also, a couple of glaring technical problems took me out of the story. For example, why do the security doors close so slowly when Mac and Virginia are busted in a high-security setting? The whole point of these doors is to trap any burglars who make their way into the restricted area. Shouldn't those things SLAM shut instantly? But no, our two thieves have ample time to continue putzing around with the computer before casually making their escape through the not- yet-shut doorway. A minor problem, but irksome. And why does Connery's character happen to have a *parachute* of all things with him during one puzzling scene? (The biggest head-scratcher for me, though, is still the duo's plan to "download" billions of dollars onto a recordable CD-ROM. Come again?)
Sure, there are flaws, but when the performances are this much fun, who cares? Zeta-Jones in particular does great work here, as I expected she would: she proved in "The Mask of Zorro" that she's not just another pretty face, but a fine actress as well. This film will only increase her notoriety, particularly among the audience's hetereosexual males. Ving Rhames (from "Pulp Fiction") also turns in a good performance in a role that's an interesting variation on his usual hard-nosed gangster persona.
"Entrapment" is by no means the year's best action-movie ("The Matrix" still bears that distinction, at least until "The Phantom Menace" opens in three weeks), but it's hardly the worst. With a great bittersweet ending that winks at "Casablanca," the film is clever more often than not. It's also a good deal of fun... and isn't that why we go to the movies in the first place?
("Entrapment" captures your local theater on Friday, April 30th.)
E-Mail<EMAIL_ADDRESS>Joe Barlow on Film: http://www.ipass.net/~jbarlow/film.htm
If you'd like to receive new film reviews by e-mail, please write to<EMAIL_ADDRESS>-----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Home
About
Products
Blog
Contact
Contact us!
Want to talk to us?
First name:
Last name:
State your business:


PERSON PROFILE
Name
Email
Gender
Male
Female
Other
Date of Birth
(dd/mmyyyy)
Blood Group
Degree
SSC
HSC
Bsc.
Msc.
Photo


Python Tutor (created
by Philip Guo)
helps people overcome a fundamental
barrier to learning programming: understanding what happens as the
computer runs each line of code.
Write code in your web browser, see it visualized step by step, and
get live help from volunteers.
Over five million people in more than 180 countries have used
Python Tutor to visualize over 100 million pieces of code, often as a
supplement to textbooks, lectures, and online tutorials.
Read
the original research paper – Philip J. Guo. Online Python Tutor: Embeddable
Web-Based Program Visualization for CS Education. SIGCSE 2013.
 You can chat about your code and navigate
visualizations together to receive free real-time tutoring. Watch this
video
demo.


This page is used to create or query pods.
Querying pods is open to everybody.
But only login users are granted the privilege to create the new pod.
|
{{pod.name}}
owner: {{pod.owner}} |


dnsQueryPacketForHostName(hostNameSeq)
Assembles a DNS query packet for the given host name and returns it in a Sequence.
hostNameAndIPforDNSResponsePacket(dnsResponsePacketSeq)
Dissasembles the given dnsResponsePacketSeq and returns a list object containing
the hostName and IP or an error string on error.
localNameServersIPs
Returns a list of local name server IPs as a list of Sequences. Works on OSX, Unix, Windows.
|


| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Root
Marker interface describe the root of a query plan.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractDbGroupScan |
| AbstractFileGroupScan |
| AbstractGroupScan |
| AbstractGroupScanWithMetadata
Represents table group scan with metadata usage.
|
| AbstractGroupScanWithMetadata.GroupScanWithMetadataFilterer
This class is responsible for filtering different metadata levels.
|
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractSubScan |
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| DbSubScan |
| Exchange |
| Exchange.ParallelizationDependency
Exchanges are fragment boundaries in physical operator tree.
|
| FileGroupScan
FileGroupScan operator represents all data which will be scanned from FileSystem by a given physical plan.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Receiver
A receiver is one half of an exchange operator.
|
| Root
Marker interface describe the root of a query plan.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| ScanStats.GroupScanProperty |
| SchemalessScan
The type of scan operator, which allows to scan schemaless tables (
DynamicDrillTable with null selection) |
| Sender
A sender is one half of an exchange node operations.
|
| Store
An interface which supports storing a record stream.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Writer
Writer physical operator
|
| Class and Description |
|---|
| AbstractBase |
| AbstractExchange |
| AbstractJoinPop |
| AbstractMultiple
Describes an operator that expects more than one children operators as its input.
|
| AbstractReceiver |
| AbstractSender |
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractStore |
| Exchange |
| Exchange.ParallelizationDependency
Exchanges are fragment boundaries in physical operator tree.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Receiver
A receiver is one half of an exchange operator.
|
| Root
Marker interface describe the root of a query plan.
|
| Sender
A sender is one half of an exchange node operations.
|
| Store
An interface which supports storing a record stream.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Writer
Writer physical operator
|
| Class and Description |
|---|
| LateralContract
Contract between Lateral Join and any operator on right side of it consuming the input
from left side.
|
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| AbstractBase |
| AbstractSubScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| LateralContract
Contract between Lateral Join and any operator on right side of it consuming the input
from left side.
|
| PhysicalOperator |
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| Exchange |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| Exchange |
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Receiver
A receiver is one half of an exchange operator.
|
| Store
An interface which supports storing a record stream.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| Exchange |
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Store
An interface which supports storing a record stream.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractDbGroupScan |
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| IndexGroupScan
An IndexGroupScan operator represents the scan associated with an Index.
|
| Class and Description |
|---|
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| IndexGroupScan
An IndexGroupScan operator represents the scan associated with an Index.
|
| Class and Description |
|---|
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| PhysicalOperator |
| Writer
Writer physical operator
|
| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| PhysicalOperator |
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| LateralContract
Contract between Lateral Join and any operator on right side of it consuming the input
from left side.
|
| PhysicalOperator |
| Class and Description |
|---|
| AbstractGroupScan |
| Class and Description |
|---|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| Class and Description |
|---|
| AbstractGroupScan |
| AbstractWriter |
| PhysicalOperator |
| Class and Description |
|---|
| AbstractBase |
| AbstractFileGroupScan |
| AbstractGroupScan |
| AbstractGroupScanWithMetadata
Represents table group scan with metadata usage.
|
| AbstractGroupScanWithMetadata.GroupScanWithMetadataFilterer
This class is responsible for filtering different metadata levels.
|
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractSubScan |
| AbstractWriter |
| FileGroupScan
FileGroupScan operator represents all data which will be scanned from FileSystem by a given physical plan.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Writer
Writer physical operator
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| AbstractSubScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractGroupScan |
| Class and Description |
|---|
| AbstractGroupScan |
| ScanStats
Cost estimate for a scan.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractFileGroupScan |
| AbstractGroupScan |
| AbstractGroupScanWithMetadata
Represents table group scan with metadata usage.
|
| FileGroupScan
FileGroupScan operator represents all data which will be scanned from FileSystem by a given physical plan.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| AbstractSubScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| AbstractSubScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractWriter |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Writer
Writer physical operator
|
| Class and Description |
|---|
| AbstractWriter |
| PhysicalOperator |
| Class and Description |
|---|
| AbstractBase |
| AbstractDbGroupScan |
| AbstractDbSubScan |
| AbstractGroupScan |
| AbstractSubScan |
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| DbSubScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractDbGroupScan |
| AbstractGroupScan |
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractDbGroupScan |
| AbstractGroupScan |
| DbGroupScan
A DbGroupScan operator represents the scan associated with a database.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| IndexGroupScan
An IndexGroupScan operator represents the scan associated with an Index.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| Class and Description |
|---|
| AbstractGroupScan |
| AbstractWriter |
| PhysicalOperator |
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractStore |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Root
Marker interface describe the root of a query plan.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| Store
An interface which supports storing a record stream.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| AbstractBase |
| AbstractFileGroupScan |
| AbstractGroupScan |
| AbstractGroupScanWithMetadata
Represents table group scan with metadata usage.
|
| AbstractGroupScanWithMetadata.GroupScanWithMetadataFilterer
This class is responsible for filtering different metadata levels.
|
| AbstractSingle
Describes an operator that expects a single child operator as its input.
|
| AbstractWriter |
| FileGroupScan
FileGroupScan operator represents all data which will be scanned from FileSystem by a given physical plan.
|
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Scan |
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Writer
Writer physical operator
|
| Class and Description |
|---|
| AbstractBase |
| AbstractGroupScan |
| FragmentLeaf
A Physical Operator that can be the leaf node of one particular execution
fragment.
|
| GroupScan
A GroupScan operator represents all data which will be scanned by a given physical
plan.
|
| HasAffinity
Describes a physical operator that has affinity to particular nodes.
|
| Leaf
Operator which specifically is a lowest level leaf node of a query plan
across all possible fragments.
|
| PhysicalOperator |
| Scan |
| ScanStats
Cost estimate for a scan.
|
| SubScan
A SubScan operator represents the data scanned by a particular major/minor
fragment.
|
| Class and Description |
|---|
| PhysicalOperator |
| Class and Description |
|---|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Class and Description |
|---|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| Class and Description |
|---|
| AbstractPhysicalVisitor |
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
| Class and Description |
|---|
| FragmentRoot
Describes the root operation within a particular Fragment.
|
| Class and Description |
|---|
| AbstractBase |
| PhysicalOperator |
| PhysicalVisitor
Visitor class designed to traversal of a operator tree.
|
Copyright © 2021 The Apache Software Foundation. All rights reserved.


Java 1 Session 3
Review homework
Ask: any review topics to cover?
New material:
final
Packages and imports
Instance and static initializers
Pass by value vs.
pass by ref
In-class exercise: Develop blackboard inheritance tree from Animal to SiameseCat
Coding exercise:
SiameseCat and ancestor classes; use initializers and
override/overload
SiameseCat class
Create an animal
package. Put (3) classes into it: Fish, Mammal, and
Reptile. Add one attribute and one behavior to each. Create
a animal.cat package. Put (2) classes into it: Bobcat
and Siamese. Add a protected boolean to Mammal called eggs
and set to false. Set eggs to true in Reptile. Siamese should have a
parent of Mammal. Use an import for Mammal. Add the following
to Siamese: (3) static final fields: blue eye color and
brown fur color, and a String array with (3) names of your choice.
Initialize the names with a static initializer. Create a main()
method. Have a constructor that initializes a name attribute. Create
and instance of Siamese using the name constructor and print the
value of eggs.
“Truthiness” in Java. What's in a format string: review java.util.Formatter
Coding exercise:
Truthiness class to test int 0, empty string, null, and false
using %b format
Never lost: Stalking the Java API
Have students find some random classes
Focus on java.lang package, in particular the System class for how to read API doc
Coding exercise:
import and use BigDecimal
Junit and TDD intro
Quick overview of a
simple test snippet
Github intro: how to get class assignments


Always a pleasure scaffolding your apps.
Splendid Toastr
With ♥ thanks to the contributions of
Resort awesome things!


Make-a-Poll
Make-a-Poll
Popular polls
Recent polls
Statistics
About
Question
Options
(Blank fields won't be displayed)
Set poll as private
Set expiry time
hours
Limit number of votes
votes
Create Poll
Preview
Type to preview


Gray’s 14 lead Towson to 76-64 win over Saint Joseph’s
by Associated PressCHARLESTON, S.C. (AP) — Juwan Gray had 14 points and Allen Betrand 13 as Towson blew nearly all of double-digit lead before rallying back to put away Saint Joseph’s 76-64 to win seventh place at the Charleston Classic on Sunday.
The Tigers (3-4) had built an 18-point lead in the opening half and were still ahead 49-35 with less than 15 minutes to play. But the Hawks (2-5) scored 12 straight points to cut Towson’s lead to 49-47 with 11:18 to play. That’s when the Tigers pulled off a 17-2 surge to put the game away. Towson stretched the lead to 20 points in the final minutes.
Jakigh Dottin and Brian Fobbs had 12 points each for the Tigers, who salvaged a final victory here after tournament losses to No. 18 Xavier and Buffalo.
Ryan Daly had 13 points and 12 rebounds to lead the Hawks, who have lost four straight games including all three in the eight-team event.
___
For more AP college basketball coverage: https://apnews.com/Collegebasketball and http://twitter.com/AP_Top25


1 Connected Component Analysis (CCA) is a region extraction algorithm applied as a post-processing step which uses the model’s prediction to refine the output to the region that is determined most-likely to be within the lung. The probabilities for pulmonary classes are summed and thresholded prior to CCA to find a single continuous volume that is most-likely to be the lung region.


{% extends "base.html" %} {% block title %}Rebble Auth - User modify{% endblock %} {% block body %}
Considering moving subscription:
{% else %}Just moved subscription:
{% endif %}| From user: | {{ olduser.id }} ({{ olduser.name }} <{{ olduser.email }}>) |
| To user: | {{ destuser.id }} ({{ destuser.name }} <{{ destuser.email }}>) |
| ERROR | "From" user is not subscribed, so there's nothing for me to do here. |
| ERROR | "To" user is already subscribed, so I won't overwrite their subscription. |
| CAUTION | "To" user already has a Stripe customer ID, which will be overwritten. |


You might be wondering how to create your own BigJob script or how BigJob can be useful for your needs. Before delving into the remote job and data submission capabilities that BigJob has, its important to understand the basics. The easiest way to understand the most basic functionality BigJob has to offer is to run multiple jobs on your local laptop.
We will create an example which submits 4 jobs using BigJob. The jobs are all identical, except that they each record their number in their output. This type of run is called a “simple ensemble” run; it is very useful if you are running many jobs using the same executable (but perhaps different input files). Rather than submit each job individually to the queuing system and then wait for every job to become active and complete, you submit just one ‘Big’ job (called a Pilot) that reserves the number of cores needed to run all of your jobs. When this BigJob becomes active, your jobs are pulled by BigJob from the Redis server and executed.
Create a new file bigjob_example_local.py and paste the following code:
import os
import time
import sys
from pilot import PilotComputeService, ComputeDataService, State
### This is the number of jobs you want to run
NUMBER_JOBS=4
COORDINATION_URL = "redis://localhost:6379"
if __name__ == "__main__":
pilot_compute_service = PilotComputeService(COORDINATION_URL)
pilot_compute_description = { "service_url": "fork://localhost",
"number_of_processes": 1,
"working_directory": os.getenv("HOME")+"/agent",
"walltime":10
}
pilot_compute_service.create_pilot(pilot_compute_description)
compute_data_service = ComputeDataService()
compute_data_service.add_pilot_compute_service(pilot_compute_service)
print ("Finished Pilot-Job setup. Submitting compute units")
# submit compute units
for i in range(NUMBER_JOBS):
compute_unit_description = {
"executable": "/bin/echo",
"arguments": ["Hello","$ENV1","I am CU number "+str(i)],
"environment": ['ENV1=World'],
"number_of_processes": 1,
"spmd_variation":"single",
"output": "stdout.txt",
"error": "stderr.txt",
}
compute_data_service.submit_compute_unit(compute_unit_description)
print ("Waiting for compute units to complete")
compute_data_service.wait()
print ("Terminate Pilot Jobs")
compute_data_service.cancel()
pilot_compute_service.cancel()
Save the file and execute it (make sure your virtualenv is activated):
python bigjob_example_local.py
The output should look something like this:
Finished Pilot-Job setup. Submitting compute units
Waiting for compute units to complete
Terminate Pilot Jobs
Steps to interpreting your output:
1.) Remember in the Installation process when we created an agent directory where BigJob worked its magic? The agent directory is where we will find our output!
cd into your “working directory.” In the examples on this tutorial, this would be the $HOME/agent directory.
2.) The agent directory contains a directory that is named after the Pilot Service. This directory begins with bj-####, where ### is a unique identifier. cd into the bj-#### directory.
Example:
(python)-bash-3.2$ cd agent
(python)-bash-3.2$ ls
bj-bac51654-d96b-11e2-8773-a4badb0c3696
stdout-bj-bac51654-d96b-11e2-8773-a4badb0c3696-agent.txt
stderr-bj-bac51654-d96b-11e2-8773-a4badb0c3696-agent.txt
3.) If you do an ls in this directory, you should see a number of directories that begin with sj-### where ### is a unique identifier. These sj-directories represent each job that ran. For example, we ran 4 jobs in the above example (as evidenced by NUMBER_JOBS=4), so we can expect 4 sub-job directories as follows:
(python)-bash-3.2$ cd bj-bac51654-d96b-11e2-8773-a4badb0c3696/
(python)-bash-3.2$ ls
sj-bb1dcfb0-d96b-11e2-8773-a4badb0c3696
sj-bb634946-d96b-11e2-8773-a4badb0c3696
sj-bb409194-d96b-11e2-8773-a4badb0c3696
sj-bb85fd9c-d96b-11e2-8773-a4badb0c3696
4.) Contained within each sub-job directory is a stdout.txt (which contains the output of your executable) and stderr.txt (which contains the output of standard error on the command line – it will be blank if there were no errors when running your executable) file. Please note that if you defined different names for the “output” and “error” fields in your compute unit description, then the names stdout and stderr will vary.
Example:
(python)-bash-3.2$ cd sj-bb1dcfb0-d96b-11e2-8773-a4badb0c3696/
(python)-bash-3.2$ ls
stderr.txt
stdout.txt
5.) Open stdout.txt and note the output from your script.
Since working with distributed systems is inherently complex and much of the complexity is hidden within BigJob, it is necessary to do a lot of internal logging. By default, logging output is disabled, but if something goes wrong or if you’re just curious, you can enable the logging output by setting the environment variable BIGJOB_VERBOSE to a value between 1 (print only critical messages) and 5 (print all messages). Give it a try with the above example:
BIGJOB_VERBOSE=5 python bigjob_example_local.py


Getting Started
Looking to add iZambezi.css to your webpages? Simply copy-paste the stylesheet <link>
into your
before all other stylesheets to load our CSS.
<link rel="stylesheet" href="http://shorturl.at/brxR0">
Usage
Adding iZambezi elements to your webpage implements the
tag.

.izambezi [logo-name]
The class name .izambezi
is the default caller for the library. Class name .muzinda
is called to display the MuzindaHub logo.
Sizes
iZambezi elements have three size variations i.e large, small and the default size. Element sizing is achieved by adding a -lg
or -sm
suffix to the izambezi
class.

-lg
Animations
To animate an element, add the class .animated
to an element. You can include the class .infinite
for an infinite loop. Finally you need to add one of the following classes to the element::
.bounce
.flash
.pulse
.heartBeat
.bounceIn
.fadeIn
.zoomIn

.pulse
Delays
It's possible to add delays directly on the element's class attribute. Delays set the waiting-time (seconds) before animation begins. The delay class .wait-?s
where ? is any number between 2 and 5 defines the delay time before animation begins.
.wait-2s
.wait-3s
.wait-4s
.wait-5s

Speed
Animation speed can be controlled using speed specific classes. The below classes control the speed at which animations can run.
.slow
.slower
.fast
.faster

.faster


The Assassin is smiling again
Calls had reached fever pitch for Warriors captain Knowledge Musona to be axed.
by Tadious ManyepoA below-par showing in the 2021 AFCON qualifying opener against Botswana did not make the situation any better for the Anderlecht forward who has been failing to break into his side’s first team.
After a horror show at the 2019 AFCON finals in Egypt, Musona wasn’t called for national duty for the World Cup qualifier against Somalia.
Related Articles
Antipas still keen on Warriors job
Nov 21, 2019 16,935 1
Musona silences army of critics
Nov 20, 2019 19,101 6
Nov 20, 2019 26,679 1
A Derby in the shadow of Heroes
Nov 19, 2019 17,086 0
And, had caretaker coach Joey Antipas dropped him from his 18-man match day squad for the assignment in Zambia on Tuesday, very few would have raised their eyebrows.
But the Chicken Inn gaffer stuck with his man and asked him to lead the team in Lusaka.
Once he got his first touch right, coolly controlling a pass from Kuda Mahachi before he lofted for Ovidy Karuru, Musona immediately settled into the game.
That he created both goals, converted by Khama Billiat, summed up a good day in the office.

“It was a good game, we did what we wanted. We wanted three points and got them,” said Musona.
“We wanted to score first and we did but, unfortunately, at one moment we lacked concentration and we conceded.
“But the good thing is that we kept going and resisted their furious attacks and kept fighting.
“Everyone was fighting and I am so happy about that.
“The most important thing is that we managed to win the match, no matter how we played.’’
The skipper said he was relieved to see the Warriors smiling again after everything that happened against Botswana in the first match.
“It’s a good feeling, we failed to score at home and we didn’t create as many chances,’’ he said.
“I am so happy that I contributed to the team but the most important thing is not about me contributing but the three points we bagged.”
Wales-based defender, Alec Mudimu, who captained the team in Musona’s absence, also had a message to the people of this country.
“Last night (Tuesday night) was one for the country and, given a poor first half, defensive-wise we stuck together and pulled through as a united team,’’ he said.
“It’s in tough situations like that we learn it’s crucial to be together and weather the storm.
“All in all, a very important three points to keep our momentum high and unbeaten steak still running into the next games.
“Thank you everyone who took time out to support and show love and to the ones who travelled to Zambia for our crucial fixture, please be sure to travel back home safely.
“Let’s not go over our heads and stay calm as this is a marathon and not a sprint but to enjoy the moment . . . we are more than willing to work tirelessly for each other and the nation as a whole.’’ The Herald


FBI Says Kodak Black Was Under The Influence Of Drugs In Prison When He Seriously Injured A Guard
by AllHipHop StaffKodak Black added to his long list of legal troubles, after he grabbed a guard's testicles and sent him to the hospital with serious injuries.
(AllHipHop News) Kodak Black's time behind bars has already been eventful.
The pepper-sprayed blasted at Kodak Black failed to have an immediate effect and he punched the guard twice.
Then the "ZeZe" rapper grabbed the guard's testicles and squeezed them so hard that "his abdomen and intestinal wall were breached.”
The prison official was subsequently hospitalized and had to undergo surgery as a result of the incident.
According to the Miami Herald, it took four guards to properly restrain Kodak Black, who has yet to be charged for the intitial fight, or the alleged assault on the guard.


Home
Pat's Salmon Cookies
Menu
Home
Sales
Store
About Us
Welcome to Pat's Salmon Cookies. We sell salmon flavored cookies. Nuff Said!
Take a looksee at all of our locations below!


Make sure this window has focus, then you can use the arrow keys on you keyboard to move the red square and WASD for blue square


NodeTogether is an initiative to improve the diversity of the Node community by bringing people of underrepresented groups together to learn Node.js. NodeTogether is brought to you by npm and the Node.js Foundation.
We have learned from countless stories of students and mentors that our tech community loses many beginners to difficulties in the initial setup. NodeTogether seeks to make that experience better by pairing students with mentors who are expert open source contributors and to mitigate the frustration of going through the initial process alone.
We’re in it together!
NodeTogether doesn't currently have any 2017 events planned. Check back for updates.
The ideal student for a NodeTogether event is a new or junior developer who is interested in getting started with Node.js. We don’t expect you to have any programming experience and will be spending a lot of time getting a development environment set up.
Additionally, we are particularly interested in people from underrepresented groups, including but not limited to, women, people of color, people with mental and/or physical disabilities, LGBTQ, and non-binary people.
A key component to the success of NodeTogether is partnering with the local community to bring in empathetic and energetic mentors. No teaching experience is required, but it certainly is a plus!
This is your chance to give back to the community and get in touch with exciting new programming talents. Don’t be shy! Everyone’s experience is valuable, and so is yours.
Apply as a mentorWe are always looking for sponsors to help fund travel for mentors, provide space for events, or catering.
Sponsors will get prominent display on event pages as well as the option to distribute swag at events.
Become a sponsor


--- title: DNS Change ---
On June 1, 2023, RiiConnect24 will be deprecating the old server used to provide DNS services (<IP_ADDRESS>) and you can no longer connect to RiiConnect24 using that DNS. Additionally, that DNS is used by some people to enjoy games online using Wiimmfi using Wii or DS. You will have to change the DNS on that as well. In order to continue using RiiConnect24, you must change your DNS to the following on your Wii and/or DS...
Thank you for the continued support of RiiConnect24.
P.S. Be sure to join our Discord to receive important updates regarding RiiConnect24, as we are no longer using Twitter as a form of communication because of the state of the platform because of Elon Musk and other reasons.
P.P.S. Our website needs a revamp, we're gonna try to have it revamped to give it a nice fresh coat of paint.


import pandas as pd
import numpy as np
from astroquery.sdss import SDSS
from astropy import coordinates as coords
from astropy import units as u
from astropy import table
from astropy.io import ascii as save_asc
from astropy.io import fits
import os
import sys
import scipy.signal as signal
import matplotlib.pyplot as plt
from astropy.cosmology import FlatLambdaCDM
import copy
cosmo = FlatLambdaCDM(H0=70, Om0=0.3)
[docs]def _log(message):
"""
Simple error logging function
Parameters
----------
message : str
message to be added to log file
"""
filename = 'errorlog'
with open(filename, 'a') as f:
line = message + '\n'
f.write(line)
[docs]def should_download(table):
"""
Checks if any spectra in the table need to be processed
Parameters
----------
table : astropy table
Chunk of spectra to check
Returns
-------
download : bool
Whether or not to run processing at all
table : astropy table
Table with the objects that need processing
"""
download = True
select = zip(table['mjd'], table['plate'], table['fiberID'])
names = [str(a) + '_' + str(b) + '_' + str(c) for a, b, c in select]
name_list = ['./data/lines/' + name + '.pkl' for name in names]
exists = [os.path.isfile(name) for name in name_list]
if np.all(np.array(exists)):
download = False
_log('All files exist. No download required')
else:
table = copy.deepcopy(table[np.where(~np.array(exists))])
msg = '{} files should be downloaded.'.format(len(table))
msg += '{}'.format(exists)
_log(msg)
return download, table
[docs]def make_SDSS_idlist(filename, clobber=False, verbose=True):
"""
Creates a master file with quantities that provide unique identification in
the SDSS: ra, dec, mjd, plate number, and fiber ID.
The spectra are selected to be galaxies and classified as starbursts
=> EW(Ha) > 50 Å.
This can then be used to get the corresponding spectra in chunks at a
later stage.
Parameters
----------
filename : str
Name of the savefile
clobber : bool
Whether to remake the list file
verbose : bool
Sets print level.
Returns
------
Notes
-----
Saves a list of interesting SDSS id's for all galaxies with spectra
"""
if os.path.isfile(filename):
if clobber:
query = ''' SELECT s.ra, s.dec, s.mjd, s.plate, s.fiberID
FROM PhotoObjAll AS p JOIN SpecObjAll s ON p.objID = s.bestObjID
WHERE s.class='GALAXY' AND s.subclass='STARBURST'
'''
res = SDSS.query_sql(query, data_release=12)
if verbose:
print(res)
save_asc.write(res, filename, overwrite=True)
else:
if verbose:
print('File exists. Skipping query')
else:
_log('File {} exists. Skipping query'.format(filename))
else:
query = ''' SELECT s.ra, s.dec, s.mjd, s.plate, s.fiberID
FROM SpecObjAll AS s
WHERE s.class='GALAXY' AND s.subclass='STARBURST'
'''
res = SDSS.query_sql(query, data_release=12)
if verbose:
print(res)
save_asc.write(res, filename, overwrite=True)
[docs]def load_table(listname, length=10, all=False):
"""
Loads a section of the SDSS id list and removes it from the coordinate list
Parameters
----------
listname : str
Name of the file to load from
length : int
Length of chunk to return
all : bool
If true returns the full list
Returns
-------
table : pandas.DataFrame
DataFrame with the information needed by SDSS.get_spectra.
remaining : int
Remaining rows in list
"""
res = save_asc.read(listname)
if all:
return res
try:
table = res[:length]
res = res[length:]
save_asc.write(res, listname, overwrite=True)
remaining = len(res)
except IndexError:
table = res
remaining = 0
return table, remaining
[docs]def chunk_table(table, chunksize=10):
"""
Separates the table into multiprocessing chunks
Parameters
----------
table : astropy.table
Full table object
chunksize : int, optional
Default size of chunks is 10
Returns
-------
result : list
"""
remaining = 1
result = []
while remaining > 0:
try:
res = copy.deepcopy(table[:chunksize])
table = table[chunksize:]
# save_asc.write(table, listname, overwrite=True)
remaining = len(table)
except IndexError:
res = copy.deepcopy(table)
remaining = 0
result.append(res)
return result
[docs]def download_spectra(table, data_dir, save_raw=True, raw_dir=None):
"""
Downloads SDSS spectra
Parameters
----------
table : AstroPy.Table
Table with coordinates
data_dir : str
Specifies directory where the data is saved
save_raw : bool
Specifies whether the raw spectra (i.e. sdss fits) should be saved
raw_dir : str, optional
Specifies save directory for the raw spectra. If raw_dir=None and
save_raw is True it defaults to data_dir
Returns
-------
spectra : list
List of HDU objects
filenames : list
List of filenames to be used when saving linemeasurements
"""
select = zip(table['mjd'], table['plate'], table['fiberID'])
spectra = []
filenames = []
for mjd, plate, fiberID in select:
# Get the spectrum from the SDSS
spec = SDSS.get_spectra_async(mjd=mjd, plate=plate, fiberID=fiberID)
# Load the HDU object
fits_object = spec[0].get_fits()
spectra.append(fits_object)
# Save it to file
filename = './temp/{}_{}_{}.fits'.format(mjd, plate, fiberID)
filenames.append('{}_{}_{}'.format(mjd, plate, fiberID))
try:
fits_object.writeto(filename)
except OSError:
print('Spectrum already saved. Skipping')
_log('Spectrum {} already saved. Skipping'.format(filename))
return spectra, filenames
[docs]def process_spectra(spectra, save_res=True, save_name=None, clobber=False):
"""
Coordinates the measuring of lines and removal of continuum from sdss
spectra. The steps that are performed are:
- Unpacking the spectrum
- Redshifting
- Continuum subtraction
- Line measuring
Parameters
----------
spectra : list
List of HDU objects conforming to the SDSS standard
save_res : bool
Whether or not to save the individual dataframes
save_dir : str
Filenames where the dataframe pickles will be saved
Returns
-------
objects : list
List of dataframes with measured line fluxes. If all files have already
been created returns empty list.
"""
objects = []
for i, spectrum in enumerate(spectra):
# Check if the file exists first
file_exists = os.path.isfile(save_name[i] + '.pkl')
if file_exists:
_log(save_name[i] + '.pkl exists. Skipping processing')
else:
wavelength, flux, z = unpack_spectrum(spectrum)
nflux = normalize(wavelength, flux)
zwave = wavelength / (1 + z)
lines = measure_lines(wl=zwave, flux=nflux * 1e-17,
linelist='./data/lines.list')
lum_dist = cosmo.luminosity_distance(z)
lum_dist_cm = lum_dist.to(u.cm).value
lines['flux'] = lines.flux * (4 * np.pi * lum_dist_cm**2)
if save_res:
assert save_name is not None
# Pickle the result
lines.to_pickle(save_name[i] + '.pkl')
objects.append(lines)
return objects
[docs]def unpack_spectrum(HDU_list):
"""
Unpacks and extracts the relevant parts of an SDSS HDU list object.
Parameters
----------
HDU_list : astropy HDUlist object
Returns
-------
wavelengths : ndarray
Wavelength array
flux : ndarray
Flux array
z : float
Redshift of the galaxy
"""
table_data = HDU_list[0].header
z = HDU_list[2].data[0][63]
wavelengths = 10 ** HDU_list[1].data['loglam']
flux = HDU_list[1].data['flux']
return wavelengths, flux, z
[docs]def normalize(wavelength, flux, kernel=51):
"""
Function that normalizes the input spectrum using median filtering
Parameters
----------
wavelength : ndarray
Array of wavelengths in Ångström
flux : ndarray
Array of same length as wavelength. Units should be erg/s/Å
Returns
-------
normalized_flux : ndarray
Normalized flux array
"""
continuum = signal.medfilt(flux, kernel_size=kernel)
normalized_flux = flux - continuum
# plt.figure()
# plt.plot(wavelength, normalized_flux)
# plt.show()
return normalized_flux
[docs]def measure_lines(wl, flux, linelist, method='narrowband', width=40):
"""
Measures a set of emission lines to get fluxes that can be compared to
cloudy.
Parameters
----------
wl : ndarray
Array of wavelengths in Ångström
flux : ndarray
Continuum_subtracted flux. Array of same length as wavelength.
Units should be erg/s/Å
linelist : str
List with line names and wavelengths. Tab separated
method : {'narrowband', 'gaussian'}
Selects the fitting method. Narrowband integrates the continuum
subtracted spectrum over a small box around each line to get the line
flux. Gaussian fits a set of gaussians to all the requested lines
width : int
Width of the narrowband.
Returns
-------
results : pandas.DataFrame
Dataframe with two columns: 'name', and 'flux' as measured from the
spectrum
"""
# Read in the lines we are interested in
lines = pd.read_csv(linelist, delim_whitespace=True, header=None,
names=['name', 'wavelength'])
# Create windows
lower_edge = lines.wavelength - width / 2
upper_edge = lines.wavelength + width / 2
# Loop over the windows
fluxes = []
for le, ue in zip(lower_edge, upper_edge):
# Select spectral region
select = np.where((wl >= le) & (wl <= ue))
# Integrate the region
flux_sum = flux[select].sum()
# print(flux[select])
fluxes.append(flux_sum)
results = pd.DataFrame()
results['name'] = lines.name
results['flux'] = fluxes
return results


- Python2.6+
- M2Crypto library
- Setuptools
- pip
To install mod_auth Library you can run this command from unix shell:
>>> sudo pip install https://github.com/b3c/mod_auth/zipball/master
This module implements the session cookie format from mod_auth_tkt and mod_auth_pubtkt. In this documentation show you how to use and integrate mod_auth library into your project.
Contributors:
Before start I want say a BIG TANKS to plone.session team for tkauth.py module. It help us to start with this library:
And to Andrey Plotnikov for a easy implementation fo mod_auth_pubtkt
auth_pubtkt: https://github.com/AndreyPlotnikov/auth_pubtkt
Mod_auth library implements the session cookie format from mod_auth_tkt, the class used is Ticket. Now createTicket and validateTicket functions use the MD5 based double hashing scheme in the original mod_auth_tkt.
In mod_auth_tkt the protocol depends on a secret string shared between servers. From time to time this string should be changed, so store it in a configuration file.
>>> SECRET = 'b8fb7b6df0d64dd98b8ccd00577434d7'
The tickets are only valid for a limited time. Here we will use 24 hours
>>> DEFAULT_TIMEOUT = 24*60*60
The minimal set of attributes to create a ticket are composed only from a userid:
>>> userid = 'testUser'
First stemp is to init Ticket object:
>>> from mod_auth import Ticket
>>> mod_auth_Ticket = Ticket(SECRET)
So, set the validuntil that the user will log out.
>>> validuntil = int(time.time())+ (24*60*60)
We will create a mod_auth_tkt compatible ticket. In the simplest case no extra data is supplied.
>>> ticket = mod_auth_Ticket.createTkt(userid,validuntil=validuntil)
>>>'b054eeab313d4b75e10f4fd4ddb36ecf50115dcctestUser!'
The cookie itself should be base64 encoded. We will use the built-in Cookie module here, your web framework may supply it’s own mechanism.
>>> import Cookie, binascii
>>> cookie = Cookie.SimpleCookie()
>>> cookie['auth_tkt'] = binascii.b2a_base64(ticket).strip()
>>> print cookie
Set-Cookie: auth_tkt=YjA1NGVlYWIzMTNkNGI3NWUxMGY0ZmQ0ZGRiMzZlY2Y1MDExNWRjY3Rlc3RVc2VyIQ==
First the ticket has to be read from the cookie and unencoded:
>>> ticket = binascii.a2b_base64(cookie['auth_tkt'].value)
>>> ticket
'b054eeab313d4b75e10f4fd4ddb36ecf50115dcctestUser!'
The server that invoke validateTkt and open a session cookie need of the SECRET to validate the digest into ticket.
Init the Ticket object:
>>> from mod_auth import Ticket
>>> mod_auth_Ticket = Ticket(SECRET)
next step is to validate:
>>> mod_auth_Ticket.validateTkt(ticket)
>>> (u'testUser', (), u'',<PHONE_NUMBER>)
If the ticket is valid and not expired , validateTkt return all information about logged user else raise an Exception (see function documentation for detail)
The format allows for optional user data and tokens. For detail you can see the test.py into mod_auh module, where there are some use test of this class. Here an example:
>>> Secret = str(uuid.uuid4().hex)
>>> # Init SignedTicket object
>>> simpleTicket = Ticket(Secret)
>>> #USER DATA
>>> userid = 'TestUser'
>>> tokens = ('role1', 'role2')
>>> userdata = ('testuser@mail.com','Italy','Bologna')
>>> cip = '<IP_ADDRESS>'
>>> # ticket is valdi until 24 from now
>>> validuntil = int(time.time())+ (24*60*60)
>>> #END USERDATA
>>> ticket = simpleTicket.createTkt(userid,tokens,userdata,cip,validuntil)
mod_auth_pubtkt is a module that authenticates a user based on a cookie with a ticket that has been issued by a central login server and digitally signed using either RSA or DSA. This means that only the trusted login server has the private key required to generate tickets, while web servers only need the corresponding public key to verify them.
In mod_auth module is implemented by SignedTicket class.
BE CAREFUL!For your safety, please, if you use this module in your project, generate new keys (DSA or RSA) , to do that see the section below:
From your unix shell. DSA:
openssl dsaparam -out dsaparam.pem 2048
openssl gendsa -out privDSAkey.pem dsaparam.pem
openssl dsa -in privDSAkey.pem -out pubDSAkey.pem -pubout
The dsaparam.pem file is not needed anymore after key generation and can safely be deleted.
RSA:
openssl genDSArsa -out privkey.pem 2048
openssl rsa -in privDSAkey.pem -out pubkey.pem -pubout
Like into Ticket class , the minimal set of attributes to create a ticket are composed only by a userid:
>>> userid = 'testUser'
First stemp is to init SignedTicket object with your keys:
>>> from mod_auth import SignedTicket
>>> mod_auth_pubTicket = Ticket(path_pub_key,path_priv_key)
you can use RSA or DSA keys in pem or der format.
So, set the validuntil that the user will log out.
>>> validuntil = int(time.time())+ (24*60*60)
We will create a mod_auth_pubtkt compatible ticket. In the simplest case no extra data is supplied.
>>> ticket = mod_auth_pubTicket.createTkt(userid,validuntil=validuntil)
>>>'uid=testUser;validuntil=1343379094;cip=<IP_ADDRESS>;sig=MC0CFQCJexq0701MPIcUYHoacJCKCbor1gIUI+oPZElmsNY8/rmk069+ef/u47o='
The cookie itself should be base64 encoded. We will use the built-in Cookie module here, your web framework may supply it’s own mechanism.
>>> import Cookie, binascii
>>> cookie = Cookie.SimpleCookie()
>>> cookie['auth_tkt'] = binascii.b2a_base64(ticket).strip()
>>> print cookie
Set-Cookie: auth_tkt=dWlkPXRlc3RVc2VyO3ZhbGlkdW50aWw9MTM0MzM3OTA5NDtjaXA9MC4wLjAuMDtzaWc9TUMwQ0ZEK1RibmpjMi91OEdjZVBGMm1MK24xTXk5bjRBaFVBalBFYTRDZ1RORHhMV2dlWjZTVjhjSGN3S3pRPQ==
First the ticket has to be read from the cookie and unencoded:
>>> ticket = binascii.a2b_base64(cookie['auth_tkt'].value)
>>> ticket
'uid=testUser;validuntil=1343379094;cip=<IP_ADDRESS>;sig=MC0CFQCJexq0701MPIcUYHoacJCKCbor1gIUI+oPZElmsNY8/rmk069+ef/u47o='
The server that invoke validateTkt and open a session cookie need at least public Key. Init the Ticket object:
>>> from mod_auth import SignedTicket
>>> mod_auth_pubTicket = SignedTicket(path_pub_key)
## if you init with public key , SignedTicket can only validate and not create
next step is to validate:
>>> mod_auth_pubTicket.validateTkt(ticket)
>>> (u'testUser', [], [],<PHONE_NUMBER>)
If the ticket is valid with valid sign and not expired , validateTkt return all information about logged user else raise an Exception (see function documentation for detail)
The format allows for optional user data and tokens. For detail you can see the test.py into mod_auh module, where there are some use test of this class. Here an example:
>>> # Init SignedTicket object
>>> signTicket = SignedTicket('./DSApubkey.pem','./DSAprivkey.pem')
>>> #USER DATA
>>> userid = 'TestUser'
>>> tokens = ('role1', 'role2')
>>> userdata = ('testuser@mail.com','Italy','Bologna')
>>> cip = '<IP_ADDRESS>'
>>> # ticket is valdi until 24h from now
>>> validuntil = int(time.time())+ (24*60*60)
>>> #END USERDATA
>>> ticket = signTicket.createTkt(userid,tokens,userdata,cip,validuntil)
To start with mod_auth Library you can use Simple function to create and validate Ticket. They based on mod_auth_tkt cookie authentication and work with minimum set of attribute , SECRET and USERID. SECRET have to be shared with all server where you intend to use tickets system authetication. Example of use:
>>> from mod_auth import createSimpleTicket
>>> from mod_auth import validateSimpleTicket
>>> SECRET = 'b8fb7b6df0d64dd98b8ccd00577434d7'
>>> userid = 'testUser'
#Ticket creation
>>> tkt = createSimpleTicket(SECRET,userid)
>>> tkt
>>> '1cfdad68a9f9b70227da2bbd99ca462e5011c7b7testUser!'
#Ticket validation
>>> validateSimpleTicket(tkt)
>>> (u'testUser', (), u'',<PHONE_NUMBER>)
Simple way to use mod_auth_tkt cookie authentication. To create a ticket it need only of SECRET and userid.
Arguments:
- secret (string):
- secret key.
- userid (string):
- Unique user identifier.
Optional arguments:
- tokens (tupla):
- tokens list.
- user_data (tupla):
- user data list
Return:
- ticket (string):
- mod_auth_ticket format.
Simple way to use mod_auth_tkt cookie authentication. To validate a ticket it need only of SECRET and ticket.
Arguments:
- secret (string):
- secret key.
- ticket (string):
- Ticket string value.
Return:
- fields (tupla):
- ticket’s fields format (userid, tocken, userdata, validuntil)
Mod_auth_pubtkt style cookie authentication class.
Parse and verify auth_pubtkt ticket.
Returns tupla with ticket’s fields format: (userid, tocken, userdata, validuntil)
TicketParseError exceptions can be raised in case of invalid ticket format or signature verification failure.
TicketExpired exceptions raised if ticket expire.
Arguments:
- ticket (string):
- Ticket string value.
- now (string):
- Timestamp of client datetime, if not set , server timestamp is used.
- encoding:
- encoding of the data into ticket
Return:
- fields (tupla):
- ticket’s fields format (userid, tocken, userdata, validuntil)
Create mod_auth_pubtkt ticket.
Returns a valid ticket string.
Arguments:
- userid (string):
- Unique user identifier.
Optional arguments:
- tokens (tupla):
- tokens list.
- user_data (tupla):
- user data list
- cip (string):
- user client ip.
- validuntil (string):
- timestamp of ticket expiration.
- encoding :
- encoding of the data into ticket
Return:
- ticket (string):
- mod_auth_pubtkt signed ticket format.
Mod_auth_tkt style cookie authentication class.
To validate, a new ticket is created from the data extracted from cookie and the shared secret. The two digests are compared and timestamp checked.
Successful validation returns a tupla with ticket’s fields format: (userid, tocken, userdata, validuntil)
BadTicket exceptions can be raised in case of invalid ticket format or digest verification failure.
TicketExpired exceptions raised if ticket expire.
Arguments:
- ticket (string):
- Ticket string value.
- cip (string):
- if createtkt was set client ip, here it need too, because it validate the digest.
- now (string):
- Timestamp of client datetime, if not set , server timestamp is used.
- encoding:
- encoding of the data into ticket
Return:
- fields (tupla):
- ticket’s fields format (userid, tocken, userdata, validuntil)
Create mod_auth_pubtkt ticket.
Returns a valid ticket string.
Arguments:
- userid (string):
- Unique user identifier.
Optional arguments:
- tokens (tupla):
- tokens list.
- user_data (tupla):
- user data list
- cip (string):
- user client ip.
- validuntil (string):
- timestamp of ticket expiration.
- encoding :
- encoding of the data into ticket
Return:
- ticket (string):
- mod_auth_ticket format.
Exception raised when a signature verification is failed
Exception raised when a ticket has invalid format
mod_auth is Copyright 2012 SuperComputer Solutions S.r.l (SCS)
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
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.


Tech Volunteer Opportunities for Women in Seattle:
Volunteer Opportunities to Serve the Current Generation of Women in Technology:
ADA Developers Academy
https://adadevelopersacademy.org/volunteer/
Volunteer Opportunities:
- Private Tutor
- Teaching Assistant
- Industry Mentors
- Community Support
- Admissions Volunteers
- Mock Interviewers
ADA Developers Academy is a non-profit, tuition-free coding school for women and gender diverse adults.
Girls in Tech
https://seattle.girlsintech.org/
Volunteer Opportunities:
Girls in Tech’s Mentorship Program focuses on the education and empowerment of women in technology and
entrepreneurship.
She's Coding
http://shescoding.org/
Volunteer Opportunities:
- Events
- Tech Women Rising Conference
- Open-Source Development
- Organization
- Board
She's Coding is an open-source project developed in cooperation with the documentary film: Code:
Debugging the Gender Gap. She's Coding provides education, resources, and actionable guidelines for
anyone who wants to help bridge the gap in the field of computer science.
Volunteer Opportunities to Serve the Next Generation of Women in Technology:
ChickTech Seattle
https://seattle.chicktech.org/
"ChickTech is dedicated to retaining women in the technology workforce and increasing the number of
women and girls pursuing technology-based careers.”
Volunteer Opportunities:
- Mentors
- Marketing
- Fundraising
ChickTech High School:
ChickTech High School is a year-long series of opportunities for 100 young women in the Puget Sound
Area, providing hands-on workshops and mentoring.
ChickTech: K-8:
ChickTech facilitates hands-on, technology education programs for the younger ChickTech generation (for
female-identified youth that are entering kindergarten through eighth grade). The goal of every event is
to give girls the opportunity to explore technology at an early age.
GEMS
Girls in Engineering, Math, and Science by the Seattle Association of Women in Science
http://seattleawis.org/awis-events/gems/
“The goal of the program is to encourage girls to maintain and broaden their interest in STEM topics
by providing hands-on activities, mentoring, field trips, and information about a variety of
fields."
Volunteer Opportunities:
GEMS is a science, technology, engineering, and math (STEM) enrichment program for 7th and 8th-grade
girls currently attending a Seattle public school. GEMS meetings are once a month from 6:30 pm to 8:30
pm at two sites: one in South Seattle and one in South Lake Union.
Girls Who Code
https://girlswhocode.com/
"Girls Who Code is on a mission to close the gender gap in technology and to change the image of what
a programmer looks like and does."
Volunteer Opportunities:
- Start a Club
(Note: After school clubs are for 3rd-5th and 6th-12th-grade girls to
explore coding in a fun and friendly environment)
Ignite Worldwide
Inspiring Girls Now In Technology Evolution
http://www.igniteworldwide.org/
"Ignite's mission is to create opportunities to spark girls' excitement about technology careers and
inspire than to new possibilities."
Volunteer Opportunities:
- Panel Speaker
(Share your story and speak about the challenges and successes of your
STEM career)
Ignite serves self-identifying girls and non-binary students in grades K-12 and college from all
backgrounds by interacting with professional women in technology careers during the school day.
SPIN Girls
http://www.stempaths.org/spin-girls
"SPIN Girls provides fun, interactive, and high-quality STEM education to 8th-10th-grade girls of
color- empowering them with the skills, confidence, and connections to pursue careers in
STEM.”
Volunteer Opportunities:
- Mentors
- Field Day Partners
SPIN Girls is open to female-identified students entering 8th-grade in a King County school. Girls of
color with the potential for leadership and excellence are strongly encouraged to apply. SPIN Girls
comes together 10 times over the course of a school year for Lab Days and Field Days.
Techbridge Girls
https://www.techbridgegirls.org/
“Techbridge Girls excites, educates, and equips girls from low-income communities by delivering
high-quality STEM programming that empowers a girl to achieve economic mobility and better life
chances.”
Volunteer Opportunities:
- Role Models
- Career Exploration Visit Hosts
- Showcase Sponsors
- Advisory Council Members
Techbridge provides training to equip volunteers to be effective role models and provides practical tips
on engaging youth in STEM.
Techbridge Girls designs and delivers high-quality, fun STEM programs and learning experiences and
trains educators to deliver their unique programs to marginalized girls across the U.S.


#include <ts.h>
Definition at line 230 of file ts.h.
Definition at line 231 of file ts.h.
Definition at line 232 of file ts.h.
Definition at line 233 of file ts.h.


Intro
Cesar is an extremely strong UI/UX architect, graphic designer, manager, and programmer. He is an excellent problem solver, usually at the center of the crux between business, design, and development to create elegant and cohesive solutions utilizing his creative capabilities and years of experience. Cesar works well under pressure and can handle even the fastest approaching deadlines.


Promise
@interface Promise : NSObject
A Promise implementation that simplifies asynchronous code.
-
The Resolved blocks to be called when the promise is resolved.
Declaration
Objective-C
@property (readwrite, strong, nonatomic) NSMutableArray *_Nonnull resultObservers;
Swift
var resultObservers: NSMutableArray { get set }
-
The Rejected blocks to be called when the promise is rejected.
Declaration
Objective-C
@property (readwrite, strong, nonatomic) NSMutableArray *_Nonnull errorObservers;
Swift
var errorObservers: NSMutableArray { get set }
-
If the promise has been resolved.
Declaration
Objective-C
@property (assign, readwrite, atomic) BOOL resolved;
Swift
var resolved: Bool { get set }
-
The result of the promise in case it has been resolved.
Declaration
Objective-C
@property (readwrite, strong, nonatomic) id _Nullable result;
Swift
var result: Any? { get set }
-
The error of the promise in case it has been rejected.
Declaration
Objective-C
@property (readwrite, strong, nonatomic) NSError *_Nonnull error;
Swift
var error: Error { get set }
-
The constructor of a Promise instance.
Declaration
Objective-C
- (nonnull instancetype)initWithExecutor:(nonnull Executor)executor;
Swift
init(executor: @escaping Executor)
Parameters
executor
The block to be asynchronously executed that will resolve or reject the promise.
Return Value
The Promise instance created.
-
Calls the provided Resolved block with the result of the promise if it is resolved.
Declaration
Objective-C
- (nonnull Promise *)then:(nonnull Resolved)resolved;
Swift
func then(_ resolved: @escaping Resolved) -> Promise
Parameters
resolved
The Resolved block to be called.
Return Value
The Promise instance itself.
-
Helper method that executes multiple promises in parallel and returns a Promise that is resolved when all the provided promises have finished executing.
Declaration
Objective-C
+ (nonnull Promise *)all:(nonnull NSArray *)promises;
Swift
class func all(_ promises: [Any]) -> Promise
Parameters
promises
The promises to be executed.
Return Value
A Promise instance where the result is a NSArray with the results of all the provided promises.


A website by Eric Wan
TL;DR I'm playing a key Product Management/COO role in this Android app for students to vend out extra portions of food they cook. I've storyboarded and wireframed, and will likely start development at HackGT.
Two friends, who are actually twin brothers, came to me with an idea that they wanted to move forwards with. They were Business majors, with very little technical knowledge, and needed my brilliant CS major brain to give them a hand. They told me their idea for hopping on the Uber hype train of "x-sharing" - and it was actually pretty good!
The idea was based on the fact that cooking for one is the WORST.  Cooking for a group would take only a tiny bit more time, so if you had a means to vend off extra portions, you could make better use of your cooking time AND pick up some money on the side!
I grilled them on the logistics of how everything would play out. In the end, I constructed a list of use cases, with each and every step listed. With the process documented, I was able to sketch out a basic storyboard and then a wireframe of both sides of the app: vendor and vendee.
I gave a lot of direction on this particular project and got to flex my product management muscles. I knew what logistical issues to work out in the business model - as well as how to expedite the process of getting cooked food into the hands of a customer. I pushed my friends to do the first round of customer discovery - we wrote a survey to give out to other Tech students. And it turned out great!
On the flip side, I'm very knowledgeable on how to develop the application. Undergoing the storyboarding process brought up technical questions (that I kept to myself) and business questions that we discussed together. We decided to go with Android over iOS not just because I have Android/Java experience, but also, Android holds the larger market share and we all use Android devices lol.
Unfortunately, I've been far too busy to start coding. We started in summer, but I was interning full-time with a 1-hour commute each way, so I wasn't giving up the little free time I had/my sanity for this. And I'm working part-time during this school year, with a massively overfull plate, so I'm holding off on development for now.
However, HackGT is coming up! We're all going, and I have other smarty-pants friends going too, so we might take this for a spin. It's a very solid idea and we've worked out so many of the finer details, so I'm excited!


The Fearless is a powerful ride built as a true stable nose rider. Pinched rails, a deep blended nose concave, slight lift in the tail, and some heft settle you in to the wave. This board coasted through all of the trials, and we’ve gotten enough good reviews to bring this to market for the upcoming Summer season.$250


Ars Tech
Home
Main Menu
Information Technology
Technology Lab
Product News & Reviews
Gear & Gadgets
Business of Technology
Ministry of Innovation
Security & Hacktivism
Risk Assessment
Civilization & Discontents
Law & Disorder
The Apple Ecosystem
Infinite Loop
Gaming & Entertainment
Opposable Thumbs
Science & Exploration
The Scientific Method
All Things Automotive
Cars Technica
My Stories:
0
New Since Last Visit
We Recommend
My Discussions
Log in to track your discussions.
Forums
Subscribe
Jobs
Ars Consortium


Tutorial¶
To use the web application visit .. Here you will be greeted with an welcome screen that should be similar with
Getting Started¶
To get started choose the model of your liking. 1. Simple 2. Network 3. Stochastic
Choose the model you want to start with. Data between models may not be shared, and needs to be manually transferred. Please be carefull when choosing your model !
What it can do¶
This web application can do :
- Market clearing
- Optimal network dispatching
The difference between the two models is explained here :
Network¶
The network constrained model can calculate :
- Nominal power
- Minimum power
- Maximum power
- Ramp up/ ramp down limits
- Min/max up / down time
- Initial capital cost optimization
- Start up / Start down cost optimization
- Load flow calculations (reactive power)
- Capital cost optimization
- Maximum voltage angle
- Minimum voltage angle
Using the web application¶
After you have chosen the model you want to use, you are greeted by a screen similar to this
INSERT IMAGE
You can save data to the server by clicking the option and the save button To retrieve the stored data click the option and the get button
Once you have drawn your desired layout, and made sure that all desired inputs are given. Click on the run button to send the frontend data to the backend for the optimization. Depending on the amount of generators, loads and busses it may take some time 0- 10/20 s to calculate the optimum. If the desired network is not possible you will be presented by an error screen, if this is not the case you will recieve the output.


Int
struct Int : FixedWidthInteger, SignedInteger
-
Declaration
Swift
public static func add(lhs: Int, rhs: Int) -> Int
-
Declaration
Swift
public static func zero() -> Int
-
Checks if it means true.
print(1.bool) // Prints "true"
Declaration
Swift
var bool: Bool { get }
-
Returns a local currency string.
if Locale.current.identifier == "en_US" { print(100.localCurrency) } // Prints "$100"
Declaration
Swift
var localCurrency: String? { get }
-
Returns an US dollar string.
print(100.USDollar == "$100" || 100.USDollar == "US$100") // Prints "true"
Declaration
Swift
var USDollar: String? { get }
-
Returns a currency string with a currency code.
print((-100).currency(currencyCode: "USD").USDollar == "-$100" || (-100).currency(currencyCode: "USD").USDollar == "-US$100") // Prints "true"
Declaration
Swift
func currency(currencyCode: String) -> String?
Parameters
currencyCode
A currency code is a three-letter code that is, in most cases, composed of a country’s two-character Internet country code plus an extra character to denote the currency unit.
Return Value
A string.
-
Returns true if it is an even number.
Declaration
Swift
var isEven: Bool { get }
-
Returns true if it is an odd number.
Declaration
Swift
var isOdd: Bool { get }
-
Returns true if it is a prime number.
Declaration
Swift
var isPrime: Bool { get }
-
Returns the number of 1 it has in binary representation.
print(3.numberOfBitOne) // Prints "2"
Declaration
Swift
var numberOfBitOne: Int { get }
-
Returns the number of 0 it has in binary representation.
print(3.numberOfBitOne) // Prints "0"
Declaration
Swift
var numberOfBitZero: Int { get }
-
Returns a padded string with the given field width.
print(1.padded(fieldWidth: 10) == "0000000001") // Prints "true"
Declaration
Swift
func padded(fieldWidth: Int) -> String
Parameters
fieldWidth
Field width.
Return Value
A string.
-
A new Int in a reversed order.
Declaration
Swift
var reversed: Int? { get }


Monarch donates building, patrol van to police - The Nation Newspaper
by https://www.facebook.com/alao.h.joshuaOur Reporter
The Onikogbo of Ikogbo Ejila Awori in Ogun State, Oba Nurudeen Oluwadare Osoja, has officially handed over one nine-room ultra-modern building on three plots of land built for the police by the kabiyesi, indigenes and non-indigenes of the community to the state’s Commissioner of Police, Bashir Makama.
The community also donated a 5KVA generator, chairs, tables, standing fans, computer systems, a photocopy machine and a printer to the police for the smooth running of the office.
In addition, the Chancellor of the proposed Vision University in the village, Dr (Mrs) Ngozi Okafor, donated a brand new Toyota Hillux patrol van to the police. The monarch said his administration was determined to ensure absolute peace and security of both lives and property within the community.
Read Also: RRS gets 25 patrol vehicles
He said he was quite sure that investments in the community would grow faster under a peaceful and secure atmosphere.
The kabiyesi urged parents to warn their children and wards to desist from criminal activities adding that suspected criminal tendencies should be promptly reported to the police.
Kabiyesi Osoja appealed to the Ogun State government to listen to the crying of the residents by repairing all the roads in Ejila Awori.
The commissioner thanked the community for the donations, saying they would make lives and property secure.
He appealed to the community to engage more in community policing, noting that the issue of security should not be for the police alone.


Irvine Meadow 4 Benburb 3: Penalties galore as Medda edge seven goal thriller
Reece Pearson’s spot kick 17 minutes from time was enough to clinch victory for the hosts.
by Eric McGowan, https://www.dailyrecord.co.uk/authors/eric-mcgowan/A great game for neutrals but definitely not managers.
That’s how Irvine Meadow boss Brian McGinty summed up an action packed 90 minutes that served up seven goals, four penalties and a glut of goalmouth action from start to finish.
Only at the sound of the full-time whistle could McGinty finally relax as his side hung on for all three points that lifts them to second in the West Premiership.
Meadow undoubtedly made life difficult for themselves, falling behind to an early goal then relinquishing a 3-1 lead in the second half.
There was echoes of the Pollok stalemate a few weeks ago but Reece Pearson’s spot kick 17 minutes from time was enough to clinch victory.
McGinty insisted: “I thought we deserved to win over the course of the 90 minutes.
“For the first 10 minutes or so we were sloppy and looked a bit leggy.
“But after we went behind I thought we were excellent for the rest of the first half.
“We created so many great chances and, in all honesty, if we’d gone in five or 6-1 up at half time I don’t think Benburb could have had any complaints.
“We didn’t start the second half particularly well and they’ve scored twice to put us under a bit of pressure.
“We stayed strong though and showed good character to get the win.”
Benburb got off to the perfect start when Ryan McCrone blasted them in front from the penalty spot after only nine minutes.
Meadow were awarded a penalty of their own five minutes later when Andy McLaughlin was brought down just inside the box but Mark McLennan's effort was saved by keeper Ross Connelly.
It wasn’t long before the home side were back on level terms however, McLaughlin expertly controlling the ball in mid-air and twisting to smash a first time volley into the net from 17 yards.
Brendan Sharpe then showed some fine footwork to skip past a couple of Bens’ defenders before unleashing a low drive into the net from a similar distance.
Meadow were now well on top and it was no surprise when they added a third goal 11 minutes before half-time.
McLaughlin turned provider this time, pouncing on some defensive dithering to tee up Colin Spence for a simple side footed finish from 16 yards.
Ryan Carnwath should have made it four when a low cross found him in acres of space at the back post but his shot from close range flew over the bar.
Benburb started the second half on the front foot, striker James Marks tugging a shot wide of the target early on.
The visitors then reduced the deficit in 50 minutes, Kieran McAllister’s free-kick sneaking under a defensive wall that leapt in unison and into the bottom corner of the net.
Two minutes later it was all square after the award of a third penalty, McCrone once again making no mistake from the spot.
It was end-to-end stuff and the award of yet another penalty – this time for Meadow – in 73 minutes settled the match. McLaughlin was felled again and Pearson sent the keeper the wrong way from 12 yards to make it 4-3.
Benburb pushed hard for an equaliser in the closing stages, former Medda man Marks coming closest with a last-gasp free header that crept narrowly over the crossbar much to the relief of the home players and support.


facet_nested()
forms a matrix of panels defined by row
and column faceting variables and nests grouped facets.
facet_nested(
rows = NULL,
cols = NULL,
scales = "fixed",
space = "fixed",
axes = "margins",
remove_labels = "none",
independent = "none",
shrink = TRUE,
labeller = "label_value",
as.table = TRUE,
switch = NULL,
drop = TRUE,
margins = FALSE,
nest_line = FALSE,
resect = unit(0, "mm"),
strip = strip_nested(),
bleed = NULL
)
Arguments
| rows |
A set of variables or expressions quoted by
vars() and defining faceting groups on the rows or columns
dimension. The variables can be named (the names are passed to
labeller ).
For compatibility with the classic interface, rows can also be
a formula with the rows (of the tabular display) on the LHS and
the columns (of the tabular display) on the RHS; the dot in the
formula is used to indicate there should be no faceting on this
dimension (either row or column). |
| cols |
A set of variables or expressions quoted by
vars() and defining faceting groups on the rows or columns
dimension. The variables can be named (the names are passed to
labeller ).
For compatibility with the classic interface, rows can also be
a formula with the rows (of the tabular display) on the LHS and
the columns (of the tabular display) on the RHS; the dot in the
formula is used to indicate there should be no faceting on this
dimension (either row or column). |
| scales |
A character(1) or logical(1) whether scales are shared
across facets or allowed to vary. Interacts with the independent
argument. One of the following:
"fixed" or FALSE Scales are shared across all facets
(default).
"free_x" x-scales are allowed to vary across rows.
"free_y" y-scales are allowed to vary across columns.
"free" or TRUE Scales can vary across rows and columns.
|
| space |
A character(1) or logical(1) determining whether the size of
panels are proportional to the length of the scales. When the independent
argument allows for free scales in a dimension, the panel sizes cannot be
proportional. Note that the scales argument must be free in the same
dimension as the space argument to have an effect.One of the following:
"fixed" or FALSE All panels have the same size (default).
"free_x" Panel widths are proportional to the x-scales.
"free_y" Panel heights are proportional to the y-scales.
"free" or TRUE Both the widths and heights vary according to
scales.
|
| axes |
A character(1) or logical(1) where axes should be drawn. One
of the following:
"margins" or FALSE Only draw axes at the outer margins
(default).
"x" Draw axes at the outer margins and all inner x-axes too.
"y" Draw axes at the outer margins and all inner y-axes too.
"all" or TRUE Draw the axes for every panel.
|
| remove_labels |
A character(1) or logical(1) determining whether
axis text is displayed at inner panels. One of the following:
"none" or FALSE Display axis text at all axes (default).
"x" Display axis text at outer margins and all inner y-axes.
"y" Display axis text at outer margins and all inner x-axes.
"all" or TRUE Only display axis text at the outer margins.
|
| independent |
A character(1) or logical(1) determining whether
scales can vary within a row or column of panels, like they can be in
ggplot2::facet_wrap. The scales argument must be free for the same
dimension before they can be set to independent. One of the following:
"none" or FALSE All y-scales should be fixed in a row and all
x-scales are fixed in a column (default).
"x" x-scales are allowed to vary within a column.
"y" y-scales are allowed to vary within a row.
"all" or TRUE Both x- and y-scales are allowed to vary within
a column or row respectively.
|
| shrink |
If TRUE , will shrink scales to fit output of
statistics, not raw data. If FALSE , will be range of raw data
before statistical summary. |
| labeller |
A function that takes one data frame of labels and
returns a list or data frame of character vectors. Each input
column corresponds to one factor. Thus there will be more than
one with vars(cyl, am) . Each output
column gets displayed as one separate line in the strip
label. This function should inherit from the "labeller" S3 class
for compatibility with labeller() . You can use different labeling
functions for different kind of labels, for example use label_parsed() for
formatting facet labels. label_value() is used by default,
check it for more details and pointers to other options. |
| as.table |
If TRUE , the default, the facets are laid out like
a table with highest values at the bottom-right. If FALSE , the
facets are laid out like a plot with the highest value at the top-right. |
| switch |
By default, the labels are displayed on the top and
right of the plot. If "x" , the top labels will be
displayed to the bottom. If "y" , the right-hand side
labels will be displayed to the left. Can also be set to
"both" . |
| drop |
If TRUE , the default, all factor levels not used in the
data will automatically be dropped. If FALSE , all factor levels
will be shown, regardless of whether or not they appear in the data. |
| margins |
Either a logical value or a character
vector. Margins are additional facets which contain all the data
for each of the possible values of the faceting variables. If
FALSE , no additional facets are included (the
default). If TRUE , margins are included for all faceting
variables. If specified as a character vector, it is the names of
variables for which margins are to be created. |
| nest_line |
a logical vector of length 1, indicating whether to
draw a nesting line to indicate the nesting of variables. Control the look
of the nesting line by setting the ggh4x.facet.nestline theme
element. |
| resect |
a unit vector of length 1, indicating how much the
nesting line should be shortened. |
| strip |
An object created by a call to a strip function, such as
strip_nested() . |
| bleed |
Deprecated. Use `strip = strip_nested(bleed = ...)` instead.
See details. |
Value
A FacetNested ggproto object.
Details
This function inherits the capabilities of
facet_grid2()
.
Unlike facet_grid()
, this function only automatically expands
missing variables when they have no variables in that direction, to allow
for unnested variables. It still requires at least one layer to have all
faceting variables.
Hierarchies are inferred from the order of variables supplied to
rows
or cols
. The first variable is interpreted to be the
outermost variable, while the last variable is interpreted to be the
innermost variable. They display order is always such that the outermost
variable is placed the furthest away from the panels. Strips are
automatically grouped when they span a nested variable.
The bleed
argument controls whether lower-level strips are allowed
to be merged when higher-level strips are different, i.e. they can bleed
over hierarchies. Suppose the facet_grid()
behaviour would be the
following for strips:
[_1_][_2_][_2_]
[_3_][_3_][_4_]
In such case, the default bleed = FALSE
argument would result in the
following:
[_1_][___2____]
[_3_][_3_][_4_]
Whereas bleed = TRUE
would allow the following:
[_1_][___2____]
[___3____][_4_]
See also
Examples
# Controlling the nest line
ggplot(df, aes(Sepal.Length, Petal.Length)) +
geom_point() +
facet_nested(~ nester + Species, nest_line = TRUE) +
theme(ggh4x.facet.nestline = element_line(linetype = 3))


PIG TAIL DICE
First Player
Second Player
START!
DICE
6
Player1:
TOTAL:
ROLL
HOLD
Player2:
TOTAL:
ROLL
HOLD


blog post on the creation of Nantucket
|
source code
|
email
Put in the URL to a .txt document (ie from
archive.org
) to find any accidental limericks hidden therein:


Tools & Standards
HTML 5
CSS Techniques
CSS Layouts
Responsive CSS
CSS 3
Javascript Frameworks
Dynamic Content
Templating, SEO
Methadology
Project Work


abstract fun createDigestService(): DigestService
Returns an instance of the DigestService.
CryptoServiceLibraryException - for general cryptographic exceptions.
CryptoServiceLibraryException


Warning: Humans Cannot Reliably Detect Speech Deepfakes
Kimberly T. Mai, Sergi Bray, Toby Davies, Lewis D.
Griffin
PLoS ONE, 2023
[Paper]
Large Language Models Respond to Influence Like Humans
Lewis D. Griffin, Bennett Kleinberg, Maximilian Mozes,
Kimberly T. Mai, Maria Vau, Matthew Caldwell, Augustine
Mavor-Parker
Workshop on Social Influence in Conversations, ACL, 2023
[Paper]
Explaining the Decisions of Anomalous Sound Detectors
Kimberly T. Mai, Toby Davies, Lewis D. Griffin, Emmanouil
Benetos
DCASE, 2022
[Paper]
Self-supervised losses for One-class Textual Anomaly Detection
Kimberly T. Mai, Toby Davies, Lewis D. Griffin
arXiv pre-print, 2022
[Paper]
Brittle Features May Help Anomaly Detection
Kimberly T. Mai, Toby Davies, Lewis D. Griffin
Women in Computer Vision Workshop, CVPR, 2021
[Paper]


\Course
Authored by Michael Dombrowski, http://mikedombrowski.com Original repository available at http://github.com/md100play/university-schedule-generator
This class is used only as a parent for the Section class and contains information that is the same for every
section of a course. This includes the course name, course number, field of study, and number of units
Synopsis
- // members
- private $courseName;
- private $courseNumber;
- private $fieldOfStudy;
- private $numUnits;
- private array $color = ;
- // methods
- public void __construct()
- public void getCourseTitle()
- public void getCourseNumber()
- public void getFieldOfStudy()
- public void getNumUnits()
- public void getColor()
- public void setColor()
Members
private
- $color
- $courseName
- $courseNumber
- $fieldOfStudy
- $numUnits
Methods
public
- __construct() — Constructor accepting course title, field of study, course number, and number of units
- getColor()
- getCourseNumber()
- getCourseTitle()
- getFieldOfStudy()
- getNumUnits()
- setColor()
History
-
2017-10-28T07:04:44+02:00 (commit #f90b432)
Author: Michael Dombrowski<EMAIL_ADDRESS>/ Commiter: Michael Dombrowski<EMAIL_ADDRESS>New version New version uses Pug for HTML rendering. New algorithm for generating schedules. Should be a bit more robust.
-
2017-10-28T03:53:09+02:00 (commit #48b40fe)
Author: Michael Dombrowski<EMAIL_ADDRESS>/ Commiter: Michael Dombrowski<EMAIL_ADDRESS>Begin updates
-
2016-06-11T04:37:22+02:00 (commit #bdd2ce8)
Author: Michael Dombrowski<EMAIL_ADDRESS>/ Commiter: Michael Dombrowski<EMAIL_ADDRESS>Original version


Reports
for generated applications via
start.jbpm.org
Total generated applications
Generated applications today
Generation errors
Charts
for generated business applications