omniomni/omni-engineering huggingface dataset:
DR Class 250. The Deutsche Reichsbahn (East Germany) Class 250 (known since 1992 as Deutsche Bahn AG Class 155) is a German electric locomotive used on freight trains. It is nicknamed the "Electric Container" or "Powercontainer" due to its distinctive carbody shape. It was the most powerful locomotive in the former GDR and is still in use with Deutsche Bahn AG.

History
In the mid-1960s, it became apparent that engine classes 211 and 242, in production since 1961, were not powerful enough, so DR built a new, 6-axled, electric locomotive suitable for all classes of traffic. In 1974 three prototypes were built by LEW Hennigsdorf, the leading builder of railway locomotives in the GDR.  A series of 270 locomotives were delivered between 1977 and 1984. They were mainly used for heavy cargo trains as well as the fast Städteexpress-train services of DR (comparable with InterCity).

After the reunification of Germany, railway traffic in East Germany slumped.  The locomotives were renumbered as class 155, and many of them also operated in West Germany. After Deutsche Bahn was restructured, the engines were assigned to DB Cargo (later Railion, now DB Schenker Rail) for freight services. Since 1998, some locomotives have been used for spare parts. Approximately 200 are still in existence and can be seen throughout Germany pulling all sorts of freight trains. Today the 155s remain indispensable for DB Schenker, Deutsche Bahn's railway cargo carrier.

Construction

The locomotives have a Co′Co′ arrangement with two 3-axled bogies.  Each axle is powered by a single-phase, series-wound, AC traction motor. The torque is transferred by a double-sided spur gear to a hollow shaft, and by an elastic rubber cone flange to the wheels. Each motor has an own cooling blower. 
Two scissor-shaped pantographs collect the current of 15 kV / 16.7 Hz from the catenary. Recently, many of these pick-ups have been refitted as modern single-arm pantographs.

The core of the electric system is the 3-blade main transformer with oil-cooling. The control unit has 30 power notches, semi-automatic in operation. The settings are thyristor controlled and the thyristor voltage is regulated by phase cutting, which was a novelty for series locomotives in the GDR.  All units are equipped with a catenary-current-controlled electric brake. The safety equipment in the driver's cab has an electronic deadman's brake (Sifa), “punctiform” automatic train controls (PZB 90), and train radio equipment with GSM-R communication.  Relatively recently, computers were added for the electronic timetable EBuLa.

Some of the models have been equipped with the LZB System. Recently, these are used to haul heavy and fast container trains on the German high-speed network.

Gallery

References 

15 kV AC locomotives
Co′Co′ locomotives
250
Electric locomotives of Germany
LEW locomotives
Railway locomotives introduced in 1974
Standard gauge locomotives of Germany
Co′Co′ electric locomotives of Europe
Autoassociative memory. Autoassociative memory, also known as auto-association memory or an autoassociation network, is any type of memory that is able to retrieve a piece of data from only a tiny sample of itself. They are very effective in de-noising or removing interference from the input and can be used to determine whether the given input is “known” or “unknown”. 

In artificial neural network, examples include variational autoencoder, denoising autoencoder, Hopfield network. 

In reference to computer memory, the idea of associative memory is also referred to as Content-addressable memory (CAM). 

The net is said to recognize a “known” vector if the net produces a pattern of activation on the output units which is same as one of the vectors stored in it.

Background
Standard memories (data storage) are organized by beeing indexed by positional memory adresses wich are also used for data retrieval.

Autoassociative memories are organized in such a way that data is stored in a graph like system with connection wheights based on the number of inherent associative connections between two memories wich makes it possible to query it using a memory already contained in the associative memory as query-key and retrieve that memory and closely connected memories at the same time. Hopfield networks have been shown to act as autoassociative memory since they are capable of remembering data by observing a portion of that data.

Iterative Autoassociative Net 
In some cases, an auto-associative net does not reproduce a stored pattern the first time around, but if the result of the first showing is input to the net again, the stored pattern is reproduced. They are of 3 further kinds — Recurrent linear auto-associator, Brain-State-in-a-Box net, and Discrete Hopfield net. The Hopfield Network is the most well known example of an autoassociative memory.

Hopfield Network 

Hopfield networks serve as content-addressable ("associative") memory systems with binary threshold nodes, and they have been shown to act as autoassociative since they are capable of remembering data by observing a portion of that data.

Heteroassociative memory
Heteroassociative memories, on the other hand, can recall an associated piece of datum from one category upon presentation of data from another category. For example: It is possible that the associative recall is a transformation from the pattern “banana” to the different pattern “monkey.”

Bidirectional associative memory (BAM)

Bidirectional associative memories (BAM) are artificial neural networks that have long been used for performing heteroassociative recall.

Example

For example, the sentence fragments presented below are sufficient for most English-speaking adult humans to recall the missing information. 

 "To be or not to be, that is _."
 "I came, I saw, _."

Many readers will realize the missing information is in fact:

 "To be or not to be, that is the question."
 "I came, I saw, I conquered."

This demonstrates the capability of autoassociative networks to recall the whole by using some of its parts.

References

External links
 Autoassociation

Artificial neural networks
Design predicates. Design predicates are a method invented by Thomas McCabe, to quantify the complexity of the integration of two units of software. Each of the four types of design predicates have an associated integration complexity rating. For pieces of code that apply more than one design predicate, integration complexity ratings can be combined.

The sum of the integration complexity for a unit of code, plus one, is the maximum number of test cases necessary to exercise the integration fully. Though a test engineer can typically reduce this by covering as many previously uncovered design predicates as possible with each new test. Also, some combinations of design predicates might be logically impossible.

Types of Calls

Unconditional Call
Unit A always calls unit B. This has an integration complexity of 0. For example:

 unitA::functionA() {
    unitB->functionB();
 }

Conditional Call
Unit A may or may not call unit B. This integration has a complexity of 1, and needs two tests: one that calls B, and one that doesn't.

 unitA::functionA() {
    if (condition) 
       unitB->functionB();
 }

Mutually Exclusive Conditional Call
This is like a programming language's switch statement. Unit A calls exactly one of several possible units. Integration complexity is n - 1, where n is the number of possible units to call.

 unitA::functionA() {
    switch (condition) {
       case 1:
          unitB->functionB();
          break;
       case 2:
          unitC->functionC();
          break;
       ...
       default:
          unitN->functionN();
          break;
    }
 }

Iterative Call
In an iterative call, unit A calls unit B at least once, but maybe more. This integration has a complexity of 1. It also requires two tests: one that calls unit B once, and one test that calls it more than once.

 unitA::functionA() {
    do {
       unitB->functionB();
    } while (condition);
 }

Combining Calls
Any particular integration can combine several types of calls. For example, unit A may or may not call unit B; and if it does, it can call it one or more times. This integration combines a conditional call, with its integration complexity of 1, and an iterative call, with its integration complexity of 1. The combined integration complexity totals 2.

 unitA::functionA() {
    if (someNumber > 0) {
       for ( i = 0 ; i < someNumber ; i++ ) {
          unitB->functionB();
       }
    }
 }

Number of tests

Since the number of necessary tests is the total integration complexity plus one, this integration would require 3 tests. In one, where someNumber isn't greater than 0, unit B isn't called. In another, where someNumber is 1, unit B is called once. And in the final, someNumber is greater than 1, unit B is called more than once.

References

See also

 Cyclomatic complexity
 Integration testing
 White-box testing

Software testing
Software metrics
Droplets (disambiguation). Droplet ("little drop") and droplets (plural form) may refer to:
Water droplet, a small column of water (liquid)
Oil droplet, a small column of oil (liquid)

Technology
Acoustic droplet vaporization, the phase-transitioned of liquid droplets into gas bubbles by means of ultrasound
Acoustic droplet ejection, move of fluid drops without any physical contact by means of ultrasound
Droplet-shaped wave, casual localized solutions of the wave equation
Electrodynamic droplet deformation, liquid droplets suspended in a liquid exposed to an oscillating electric field
Electron-hole droplets, condensed phase of excitons in semiconductors
Liquid droplet radiator, a proposed lightweight radiator
Droplets (programming environment),  a computer programming environment
Droplets, the name for virtual private servers from DigitalOcean
A kind of applet in Apple's scripting language AppleScript

Biology and medicine
Lipid droplet, lipid-rich cellular organelles
Respiratory droplet, pathogen-containing particles of respiratory secretions

Other
Hand-with-droplets (hieroglyph), the ancient Egyptian Hand-with-droplets hieroglyph

See also
 Drop (disambiguation)
BMW Sauber F1.07. The BMW Sauber F1.07 is a Formula One single-seater racing car built by BMW Sauber for the 2007 Formula One World Championship. The chassis was designed by Willy Rampf, Walter Reidl, Jörg Zander and Willem Toet with the powertrain being designed by Heinz Paschen. The car was the first to have been designed fully by BMW, following their purchase of the former Sauber team. Initial pre-season testing was very positive, with many speculating that BMW could surprise some of the top teams with their performances when the season got underway.

Design

Aerodynamics
The rear wing is mounted by the endplates, rather than the pylon-mounted arrangement used by some rivals' cars (such as the McLaren MP4-22).

Engine and transmission
The engine's name, P86/7, is indicative of the fact that it is not a new engine, since it is heavily based on the P86 used in the 2006 F1.06 car. This is a requirement of the homologation rules introduced by the FIA. The BMW Sauber team adopted a seamless shift sequential transmission mechanism, known as QuickShift, for its gearbox.

Season performance
The car was a significant step up from 's F1.06, scoring 2 podium positions in a season in which 46 of the possible 51 podium positions were occupied by Scuderia Ferrari and McLaren in a dominant season. Both of these were by Nick Heidfeld — a 2nd at the 2007 Canadian Grand Prix and 3rd at the 2007 Hungarian Grand Prix. However, they  scored points on 26 out of the possible 34 occasions. They scored points with at least one car in every single race, and points with both cars six races in a row between the French and Italian Grands Prix. Robert Kubica had 4th places in Spain, France and Britain, which were his best results. Sebastian Vettel scored points for 8th place in his only appearance for the team, the United States Grand Prix.

Heidfeld was the only driver to frequently break the Ferrari/McLaren deadlock at the front of qualifying, with his best result being 2nd on the grid in Hungary. The BMW Sauber cars qualified in the top 10 every race apart from Kubica qualifying 14th in Belgium.

The car was also involved in one of the biggest crashes of the modern era, Kubica's in Canada. He was replaced by future world champion Vettel for one race.

Livery
BMW Sauber went into 2007 season with sponsorship continuity; unlike many rival teams such as Honda, McLaren and Renault, who had to drop their tobacco sponsorship. This meant the 2007 cars had a similar livery to that of the 2006 design with only subtle changes.

Gallery

Complete Formula One results
(key) (results in bold indicate pole position)

References

External links

 F1.07 technical detail – F1Technical.com

BMW Sauber Formula One cars
Sauber F1.07
2007 Formula One season cars
Arama 36/37. ARAMA 36/37 (full name: Association for the Recovery of Asturian Military Architecture 1936–1937) is a non-governmental organization formed by historians of Military History to investigate the elements of military engineering related to the Spanish Civil War in the territory of Asturias (north of Spain), establishing criteria of conservation to safeguard them.

References

External links
ARAMA 36/37 Association - Official Website

History of Asturias
Spanish Civil War
History organisations based in Spain
Boeing B-1. The Boeing B-1 (company designation Model 6) is a small biplane flying boat designed by William Boeing shortly after World War I.

Design and development
The Model 6 was the first commercial design for Boeing (as opposed to military or experimental designs), hence the B-1 designation. Its layout was conventional for its day, with a Hall-Scott engine driving a pusher propeller mounted amongst the cabane struts. The pilot sat in an open cockpit at the bow, and up to two passengers could be carried in a second open cockpit behind the first. The design was reminiscent of the Curtiss HS-2L that Boeing had been building under license during the war.

Operational history
Only a single aircraft was built, as Boeing had trouble selling it in a market flooded with war-surplus aircraft. In 1920, it was purchased by Edward Hubbard, who used it to carry air mail between Seattle, Washington and Victoria, British Columbia. Air mail service began on 27 December 1919, and continued for eight years. The plane flew until 1930 before being preserved and put on display at Seattle's Museum of History and Industry in 1954.

Specifications

Boeing B-1D
Between May 1928 and April 1929, Boeing built two B-1Ds. Apart from the shape of the rudder, all other structural details were different to the original biplane

Specifications

Boeing B-1E
The six planes built from March 1928 were identical to the first B-1D except for heavier construction, the engine, and a redesigned rudder.

Specifications

References

 Bowers, Peter M. Boeing aircraft since 1916. London: Putnam Aeronautical Books, 1989. .

External links

 Boeing history - B-1
 Hubbard: The Forgotten Boeing Aviator

1910s United States civil utility aircraft
Flying boats
006, Boeing
Single-engined pusher aircraft
Biplanes
Aircraft first flown in 1919
Jürgen Gmehling. Jürgen Gmehling (born 13 January 1946 in Duisburg) is a retired German professor of technical and industrial chemistry at the Carl von Ossietzky University of Oldenburg.

Biography
His career started with an apprenticeship as a laboratory assistant at the Duisburg copper works  before he studied chemical engineering at the engineering school in Essen and then chemistry in Dortmund and Clausthal. He received his diploma from the University of Dortmund in 1970 and his PhD (Dr. rer. nat., inorganic chemistry) in 1973. After this he worked as a scientific coworker in Dortmund before he became a private lecturer and, after his habilitation, an assistant professor.

Gmehling was appointed a full professor for technical chemistry at the University of Oldenburg in 1989 and retired in 2011.

Fields of research
Gmehling's main focus is the process development. This includes the development of software for process synthesis and process simulation as well as measurement, collection, and estimation of thermophysical properties of pure components and component mixtures. The following list summarizes fields of his scientific work but is in no way complete.

Measurements
 Phase equilibrium data (vapor-liquid equilibria, liquid-liquid equilibria, solid–liquid equilibria, gas solubilities, heats of mixing, activity coefficients and more)

Data collection
Gmehling began in the 1970s with the systematic evaluation of the scientific literature, aiming to build a data bank for vapor-liquid equilibria. These data were needed for the development of a new method for the prediction of activity coefficients named UNIFAC. This data bank is still named the Dortmund Data Bank.

Development of estimation and correlation models
Gmehling developed with colleagues models for the estimation of several thermodynamic and thermophysical properties:
 Activity coefficient models like UNIFAC (see also group contribution method) and extensions. For the further development of these widely used methods Gmehling founded an industry consortium where many international companies are participating.
 Equations of state (EOS) including mixing rules for applying EOS to mixtures (see PSRK).

Software development
The following implementation of his methods are also developments:
 an expert system for the entrainer selection for the azeotropic and extractive distillation

Awards 

Gmehling has received some awards:
 Arnold-Eucken Price in 1982 
 The Rosini Lectureship Award in 2008 
 The Gmelin-Beilstein-Denkmünze (Silver Medal) in 2010
 The Emil Kirschbaum Medal in 2013

Publications
Gmehling has published scientific articles and  books.

Selection of scientific articles

External links
 Chair at the University of Oldenburg
 Prof. Jürgen Gmehling
 DDBST GmbH
 LTP GmbH
 UNIFAC consortium
 Chemistry International article about Rossini Lectureship Award (accessed 2008-08-31)

1946 births
Living people
21st-century German chemists
People from Duisburg
Technical University of Dortmund alumni
Academic staff of the University of Oldenburg
Thermodynamicists
20th-century German chemists
Wakodahatchee Wetlands. The Wakodahatchee Wetlands is a park located in Delray Beach, Florida. The park was created on  of unused utility land and transformed into a recreation wetlands open to the public with a three-quarter mile boardwalk that crosses between open water pond areas, emergent marsh areas, shallow shelves, and islands with shrubs and snags to foster nesting and roosting. The boardwalk has interpretive signage as well as gazebos with benches along the way. This site is part of the South section of the Great Florida Birding Trail and offers many opportunities to observe birds in their natural habitats.

Water reclamation
Each day, the Palm Beach County Water Utilities Department’s Southern Region Water Reclamation Facility pumps approximately two million gallons of 90% treated water into the Wakodahatchee Wetlands. This water, which is free of organic contaminants but still contains excess mineral content, is naturally purified by the plants and algae in the wetlands, then released into the surface water supply.

Fauna
Over 150 species of birds have been spotted inside the park, including wood stork, pied-billed grebe, snowy egrets, and black-bellied whistling ducks. The park is also home to turtles, alligators, rabbits, frogs, and raccoons.

Flora
Plants within the park include pond apple, sabal palm, live oak, pickerelweed, duckweed, and giant bulrush.

References
Wakodahatchee Wetlands brochure

Gallery

External links

Delray Beach, Florida
Parks in Palm Beach County, Florida
Wetlands of Florida
Landforms of Palm Beach County, Florida
Marshes of the United States
Happy Ending (short story). "Happy Ending" is a 1948 science fiction short story by American writer Henry Kuttner. Originally published in Thrilling Wonder Stories, it has since been published in various anthologies and a collection of Kuttner's short stories.

Plot summary
The narrative proceeds out-of-sequence. As the story begins, a man named James Kelvin presses a button and returns to a lab with a moustached scientist who informs him that he is now a millionaire. Now that the button had completed its task, it no longer works. Kelvin lives happily ever after.  The end.

The story then switches to an earlier point. A man walks into a fortune telling booth where he meets a robot from the future. The robot greets him as James Kelvin and says that while unable to give Kelvin a horoscope, it can supply him with a method to attain health, wealth and fame. Kelvin receives a gadget with a button on it. Every time he presses the button, he will temporarily enter the mind of someone in the future and can read that person's thoughts and gain his abilities. But the robot warns him, "there is a danger, named Tharn". Afterwards, the name Tharn keeps recurring to him. 

Later that night, Tharn appears to him. To escape, Kelvin presses the button and lands in a stream. Unable to swim, he frantically presses the button again, which gives him the ability to breathe under water. To escape the stream, he presses the button yet again and lands in New Orleans in a drunken state. He presses the button again and is transported into a lab. There he meets a bald man with a red mustache. He begins a scientific conversation with him on proteins and amino acids, with ideas stolen from the mind of the future scientist, Quarra Vee. He offers a brilliant suggestion to cure rhinitis that could make him millions of dollars. Tharn appears again, forcing Kelvin to press the button. He lands in a cornfield in Seattle and then decides that he must kill Tharn. Moments later, Tharn appears and, when Kelvin presses the button, he gains the ability for a lethal mental attack. Tharn is destroyed.

Finally, the story switches to an even earlier point. The scientist Quarra Vee, and his android companion, Tharn, are preparing to go into the past to recapture a dangerous runaway robot. Quarra Vee is transported into Chicago and walks into a fortune telling booth. As he enters, a rope knocks aside the glasses which are supposed to protect him from attempts to tamper with his memory. The robot erases his true personality, and tells him he is James Kelvin.  The robot smiles.

Release 
"Happy Ending" was first published in the August 1948 issue of Thrilling Wonder Stories. It was subsequently published as part of various anthologies such as Beyond Tomorrow and The Best Science Fiction Stories: 1949. It did not appear in a collection under the writer's own name until 2010, when it was included in Detour to Otherness, with 23 other stories written by Kuttner himself or in collaboration with his wife, Catherine Moore.

References

External links
 
 
 

1949 short stories
Science fiction short stories
Works originally published in Wonder Stories
EEGECS. EEGECS, or European Education in Geodetic Engineering, Cartography and Surveying, is a European, European Union-funded consortium, or network, of institutes of higher learning aimed at enhancing dialogue and exchange of information, and to move towards the creation of a "European Area of Geodetic Engineering, Cartography and Surveying".

The initiative towards formation of EEGECS came from the Polytechnical University of Valencia. It started operations in 2002 and comprised 100 institutions from 28 countries. EU-funding for its activities lasted for three years, plus one more year dedicated to dissemination activities. The network consists of six working groups.

References

External links
EEGECS website
Working groups

College and university associations and consortia in Europe
Education in Europe
Geodesy organizations
Technology consortia