id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_13920_chunk_7
|
Memetic algorithm
|
2nd generation
Multi-meme, hyper-heuristic and meta-Lamarckian MA are referred to as second generation MA exhibiting the principles of memetic transmission and selection in their design. In Multi-meme MA, the memetic material is encoded as part of the genotype. Subsequently, the decoded meme of each respective individual/chromosome is then used to perform a local refinement. The memetic material is then transmitted through a simple inheritance mechanism from parent to offspring(s). On the other hand, in hyper-heuristic and meta-Lamarckian MA, the pool
of candidate memes considered will compete, based on their past merits in generating local improvements through a reward mechanism, deciding on which meme to be selected to proceed for future local refinements. Memes with a higher reward have a greater chance of being replicated or copied. For a review on second generation MA; i.e., MA considering multiple individual learning methods within
an evolutionary system, the reader is referred to.
|
wikipedia
|
wiki_5776_chunk_1
|
The Shiva Option
|
Plot summary
The Grand Alliance of Terrans, Orions, Gorm and Ophiuchi has suffered a catastrophic defeat at the hands of the Bugs during the Pesthouse Campaign. Many senior military commanders have been lost, along with the bulk of the Terran Federation pre-war fleet. The Bugs appear unstoppable and fight their way toward Federation space, reaching the key system of Alpha Centauri before they are narrowly repulsed. Now, with the war once more at a stalemate, the Grand Alliance must try to recover their losses and break the deadlock.
|
wikipedia
|
wiki_6197_chunk_6
|
Human behaviour genetics
|
Recent trends in behavioural genetics have indicated an additional focus toward researching the inheritance of human characteristics typically studied in developmental psychology. For instance, a major focus in developmental psychology has been to characterize the influence of parenting styles on children. However, in most studies, genes are a confounding variable. Because children share half of their alleles with each parent, any observed effects of parenting styles could be effects of having many of the same alleles as a parent (e.g. harsh aggressive parenting styles have been found to correlate with similar aggressive child characteristics: is it the parenting or the genes?). Thus, behaviour genetics research is currently undertaking to distinguish the effects of the family environment from the effects of genes. This branch of behaviour genetics research is becoming more closely associated with mainstream developmental psychology and the sub-field of developmental psychopathology as it shifts its focus to the heritability of such factors as emotional self-control, attachment, social functioning, aggressiveness, etc.
|
wikipedia
|
wiki_34182_chunk_1
|
NATO Science, Technology and Research Network
|
Introduction
The vast and rapidly growing amount of scientific and technical data and information concerning the diffusion of technology and innovation has increased pressure on organizations to push forward with their own technological developments and to take steps to maximize their inclusion into the research and development (R&D) process. This massive collection of data is vital to scientists, engineers, program managers, policy analysts, resource managers, and others. Access and communication to this information are central to the success of the innovation process in general and the management of R&D activities in particular.
|
wikipedia
|
wiki_38990_chunk_0
|
Cybernetical physics
|
Cybernetical physics is a scientific area on the border of cybernetics and physics which studies physical systems with cybernetical methods. Cybernetical methods are understood as methods developed within control theory, information theory, systems theory and related areas: control design, estimation, identification, optimization, pattern recognition, signal processing, image processing, etc. Physical systems are also understood in a broad sense; they may be either lifeless, living nature or of artificial (engineering) origin, and must have reasonably understood dynamics and models suitable for posing cybernetical problems. Research objectives in cybernetical physics are frequently formulated as analyses of a class of possible system state changes under external (controlling) actions of a certain class. An auxiliary goal is designing the controlling actions required to achieve a prespecified property change. Among typical control action classes are functions which are constant in time (bifurcation analysis, optimization), functions which depend only on time (vibration mechanics, spectroscopic studies, program control), and functions whose value depends on measurement made at the same time or on previous instances. The last class is of special interest since these functions correspond to system analysis by means of external feedback (feedback control).
|
wikipedia
|
wiki_7827_chunk_2
|
Pugs (programming)
|
Version numbering
The major/minor version numbers of Pugs converges to 2π (being reminiscent of TeX and METAFONT, which use a similar scheme); each significant digit in the minor version represents a successfully completed milestone. The third digit is incremented for each release. The current milestones are:
6.0: Initial release.
6.2: Basic IO and control flow elements; mutable variables; assignment.
6.28: Classes and traits.
6.283: Rules and Grammars.
6.2831: Type system and linking.
6.28318: Macros.
6.283185: Port Pugs to Perl 6, if needed.
|
wikipedia
|
wiki_10349_chunk_1
|
Bootstrapping (compilers)
|
Many compilers for many programming languages are bootstrapped, including compilers for BASIC, ALGOL, C, C#, D, Pascal, PL/I, Factor, Haskell, Modula-2, Oberon, OCaml, Common Lisp, Scheme, Go, Java, Elixir, Rust, Python, Scala, Nim, Eiffel, Vala, and more.
|
wikipedia
|
wiki_9255_chunk_2
|
Ease (programming language)
|
creates n synchronized processes each with a local constant i. Processes cannot share local variables and cooperate in the construction of shared contexts. Certain context types, called resources, ensure call-reply semantics. There are four functions upon contexts: – copies a value from the shared context to the variable.
– copies the value of expression to the shared context.
– moves the value bound to name to the shared context. The value of name is subsequently undefined.
– moves a value from context and binds it to name. The value is removed from the context. Context types are Singletons, Bags or Streams and can be subscripted arrays.
|
wikipedia
|
wiki_34034_chunk_8
|
Max Planck Institute for Biology of Ageing
|
Cologne Graduate School of Ageing Research
The Cologne Graduate School of Ageing Research was established in 2013 as a joint venture of the Graduate School of the Cellular Stress Responses in Aging-Associated Diseases (CECAD Graduate School) and the International Max Planck Research School for Ageing (IMPRS AGE). Associated institutes are the Cluster of Excellence - Cellular Stress Responses in Aging-Associated Diseases (CECAD), the Max Planck Institute for Biology of Ageing, the Max Planck Institute for Metabolism Research, the University of Cologne and the University Hospital of Cologne. The Graduate School offers exceptionally talented junior research scientists from all over the world the opportunity to obtain their doctorate in the field of ageing research within a three-year structured programme. Application requires a M.Sc. degree (or equivalent) and is possible from September 2022 for the upcoming application period. The structured graduate programme annually starts between July and October. The doctoral degrees are awarded by the University of Cologne.
Since 2019 the Cologne Graduate School of Ageing Research offers a Master Fellowship programme for excellent and motivated students that wish to learn more about ageing research, while pursuing the Master studies in the Biological Science or Biochemistry Master programme of the University of Cologne.
|
wikipedia
|
wiki_27978_chunk_1
|
Fractal in soil mechanics
|
The fractal approach to soil mechanics is a new line of thought. It was first raised in "Fractal Character Of Grain-Size Distribution Of Expansion Soils" by Yongfu Xu and Songyu Liu, published in 1999, by Fractals. There are several problems in soil mechanics which can be dealt by applying a fractal approach. One of these problems is the determination of soil-water-characteristic curve (also called (water retention curve) and/or capillary pressure curve). It is a time-consuming process considering usual laboratory experiments. Many scientists have been involved in making mathematical models of soil-water-characteristic curve (SWCC) in which constants are related to the fractal dimension of pore size distribution or particle size distribution of the soil. After the great mathematician Benoît Mandelbrot—father of fractal mathematics—showed the world fractals, Scientists of Agronomy, Agricultural engineering and Earth Scientists have developed more fractal-based models.
All of these models have been used to extract hydraulic properties of soils and the potential capabilities of fractal mathematics to investigate mechanical properties of soils. Therefore, it is really important to use such physically based models to promote our understanding of the mechanics of the soils. It can be of great help for researchers in the area of unsaturated soil mechanics. Mechanical parameters can also be driven from such models and of course it needs further works and researches.
|
wikipedia
|
wiki_14856_chunk_1
|
Proofs from THE BOOK
|
Content
Proofs from THE BOOK contains 32 sections (45 in the sixth edition), each devoted to one theorem but often containing multiple proofs and related results. It spans a broad range of mathematical fields: number theory, geometry, analysis, combinatorics and graph theory. Erdős himself made many suggestions for the book, but died before its publication. The book is illustrated by . It has gone through six editions in English, and has been translated into Persian, French, German, Hungarian, Italian, Japanese, Chinese, Polish, Portuguese, Korean, Turkish, Russian and Spanish.
|
wikipedia
|
wiki_38154_chunk_14
|
Database activity monitoring
|
Some enterprises are also seeking other functions, including:
Configuration auditing to comply with audits required by the U.S. Sarbanes-Oxley Act
DLP capabilities that address security concerns, as well as the data identification and protection requirements of the Payment Card Industry (PCI) and other data-centric regulatory frameworks
Database user rights attestation reporting, required by a broad range of regulations
The ability to offer database activity monitoring in virtualized environments, or even in the cloud, where there is no well-defined or consistent network topology
Better integration with vulnerability scanning products
|
wikipedia
|
wiki_10349_chunk_9
|
Bootstrapping (compilers)
|
Current efforts
Due to security concerns regarding the Trusting Trust Attack and various attacks against binary trustworthiness, multiple projects are working to reduce the effort for not only bootstrapping from source but also allowing everyone to verify that source and executable correspond. These include the Bootstrappable builds project and the Reproducible builds project. See also
Self-hosting
Self-interpreter
Indirect self-modification
Tombstone diagram
Metacompiler References Compilers
Compiler construction
Compiler theory
|
wikipedia
|
wiki_15965_chunk_0
|
List of MeSH codes (N02)
|
The following is a partial list of the "N" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (N01). Codes following these are found at List of MeSH codes (N03). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – health care facilities, manpower, and services
|
wikipedia
|
wiki_2345_chunk_13
|
Prism (geometry)
|
Prismatic polytope
A prismatic polytope is a higher-dimensional generalization of a prism. An n-dimensional prismatic polytope is constructed from two ()-dimensional polytopes, translated into the next dimension. The prismatic n-polytope elements are doubled from the ()-polytope elements and then creating new elements from the next lower element. Take an n-polytope with fi i-face elements (). Its ()-polytope prism will have i-face elements. (With , .)
|
wikipedia
|
wiki_4743_chunk_13
|
List of important publications in statistics
|
Applied statistics
Statistical Methods for Research Workers
Author: R.A. Fisher
Publication data: Edinburgh: Oliver & Boyd, 1925 (1st edition); London: Macmillan, 1970 (15th edition)
Online version: http://psychclassics.yorku.ca/Fisher/Methods/
Description: The original manual for researchers, especially biologists, on how to statistically evaluate numerical data.
Importance: Hugely influential text by the father of modern statistics that remained in print for more than 50 years. Responsible for the widespread use of tests of statistical significance.
|
wikipedia
|
wiki_7436_chunk_3
|
Spray (mathematics)
|
Let M be a differentiable manifold and (TM,πTM,M) its tangent bundle. Then a vector field H on TM (that is, a section of the double tangent bundle TTM) is a semispray on M, if any of the three following equivalent conditions holds:
(πTM)*Hξ = ξ.
JH=V, where J is the tangent structure on TM and V is the canonical vector field on TM\0.
j∘H=H, where j:TTM→TTM is the canonical flip and H is seen as a mapping TM→TTM.
A semispray H on M is a (full) spray if any of the following equivalent conditions hold:
Hλξ = λ*(λHξ), where λ*:TTM→TTM is the push-forward of the multiplication λ:TM→TM by a positive scalar λ>0.
The Lie-derivative of H along the canonical vector field V satisfies [V,H]=H.
The integral curves t→ΦHt(ξ)∈TM\0 of H satisfy ΦHt(λξ)=λΦHλt(ξ) for any λ>0.
|
wikipedia
|
wiki_14437_chunk_7
|
Comparison of application virtualization software
|
Shared libraries are a facility to reuse segments of native code across multiple running programs. In modern operating systems, this generally means using virtual memory to share the memory pages containing a shared library across different processes which are protected from each other via memory protection. It is interesting that aggressive JIT methods such as adaptive optimization often produce code fragments unsuitable for sharing across processes or successive runs of the program, requiring a tradeoff be made between the efficiencies of precompiled and shared code and the advantages of adaptively specialized code. For example, several design provisions of CIL are present to allow for efficient shared libraries, possibly at the cost of more specialized JIT code. The JVM implementation on OS X uses a Java Shared Archive to provide some of the benefits of shared libraries.
|
wikipedia
|
wiki_455_chunk_38
|
Python (programming language)
|
Other implementations
PyPy is a fast, compliant interpreter of Python 2.7 and 3.8. Its just-in-time compiler brings a significant speed improvement over CPython but some libraries written in C cannot be used with it.
Stackless Python is a significant fork of CPython that implements microthreads; it does not use the call stack in the same way, thus allowing massively concurrent programs. PyPy also has a stackless version.
MicroPython and CircuitPython are Python 3 variants optimized for microcontrollers, including Lego Mindstorms EV3.
Pyston is a variant of the Python runtime that uses just-in-time compilation to speed up the execution of Python programs.
Cinder is a performance-oriented fork of CPython 3.8 that contains a number of optimizations including bytecode inline caching, eager evaluation of coroutines, a method-at-a-time JIT and an experimental bytecode compiler.
|
wikipedia
|
wiki_11615_chunk_2
|
Mathematics of Sudoku
|
Similar results are known for variants and smaller grids. No exact results are known for Sudokus larger than the classical 9×9 grid, although there are estimates which are believed to be fairly accurate. Overview
The analysis of Sudoku falls into two main areas:
analyzing the properties of completed grids
analyzing the properties of completed puzzles.
Initial analysis was largely focused on enumerating solutions, with results first appearing in 2004.
|
wikipedia
|
wiki_36286_chunk_4
|
Jim Thomas (computer scientist)
|
Awards
1985: Science Digest's Top 100 Scientific Innovations
1986: R&D Magazines R&D 100 Award
1989: Federal Laboratory Consortium Award for Excellence in Technology Transfer
1996: R&D Magazine's R&D 100 Award
1998: Federal Laboratory Consortium Award for Excellence in Technology Transfer
2007: Fellow, American Association for the Advancement of Science
2009: Christopher Columbus Fellowship Foundation Homeland Security Award References American computer scientists
Fellows of the American Association for the Advancement of Science
2010 deaths
1946 births
|
wikipedia
|
wiki_7058_chunk_2
|
Johnson's algorithm
|
Algorithm description
Johnson's algorithm consists of the following steps:
First, a new node is added to the graph, connected by zero-weight edges to each of the other nodes.
Second, the Bellman–Ford algorithm is used, starting from the new vertex , to find for each vertex the minimum weight of a path from to . If this step detects a negative cycle, the algorithm is terminated.
Next the edges of the original graph are reweighted using the values computed by the Bellman–Ford algorithm: an edge from to , having length , is given the new length .
Finally, is removed, and Dijkstra's algorithm is used to find the shortest paths from each node to every other vertex in the reweighted graph. The distance in the original graph is then computed for each distance ( , ), by adding to the distance returned by Dijkstra's algorithm.
|
wikipedia
|
wiki_24120_chunk_7
|
Mathieu wavelet
|
The magnitude of the transfer function corresponds exactly to the modulus of an elliptic-sine: Examples of filter transfer function for a Mathieu MRA are shown in the figure 2. The value of a is adjusted to an eigenvalue in each case, leading to a periodic solution. Such solutions present a number of zeroes in the interval . The G and H filter coefficients of Mathieu MRA can be expressed in terms of the values of the Mathieu function as: There exist recurrence relations among the coefficients: for , m odd. It is straightforward to show that , . Normalising conditions are and .
|
wikipedia
|
wiki_862_chunk_37
|
Philosophiæ Naturalis Principia Mathematica
|
A fair-copy draft of Newton's planned second volume De motu corporum, Liber Secundus survives, its completion dated to about the summer of 1685. It covers the application of the results of Liber primus to the Earth, the Moon, the tides, the Solar System, and the universe; in this respect, it has much the same purpose as the final Book 3 of the Principia, but it is written much less formally and is more easily read.
|
wikipedia
|
wiki_35368_chunk_4
|
Linear-fractional programming
|
Properties and algorithms
The objective function in a linear-fractional problem is both quasiconcave and quasiconvex (hence quasilinear) with a monotone property, pseudoconvexity, which is a stronger property than quasiconvexity. A linear-fractional objective function is both pseudoconvex and pseudoconcave, hence pseudolinear. Since an LFP can be transformed to an LP, it can be solved using any LP solution method, such as the simplex algorithm (of George B. Dantzig), the criss-cross algorithm, or interior-point methods. Notes References
|
wikipedia
|
wiki_8194_chunk_2
|
Bond energy
|
The enthalpy of formation ΔHfº of a large number of atoms, free radicals, ions,
clusters and compounds is available from the websites of NIST,
NASA, CODATA, and IUPAC. Most authors prefer to use the
BDE values at 298.15 K.
|
wikipedia
|
wiki_21384_chunk_2
|
Secret Service code name
|
Presidents and their families
Woodrow Wilson
Edith Wilson – Grandma
Franklin D. Roosevelt
Eleanor Roosevelt – Rover
Harry S. Truman – General or Supervise
Bess Truman – Sunnyside
Dwight Eisenhower – Scorecard or Providence
Mamie Eisenhower – Springtime
David Eisenhower – Sahara
John F. Kennedy – Lancer
Jacqueline Kennedy – Lace
Caroline Kennedy – Lyric
John F. Kennedy, Jr. – Lark
Rose Kennedy – Coppertone
Ethel Kennedy – Sundance
Lyndon Johnson – Volunteer
Lady Bird Johnson – Victoria
Lynda Bird Johnson – Velvet
Luci Baines Johnson – Venus
Richard Nixon – Searchlight
Pat Nixon – Starlight
Patricia Nixon Cox – Sugarfoot
Edward F. Cox – Seminole
Julie Nixon Eisenhower – Sunbonnet
Gerald Ford – Passkey or Pass Key
Betty Ford – Pinafore
Susan Ford – Panda
Michael Ford – Professor
Jack Ford – Packman
Jimmy Carter – Lock Master or Deacon
Rosalynn Carter – Lotus Petal or Dancer
Amy Carter – Dynamo
Chip Carter – Diamond
Jack Carter – Derby
Jeff Carter – Deckhand
Ronald Reagan – Rawhide
Nancy Reagan – Rainbow
Maureen Reagan – Rhyme, Rosebud
Michael Reagan – Riddler
Patti Davis – Ribbon
Ron Reagan – Reliant
Doria Reagan – Radiant
George H. W. Bush – Timberwolf
Barbara Bush – Snowbank or Tranquility
Marvin Bush – Tuner
Neil Bush – Trapline
Jeb Bush – Tripper
Dorothy Bush – Tiller
Bill Clinton – Eagle
Hillary Clinton – Evergreen
Chelsea Clinton – Energy
George W. Bush – Tumbler, later Trailblazer
Laura Bush – Tempo
Barbara Bush – Turquoise
Jenna Bush – Twinkle
Barack Obama – Renegade
Michelle Obama – Renaissance
Malia Obama – Radiance
Sasha Obama – Rosebud
Marian Shields Robinson – Raindance
Donald Trump – Mogul
Melania Trump – Muse
Donald Trump Jr. – Mountaineer
Ivanka Trump – Marvel
Eric Trump – Marksman
Jared Kushner – Mechanic
Joe Biden – Celtic
Jill Biden – Capri
|
wikipedia
|
wiki_31914_chunk_3
|
List of programs broadcast by Knowledge Network
|
Animated series
16 Hudson (2018-present)
Abby Hatcher (2019–present)
Astroblast! (2014-present)
Belle and Sebastian (2018–present)
Big Words Small Stories (2021–present)
Bluey (2022–present)
Book Hungry Bears (2020–present)
Bread Barbershop (2022–present)
The Brilliant World of Tom Gates (2021–present)
Charlie and Lola (2005-2013, 2022-present)
Chiro and Friends (2022–present)
Creative Galaxy (2015–present)
Doggy Day School (2010–present)
Doozers (2014–present)
Dog Loves Books (September 6, 2021–present)
Dragon (2013–present)
Ernest & Celestine: The Collection (2019–present)
Floogals (April 3, 2016–present)
Genius Genie (April 2018–present)
Gigantosaurus (2020–present)
Gus the Itsy Bitsy Knight (September 6, 2021–present)
If You Give a Mouse a Cookie (2019–present)
Kate and Mim-Mim (September 1, 2014–present)
Kazoops! (2021–present)
Kid-E-Cats (September 2017–present)
Kit and Kate (April 2017–April 2018, 2019–present)
The Magic School Bus Rides Again (2020–present)
Making Stuff (2010–present)
Molang (April–July 2016, 2020–present)
Moominvalley (2021–present)
The New Adventures of Geronimo Stilton (July 2018–present)
Odo (2021-present)
The Ollie & Moon Show (2017–present)
PAW Patrol (September 7, 2013–present)
Pete the Cat (2022-present)
Pikwik Pack (2022–present)
Pinky Dinky Doo (2009-2013, 2017-December 2018, 2020–present)
Pocoyo (2021-present)
Ralph and the Dinosaurs (2020–present)
Rob the Robot (September 2010–present)
Ruff-Ruff, Tweet and Dave (2015–present)
The Stinky & Dirty Show (2019–present)
Shaun the Sheep (2012-present)
Tee and Mo (April 2018–2019, 2020–present)
Trulli Tales (April 2018–present)
Wolf Joe (2021–present)
Zak Jinks (2020-present)
|
wikipedia
|
wiki_11615_chunk_71
|
Mathematics of Sudoku
|
The following sequence demonstrates mapping a band configuration to a counting symmetry equivalence class. Begin with a valid band configuration (1). Build column triplets by ordering the column values within each column. This is not a valid Sudoku band, but does place the same constraints on the lower bands as the example (2). Construct an equivalence class ID from the B2, B3 column triplet values. Use column and box swaps to achieve the lowest lexicographical ID. The last figure shows the column and box ordering for the ID: 124 369 578 138 267 459. All Band1 permutations with this counting symmetry ID will have the same number of grid completions as the original example. An extension of this process can be used to build the largest possible band counting symmetry equivalence classes (3).
|
wikipedia
|
wiki_18766_chunk_18
|
International Mathematical Olympiad selection process
|
Germany
IMO team selection in Germany is based on the main national mathematical competitions: The Bundeswettbewerb Mathematik (BWM, the former west German olympiad), the Deutsche Mathematik-Olympiade (DeMO, the former east German olympiad), and Jugend forscht (a research competition). Students successful in any of these competitions (e. g. a prize in the second round of the BWM) write two 3-hour exams at their schools, and the 16 best scorers of these exams are invited to a training program consisting of five seminars, where lectures are given and seven team selection tests are written - 4-hour exams determining the actual IMO contestants (additional tests are possible if the team is not uniquely determined after the seven exams).
|
wikipedia
|
wiki_20887_chunk_17
|
Wind power forecasting
|
Physical approach to wind power forecasting
Meteorological forecasts are given at specific nodes of a grid covering an area. Since wind farms are not situated on these nodes, it is then needed to extrapolate these forecasts at the desired location and at turbine hub height. Physical-based forecasting methods consist of several sub-models which altogether deliver the translation from the wind forecast at a certain grid point and model level, to power forecast at the site considered. Every sub-model contains the mathematical description of the physical processes relevant to the translation. Knowledge of all relevant processes is therefore crucial when developing a purely physical prediction method (such as the early versions of the Danish Prediktor). The core idea of physical approaches is to refine the NWPs by using physical considerations about the terrain such as the roughness, orography and obstacles, and by modeling the local wind profile possibly accounting for atmospheric stability. The two main alternatives to do so are: (i) to combine the modeling of the wind profile (with a logarithmic assumption in most of the cases) and the geostrophic drag law for obtaining surface winds; (ii) to use a CFD (Computational Fluid Dynamics) code that allows one to accurately compute the wind field that the farm will see, considering a full description of the terrain.
|
wikipedia
|
wiki_15829_chunk_0
|
Quantities, Units and Symbols in Physical Chemistry
|
Quantities, Units and Symbols in Physical Chemistry, also known as the Green Book, is a compilation of terms and symbols widely used in the field of physical chemistry. It also includes a table of physical constants, tables listing the properties of elementary particles, chemical elements, and nuclides, and information about conversion factors that are commonly used in physical chemistry. The Green Book is published by the International Union of Pure and Applied Chemistry (IUPAC) and is based on published, citeable sources. Information in the Green Book is synthesized from recommendations made by IUPAC, the International Union of Pure and Applied Physics (IUPAP) and the International Organization for Standardization (ISO), including recommendations listed in the IUPAP Red Book Symbols, Units, Nomenclature and Fundamental Constants in Physics and in the ISO 31 standards.
|
wikipedia
|
wiki_7530_chunk_7
|
Fujitsu Siemens Computers
|
Products
Fujitsu Siemens Computers' products included:
Media Center: Activity
Notebooks: Amilo, Amilo PRO, CELSIUS Mobile, ESPRIMO Mobile, Fujitsu Lifebook, Liteline, PCD, SCENIC Mobile
Desktop PCs: SCALEO, SCENIC, ESPRIMO, Amilo Desktop
Workstation
CELSIUS
Tablet PC
STYLISTIC
Convertible PC
LIFEBOOK
Handheld
Pocket LOOX
Industry Standard Servers
PRIMERGY
PRIMERGY BladeFrame
Mission critical IA64 servers
PRIMEQUEST
UNIX system based servers
SPARC Enterprise Servers
PRIMEPOWER 250, 450, 900, 1500, 2500
S/390-compatible Mainframes
S- series, SX- series
Flat panel displays
Myrica
Liquid crystal display televisions
Plasma display televisions
SCALEOVIEW
Liquid crystal display computer monitors
SCENICVIEW
Liquid crystal display computer monitors
Operating systems
SINIX: Unix variant, later renamed Reliant UNIX, available for RISC and S/390-compatible platforms
BS2000: EBCDIC-based operating system for SPARC, x86 and S/390-compatible systems
VM2000: EBCDIC-based hypervisor for S/390-compatible platform, capable of running multiple BS2000 and SINIX virtual machines
|
wikipedia
|
wiki_18748_chunk_10
|
List of programs aired by TV5 (Philippine TV network)
|
Anime series
2 Years Vacation with Dinosaurs (2001–2004)
Astro Boy (2006–2008)
Azumanga Daioh (2008–2009, 2009–2010)
Attack on Titan: Junior High (2017)
Battle Spirits (2010)
Black Blood Brothers (2008, 2009)
Casshern Sins (2010)
Clannad (2010)
Code Geass (2008–2010)
Cowboy Bebop (2008–2009)
Coyote Ragtime Show (2008–2009, 2009–2010)
Crayon Shin-chan (2003–2005)
Cyborg Kuro-chan (2004)
D.Gray-man (2010)
Destiny Warriors (Jyūshin Embu – Hero Tales)
DN Angel (2008)
Dragon League
Duel Masters (2008, 2009–2010)
F (2001–2004)
Fancy Lala (2001–2004)
Fullmetal Alchemist: Brotherhood (2009–2010)
Fushigi Yuugi (2009, 2015)
Golgo 13 (2010 – incomplete episodes)
Gundam 00 (2010 – incomplete episodes; 2013 – complete run)
Hutch the Honeybee (1994, 2002–2003)
Is It Wrong to Try to Pick Up Girls in a Dungeon? (2017)
Kantai Collection (2017)
Kenichi: The Mightiest Disciple (2015)
Kimba the White Lion (1993)
Knights of Sidonia (2017)
Katri, Girl of the Meadows (2015)
Legendz (2009)
Lovely Detective Labyrinth (2009)
Lucky Star (2010)
Magical DoReMi (2015)
Starzan S (2009)
Maha Go! Go! Go! (Speed Racer X) (2001–2002)
Mai HiME (2008–2009)
Makibaoh (2009)
The Melancholy of Haruhi Suzumiya (2009 – incomplete episodes)
Mobile Suit Gundam 00 (2010, 2015)
Mon Colle Knights (2003)
My Hero Academia (seasons 1 and 2) (2021)
Myriad Colors Phantom World (2017)
The Mythical Detective Loki Ragnarok (2009)
Neon Genesis Evangelion (1996–1998)
Ninja Boy Rantaro (2004–2006)
Noein (2008, 2009)
Norn9 (2017)
Pollyanna (1994, 2015)
Pygmalio (1999, 2002–2003)
Ranma ½ (2009)
Sailor Moon (1995–2004)
Shakugan no Shana and Shakugan no Shana Second (2008–2009)
Shurato
Special A (2009, 2010)
Slam Dunk (1995–1997)
Street Fighter II V (2010)
Sword Art Online (2015)
Time Quest (1994, 2001–2003)
Tokyo Majin (2008)
Toradora! (2009–2010)
Transformers: Animated (2015)
Transformers: Armada (2008)
Witchblade (2009)
Yaiba (1995–1996)
Yamato Nadeshiko Shichi Henge (2008–2010)
Yatterman (2010)
|
wikipedia
|
wiki_1012_chunk_19
|
Ionization energy
|
Ionization energy increases when
Reaching Group 18 noble gas elements: This is due to their complete electron subshells, so that these elements require large amounts of energy to remove one electron.
Group 12: The elements here, zinc (: 9.4 eV), cadmium (: 9.0 eV) and mercury (: 10.4 eV) all record sudden rising IE values in contrast to their preceding elements: copper (: 7.7 eV), silver (: 7.6 eV) and gold (: 9.2 eV) respectively. For mercury, it can be extrapolated that the relativistic stabilization of the 6s electrons increases the ionization energy, in addition to poor shielding by 4f electrons that increases the effective nuclear charge on the outer valence electrons. In addition, the closed-subshells electron configurations: [Ar] 3d10 4s2, [Kr] 4d105s2 and [Xe] 4f14 5d10 6s2 provide increased stability.
Special case: shift from rhodium (: 7.5 eV) to palladium (: 8.3 eV). Unlike other Group 10 elements, palladium has a higher ionization energy than the preceding atom, due to its electron configuration. In contrast to nickel's [Ar] 3d8 4s2, and platinum's [Xe] 4f14 5d9 6s1, palladium's electron configuration is [Kr] 4d10 5s0 (even though the Madelung rule predicts [Kr] 4d8 5s2). Finally, silver's lower IE (: 7.6 eV) further accentuates the high value for palladium; the single added s electron is removed with a lower ionization energy than palladium, which emphasizes palladium's high IE (as shown in the above linear table values for IE)
The IE of gadolinium (: 6.15 eV) is somewhat higher than both the preceding (: 5.64 eV), (: 5.67 eV) and following elements (: 5.86 eV), (: 5.94 eV). This anomaly is due to the fact that gadolinium valence d-subshell borrows 1 electron from the valence f-subshell. Now the valence subshell is the d-subshell, and due to the poor shielding of +ve nuclear charge by electrons of the f-subshell, the electron of the valence d-subshell experiences a greater attraction to the nucleus, therefore increasing the energy required to remove the (outermost) valence electron.
Moving into d-block elements: The elements Sc with a 3d1 electronic configuration has a higher IP (: 6.56 eV) than the preceding element (: 6.11 eV), contrary to the decreases on moving into s-block and p-block elements. The 4s and 3d electrons have similar shielding ability: the 3d orbital forms part of the n=3 shell whose average position is closer to the nucleus than the 4s orbital and the n=4 shell, but electrons in s orbitals experience greater penetration into the nucleus than electrons in d orbitals. So the mutual shielding of 3d and 4s electrons is weak, and the effective nuclear charge acting on the ionized electron is relatively large. Yttrium () similarly has a higher IP (6.22 eV) than : 5.69 eV. The last two d1 elements (: 5.18 eV) and (: 5.17 eV) have only very slightly lower IP's than their preceding elements (: 5.21 eV) and (: 5.18 eV).
Moving into f-block elements; As can be seen in the above graph for ionization energies, the sharp rise in IE values from () to () is followed by a small almost linear increase as f electrons are added. This is due to the lanthanide contraction (for lanthanides). This decrease in ionic radius is associated with an increase in ionization energy in turn increases, since the two properties correlate to each other. As for d-block elements, the electrons are added in an inner shell, so that no new shells are formed. The shape of the added orbitals prevents them from penetrating to the nucleus so that the electrons occupying them have less shielding capacity.
|
wikipedia
|
wiki_12940_chunk_26
|
Home network
|
Administration
The administration of proliferating devices and software in home networks, and the growing amount of private data, is fast becoming an issue by itself. Keeping overview, applying without delay SW updates and security patches, keeping juniors internet use within safe boundaries, structuring of storage and access levels for private files and other data, Data backups, detection and cleaning of any infections, operating virtual private networks for easy access to resources in the home network when away, etc.. Such things are all issues that require attention and planned careful work in order to provide a secure, resilient, and stable home network easy to use for all members of the household and their guests.
|
wikipedia
|
wiki_20547_chunk_7
|
Software modernization
|
Challenges in legacy modernization
Primary issues with a legacy system include very old systems with lack of documentation, lack of SMEs/ knowledge on the legacy systems and dearth of technology skills in which the legacy systems have been implemented. Typical legacy systems have been in existence for more than two decades. Migrating is fraught with challenges:
Lack of visibility across large application portfolios – Large IT organizations have hundreds, if not thousands, of software systems. Technology and functional knowledge are by nature distributed, diluted, and opaque. No central point of visibility for senior management and Enterprise Architects is a top issue – it is challenging to make modernization decisions about software systems without having the necessary quantitative and qualitative data about these systems across the enterprise.
Organizational change management – Users must be re-trained and equipped to use and understand the new applications and platforms effectively.
Coexistence of legacy and new systems – Organizations with a large footprint of legacy systems cannot migrate at once. A phased modernization approach needs to be adopted. However, this brings its own set of challenges like providing complete business coverage with well understood and implemented overlapping functionality, data duplication; throw-away systems to bridge legacy and new systems needed during the interim phases.
Poor management of structural quality (see software quality), resulting in a modernized application that carries more security, reliability performance and maintainability issues than the original system.
Significant modernization costs and duration - Modernization of a complex mission-critical legacy system may need large investments and the duration of having a fully running modernized system could run into years, not to mention unforeseen uncertainties in the process.
Stakeholders commitment - Main organization stakeholders must be convinced of the investment being made for modernization, since the benefits, and an immediate ROI may not be visible as compared to the modernization costs being invested.
Software Composition – It is extremely rare that developers create 100% original code these days in anything built after 2010. They are often using 3rd party and open source frameworks and software components to gain efficiency, speed, and reusability. This introduces two risks: 1.) vulnerabilities within the 3rd party code, and 2.) open source licensing risk.
Last but not least, there is no one-stop solution-fits all kind of option in modernization. With a multitude of commercial and bespoke options available for modernization, it’s critical for the customers, the sellers and the executors to understand the intricacies of various modernization techniques, their best applicable implementations, suitability in a particular context, and the best practices to follow before selecting the right modernization approach.
|
wikipedia
|
wiki_3274_chunk_3
|
Function overloading
|
Apex
C++
C#
Swift
Fortran
Kotlin
Java
PostgreSQL and PL/SQL
Scala
TypeScript
Wolfram Language
Elixir
Nim Rules in function overloading
The same function name is used for more than one function definition
The functions must differ either by the arity or types of their parameters It is a classification of static polymorphism in which a function call is resolved using some "best match" algorithm, where the particular function to call is resolved by finding the best match of the formal parameter types with the actual parameter types. The details of this algorithm vary from language to language.
|
wikipedia
|
wiki_382_chunk_7
|
Merge algorithm
|
-way merging generalizes binary merging to an arbitrary number of sorted input lists. Applications of -way merging arise in various sorting algorithms, including patience sorting and an external sorting algorithm that divides its input into blocks that fit in memory, sorts these one by one, then merges these blocks. Several solutions to this problem exist. A naive solution is to do a loop over the lists to pick off the minimum element each time, and repeat this loop until all lists are empty:
|
wikipedia
|
wiki_18764_chunk_41
|
Anonymous function
|
int main() {
std::function<double(double)> f0 = [](double x) { return 1; };
auto f1 = [](double x) { return x; };
decltype(f0) fa[3] = {f0, f1, [](double x) { return x * x; }};
std::vector<decltype(f0)> fv = {f0, f1};
fv.push_back([](double x) { return x * x; });
for (size_t i = 0; i < fv.size(); i++) {
std::cout << fv[i](2.0) << std::endl;
}
for (size_t i = 0; i < 3; i++) {
std::cout << fa[i](2.0) << std::endl;
}
for (auto& f : fv) {
std::cout << f(2.0) << std::endl;
}
for (auto& f : fa) {
std::cout << f(2.0) << std::endl;
}
std::cout << eval(f0) << std::endl;
std::cout << eval(f1) << std::endl;
std::cout << eval([](double x) { return x * x; }) << std::endl;
}
A lambda expression with an empty capture specification ([]) can be implicitly converted into a function pointer with the same type as the lambda was declared with. So this is legal:
|
wikipedia
|
wiki_11686_chunk_1
|
Functional group (ecology)
|
Scientific investigation
Rather than the idea of this concept based upon a set of theories, functional groups are directly observed and determined by research specialists. It is important that this information is witnessed first-hand in order to state as usable evidence. Behavior and overall contribution to others are common key points to look for. Individuals use the corresponding perceived traits to further link genetic profiles to one another. Although, the life-forms themselves are different, variables based upon overall function and performance are interchangeable. These groups share an indistinguishable part within their energy flow, providing a key position within food chains and relationships within environment(s).
|
wikipedia
|
wiki_18612_chunk_17
|
Bootstrapping (statistics)
|
The Monte Carlo algorithm for case resampling is quite simple. First, we resample the data with replacement, and the size of the resample must be equal to the size of the original data set. Then the statistic of interest is computed from the resample from the first step. We repeat this routine many times to get a more precise estimate of the Bootstrap distribution of the statistic.
The 'exact' version for case resampling is similar, but we exhaustively enumerate every possible resample of the data set. This can be computationally expensive as there are a total of different resamples, where n is the size of the data set. Thus for n = 5, 10, 20, 30 there are 126, 92378, 6.89 × 1010 and 5.91 × 1016 different resamples respectively.
|
wikipedia
|
wiki_8588_chunk_18
|
Matrix calculus
|
The pushforward along a vector function f with respect to vector v in Rn is given by Derivatives with matrices
There are two types of derivatives with matrices that can be organized into a matrix of the same size. These are the derivative of a matrix by a scalar and the derivative of a scalar by a matrix. These can be useful in minimization problems found in many areas of applied mathematics and have adopted the names tangent matrix and gradient matrix respectively after their analogs for vectors.
|
wikipedia
|
wiki_167_chunk_44
|
Database
|
Probabilistic databases employ fuzzy logic to draw inferences from imprecise data.
Real-time databases process transactions fast enough for the result to come back and be acted on right away.
A spatial database can store the data with multidimensional features. The queries on such data include location-based queries, like "Where is the closest hotel in my area?".
A temporal database has built-in time aspects, for example a temporal data model and a temporal version of SQL. More specifically the temporal aspects usually include valid-time and transaction-time.
A terminology-oriented database builds upon an object-oriented database, often customized for a specific field.
An unstructured data database is intended to store in a manageable and protected way diverse objects that do not fit naturally and conveniently in common databases. It may include email messages, documents, journals, multimedia objects, etc. The name may be misleading since some objects can be highly structured. However, the entire possible object collection does not fit into a predefined structured framework. Most established DBMSs now support unstructured data in various ways, and new dedicated DBMSs are emerging.
|
wikipedia
|
wiki_663_chunk_81
|
Electric power transmission
|
The New York State Public Service Commission conducted a study, documented in Opinion No. 78-13 (issued June 19, 1978), to evaluate potential health effects of electric fields. The study's case number is too old to be listed as a case number in the commission's online database, DMM, and so the original study can be difficult to find. The study chose to utilize the electric field strength that was measured at the edge of an existing (but newly built) right-of-way on a 765 kV transmission line from New York to Canada, 1.6 kV/m, as the interim standard maximum electric field at the edge of any new transmission line right-of-way built in New York State after issuance of the order. The opinion also limited the voltage of all new transmission lines built in New York to 345 kV. On September 11, 1990, after a similar study of magnetic field strengths, the NYSPSC issued their Interim Policy Statement on Magnetic Fields. This study established a magnetic field interim standard of 200 mG at the edge of the right-of-way using the winter-normal conductor rating. This later document can also be difficult to find on the NYSPSC's online database, since it predates the online database system. As a comparison with everyday items, a hair dryer or electric blanket produces a 100 mG – 500 mG magnetic field. An electric razor can produce 2.6 kV/m. Whereas electric fields can be shielded, magnetic fields cannot be shielded, but are usually minimized by optimizing the location of each phase of a circuit in cross-section.
|
wikipedia
|
wiki_11348_chunk_8
|
Pair of pants (mathematics)
|
The geometric proof of the classification in the previous paragraph is important for understanding the structure of hyperbolic pants. It proceeds as follows: Given an hyperbolic pair of pants with totally geodesic boundary, there exist three unique geodesic arcs that join the cuffs pairwise and that are perpendicular to them at their endpoints. These arcs are called the seams of the pants. Cutting the pants along the seams, one gets two right-angled hyperbolic hexagons which have three alternate sides of matching lengths. The following lemma can be proven with elementary hyperbolic geometry.
|
wikipedia
|
wiki_7029_chunk_15
|
Action! (programming language)
|
BYTE RTCLOK=20, ; addr of sys timer
SDMCTL=559 ; DMA control
BYTE ARRAY FLAGS(8190)
CARD COUNT,I,K,PRIME,TIME
PROC SIEVE()
SDMCTL=0 ; shut off Antic
RTCLOK=0 ; reset the clock to zero
COUNT=0 ; init count
FOR I=0 TO 8190 ; and flags
DO
FLAGS(I)='T ; "'T" is a compiler-provided constant for True
OD
FOR I=0 TO 8190 ; now run the sieve
DO
IF FLAGS(I)='T THEN
PRIME=I+I+3
K=I+PRIME
WHILE K<=8190
DO
FLAGS(K)='F ; "'F" is a compiler-provided constant for False
K==+PRIME
OD
COUNT==+1
FI
OD
TIME=RTCLOK ; get timer reading
SDMCTL=34 ; restore screen
PRINTF("%E %U PRIMES IN",COUNT)
PRINTF("%E %U JIFFIES",TIME)
RETURN
|
wikipedia
|
wiki_1926_chunk_4
|
Conservation biology
|
Conservation biologists research and educate on the trends and process of biodiversity loss, species extinctions, and the negative effect these are having on our capabilities to sustain the well-being of human society. Conservation biologists work in the field and office, in government, universities, non-profit organizations and industry. The topics of their research are diverse, because this is an interdisciplinary network with professional alliances in the biological as well as social sciences. Those dedicated to the cause and profession advocate for a global response to the current biodiversity crisis based on morals, ethics, and scientific reason. Organizations and citizens are responding to the biodiversity crisis through conservation action plans that direct research, monitoring, and education programs that engage concerns at local through global scales.
|
wikipedia
|
wiki_19622_chunk_5
|
International Federation of Clinical Chemistry and Laboratory Medicine
|
Congresses and Conferences Committee (C-CC)
Its mission is to provide administration and management of all IFCC meeting activities and to review applications for IFCC Auspices from non IFCC conferences requesting such sponsorship
Visit the IFCC website for a database of upcoming international and regional conferences Key programs
IFCC Reference Materials
Distance Learning Program
Visiting Lectureship Program
Professional Scientific Exchange Program
IFCC Speakers Bureau
Roche/IFCC Travel Scholarships See also
Good Laboratory Practice (GLP)
Institute for Reference Materials and Measurements (IRMM)
International Laboratory Accreditation Cooperation
ISO 15189
Joint Committee for Traceability in Laboratory Medicine
National Institute of Standards and Technology (NIST)
Reference values References
|
wikipedia
|
wiki_1727_chunk_36
|
Bose–Einstein statistics
|
In recent years, Bose–Einstein statistics has also been used as a method for term weighting in information retrieval. The method is one of a collection of DFR ("Divergence From Randomness") models, the basic notion being that Bose–Einstein statistics may be a useful indicator in cases where a particular term and a particular document have a significant relationship that would not have occurred purely by chance. Source code for implementing this model is available from the Terrier project at the University of Glasgow.
The evolution of many complex systems, including the World Wide Web, business, and citation networks, is encoded in the dynamic web describing the interactions between the system's constituents. Despite their irreversible and nonequilibrium nature these networks follow Bose statistics and can undergo Bose–Einstein condensation. Addressing the dynamical properties of these nonequilibrium systems within the framework of equilibrium quantum gases predicts that the "first-mover-advantage," "fit-get-rich(FGR)," and "winner-takes-all" phenomena observed in competitive systems are thermodynamically distinct phases of the underlying evolving networks.
|
wikipedia
|
wiki_2620_chunk_12
|
Anthropological linguistics
|
Methodology
There are two major trends in the theoretical and methodological study of attitudes in the social sciences - mentalist and behaviorist. The mentalist trend treats attitude as a mediating concept while the behaviorist trend operationally defines it as a probability concept, though in research practice both derive their attitude measures from response variation. While there are many different views concerning the structure and components of attitudes, there is, however, an overwhelming agreement that attitudes are learned, lasting, and positively related to behavior. Methodology in attitude studies includes direct and indirect measures of all kinds, but language attitude studies have tended to make more use of questionnaires than of other methods. The matched guise technique - a sociolinguistic experimental technique used to determine the true feelings of an individual or community towards a specific language, dialect, or accent - has been extensively used for studies relating to the social significance of languages and language varieties. A special adaptation of this technique, called mirror image, appears promising for measuring consensual evaluations of language switching at the situational level. Situational based self-report instruments such as those used by Greenfield and Fishman also promise to be very effective instruments for studies pertaining to normative views concerning the situational use of languages and language varieties. The commitment measure has been found to be particularly suited for collecting data on behavioral tendencies. Data obtained through interviewing may be difficult to process and score – and may provide bias from those being interviewed – but the research interview can be particularly effective for attitude assessment, especially when used to complement the observational method. Data collected through the observational method can be formally processed like data obtained through more formalized instruments if attempts are made to record the data in more public forms instead of only through the approach most characteristic for this kind of data have used so far.
|
wikipedia
|
wiki_23174_chunk_2
|
Workers Revolutionary Party of Colombia
|
Peace Treaty
In December 1990, president Virgilio Barco expressed willingness to hold peace talks with PRT. Talks were initiated between the Colombian government and PRT. On December 28 an accord was signed between the government and PRT. On January 25, 1991, a final peace treaty was signed in Don Gabriel, Ovejas municipality, Sucre, between the government and PRT. It stipulated, amongst other things, that:
PRT would become a legal political party
PRT would gain representation in the Constituent Assembly. The party was given one seat in the assembly, but without vote.
A TV programme of the party would be broadcast
PRT would get a full page ad in 2 national newspapers and 4 regional newspapers, as well half-page ads in 1 national newspaper and 3 regional newspapers.
Government would pay for an office for PRT in Bogotá
An armoured car for the PRT spokesperson in the Constituent Assembly, four bodyguards and 14 bulletproof vests for the PRT leadership.
Government would finance the building of five Casas por la Vida, in Bogotá, Barranquilla, Medellín, Sincelejo and one additional location.
A fund of 300 million pesos would be allocated for projects in the conflict areas of PRT. A joint government-PRT commission would oversee the distribution of the funds.
Subsidy for upkeep, health and education would be given to demobilized PRT fighters, through a fund.
An Indigenous Police force would be formed within the Colombian National Police.
|
wikipedia
|
wiki_594_chunk_107
|
Tree (data structure)
|
By considering just particular subsets of the above conditions and/or particular constituents of we obtain a nomenclature of tree data structures. Accessible pointed quivers form the "lowest common denominator" – conditions (1) and (2) are always required.
Conditions (4–7) are imposed appropriately to whether
, , or are defined. The "tree" attribution is established by condition (3).
|
wikipedia
|
wiki_2411_chunk_52
|
Computer-supported cooperative work
|
On the topic of computing infrastructures, Democratizing Ubiquitous Computing - a Right for Locality presents a study from researchers at Lancaster University on ubiquitous computing ("ubicomp") to identify where there exists positive or negative effects on users and society at large. The research specifically focuses on cities or urban areas as they are places where one can expect a lot of technological and social activities to take place. An apparent guiding principle to the research is that the goal of advancing any ubicomp technologies should be to maximize the amount of good to as many people in a society as possible. A key observation is made about the way in which these infrastructures come into being:A ubiquitous computing infrastructure can play an important role in enabling and enhancing beneficial social processes as, unlike electricity, digital infrastructure enhances a society’s cognitive power by its ability to connect people and information [39]. While infrastructure projects in the past had the idealistic notion to connect the urban realm and its communities of different ethnicity, wealth, and beliefs, Graham et al. [28] note the increasing fragmentation of the management and ownership of infrastructures. This is because ubicomp has the potential to further disadvantage marginalized communities online.The current disadvantage of ubiquitous computing infrastructures is that they do not best support urban development. Proposals to resolve these social issues include increased transparency about personal data collection as well as individual and community accountability about the data collection process in ubicomp infrastructure. Data at work: supporting sharing in science and engineering is one such paper that goes into greater depth about how to build better infrastructures that enable open data-sharing and thus, empower its users. What this article outlines is that in building better collaborative systems that advance science and society, we are, by effect, "promoting sharing behaviors" that will encourage greater cooperation and more effective outcomes.
|
wikipedia
|
wiki_382_chunk_14
|
Merge algorithm
|
The work performed by the algorithm for two arrays holding a total of elements, i.e., the running time of a serial version of it, is . This is optimal since elements need to be copied into . To calculate the span of the algorithm, it is necessary to derive a Recurrence relation. Since the two recursive calls of merge are in parallel, only the costlier of the two calls needs to be considered. In the worst case, the maximum number of elements in one of the recursive calls is at most since the array with more elements is perfectly split in half. Adding the cost of the Binary Search, we obtain this recurrence as an upper bound:
|
wikipedia
|
wiki_3722_chunk_16
|
Paul Scully-Power
|
Technical papers
Scully-Power is considered a world expert in remote sensing: visible, infra-red, radar and acoustic sensing and has earned the highest degree in science, a Doctor of Science in Applied Mathematics for his work. He has published over ninety international scientific reports and technical journal articles, including the Bakerian Lecture of the Royal Society. He has been a major contributor to the U.S. Navy's warfare appraisal and surveillance strategies, and was recognised by the University of Sydney in 1995 as its Distinguished Graduate. He discovered the phenomenon of ocean spiral eddies.
|
wikipedia
|
wiki_2151_chunk_55
|
D (programming language)
|
Toy and proof-of-concept compilers:
D Compiler for – A back-end for the D programming language 2.0 compiler. It compiles the code to Common Intermediate Language (CIL) bytecode rather than to machine code. The CIL can then be run via a Common Language Infrastructure (CLI) virtual machine. The project has not been updated in years and the author indicated the project is not active anymore.
SDC – The Stupid D Compiler uses a custom front-end and LLVM as its compiler back-end. It is written in D and uses a scheduler to handle symbol resolution in order to elegantly handle the compile-time features of D. This compiler currently supports a limited subset of the language.
|
wikipedia
|
wiki_8086_chunk_11
|
Courant Institute of Mathematical Sciences
|
The mathematics and computer science undergraduate and graduate programs at the Courant Institute has a strong focus on building quantitative and problem-solving skills through teamwork. An undergraduate computer science course on Computer Vision, for example, requires students to be in small teams to use and apply recently developed algorithms by researchers around the world on their own. One example assignment requires a student to study a paper written by researchers from Microsoft Research Cambridge in order to do an assignment on Segmentation and Graph Cut. To encourage innovation, students in advanced coursework are allowed to use any means to complete their assignment, such as a programming language of their choice and hacking a Kinect through legal means.
|
wikipedia
|
wiki_1475_chunk_15
|
Z3 (computer)
|
Specifications
Average calculation speed: addition – 0.8 seconds, multiplication – 3 seconds
Arithmetic unit: Binary floating-point, 22-bit, add, subtract, multiply, divide, square root
Data memory: 64 words with a length of 22 bits
Program memory: Punched celluloid tape
Input: Decimal floating-point numbers
Output: Decimal floating-point numbers
Input and Output was facilitated by a terminal, with a special keyboard for input and a row of lamps to show results
Elements: Around 2,000 relays (1,400 for the memory)
Frequency: 5–10 hertz
Power consumption: Around 4,000 watts
Weight: Around
|
wikipedia
|
wiki_8199_chunk_2
|
Heterolysis (chemistry)
|
One example of the differences in the energies is the energy required to break a Hydrogen-Hydrogen bond
{|
| H2 -> 2H. || || ΔH = 104 kcal/mol
|-
| H2 -> H+ + H- || || ΔH = 66 kcal/mol (in water)
|} History
The discovery and categorization of heterolytic bond fission was clearly dependent on the discovery and categorization of the chemical bond.
|
wikipedia
|
wiki_8380_chunk_3
|
Complex network
|
The field continues to develop at a brisk pace, and has brought together researchers from many areas including mathematics, physics, electric power systems, biology, climate, computer science, sociology, epidemiology, and others. Ideas and tools from network science and engineering have been applied to the analysis of metabolic and genetic regulatory networks; the study of ecosystem stability and robustness; clinical science; the modeling and design of scalable communication networks such as the generation and visualization of complex wireless networks; and a broad range of other practical issues. Network science is the topic of many conferences in a variety of different fields, and has been the subject of numerous books both for the lay person and for the expert.
|
wikipedia
|
wiki_30111_chunk_44
|
Concentrated solar power
|
So far no commercial scale CSP project has been commissioned in Australia, but several projects were suggested. In 2017 now bankrupt American CSP developer SolarReserve got awarded a PPA to realize the 150MW Aurora Solar Thermal Power Project in South Australia at a record low rate of just AUD$0.08/kWh or close to USD$0.06/kWh. Unfortunately the company failed to secure financing and the project got cancelled. Another promising application for CSP in Australia are mines that need 24/7 electricity but often have no grid connection. Vast Solar a startup company aiming to commercialize a novel modular third generation CSP design is looking to start construction of a 50MW combines CSP and PV facility in Mt. Isa of North-West Queensland in 2021.
|
wikipedia
|
wiki_30896_chunk_1
|
Whole Earth Software Catalog and Review
|
Overview
Fred Turner discusses the production and eventual demise of both the Catalog and Review in From Counterculture to Cyberculture: Stewart Brand, the Whole Earth Network, and the Rise of Digital Utopianism. Turner notes that in 1983, The Whole Earth Software Catalog was proposed by John Brockman as a magazine which "would do for computing what the original [Whole Earth Catalog] had done for the counterculture: identify and recommend the best tools as they emerged." Brand announced the first publication of the quarterly Whole Earth Software Review at the SoftCon trade show at the Louisiana Superdome in New Orleans in March 1984. While both were published as an extension of Whole Earth, the Catalog was a large glossy book sponsored by Doubleday and published in Sausalito California while the Review was a small periodical published in San Diego. The Catalog and Review were notable for being "devoid of any industry advertising" and for being "accessible and user friendly - written in an glib, conversational style that takes most of the bugs out of microprocessing."
|
wikipedia
|
wiki_38519_chunk_1
|
WHO Expert Committee on Biological Standardization
|
Reports
The Committee reports are published as WHO Technical Report Series. All the reports are available online.
Third Report published as Technical Report Series No. 2 in 1950.
Third Report of the Subcommittee on the Fat-Soluble Vitamins published as Technical Report Series No. 3 in 1950.
Fifth Report published as Technical Report Series No. 56 in 1952.
Sixth Report published as Technical Report Series No. 68 in 1953.
Seventh Report published as Technical Report Series No. 86 in 1954.
Eighth Report published as Technical Report Series No. 96 in 1955.
Ninth Report published as Technical Report Series No. 108 in 1956.
Tenth Report published as Technical Report Series No. 127 in 1957.
Eleventh Report published as Technical Report Series No. 147 in 1958.
Twelfth Report published as Technical Report Series No. 172 in 1959.
Thirteenth Report published as Technical Report Series No. 187 in 1960.
Fourteenth Report published as Technical Report Series No. 222 in 1961.
Fifteenth Report published as Technical Report Series No. 259 in 1963.
Sixteenth Report published as Technical Report Series No. 274 in 1964.
Seventeenth Report published as Technical Report Series No. 293 in 1964.
Eighteenth Report published as Technical Report Series No. 329 in 1966.
Nineteenth Report published as Technical Report Series No. 361 in 1967.
Twentieth Report published as Technical Report Series No. 384 in 1968.
Twenty first Report published as Technical Report Series No. 413 in 1969.
Twenty second Report published as Technical Report Series No. 444 in 1970.
Twenty third Report published as Technical Report Series No. 463 in 1971.
Twenty fourth Report published as Technical Report Series No. 486 in 1972.
Twenty fifth Report published as Technical Report Series No. 530 in 1973.
Twenty sixth Report published as Technical Report Series No. 565 in 1975.
Twenty seventh Report published as Technical Report Series No. 594.
Twenty eighth Report published as Technical Report Series No. 610.
Twenty ninth Report published as Technical Report Series No. 626.
Thirtieth Report published as Technical Report Series No. 638.
Thirty first Report published as Technical Report Series No. 658.
Thirty second Report published as Technical Report Series No. 673.
Thirty third Report published as Technical Report Series No. 687.
Thirty fourth Report published as Technical Report Series No. 700.
Thirty fifth Report published as Technical Report Series No. 725.
Thirty sixth Report published as Technical Report Series No. 745.
Thirty seventh Report published as Technical Report Series No. 760.
Thirty eighth Report published as Technical Report Series No. 771.
Thirty ninth Report published as Technical Report Series No. 786.
Fortieth Report published as Technical Report Series No. 800.
Forty first Report published as Technical Report Series No. 814.
Forty second Report published as Technical Report Series No. 822.
Forty third Report published as Technical Report Series No. 840.
Forty fourth Report published as Technical Report Series No. 848.
Forty fifth Report published as Technical Report Series No. 858.
Forty sixth Report published as Technical Report Series No. 872 in 1998.
Forty seventh Report published as Technical Report Series No. 878 in 1998.
Forty eighth Report published as Technical Report Series No. 889.
Forty ninth Report published as Technical Report Series No. 897.
Fiftieth Report published as Technical Report Series No. 904.
Fifty first Report published as Technical Report Series No. 910.
Fifty second Report published as Technical Report Series No. 924.
Fifty third Report published as Technical Report Series No. 926.
Fifty fourth Report published as Technical Report Series No. 927.
Fifty fifth Report published as Technical Report Series No. 932.
Fifty sixth Report published as Technical Report Series No. 941.
|
wikipedia
|
wiki_16295_chunk_18
|
Airborne wind energy
|
Early references to HAWP
Early centuries of kiting demonstrated that the kite is a rotary engine that rotates its tether part about its mooring point and causes hands and arms to move because of the energy captured from higher winds into the mechanical device. The tension in the lofted devices performs the work of lifting and pulling body parts and things. Airborne wind energy (AWE) for HAWP was birthed thousands of years ago; naming what happened and developing the implied potentials of tethered aircraft for doing special works is what is occurring in AWE HAWP. What is "low" for some workers is "high" for others.
1796 George Pocock used traction mode to travel in vehicles over land roads.
1827 George Pocock's book ‘The Aeropleustic Art’ or 'Navigation in the Air by the Use of Kites or Buoyant Sails' was published. Pocock described use of kites for land and sea travel. The book was republished several times.
1833 John Adolphus Etzler saw HAWP blossoming at least for traction.
1864? Book's chapter Kite-Ship well describes key dynamics of HAWP used for tugging ships by kites. John Gay's: or Work for Boys. Chapter XVIII in the Summer volume.
1935 Aloys van Gries stands as a strong early patentee of high-altitude wind power; he taught various kite systems for use in generating electricity in his DE 656194 C patent: Durch Drachen getragene Windkraftmaschine zur Nutzbarmachung von Hoehenwinden
1943 Stanley Biszak instructed using potential energy in free-flight for converting ambient winds impacting turbine to drive electric generator to charge batteries.
1967 Richard Miller, former editor of Soaring magazine, published book Without Visible Means of Support that describes the feasibility of free-flight coupled non-ground-moored kites to capture differences in wind strata to travel across continents; such HAWP is the subject of Dale C. Kramer's contemporary patent application.
1973? Hermann Oberth In the appendix of his book Primer for Those Who Would Govern there are sketches and a photograph of a model of the Kite Power Station from the Oberth Museum.
1977 April 3, 1977, invention declared. On September 21, 1979, Douglas Selsam notarized his kite-lifted endless chain of airfoils HAWP system, generic type that would later show in Dutch astronaut Wubbo Ockels' device called LadderMill described in a patent of 1997. Douglas Selsam conceived his Auto-oriented Wind Harnessing Buoyant Aerial Tramway on April 3, 1977. On the Selsam notarized disclosure of invention was placed a date of Sept. 20, while the notary placed the final signing on Sept. 21, 1979. notes and drawings.
1979 Professor Bryan Roberts begins giromill gyrocopter-type HAWP wind generator development.
1980 Miles Loyd publishes an article on the crosswind kite power.
1986 Bryan Roberts' AWE HAWP rotor generates electricity and lifts itself in tethered flight.
1992 Free Rotor WO/1992020917 Free Rotor by JACK, Colin, Humphry, Bruce (one man). Colin Jack. Colin Bruce. Multi-rotors are treated. Faired tethers are recognized. 1992.
|
wikipedia
|
wiki_6411_chunk_8
|
Odin Computer Graphics
|
Nodes of Yesod (1985; ZX Spectrum, C64, Amstrad CPC, Enterprise 64/128)
Robin of the Wood (1985; ZX Spectrum, C64)
Arc of Yesod (1985; ZX Spectrum, C64)
I.C.U.P.S. (1986; ZX Spectrum, C64)
Mission A.D. (1986; C64)
Heartland (1986; ZX Spectrum, C64, Amstrad CPC)
Hypa-Ball (1986; ZX Spectrum, C64)
On the Tiles (1987; C64)
Sidewize (1987; ZX Spectrum, C64)
U.F.O. (1987; C64)
The Plot (1988; ZX Spectrum, Amstrad CPC) [Originally titled 'The Gunpowder Plot']
Scary Monsters (1988; Commodore 64)
Crosswize (1988; ZX Spectrum)
Gladiator (unreleased)
Tank Game (unreleased)
P.L.O.D. (unreleased)
Lusitania (unreleased)
|
wikipedia
|
wiki_24853_chunk_2
|
Action algebra
|
An action algebra (A, ∨, 0, •, 1, ←, →, *) is an algebraic structure such that (A, ∨, •, 1, ←, →) forms a residuated semilattice while (A, ∨, 0, •, 1, *) forms a Kleene algebra. That is, it is any model of the joint theory of both classes of algebras. Now Kleene algebras are axiomatized with quasiequations, that is, implications between two or more equations, whence so are action algebras when axiomatized directly in this way. However, action algebras have the advantage that they also have an equivalent axiomatization that is purely equational.<ref>{{citation
| last = Pratt | first = Vaughan
| contribution = Action Logic and Pure Induction
| contribution-url = http://boole.stanford.edu/pub/jelia.pdf
| title = Logics in AI: European Workshop JELIA '90 (ed. J. van Eijck)
| series = LNCS 478
| pages = 97–120
| publisher = Springer-Verlag
| year = 1990}}.</ref> The language of action algebras extends in a natural way to that of action lattices, namely by the inclusion of a meet operation.
|
wikipedia
|
wiki_24729_chunk_5
|
Quantum stirring, ratchets, and pumping
|
where and are indexes over the mechanical degrees of freedom and the leads respectively, and
the subindex "" implies that the quantities should be evaluated at equilibrium, i.e. and . Integrating the above equation for a system with two leads yields the well known relation between the pumped charge per cycle , the work done by the motor , and the voltage bias , . The Kubo approach to quantum stirring
|
wikipedia
|
wiki_9609_chunk_1
|
Power of a point
|
Points with equal power, isolines of , are circles concentric to circle . Steiner used the power of a point for proofs of several statements on circles, for example:
Determination of a circle, that intersects four circles by the same angle.
Solving the Problem of Apollonius
Construction of the Malfatti circles: For a given triangle determine three circles, which touch each other and two sides of the triangle each.
Spherical version of Malfatti's problem: The triangle is a spherical one. Essential tools for invstigations on circles are the radical axis of two circles and the radical center of three circles.
|
wikipedia
|
wiki_8430_chunk_3
|
Government Engineering College, Thrissur
|
Departments
Dept. of Electronics and Communication Engineering
Dept. of Mechanical Engineering
Dept. of Civil Engineering
Dept. of Electrical and Electronics Engineering
Dept. of Chemical Engineering
Dept. of Production cum Plant Engineering
Dept. of Computer Science and Engineering
School of Architecture and Planning
Dept. of MCA
Environmental Centre
Dept. of Mathematics
Dept. of Physics
Dept. of Chemistry
Dept. of Economics
Dept. of Physical Education Ancillaries and facilities
Central Library
Central Computing Centre
Gymnasium
Canteen
Post Office
State Bank of India ATM
Placement Cell
Dispensary
Millenium (Main) auditorium
Open air theatre
Amphitheatres
Men's Hostels
Ladies Hostels
Staff Quarters Academics
|
wikipedia
|
wiki_15968_chunk_0
|
List of MeSH codes (V03)
|
The following is a partial list of the "V" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (V02). Codes following these are found at List of MeSH codes (V04). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – study characteristics (publication type) – case reports (publication type) – clinical conference (publication type)
|
wikipedia
|
wiki_8943_chunk_13
|
Organotin chemistry
|
Organic derivatives of tin(I)
Compounds of Sn(I) are rare and only observed with very bulky ligands. One prominent family of cages is accessed by pyrolysis of the 2,6-diethylphenyl-substituted tristannylene [Sn(C6H3-2,6-Et2)2]3, which affords the cubane-type cluster and a prismane. These cages contain Sn(I) and have the formula [Sn(C6H3-2,6-Et2)]n where n = 8, 10. A stannyne contains a carbon to tin triple bond and a distannyne a triple bond between two tin atoms (RSnSnR). Distannynes only exist for extremely bulky substituents. Unlike alkynes, the C-Sn-Sn-C core of these distannynes are nonlinear, although they are planar. The Sn-Sn distance is 3.066(1) Å, and the Sn-Sn-C angles are 99.25(14)°. Such compounds are prepared by reduction of bulky aryltin(II) halides.
|
wikipedia
|
wiki_40_chunk_47
|
Astrobiology
|
Research The systematic search for possible life outside Earth is a valid multidisciplinary scientific endeavor. However, hypotheses and predictions as to its existence and origin vary widely, and at the present, the development of hypotheses firmly grounded on science may be considered astrobiology's most concrete practical application. It has been proposed that viruses are likely to be encountered on other life-bearing planets, and may be present even if there are no biological cells. Research outcomes
|
wikipedia
|
wiki_21609_chunk_4
|
Tricorn (mathematics)
|
Implementation
The below pseudocode implementation hardcodes the complex operations for Z. Consider implementing complex number operations to allow for more dynamic and reusable code.For each pixel (x, y) on the screen, do:
{
x = scaled x coordinate of pixel (scaled to lie in the Mandelbrot X scale (-2.5, 1))
y = scaled y coordinate of pixel (scaled to lie in the Mandelbrot Y scale (-1, 1))
zx = x; // zx represents the real part of z
zy = y; // zy represents the imaginary part of z
|
wikipedia
|
wiki_346_chunk_16
|
Mathematician
|
The American Mathematical Society, Association for Women in Mathematics, and other mathematical societies offer several prizes aimed at increasing the representation of women and minorities in the future of mathematics. Mathematical autobiographies
Several well known mathematicians have written autobiographies in part to explain to a general audience what it is about mathematics that has made them want to devote their lives to its study. These provide some of the best glimpses into what it means to be a mathematician. The following list contains some works that are not autobiographies, but rather essays on mathematics and mathematicians with strong autobiographical elements.
|
wikipedia
|
wiki_24404_chunk_2
|
Minimum bounding box algorithms
|
Three dimensions
In 1985, Joseph O'Rourke published a cubic-time algorithm to find the minimum-volume enclosing box of a 3-dimensional point set. O'Rourke's approach uses a 3-dimensional rotating calipers technique, and is based on lemmas characterizing the minimum enclosing box:
There must exist two neighbouring faces of the smallest-volume enclosing box which both contain an edge of the convex hull of the point set. This criterion is satisfied by a single convex hull edge collinear with an edge of the box, or by two distinct hull edges lying in adjacent box faces.
The other four faces need only contain a point of the convex hull. Again, the points which they contain need not be distinct: a single hull point lying in the corner of the box already satisfies three of these four criteria.
It follows in the most general case where no convex hull vertices lie in edges of the minimal enclosing box, that at least 8 convex hull points must lie within faces of the box: two endpoints of each of the two edges, and four more points, one for each of the remaining four box faces. Conversely, if the convex hull consists of 7 or fewer vertices, at least one of them must lie within an edge of the hull's minimal enclosing box.
|
wikipedia
|
wiki_28113_chunk_0
|
Paul Reilly (computer scientist)
|
Paul Reilly is a pioneer of virtual archaeology and data visualisation in archeology. He was a research scientist at the IBM UK Scientific Centre. He received his B.A. Honours degree in archaeology and history from the University of Leeds and his Ph.D in computer-based archaeological research, at the Research Centre for Computer Archaeology in North Staffordshire Polytechnic. He has worked on many archaeological excavation and field survey projects in Britain and elsewhere in Europe. From 1986 to 1989 he was an IBM UK Scientific Centre Research Fellow and became Research Scientist in 1989. He is currently a Visiting Research Fellow at the Archaeological Computing Research Group, University of Southampton. He has written many papers and a book, as well as editing several conference proceedings, books and journals relating to computer applications and art practice in archaeological research (see http://orcid.org/0000-0002-8067-8991).
|
wikipedia
|
wiki_29274_chunk_1
|
International Seismological Centre
|
Purpose
The main scientific goal of the Centre is the definitive compilation of earthquake information and the readings on which they are based. Collection of reports of earthquake effects is also an important part of its operation and the Centre recomputes the location and occurrence time of earthquakes worldwide, making use of all available information. Since 1957 the manipulation of the large volume of data has been mainly carried out by computer. Up until then ISS locations were determined manually with the help of a large globe. The ISC now uses a network of workstations accessing a relational database of nearly 50 Gbytes of online data.
|
wikipedia
|
wiki_33462_chunk_11
|
Computer-aided process planning
|
Traditional CAPP methods that optimize plans in a linear manner have not been able to satisfy the need for flexible planning, so new dynamic systems will explore all possible combinations of production processes, and then generate plans according to available machining resources. For example, K.S. Lee et al. states that "By considering the multi-selection tasks simultaneously, a specially designed genetic algorithm searches through the entire solution space to identify the optimal plan". See also
CAD, (computer-aided design)
CAM, (computer-aided manufacturing)
CIM, (computer-integrated manufacturing) References
|
wikipedia
|
wiki_10287_chunk_47
|
C Sharp (programming language)
|
Implementations
Microsoft is leading the development of the open-source reference C# compilers and set of tools. The first compiler, Roslyn, compiles into intermediate language (IL), and the second one, RyuJIT, is a JIT (just-in-time) compiler, which is dynamic and does on-the-fly optimization and compiles the IL into native code for the front-end of the CPU. RyuJIT is open source and written in C++. Roslyn is entirely written in managed code (C#), has been opened up and functionality surfaced as APIs. It is thus enabling developers to create refactoring and diagnostics tools. Two branches of official implementation are .NET Framework (closed-source, Windows-only) and .NET Core (open-source, cross-platform); they eventually converged into one open-source implementation: .NET 5.0. At .NET Framework 4.6, a new JIT compiler replaced the former.
|
wikipedia
|
wiki_32722_chunk_3
|
Pure (programming language)
|
Pure plug-ins are available for the Gnumeric spreadsheet and Miller Puckette's Pure Data graphical multimedia software, which make it possible to extend these programs with functions written in the Pure language. Interfaces are also provided as library modules to GNU Octave, OpenCV, OpenGL, the GNU Scientific Library, FAUST, SuperCollider, and liblo (for Open Sound Control (OSC)). Examples
The Fibonacci numbers (naive version):
|
wikipedia
|
wiki_14340_chunk_5
|
Four-valued logic
|
Applications
A four-valued logic was established by IEEE with the standard IEEE 1364: It models signal values in digital circuits. The four values are 1, 0, Z and X. 1 and 0 stand for boolean true and false, Z stands for high impedance or open circuit and X stands for don't care (e.g., the value has no effect). This logic is itself a subset of the 9-valued logic standard called IEEE 1164 and implemented in Very High Speed Integrated Circuit Hardware Description Language, VHDL's std_logic.
|
wikipedia
|
wiki_4663_chunk_30
|
Boyer–Moore string-search algorithm
|
def full_shift_table(S: str) -> List[int]:
"""
Generates F for S, an array used in a special case of the good suffix rule in the Boyer-Moore
string search algorithm. F[i] is the length of the longest suffix of S[i:] that is also a
prefix of S. In the cases it is used, the shift magnitude of the pattern P relative to the
text T is len(P) - F[i] for a mismatch occurring at i-1.
"""
F = [0 for c in S]
Z = fundamental_preprocess(S)
longest = 0
for i, zv in enumerate(reversed(Z)):
longest = max(zv, longest) if zv == i + 1 else longest
F[-i - 1] = longest
return F
|
wikipedia
|
wiki_1244_chunk_7
|
Miranda (programming language)
|
More general and powerful list-building facilities are provided by "list comprehensions" (previously known as "ZF expressions"), which come in two main forms: an expression applied to a series of terms, e.g.: squares = [ n * n | n <- [1..] ] (which is read: list of n squared where n is taken from the list of all positive integers) and a series where each term is a function of the previous one, e.g.: powers_of_2 = [ n | n <- 1, 2*n .. ]
|
wikipedia
|
wiki_22393_chunk_1
|
BB postcode area
|
|-
! style="background:#FFFFFF;"|BB0
| style="background:#FFFFFF;"|BLACKBURN
| style="background:#FFFFFF;"|Granby Marketing, Blackburn
| style="background:#FFFFFF;"|non-geographic
|-
! BB1
| BLACKBURN
| Blackburn (east), Bank Hey, Belthorn (part), Blackamoor, Clayton-le-Dale, Guide, Knuzden, Mellor, Ramsgreave, Rishton, Salesbury, Shadsworth, Sunnybower, Tottleworth, Whitebirk, Wilpshire
| Blackburn with Darwen, Hyndburn, Ribble Valley
|-
! BB2
| BLACKBURN
| Blackburn (west), Beardwood, Balderstone, Belthorn (part), Cherry Tree, Feniscowles, Griffin, Holly Tree, Livesey, Mellor, Mellor Brook, Mill Hill, Osbaldeston, Pleasington, Witton
| Blackburn with Darwen, Chorley, Ribble Valley, South Ribble
|-
! BB3
| DARWEN
| Darwen, Bank Fold, Eccleshill, Hoddlesden, Livesey, Lower Darwen, Pickup Bank, Tockholes
| Blackburn with Darwen
|-
! BB4
| ROSSENDALE
| Acre, Balladen, Bent Gate, Cloughfold, Cowpe, Crawshawbooth, Haslingden, Helmshore, Lumb (near Rawtenstall), Newchurch, Rawtenstall, Waterfoot, Weir
| Rossendale
|-
! BB5
| ACCRINGTON
| Accrington, Altham, Baxenden, Church, Clayton-le-Moors, Huncoat, Oswaldtwistle, Rising Bridge
| Hyndburn, Rossendale
|-
! BB6
| BLACKBURN
| Dinckley, Great Harwood, Langho
| Hyndburn, Ribble Valley
|-
! BB7
| CLITHEROE
| Clitheroe, Barrow, Bashall Eaves, Billington, Bolton-by-Bowland, Chatburn, Downham, Dunsop Bridge, Gisburn, Great Mitton, Grindleton, Hurst Green, Little Mitton, Middop, Newsholme, Newton-in-Bowland, Paythorne, Pendleton, Rimington, Sabden, Sawley, Slaidburn, Twiston, Waddington, Whalley, Whitewell, Wiswell, Worston
| Ribble Valley
|-
! BB8
| COLNE
| Colne, Foulridge, Laneshaw Bridge, Trawden, Winewall, Wycoller
| Pendle
|-
! BB9
| NELSON
| Nelson, Barrowford, Blacko, Brierfield, Higherford, Roughlee
| Pendle
|-
! BB10
| BURNLEY
| Burnley (east), Cliviger, Haggate, Harle Syke, Reedley, Worsthorne
| Burnley, Pendle
|-
! BB11
| BURNLEY
| Burnley (south and town centre), Dunnockshaw and Clowbridge, Hapton
| Burnley
|-
! BB12
| BURNLEY
| Burnley (west), Barley, Fence, Hapton, Higham, Padiham, Read, Simonstone, Wheatley Lane
| Burnley, Pendle, Ribble Valley
|-
! BB18
| BARNOLDSWICK
| Barnoldswick, Bracewell and Brogden, Earby, Kelbrook, Salterforth, Sough
| Pendle
|-
! style="background:#FFFFFF;"|BB94
| style="background:#FFFFFF;"|BARNOLDSWICK
| style="background:#FFFFFF;"|Holiday Cottages Group, Earby
| style="background:#FFFFFF;"|non-geographic
|}
|
wikipedia
|
wiki_27303_chunk_11
|
Loop-level parallelism
|
Example of loop-carried dependence where S1[i] ->T S1[i + 1], where i indicates the current iteration, and i + 1 indicates the next iteration. for (int i = 1; i < n; i ++) {
S1: a[i] = a[i - 1] + 1;
} Loop carried dependence graph A Loop-carried dependence graph graphically shows the loop-carried dependencies between iterations. Each iteration is listed as a node on the graph, and directed edges show the true, anti, and output dependencies between each iteration. Types
|
wikipedia
|
wiki_35060_chunk_3
|
Economics for Equity and the Environment Network
|
E3’s climate taskforce has contributed to the debates over the economics of global warming. Climate taskforce economists have testified before Congress and the European Parliament and presented their research at the American Association for the Advancement of Science (AAAS), the Pew Center on Global Climate Change, the American Economic Association, the United States Society for Ecological Economics (USSEE), and other venues. They have also participated in press conferences on climate policy organized by the NRDC, the Union of Concerned Scientists, the Southern Alliance for Clean Energy, and other organizations. The taskforce’s more recent project, Real Climate Economics.org, launched in May 2009.
|
wikipedia
|
wiki_27513_chunk_6
|
Stanford University School of Earth, Energy & Environmental Sciences
|
Research
Research programs in the SES continue to make groundbreaking discoveries about the planet, its environment, and human interactions. As a result, there are a number of industry funded-research groups (i.e.Stanford Exploration Project, Stanford Wave Physics Laboratory, Stanford Rock Physics and Borehole Geophysics Project) that implement student-led research for industry implementation.
|
wikipedia
|
wiki_2049_chunk_3
|
Power Stone
|
Characters
There are 10 characters in the original Power Stone:
is the main character of Power Stone. Aged 21 and weighing , Fokker measures and has a fighting style of boxing. He is the son of Pride Falcon (Pride Fokker in Japan), who is playable in Power Stone 2 after unlocking him. He is from Londo (a reference to London). When in Power Change, he is known as the Red Whirlwind. Falcon's Japanese name is a reference to the Fokker, the plane he is seen in. This was possibly removed in the English version because of the inappropriate puns that would follow. His Power Change is a similar hybrid to Iron Man.
is an aspiring chef and martial-artist from the town of Tong-An. Wang-Tang is age 19, weighs , measures . When Wang-Tang picks up an item, he says "lucky", where the other characters in Power Stone speak Japanese. Wang-Tang's Power Fusions resemble moves from a Super Saiyan from the Dragon Ball series, including moves based on Goku's Kamehameha and Spirit Bomb. He is known as the Agile Dragon when in Power Change.
is from the town of Mutsu (reference to Mutsu). Ryoma is age 19, weighs , measures . When in Power Change, he is known as the Master Swordsman which could be seen as a composite of the Silver Samurai and the Ronin Warriors.
is a travelling entertainer and kunoichi from the town of Oedo (reference to Edo). Ayame is age 16, weighs , measures . Her power drives and fusions involve shurikens. When in Power Change, she is known as the Cherry Blossom Dancer.
is a fortune teller from the town of Mahdad (reference to Baghdad). Rouge is age 23, weighs , measures and has a Gypsy Dancing fighting style. When in Power Change, she is known as the Scorching Beauty. Her design looks similar to Pullum from the Street Fighter EX series.
is a mysterious man whose body is covered in bandages. It is rumored that he could be around 40 years old, but the anime has mentioned he is over 100 years old. He weighs , measures , and has an original fighting style. He and Ryoma are the only two characters in the original Power Stone who wield a weapon. Jack is from the town of Manches (reference to Manchester). He is likely a reference to Jack the Ripper (a paper in his ending calls him "Jack the Slayer"). When in Power Change, he is known as the Mad Clown.
is from the town of Dawnvolta. He is age 38, weighs , measures . When in Power Change, he is known as the Heavy Tank which bears a resemblance to The Thing from Marvel Comic's Fantastic Four. He shares a name with a character from Capcom's Saturday Night Slam Masters.
is from the town of Dullstown. Galuda is age 34, weighs , measures . When in Power Fusion, he is known as the Proud Eagle, in which he looks similar to a totem pole. His appearance is similar to that of T. Hawk from the game Super Street Fighter II.
is a pirate from Power Stone. He, like Valgas, is an unlockable character. Kraken is from a pirate ship in Skull Haven. Kraken's age is unknown, weighs , measures and has a buccaneer fighting style. When in Power Change, he is known as Ghost Pirate. His name is a reference to the kraken, along with his nickname, King Octopus.
is a character from Power Stone. He is from the island of Avalon Island. Valgas's age is unknown, weighs , measures and has a wrestling fighting style. He is a very powerful character and is quite fast. When defeated, he transforms into the final boss of the game, Final Valgas. His name may be a reference to Vulgus, Capcom's first game.
|
wikipedia
|
wiki_25108_chunk_6
|
Virginia Modeling, Analysis and Simulation Center
|
In October, organizers of the future center put together a status report that described an effort to develop a computer simulation demonstration project that could be used to illustrate the sophistication and significance of next generation computer modeling and simulation technologies. The project was to address a research area rich enough to include modeling both physical and economic processes with several separate, but interrelated entities. The problem ideally suited for this demonstration was the investigation of ways to enhance the control and management of the fl ow of commercial goods through the Port of Hampton Roads. With this demonstration project, the organizers were expanding the depth of research opportunities for the Center while making the Center a valuable resource for solving problems affecting the economy in the region. It was obvious the Commonwealth needed to get involved. It was equally apparent ODU needed to begin thinking beyond the short courses to approach the state with any budgetary requests in support of this new endeavor.
|
wikipedia
|
wiki_30494_chunk_12
|
Manned Space Flight Network
|
Another critical step in the
evolution of the Apollo Network came in 1965 with the advent
of the DSN Wing concept. Originally, the participation of
DSN 26-m antennas during an Apollo Mission was to be limited
to a backup role. This was one reason why the MSFN 26-m
sites were collocated with the DSN sites at Goldstone, Madrid,
and Canberra. However, the presence of two, well-separated
spacecraft during lunar operations stimulated the rethinking
of the tracking and communication problem. One thought was
to add a dual S-band RF system to each of the three 26-m
MSGN antennas, leaving the nearby DSN 26-m antennas still in
a backup role. Calculations showed, though, that a 26-m
antenna pattern centered on the landed Lunar Module would
suffer a 9-to-12 db loss at the lunar horizon, making tracking
and data acquisition of the orbiting Command Service
Module difficult, perhaps impossible. It made sense to
use both the MSFN and DSN antennas simultaneously during the
all-important lunar operations. JPL was naturally reluctant
to compromise the objectives of its many unmanned spacecraft
by turning three of its DSN stations over to the MSFN for
long periods. How could the goals of both Apollo and deep
space exploration be achieved without building a third 26-m
antenna at each of the three sites or undercutting planetary
science missions?
The solution came in early 1965 at a meeting at NASA
Headquarters, when Eberhardt Rechtin suggested what is now
known as the "wing concept". The wing approach involves
constructing a new section or "wing" to the main building at
each of the three involved DSN sites. The wing would include
a MSFN control room and the necessary interface equipment
to accomplish the following:
1. Permit tracking and two-way data transfer with either
spacecraft during lunar operations.
2. Permit tracking and two-way data transfer with the
combined spacecraft during the flight to the Moon
3. Provide backup for the collocated MSFN site passive
track (spacecraft to ground RF links) of the Apollo
spacecraft during trans-lunar and trans-earth phases.
With this arrangement, the DSN station could be quickly
switched from a deep-space mission to Apollo and back again.
GSFC personnel would operate the MSFN equipment completely
independently of DSN personnel. Deep space missions would
not be compromised nearly as much as if the entire station's
equipment and personnel were turned over to Apollo for several
weeks.
|
wikipedia
|
wiki_23854_chunk_31
|
Soviet biological weapons program
|
An outbreak of weaponized smallpox occurred during testing in 1971. General Professor Peter Burgasov, former Chief Sanitary Physician of the Soviet Army, and a senior researcher within the program of biological weapons described this incident:
“On Vozrozhdeniya Island in the Aral Sea, the strongest formulations of smallpox were tested. Suddenly, I was informed that there were mysterious cases of mortalities in Aralsk. A research ship of the Aral fleet had come within 15 km from the island (it was forbidden to come any closer than 40 km). The lab technician of this ship took samples of plankton twice a day from the top deck. The smallpox formulation— 400 gr. of which was exploded on the island—”got her”, and she became infected. After returning home to Aralsk, she infected several people, including children. All of them died. I suspected the reason for this and called the General Chief of Staff at the Ministry of Defense and requested to forbid the Alma-Ata train from stopping in Aralsk. As a result, an epidemic throughout the country was prevented. I called Andropov, who at that time was the Chief of the KGB, and informed him of the unique formulation of smallpox obtained on Vozrozhdeniya Island.”
|
wikipedia
|
wiki_551_chunk_19
|
Sorting algorithm
|
Popular sorting algorithms
While there are a large number of sorting algorithms, in practical implementations a few algorithms predominate. Insertion sort is widely used for small data sets, while for large data sets an asymptotically efficient sort is used, primarily heapsort, merge sort, or quicksort. Efficient implementations generally use a hybrid algorithm, combining an asymptotically efficient algorithm for the overall sort with insertion sort for small lists at the bottom of a recursion. Highly tuned implementations use more sophisticated variants, such as Timsort (merge sort, insertion sort, and additional logic), used in Android, Java, and Python, and introsort (quicksort and heapsort), used (in variant forms) in some C++ sort implementations and in .NET.
|
wikipedia
|
wiki_16718_chunk_1
|
Grammatical evolution
|
As in any other GP approach, the objective is to find an executable program, program fragment, or function, which will achieve a good fitness value for a given objective function. In most published work on GP, a LISP-style tree-structured expression is directly manipulated, whereas GE applies genetic operators to an integer string, subsequently mapped to a program (or similar) through the use of a grammar, which is typically expressed in Backus–Naur form. One of the benefits of GE is that this mapping simplifies the application of search to different programming languages and other structures. Problem addressed
|
wikipedia
|
wiki_6234_chunk_1
|
Computer network naming scheme
|
Airport code example:
lax-001
lax-002
arn-001 City-State-Nation example:
3-character unique numeric number
2-character production/development classifier
3-character city ID
2-character state/province/region ID
2-character nation ID Thus, a production server in Minneapolis, Minnesota would be nnn.ps.min.mn.us.example.com, or a development server in Vancouver, BC, would be nnn.ds.van.bc.ca.example.com.
|
wikipedia
|
wiki_20073_chunk_10
|
Database administration
|
Third party support for database container images has grown, including MongoDB, PostgreSQL, MySQL from Oracle, and Microsoft SQL Server from Microsoft, and from independent port's of docker (software) from Windocks Kubernetes, and the development of the Kubernetes Operator pattern by CoreOS, further extended the ability to orchestrate database container. Kubernetes Operators have been used by third parties to enable the ability to automate database administration, including deployment of instances of a database, upgrade database versions, or perform backups.
Newer technologies such as Stratavia's Data Palette suite and GridApp Systems Clarity have begun to increase the automation of databases causing the reduction of database related tasks. However at best this only reduces the amount of mundane, repetitive activities and does not eliminate the need for DBAs. The intention of DBA automation is to enable DBAs to focus on more proactive activities around database architecture, deployment, performance and service level management.
|
wikipedia
|
wiki_11376_chunk_5
|
In-system programming
|
History
Starting from the early ‘90s we witnessed an important technological evolution in the architecture of the microcontrollers. At first, they were realized in two possible solutions: with OTP (One Time Programmable) or with EPROM memories. In these technologies, memory-erasing process requires the chip to be exposed to ultraviolet light through a specific window above the package. In 1993 Microchip Technology introduced the first microcontroller with EEPROM memory: the PIC16C84. EEPROM memories can be electrically erased. This feature allowed to lower the realization costs by removing the erasing window above the package and initiate In-System Programming technology. With ISP flashing process can be performed directly on the board at the end of the production process. This evolution gave the possibility to unify the programming and functional test phase and in production environments and to start the preliminary production of the boards even if the firmware development has not yet been completed. This way it was possible to correct bugs or to make changes at a later time. In the same year, Atmel developed the first microcontroller with Flash memory, easier and faster to program and with much longer life cycle compared to EEPROM memories.
|
wikipedia
|
wiki_16497_chunk_7
|
Howard Purcell
|
Adventure Comics #53–62 (1940–1941)
All-American Comics #25–48, 50, 89–94, 97, 99, 101 (1941–1948)
All-American Men of War #13, 17 (1954–1955)
All Star Comics #42–46, 48–49, 51, 55 (1948–1950)
The Brave and the Bold #51 (Aquaman and Hawkman) (1963)
Comic Cavalcade #4–6, 15–29 (1943–1948)
Doom Patrol #86 (1964)
Falling in Love #96 (1968)
Gang Busters #16, 29, 40, 47, 52, 54–57, 59, 64 (1950–1958)
Girls' Love Stories #131, 133 (1967–1968)
Girls' Romances #160 (1971)
Green Lantern #26–27 (1947)
Heart Throbs #112 (1968)
House of Mystery #2–5, 7–8, 25–26, 29–30, 32, 35, 38–39, 43, 47, 68–69, 73, 77–78, 80–81, 87, 92–94, 97–98, 100, 103, 106, 112, 119–120, 122–123, 125–126, 128–129, 140 (1952–1964)
House of Secrets #6, 11, 14, 17, 20–21, 27, 31–32, 35, 37–39, 41, 44–45, 49, 52–53, 55–57, 59 (1957–1963)
Mr. District Attorney #6–59 (1948–1957)
My Greatest Adventure #29, 33, 35–36, 38, 40, 44, 53–54, 58–59, 62–63, 66, 68, 70–71, 75, 78–79, 84 (1959–1963)
Mystery in Space #1, 96–101, 103 (1951–1965)
Our Army at War #27, 29 (1954)
Sea Devils #16–33 (1964–1967)
Sensation Comics #1–13, 15–33 (Gay Ghost) (1942–1944)
Strange Adventures #10, 164, 166, 171, 184, 187, 191, 197, 200 (1951–1967)
Tales of the Unexpected #1, 3, 22, 25–26, 28–29, 31, 33–34, 38, 40, 43, 45, 47, 51, 54–56, 59–63, 65, 67–68, 72, 81, 83–85, 92, 98 (1956–1966)
The Unexpected #106 (1968)
Weird Mystery Tales #1–3 (1972)
World's Best Comics #1 (1941)
World's Finest Comics #2–3 (1941)
Young Romance #153 (1968)
|
wikipedia
|
wiki_3701_chunk_2
|
USC Viterbi School of Engineering
|
Major research centers
Alfred Mann Institute – business incubator for medical device development in preparation for commercialization
Center for Biomimetic Microelectronic Systems – National Science Foundation Engineering Research Center
Center for Risk and Economic Analysis of Terrorism Events (CREATE) – interdisciplinary national research center funded by the U.S. Department of Homeland Security
Center for Systems and Software Engineering (CSSE) – research the relationship between systems, software, and users.
Information Sciences Institute (housed at a separate facilities in Marina del Rey, California and Arlington, Virginia) – played a major role in the development of the Internet, and continues to be a major research center in computer science
Institute for Creative Technologies – conducts research in virtual reality and immersive digital environment
Integrated Media Systems Center – National Science Foundation's Exclusive Engineering Research Center for multimedia and Internet research
Pacific Earthquake Engineering Research Center (PEER) Partner Institution – Current Research
|
wikipedia
|
wiki_3840_chunk_5
|
Lists of mathematics topics
|
Geometry is initially the study of spatial figures like circles and cubes, though it has been generalized considerably. Topology developed from geometry; it looks at those properties that do not change even when the figures are deformed by stretching and bending, like dimension.
Glossary of differential geometry and topology
Glossary of general topology
Glossary of Riemannian and metric geometry
Glossary of scheme theory
List of algebraic geometry topics
List of algebraic surfaces
List of algebraic topology topics
List of cohomology theories
List of circle topics
List of topics related to pi
List of curves topics
List of differential geometry topics
List of general topology topics
List of geometric shapes
List of geometric topology topics
List of geometry topics
List of knot theory topics
List of Lie group topics
List of mathematical properties of points
List of topology topics
List of topologies
Topological property
List of triangle topics
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.