id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_21917_chunk_13
|
Kinetic logic
|
Graph of Interactions and Logical Equations Kinetic Logic has two forms depending on the following two types of descriptions: Naïve Logical Description
Consider a simple two-element system in which product x activates gene Y and product y represses gene X as shown in figure D. Each variable takes only two values; 0 and 1. In other words,
X = 1 if y = 0 (X "on” if y absent)
Y = 1 if x = 1 (Y "on" if x present)
The logical relation of the system can be written:
X =y
Y=x
|
wikipedia
|
wiki_912_chunk_29
|
United States Atomic Energy Commission
|
Reports
The AEC issued a large number of technical reports through their technical information service and other channels. These had many numbering schemes, often associated with the lab from which the report was issued. AEC report numbers included AEC-AECU (unclassified), AEC-AECD (declassified), AEC-BNL (Brookhaven National Lab), AEC-HASL (Health and Safety Laboratory), AEC-HW (Hanford Works), AEC-IDO (Idaho Operations Office), AEC-LA (Los Alamos), AEC-MDCC (Manhattan District), AEC-TID, and others. Today, these reports can be found in library collections that received government documents, through the National Technical Information Service (NTIS), and through public domain digitization projects such as HathiTrust.
|
wikipedia
|
wiki_12934_chunk_3
|
Astrobiology Field Laboratory
|
Planning
The Astrobiology Field Laboratory (AFL) would have followed the Mars Reconnaissance Orbiter (launched in 2005), Phoenix lander (launched in 2007), and Mars Science Laboratory (launched in 2011). The AFL 'Science Steering Group' developed the following set of search strategies and assumptions for increasing the likelihood of detecting biosignatures:
Life processes may produce a range of biosignatures such as lipids, proteins, amino acids, kerogen-like material or characteristic micropores in rock. However, the biosignatures themselves may become progressively destroyed by ongoing environmental processes.
Sample acquisition will need to be executed in multiple locations and at depths below that point on the Martian surface where oxidation results in chemical alteration. The surface is oxidizing as a consequence of the absence of magnetic field or magnetosphere shielding from harmful space radiation and solar electromagnetic radiation —which may well render the surface sterile down to a depth greater than . To get under that potential sterile layer, a core drill design is currently being studied. As with any trade, the inclusion of the drill would come at the mass expense available for other payload elements.
Analytical laboratory biosignature measurements require the pre-selection and identification of high-priority samples, which could be subsequently subsampled to maximize detection probability and spatially resolve potential biosignatures for detailed analysis.
|
wikipedia
|
wiki_26639_chunk_1
|
Journal of Physics G
|
Research is published in the following formats:
Research Papers: Reports of original and high-quality research work;
Research Notes: Contributions from individuals (or small groups) within large collaborations, containing early results of analyses, detector development, simulations, etc. which might not otherwise be published in the wider literature;
Topical Reviews: Specially commissioned review articles on areas of current interest;
LabTalk: Article summaries written by the researchers themselves which introduce the findings, techniques, and possible applications of their research.
|
wikipedia
|
wiki_18165_chunk_14
|
Tradable Energy Quotas
|
External links
TEQs - official website, including updated chronological archive of related work/coverage
2015 peer-reviewed paper on TEQs, in Carbon Management journal.
The All Party Parliamentary Group on Peak Oil's January 2011 report into TEQs, downloadable as a PDF.
David Fleming's popular guide to TEQs, Energy and the Common Purpose (3rd edition), downloadable as a PDF.
The Centre for Sustainable Energy's Scoping Study for DEFRA (2006)
The UK Government's pre-feasibility study into TEQs (general information, but links to full reports broken - they can be downloaded in full from the TEQs website here) (May 2008)
Critiques of the Government pre-feasibility study, from The Lean Economy Connection, the Centre for Sustainable Energy and the House of Commons Environmental Audit Committee
BBC Radio 4 - 12 minute discussion of peak oil and TEQs.
|
wikipedia
|
wiki_27215_chunk_14
|
Holographic algorithm
|
After several years of developing (what is known as) matchgate signature theory, Jin-Yi Cai and Pinyan Lu were able to explain the existence of Valiant's two accidental algorithms. These two problems are just special cases of two much larger families of problems: #2k-1Pl-Rtw-Mon-kCNF and #2k-1Pl-k/2Bip-VC for any positive integer k. The modulus 7 is just the third Mersenne number and Cai and Lu showed that these types of problems with parameter k can be solved in polynomial time exactly when the modulus is the kth Mersenne number by using holographic reductions to matchgates and the Chinese remainder theorem.
|
wikipedia
|
wiki_945_chunk_4
|
Inductive logic programming
|
Example The following well-known example about learning definitions of family relations uses the abbreviations
, , , , , , , , and .
It starts from the background knowledge (cf. picture)
,
the positive examples
,
and the trivial proposition to denote the absence of negative examples. Plotkin's "relative least general generalization (rlgg)" approach to inductive logic programming shall be used to obtain a suggestion about how to formally define the daughter relation .
|
wikipedia
|
wiki_22521_chunk_15
|
Marketing mix modeling
|
Trade promotions
Trade promotion is a key activity in every marketing plan. It is aimed at increasing sales in the short term by employing promotion schemes which effectively increases the customer awareness of the business and its products. The response of consumers to trade promotions is not straight forward and is the subject of much debate. Non-linear models exist to simulate the response. Using MMM we can understand the impact of trade promotion at generating incremental volumes. It is possible to obtain an estimate of the volume generated per promotion event in each of the different retail outlets by region. This way we can identify the most and least effective trade channels. If detailed spend information is available we can compare the Return on Investment of various trade activities like Every Day Low Price, Off-Shelf Display. We can use this information to optimize the trade plan by choosing the most effective trade channels and targeting the most effective promotion activity.
|
wikipedia
|
wiki_11869_chunk_20
|
Moduli of algebraic curves
|
Boundary geometry
An important property of the compactified moduli spaces is that their boundary can be described in terms of moduli spaces for genera . Given a marked, stable, nodal curve one can associate its dual graph, a graph with vertices labelled by nonnegative integers and allowed to have loops, multiple edges and also numbered half-edges. Here the vertices of the graph correspond to irreducible components of the nodal curve, the labelling of a vertex is the arithmetic genus of the corresponding component, edges correspond to nodes of the curve and the half-edges correspond to the markings. The closure of the locus of curves with a given dual graph in is isomorphic to the stack quotient of a product of compactified moduli spaces of curves by a finite group. In the product the factor corresponding to a vertex v has genus gv taken from the labelling and number of markings equal to the number of outgoing edges and half-edges at v. The total genus g is the sum of the gv plus the number of closed cycles in the graph.
|
wikipedia
|
wiki_22680_chunk_4
|
Atmospheric radiative transfer codes
|
There are efforts for intercomparison of radiation codes. One such project was ICRCCM (Intercomparison of Radiation Codes in Climate Models) effort that spanned the late 1980s - early 2000s. The more current (2011) project, Continual Intercomparison of Radiation Codes, emphasises also using observations to define intercomparison cases. Table of models Molecular absorption databases For a line-by-line calculation, one needs characteristics of the spectral lines, such as the line centre, the intensity, the lower-state energy, the line width and the shape.
|
wikipedia
|
wiki_20649_chunk_1
|
Logic model
|
Logic models are used by planners, funders, managers and evaluators of programs and interventions to plan, communicate, implement and evaluate them. They are being employed as well by health scientific community to organize and conduct literature reviews such as systematic reviews. Domains of application are various, e.g. waste management, poultry inspection, business education, heart disease and stroke prevention. Since they are used in various contexts and for different purposes, their typical components and levels of complexity varies in literature (compare for example the W.K. Kellogg Foundation presentation of logic model, mainly aimed for evaluation, and the numerous types of logic models in the intervention mapping framework). In addition, depending on the purpose of the logic model, elements depicted and the relationships between them is more or less detailed.
|
wikipedia
|
wiki_680_chunk_18
|
Genetic algorithm
|
Despite the lack of consensus regarding the validity of the building-block hypothesis, it has been consistently evaluated and used as reference throughout the years. Many estimation of distribution algorithms, for example, have been proposed in an attempt to provide an environment in which the hypothesis would hold. Although good results have been reported for some classes of problems, skepticism concerning the generality and/or practicality of the building-block hypothesis as an explanation for GAs efficiency still remains. Indeed, there is a reasonable amount of work that attempts to understand its limitations from the perspective of estimation of distribution algorithms.
|
wikipedia
|
wiki_25688_chunk_4
|
Analytic network process
|
There are numerous practical applications of ANP, many of them involving complex decisions about benefits (B), opportunities (O), costs (C) and risks (R). Studying these applications can be very useful in understanding the complexities of the ANP. The literature contains hundreds of elaborately worked out examples of the process, developed by executives, managers, engineers, MBA and Ph.D. students and others from many countries. About a hundred such uses are illustrated and discussed in The Encyclicon, a dictionary of decisions with dependence and feedback.
|
wikipedia
|
wiki_23109_chunk_85
|
List of Philippine mythological figures
|
Tungkung Langit: the supreme deity and the most powerful male Diwata; he is of unknown origin, coming from somewhere foreign to the other beings of the Sulod pantheon
Assistants of Tungkung Langit
Bangun Bangun: the deity of universal time who regulates cosmic movements
Pahulangkug: the deity who changes the seasons
Ribung Linti: the deity of lightning and thunderstorms
Sumalongsong: the deity of the rivers and seas
Santonil.vo: the deity of good graces
Munsad Burulakaw: the deity who has direct power over men; most respected and feared in the upperworld
Bayi: one of the two primordial giants who appeared out of nowhere and were responsible for the creation of many things; caught the primordial earthworm and gave birth to the wild animals that inhabit the earth
Laki: one of the two primordial giants who appeared out of nowhere and were responsible for the creation of many things
Primordial Earthworm: an ancient earthworm who excreted the earth after it was caught by the primordial giantess, Bayi
The Three Brothers Watching Over the Soul
Mangganghaw: keeps track over man's affairs immediately after marriage; keeps track of pregnancy; he is the first to come to the house of a laboring mother, peeping in the houses to see the child being born, which he then reports to Manglaegas
Manglaegas: enters the house to look for the child to make sure the infant was born alive, then reports to Patag'aes
Patag'aes: awaits until midnight then enters the house to have a conversation with the living infant; if he discovers someone is eavesdropping, he will choke the child to death; their conversation creates the fate of the child, on how long the child wants to live and how the child will eventually die, where the child will always get to choose the answers; once done, Patag'aes takes out his measuring stick, computes the child's life span, and then departs, sealing the child's fate
Bangla'e: ferries the souls across Lim'awaen, a deep lake in the underworld; asks the soul how many spouses it had on earth, where the soul is ferried and talked to differently, depending on the answer and the gender of the soul; the soul cannot lie to Bangla'e, as he will summon the tuma, a body louse and the incarnation of the soul's conscience
Unnamed God: another god that asks questions to the soul
Balagu: guards the bridge of a stream called Himbarawen; asks the same question as Bangla'e to the soul
|
wikipedia
|
wiki_32775_chunk_24
|
South African wireless community networks
|
Dabba is now working with the Shuttleworth Foundation, a non-profit South African charitable organization, in the Village telco project to develop an affordable and easy-to-install telephone system for rural communities. The goal was to design a system costing no more than US$5000 to get started, which a small-scale local entrepreneur could afford, and which would break even within six months. The project came up with the concept of a "mesh potato", a cheap device (perhaps $60 per unit) that can connect a standard analog telephone to the wireless network and also serves as a wireless mesh node, relaying signals from other mesh potatoes to a central wireless internet connection. Dabba (and other companies with a similar model) will provide advice to wireless community network owners and connectivity to the outside world. The technology has been tested and several manufacturers are showing interest in building the devices. The Village Telco concept may have potential in many other countries outside South Africa.
|
wikipedia
|
wiki_18392_chunk_48
|
Space-based solar power
|
Alternate energy collection location: While GEO is most typical because of its advantages of nearness to Earth, simplified pointing and tracking, very small time in occultation, and scalability to meet all global demand several times over, other locations have been proposed:
Sun Earth L1: Robert Kennedy III, Ken Roy & David Fields have proposed a variant of the L1 sunshade called "Dyson Dots" where a multi-terawatt primary collector would beam energy back to a series of LEO sun-synchronous receiver satellites. The much farther distance to Earth requires a correspondingly larger transmission aperture.
Lunar surface: David Criswell has proposed using the Lunar surface itself as the collection medium, beaming power to the ground via a series of microwave reflectors in Earth Orbit. The chief advantage of this approach would be the ability to manufacture the solar collectors in-situ without the energy cost and complexity of launch. Disadvantages include the much longer distance, requiring larger transmission systems, the required "overbuild" to deal with the lunar night, and the difficulty of sufficient manufacturing and pointing of reflector satellites.
MEO: MEO systems have been proposed for in-space utilities and beam-power propulsion infrastructures. For example, see Royce Jones' paper.
Highly elliptical orbits: Molniya, Tundra, or Quazi Zenith orbits have been proposed as early locations for niche markets, requiring less energy to access and providing good persistence.
Sun-sync LEO: In this near Polar Orbit, the satellites precess at a rate that allows them to always face the Sun as they rotate around Earth. This is an easy to access orbit requiring far less energy, and its proximity to Earth requires smaller (and therefore less massive) transmitting apertures. However disadvantages to this approach include having to constantly shift receiving stations, or storing energy for a burst transmission. This orbit is already crowded and has significant space debris.
Equatorial LEO: Japan's SPS 2000 proposed an early demonstrator in equatorial LEO in which multiple equatorial participating nations could receive some power.
Earth's surface: Narayan Komerath has proposed a space power grid where excess energy from an existing grid or power plant on one side of the planet can be passed up to orbit, across to another satellite and down to receivers.
Energy collection: The most typical designs for solar power satellites include photovoltaics. These may be planar (and usually passively cooled), concentrated (and perhaps actively cooled). However, there are multiple interesting variants.
Solar thermal: Proponents of solar thermal have proposed using concentrated heating to cause a state change in a fluid to extract energy via rotating machinery followed by cooling in radiators. Advantages of this method might include overall system mass (disputed), non-degradation due to solar-wind damage, and radiation tolerance. One recent thermal solar power satellite design by Keith Henson and others has been visualized here. Thermal Space Solar Power concept A related concept is here: Beamed Energy Bootstrapping The proposed radiators are thin wall platic tube filled with low pressure (2.4 kPa) and temperature (20 deg C) steam.
Solar pumped laser: Japan has pursued a solar-pumped laser, where sunlight directly excites the lasing medium used to create the coherent beam to Earth.
Fusion decay: This version of a power-satellite is not "solar". Rather, the vacuum of space is seen as a "feature not a bug" for traditional fusion. Per Paul Werbos, after fusion even neutral particles decay to charged particles which in a sufficiently large volume would allow direct conversion to current.
Solar wind loop: Also called a Dyson–Harrop satellite. Here the satellite makes use not of the photons from the Sun but rather the charged particles in the solar wind which via electro-magnetic coupling generate a current in a large loop.
Direct mirrors: Early concepts for direct mirror re-direction of light to planet Earth suffered from the problem that rays coming from the sun are not parallel but are expanding from a disk and so the size of the spot on the Earth is quite large. Lewis Fraas has explored an array of parabolic mirrors to augment existing solar arrays.
Alternate satellite architecture: The typical satellite is a monolithic structure composed of a structural truss, one or more collectors, one or more transmitters, and occasionally primary and secondary reflectors. The entire structure may be gravity gradient stabilized. Alternative designs include:
Swarms of smaller satellites: Some designs propose swarms of free-flying smaller satellites. This is the case with several laser designs, and appears to be the case with CALTECH's Flying Carpets. For RF designs, an engineering constraint is the sparse array problem.
Free floating components: Solaren has proposed an alternative to the monolithic structure where the primary reflector and transmission reflector are free-flying.
Spin stabilization: NASA explored a spin-stabilized thin film concept.
Photonic laser thruster (PLT) stabilized structure: Young Bae has proposed that photon pressure may substitute for compressive members in large structures.
Transmission: The most typical design for energy transmission is via an RF antenna at below 10 GHz to a rectenna on the ground. Controversy exists between the benefits of Klystrons, Gyrotrons, Magnetrons and solid state. Alternate transmission approaches include:
Laser: Lasers offer the advantage of much lower cost and mass to first power, however there is controversy regarding benefits of efficiency. Lasers allow for much smaller transmitting and receiving apertures. However, a highly concentrated beam has eye-safety, fire safety, and weaponization concerns. Proponents believe they have answers to all these concerns. A laser-based approach must also find alternate ways of coping with clouds and precipitation.
Atmospheric waveguide: Some have proposed it may be possible to use a short pulse laser to create an atmospheric waveguide through which concentrated microwaves could flow.
Nuclear synthesis: Particle accelerators based in the inner solar system (whether in orbit or on a planet such as Mercury) could use solar energy to synthesize nuclear fuel from naturally occurring materials. While this would be highly inefficient using current technology (in terms of the amount of energy needed to manufacture the fuel compared to the amount of energy contained in the fuel) and would raise obvious nuclear safety issues, the basic technology upon which such an approach would rely on has been in use for decades, making this possibly the most reliable means of sending energy especially over very long distances - in particular, from the inner solar system to the outer solar system.
Materials and manufacturing: Typical designs make use of the developed industrial manufacturing system extant on Earth, and use Earth based materials both for the satellite and propellant. Variants include:
Lunar materials: Designs exist for Solar Power Satellites that source >99% of materials from lunar regolith with very small inputs of "vitamins" from other locations. Using materials from the Moon is attractive because launch from the Moon is in theory far less complicated than from Earth. There is no atmosphere, and so components do not need to be packed tightly in an aeroshell and survive vibration, pressure and temperature loads. Launch may be via a magnetic mass driver and bypass the requirement to use propellant for launch entirely. Launch from the Moon the GEO also requires far less energy than from Earth's much deeper gravity well. Building all the solar power satellites to fully supply all the required energy for the entire planet requires less than one millionth of the mass of the Moon.
Self-replication on the Moon: NASA explored a self-replicating factory on the Moon in 1980. More recently, Justin Lewis-Webber proposed a method of speciated manufacture of core elements based upon John Mankins SPS-Alpha design.
Asteroidal materials: Some asteroids are thought to have even lower Delta-V to recover materials than the Moon, and some particular materials of interest such as metals may be more concentrated or easier to access.
In-space/in-situ manufacturing: With the advent of in-space additive manufacturing, concepts such as SpiderFab might allow mass launch of raw materials for local extrusion.
Method of installation / Transportation of Material to Energy Collection Location: In the reference designs, component material is launched via well-understood chemical rockets (usually fully reusable launch systems) to LEO, after which either chemical or electrical propulsion is used to carry them to GEO. The desired characteristics for this system is very high mass-flow at low total cost. Alternate concepts include:
Lunar chemical launch: ULA has recently showcased a concept for a fully re-usable chemical lander XEUS to move materials from the Lunar surface to LLO or GEO.
Lunar mass driver: Launch of materials from the lunar surface using a system similar to an aircraft carrier electromagnetic catapult. An unexplored compact alternative would be the slingatron.
Lunar space elevator: An equatorial or near-equatorial cable extends to and through the lagrange point. This is claimed by proponents to be lower in mass than a traditional mass driver.
Space elevator: A ribbon of pure carbon nanotubes extends from its center of gravity in Geostationary orbit, allowing climbers to climb up to GEO. Problems with this include the material challenge of creating a ribbon of such length with adequate strength, management of collisions with satellites and space debris, and lightning.
MEO Skyhook: As part of an AFRL study, Roger Lenard proposed a MEO Skyhook. It appears that a gravity gradient-stabilized tether with its center of mass in MEO can be constructed of available materials. The bottom of the skyhook is close to the atmosphere in a "non-keplerian orbit". A re-usable rocket can launch to match altitude and speed with the bottom of the tether which is in a non-keplerian orbit (travelling much slower than typical orbital speed). The payload is transferred and it climbs the cable. The cable itself is kept from de-orbiting via electric propulsion and/or electromagnetic effects.
MAGLEV launch / StarTram: John Powell has a concept for a very high mass-flow system. In a first-gen system, built into a mountain, accelerates a payload through an evacuated MAGLEV track. A small on-board rocket circularizes the payload.
Beamed energy launch: Kevin Parkin and Escape Dynamics both have concepts for ground-based irradiation of a mono-propellant launch vehicle using RF energy. The RF energy is absorbed and directly heats the propellant not unlike in NERVA-style nuclear-thermal. LaserMotive has a concept for a laser-based approach.
|
wikipedia
|
wiki_19700_chunk_7
|
Institute for Biocomputation and Physics of Complex Systems
|
In the area of Socio-Physics, different experiments (onsite and online) to study human behavior are conducted by BIFI members. The main purpose is to analyze the behavioral rules and mechanisms that promote the emergence of cooperation in humans. Through the simulation of increasingly realistic scenarios, important conclusions on how individuals behave when dealing with certain social dilemmas like climate change are also drawn. The results of these studies eventually allow policy makers and governmental institutions to evaluate and redesign, in a more efficient way, economic, social and cooperation policies. For this purpose, we have our own software and a pool of more than 6000 volunteers (Nectunt).
|
wikipedia
|
wiki_30881_chunk_2
|
Sustainable engineering
|
As an aspect of engineering disciplines
Every engineering discipline is engaged in sustainable design, employing Gerry Adams, especially life cycle analysis (LCA), pollution prevention, Design for the Environment (DfE), Design for Disassembly (DfD), and Design for Recycling (DfR). These are replacing or at least changing pollution control paradigms. For example, concept of a "cap and trade" has been tested and works well for some pollutants. This is a system where companies are allowed to place a "bubble" over a whole manufacturing complex or trade pollution credits with other companies in their industry instead of a "stack-by-stack" and "pipe-by-pipe" approach, i.e. the so-called "command and control" approach. Such policy and regulatory innovations call for some improved technology based approaches as well as better quality-based approaches, such as leveling out the pollutant loadings and using less expensive technologies to remove the first large bulk of pollutants, followed by higher operation and maintenance (O&M) technologies for the more difficult to treat stacks and pipes. But, the net effect can be a greater reduction of pollutant emissions and effluents than treating each stack or pipe as an independent entity. This is a foundation for most sustainable design approaches, i.e. conducting a life-cycle analysis, prioritizing the most important problems, and matching the technologies and operations to address them. The problems will vary by size (e.g. pollutant loading), difficulty in treating, and feasibility. The most intractable problems are often those that are small but very expensive and difficult to treat, i.e. less feasible. Of course, as with all paradigm shifts, expectations must be managed from both a technical and an operational perspective. Historically, sustainability considerations have been approached by engineers as constraints on their designs. For example, hazardous substances generated by a manufacturing process were dealt with as a waste stream that must be contained and treated. The hazardous waste production had to be constrained by selecting certain manufacturing types, increasing waste handling facilities, and if these did not entirely do the job, limiting rates of production. Green engineering recognizes that these processes are often inefficient economically and environmentally, calling for a comprehensive, systematic life cycle approach. Green engineering attempts to achieve four goals:
|
wikipedia
|
wiki_3691_chunk_17
|
Randomized algorithm
|
Karger's basic algorithm:
begin
i = 1
repeat
repeat
Take a random edge (u,v) ∈ E in G
replace u and v with the contraction u'
until only 2 nodes remain
obtain the corresponding cut result Ci
i = i + 1
until i = m
output the minimum cut among C1, C2, ..., Cm.
end
In each execution of the outer loop, the algorithm repeats the inner loop until only 2 nodes remain, the corresponding cut is obtained. The run time of one execution is , and n denotes the number of vertices.
After m times executions of the outer loop, we output the minimum cut among all the results. The figure 2 gives an
example of one execution of the algorithm. After execution, we get a cut of size 3.
|
wikipedia
|
wiki_22205_chunk_0
|
Scoring algorithm
|
Scoring algorithm, also known as Fisher's scoring, is a form of Newton's method used in statistics to solve maximum likelihood equations numerically, named after Ronald Fisher. Sketch of derivation
Let be random variables, independent and identically distributed with twice differentiable p.d.f. , and we wish to calculate the maximum likelihood estimator (M.L.E.) of . First, suppose we have a starting point for our algorithm , and consider a Taylor expansion of the score function, , about : where is the observed information matrix at . Now, setting , using that and rearranging gives us:
|
wikipedia
|
wiki_30584_chunk_3
|
Fellow of Biomaterials Science and Engineering
|
The Rights and Obligations of Fellowship
It is expected that Fellows shall recognise individual achievements and contributions to the practice of BSE, foster professional interactions of BSE practitioners among each other, and with medical practitioners, patients, regulatory and legislative offices, and the public, promote public awareness of the profession of BSE, and promote and encourage professional and continuing education in BSE.
In general, these processes are based on the following guidelines.
Candidates for Fellow status are to be nominated and evaluated by existing Fellows
Candidates should normally have at least ten years of scientific or professional contributions to the field of biomaterials science and engineering, with at least ten years of continuous active (full) membership upon nomination, or alternatively, be founding membership in the Society.
Candidates should have appropriate professional training, competence, and good standing in a discipline appropriate for biomaterials science and engineering research. Exceptions can be approved with sufficient justification.
Candidates should have significant contributions to the field of Biomaterials Science and Engineering documented by a continuous productivity in biomaterials research, development, education, or administration. The documents shall evidence an increasing leadership role.
Candidates should have a continuing record of publication in refereed journals appropriate to the candidate's contributions to the field.
|
wikipedia
|
wiki_6664_chunk_3
|
Rhode Island Computer Museum
|
On display are a number of personal microcomputers from the United States and UK, and mainframe computers (e.g. DEC VAXes, Wang 2200-VP, DEC PDP-8, -9, -10, -11, -12, etc.). The collection also includes examples of Sequent multi-processor machines, a Data General Eclipse from the Harvard Cyclotron, one of two surviving Astronautics, and a large selection of Wang VS machines.
|
wikipedia
|
wiki_24026_chunk_3
|
Multiservice tactical brevity code
|
B
Ball Aircraft carrier optical landing system.
Bandit An aircraft identified as enemy, in accordance with theater ID criteria. The term does not necessarily imply direction or authority to engage.
Banzai Information/directive to execute launch and decide tactics.
Base (number) Reference number used to indicate such information as headings, altitude, and fuels.
Bassett Rocket-thrown ASW torpedo.
Bead Window Last transmission potentially disclosed unauthorized information.
Beam/beaming Target stabilized within 70 to 110 degree aspect; generally (direction) given with cardinal directions: east, west, north, or south.
Bent System indicated is inoperative.
Bingo
Minimum fuel state needed for aircraft to return to base.
Proceed/am proceeding to specified base (field) or carrier.
Bird Friendly surface-to-air missile (SAM).
Bird(s) affirm Surface-to-air (S/A) informative call indicating unit is able and prepared to engage a specified target with SAMs (presumes target is within or will enter the SAM engagement envelope).
Bird(s) away Friendly SAM has been fired at designated target.
Bird(s) negat S/A informative call indicating unit is unable to engage a specified target with SAMs. Opposite of bird(s) affirm.
Bittersweet Notification of possible blue on blue (friendly fire) situation relative to a designated track or friendly aircraft.
Blank A suppression of enemy air defenses (SEAD) aircraft does not detect any emitters of interest.
Blind No visual contact with friendly aircraft/ground position; opposite of "Visual".
Bloodhound ASW Torpedo.
Bloomer Disregard my last transmission.
Blow through Directive/informative call that indicates aircraft will continue straight ahead at the merge and not turn with target/targets.
Blue on blue Friendly fire, inadvertent hostile engagement between allies.
Bogey A radar or visual air contact whose identity is unknown.
Bogey dope Request for target information as briefed/available.
Box Groups/contacts/formations in a square or offset square. FM 101-5-1 MCRP 5-2A
BRAA Tactical control format providing target bearing, range, altitude, and aspect, relative to a friendly aircraft or bullseye.
Bracket Indicates geometry where friendly aircraft will maneuver to a position on opposing sides, either laterally or vertically from the target.
Break (direction) Directive to perform an immediate maximum performance turn in the direction indicated; assumes a defensive situation.
Breakaway Tanker or receiver directive call indicating immediate vertical and nose/tail separation between tanker and receiver is required.
Brevity Radio frequency is becoming saturated, degraded, or jammed and briefer transmissions must follow.
Broadcast Request/directive to switch to broadcast control.
Broke lock Loss of radar/infrared (IR) lock-on (advisory).
Bruiser Friendly air-launched anti-ship missile (AShM) (for example, Harpoon, Exocet, or Penguin missiles).
Buddy lock Locked to a known friendly aircraft; normally a response to a spike or buddy spike call and accompanied with position/heading/altitude.
Buddy spike Friendly aircraft air-to-air indication on radar warning receiver (RWR); to be followed by position, heading, and altitude.
Bugout Separation from that particular engagement/attack/operation; no intent to (direction) re-engage/return.
Bulldog Friendly surface/submarine-launched AShM (for example, Harpoon, Exocet, Otomat).
Bullseye An established point from which the position of an object can be referenced; made by cardinal/range or digital format.
Bump/Bump-up Start temporary increase of flight altitude to set the aircraft to a favorable glide path to the target on the attack run.
Burn glint Used to provide illumination.
Buster Directive call to fly at maximum continuous speed.
Buzzer Electronic communications jamming.
|
wikipedia
|
wiki_15528_chunk_27
|
Asymmetric induction
|
When considering how two functional groups or species react, the precise 3D configurations of the chemical entities involved will determine how they may approach one another. Any restrictions as to how these species may approach each other will determine the configuration of the product of the reaction. In the case of asymmetric induction, we are considering the effects of one asymmetric centre on a molecule on the reactivity of other functional groups on that molecule. The closer together these two sites are, the larger an influence is expected to be observed. A more holistic approach to evaluating these factors is by computational modelling, however, simple qualitative factors may also be used to explain the predominant trends seen for some synthetic steps. The ease and accuracy of this qualitative approach means it is more commonly applied in synthesis and substrate design. Examples of appropriate molecular frameworks are alpha chiral aldehydes and the use of chiral auxiliaries.
|
wikipedia
|
wiki_37112_chunk_1
|
Letters in Mathematical Physics
|
Abstracting and indexing
The following services abstract or index Letters in Mathematical Physics: Academic OneFile, Academic Search, Astrophysics Data System, Chemical Abstracts Service, Current Contents/Physical, Chemical and Earth Sciences, Current Index to Statistics, EBSCO, EI-Compendex, INIS Atomindex, Inspec, Mathematical Reviews, ProQuest, Science Citation Index, Scopus, Summon by Serial Solutions, and Zentralblatt MATH. According to the Journal Citation Reports, its 2011 impact factor is 1.819 and 2012 impact factor is 2.415. External links
|
wikipedia
|
wiki_20067_chunk_7
|
K-set (geometry)
|
Matroid generalizations
The planar k-level problem can be generalized to one of parametric optimization in a matroid: one is given a matroid in which each element is weighted by a linear function of a parameter λ, and must find the minimum weight basis of the matroid for each possible value of λ. If one graphs the weight functions as lines in a plane, the k-level of the arrangement of these lines graphs as a function of λ the weight of the largest element in an optimal basis in a uniform matroid, and Dey showed that his O(nk1/3) bound on the complexity of the k-level could be generalized to count the number of distinct optimal bases of any matroid with n elements and rank k.
|
wikipedia
|
wiki_31875_chunk_1
|
Journal of Educational and Behavioral Statistics
|
Mission Statement
The Journal of Educational and Behavioral Statistics (JEBS) provides an outlet for papers that are original and useful to those applying statistical approaches to problems and issues in educational or behavioral research. Typical papers will present new methods of analysis. In addition, critical reviews of current practice, tutorial presentations of less well known methods, and novel applications of already-known methods will be published. Papers discussing statistical techniques without specific educational or behavioral interest will have lower priority.
|
wikipedia
|
wiki_11073_chunk_4
|
Divine Proportions: Rational Trigonometry to Universal Geometry
|
Organization and topics
Divine Proportions is divided into four parts. Part I presents an overview of the use of quadrance and spread to replace distance and angle, and makes the argument for their advantages. Part II formalizes the claims made in part I, and proves them rigorously. Rather than defining lines as infinite sets of points, they are defined by their homogeneous coordinates, which may be used in formulas for testing the incidence of points and lines. Like the sine, the cosine and tangent are replaced with rational equivalents, called the "cross" and "twist", and Divine Proportions develops various analogues of trigonometric identities involving these quantities, including versions of the Pythagorean theorem, law of sines and law of cosines.
|
wikipedia
|
wiki_18104_chunk_12
|
Timeline of the Irish Civil War
|
1 August –
Seven irregulars are arrested in Ballina by the National Army.
In Mayo, the Free State Authorities establish a volunteer Civilian Guard. The initiative is later expanded to other counties.
National Army troops advance through North Mayo via Lahardane. National Army troops are ambushed as they travel through Coolnabinna, at the foot of the Nephin Mountains. One National Army soldier is killed while two Irregulars are wounded. Part of the National army remains in Coolabinna and face a second attack. One of the irregulars is killed. The remaining National Army troops advance to Crossmolina, which is taken without a shot fired. The local population greet the arrival of National Army troops enthusiastically. After the National Army capture Crossmolina, a number of Irregulars are arrested. Thirty men from the town sign up for service in the National Army.
2 August – Naval Landing of Free State troops in County Kerry. Paddy Daly and the Dublin Guard, as well as others, a total of about 800, land at Fenit. They fight their way to Tralee at a cost of 9 killed and 35 wounded. Two Republican fighters are killed in the fighting and more are wounded. The remainder retreat.
Republican forces under Liam Deasy attack Bruree, County Limerick with three armoured cars, trying to re-take it from the Free State troops but their attack is beaten off.
Republicans abandon Tipperary town and retreat to Clonmel; it is then occupied by National Army troops under Paddy O'Connor.
2 August – Irregulars attack Swinford, Mayo. Initially, the Irregulars capture the town, taking 40 National Army Troops. In the evening, National Army troops counter-attack and recapture the town. As they approach the town, the National Army army is ambushed and commandant Scally from Athlone is killed. A second National Army Soldier is also killed. After the National Army employ a machine gun against the insurgents, five irregulars surrendered. All the surrendering irregulars were residents of Foxford, Mayo. The remaining irregulars flee back into the countryside. As they leave the town, the barracks and town hall are burned.
Fighting around Carrick on Suir between 600 National Army troops under General Prout and 400 Republicans under Dan Breen.
3 August –
The Free State forces under General Prout take Carrick on Suir with one man killed and three wounded. Breen's men retreat southwards.
A party of irregulars attack a National Army position at St. Muredach's College, Ballina. During the ensuring gun battle, one National Army soldier is severely wounded. Irregulars also attack troops stationed at the Ballina Workhouse.
A contingent of 70 National Army troops enter Ballinrobe, Mayo. The National Army recruit a further 200 volunteers.
Around 250 pro-treaty IRA men from County Clare are embarked from Kilrush to Tarbert in fishing boats and take Ballylongford and Listowel.
Pro-Treaty supporter under suspicion of being an informant is executed by Anti-Treaty Volunteers in Donoughmore, Co. Cork.
4 August –
Charlestown (Mayo) Public Hall is burnt down.
Republican troops abandon Cashel, County Tipperary.
The National Army capture Tubbecurry, Roscommon. Three Irregulars are captured.
150 Free State troops under Paddy Daly take Castleisland, County Kerry. The Republicans abandon their positions after six shrapnel shells are fired at them from an 18-pounder field gun.
Three Free State soldiers, including two commandants, Collison and McCurtain, are killed in a mine and gun attack on a troop lorry in county Tipperary.
5 August – About 2,000 Free State troops under Eoin O'Duffy take Kilmallock, County Limerick. The Republicans retreat towards Charleville.
|
wikipedia
|
wiki_33706_chunk_18
|
Domain-specific multimodeling
|
Suppose we want to build a PDF file for each survey response to the online surveys that users create. Building a PDF file is outside the scope of our languages so we need to write some Java code that can invoke a third-party PDF library to perform this specialized functionality. Two artifacts are required: First, an additional service model, as shown below, in the Service DSL that defines the interface of the concrete service such that it can be accessed on the modeling level. The service model describes the location of the implementation and what the input and output attributes are.
|
wikipedia
|
wiki_3829_chunk_6
|
Clique (graph theory)
|
Mathematics
Mathematical results concerning cliques include the following.
Turán's theorem gives a lower bound on the size of a clique in dense graphs. If a graph has sufficiently many edges, it must contain a large clique. For instance, every graph with vertices and more than edges must contain a three-vertex clique.
Ramsey's theorem states that every graph or its complement graph contains a clique with at least a logarithmic number of vertices.
According to a result of , a graph with 3n vertices can have at most 3n maximal cliques. The graphs meeting this bound are the Moon–Moser graphs K3,3,..., a special case of the Turán graphs arising as the extremal cases in Turán's theorem.
Hadwiger's conjecture, still unproven, relates the size of the largest clique minor in a graph (its Hadwiger number) to its chromatic number.
The Erdős–Faber–Lovász conjecture is another unproven statement relating graph coloring to cliques.
|
wikipedia
|
wiki_22742_chunk_10
|
University of Maryland Human–Computer Interaction Lab
|
Notable current and former members
Ben Shneiderman, founding director (1983-2000), ACM CHI Academy member, ACM Fellow, member of the National Academy of Engineering, six honorary doctorates
Kent Norman, founding member, Directory of the Laboratory for Automation Psychology
Jenny Preece, lab member, ACM CHI Academy member, former Dean of the College of Information Studies at the University of Maryland, 2005-2015
Ben Bederson, lab member and former director, ACM CHI Academy member, known for foundational work in zoomable interfaces
Allison Druin, lab member and former director, ACM CHI Academy member, ACM CHI Social Impact Award winner, known for foundational work in participatory design with children and designing interactive technology for and with children, former lab director
Catherine Plaisant, associate director, ACM CHI Academy member, IEEE Visualization Career Award winner, research scientist emerita
Jen Golbeck, lab member, former lab director
Niklas Elmqvist, former lab director (2016 to 2021)
Don Hopkins, former student and pie menu creator
Gary Marchionini, former lab member (now at University of North Carolina Chapel Hill, since 1998)
Jean-Daniel Fekete, former lab visiting scientist, now at INRIA
Andrew Sears, former PhD Student
Karen Holtzblatt, CHI Academy member and ACM SIGCHI Lifetime Award for Practice
Leah Findlater, former faculty member
|
wikipedia
|
wiki_1682_chunk_15
|
List of unsolved problems in mathematics
|
Conjectures and problems
Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set.
The covering problem of Rado: if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint subset of squares be?
The Erdős–Oler conjecture that when is a triangular number, packing circles in an equilateral triangle requires a triangle of the same size as packing circles
The kissing number problem for dimensions other than 1, 2, 3, 4, 8 and 24
Reinhardt's conjecture that the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets
Sphere packing problems, including the density of the densest packing in dimensions other than 1, 2, 3, 8 and 24, and its asymptotic behavior for high dimensions.
Square packing in a square: what is the asymptotic growth rate of wasted space?
Ulam's packing conjecture about the identity of the worst-packing convex solid
|
wikipedia
|
wiki_11908_chunk_10
|
Discriminant of an algebraic number field
|
Relative discriminant
The discriminant defined above is sometimes referred to as the absolute discriminant of K to distinguish it from the relative discriminant ΔK/L of an extension of number fields K/L, which is an ideal in OL. The relative discriminant is defined in a fashion similar to the absolute discriminant, but must take into account that ideals in OL may not be principal and that there may not be an OL basis of OK. Let {σ1, ..., σn} be the set of embeddings of K into C which are the identity on L. If b1, ..., bn is any basis of K over L, let d(b1, ..., bn) be the square of the determinant of the n by n matrix whose (i,j)-entry is σi(bj). Then, the relative discriminant of K/L is the ideal generated by the d(b1, ..., bn) as {b1, ..., bn} varies over all integral bases of K/L. (i.e. bases with the property that bi ∈ OK for all i.) Alternatively, the relative discriminant of K/L is the norm of the different of K/L. When L = Q, the relative discriminant ΔK/Q is the principal ideal of Z generated by the absolute discriminant ΔK . In a tower of fields K/L/F the relative discriminants are related by
|
wikipedia
|
wiki_15619_chunk_4
|
Comparison of free and open-source software licences
|
The following table compares various features of each license and is a general guide to the terms and conditions of each licence, based on seven subjects or categories. Recent tools like the European Commissions' Joinup Licensing Assistant, makes possible the licenses selection and comparison based on more than 40 subjects or categories, with access to their SPDX identifier and full text. The table below lists the permissions and limitations regarding the following subjects:
Linking - linking of the licensed code with code licensed under a different license (e.g. when the code is provided as a library)
Distribution - distribution of the code to third parties
Modification - modification of the code by a licensee
Patent grant - protection of licensees from patent claims made by code contributors regarding their contribution, and protection of contributors from patent claims made by licensees
Private use - whether modification to the code must be shared with the community or may be used privately (e.g. internal use by a corporation)
Sublicensing - whether modified code may be licensed under a different licence (for example a copyright) or must retain the same licence under which it was provided
TM grant - use of trademarks associated with the licensed code or its contributors by a licensee
|
wikipedia
|
wiki_5946_chunk_12
|
Vital statistics (government records)
|
"Despite the importance of tracking causes of death and the tradition since 1893 of standardisation of definitions and coding for causes of death in the International Classification of Diseases and Injuries (ICD), global assessments of causes of death are a major analytical challenge. Vital registration systems that include medical certification of the cause of death captured about 18.8 million deaths of an estimated annual total of 51.7 million deaths in 2005, which is the latest year for which the largest number of countries reported deaths from a vital registration system. Even for these deaths, the comparability of findings on the leading causes of death is affected by variation in certification skills among physicians, the diagnostic and pathological data available at the time of completing a death certificate, variations in medical culture in choosing the underlying cause, and legal and institutional frameworks for governing mortality reporting. For the remaining deaths that are not medically certified, many different data sources and diagnostic approaches must be used from surveillance systems, demographic research sites, surveys, censuses, disease registries, and police records to construct a consolidated picture of causes of death in various populations. Because of the variety of data sources and their associated biases, causes of death assessments are inherently uncertain and subject to vigorous debate."
|
wikipedia
|
wiki_4217_chunk_16
|
Parameterized complexity
|
Input: A Boolean formula of depth at most and weft at most , and a number . The depth is the maximal number of gates on any path from the root to a leaf, and the weft is the maximal number of gates of fan-in at least three on any path from the root to a leaf.
Question: Does the formula have a satisfying assignment of Hamming weight exactly ? It can be shown that for the problem Weighted -Normalize SAT is complete for under fpt-reductions.
Here, Weighted -Normalize SAT is the following problem:
|
wikipedia
|
wiki_32762_chunk_8
|
FACT (computer language)
|
Report descriptions:
R 1 40ERROR-REPORT
A 2 PAGE-HEADING HDEJ 2
F 3 BATCH-NUMBER 24BATCH NO. ^
F 4 PAGE-NUMBER 1 43IN ERROR PAGE ^
A 5 COLUMN-HEADINGS HD 3
F 6 30EMP.NO. HOURS EMP.NO.HOURS^
F 7 60EMP.NO. HOURS EMP.NO.HOURS^
F 8 90EMP.NO. HOURS EMP.NO.HOURS^
F 9 120EMP.NO. HOURS EMP.NO.HOURS^
A 10 ERROR-LINE OO 1
F 11 1ST EN 8 ^
F 12 1ST RH 14 .^
F 13 2ND EN 23 ^
F 14 2ND RH 29 .^
F 15 3RD EN 38 ^
F 16 3RD RH 44 .^
|
wikipedia
|
wiki_14419_chunk_22
|
List of African-American mathematicians
|
1960s
Sylvia D. Trimble Bozeman (born 1947), degrees from Alabama A&M University, Vanderbilt University, Emory University (PhD).
Christine Darden (born 1942), degrees from Hampton Institute, Virginia State University, George Washington University (PhD, engineering).
James A. Donaldson (1941–2019), degrees from Lincoln University (Pennsylvania), University of Illinois at Urbana-Champaign (PhD).
Fern Y. Hunt (born 1948), degrees from Bryn Mawr College, New York University (PhD).
Jeanette Scissum, degrees from Alabama A&M University, computer science PhD.
Raymond L. Johnson (born 1943), degrees from University of Texas at Austin, Rice University (PhD).
Ronald Elbert Mickens (born 1943), degrees from Fisk University, Vanderbilt University (PhD, physics).
Scott W. Williams (born 1943), degrees from Morgan State University, Lehigh University (PhD).
Lloyd Demetrius, degrees from University of Cambridge, University of Chicago (PhD).
|
wikipedia
|
wiki_2784_chunk_33
|
Assignment (computer science)
|
{| class="wikitable"
|-
| variable << expression || Magik
|-
| variable <- expression || F#, OCaml, R, S
|-
| variable <<- expression || R
|-
| assign("variable", expression) || R
|-
| variable ← expression || APL, Smalltalk, BASIC Programming
|-
| variable =: expression || J
|-
| LET variable = expression || BASIC
|-
| let variable := expression || XQuery
|-
| set variable to expression || AppleScript
|-
| set variable = expression || C shell
|-
| Set-Variable variable (expression) || PowerShell
|-
| variable : expression || Macsyma, Maxima, K
|-
| variable: expression || Rebol
|-
| var variable expression || mIRC scripting language
|-
| reference-variable :- reference-expression || Simula
|}
|
wikipedia
|
wiki_14029_chunk_53
|
Recursion (computer science)
|
The Towers of Hanoi is a mathematical puzzle whose solution illustrates recursion. There are three pegs which can hold stacks of disks of different diameters. A larger disk may never be stacked on top of a smaller. Starting with n disks on one peg, they must be moved to another peg one at a time. What is the smallest number of steps to move the stack?Function definition:Recurrence relation for hanoi: Example implementations: Although not all recursive functions have an explicit solution, the Tower of Hanoi sequence can be reduced to an explicit formula.
|
wikipedia
|
wiki_38330_chunk_6
|
Symbolic circuit analysis
|
Another possibility to shorten the symbolic expression to manageable length is to represent the network function by a sequence of expressions (SoE). Of course, the interpretability of the formula is lost, but this approach is very useful for repetitive numerical calculations. A software package STAINS (Symbolic Two-port Analysis via Internal Node Suppression) has been developed to generate such sequences. There are several types of SoE that can be obtained from STAINS. For example, the compact SoE for of our biquad is
|
wikipedia
|
wiki_26970_chunk_24
|
Amiga productivity software
|
Science, entertainment and special use programs
Maple V is one of the best general purpose mathematics software (a.k.a. Mathematic-CAD) ever made. It was available for Amiga also, and appreciated by many scientists using Amiga in its time. Distant Suns, Galileo, Digital Almanac and Amiga Digital Universe (from Bill Eaves for the OS4) were stellar sky exploring programs and astronomic calculators. During the age of CDTV many historic, science, and art CDs like Timetable of Science, Innovation, Timetable of Business, Politics, Grolier's Encyclopedia, Guinness Disk of Records, Video Creator, American Heritage Dictionary, Illustrated Holy Bible, Illustrated Works of Shakespeare, etc. were available.
|
wikipedia
|
wiki_13675_chunk_9
|
Word problem (mathematics)
|
The word problem for an abstract rewriting system (ARS) is quite succinct: given objects x and y are they equivalent under ? The word problem for an ARS is undecidable in general. However, there is a computable solution for the word problem in the specific case where every object reduces to a unique normal form in a finite number of steps (i.e. the system is convergent): two objects are equivalent under if and only if they reduce to the same normal form.
The Knuth-Bendix completion algorithm can be used to transform a set of equations into a convergent term rewriting system.
|
wikipedia
|
wiki_10152_chunk_1
|
Field artillery in the American Civil War
|
{| class="wikitable"
|+ Field artillery weapons characteristics
! rowspan=2 | Name
! colspan=4 | Tube
! rowspan=2 | Projectile(lb)
! rowspan=2 | Charge(lb)
! rowspan=2 | Velocity(ft/s)
! rowspan=2 | Range(yd at 5°)
|-
! Material
! Bore (in)
! Len (in)
! Wt (lb)
|-
| 6-pounder Gun
| align="center" | bronze
| align="right" | 3.67
| align="right" | 60
| align="right" | 884
| align="right" | 6.1
| align="right" | 1.25
| align="right" | 1,439
| align="right" | 1,523
|-
| M1857 12-pounder "Napoleon"
| align="center" | bronze
| align="right" | 4.62
| align="right" | 66
| align="right" | 1,227
| align="right" | 12.3
| align="right" | 2.50
| align="right" | 1,440
| align="right" | 1,619
|-
| 12-pounder Howitzer
| align="center" | bronze
| align="right" | 4.62
| align="right" | 53
| align="right" | 788
| align="right" | 8.9
| align="right" | 1.00
| align="right" | 1,054
| align="right" | 1,072
|-
| 12-pounder Mountain Howitzer
| align="center" | bronze
| align="right" | 4.62
| align="right" | 33
| align="right" | 220
| align="right" | 8.9
| align="right" | 0.5
| align="right" | ---
| align="right" | 1,005
|-
| 24-pounder Howitzer
| align="center" | bronze
| align="right" | 5.82
| align="right" | 64
| align="right" | 1,318
| align="right" | 18.4
| align="right" | 2.00
| align="right" | 1,060
| align="right" | 1,322
|-
| 10-pounder Parrott rifle
| align="center" | iron
| align="right" | 2.9or 3.0
| align="right" | 74
| align="right" | 890
| align="right" | 9.5
| align="right" | 1.00
| align="right" | 1,230
| align="right" | 1,850
|-
| 3-inch Ordnance Rifle
| align="center" | wroughtiron
| align="right" | 3.0
| align="right" | 69
| align="right" | 820
| align="right" | 9.5
| align="right" | 1.00
| align="right" | 1,215
| align="right" | 1,830
|-
| 14-pounder James Rifle<ref>Hazlett, pp. 151-152. This is for Hotchkiss shell of 14lb @ 5 degrees. Hazlett used the only primary source: Abbot's Siege Artillery..." p. 116. Hazlett determined bore and Type I based on text description and shell weight--matching recorded weights of modern recoveries (see Dickey pp. 137-139,143-146.) Coles' data table and many others based on Peterson's 1959 book have impossibly small powder charge for range and weight given. Later 14-pounder James types with Ordnance profile had longer barrels with 7.5" greater bore length (13% increase) and therefore should have increased range.</ref>
| align="center" | bronze
| align="right" | 3.80
| align="right" | 60
| align="right" | 875
| align="right" | 14.0| align="right" | 1.25
| align="right" | ----
| align="right" | 1,530|-
| 20-pounder Parrott rifle
| align="center" | iron
| align="right" | 3.67
| align="right" | 84
| align="right" | 1,750
| align="right" | 20.0
| align="right" | 2.00
| align="right" | 1,250
| align="right" | 1,900
|-
| 12-pounder Whitworth breechloading rifle
| align="center" | iron
| align="right" | 2.75
| align="right" | 104
| align="right" | 1,092
| align="right" | 12.0
| align="right" | 1.75
| align="right" | 1,500
| align="right" | 2,800
|-
! colspan=9 | Italics denotes data for shell, not shot.|}
|
wikipedia
|
wiki_3793_chunk_16
|
Geocode
|
Changing the subdivision criteria we can obtain other hierarchical systems. For example for hydrological criteria there is a geocode system, the US's hydrologic unit code (HUC), that is a numeric representation of basin names in a hierarchical syntax schema (first level illustred). For example the HUC 17 is the identifier of "Pacific Northwest Columbia basin"; HUC 1706 of "Lower Snake basin", a spatial subset of HUC 17 and a superset of 17060102 ("Imnaha River"). Systems of regular grids
|
wikipedia
|
wiki_8398_chunk_2
|
Spatial network
|
Characterizing spatial networks
The following aspects are some of the characteristics to examine a spatial network:
Planar networks
In many applications, such as railways, roads, and other transportation networks, the network is assumed to be planar. Planar networks build up an important group out of the spatial networks, but not all spatial networks are planar. Indeed, the airline passenger
networks is a non-planar example: Many large airports in the world are connected through direct flights.
The way it is embedded in space
There are examples of networks, which seem to be not "directly" embedded in space. Social networks for instance
connect individuals through friendship relations. But in this case, space intervenes in the fact that the connection
probability between two individuals usually decreases with the distance between them.
Voronoi tessellation
A spatial network can be represented by a Voronoi diagram, which is a way of dividing space into a number of regions. The dual graph for a Voronoi diagram corresponds to the Delaunay triangulation for the same set of points.
Voronoi tessellations are interesting for spatial networks in the sense that they provide a natural representation model
to which one can compare a real world network.
Mixing space and topology
Examining the topology of the nodes and edges itself is another way to characterize networks. The distribution of degree of the nodes is often considered, regarding the structure of edges it is useful to find the Minimum spanning tree, or the generalization, the Steiner tree and the relative neighborhood graph.
|
wikipedia
|
wiki_1130_chunk_12
|
J (programming language)
|
Verbs and Modifiers
A program or routine - something that takes data as input and produces data as output - is called a verb. J has a rich set of predefined verbs, all of which work on multiple data types automatically: for example, the verb searches within arrays of any size to find matches: 3 1 4 1 5 9 i. 3 1 NB. find the index of the first occurrence of 3, and of 1
0 1
3 1 4 1 5 9 i: 3 1 NB. find the index of the last occurrence of 3, and of 1
0 3
|
wikipedia
|
wiki_462_chunk_34
|
Principia Mathematica
|
NB: As a result of criticism and advances, the second edition of PM (1927) replaces ✸9 with a new ✸8 (Appendix A). This new section eliminates the first edition's distinction between real and apparent variables, and it eliminates "the primitive idea 'assertion of a propositional function'. To add to the complexity of the treatment, ✸8 introduces the notion of substituting a "matrix", and the Sheffer stroke:
Matrix: In contemporary usage, PM 's matrix is (at least for propositional functions), a truth table, i.e., all truth-values of a propositional or predicate function.
Sheffer stroke: Is the contemporary logical NAND (NOT-AND), i.e., "incompatibility", meaning:
"Given two propositions p and q, then ' p | q ' means "proposition p is incompatible with proposition q", i.e., if both propositions p and q evaluate as true, then and only then p | q evaluates as false." After section ✸8 the Sheffer stroke sees no usage.
|
wikipedia
|
wiki_483_chunk_10
|
Polymath
|
Root-Bernstein and colleagues' research is an important counterpoint to the claim by some psychologists that creativity is a domain-specific phenomenon. Through their research, Root-Bernstein and colleagues conclude that there are certain comprehensive thinking skills and tools that cross the barrier of different domains and can foster creative thinking: "[creativity researchers] who discuss integrating ideas from diverse fields as the basis of creative giftedness ask not 'who is creative?' but 'what is the basis of creative thinking?' From the polymathy perspective, giftedness is the ability to combine disparate (or even apparently contradictory) ideas, sets of problems, skills, talents, and knowledge in novel and useful ways. Polymathy is therefore the main source of any individual's creative potential". In "Life Stages of Creativity", Robert and Michèle Root-Bernstein suggest six typologies of creative life stages. These typologies based on real creative production records first published by Root-Bernstein, Bernstein, and Garnier (1993).
|
wikipedia
|
wiki_11120_chunk_3
|
Physics education
|
Compare to the other syllabus include GCSE, GCE etc. which learn wider and boarder of different topics, the Hong Kong syllabus is learning more deeply and more challenges with calculations. Topics are narrow down to a smaller amount compared to the A-level due to the insufficient teaching hours at secondary schools in Hong Kong, which include temperature, heat, internal energy, change of state, gases, position, motion, force, projectile motion, work, energy, power, momentum, uniform circular motion, gravitation, wave, light, sound, electrostatics, circuits, electromagnetism, radiation, radioactivity, atomic model, nuclear energy, universe, astronomy, stars, Rutherford model, photoelectric effect, Bohr model, particles, nanoscopic scale, building, transportation, renewable energy sources, eye, ear, non-ionizing radiation and ionizing radiation etc.
|
wikipedia
|
wiki_21537_chunk_3
|
Centre for Energy, Petroleum and Mineral Law and Policy
|
References
The Quality Assurance Agency for Higher Education, (2002), "Academic review: Subject Review; Law, University of Dundee", https://web.archive.org/web/20071008134635/http://www.qaa.ac.uk/reviews/reports/subjectlevel/sr060_02.pdf, accessed 02-10-2007
LLM Guide Master's of Law Programmes World Wide, http://www.llm-guide.com/board/6332, accessed 28-09-2007
Oil Voice Forum, https://web.archive.org/web/20071018042804/http://forum.oilvoice.com/topic.asp?TOPIC_ID=764, accessed 28-09-2007
Cresswell, J., (2006), "Scots energy and mineral law centre a hidden jewel", Press & Journal, Aberdeen.
Department of Trade and Industry (Scotland), (2006), "Dundee University receives Royal Award Visit", http://www.gnn.gov.uk/content/detail.asp?NewsAreaID=2&ReleaseID=229917, accessed 02-10-2007.
The Queen's Awards for Enterprise, 2004 Winners, https://web.archive.org/web/20070927064335/http://www.queensawards.org.uk/business/Winners/2004.html, accessed 09-10-2007.
|
wikipedia
|
wiki_17874_chunk_3
|
Expansion (geometry)
|
By dimension:
A regular {p} polygon expands into a regular 2n-gon.
The operation is identical to truncation for polygons, e{p} = e1{p} = t0,1{p} = t{p} and has Coxeter-Dynkin diagram .
A regular {p,q} polyhedron (3-polytope) expands into a polyhedron with vertex figure p.4.q.4.
This operation for polyhedra is also called cantellation, e{p,q} = e2{p,q} = t0,2{p,q} = rr{p,q}, and has Coxeter diagram .
For example, a rhombicuboctahedron can be called an expanded cube, expanded octahedron, as well as a cantellated cube or cantellated octahedron.
A regular {p,q,r} 4-polytope (4-polytope) expands into a new 4-polytope with the original {p,q} cells, new cells {r,q} in place of the old vertices, p-gonal prisms in place of the old faces, and r-gonal prisms in place of the old edges.
This operation for 4-polytopes is also called runcination, e{p,q,r} = e3{p,q,r} = t0,3{p,q,r}, and has Coxeter diagram .
Similarly a regular {p,q,r,s} 5-polytope expands into a new 5-polytope with facets {p,q,r}, {s,r,q}, {p,q}×{ } prisms, {s,r}×{ } prisms, and {p}×{s} duoprisms.
This operation is called sterication, e{p,q,r,s} = e4{p,q,r,s} = t0,4{p,q,r,s} = 2r2r{p,q,r,s} and has Coxeter diagram .
|
wikipedia
|
wiki_19705_chunk_10
|
Java version history
|
Tiger added a number of significant new language features:
Generics: provides compile-time (static) type safety for collections and eliminates the need for most typecasts (type conversion) (specified by JSR 14)
Metadata: also called annotations; allows language constructs such as classes and methods to be tagged with additional data, which can then be processed by metadata-aware utilities (specified by JSR 175)
Autoboxing/unboxing: automatic conversions between primitive types (such as int) and primitive wrapper classes (such as ) (specified by JSR 201)
Enumerations: the enum keyword creates a typesafe, ordered list of values (such as Day.MONDAY, Day.TUESDAY, etc.); previously this could only be achieved by non-typesafe constant integers or manually constructed classes (typesafe enum pattern) (specified by JSR 201)
Varargs: the last parameter of a method can now be declared using a type name followed by three dots (e.g. void drawtext(String... lines)); in the calling code any number of parameters of that type can be used and they are then placed in an array to be passed to the method, or alternatively the calling code can pass an array of that type
Enhanced for each loop: the for loop syntax is extended with special syntax for iterating over each member of either an array or any , such as the standard classes (specified by JSR 201)
Improved semantics of execution for multi-threaded Java programs; the new Java memory model addresses issues of complexity, effectiveness, and performance of previous specifications
Static imports
|
wikipedia
|
wiki_4522_chunk_10
|
P (complexity)
|
Pure existence proofs of polynomial-time algorithms
Some problems are known to be solvable in polynomial time, but no concrete algorithm is known for solving them. For example, the Robertson–Seymour theorem guarantees that there is a finite list of forbidden minors that characterizes (for example) the set of graphs that can be embedded on a torus; moreover, Robertson and Seymour showed that there is an O(n3) algorithm for determining whether a graph has a given graph as a minor. This yields a nonconstructive proof that there is a polynomial-time algorithm for determining if a given graph can be embedded on a torus, despite the fact that no concrete algorithm is known for this problem.
|
wikipedia
|
wiki_473_chunk_15
|
P-code machine
|
Example machine
Niklaus Wirth specified a simple p-code machine in the 1976 book Algorithms + Data Structures = Programs. The machine had 3 registers - a program counter p, a base register b, and a top-of-stack register t. There were 8 instructions:
lit 0, a : load constant a
opr 0, a : execute operation a (13 operations: RETURN, 5 math functions, and 7 comparison functions)
lod l, a : load variable l,a
sto l, a : store variable l,a
cal l, a : call procedure a at level l
int 0, a : increment t-register by a
jmp 0, a : jump to a
jpc 0, a : jump conditional to a
|
wikipedia
|
wiki_27899_chunk_3
|
Business network
|
Snehota and Hakansson (1995) explain: For more than twenty years, we have analyzed business networks for answers to the many questions about industrial markets. Unlike consumer markets, industrial markets are not generally known to the public, nor to many management scholars. We have been surprised by the complexity of industrial markets and at the same time by the apparent smoothness of their working. Gradually, we have acquired respect for their importance and complexity and learned how they work.
|
wikipedia
|
wiki_11201_chunk_5
|
Mathematical Association
|
Arms See also
London Mathematical Society
Institute of Mathematics and its Applications References Michael H Price Mathematics of the Multitude? A History of the Mathematical Association (MA, 1994) External links
The Mathematical Association website
Complete list of Presidents of the Association
The MA's online shop
Annual conference
The Mathematical Gazette No. 1, 30, 31, 37–39, 41, 43 (1901–1904) on the Internet Archive digitised by Google from the Harvard University Library News items
Addressing the downward spiral of UK maths education in February 2004
Proposal to split Maths GCSE into two in August 2003
|
wikipedia
|
wiki_8335_chunk_30
|
Physics (Aristotle)
|
{{cite book | last=Bostock | first=David | title=Space, Time, Matter, and Form: Essays on Aristotle's Physics | location=Oxford | publisher=University Press | year=2006 | series=Oxford Aristotle Studies}}
Aristotle's definition of motion, meaning any sort of a change, a technical concept from the Theory of Matter and Form, is especially difficult for moderns unfamiliar with the philosophy to understand. It is the actualization (the becoming visible) of a new instance of a form (or system of forms) in matter that has a potency (capability to receive) for it. Brague makes the attempt to elucidate to moderns.
Collects these papers:
Maritain, Jacques, Science and Wisdom, trans. Bernard Wall (New York: Charles Scribner's Sons, 1954).
Morison, Benjamin, On Location: Aristotle's Concept of Place (Oxford University Press, 2002).
Reizler, Kurt, Physics and Reality (New Haven: Yale University Press, 1940).
Alborado's birth name was Joaquín Albareda y Ramoneda.
Smith, Vincent Edward, The General Science of Nature (Milwaukee: The Bruce Publishing Company, 1958).
Smith, Vincent Edward, Philosophical Physics (New York: Harper & Brothers, 1950).
|
wikipedia
|
wiki_15374_chunk_14
|
Product-family engineering
|
Process data diagram
On the left side the entire process from the top to bottom has been drawn. All activities on the left side are linked to the concepts on the right side through dotted lines. Every concept has a number, which reflects the association with other concepts. List of concepts
Below the list with concepts will be explained. Most concept definitions are extracted from Pohl, Bockle, & Linden (2005) and also some new definitions have been added. Table 1: List of concepts
|
wikipedia
|
wiki_521_chunk_21
|
Statistics
|
Experiments
The basic steps of a statistical experiment are:
Planning the research, including finding the number of replicates of the study, using the following information: preliminary estimates regarding the size of treatment effects, alternative hypotheses, and the estimated experimental variability. Consideration of the selection of experimental subjects and the ethics of research is necessary. Statisticians recommend that experiments compare (at least) one new treatment with a standard treatment or control, to allow an unbiased estimate of the difference in treatment effects.
Design of experiments, using blocking to reduce the influence of confounding variables, and randomized assignment of treatments to subjects to allow unbiased estimates of treatment effects and experimental error. At this stage, the experimenters and statisticians write the experimental protocol that will guide the performance of the experiment and which specifies the primary analysis of the experimental data.
Performing the experiment following the experimental protocol and analyzing the data following the experimental protocol.
Further examining the data set in secondary analyses, to suggest new hypotheses for future study.
Documenting and presenting the results of the study.
|
wikipedia
|
wiki_10191_chunk_17
|
Intentional programming
|
External links
Intentional Software - Charles Simonyi's company
The Death Of Computer Languages, The Birth of Intentional Programming, a technical report by Charles Simonyi (1995)
Intentional Programming - Innovation in the Legacy Age, a talk by Charles Simonyi (1996)
Edge.org interview with Charles Simonyi (interviewer: John Brockman)
Language Workbenches: The Killer-App for Domain Specific Languages? - Martin Fowler's article on the general class of tools that Intentional Programming is an example of.
"Anything You Can Do, I Can Do Meta" Tuesday, January 9, 2007, Scott Rosenberg, Technology Review
Awaiting the Day When Everyone Writes Software, The New York Times, 28 January 2007
Is programming a form of encryption?, by Charles Simonyi (2005)
Appropriate Levels of Abstraction, by Charles Simonyi (2005)
The information contents of programs, by Charles Simonyi (2005)
Feature X Considered Harmful, by Charles Simonyi (2005)
Notations and Programming Languages, by Charles Simonyi (2005)
Personal Observations from a Developer, by Mark Edel (2005)
Microsoft Research's educational video introducing their Intentional Programming system (ASF format, circa 1998, 20 megabytes)
|
wikipedia
|
wiki_3682_chunk_29
|
Wuppertal Institute for Climate, Environment and Energy
|
Communicating sustainability
The Institute has always sought to communicate research results to its different target groups, addressing them in their own ‘language’. The research is communicated actively:
to the scientific world, by means of numerous scientific publications, by organising and participating in lectures, symposia, workshops and conferences and by engaging in networks with research partners in Germany and abroad;
to decision makers in the realms of policy, business and society, through scientific research and consulting projects, projects that launch innovations (model projects, pilot projects), dialogues with partners from business and industry, and also through publications oriented towards the users' needs;
to the general public, by means of popular science books, public events as well as articles and reports in the press, on radio and television;
to young people, through projects carried out with schools and other educational institutions, through supporting young scientists in collaboration with universities, and through teaching and educational materials.
|
wikipedia
|
wiki_8613_chunk_9
|
Cache-oblivious algorithm
|
Examples The simplest cache-oblivious algorithm presented in Frigo et al. is an out-of-place matrix transpose operation (in-place algorithms have also been devised for transposition, but are much more complicated for non-square matrices). Given m×n array A and n×m array B, we would like to store the transpose of in . The naive solution traverses one array in row-major order and another in column-major. The result is that when the matrices are large, we get a cache miss on every step of the column-wise traversal. The total number of cache misses is .
|
wikipedia
|
wiki_4406_chunk_4
|
Round-trip engineering
|
Examples of round-trip engineering
Perhaps the most common form of round-trip engineering is synchronization between UML (Unified Modeling Language) models and the corresponding source code. Many commercial tools and research prototypes support this form of RTE; a 2007 book lists Rational Rose, Micro Focus Together, ESS-Model, BlueJ, and Fujaba among those capable, with Fujaba said to be capable to also identify design patterns. Usually, UML class diagrams are supported to some degree; however, certain UML concepts, such as associations and containment do not have straightforward representations in many programming languages which limits the usability of the created code and accuracy of code analysis (e.g., containment is hard to recognize in the code). A 2005 book on Visual Studio notes for instance that a common problem in RTE tools is that the model reversed is not the same as the original one, unless the tools are helped by laborious annotations. The behavioral parts of UML impose even more challenges for RTE.
|
wikipedia
|
wiki_11063_chunk_9
|
Shunting-yard algorithm
|
{| class="wikitable"
! Operator !! Precedence !! Associativity
|- || align="center"
| ^ || 4 || Right
|- || align="center"
| × || 3 || Left
|- || align="center"
| ÷ || 3 || Left
|- || align="center"
| + || 2 || Left
|- || align="center"
| − || 2 || Left
|}
The symbol ^ represents the power operator.
{| class="wikitable"
! Token !! Action !! Output(in RPN) !! Operatorstack !! Notes
|-
| align="center" | 3 || Add token to output || 3 || ||
|-
| align="center" | + || Push token to stack || 3 || align="right" | + ||
|-
| align="center" | 4 || Add token to output || 3 4 || align="right" | + ||
|-
| align="center" | × || Push token to stack || 3 4 || align="right" | × + || × has higher precedence than +
|-
| align="center" | 2 || Add token to output || 3 4 2 || align="right" | × + ||
|-
| align="center" rowspan="2" | ÷ || Pop stack to output || 3 4 2 × || align="right" | + || ÷ and × have same precedence
|-
| Push token to stack || 3 4 2 × || align="right" | ÷ + || ÷ has higher precedence than +
|-
| align="center" | ( || Push token to stack || 3 4 2 × || align="right" | ( ÷ + ||
|-
| align="center" | 1 || Add token to output || 3 4 2 × 1 || align="right" | ( ÷ + ||
|-
| align="center" | − || Push token to stack || 3 4 2 × 1 || align="right" | − ( ÷ + ||
|-
| align="center" | 5 || Add token to output || 3 4 2 × 1 5 || align="right" | − ( ÷ + ||
|-
| align="center" rowspan="2" | ) || Pop stack to output || 3 4 2 × 1 5 − || align="right" | ( ÷ + || Repeated until "(" found
|-
| Pop stack || 3 4 2 × 1 5 − || align="right" | ÷ + || Discard matching parenthesis
|-
| align="center" | ^ || Push token to stack || 3 4 2 × 1 5 − || align="right" | ^ ÷ + || ^ has higher precedence than ÷
|-
| align="center" | 2 || Add token to output || 3 4 2 × 1 5 − 2 || align="right" | ^ ÷ + ||
|-
| align="center" | ^ || Push token to stack || 3 4 2 × 1 5 − 2 || align="right" | ^ ^ ÷ + || ^ is evaluated right-to-left
|-
| align="center" | 3 || Add token to output || 3 4 2 × 1 5 − 2 3 || align="right" | ^ ^ ÷ + ||
|-
| align="center" | end || Pop entire stack to output || 3 4 2 × 1 5 − 2 3 ^ ^ ÷ + || ||
|}
|
wikipedia
|
wiki_16885_chunk_7
|
Paxos (computer science)
|
In order to simplify the presentation of Paxos, the following assumptions and definitions are made explicit. Techniques to broaden the applicability are known in the literature, and are not covered in this article. Processors
|
wikipedia
|
wiki_6572_chunk_11
|
Population ecology
|
For the management of many fish and other wildlife populations, the goal is often to achieve the largest possible long-run sustainable harvest, also known as maximum sustainable yield (or MSY). Given a population dynamic model, such as any of the ones above, it is possible to calculate the population size that produces the largest harvestable surplus at equilibrium. While the use of population dynamic models along with statistics and optimization to set harvest limits for fish and game is controversial among some scientists, it has been shown to be more effective than the use of human judgment in computer experiments where both incorrect models and natural resource management students competed to maximize yield in two hypothetical fisheries. To give an example of a non-intuitive result, fisheries produce more fish when there is a nearby refuge from human predation in the form of a nature reserve, resulting in higher catches than if the whole area was open to fishing.
|
wikipedia
|
wiki_17565_chunk_13
|
Program database
|
Module information, variable length. Total size in above header. There is one of these for each object module used by the linker
Opened, 4 bytes.
Symbol info.
Section number, 2 bytes + 2 bytes padding.
Offset and size, 4 bytes each.
Flags, 4 bytes.
Module number, 2 bytes + 2 bytes padding.
CRCs for section data and relocations data, 4 bytes each.
Flags, 2 bytes.
Stream number, 2 bytes.
Symbols size, 4 bytes.
Old and new line number info sizes, 4 bytes each.
Number of source files, 2 bytes + 2 bytes padding.
Offsets, 4 bytes.
niSource and niCompiler, 4 bytes each.
Module name, null terminated byte string.
Object name, null terminated byte string.
Padding to multiple of 4 bytes.
Section contributions, section headers, file info, ts map, and EC info. Their sizes are found in the above header.
Debug header,
Stream numbers for Old Frame Pointer Omission, Exceptions, Fixups, Object Maps to and from Source, Section Headers, Token Ring IDs, Xdata, Pdata, New Frame Pointer Omission, and Section Header Origin. 2 bytes each.
|
wikipedia
|
wiki_26493_chunk_70
|
Comparison of programming languages (associative array)
|
See JavaScript Array And Object Prototype Awareness Day for more information on the issue. Julia In Julia, the following operations manage associative arrays. Declare dictionary:
phonebook = Dict( "Sally Smart" => "555-9999", "John Doe" => "555-1212", "J. Random Hacker" => "555-1337" ) Access element: phonebook["Sally Smart"] Add element: phonebook["New Contact"] = "555-2222" Delete element: delete!(phonebook, "Sally Smart")
|
wikipedia
|
wiki_30555_chunk_24
|
16PF Questionnaire
|
Cattell physical sciences background
The 16PF Questionnaire was created from a fairly unusual perspective among personality tests. Most personality tests are developed to measure just the pre-conceived traits that are of interest to a particular theorist or researcher. The main author of the 16PF, Raymond B. Cattell, had a strong background in the physical sciences, especially chemistry and physics, at a time when the basic elements of the physical world were being discovered, placed in the periodic table, and used as the basis for understanding the fundamental nature of the physical world and for further inquiry. From this background in the physical sciences, Cattell developed the belief that all fields are best understood by first seeking to find the fundamental underlying elements in that domain, and then developing a valid way to measure and research these elements (Cattell, 1965).
|
wikipedia
|
wiki_15035_chunk_3
|
Australian Mathematics Competition
|
Format
The competition paper consists of twenty-five multiple-choice questions and five integer questions, which are ordered in increasing difficulty. Students record their personal details and mark their answers by pencil on a carbon-mark answer sheet, which is marked by computer. Since 2016, an online option has been available to schools. The online competition has the same content as the paper version and results from both options are assessed together. There are five divisions in total: Senior (for years 11 and 12), Intermediate (for years 9 and 10), Junior (for years 7 and 8), Upper Primary (for years 5 and 6) and Middle Primary (for years 3 and 4).
|
wikipedia
|
wiki_19996_chunk_3
|
Divided power structure
|
with PD ideal and an A-linear map (The case of divided power polynomials is the special case in which M is a free module over A of finite rank.) If I is any ideal of a ring A, there is a universal construction which extends A with divided powers of elements of I to get a divided power envelope of I in A. Applications The divided power envelope is a fundamental tool in the theory of PD differential operators and crystalline cohomology, where it is used to overcome technical difficulties which arise in positive characteristic. The divided power functor is used in the construction of co-Schur functors. See also
|
wikipedia
|
wiki_17345_chunk_6
|
American Society for Cell Biology
|
Annual meeting
Typically held within the first two weeks of December, the ASCB's annual meeting brings together scientists in the field of cell biology to highlight the latest research, techniques, products, and services, providing a venue for networking and career advice, offering research-tested educational approaches for high school teachers and professors who teach undergraduates, and to spur future discovery and collaboration. The ASCB also presents awards, poster sessions (where students, postdoctoral fellows, and independent scientists present their research and receive feedback), scientific sessions (symposia, minisymposia, working groups, workshops, translational sessions, special interest subgroups, award lectures, and exhibits). Science discussion tables offer opportunities to discuss scientific topics with expert scientists, and the career discussion roundtables offer a variety of career topic-themed tables addressed with expert facilitators. In addition, special sessions focus on advocacy, media and public outreach, and special issues of interest to women, minorities, gay, lesbian, and transgender students/scientists, the media, etc.
|
wikipedia
|
wiki_4_chunk_32
|
Algorithm
|
Structured programming, canonical structures: Per the Church–Turing thesis, any algorithm can be computed by a model known to be Turing complete, and per Minsky's demonstrations, Turing completeness requires only four instruction types—conditional GOTO, unconditional GOTO, assignment, HALT. Kemeny and Kurtz observe that, while "undisciplined" use of unconditional GOTOs and conditional IF-THEN GOTOs can result in "spaghetti code", a programmer can write structured programs using only these instructions; on the other hand "it is also possible, and not too hard, to write badly structured programs in a structured language". Tausworthe augments the three Böhm-Jacopini canonical structures: SEQUENCE, IF-THEN-ELSE, and WHILE-DO, with two more: DO-WHILE and CASE. An additional benefit of a structured program is that it lends itself to proofs of correctness using mathematical induction.
|
wikipedia
|
wiki_2790_chunk_10
|
Binary Golay code
|
There are 4 other code words of similar structure that complete the basis of 12 code words for this representation of W. W has a subspace of dimension 4, symmetric under PSL(2,7) x S3, spanned by N and 3 dodecads formed of subsets {0,3,5,6}, {0,1,4,6}, and {0,1,2,5}. Practical applications of Golay codes
|
wikipedia
|
wiki_21132_chunk_31
|
Quantum nonlocality
|
For small fixed dimensions , one can explore, using variational methods, whether can be realized in a bipartite quantum system , with , . That method, however, can just be used to prove the realizability of , and not its unrealizability with quantum systems. To prove unrealizability, the most known method is the Navascués-Pironio-Acín (NPA) hierarchy. This is an infinite decreasing sequence of sets of correlations with the properties:
|
wikipedia
|
wiki_9385_chunk_9
|
Regularization (physics)
|
Conceptual problem
Perturbative predictions by quantum field theory about quantum scattering of elementary particles, implied by a corresponding Lagrangian density, are computed using the Feynman rules, a regularization method to circumvent ultraviolet divergences so as to obtain finite results for Feynman diagrams containing loops, and a renormalization scheme. Regularization method results in regularized n-point Green's functions (propagators), and a suitable limiting procedure (a renormalization scheme) then leads to perturbative S-matrix elements. These are independent of the particular regularization method used, and enable one to model perturbatively the measurable physical processes (cross sections, probability amplitudes, decay widths and lifetimes of excited states). However, so far no known regularized n-point Green's functions can be regarded as being based on a physically realistic theory of quantum-scattering since the derivation of each disregards some of the basic tenets of conventional physics (e.g., by not being Lorentz-invariant, by introducing either unphysical particles with a negative metric or wrong statistics, or discrete space-time, or lowering the dimensionality of space-time, or some combination thereof). So the available regularization methods are understood as formalistic technical devices, devoid of any direct physical meaning. In addition, there are qualms about renormalization. For a history and comments on this more than half-a-century old open conceptual problem, see e.g.
|
wikipedia
|
wiki_28628_chunk_1
|
Fürer's algorithm
|
Background
The Schönhage–Strassen algorithm uses the fast Fourier transform (FFT) to compute integer products in time and its authors, Arnold Schönhage and Volker Strassen, conjecture a lower bound of Fürer's algorithm reduces the gap between these two bounds. It can be used to multiply integers of length in time where is the iterated logarithm. The difference between the and terms, from a complexity point of view, is asymptotically in the advantage of Fürer's algorithm for integers greater than . However the difference between these terms for realistic values of is very small.
|
wikipedia
|
wiki_4010_chunk_21
|
Dc (computer program)
|
As an example, here is an implementation of the Euclidean algorithm to find the GCD: dc -e '??[dSarLa%d0<a]dsax+p' # shortest
dc -e '[a=]P?[b=]P?[dSarLa%d0<a]dsax+[GCD:]Pp' # easier-to-read version Factorial Computing the factorial of an input value, dc -e '?[q]sQ[d1=Qd1-lFx*]dsFxp' Quines in dc
|
wikipedia
|
wiki_414_chunk_25
|
Nuclear power
|
Light water reactors make relatively inefficient use of nuclear fuel, mostly using only the very rare uranium-235 isotope. Nuclear reprocessing can make this waste reusable, and newer reactors also achieve a more efficient use of the available resources than older ones. With a pure fast reactor fuel cycle with a burn up of all the uranium and actinides (which presently make up the most hazardous substances in nuclear waste), there is an estimated 160,000 years worth of uranium in total conventional resources and phosphate ore at the price of 60–100 US$/kg. However, reprocessing is expensive, possibly dangerous and can be used to manufacture nuclear weapons. One analysis found that for uranium prices could increase by two orders of magnitudes between 2035 and 2100 and that there could be a shortage near the end of the century. A 2017 study by researchers from MIT and WHOI found that "at the current consumption rate, global conventional reserves of terrestrial uranium (approximately 7.6 million tonnes) could be depleted in a little over a century". Limited uranium-235 supply may inhibit substantial expansion with the current nuclear technology. While various ways to reduce dependence on such resources are being explored, new nuclear technologies are considered to not be available in time for climate change mitigation purposes or competition with alternatives of renewables in addition to being more expensive and require costly research and development. A study found it to be uncertain whether identified resources will be developed quickly enough to provide uninterrupted fuel supply to expanded nuclear facilities and various forms of mining may be challenged by ecological barriers, costs, and land requirements. Researchers also report considerable import dependence of nuclear energy.
|
wikipedia
|
wiki_26104_chunk_4
|
Species Survival Network
|
Information is collected
A science-based management system is in place
The Precautionary Principle is applied
Government policies, laws and institutions are in place
People living in the vicinity of the used population are empowered and experience benefits
Economic sustainability is demonstrated
Long-term conservation benefits are demonstrated
The use is compatible with other uses of the species and is not detrimental to other species
Animals are protected from cruelty and suffering, and incidental mortality is avoided For more detail on the individual criteria, please see the link below on SSN's Criteria for Assessing the Sustainability of Trade in Wild Fauna and Flora See also
Wildlife smuggling References External links
Species Survival Network
CITES
|
wikipedia
|
wiki_17916_chunk_4
|
List of programs previously broadcast by GMA Network
|
American
21 Jump Street
77 Sunset Strip
240-Robert
The A-Team
Aaron's Way
Alien Nation
The All New Mission Impossible
Batman
Beauty and the Beast
Ben Casey
Benji, Zax & the Alien Prince
Bourbon Street Beat
Broken Arrow
Bronco
Buck James
Cade's County
Cagney & Lacey
Chase
Charlie's Angels
Chicago Story
China Beach
CHiPS
Cimarron City
The Colbys
Colt .45
Combat!
Coronado 9
Crossbow
Daktari
Dallas
Daniel Boone
Days of Our Lives
Dear Detective
Desilu Playhouse
Dog and Cat
Dynasty
Eerie, Indiana
Eight Is Enough
Eischied
Emerald Point N.A.S.
The Equalizer
Falcon Crest
The Fall Guy
Fantasy Island
The Far Pavilions
Finder of Lost Loves
Flying High
Fortune Dane
Frank's Place
Fury
Gabriel's Fire
Glitter
The Greatest American Hero
Gunslinger
Gunsmoke
The Halls of Ivy
Hell Town
High Mountain Rangers
Highway Patrol
Highway to Heaven
Hill Street Blues
Hooperman
Hotel
Houston Knights
I-Spy
In the Heat of the Night
The Islanders
J.J. Starbuck
Jake and the Fatman
Jenny's War
King's Crossing
Knight Rider
Knots Landing
Lady Blue
Lancer
Lassie
Last Days of Patton
Law & Order
Leg Work
The Life and Legend of Wyatt Earp
Little House: A New Beginning
Little House on the Prairie
The Lone Ranger
Lost in Space
Lou Grant
The Love Boat
MacGruder and Loud
The Magical World of Disney
Magnum, P.I.
Man from Atlantis
The Man from U.N.C.L.E.
Matlock
Maverick
Maya
Miami Vice
Misfits of Science
Mission: Impossible
Mousercise
Mr. Horn
Mr. Lucky
Murder, She Wrote
The New Lassie
Ohara
The Oldest Rookie
Our Family Honor
Our House
Outlaws
Overland Trail
P.S. I Luv U
Palace Guard
Paris
The Persuaders
Planet of the Apes
Quincy, M.E.
Rage of Angels
Remington Steele
Renegade
The Restless Gun
The Rifleman
Riptide
The Rookies
Sable
Saints and Sinners
Santa Barbara
Scarecrow and Mrs. King
The Shannara Chronicles
Sidekicks
Silk Stalkings
Something Is Out There
Sonny Spoon
Spenser: For Hire
Spies
St. Elsewhere
Star Trek: The Original Series
Starsky and Hutch
Stingray
Street Hawk
Sugarfoot
Surfside 6
Sweet Valley High
Tales of the Gold Monkey
Tequila and Bonetti
The Texan
T. J. Hooker
Tour of Duty
Trapper John, M.D.
True Blue
Tucker's Witch
Under Cover
The Untouchables
V: The Final Battle
Voyage to the Bottom of the Sea
Walker Texas Ranger
Wagon Train
Werewolf
Wiseguy
A Year in the Life
The Young Indiana Jones Chronicles
The Young Riders
|
wikipedia
|
wiki_39201_chunk_1
|
Cantor (software)
|
Cantor provides a consistent interface to these backends; its project page lists the following features:
Nice Worksheet view for evaluating expressions
View of plotting results inside the worksheet or in a separate window
Typesetting of mathematical formulas using LaTeX
Backend aware syntax highlighting
Plugin based assistant dialogs for common tasks (like integrating a function or entering a matrix) Cantor was the first KDE project to implement upload to the GetHotNewStuff addon service, which is used to download or upload example worksheets. It provided impetus for improvement of this feature for KDE SC 4.4. References
|
wikipedia
|
wiki_7736_chunk_15
|
Kansei engineering
|
Software tools
Kansei engineering has always been a statically and mathematically advanced methodology. Most types require good expert knowledge and a reasonable amount of experience to carry out the studies sufficiently. This has also been the major obstacle for a widespread application of Kansei engineering.
In order to facilitate application some software packages have been developed in the recent years, most of them in Japan. There are two different types of software packages available: User consoles and data collection and analysis tools. User consoles are software programs that calculate and propose a product design based on the users' subjective preferences (Kanseis). However, such software requires a database that quantifies the connections between Kanseis and the combination of product attributes. For building such databases, data collection and analysis tools can be used. This part of the paper demonstrates some of the tools. There are many more tools used in companies and universities, which might not be available to the public.
User consoles
|
wikipedia
|
wiki_2651_chunk_3
|
Office for National Statistics
|
Purpose and scope
ONS produces and publishes a wide range of the information about the United Kingdom that can be used for social and economic policy-making as well as painting a portrait of the country as its population evolves over time. This is often produced in ways that make comparison with other societies and economies possible. Much of the data on which policy-makers depend is produced by ONS through a combination of a decennial population census, samples and surveys and analysis of data generated by businesses and organisations such as the National Health Service and the register of births, marriages and deaths. Its publications, and analyses by other users based on its published data, are reported and discussed daily in the media as the basis for the public understanding of the country in which they live.
|
wikipedia
|
wiki_4325_chunk_1
|
List of amateur mathematicians
|
Ahmes (scribe)
Ashutosh Mukherjee (Lawyer)
Robert Ammann (programmer and postal worker)
John Arbuthnot (surgeon and author)
Jean-Robert Argand (shopkeeper)
Leon Bankoff (Beverly Hills dentist)
Rev. Thomas Bayes (Presbyterian minister)
Andrew Beal (businessman)
Isaac Beeckman (candlemaker)
Chester Ittner Bliss (biologist)
Napoléon Bonaparte (general)
Mary Everest Boole (homemaker, librarian)
William Bourne (innkeeper)
Nathaniel Bowditch (indentured bookkeeper)
Achille Brocot (clockmaker)
Jost Bürgi (clockmaker)
Marvin Ray Burns (veteran)
Gerolamo Cardano (medical doctor)
D. G. Champernowne (college student)
Thomas Clausen (technical assistant)
Sir James Cockle (judge)
Federico Commandino (medical doctor)
Herb Conn (rock climber)
William Crabtree (merchant)
Nathan Daboll (cooper)
Felix Delastelle (bonded warehouseman)
Martin Demaine (goldsmith and glass artist)
Humphry Ditton (minister)
Harvey Dubner (engineer)
Henry Dudeney (civil servant)
Albrecht Dürer (painter)
M. C. Escher (graphic artist)
John Ernest (painter)
Pasquale Joseph Federico (patent attorney)
Pierre de Fermat (lawyer)
Sarah Flannery (high school student)
Reo Fortune (anthropologist)
John G.F. Francis (research assistant)
Benjamin Franklin (printer and diplomat)
Bernard Frenicle de Bessy
Gemma Frisius (medical doctor)
Britney Gallivan (high school student)
James Garfield (United States President)
Antoine Gombaud (essayist)
Thorold Gosset (lawyer)
Jørgen Pedersen Gram (actuary)
Hermann Grassmann (school teacher)
John Graunt (haberdasher)
George Green (miller)
Aubrey de Grey (gerontologist)
André-Michel Guerry (lawyer)
Charles James Hargreave (judge)
Oliver Heaviside (telegraph operator)
Kurt Heegner (private scholar)
John R. Hendricks (meteorologist)
Anthony Hill (painter)
Paul Jaccard (botanist)
Alfred Bray Kempe (lawyer)
Thomas Kirkman (church rector)
Laurence Monroe Klauber (herpetologist)
Hedy Lamarr (actress)
Harry Lindgren (civil servant)
Ada Lovelace (countess)
Lu Jiaxi (high school physics teacher)
Kenneth McIntyre (lawyer)
Danica McKellar (actress)
Anderson Gray McKendrick (medical doctor)
Marin Mersenne (theologian)
Florence Nightingale (nurse and statistician)
George Phillips Odom Jr. (artist)
B. Nicolò I. Paganini (schoolboy)
Pāṇini (linguist)
Blaise Pascal (heir, private scholar)
Padmakumar (technician)
Henry Perigal (stockbroker)
Kenneth Perko (lawyer)
Ivan Pervushin (priest)
Piero della Francesca (painter)
Pingala (musician)
William Playfair (draftsman)
Henry Cabourn Pocklington (schoolmaster)
François Proth (farmer)
Ramchundra (head master)
Marjorie Rice (homemaker)
Olinde Rodrigues (banker, social reformer)
Lee Sallows (engineer)
Robert Schlaifer (classics scholar)
Robert Schneider (musician and record producer)
William Shanks (landlord)
Abraham Sharp (schoolmaster)
Simon Stevin (merchants clerk)
Alicia Boole Stott (secretary)
Paul Tannery (tobacco factory director)
Gaston Tarry (civil servant)
Niccolò Fontana Tartaglia (bookkeeper)
Nikola Tesla (engineer, inventor)
Sébastien Truchet (monk)
Franciscus Vieta (lawyer)
Giordano Vitale (soldier)
Walter Frank Raphael Weldon (evolutionary biologist)
Johannes Werner (parish priest)
Caspar Wessel (lawyer)
Leo Wiener (linguist)
Frank Wilcoxon (chemist)
Edouard Zeckendorf (medical doctor)
|
wikipedia
|
wiki_4063_chunk_48
|
Generator (computer programming)
|
The Golden ratio generator below returns to each invocation 'goldenRatio next' a better approximation to the Golden Ratio. goldenRatio := Generator on: [ :g | | x y z r |
x := 0.
y := 1.
[
z := x + y.
r := (z / y) asFloat.
x := y.
y := z.
g yield: r
] repeat
]. goldenRatio next. The expression below returns the next 10 approximations. Character cr join: ((1 to: 10) collect: [ :dummy | ratio next ]).
|
wikipedia
|
wiki_25833_chunk_22
|
The Wealth of Networks
|
Another criticism of Benkler's theory is that so much focus is given to the potential of peer-production and innovation in the networked information economy, but little to no attention spent addressing issues related to the physical hardware required to keep the network that Benkler's theories rely on up and running. In a review of the book by Siva Vaidhyanathan, Benkler's “soft technological determinism” is brought under fire. Vaidhyanathan states:
"This one issue remains underwritten in the text: the story of the technology itself. Throughout the text, there seems to be an almost givenness about the technology. TCP/IP is just there. Even Cisco’s notorious discriminating servers, the source of so much tension over the end of network neutrality, just appear…. We get a sense that particular technologies are malleable, adaptable, contingent, and socially shaped. We get no account of developer’s wishes or users’ adaptions. We only get cursory accounts of the conflicts over the future of these technologies that have unleashed (to choose a loaded term) so much creativity."
Benkler addressed this criticism in his response to Vaidhyanathan's review, conceding that perhaps more attention to the physical elements of the networked information economy could have been given:
"His [Vaidhyanathan’s] complaint ... is that I wrote a book about how the dynamics of technology, society, economy, and law intersect to fundamentally alter how information, knowledge, and culture are produced, rather than a book about the dynamics of how the technology component itself got to be as it is, and how it may or may not change given present pressures ... not every book can be about everything. Perhaps Vaidhyanathan is correct that a book that offers as broad a canvass as this on the networked information environment needs a chapter on the technology itself: where it originates and what are the dynamics and pressures, historically and today, that led to its past and that affect its future."
In a review of the book by Ben Peters, a similar sentiment to Vaidhyanathan's criticism is expressed: “It may also do very well to account for massive information infrastructure costs, the fiber optic cables, the wifi, and the laptops that the Benkler's optimism depends upon in the international development scene.” In The Independent Review: A Journal of Political Economy, Peter G. Klein stated:
"Although information itself cannot be “owned,” the tangible media in which information is embedded and transmitted are scarce economic goods. Information may yearn to be “free,” but cables, switches, routers, disk drives, microprocessors, and the like yearn to be owned. Such innovations do not spring from nowhere; they are the creations of profit-seeking entrepreneurs that consumers or other entrepreneurs purchase to use as they see fit."
|
wikipedia
|
wiki_7899_chunk_35
|
Fossil fuel power station
|
Radioactive trace elements
Coal is a sedimentary rock formed primarily from accumulated plant matter, and it includes many inorganic minerals and elements which were deposited along with organic material during its formation. As the rest of the Earth's crust, coal also contains low levels of uranium, thorium, and other naturally occurring radioactive isotopes whose release into the environment leads to radioactive contamination. While these substances are present as very small trace impurities, enough coal is burned that significant amounts of these substances are released. A 1,000 MW coal-burning power plant could have an uncontrolled release of as much as 5.2 metric tons per year of uranium (containing of uranium-235) and 12.8 metric tons per year of thorium. In comparison, a 1,000 MW nuclear plant will generate about 30 metric tons of high-level radioactive solid packed waste per year. It is estimated that during 1982, US coal burning released 155 times as much uncontrolled radioactivity into the atmosphere as the Three Mile Island incident. The collective radioactivity resulting from all coal burning worldwide between 1937 and 2040 is estimated to be 2,700,000 curies or 0.101 EBq. During normal operation, the effective dose equivalent from coal plants is 100 times that from nuclear plants. Normal operation however, is a deceiving baseline for comparison: just the Chernobyl nuclear disaster released, in iodine-131 alone, an estimated 1.76 EBq. of radioactivity, a value one order of magnitude above this value for total emissions from all coal burned within a century, while the iodine-131, the major radioactive substance which comes out in accident situations, has a half life of just 8 days.
|
wikipedia
|
wiki_8168_chunk_17
|
Business process re-engineering
|
BPR literature identified several so called disruptive technologies that were supposed to challenge traditional wisdom about how work should be performed.
Shared databases, making information available at many places
Expert systems, allowing generalists to perform specialist tasks
Telecommunication networks, allowing organizations to be centralized and decentralized at the same time
Decision-support tools, allowing decision-making to be a part of everybody's job
Wireless data communication and portable computers, allowing field personnel to work office independent
Interactive videodisk, to get in immediate contact with potential buyers
Automatic identification and tracking, allowing things to tell where they are, instead of requiring to be found
High performance computing, allowing on-the-fly planning and revisioning
|
wikipedia
|
wiki_918_chunk_22
|
MathML
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>Example of MathML embedded in an XHTML file</title>
<meta name="description" content="Example of MathML embedded in an XHTML file"/>
</head>
<body>
<h1>Example of MathML embedded in an XHTML file</h1>
<p>
The area of a circle is
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>π<!-- π --></mi>
<mo><!-- ⁢ --></mo>
<msup>
<mi>r</mi>
<mn>2</mn>
</msup>
</math>.
</p>
</body>
</html>
|
wikipedia
|
wiki_23194_chunk_26
|
Map database management
|
European consortium ActMAP
A European consortium called ActMAP (Actualize Map) is (in their words) "developing standardised mechanisms to update existing map database content and enable dynamic attachment of information to the digital in-vehicle map". The ActMAP consortium comprises ERTICO (coordinator), BMW, CRF Fiat Research Centre, DaimlerChrysler, Navigon, Navteq, Tele Atlas, and Siemens VDO Automotive. They have finished most of their work and published a number of reports, which were submitted to the ISO committee TC204 WG3 for standardization. Their reports serve as a good starting point and reference for the work of this project. An important issue their reports address is dealing with the complexity of multiple map suppliers, using proprietary formats, coupled with multiple data suppliers and multiple versions of in-vehicles maps. They resolve this by using an open intermediate map format expressed with XML and based on the concepts of the ISO standard GDF 4.0. All modifications to a supplier's database are first converted to this intermediate format, stored on a server and then converted to each format used within individual vehicles. They assume that each car has a "baseline" map from a map supplier and that this baseline defines reference identifiers (e.g. map segment ID) for most features to be updated. For features with no reference identifier in the baseline, they propose using a "generic" reference that is discovered heuristically using map matching as described by a proposed standard called AGORA
|
wikipedia
|
wiki_4543_chunk_5
|
Mathematical and theoretical biology
|
Interest in the field has grown rapidly from the 1960s onwards. Some reasons for this include:
The rapid growth of data-rich information sets, due to the genomics revolution, which are difficult to understand without the use of analytical tools
Recent development of mathematical tools such as chaos theory to help understand complex, non-linear mechanisms in biology
An increase in computing power, which facilitates calculations and simulations not previously possible
An increasing interest in in silico experimentation due to ethical considerations, risk, unreliability and other complications involved in human and animal research
|
wikipedia
|
wiki_24036_chunk_3
|
Concatenated error correction code
|
In his doctoral thesis, Dave Forney showed that concatenated codes could be used to achieve exponentially decreasing error probabilities at all data rates less than capacity, with decoding complexity that increases only polynomially with the code block length. Description Let Cin be a [n, k, d] code, that is, a block code of length n, dimension k, minimum Hamming distance d, and rate r = k/n, over an alphabet A: Let Cout be a [N, K, D] code over an alphabet B with |B| = |A|k symbols:
|
wikipedia
|
wiki_342_chunk_3
|
Lint (software)
|
Overview
The analysis performed by lint-like tools can also be performed by an optimizing compiler, which aims to generate faster code. In his original 1978 paper, Johnson addressed this issue, concluding that "the general notion of having two programs is a good one" because they concentrated on different things, thereby allowing the programmer to "concentrate at one stage of the programming process solely on the algorithms, data structures, and correctness of the program, and then later retrofit, with the aid of lint, the desirable properties of universality and portability".
|
wikipedia
|
wiki_6605_chunk_6
|
2004–05 United States network television schedule
|
Friday
{| class="wikitable" style="width:100%;margin-right:0;text-align:center"
|-
! colspan="2" style="background-color:#C0C0C0;text-align:center"|Network
! style="background-color:#C0C0C0;text-align:center"|8:00 PM
! style="background-color:#C0C0C0;text-align:center"|8:30 PM
! style="background-color:#C0C0C0;text-align:center"|9:00 PM
! style="background-color:#C0C0C0;text-align:center"|9:30 PM
! style="background-color:#C0C0C0;text-align:center"|10:00 PM
! style="background-color:#C0C0C0;text-align:center"|10:30 PM
|-
! rowspan="4"|ABC
! Fall
| rowspan="2"|8 Simple Rules
| Complete Savages
| rowspan="4"|Hope & Faith
| rowspan="4"|Less than Perfect
| colspan="2" rowspan="4"|20/20
|-
! Winter
| 8 Simple Rules
|-
! Spring
| colspan="2"|America's Funniest Home Videos
|-
! Summer
| 8 Simple Rules
| Hope & Faith
|-
! rowspan="5"|CBS
! Fall
| colspan="2" rowspan="3"|Joan of Arcadia
| colspan="2" rowspan="4"|JAG
| colspan="2"|Dr. Vegas
|-
! Follow Up
| colspan="2"|CSI: Miami
|-
! Winter
| colspan="2" rowspan="3"|Numb3rs
|-
! Summer
| colspan="2"|JAG
|-
! Mid-Summer
| colspan="2"|60 Minutes II
| colspan="2"|The Cut
|-
! rowspan="8"|Fox
! Fall
| colspan="2"|The Complex: Malibu
| colspan="2"|The Next Great Champ
| rowspan="8" style="background-color:#abbfff" colspan="2"|Local Programming
|-
! Follow Up
| The Simpsons
| That '70s Show
| colspan="2"|The Complex: Malibu
|-
! Late Fall
| Malcolm In the Middle
| Malcolm In the Middle
| colspan="2"|Renovate My Family
|-
! December
| colspan="4"|Fox Friday night Movie
|-
! Winter
| rowspan="2"|The Bernie Mac Show
| The Bernie Mac Show
| colspan="2"|Jonny Zero
|-
! Spring
| Malcolm in the Middle
| colspan="2"|Nanny 911
|-
! Follow Up
| colspan="4"|Fox Friday Night Movie
|-
! Late Summer
|The Bernie Mac Show
|Arrested Development
|Malcolm in the Middle
|Arrested Development
|-
! rowspan="5"|NBC
! Fall
| colspan="2" rowspan="3"|Dateline NBC
| colspan="2"|Third Watch
| colspan="2"|Medical Investigation
|-
! Spring
| colspan="2"|Medical Investigation
| colspan="2" rowspan="3"|Law & Order: Trial by Jury
|-
! Mid-Spring
| colspan="2"|Third Watch
|-
! Summer
| colspan="4" rowspan="2"|Dateline NBC
|-
! Late Summer
| colspan="2"|Crossing Jordan
|-
! rowspan="4"|UPN
! Fall
| colspan="2" rowspan="3"|Star Trek: Enterprise
| colspan="2"|America's Next Top Model
| rowspan="11" style="background-color:#abbfff" colspan="2"|Local Programming
|-
! Winter
| colspan="2"|The Road to Stardom with Missy Elliott
|-
! Spring
| colspan="2"|America's Next Top Model
|-
! Summer
| colspan="4"|UPN's Night at the Movies
|-
! rowspan="7"|The WB
! Fall
| rowspan="7"|What I Like About You
| rowspan="3"|Grounded for Life
| rowspan="7"|Reba
| Ace
|-
! Follow Up
| Reba
|-
! Late Fall
| rowspan="2"|Blue Collar TV|-
! Winter
| Blue Collar TV
|-
! Spring
| Reba
|rowspan="3"|Living With Fran
|-
! Summer
| What I Like About You
|-
! Mid-Summer
| Blue Collar TV
|-
|}
NOTES: On Fox, The Jury was supposed to have remained on Fridays, and that The Next Great Champ was supposed to have started the night at 8–9, but due to low ratings of The Jury, it was cancelled, and The Complex: Malibu was signed on at the last minute, and at midseason, The Inside would've started the night at 8–9, followed by Jonny Zero. On The WB, Commando Nanny would've been aired at 9:30-10, but it was cancelled due to production difficulties.
|
wikipedia
|
wiki_6856_chunk_8
|
List of minerals recognized by the International Mineralogical Association
|
Abbreviations:
"*" – discredited (IMA/CNMNC status).
"s.p." – special procedure.
Q or "?" – questionable/doubtful (IMA/CNMNC, mindat.org or mineralienatlas.de status).
N – published without approval of the IMA/CNMNC, or just not an IMA approved mineral but with some acceptance in the scientific community nowadays. The 'IMA database of mineral properties' (rruff.info/ima) has 173 species with 'not an IMA approved mineral' tag, some are an intermediate member of a solid solution series, others are "recently" discredited minerals.
I – intermediate member of a solid-solution series.
H – hypothetical mineral (synthetic, anthropogenic, etc.)
ch – incomplete description, hypothetical solid solution end member. Published without approval and formally discredited or not approved, yet.
Mainly: pyrochlore, tourmaline and amphibole supergroups, arrojadite, and yftisite-(Y). IMA/CNMNC revisions generate hypothetical solid solution endmembers.
group – a name used to designate a group of species, sometimes only a mineral group name.
|
wikipedia
|
wiki_1573_chunk_11
|
Cycle (graph theory)
|
Programming
The following example in the Programming language C# shows one implementation of an undirected graph using Adjacency lists. The undirected graph is declared as class UndirectedGraph. Executing the program uses the Main method, which - if one exists - prints the shortest, non-trivial cycle to the console.using System;
using System.Collections.Generic; // Declares the class for the vertices of the graph
class Node
{
public int index;
public string value;
public HashSet<Node> adjacentNodes = new HashSet<Node>(); // Set of neighbour vertices
}
|
wikipedia
|
wiki_30110_chunk_8
|
GEORGE (operating system)
|
JOB PLAN4JOB,30174,BRIAN
The job first loads the program #XPLT from a disk file named PROGRAM COMP (XPLT is the assembler). The document SOURCE is used as input to #XPLT on a virtual card reader CR0.
IN ED(PROGRAM COMP)
LOAD #XPLT
IN CR0(SOURCE)
ENTER 1
If #XPLT finishes with the message HALT OK then the job continues at label 1A, otherwise the job displays COMPILATION ERRORS and jumps to 5END.
AT HALTED OK,GO TO 1A
DISPLAY 'COMPILATION ERRORS'
GO TO 5END
At label 1A the program #XPCK is loaded and run with an in-line document available on its virtual card reader. (XPCK is the linker, or "consolidator" in ICL terminology). (The in-line document is the text between the line IN CR0/JD and the terminator ???*).
1A IN ED(PROGRAM COMP)
LOAD #XPCK
IN CR0/JD
*IN ED(SEMICOMPILED)
*OUT ED(PROGRAM TEST)
*LIST
???*
ENTER 1
AT DELETED HH,GO TO 2A
DISPLAY 'CONSOLIDATION ERRORS'
GO TO 5END
If #XPCK finishes without error then the program #HWLD is run.
2A IN ED(PROGRAM TEST)
LOAD #HWLD
ENTER 0
5END END
****
After the job a source document is read in, this will be used as input to the job.
DOC SOURCE
PROG(HWLD)
STEER(LIST,OBJECT)
OUTE(SEMICOMPILED(0))
WSF(HWLD)
PLAN(CR)
#PRO HWLD40/TEST
#LOW
MESS 12HHELLO WORLD
#PRO
#ENT 0
DISTY '11/MESS'
DEL 2HOK
#END
ENDPROG
****
Finally the end of batch is signaled. At this point all the jobs in the batch will be run in order.
All output from the batch will be printed on the system printer.
END BATCH
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.