A framework for automated machine learning. Concretely, the focus is on the optimisation of bagging workflows. A bagging workflows is composed by three phases: (i) generation: which and how many predictive models to learn; (ii) pruning: after learning a set of models, the worst ones are cut off from the ensemble; and (iii) integration: how the models are combined for predicting a new observation. autoBagging optimises these processes by combining metalearning and a learning to rank approach to learn from metadata. It automatically ranks 63 bagging workflows by exploiting past performance and dataset characterization. A complete description of the method can be found in: Pinto, F., Cerqueira, V., Soares, C., Mendes-Moreira, J. (2017): "autoBagging: Learning to Rank Bagging Workflows with Metalearning" arXiv preprint arXiv:1706.09367.
| Version: | 0.1.0 |
| Depends: | R (≥ 2.10) |
| Imports: | cluster, xgboost, methods, e1071, rpart, abind, caret, MASS, entropy, lsr, CORElearn, infotheo, minerva, party |
| Suggests: | testthat |
| Published: | 2017-07-02 |
| Author: | Fabio Pinto [aut], Vitor Cerqueira [cre], Carlos Soares [ctb], Joao Mendes-Moreira [ctb] |
| Maintainer: | Vitor Cerqueira <cerqueira.vitormanuel at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| Citation: | autoBagging citation info |
| Materials: | README |
| CRAN checks: | autoBagging results |
| Reference manual: | autoBagging.pdf |
| Package source: | autoBagging_0.1.0.tar.gz |
| Windows binaries: | r-devel: autoBagging_0.1.0.zip, r-release: autoBagging_0.1.0.zip, r-oldrel: autoBagging_0.1.0.zip |
| OS X binaries: | r-release: autoBagging_0.1.0.tgz, r-oldrel: autoBagging_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=autoBagging to link to this page.


Classes
The following classes are available globally.
-
This class is meant to act as an “abstract” base class, providing a simple
See moreDictionary
datastore that is stored in theUserDefaults
in the Application Bundle. It is designed to be reliable, and extremely simple to use. The storedDictionary
would be a String-keyed Dictionary ofAny
(flexible types). It s up to subclasses to specialize the typeless data. THIS IS NOT EFFICIENT OR ROBUST! It is meant as a simple “bucket” for things like application preferences. It is not an industrial data storage solution. You have been warned. Subclasses could declare their accessors asKVO
-style, thus, providing a direct way to influence persistent state. You can also directly observe the .values property. It will change when ANY pref is changed (so might not be suitable for “pick and choose” observation).Declaration
Swift
public class RVS_PersistentPrefs : NSObject
-
This class extends the prefs class to provide persistent prefs storage. This is used across all test harnesses.
See moreDeclaration
Swift
class RVS_BTDriver_Test_Harness_Prefs : RVS_PersistentPrefs
-
This is the main application delegate for the OBD-specialized test harness Mac app.
See moreDeclaration
Swift
@NSApplicationMain class RVS_BTDriver_OBD_Mac_Test_Harness_AppDelegate : NSObject
extension RVS_BTDriver_OBD_Mac_Test_Harness_AppDelegate: NSApplicationDelegate
extension RVS_BTDriver_OBD_Mac_Test_Harness_AppDelegate: RVS_BTDriverDelegate
-
This class provides some common tools for all device view controllers.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Base_Device_ViewController : RVS_BTDriver_OBD_MacOS_Test_Harness_Base_ViewController
-
This class provides some common tools for all view controllers.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Base_ViewController : NSViewController, RVS_BTDriver_DeviceSubscriberProtocol, RVS_BTDriver_OBD_DeviceDelegate
-
The main reason for creating this class was to allow us to interpret settings, and to fix an issue with Interface Builder.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Base_WindowController : NSWindowController
-
Declaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Command_ViewController : RVS_BTDriver_OBD_MacOS_Test_Harness_Base_Device_ViewController
-
This view will be used for each table cell.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Device_Detail_ViewControllerTableCellView : NSTableCellView
-
Declaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Device_Detail_ViewController : RVS_BTDriver_OBD_MacOS_Test_Harness_Base_Device_ViewController
extension RVS_BTDriver_OBD_MacOS_Test_Harness_Device_Detail_ViewController: NSTableViewDelegate
extension RVS_BTDriver_OBD_MacOS_Test_Harness_Device_Detail_ViewController: NSTableViewDataSource
-
This controls a screen that allows a direct command/response with each device, and also allows a “details” screen to appear, listing the device state.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_Device_ViewController : RVS_BTDriver_OBD_MacOS_Test_Harness_Base_Device_ViewController
extension RVS_BTDriver_OBD_MacOS_Test_Harness_Device_ViewController: NSTextFieldDelegate
-
This view controller manages the main device selection screen.
See moreDeclaration
Swift
class RVS_BTDriver_OBD_MacOS_Test_Harness_ViewController : RVS_BTDriver_OBD_MacOS_Test_Harness_Base_ViewController
extension RVS_BTDriver_OBD_MacOS_Test_Harness_ViewController: NSTableViewDelegate
extension RVS_BTDriver_OBD_MacOS_Test_Harness_ViewController: NSTableViewDataSource


Springbok Am receives hero's welcome at his home in King William's Town
by Algoa FMAfter missing out on the Springboks' Rugby World Cup victory tour recently, the residents of King William's Town in the Eastern Cape turned out in their thousands on Saturday to give a hero's welcome to one of their own, Springbok centre Lukhanyo Am.
The streets of King William's Town were filled with jubilant fans as the rugby star's motorcade moved to his home township of Zwelitsha.
The parade began from Breidbach with Am seated at the back of a convertible sedan, and moved through the town to the Steve Biko Centre in Ginsberg, before it headed to Zwelitsha.
Although there was no William Webb Ellis Trophy to show off or other Springbok teammates present, rugby supporters kept on referring to the combination of Am and wing Makazole Mapimpi, which resulted to the first Springboks try during the Rugby World Cup final.
Celebrations took place at the OR Tambo Community Hall in Zwelitsha with Eastern Cape premier Oscar Mabuyane also joining residents.
Addressing the crowd, Am said he was inspired to see so many people coming to welcome him. "It is very special to be at home with all the support of the community, from the elders to the children. This is really inspirational and I'm enjoying it," he said.
- African News Agency


 When a person goes to a web page like Bing, their computer sends a HTTP Request to a server. The server finds the appropriate HTML document and sends it back to the user's computer where a web browser interprets the page and displays it on the user's screen.
HTTP stands for Hyper Text Transport Protocol.HTML
Tags and Elements
HTML documents are made of HTML elements.  This makes them very unforgiving since a small mistake by a programmer can cause huge problems in a program.Inline vs Block Elements
HTML elements are either inline or block. Block elements form an "invisible box" around the content inside of them.


-
Our vision
. . . is for convenient, computable, credible access to the "Tree of Life" comprising expert knowledge of phylogeny: the species tree you want, in ready-to-use form, when you want it.
Approach
We are building a system of loosely coupled components (for name-reconciliation, tree discovery, pruning, grafting, scaling, etc) that can be configured flexibly, and plugged into existing tools or systems (e.g., Mesquite-o-Tastic).
An application is phylotastic to the extent that, in response to a user query S, it supplies expert phylogenetic knowledge of S, in a form useful for research, in a timely manner.
where S is a list of identifiers such as { "Mus musculus", "Homo sapiens", "Pan troglogytes" }. Try it at the Phylotastic web portal (create a list by uploading a doc containing names, scraping names from a web page, or sampling from a named taxon)!
Get involved!
Do you have a bug report, a suggestion or a feature request? Use our bit.ly/phylofeedback form, or add it to the issue list on github.
This is an open project. If you want to contribute as a programmer, use-case expert, or tester, please contact Arlin Stoltzfus (IBBR), Brian O'Meara (UTK) or Enrico Pontelli (NMSU). Do likewise if your organization (museum, institute, etc) might benefit from a collaboration to build on the tools that you see here.
More info
- explore our demo products
- browse the list of web services
- read "Phylotastic! Making tree-of-life knowledge accessible, reusable and convenient" (BMC Bioinformatics 2013, 14:158).
- for the seriously interested, read the 2014 NSF proposal (PDF)
Credits
- As of mid-2015, the Phylotastic project is funded by the National Science Foundation (#1458572 Collaborative Research: ABI Development: An open infrastructure to disseminate phylogenetic knowledge).
- We thank the OpenTree project for ongoing cooperation
- We thank the intrepid participants in the Phylotastic hackathon of 2012. The hackathon was organized by the Leadership Team and the PIs (Enrico Pontelli, Rutger Vos and Arlin Stoltzfus) of HIP (Hackathons, Interoperability, Phylogenies), a working group of NESCent. We thank NESCent, iPlant and BioSync for their initial support.
- We especially thank NESCent, the NSF-funded center that aided synthetic science and interoperability for 10 years before closing in 2015.


SOUNDSIMULATOR is a physically-accurate room acoustics sandbox. It allows the user to place sound sources and microphones in specific locations, define their orientation, sound wave and movement parameters and experience the sound as it is
heard through each of the microphones with respect to the material the room is made of, as well as its dimensions. Utilizing STEAM AUDIO as its audio plugin and Intel Embree for ray-tracing kernels, sound-related phenomena such as attenuation,
occlusion, reflection, absorption, doppler and more are detectable. The simulator enables the user to run a simulation which will produce .wav files containing the sound as it was heard in each microphone. furher more, it comes with a python
API for running automated simulations.


| PostgreSQL 9.0.10 Documentation | ||||
|---|---|---|---|---|
| Prev | Up | Chapter 9. Functions and Operators | Next |
The functions and function-like expressions described in this
section operate on values of type xml. Check Section 8.13 for information about the xml
type. The function-like expressions xmlparse
and xmlserialize
for converting to and from
type xml are not repeated here. Use of many of these
functions requires the installation to have been built
with configure --with-libxml.
A set of functions and function-like expressions are available for producing XML content from SQL data. As such, they are particularly suitable for formatting query results into XML documents for processing in client applications.
xmlcomment
(text)
The function xmlcomment
creates an XML value
containing an XML comment with the specified text as content.
The text cannot contain "--" or end with a
"-" so that the resulting construct is a valid
XML comment. If the argument is null, the result is null.
Example:
SELECT xmlcomment('hello'); xmlcomment --------------
xmlconcat
(xml[, ...])
The function xmlconcat
concatenates a list
of individual XML values to create a single value containing an
XML content fragment. Null values are omitted; the result is
only null if there are no nonnull arguments.
Example:
SELECT xmlconcat('<abc/>', '<bar>foo</bar>'); xmlconcat ---------------------- <abc/><bar>foo</bar>
XML declarations, if present, are combined as follows. If all argument values have the same XML version declaration, that version is used in the result, else no version is used. If all argument values have the standalone declaration value "yes", then that value is used in the result. If all argument values have a standalone declaration value and at least one is "no", then that is used in the result. Else the result will have no standalone declaration. If the result is determined to require a standalone declaration but no version declaration, a version declaration with version 1.0 will be used because XML requires an XML declaration to contain a version declaration. Encoding declarations are ignored and removed in all cases.
Example:
SELECT xmlconcat('<?xml version="1.1"?><foo/>', '<?xml version="1.1" standalone="no"?><bar/>'); xmlconcat ----------------------------------- <?xml version="1.1"?><foo/><bar/>
xmlelement
(name name [, xmlattributes(value [AS attname] [, ... ])] [, content, ...])
The xmlelement
expression produces an XML
element with the given name, attributes, and content.
Examples:
SELECT xmlelement(name foo); xmlelement ------------ <foo/> SELECT xmlelement(name foo, xmlattributes('xyz' as bar)); xmlelement ------------------ <foo bar="xyz"/> SELECT xmlelement(name foo, xmlattributes(current_date as bar), 'cont', 'ent'); xmlelement ------------------------------------- <foo bar="2007-01-26">content</foo>
Element and attribute names that are not valid XML names are escaped by replacing the offending characters by the sequence _xHHHH_, where HHHH is the character's Unicode codepoint in hexadecimal notation. For example:
SELECT xmlelement(name "foo$bar", xmlattributes('xyz' as "a&b")); xmlelement ---------------------------------- <foo_x0024_bar a_x0026_b="xyz"/>
An explicit attribute name need not be specified if the attribute value is a column reference, in which case the column's name will be used as the attribute name by default. In other cases, the attribute must be given an explicit name. So this example is valid:
CREATE TABLE test (a xml, b xml); SELECT xmlelement(name test, xmlattributes(a, b)) FROM test;
But these are not:
SELECT xmlelement(name test, xmlattributes('constant'), a, b) FROM test; SELECT xmlelement(name test, xmlattributes(func(a, b))) FROM test;
Element content, if specified, will be formatted according to its data type. If the content is itself of type xml, complex XML documents can be constructed. For example:
SELECT xmlelement(name foo, xmlattributes('xyz' as bar), xmlelement(name abc), xmlcomment('test'), xmlelement(name xyz)); xmlelement ---------------------------------------------- <foo bar="xyz"><abc/><xyz/></foo>
Content of other types will be formatted into valid XML character data. This means in particular that the characters <, >, and & will be converted to entities. Binary data (data type bytea) will be represented in base64 or hex encoding, depending on the setting of the configuration parameter xmlbinary. The particular behavior for individual data types is expected to evolve in order to align the SQL and PostgreSQL data types with the XML Schema specification, at which point a more precise description will appear.
xmlforest
(content [AS name] [, ...])
The xmlforest
expression produces an XML
forest (sequence) of elements using the given names and content.
Examples:
SELECT xmlforest('abc' AS foo, 123 AS bar); xmlforest ------------------------------ <foo>abc</foo><bar>123</bar> SELECT xmlforest(table_name, column_name) FROM information_schema.columns WHERE table_schema = 'pg_catalog'; xmlforest ------------------------------------------------------------------------------------------- <table_name>pg_authid</table_name><column_name>rolname</column_name> <table_name>pg_authid</table_name><column_name>rolsuper</column_name> ...
As seen in the second example, the element name can be omitted if the content value is a column reference, in which case the column name is used by default. Otherwise, a name must be specified.
Element names that are not valid XML names are escaped as shown
for xmlelement
above. Similarly, content
data is escaped to make valid XML content, unless it is already
of type xml.
Note that XML forests are not valid XML documents if they consist
of more than one element, so it might be useful to wrap
xmlforest
expressions in
xmlelement
.
xmlpi
(name target [, content])
The xmlpi
expression creates an XML
processing instruction. The content, if present, must not
contain the character sequence ?>.
Example:
SELECT xmlpi(name php, 'echo "hello world";'); xmlpi ----------------------------- <?php echo "hello world";?>
xmlroot
(xml, version text | no value [, standalone yes|no|no value])
The xmlroot
expression alters the properties
of the root node of an XML value. If a version is specified,
it replaces the value in the root node's version declaration; if a
standalone setting is specified, it replaces the value in the
root node's standalone declaration.
SELECT xmlroot(xmlparse(document '<?xml version="1.1"?><content>abc</content>'), version '1.0', standalone yes); xmlroot ---------------------------------------- <?xml version="1.0" standalone="yes"?> <content>abc</content>
xmlagg
(xml)
The function xmlagg
is, unlike the other
functions described here, an aggregate function. It concatenates the
input values to the aggregate function call,
much like xmlconcat
does, except that concatenation
occurs across rows rather than across expressions in a single row.
See Section 9.18 for additional information
about aggregate functions.
Example:
CREATE TABLE test (y int, x xml); INSERT INTO test VALUES (1, '<foo>abc</foo>'); INSERT INTO test VALUES (2, '<bar/>'); SELECT xmlagg(x) FROM test; xmlagg ---------------------- <foo>abc</foo><bar/>
To determine the order of the concatenation, an ORDER BY clause may be added to the aggregate call as described in Section 4.2.7. For example:
SELECT xmlagg(x ORDER BY y DESC) FROM test; xmlagg ---------------------- <bar/><foo>abc</foo>
The following non-standard approach used to be recommended in previous versions, and may still be useful in specific cases:
SELECT xmlagg(x) FROM (SELECT * FROM test ORDER BY y DESC) AS tab; xmlagg ---------------------- <bar/><foo>abc</foo>
xml IS DOCUMENT
The expression IS DOCUMENT returns true if the argument XML value is a proper XML document, false if it is not (that is, it is a content fragment), or null if the argument is null. See Section 8.13 about the difference between documents and content fragments.
To process values of data type xml, PostgreSQL offers
the function xpath
, which evaluates XPath 1.0
expressions.
xpath
(xpath, xml[, nsarray])
The function xpath
evaluates the XPath
expression xpath against the XML value
xml. It returns an array of XML values
corresponding to the node set produced by the XPath expression.
The second argument must be a well formed XML document. In particular, it must have a single root node element.
The third argument of the function is an array of namespace
mappings. This array should be a two-dimensional array with the
length of the second axis being equal to 2 (i.e., it should be an
array of arrays, each of which consists of exactly 2 elements).
The first element of each array entry is the namespace name (alias), the
second the namespace URI. It is not required that aliases provided in
this array are the same that those being used in the XML document itself (in
other words, both in the XML document and in the xpath
function context, aliases are local).
Example:
SELECT xpath('/my:a/text()', '<my:a xmlns:my="http://example.com">test</my:a>', ARRAY[ARRAY['my', 'http://example.com']]); xpath -------- {test} (1 row)
How to deal with default (anonymous) namespaces:
SELECT xpath('//mydefns:b/text()', 'test', ARRAY[ARRAY['mydefns', 'http://example.com']]); xpath -------- {test} (1 row)
The following functions map the contents of relational tables to XML values. They can be thought of as XML export functionality:
table_to_xml(tbl regclass, nulls boolean, tableforest boolean, targetns text) query_to_xml(query text, nulls boolean, tableforest boolean, targetns text) cursor_to_xml(cursor refcursor, count int, nulls boolean, tableforest boolean, targetns text)
The return type of each function is xml.
table_to_xml
maps the content of the named
table, passed as parameter tbl. The
regclass type accepts strings identifying tables using the
usual notation, including optional schema qualifications and
double quotes. query_to_xml
executes the
query whose text is passed as parameter
query and maps the result set.
cursor_to_xml
fetches the indicated number of
rows from the cursor specified by the parameter
cursor. This variant is recommended if
large tables have to be mapped, because the result value is built
up in memory by each function.
If tableforest is false, then the resulting XML document looks like this:
<tablename> <row> <columnname1>data</columnname1> <columnname2>data</columnname2> </row> <row> ... </row> ... </tablename>
If tableforest is true, the result is an XML content fragment that looks like this:
<tablename> <columnname1>data</columnname1> <columnname2>data</columnname2> </tablename> <tablename> ... </tablename> ...
If no table name is available, that is, when mapping a query or a cursor, the string table is used in the first format, row in the second format.
The choice between these formats is up to the user. The first
format is a proper XML document, which will be important in many
applications. The second format tends to be more useful in the
cursor_to_xml
function if the result values are to be
reassembled into one document later on. The functions for
producing XML content discussed above, in particular
xmlelement
, can be used to alter the results
to taste.
The data values are mapped in the same way as described for the
function xmlelement
above.
The parameter nulls determines whether null values should be included in the output. If true, null values in columns are represented as:
<columnname xsi:nil="true"/>
where xsi is the XML namespace prefix for XML Schema Instance. An appropriate namespace declaration will be added to the result value. If false, columns containing null values are simply omitted from the output.
The parameter targetns specifies the desired XML namespace of the result. If no particular namespace is wanted, an empty string should be passed.
The following functions return XML Schema documents describing the mappings performed by the corresponding functions above:
table_to_xmlschema(tbl regclass, nulls boolean, tableforest boolean, targetns text) query_to_xmlschema(query text, nulls boolean, tableforest boolean, targetns text) cursor_to_xmlschema(cursor refcursor, nulls boolean, tableforest boolean, targetns text)
It is essential that the same parameters are passed in order to obtain matching XML data mappings and XML Schema documents.
The following functions produce XML data mappings and the corresponding XML Schema in one document (or forest), linked together. They can be useful where self-contained and self-describing results are wanted:
table_to_xml_and_xmlschema(tbl regclass, nulls boolean, tableforest boolean, targetns text) query_to_xml_and_xmlschema(query text, nulls boolean, tableforest boolean, targetns text)
In addition, the following functions are available to produce analogous mappings of entire schemas or the entire current database:
schema_to_xml(schema name, nulls boolean, tableforest boolean, targetns text) schema_to_xmlschema(schema name, nulls boolean, tableforest boolean, targetns text) schema_to_xml_and_xmlschema(schema name, nulls boolean, tableforest boolean, targetns text) database_to_xml(nulls boolean, tableforest boolean, targetns text) database_to_xmlschema(nulls boolean, tableforest boolean, targetns text) database_to_xml_and_xmlschema(nulls boolean, tableforest boolean, targetns text)
Note that these potentially produce a lot of data, which needs to be built up in memory. When requesting content mappings of large schemas or databases, it might be worthwhile to consider mapping the tables separately instead, possibly even through a cursor.
The result of a schema content mapping looks like this:
<schemaname> table1-mapping table2-mapping ... </schemaname>
where the format of a table mapping depends on the tableforest parameter as explained above.
The result of a database content mapping looks like this:
<dbname> <schema1name> ... </schema1name> <schema2name> ... </schema2name> ... </dbname>
where the schema mapping is as above.
As an example of using the output produced by these functions,
Figure 9-1 shows an XSLT stylesheet that
converts the output of
table_to_xml_and_xmlschema
to an HTML
document containing a tabular rendition of the table data. In a
similar manner, the results from these functions can be
converted into other XML-based formats.
Figure 9-1. XSLT stylesheet for converting SQL/XML output to HTML
<?xml version="1.0"?> <xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform" xmlns:xsd="http://www.w3.org/2001/XMLSchema" xmlns="http://www.w3.org/1999/xhtml" > <xsl:output method="xml" doctype-system="http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd" doctype-public="-//W3C/DTD XHTML 1.0 Strict//EN" indent="yes"/> <xsl:template match="/*"> <xsl:variable name="schema" select="//xsd:schema"/> <xsl:variable name="tabletypename" select="$schema/xsd:element[@name=name(current())]/@type"/> <xsl:variable name="rowtypename" select="$schema/xsd:complexType[@name=$tabletypename]/xsd:sequence/xsd:element[@name='row']/@type"/>   <title><xsl:value-of select="name(current())"/></title>

 <xsl:for-each select="$schema/xsd:complexType[@name=$rowtypename]/xsd:sequence/xsd:element/@name"> <xsl:value-of select="."/>	 </xsl:for-each>
 <xsl:for-each select="row">
 <xsl:for-each select="*"> <xsl:value-of select="."/>	 </xsl:for-each>
 </xsl:for-each>
   </xsl:template> </xsl:stylesheet>


Shakhtar's Taison gets one-match ban for reacting to racist insults
Shakhtar Donetsk midfielder Taison was handed a one-match ban on Thursday after he reacted to racist abuse from the crowd during a match against Dynamo Kiev this month.
REUTERS: Shakhtar Donetsk midfielder Taison was handed a one-match ban on Thursday after he reacted to racist abuse from the crowd during a match against Dynamo Kiev this month.
Brazilian Taison, 31, stuck his finger up at a section of the stadium occupied by Dynamo Kiev fans and kicked the ball into the stands after hearing the abuse during Shakhtar's 1-0 win.
The player was sent off for the incident and was in tears as he left the pitch.
World players' union FIFPro had asked for the red card to be overturned but the Ukrainian football federation has now confirmed the suspension https://ffu.ua/article/38180.
The federation also ordered Dynamo to play one match behind closed doors and imposed a fine of 500,000 hryvnias (US$20,695).
Racist incidents have tainted European soccer in recent months.
Italian striker Mario Balotelli threatened to walk off the pitch after receiving alleged racist abuse during Brescia's Serie A match against Hellas Verona this month.
In the Dutch second division last weekend, Excelsior forward Ahmad Mendes Moreira was racially abused by a section of FC Den Bosch supporters, and the game was suspended for half an hour after the referee decided to take the players off the pitch.
The incident has prompted the Eredivisie to announce that players in the top two divisions of Dutch soccer would stand still for the first minute of matches this weekend in protest.
(Reporting by Hardik Vyas in Bengaluru, editing by Ed Osmond)


| |
|
Business Document Create Event |
Operational Business Processes |
| |
|
Operational Business Processes |
Data Warehousing |
| |
|
Operational Business Processes |
ETL |
| |
|
Operational Business Processes |
Data Vault |
| |
|
Data Warehousing |
Data Query |
| |
|
Artificial Human & Artificial Machine Intelligence |
Machine Learning |
| |
|
Artificial Human & Artificial Machine Intelligence |
Business Analytics |
| |
|
Machine Learning |
Business Analytics |
| |
|
Machine Learning |
Machine Automation |
| |
|
Data Mining |
Statistics |
| |
|
Data Mining |
Artificial Human & Artificial Machine Intelligence |
| |
|
Data Analytics |
Business Analytics |
| |
|
Data Analytics |
Reporting |
| |
|
Business Analytics |
Reporting |
| |
|
Business Analytics |
Automated Decision Support |
| |
|
Statistics |
Data Analytics |
| |
|
Statistics |
Machine Learning |
| |
|
Data Query |
Data Mining |
| |
|
Feedback |
Machine Learning |
| |
|
Reporting |
Charting |
| |
|
Reporting |
Interactive Analysis |
| |
|
Charting |
Data Visualization |
| |
|
Interactive Analysis |
Charting |
| |
|
Interactive Analysis |
Data Visualization |
| |
|
Interactive Analysis |
Bots |
| |
|
Machine Automation |
Feedback |
| |
|
Machine Automation |
Robotics |
| |
|
Automated Decision Support |
Agents |
| |
|
Bots |
Interactive Analysis |
| |
|
ETL |
Data Warehousing |
| |
|
ETL |
Data Vault |
| |
|
Business Document Receive Event |
Operational Business Processes |
| |
|
Business Document Delete Event |
Operational Business Processes |
| |
|
Data Vault |
Data Query |
| |
|
Device Sensor Data (IoT) |
Gateway |
| |
|
Other Instrumentation (Process Control Systems) |
Gateway |
| |
|
Gateway |
Router |
| |
|
Router |
Ingestion |
| |
|
Ingestion |
Operational Business Processes |


Object
`Index` is an internal cached variant of `Trail`. It assumes the file system does not change between `find` calls. All `stat` and `entries` calls are cached for the lifetime of the `Index` object.
`Index.new` is an internal method. Instead of constructing it directly, create a `Trail` and call `Trail#index`.
# File lib/hike/index.rb, line 20 def initialize(root, paths, extensions, aliases) @root = root # Freeze is used here so an error is throw if a mutator method # is called on the array. Mutating `@paths`, `@extensions`, or # `@aliases` would have unpredictable results. @paths = paths.dup.freeze @extensions = extensions.dup.freeze @aliases = aliases.inject({}) { |h, (k, a)| h[k] = a.dup.freeze; h }.freeze @pathnames = paths.map { |path| Pathname.new(path) } @stats = {} @entries = {} @patterns = {} end
A cached version of `Dir.entries` that filters out `.` files and `~` swap files. Returns an empty `Array` if the directory does not exist.
# File lib/hike/index.rb, line 78 def entries(path) key = path.to_s @entries[key] ||= Pathname.new(path).entries.reject { |entry| entry.to_s =~ /^\.|~$|^\#.*\#$/ }.sort rescue Errno::ENOENT @entries[key] = [] end
The real implementation of `find`. `Trail#find` generates a one time index and delegates here.
See `Trail#find` for usage.
# File lib/hike/index.rb, line 52 def find(*logical_paths, &block) if block_given? options = extract_options!(logical_paths) base_path = Pathname.new(options[:base_path] || @root) logical_paths.each do |logical_path| logical_path = Pathname.new(logical_path.sub(/^\//, '')) if relative?(logical_path) find_in_base_path(logical_path, base_path, &block) else find_in_paths(logical_path, &block) end end nil else find(*logical_paths) do |path| return path end end end
`Index#index` returns `self` to be compatable with the `Trail` interface.
# File lib/hike/index.rb, line 44 def index self end
`Index#root` returns root path as a `String`. This attribute is immutable.
# File lib/hike/index.rb, line 39 def root @root.to_s end
Returns a `Regexp` that matches the allowed extensions.
pattern_for("index.html") #=> /^index(.html|.htm)(.builder|.erb)*$/
# File lib/hike/index.rb, line 160 def build_pattern_for(basename) extname = basename.extname aliases = find_aliases_for(extname) if aliases.any? basename = basename.basename(extname) aliases = [extname] + aliases aliases_pattern = aliases.map { |e| Regexp.escape(e) }.join("|") basename_re = Regexp.escape(basename.to_s) + "(?:#{aliases_pattern})" else basename_re = Regexp.escape(basename.to_s) end extension_pattern = extensions.map { |e| Regexp.escape(e) }.join("|") /^#{basename_re}(?:#{extension_pattern})*$/ end
# File lib/hike/index.rb, line 101 def extract_options!(arguments) arguments.last.is_a?(Hash) ? arguments.pop.dup : {} end
# File lib/hike/index.rb, line 197 def find_aliases_for(extension) @aliases.inject([]) do |aliases, (key, value)| aliases.push(key) if value == extension aliases end end
Finds relative logical path, `../test/test_trail`. Requires a `base_path` for reference.
# File lib/hike/index.rb, line 119 def find_in_base_path(logical_path, base_path, &block) candidate = base_path.join(logical_path) dirname, basename = candidate.split match(dirname, basename, &block) if paths_contain?(dirname) end
Finds logical path across all `paths`
# File lib/hike/index.rb, line 110 def find_in_paths(logical_path, &block) dirname, basename = logical_path.split @pathnames.each do |base_path| match(base_path.join(dirname), basename, &block) end end
Checks if the path is actually on the file system and performs any syscalls if necessary.
# File lib/hike/index.rb, line 127 def match(dirname, basename) # Potential `entries` syscall matches = entries(dirname) pattern = pattern_for(basename) matches = matches.select { |m| m.to_s =~ pattern } sort_matches(matches, basename).each do |path| pathname = dirname.join(path) # Potential `stat` syscall stat = stat(pathname) # Exclude directories if stat && stat.file? yield pathname.to_s end end end
Returns true if `dirname` is a subdirectory of any of the `paths`
# File lib/hike/index.rb, line 148 def paths_contain?(dirname) paths.any? { |path| dirname.to_s[0, path.length] == path } end
Cache results of `build_pattern_for`
# File lib/hike/index.rb, line 153 def pattern_for(basename) @patterns[basename] ||= build_pattern_for(basename) end
# File lib/hike/index.rb, line 105 def relative?(logical_path) logical_path.to_s =~ /^\.\.?\// end
Sorts candidate matches by their extension priority. Extensions in the front of the `extensions` carry more weight.
# File lib/hike/index.rb, line 180 def sort_matches(matches, basename) aliases = find_aliases_for(basename.extname) matches.sort_by do |match| extnames = match.sub(basename.to_s, '').to_s.scan(/\.[^.]+/) extnames.inject(0) do |sum, ext| if i = extensions.index(ext) sum + i + 1 elsif i = aliases.index(ext) sum + i + 11 else sum end end end end
Generated with the Darkfish Rdoc Generator 2.


Connected to Twitter
You are now connected to your Twitter account. Click
here
to see your Twitter friends.


Photon-Stream (phs)
Single photon event representation for Imaging Atmospheric Cherenkov Telescopes (IACTs)
Public
High quality observations of the Crab Nebula in November 2013.
Free to use for everyone.
Please cite our
photon-stream proceeding and our general
FACT reference paper.
Feel free to provide feedback, report issues, and ask for help on GitHub.
The FACT responses to simulated air-shower observations.
This is the diffuse ceres_12.rc simulation pass.
Private
All observed air-shower events of FACT.
About 1e9 air-shower records containing about 3e12 single photons.
See ./obs/runstatus.csv to see the photon-stream integrity.
About
FACT collaboration, Sebastian A. Mueller, 2017


BAGeL Radio: What alternative rock radio should sound like. |
| Music Director / DJ: Bagel Ted |
SomaFM time is: 19:42 (02:42 gmt)
Looking for tracks we played further in the past? Our extended playlist history is available on Twitter
Album and artist links default to searching iTunes. Unfortunately, iTunes does not carry all the music that we play on SomaFM so some searches may fail to match anything. You may want to try searching on your favorite used CD store in these instances.
We attempt to link independent artists sites when we have them.
Copyright ©2000-2013 SomaFM.com, LLC. All rights reserved.
Groove Salad, Drone Zone, Cliqhop, Secret Agent, Space Station Soma, Digitalis, PopTron, Suburbs of Goa and Illinois Street Lounge are trademarks of SomaFM.com, LLC.
Privacy Policy
Lone DJ photo ©2000 Merin McDonell.


| 1 | package com.edii.spc.game.solvers; | |
| 2 | ||
| 3 | import com.edii.spc.datastructures.MinHeap; | |
| 4 | import com.edii.spc.datastructures.OwnMap; | |
| 5 | import com.edii.spc.game.GameField; | |
| 6 | import com.edii.spc.game.GameFieldEdge; | |
| 7 | import com.edii.spc.game.GameFieldNode; | |
| 8 | import com.edii.spc.game.GameFieldPath; | |
| 9 | import java.util.Comparator; | |
| 10 | import java.util.Map; | |
| 11 | ||
| 12 | /** | |
| 13 | * Ratkaisee pelikentän Dijkstran algoritmilla. | |
| 14 | */ | |
| 15 | public class DijkstraSolver implements Solver { | |
| 16 | private final Comparator<GameFieldNode> comparator = new Comparator<GameFieldNode>() { | |
| 17 | @Override | |
| 18 | public int compare(GameFieldNode node1, GameFieldNode node2) { | |
| 19 |
2
1. compare : Replaced integer subtraction with addition → TIMED_OUT 2. compare : replaced return of integer sized value with (x == 0 ? 1 : 0) → TIMED_OUT |
return distance.get(node1) - distance.get(node2); |
| 20 | } | |
| 21 | }; | |
| 22 | ||
| 23 | private volatile boolean interrupted = false; | |
| 24 | private GameField field; | |
| 25 | private Map<GameFieldNode, Integer> distance; | |
| 26 | private Map<GameFieldNode, GameFieldEdge> edgeToPrevious; | |
| 27 | private MinHeap<GameFieldNode> queue; | |
| 28 | | |
| 29 | private void init(GameField field) { | |
| 30 | this.field = field; | |
| 31 | this.distance = new OwnMap<>(); | |
| 32 | this.edgeToPrevious = new OwnMap<>(); | |
| 33 | | |
| 34 | for (GameFieldNode node : field.getNodes()) { | |
| 35 | distance.put(node, Integer.MAX_VALUE); | |
| 36 | } | |
| 37 | | |
| 38 | distance.put(field.getStart(), 0); | |
| 39 | queue = new MinHeap<>(field.getNodes(), comparator); | |
| 40 | } | |
| 41 | | |
| 42 | private GameFieldPath formPath() { | |
| 43 | GameFieldPath path = new GameFieldPath(field.getFinish()); | |
| 44 |
1
1. formPath : negated conditional → KILLED |
while (!path.getEndNode().equals(field.getStart())) { |
| 45 |
1
1. formPath : removed call to com/edii/spc/game/GameFieldPath::addEdge → TIMED_OUT |
path.addEdge(edgeToPrevious.get(path.getEndNode())); |
| 46 | } | |
| 47 |
1
1. formPath : mutated return of Object value for com/edii/spc/game/solvers/DijkstraSolver::formPath to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return path.reverse(); |
| 48 | } | |
| 49 | | |
| 50 | @Override | |
| 51 | public GameFieldPath solve(GameField field) throws InterruptedException { | |
| 52 |
1
1. solve : removed call to com/edii/spc/game/solvers/DijkstraSolver::init → KILLED |
init(field); |
| 53 | | |
| 54 |
2
1. solve : negated conditional → KILLED 2. solve : negated conditional → KILLED |
while (!interrupted && !queue.isEmpty()) { |
| 55 | GameFieldNode u = queue.extractMin(); | |
| 56 | for (GameFieldEdge edge : u.getEdges()) { | |
| 57 |
3
1. solve : changed conditional boundary → KILLED 2. solve : Replaced integer addition with subtraction → KILLED 3. solve : negated conditional → KILLED |
if (distance.get(edge.getNodes().getSecond()) > distance.get(u) + edge.getWeight()) { |
| 58 | edgeToPrevious.put(edge.getNodes().getSecond(), edge.inverse()); | |
| 59 |
1
1. solve : Replaced integer addition with subtraction → KILLED |
distance.put(edge.getNodes().getSecond(), distance.get(u) + edge.getWeight()); |
| 60 |
1
1. solve : removed call to com/edii/spc/datastructures/MinHeap::decreaseKey → TIMED_OUT |
queue.decreaseKey(edge.getNodes().getSecond()); |
| 61 | } | |
| 62 | } | |
| 63 | } | |
| 64 | | |
| 65 |
1
1. solve : negated conditional → KILLED |
if (interrupted) { |
| 66 | throw new InterruptedException(); | |
| 67 | } | |
| 68 | | |
| 69 |
1
1. solve : mutated return of Object value for com/edii/spc/game/solvers/DijkstraSolver::solve to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return formPath(); |
| 70 | } | |
| 71 | ||
| 72 | @Override | |
| 73 | public void interrupt() { | |
| 74 | interrupted = true; | |
| 75 | } | |
| 76 | } | |
Mutations | ||
| 19 |
1.1 2.2 |
|
| 44 |
1.1 |
|
| 45 |
1.1 |
|
| 47 |
1.1 |
|
| 52 |
1.1 |
|
| 54 |
1.1 2.2 |
|
| 57 |
1.1 2.2 3.3 |
|
| 59 |
1.1 |
|
| 60 |
1.1 |
|
| 65 |
1.1 |
|
| 69 |
1.1 |


|
Ext.NET
5.3.0
.NET Component Framework for Enterprise Level Apps
|
Public Member Functions | |
| Builder (TTabBar component) | |
| virtual TBuilder | EnsureActiveVisibleOnChange (bool? ensureActiveVisibleOnChange) |
| virtual TBuilder | Plain (bool plain) |
| A numeric unicode character code to use as the icon for the panel header. The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily. More... | |
| virtual TBuilder | TabRotation (int tabRotation) |
| The rotation of the tabs. More... | |
| virtual TBuilder | TabStretchMax (bool tabStretchMax) |
| true to stretch all tabs to the height of the tallest tab when the tabBar is docked horizontally, or the width of the widest tab when the tabBar is docked vertically. More... | |
| Builder () | |
| Builder (TabBar component) | |
| Builder (TabBar.Config config) | |
| Public Member Functions inherited from Ext.Net.Container.Builder< TTabBar, TBuilder > | |
| Builder (TContainer component) | |
| Builder () | |
| Builder (Container component) | |
| Builder (Container.Config config) | |
| virtual TBuilder | Listeners (Action< ContainerListeners > action) |
| Client-side JavaScript Event Handlers More... | |
| virtual TBuilder | DirectEvents (Action< ContainerDirectEvents > action) |
| Server-side Ajax Event Handlers More... | |
Static Public Member Functions | |
| static implicit | operator Builder (TabBar component) |
| Static Public Member Functions inherited from Ext.Net.Container.Builder< TTabBar, TBuilder > | |
| static implicit | operator Builder (Container component) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlinevirtual |
|
inlinestatic |
|
inlinevirtual |
A numeric unicode character code to use as the icon for the panel header. The default font-family for glyphs can be set globally using Ext.setGlyphFontFamily() or a ResourceManager's GlyphFontFamily.
|
inlinevirtual |
The rotation of the tabs.
|
inlinevirtual |
true to stretch all tabs to the height of the tallest tab when the tabBar is docked horizontally, or the width of the widest tab when the tabBar is docked vertically.


KinMS
py
:docs
About
About Astropy
Code of Conduct
Acknowledging & Citing
Get Help
Contribute
Affiliated Packages
Team
Index
Modules
Navigation
kinmspytest 2.0.0 documentation
»
Index
K
K
KinMS (class in KinMS)
KinMS_plotter (class in utils.KinMS_figures)
KinMSError (class in KinMS)
Page Contents


{% extends "base.html" %} {% block title %}{% endblock %} {% block head %} {% endblock %} {% block body %}
Growing closer with your partner is important, it shows interest and care, take a look at what {{ partner.name.capitalize() }} loves:
{% for answer in answers %}


Mission: Impossible 2
Tom Cruise is back as super secret agent Ethan Hunt who must save the world - not from nuclear war or terrorists - but from a lethal man-made virus. An original idea to be sure, but the execution of the story is not. Instead of being too confusing like the last time, this time it's almost too simple and certain key plot points and sequences are waaaaaay over the top and unbelievable. Action filmmaker John Woo certainly puts a lot more energy into this film than Brian De Palma did in 1996. We can really buy Cruise as a genuine action performer (the long, drawn-out fight scene at the end is proof of this).
Whatever you're expecting this film to be will, it WILL be, so enjoy the ride.
GRADE: B
Chad'z Movie Page is back! New reviews of the latest movies in easy-to-swallow capsule form with the trendy, Entertainment Weekly-style of letter grades instead of the old star system. Have I sold out? Visit my page and decide for yourself ;-)
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


DIAMOND
$
Safe Carz ltd provides policies of different insurance company
that we are linked. so we have a large number of plans in which
are following
View  Policy
GOLD
$
Safe Carz ltd provides policies of different insurance company
that we are linked. so we have a large number of plans in which
are following
View  Policy
SILVER
$
Safe Carz ltd provides policies of different insurance company
that we are linked. so we have a large number of plans in which
are following
View  Policy


Layout Control
Layout control allows to change wrapper class on button click.
See the Pen jPList Layout Control by 1rosehip (@1rosehip) on CodePen.
HTML Structure
Layout control is defined by required data-jplist-control="layout"
data attribute. The data-class
attribute contains a class name that will be added to the group container on button click:
<button
data-jplist-control="layout"
type="button"
data-class="jplist-list"
data-group="group1"
data-name="name1">List</button>
<button
type="button"
data-jplist-control="layout"
data-class="jplist-grid"
data-group="group1"
data-name="name1"
data-selected="true">Grid</button>
<button
type="button"
data-jplist-control="layout"
data-class="jplist-thumb"
data-group="group1"
data-name="name1">Thumb</button>

Title value 1

....

Title value 1

....

Title value 1

....

Data Attributes
The full list of control data attributes.
| Name | Description | Values |
|---|---|---|
data-jplist-control |
Defines layout control. | "layout" |
data-group |
Defines group of items that should be influenced. For example, if a control has data-group="group1" then items group should have data-jplist-group="group1" data attribute. | any text value |
data-class |
Defines a class name that should be added to the group container on button click | CSS class name without the dot |
data-name |
The data-name attribute is used to identify the same controls in different panels. Different controls should have different data-name attributes. By default, data-name attribute has default value. | any text value |
data-selected |
Defines if a button is selected. | "true" or "false" |


A representation error occurs when your program calls for the computation of some well-defined value that cannot be represented.
Most representation errors are some sort of overflow:
functor(T, f, 1000) % maximum arity is 255 atom_codes(X, L) % if length of L > 65535
are all representation errors. Floating-point overflow is a representation error.
The SICStus_Error term for a representation error is
representation_error(Goal, ArgNo, Message)
0
or
''
provides no further information.


The Internet consists of four functional layers;
Each of these layers has several protocols which are sets of rules used to communicate on that layer. The following figure shows each of the four layers, and a few of the protocols used on each layer.
When transmitting a message each layer processes the message in turn starting with the Process/Application Layer and ending with the Network Access Layer. When receiving a message it is processed in reverse of transmitting, starting with the Network Access Layer and ending with the Process/Application layer.
This layer (also known as the link layer) defines how to deliver data between the host and client on the same network. This layer describes the protocols used to describe the local network topology and the interfaces needed to effect transmission of Internet layer datagrams (packets) to next-neighbour hosts.
This layer (also known as the internet layer) defines how to route messages across networks. It exchanges datagrams across network boundaries, and establishes internetworking, thus the name the Internet. This layer defines the addressing and routing structures used for the TCP/IP protocol suite. The primary protocol in this scope is the Internet Protocol, which defines IP addresses. Its function in routing is to transport datagrams to the next IP router that has the connectivity to a network closer to the final data destination.
This layer defines how to provide reliable communication, so that data will not be lost or corrupted during the transport from host to client. The transport layer constitutes the networking regime between two network hosts, either on the local network or on remote networks separated by routers. The transport layer provides a uniform networking interface that hides the actual topology (layout) of the underlying network connections. This is where flow-control, error-correction, and connection protocols exist, such as TCP. This layer deals with opening and maintaining connections between Internet hosts.
This layer defines how application requests are sent across the internet, using encryption, compression, and ?? etc. This is the scope within which applications create user data and communicate this data to other processes or applications on another or the same host. The communications partners are often called peers. This is where the "higher level" protocols such as SMTP, FTP, SSH, HTTP, etc. operate.
Please leave some thoughts below and thanks for the read.
Enumerate the four main layers in the Internet reference model and give three reasons why it is important to arrange the protocols in layers.