omniomni/omni-engineering huggingface dataset:
Integrated Regional Water Management Planning. The California State Integrated Regional Water Management (IRWM) Planning is the process that promotes bringing together and prioritizing water-related efforts in the region in a systematic way to ensure sustainable water uses, reliable water supplies, better water quality, environmental stewardship, efficient urban development, protection of agriculture, and a strong economy. IRWM incorporates the physical, environmental, societal, economic, legal, and jurisdictional aspects of water management into regional solutions through open and collaborative stakeholder processes to promote sustainable water use.

Administered by the California Department of Water Resources and California State Water Resources Control Board through bond-funded Grant Programs, IRWM encourages the development of integrated regional strategies for management of water resources by providing funding, through competitive grants.

History
Integrated regional water management (IRWM) was officially established by the State of California in 2002 through the passage of the  Integrated Regional Water Management Planning Act (SB 1672).

Funding
Funding was authorized with various propositions.

PROPOSITION 50, the Water Security, Clean Drinking Water, Coastal and Beach Protection Act of 2002, passed by California voters in November 2002. Implementation of the Proposition 50 Chapter 8, bond funding is jointly administered by the Department of Water Resources (DWR) and the State Water Resources Control Board (State Water Board).
PROPOSITION 84, the Safe Drinking Water, Water Quality and Supply, Flood Control, River and Coastal Protection Act, passed by California voters in November 2006. Administered by DWR, the Proposition 84 includes funding for the IRWM Grant Program.

These programs and funding have initiated Integrated Plans in most regions of the state. These efforts are bringing together agencies related to water in order to provide the highest-priority projects for funding and rapid completion.

References

External links
 Official Website

Water in California
Silt density index. The silt density index is a measure for the fouling capacity of water in reverse osmosis systems. The test measures the rate at which a 0.45-micrometre filter is plugged when subjected to a constant water pressure of . The SDI gives the percent drop per minute in the flow rate of the water through the filter, averaged over a period of time such as 15 minutes.

Typically, spiral-wound reverse osmosis systems will need an SDI less than 5, and hollow fiber reverse osmosis systems will need an SDI less than 3. In these kinds of systems, deep-well waters (with a typical SDI of 3) could be used straight from the source. If fed from surface waters (with a typical SDI greater than 6), the water will need to be filtered before use. Seawater desalination plants utilising reverse osmosis systems also need very efficient filtering due to the typically high but variable SDI of seawater.

References

Water treatment
Membrane technology
Multimedia University Engineering Society Overseas Research Programme. MESCORP, originally an acronym for Multimedia University Engineering Society Overseas Research Programme, is an undergraduate-based research work which involves a field study initiated by Multimedia University's engineering students. MESCORP addresses the dire need of qualified IT-knowledgeable engineers in Malaysia by supplementing soft skills such as initiative, creative, innovative qualities to the technical skills acquired through practical applications of theories in laboratory experiments.

History 
Multimedia University Engineering Society Overseas Research Programme (MESCORP) was founded in 2002 by the former dean of the Faculty of Engineering (FOE), Ir. Professor Dato' Dr Chuah Hean Teik, under the patronage of the Chancellor YABhg. Siti Hasmah Mohamad Ali(Chancellor 2002-2012).

Awards received:

Achievements 
Ever since 2002, MESCORP has researched and published journals regarding the topics concerned and organized annual conferences to disseminate their findings to the public. MESCORP's track record is as follows:

References 

 Energising Trip
 Focus on Energy
 Conference on ICT
 MMU Students Study Japanese Broadband Success Story

External links 
 Official MESCORP Website
 Multimedia University Engineering Society Official Portal
 Multimedia University
 Cyberjaya Community Portal

Multimedia University
Research projects
2002 establishments in Malaysia
Siti Hasmah Mohamad Ali
Back-up ring. A back-up ring is a rigid ring that holds an elastomeric seal or plastic (such as Polyethylene) connection to its designed shape and in its correct place.  Back up rings are commonly used with O-rings, lip seals, and as reciprocating shaft seals. They are also used for piping connections joining two different materials - typically one flexible and one rigid.

Seals 
When sealing the piston inside a pneumatic cylinder, a soft and flexible material is required to prevent leakage, but those same properties may leave the seal material vulnerable to being pulled out of its seat and then pinched or torn in the narrow space between piston and cylinder wall.  If the joint cannot be redesigned, or a more resistant elastomer used, then the solution may be direct reinforcement with a stiffer material - in the form of a hard inner ring in this case.  A second function can be to hold the elastomer in place while a machine is being assembled, as geometry may prevent the seal from being directly checked after assembly.

Rubber Contoured Back-Up Ring Size Chart

Contoured back-ups are routinely produced in a 90 durometer nitrile. This provides sufficient elasticity to permit stretching over the major diameter of a piston and then snapping back into the gland groove cut into the piston.  90 durometer has sufficient hardness to resist extrusion of the softer elastomeric O-ring performing the actual sealing function against the high pressure liquid or gas.

 000 Series O-rings 0.070" ±0.003" - .045" Thick
 100 Series O-rings 0.103" ±0.003" - .045" Thick
 200 Series O-rings 0.139" ±0.004" - .040" Thick
 300 Series O-rings 0.210" ±0.005" - .060" Thick
 400 Series O-rings 0.275" ±0.006" - .096" Thick

Pipe Connections 
Back-up rings are used in Polyethylene (PE) pipe connections, such as HDPE pipes, where they are connected to steel pipe or pipe fittings. 

The back-up ring is matched to the steel pipe flange specification and is placed behind the HDPE flange adapter - an end piece on the HDPE pipe that looks much like a steel flange at the end of the HDPE pipe. As the flange adapter does not have much structural strength, the back-up ring supports and compresses the HDPE flange adapter against the steel flange and creates an effective connection between the two piping materials.

References

External links

"Rubber Contoured Back-Up Ring Size Chart"
Technical Note PP 811-TN PE Flange Connections

Seal rings
Norman E. Gibbs. Norman E. Gibbs (November 27, 1941 – April 25, 2002) was an American software engineer, scholar and educational leader.

He studied to a B.Sc. in mathematics at Ursinus College (1964) and M.Sc. (1966) and Ph.D. (1969) in Computer Science at Purdue University, advised by Robert R. Korfhage.  His research area was cycle generation, an area in graph theory.
Gibbs joined the faculty at Bowdoin College in Maine, Arizona State University and College of William and Mary (mathematics) in Virginia before moving to Pittsburgh, joining Carnegie Mellon University as professor of computer science and becoming the first director of the educational program at the Software Engineering Institute (1987–97).  Since then he was chief information officer at Guilford College in Greensboro and University of Connecticut, jointly serving as professor of Operations and Information management.  He eventually worked for Ball State University as chair of computer science (2000–02).

Articles
A cycle generation algorithm for finite undirected linear graphs, in Jnl. of the ACM, 16(4):564-68, 1969. 
Tridiagonalization by permutations, in Comm. of the ACM, 17(1):20-24, 1974 (with William G. Poole, jr.)
Basic cycle generation, in Comm. of the ACM, 18(5):275-76, 1975
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix, in SIAM Jnr. of Numerical Analysis, 13(2):236-250, 1976 (with W. G. Poole and Paul K. Stockmeyer
A hybrid profile reduction algorithm, ACM Trans. on Math. Softw., 2(4):378-387, 1976
An introductory computer science course for all majors, ACM SIGCSE, 9(3):34-38, 1977
A model curriculum for a liberal arts degree in computer science, Comm. of the ACM, 29(3):202-210, 1986 (with Allen B. Tucker)
A Master of Software Engineering Curriculum: Recommendations from the Software Engineering Institute, IEEE Computer, 22(9):59-71, 1989 (With Gary A. Ford)
Software Engineering and Computer Science: The Impending Split?, in Educ. & Computing. 7(1-2):111-17, 1991

Books
Principles of data structures and algorithms with Pascal (William C. Brown Publ.,1987).  With Robert R. Korfhage
Software Engineering Education: The Educational Needs of the Software Community (editor, with Richard E. Farley, 1987)

References

1941 births
2002 deaths
American computer scientists
20th-century American mathematicians
21st-century American mathematicians
20th-century American educators
Carnegie Mellon University faculty
Purdue University alumni
Software engineering researchers
Ursinus College alumni
Guilford College faculty
Chief information officers
American computer science educators
Crew Medical Support Office. The primary function of medical operations, centred at the Space Medicine Office (SMO) in the European Astronaut Centre, Cologne, Germany, is to maximize the operational effectiveness and minimize risks to the health of the European astronauts involved in human space flight . Furthermore, SMO also functions as a means of support to ESA astronaut families throughout their careers.

In order to fulfill this function SMO provides flight surgeon services in combination with direct biomedical engineer support. To be fully effective these key areas of service provision require additional in-house supporting elements namely; exercise science, rehabilitation, IT and project management capabilities.

References

European Space Agency
Adduct purification. Adduct purification is a technique for preparing extremely pure simple organometallic compounds, which are generally unstable and hard to handle, by purifying a stable adduct with a Lewis acid and then obtaining the desired product from the pure adduct by thermal decomposition.

Epichem Limited is the licensee of the major patents in this field, and uses the trademark EpiPure to refer to adduct-purified materials; Professor Anthony Jones at Liverpool University is the initiator of the field and author of many of the important papers.

The choice of Lewis acid and of reaction medium is important; the desired organometallics are almost always air- and water-sensitive. Initial work was done in ether, but this led to oxygen impurities, and so more recent work involves tertiary amines or nitrogen-substituted crown ethers.

References 
 Professor Anthony C. Jones
 Purification of dialkylzinc precursors using tertiary amine ligands

Chemical reactions
Separation processes
Clocky. Clocky is a brand of alarm clock outfitted with wheels, allowing it to hide itself in order to force the owner awake in an attempt to find it. Invented for an industrial design class by Gauri Nanda, then a graduate student at MIT Media Lab, Clocky won the 2005 Ig Nobel Prize in Economics. After earning her undergraduate degree from the  University of Michigan and her master's degree from MIT, Nanda founded a company, Nanda Home, to commercialize Clocky and other home products.

History 
The original prototype, built in three days, was covered with shag carpet to appear like a pet. After the end of the design class for which she invented Clocky, Nanda did not make any further plans for the device. However, several months after a description was posted on the Media Lab website, pictures of Clocky were picked up on various technology product  blogs including Gizmodo, Engadget, and BoingBoing. Within two weeks information about the device became an Internet meme and Nanda, the inventor, had been booked to demonstrate the device on Good Morning America.

MIT filed for a patent naming Nanda as the sole inventor and, with support from her family, left MIT after a master's degree to found Nanda Home and develop the invention for commercial production. The newer version, though not carpeted, is still designed to appear zoomorphic. Production is outsourced to Hong Kong. In October 2012 during a video interview, Gauri mentioned that over 500,000 units had already been sold.

The development of Clocky and marketing of it has become a Harvard Business School case study: Clocky, the Runaway Alarm Clock.

Operation 
The device functions as a regular alarm clock, except that it moves on its own power when the snooze button is pressed a second time. A  microprocessor ensures that the device will move at a random speed, in a random direction, and around obstacles, using a different route each time. Large wheels on  shock absorbers extend beyond the top of the clock to protect it from impact should it roll off a nightstand. By the time the alarm sounds again the device is in a place unknown to the user, who is forced to determine where it is, and possibly walk to that location to press the snooze button again.

Tocky
Tocky is Nanda Home's second generation moving alarm clock, first advertised in 2010 as the "tech-savvy cousin" of Clocky. Similar to Clocky, it is a digital alarm clock with changeable skin that runs away on the alarm, but it is spherical (hence, it rolls on its own body rather than on wheels), has a touch screen display with a turnable round frame around it (to set the time and alarm), and receives up to over six hours of audio made by the recording the user's own voice or sounds directly to its microphone, or uploads through USB plugged from computers. Tocky also has a demo mode which enables it to move about and play installed sounds, not in the form of setting off an alarm. Nanda Home has a similar product, Ticky which has the same features as Tocky but with a digital analog-style face.

References

External links 
 Winners in Competition "Gifts of The Year 2011"
 nandahome.com - official site

Clock designs
Hydraulic tomography. Hydraulic tomography (HT) is a sequential cross-hole hydraulic test followed by inversion of all the data to map the spatial distribution of aquifer hydraulic properties. Specifically, HT involves installation of multiple wells in an aquifer, which are partitioned into several intervals along the depth using packers. A sequential aquifer test at selected intervals is then conducted. During the test, water is injected or withdrawn (i.e. a pressure excitation) at a selected interval in a given well. Pressure responses of the subsurface are then monitored at other intervals at this well and also in other wells. This test produces a set of pressure excitation/response data of the subsurface. 
  
Once a given test has been completed, the pump is moved to another interval and the test is repeated to collect another set of data. The same procedure is then applied to the intervals at other wells. Afterward, the data sets from all tests are processed by a mathematical model to estimate the spatial distribution of hydraulic properties of the aquifer. These pairs of pumping and drawdown data sets at different locations make an inverse problem better posed, because each pair cross-validates the others such that the estimates become less non-unique. In other words, predictions of ground water flow based on the HT estimates will be more accurate and less uncertain than those based on estimates from traditional site-characterization approaches and model calibrations.

References
https://web.archive.org/web/20071201142040/http://tian.hwr.arizona.edu/yeh/index.html
http://tian.hwr.arizona.edu/research/HT/examples

Hydrology
Hicks-neutral technical change. Hicks-neutral technical change is change in the production function of a business or industry which satisfies certain economic neutrality conditions.  The concept of Hicks neutrality was first put forth in 1932 by John Hicks in his book The Theory of Wages.  A change is considered to be Hicks neutral if the change does not affect the balance of labor and capital in the products' production function.  More formally, given the Solow model production function
,
a Hicks-neutral change is one which only changes .

See also
List of production functions

References

Further reading
 
 
 
 

Production economics
Technological change
R. E. Chambers Company. The Ralph E. Chambers Engineering Company was mainly an amusement ride manufacturing firm that took over the facilities of the bankrupt Traver Engineering Company in Beaver Falls, Pennsylvania from 1933 into 1962, although Harry Traver continued to work for the company.

Ralph E. Chambers was the Traver Engineering Company's chief engineer, and Chambers Engineering designed and built many of the rides for the New York World's Fair of 1939 and 1940, with Harry Traver continuing to design and engineer the Chambers products, including the Speed King Auto Racer.

Chambers Engineering came to an end when the company experienced a devastating plant fire in 1968. Some of their more famous rides include The Whip, The Caterpillar, The Laff In The Dark, and Tumble Bug.

References

Further reading

 (June 14, 2001.) "A thrill a minute: Golden age of amusement park lives on." Farm and Dairy.

Amusement park companies
AC3D. AC3D is a 3D design program which has been available since 1994.  The software is used by designers for modeling 3D graphics for games and simulations - most notably it is used by the scenery creators at Laminar Research on the X-Plane (simulator). The .ac format has also been used in FlightGear for scenery objects and aircraft models.

History
Initially developed on the Amiga, the code was then ported to Silicon Graphics workstations which used the GL graphics library. At that time, the user interface was implemented using X11/Motif.

A Linux port was released onto the internet in 1994 (the GL graphics were replaced with OpenGL). A Microsoft Windows port followed when the X11 interface was dropped in favor of the portable Tcl/Tk scripting library.

In 2002, Inivis Limited purchased the full intellectual property rights to AC3D and continues to develop and market the software. They decided to keep the name AC3D for the software.

In 2005, a Mac OS X version of AC3D was released.

Modeling
AC3D's modeling is polygon/subdivision-surface based.  Unlike some other 3D software, AC3D refers to 'surfaces' rather than 'polygons'.  An AC3D surface can be a polygon, polygon-outline or line. An AC3D object is a collection of surfaces.

3D files 
AC3D can load and save a wide variety of 3D file formats but primarily uses its own .ac file format which is ascii.

Inivis is the first 3rd party vendor to offer officially sanctioned support for the Second Life sculpted prim format; exporters for other 3D software packages exist, but are solely user-supported.

Scripting and plugins
Extra functionality can be added to AC3D via Tcl/Tk scripts and/or C/C++ dynamic libraries (plug-ins). A software development kit (SDK) is available to licensed users.

References

External links
 Inivis Limited
 AC3D file format

3D graphics software
Computer-aided design software for Linux
3D computer graphics software for Linux
Proprietary commercial software for Linux
Software that uses Tk (software)
OpenBinder. OpenBinder is a system for inter-process communication. It was developed at Be Inc. and then Palm, Inc. and was the basis for the Binder framework now used in the Android operating system developed by Google.

OpenBinder allows processes to present interfaces which may be called by other threads. Each process maintains a thread pool which may be used to service such requests. OpenBinder takes care of reference counting, recursion back into the original thread, and the inter-process communication itself. On the Linux version of OpenBinder, the communication is achieved using ioctls on a given file descriptor, communicating with a kernel driver.

The kernel-side component of the Linux version of OpenBinder was merged into the Linux kernel mainline in kernel version 3.19, which was released on February 8, 2015.

References

Inter-process communication
Raymond's algorithm. Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system.  It imposes a logical structure (a K-ary tree) on distributed resources.  As defined, each node has only a single parent, to which all requests to attain the token are made.

Algorithm

Nodal properties

 Each node has only one parent to whom received requests are forwarded
 Each node maintains a FIFO queue of requests each time that it sees the token;
 If any node is forwarding privilege to other node and has non-empty queue then it forwards a request message along

Algorithm

 If a node i (not holding the token) wishes to receive the token in order to enter into its critical section, it sends a request to its parent, node j.
 If node j FIFO is empty, node j shifts i into its FIFO queue; j then issues a request to its parent, k, that it desires the token
 If node j FIFO queue is not empty, it simply shifts i into the queue
 When node k has token and receives the request from j it sends token to j and sets j as its parent
 When node j receives the token from k, it forwards the token to i and i is removed from the queue of j
 If the queue of j is not empty after forwarding the token to i, j must issue a request to i in order to get the token back

Note: If j wishes to request a token, and its queue is not empty, then it places itself into its own queue.  Node j will utilize the token to enter into its critical section if it is at the head of the queue when the token is received.

Complexity 

Raymond's algorithm is guaranteed to be O(log n) per critical section entry if the processors are organized into a K-ary tree.  Additionally, each processor needs to store at most O(log n) bits because it must track O(1) neighbors.

References

See also 
 Ricart-Agrawala algorithm
 Lamport's bakery algorithm
 Lamport's distributed mutual exclusion algorithm
 Maekawa's algorithm
 Suzuki-Kasami's algorithm
 Naimi-Trehel's algorithm

Concurrency control algorithms