id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_23028_chunk_4
|
Programming productivity
|
As long classical production processes are considered a straightforward metric of productivity is simple: how many units of a product of specified quality is produced by which costs. For intellectual work, productivity is much trickier. How do we measure the productivity of authors, scientists, or engineers? Due to the rising importance of knowledge work (as opposed to manual work), many researchers tried to develop productivity measurement means that can be applied in a non-manufacturing context. It is commonly agreed that the nature of knowledge work fundamentally differs from manual work and, hence, factors besides the simple output/input ratio need to be taken into account, e.g. quality, timeliness, autonomy, project success, customer satisfaction and innovation. However, the research communities in neither discipline have been able to establish broadly applicable and accepted means for productivity measurement yet. The same holds for more specific area of programming productivity.
|
wikipedia
|
wiki_20589_chunk_2
|
Double exponential function
|
A sequence of positive integers (or real numbers) is said to have doubly exponential rate of growth if the function giving the th term of the sequence is bounded above and below by doubly exponential functions of .
Examples include
The Fermat numbers
The harmonic primes: The primes p, in which the sequence exceeds 0, 1, 2, 3, …The first few numbers, starting with 0, are 2, 5, 277, 5195977, ...
The Double Mersenne numbers
The elements of Sylvester's sequence where E ≈ 1.264084735305302 is Vardi's constant .
The number of k-ary Boolean functions:
The prime numbers 2, 11, 1361, ... where A ≈ 1.306377883863 is Mills' constant.
|
wikipedia
|
wiki_4013_chunk_2
|
Approximation algorithm
|
There is widespread interest in theoretical computer science to better understand the limits to which we can approximate certain famous optimization problems. For example, one of the long-standing open questions in computer science is to determine whether there is an algorithm that outperforms the 1.5 approximation algorithm of Christofides to the metric traveling salesman problem. The desire to understand hard optimization problems from the perspective of approximability is motivated by the discovery of surprising mathematical connections and broadly applicable techniques to design algorithms for hard optimization problems. One well-known example of the former is the Goemans–Williamson algorithm for maximum cut, which solves a graph theoretic problem using high dimensional geometry.
|
wikipedia
|
wiki_296_chunk_56
|
Integrated Services Digital Network
|
10:50:24.37 21/1/24 T SETUP
Call Reference : 000062-local
Bearer Capability : CCITT, Speech, Circuit mode, 64 kbit/s
Channel ID : Implicit Interface ID implies current span, 21/1/5, Exclusive
Calling Party Number : 8018023000 National number User-provided, not screened Presentation allowed
Called Party Number : 3739120 Type: SUBSCRB
0000 00 01 a4 b8 08 02 00 3e 05 04 03 80 90 a2 18 03 .......>........
0010 a9 83 85 6c 0c 21 80 38 30 31 38 30 32 33 30 30 ...l.!.801802300
0020 30 70 08 c1 33 37 33 39 31 32 30 0p..3739120
|
wikipedia
|
wiki_31884_chunk_4
|
Polyhedral combinatorics
|
A key tool in polyhedral combinatorics is the ƒ-vector of a polytope, the vector (f0, f1, ..., fd − 1) where fi is the number of i-dimensional features of the polytope. For instance, a cube has eight vertices, twelve edges, and six facets, so its ƒ-vector is (8,12,6). The dual polytope has a ƒ-vector with the same numbers in the reverse order; thus, for instance, the regular octahedron, the dual to a cube, has the ƒ-vector (6,12,8). Configuration matrices include the f-vectors of regular polytopes as diagonal elements.
|
wikipedia
|
wiki_22800_chunk_12
|
BLAT (bioinformatics)
|
Output
A BLAT search returns a list of results that are ordered in decreasing order based on the score. The following information is returned: the score of the alignment, the region of query sequence that matches to the database sequence, the size of the query sequence, the level of identity as a percentage of the alignment and the chromosome and position that the query sequence maps to. Bhagwat et al. describe how the BLAT "Score" and "Identity" measures are calculated.
|
wikipedia
|
wiki_32780_chunk_1
|
Biological Resources Discipline
|
General principles
The following are "general principles" the BRD states guide the implementation of its mission and form the basis of its strategic planning:
BRD develops scientific and statistically reliable methods and protocols to assess the status and trends of the United States's biological resources.
BRD utilizes tools from the biological, physical, and social sciences to understand the causes of biological and ecological trends and to predict the ecological consequences of management practices.
BRD leads in the development and use of the technologies needed to synthesize, analyze, and disseminate biological and ecological information.
BRD strives for quality, integrity, and credibility of its research and technology by constantly improving its scientific programs through internal quality control, external peer review, and competitive funding.
BRD enters into partnerships with scientific collaborators to produce high-quality scientific information and partnerships with the users of scientific information to ensure this information's relevance and application to real problems.
BRD provides reliable scientific information to all American citizens while recognizing a special obligation to serve the biological information needs of Department of the Interior bureaus.
|
wikipedia
|
wiki_8869_chunk_69
|
Indian mathematics
|
Use of rectification (computation of length) of the arc of a circle to give a proof of these results. (The later method of Leibniz, using quadrature, i.e. computation of area under the arc of the circle, was not used.)
Use of the series expansion of to obtain the Leibniz formula for π:
A rational approximation of error for the finite sum of their series of interest. For example, the error, , (for n odd, and i = 1, 2, 3) for the series:
Manipulation of error term to derive a faster converging series for :
Using the improved series to derive a rational expression, 104348/33215 for π correct up to nine decimal places, i.e. 3.141592653.
Use of an intuitive notion of limit to compute these results.
A semi-rigorous (see remark on limits above) method of differentiation of some trigonometric functions. However, they did not formulate the notion of a function, or have knowledge of the exponential or logarithmic functions.
|
wikipedia
|
wiki_1941_chunk_8
|
Self-modifying code
|
Below is an example in Zilog Z80 assembly language. The code increments register "B" in range [0,5]. The "CP" compare instruction is modified on each loop.
;==========
ORG 0H
CALL FUNC00
HALT
;==========
FUNC00:
LD A,6
LD HL,label01+1
LD B,(HL)
label00:
INC B
LD (HL),B
label01:
CP $0
JP NZ,label00
RET
;==========
Self-modifying code is sometimes used to overcome limitations in a machine's instruction set. For example, in the Intel 8080 instruction set, one cannot input a byte from an input port that is specified in a register. The input port is statically encoded in the instruction itself, as the second byte of a two byte instruction. Using self-modifying code, it is possible to store a register's contents into the second byte of the instruction, then execute the modified instruction in order to achieve the desired effect.
|
wikipedia
|
wiki_11063_chunk_11
|
Shunting-yard algorithm
|
{| class="wikitable"
! Token !! Action !! Output =(in RPN) !! Operatorstack !! Notes
|-
| align="center" | sin || Push token to stack || || align="right" | sin ||
|-
| align="center" | ( || Push token to stack || || align="right" | ( sin ||
|-
| align="center" | max || Push token to stack || || align="right" | max ( sin ||
|-
| align="center" | ( || Push token to stack || || align="right" | ( max ( sin ||
|-
| align="center" | 2 || Add token to output || 2 || align="right" | ( max ( sin ||
|-
| align="center" | , || Ignore || 2 || align="right" | ( max ( sin ||
|-
| align="center" | 3 || Add token to output || 2 3 || align="right" | ( max ( sin ||
|-
| align="center" rowspan="3' | ) || Pop stack to output || 2 3 || align="right" | ( max ( sin || Repeated until "(" is at the top of the stack
|-
| Pop stack || 2 3 || align="right" | max ( sin ||Discarding matching parentheses
|-
| Pop stack to output || 2 3 max || align="right" | ( sin || Function at top of the stack
|-
| align="center" | ÷ || Push token to stack || 2 3 max || align="right" | ÷ ( sin ||
|-
| align="center" | 3 || Add token to output || 2 3 max 3 || align="right" | ÷ ( sin ||
|-
| align="center" rowspan="2" | × || Pop stack to output || 2 3 max 3 ÷ || align="right" | ( sin ||
|-
| Push token to stack || 2 3 max 3 ÷ || align="right" | × ( sin ||
|-
| align="center" | || Add token to output || 2 3 max 3 ÷ || align="right" | × ( sin ||
|-
| align="center" rowspan="3" | ) || Pop stack to output || 2 3 max 3 ÷ × || align="right" | ( sin ||Repeated until "(" is at the top of the stack
|-
| Pop stack || 2 3 max 3 ÷ × || align="right" | sin ||Discarding matching parentheses
|-
| Pop stack to output|| 2 3 max 3 ÷ × sin|| ||Function at top of the stack
|-
| align="center" | end || Pop entire stack to output || 2 3 max 3 ÷ × sin || ||
|}
|
wikipedia
|
wiki_13913_chunk_6
|
Computational phylogenetics
|
Morphological analysis
The basic problem in morphological phylogenetics is the assembly of a matrix representing a mapping from each of the taxa being compared to representative measurements for each of the phenotypic characteristics being used as a classifier. The types of phenotypic data used to construct this matrix depend on the taxa being compared; for individual species, they may involve measurements of average body size, lengths or sizes of particular bones or other physical features, or even behavioral manifestations. Of course, since not every possible phenotypic characteristic could be measured and encoded for analysis, the selection of which features to measure is a major inherent obstacle to the method. The decision of which traits to use as a basis for the matrix necessarily represents a hypothesis about which traits of a species or higher taxon are evolutionarily relevant. Morphological studies can be confounded by examples of convergent evolution of phenotypes. A major challenge in constructing useful classes is the high likelihood of inter-taxon overlap in the distribution of the phenotype's variation. The inclusion of extinct taxa in morphological analysis is often difficult due to absence of or incomplete fossil records, but has been shown to have a significant effect on the trees produced; in one study only the inclusion of extinct species of apes produced a morphologically derived tree that was consistent with that produced from molecular data.
|
wikipedia
|
wiki_4548_chunk_3
|
Persistent data structure
|
Techniques for preserving previous versions Copy-on-write
One method for creating a persistent data structure is to use a platform provided ephemeral data structure such as an array to store the data in the data structure and copy the entirety of that data structure using copy-on-write semantics for any updates to the data structure. This is an inefficient technique because the entire backing data structure must be copied for each write, leading to worst case O(n·m) performance characteristics for m modifications of an array of size n.
|
wikipedia
|
wiki_35736_chunk_10
|
Technological innovation system
|
Dynamics
Structures involve elements that are relatively stable over time. Nevertheless, for many technologies, especially newly emerging ones, these structures are not yet (fully) in place. For this reason, mostly, the scholars have recently enriched the literature on Technological Innovation Systems with studies that focus on the build-up of structures over time. The central idea of this approach is to consider all activities that contribute to the development, diffusion, and use of innovations as system functions. These system functions are to be understood as types of activities that influence the build-up of a Technological Innovation System. Each system function may be ‘fulfilled’ in a variety of ways. The premise is that, in order to properly develop, the system should positively fulfil all system functions. Various ‘lists’ of system functions have been constructed. Authors like Bergek et al., Hekkert et al., Negro and Suurs give useful overviews. These lists show much overlap and differences reside mostly in the particular way of clustering activities. An example of such a list is provided below.
|
wikipedia
|
wiki_1145_chunk_10
|
Poker probability
|
{| class="wikitable" style="font-size: 95%; text-align:center;"
|-
!Hand !! Frequency !! Probability !! Cumulative !! Odds against
!Mathematical expression of absolute frequency
|-
|Royal flush
|align=center| 4,324 || 0.0032% || 0.0032% ||align=center| 30,939 : 1
|
|-
|Straight flush (excluding royal flush)
|align=center| 37,260 || 0.0279% || 0.0311% ||align=center| 3,589.6 : 1
|
|-
|Four of a kind
|align=center| 224,848 || 0.168% || 0.199% ||align=center| 594 : 1
|
|-
|Full house
|align=center| 3,473,184 || 2.60% || 2.80% ||align=center| 37.5 : 1
|
|-
|Flush (excluding royal flush and straight flush)
|align=center| 4,047,644 || 3.03% || 5.82% ||align=center| 32.1 : 1
|
|-
|Straight (excluding royal flush and straight flush)
|align=center| 6,180,020 || 4.62% || 10.4% ||align=center| 20.6 : 1
|
|-
|Three of a kind
|align=center| 6,461,620 || 4.83% || 15.3% ||align=center| 19.7 : 1
|
|-
|Two pair
|align=center| 31,433,400 || 23.5% || 38.8% ||align=center| 3.26 : 1
|
|-
|One pair
|align=center| 58,627,800 || 43.8% || 82.6% ||align=center| 1.28 : 1
|
|-
|No pair / High card
|align=center| 23,294,460 || 17.4% || 100% ||align=center| 4.74 : 1
|
|-
! Total
! align="center" | 133,784,560 !! 100% !! --- !! align="center" | 0 : 1
!
|}
|
wikipedia
|
wiki_24226_chunk_5
|
The New York Journal of Mathematics
|
In a professional conference presentation, Renzo Piccinini said "An example of what I consider a good electronic journal is the New York Journal of Mathematics; this is a refereed journal--with referees not in the editor's board—with high quality papers and very fast publication time; last, but not least, it is free!" See also
List of journals available free online
List of scientific journals in mathematics Notes External links
Official site
Listing in the Directory of Open Access Journals
"Dual Presentation with Math from One Source", Abstract of proposed talk for the TUG Meeting in San Diego, July 2007 by William F. Hammond
|
wikipedia
|
wiki_262_chunk_3
|
List of historical films set in Near Eastern and Western civilization
|
{| class="wikitable sortable"
|-
! scope="col" | Title
! scope="col" | Release date
! scope="col" | Time period
! scope="col" class="unsortable" | Notes on setting
|-
| Spotlight || 2015 || 2001 || The Boston Globe'''s investigative story on the Sexual abuse scandal in the Catholic archdiocese of Boston and the September 11 attacks
|-
| World Trade Center || 2006 || 2001 || September 11 attacks
|-
|United 93 || 2006 ||2001 || September 11 attacks
|-
| Flight 93 || 2006 || 2001 || September 11 attacks
|-
|Zero Dark Thirty || 2012 || 2001–2012 || The finding and assassination of Osama Bin Laden
|-
|Moneyball (film) || 2011 || 2002 || Based on Michael Lewis's 2003 nonfiction book of the same name, an account of the Oakland Athletics baseball team's 2002 season and their general manager Billy Beane's attempts to assemble a competitive team.
|-
| The Social Network || 2010 || 2003–2007 || The founding of the social networking service-website Facebook
|-
| 127 Hours || 2010 || April 2003 || The true story about Aron Ralston, a mountain climber who had his arm trapped by a boulder while climbing in an isolated slot canyon in Utah.
|-
| The Impossible || 2012 || 2004 || The 2004 Indian Ocean tsunami, from the viewpoint of a tourist family in Thailand
|-
| The Hurt Locker || 2008 || 2004 || the Iraq War, just before the 2004 Indian Ocean tsunami
|-
| Lone Survivor || 2013 || 2005 || Based on the 2007 non-fiction book of the same name about Operation Red Wings by Marcus Luttrell and Patrick Robinson
|-
| The Big Short || 2015 || 2005–2008 || Based on the 2010 book of the same name, about numerous financial experts who predict and proceed to take advantage of the 2008 financial meltdown
|-
| The Fifth Estate || 2013 || 2007–2010 || About Julian Assange and the foundation of his news-leaking site WikiLeaks
|-
| Too Big to Fail || 2011 || 2008 || The 2008 financial meltdown
|-
| Million Dollar Arm || 2014 || 2008 || the story of Indian baseball pitchers Rinku Singh and Dinesh Patel
|-
| Sully || 2016 || 2009 || the story of Captain Chesley "Sully" Sullenberger and the aftermath of US Airways Flight 1549
|-
| Captain Phillips || 2013 || 2009 || Kidnapping of merchant mariner Richard Phillips by Somalian pirates
|-
| Deepwater Horizon || 2016 || 2010 || Deepwater Horizon explosion
|-
| 13 Hours: The Secret Soldiers of Benghazi || 2016 || 2012 || 2012 Benghazi attack: During an attack on a U.S. compound in Benghazi, Libya, a security team struggles to make sense out of the chaos.
|-
| Daniel || 2019 || 2013–2014 || the experiences of Daniel Rye who was held hostage by ISIS for 13 months
|-
|Uncut Gems|2019
|2012
|Kevin Garnett's performance in the 2012 NBA Eastern Conference Semi-finals
|-
| Patriots Day || 2016 || 2013 || The Boston Marathon Bombing.
|-
| Operation Red Sea || 2018 || 2015 || The People's Liberation Army Navy entered the Yemeni Civil War and the International military intervention against ISIL.
|}
|
wikipedia
|
wiki_445_chunk_37
|
Probability distribution
|
Basic distributions:
Bernoulli distribution, for the outcome of a single Bernoulli trial (e.g. success/failure, yes/no)
Binomial distribution, for the number of "positive occurrences" (e.g. successes, yes votes, etc.) given a fixed total number of independent occurrences
Negative binomial distribution, for binomial-type observations but where the quantity of interest is the number of failures before a given number of successes occurs
Geometric distribution, for binomial-type observations but where the quantity of interest is the number of failures before the first success; a special case of the negative binomial distribution
Related to sampling schemes over a finite population:
Hypergeometric distribution, for the number of "positive occurrences" (e.g. successes, yes votes, etc.) given a fixed number of total occurrences, using sampling without replacement
Beta-binomial distribution, for the number of "positive occurrences" (e.g. successes, yes votes, etc.) given a fixed number of total occurrences, sampling using a Pólya urn model (in some sense, the "opposite" of sampling without replacement)
|
wikipedia
|
wiki_34001_chunk_18
|
Streaming algorithm
|
Calculating
Alon et al. estimates by defining random variables that can be computed within given space and time. The expected value of random variables gives the approximate value of . Assume length of sequence m is known in advance. Then construct a random variable X as follows:
Select be a random member of sequence with index at ,
Let , represents the number of occurrences of within the members of the sequence following .
Random variable . Assume S1 be of the order and S2 be of the order . Algorithm takes S2 random variable and outputs the median . Where is the average of where 1 ≤ j ≤ S1. Now calculate expectation of random variable .
|
wikipedia
|
wiki_27723_chunk_22
|
Mathieu group M24
|
The sextet group is a split extension of H by a group 3.S6 (a stem extension). Here is an instance within the Mathieu groups where a simple group (A6) is a subquotient, not a subgroup. 3.S6 is the normalizer in M24 of the subgroup generated by r=(BCD)(FGH)(JKL)(NOP)(RST)(VWX), which can be thought of as a multiplication of row numbers by u2. The subgroup 3.A6 is the centralizer of . Generators of 3.A6 are:
(AEI)(BFJ)(CGK)(DHL)(RTS)(VWX) (rotating first 3 columns)
(AQ)(BS)(CT)(DR)(EU)(FX)(GV)(HW)
(AUEIQ)(BXGKT)(CVHLR)(DWFJS) (product of preceding two)
(FGH)(JLK)(MQU)(NRV)(OSW)(PTX) (rotating last 3 columns).
An odd permutation of columns, say (CD)(GH)(KL)(OP)(QU)(RV)(SX)(TW), then generates 3.S6.
|
wikipedia
|
wiki_7217_chunk_8
|
After Dark (software)
|
Modules
{| class="wikitable"
|-
! scope="col" style="background:#efefef;" | Module Name
! scope="col" style="background:#efefef;" | Description
|-
| Starry Night
| The original After Dark screen saver, featuring a pixelated city skyline under a night sky
|-
| Artist
| A digital artist applies artistic touches to images in a slow manner so one can see the artist work
|-
| Bad Dog
| Popular module featuring a white dog with a black ring around one of his eyes, causing trouble on the desktop (the animated series Bad Dog was inspired by the eponymous screensaver)
|-
| Bad Dog!
| A sequel to Bad Dog with new animations and sequences
|-
| Bogglins
| Green slime creatures are formed and make obnoxious noises
|-
| Boris
| The opposite of Bad Dog, a good cat plays on the desktop and chases butterflies
|-
| Bouncing Ball
| A ball bounces around the screen, including bouncing off the edges
|-
| Bugs
| Digital bugs crawl across the screen
|-
| Bulge
| Expands portions of the screen, making the screen appear to have a "bulge"
|-
| Bungee Roulette
| Various characters bungee-jump from the top of the screen, but occasionally the bungee cord breaks
|-
| Can of Worms
| "Worms" emerge from the screen, crawl around, and "eat" the screen content
|-
| Chameleon
| Chameleons walk across the screen, changing colors and eating icons
|-
| Clocks
| Different objects appear as a clock and move around
|-
| Coming Soon!
| A salesperson pitches fictitious "products"
|-
| Confetti Factory
| Confetti falls from the top of the screen and onto conveyor belts below
|-
| Daredevil Dan
| A daredevil motorcyclist attempts dangerous jumps over school buses, flames, and piranha tanks
|-
| Dominoes
| A game of dominoes is played on the screen
|-
| Doodles
| Draws doodle-like images
|-
| DOS Shell
| A mock DOS shell is run on the screen, reliving earlier days of computing
|-
| Dots
| A game of "dots" is played on the screen
|-
| Down the Drain
| The desktop appears to spiral down a drain
|-
| Einstein
| Complex mathematical and scientific equations are performed on the screen
|-
| Fade Away
| The desktop fades away in different ways
|-
| Fish! (Aquatic Realm)
| Underwater world of fish with a black background
|-
| Fish Pro
| An updated version of Fish!
|-
| Fish World
| The third iteration of Fish! with prerendered 3D models
|-
| Floating Suns
| Displays the Phoenix Suns basketball team's logos floating around the screen
|-
| Flocks
| Displays flocks of various creatures on the screen
|-
| Flying Toasters
| Classic module featuring flying toasters
|-
| Flying Toasters Pro
| Updated version that allows one to select more than flying toasters and also has music
|-
| Flying Toasters!
| 4.0 iteration of the flying toasters with updated graphics and music — introduces baby toasters
|-
| Flying Toilets
| Parody of Flying Toasters with toilets replacing the toasters
|-
| Fractal Forest
| A forest of trees is generated on the screen
|-
| FrankenScreen
| A digital Frankenstein creates creatures out of various parts
|-
| Frost and Fire
| Produces patterns similar to splattering paint on paper
|-
| GeoBounce
| A geometrical figure bounces around the screen
|-
| Globe
| Takes an image and wraps it around a sphere, then spins like a globe
|-
| GraphStat
| Draws scientific and mathematical graphs on the screen
|-
| Gravity
| Circles bounce around the screen
|-
| Guts
| Gravity simulation
|-
| Hall of Fame
| 10th anniversary module featuring anime-style recreations of various After Dark characters
|-
| Hall of Mirrors
| Reflects parts of the screen in an infinite mirror style
|-
| Hallucinations
| The computer "hallucinates"
|-
| Hard Rain
| Rain falls onto the desktop
|-
| Hula Twins
| Displays two animated figures who walk around and twirl hula hoops
|-
| Lasers
| Lasers create patterns on the screen
|-
| Lissajous
| Displays Lissajous designs
|-
| Logo
| User-supplied image moves randomly on screen
|-
| Lunatic Fringe
| A playable space shooter game within a module
|-
| Magic
| Creates soothing patterns
|-
| Mandelbrot
| Generates a mathematically created Mandelbrot set
|-
| Marbles
| Marbles bounce around the screen
|-
| Meadow
| A computer-generated meadow
|-
| Message Mayhem
| A figure on the screen scrawls out a message
|-
| Messages
| Displays a crawling marquee message on the screen with selectable font and text colors
|-
| Mike's So-called Life
| Features a man named Mike, living in his apartment and doing nothing exciting
|-
| Mime Hunt
| A playable module that features a mime and cross-hairs
|-
| Modern Art
| Modern Art displayed on the screen
|-
| Mondrian
| Inverts parts of the screen
|-
| Mosaic
| Creates a mosaic of the screen
|-
| Mountains
| Generates 3-D mountains
|-
| Movies 'Til Dawn
| Plays QuickTime movies
|-
| Mowin' Boris
| Mowin' Man mows a field with Boris the cat around. When Mowin' Man runs over Boris, blood and guts appear
|-
| Mowin' Man
| A man mows a constantly growing field
|-
| MultiModule
| Displays a user-selected combination of After Dark modules with the modules all displayed simultaneously and optionally overlaid over each other
|-
| NightLines
|
|-
| Nirvana
| Generates colorful textures
|-
| Nocturnes
| Shows the eyes of various nocturnal creatures, such as bats
|-
| Nonsense
| Nonsensical phrases are displayed on the screen
|-
| Om Appliances
| Various appliances do weird things on the screen
|-
| Origami
| Computer-generated origami appears on the screen
|-
| Out and About
| A musician walks out with a chair and an instrument, sits down and begins to play while other people slowly appear and begin milling around while kids play
|-
| Pattern
| Animated patterns appear on the screen
|-
| Pearl
| An optical effect featuring squares
|-
| Penrose
| Penrose tiling effect
|-
| Phlegm Boy
| An obnoxious slimy creature is disgusting and displays bad habits
|-
| Photon
| Computer-generated particles of light are emitted from the darkness
|-
| PICS Player
| Plays an animated sequence from a PICS file on the Mac platform
|-
| Plasma
| Plasma-like image generated
|-
| Punch Out
| Round holes appear to be punched out of the desktop
|-
| Puzzle
| The desktop becomes a sliding puzzle
|-
| Rain
| Colorful raindrops fall on the desktop
|-
| Rainstorm
| Like the Rain module, but with wind and lightning
|-
| Rainy Day
| Rain drops on the screen. User can select how fast they fall and how strong the wind is.
|-
| Randomizer
| Randomly displays modules chosen from a user-generated list of modules
|-
| Rat Race
| A race featuring three rats with names, mindlessly wandering around the track until there is a winner
|-
| Rebound
| Balls rebound around the screen
|-
| Rose
| Mathematical pattern based on trigonometry
|-
| Satori
| Color animated light show
|-
| Say What?
| Displays humorous phrases
|-
| Scrubbing Bubbles
| Displays multiple Scrubbing Bubbles (Dow Brands) floating around the screen
|-
| Scrubbing Bubbles II
| Displays multiple Scrubbing Bubbles (Dow Brands) "scrubbing" the screen and going down the drain
|-
| Shapes
| Fills the screen with colorful, geometric shapes
|-
| Shock Clocks
| Scary creatures are turned into clocks
|-
| Shooting Spree
| The desktop appears to be shot up by a gun. User can select which gun to use.
|-
| Sinkhole
| The desktop appears to fall into sinkholes
|-
| Slide Show
| A basic slide show of user-supplied images
|-
| Snake
| A pixelated snake tries to find its way through a maze
|-
| Spheres
| A number of spheres fill the screen
|-
| Spin Brush
| Smears points on the screen like wet paper
|-
| Spiral Gyro
| Vector module that twists lines
|-
| Spotlight
| The desktop becomes black and parts are "illuminated" by a randomly moving light spot
|-
| Squigwig
| Generates mathematical circles
|-
| Stained Glass
| Produces quilt-like patterns
|-
| Steam Rollin'
| Displays a guy driving around squishing toys, snakes and babies (a take-off on the Mowin' Man module)
|-
| Stormy Night
| Random lightning bolts, with thunderclap sounds
|-
| Strange Attractor
| Computer-generated color image
|-
| String Theory
| Moire patterns
|-
| Sunburst
| Color pattern that appears to come from the Sun
|-
| Supernova
| Displays an exploding supernova
|-
| Swan Lake
| Swans swim around the desktop
|-
| This Ol' House
| Someone appears to be working on the desktop from the other side with power saws
|-
| Toaster 2K
| 10th anniversary module featuring futuristic and mecha versions of the flying toasters
|-
| Toxic Swamp
| Parody of Fish!, but in a toxic polluted swamp with mutated fish and a mob boss
|-
| Tunnel
| Makes the screen appear to be a tunnel
|-
| Use Your Own!
| Displays multiple images of the users choice moving around the screen
|-
| Vertigo
| Colorful rainbow spirals drawn on the screen
|-
| Virex-D
| An implementation of the Virex anti-virus utility. Scans for viruses and displays icons in 3D form
|-
| Voyeur
| One appears to be spying on an apartment complex with a big city skyline in the background
|-
| Warp
| One appears to be traveling among stars at high speed
|-
| Window Blinds
| Desktop is separated into columns and then each one turns like a window blind
|-
| Wrap Around
| Draws three-dimensional loops
|-
| Wrecking Ball
| A wrecking ball appears to demolish the desktop
|-
| You Bet Your Head
| Playable quiz game featuring three colored "heads" that are smashed by a hammer if one supplies the wrong answer to a question
|-
| Zoom!
| Creates colorful triangular tubes
|-
| Zot
| Attempts to generate lightning
|}
|
wikipedia
|
wiki_15168_chunk_12
|
PLS (complexity)
|
The standard Algorithm Consider the following computational problem:
Given some instance of a PLS problem , find a locally optimal solution such that for all . Every local search problem can be solved using the following iterative improvement algorithm: Use to find an initial solution
Use algorithm to find a better solution . If such a solution exists, replace by and repeat step 2, else return
|
wikipedia
|
wiki_24026_chunk_4
|
Multiservice tactical brevity code
|
C
Candygram Informative call to aircraft that electronic warfare (EW) targeting information is available on a briefed secure net.
Cap/capping
Directive call to establish an orbit at a specified location. (location)
An orbit at a specified location.
Captured Aircrew has identified and is able to track a specified air-to-ground (A/G) target with an onboard sensor.
Cease In air defense, break the engagement on the target specified. Missiles in flight engagement will continue to intercept.
Cease fire Discontinue firing and/or Do not open fire; complete intercept if weapons are in flight; continue to track.
CERTSUB Visual sighting of a submarine.
Champagne An attack of three distinct groups with two in front and one behind.
Chattermark Begin using briefed radio procedures to counter communications jamming.
Cheapshot
(USAF) Active missile supported to high pulse repetition frequency (HPRF, better against oncoming targets), but not medium pulse repetition frequency (MPRF, better against targets flying away).
(Naval) Active missile not supported to active range.
Check turn () degrees left or right and maintain new heading. (Left/right)
Cherubs Height of a friendly aircraft in hundreds of feet.
Chicks Friendly aircraft.
Christmas tree to turn on all exterior lighting.
Clean
No radar contacts on aircraft of interest.
No visible battle damage
Aircraft not carrying external stores.
Cleared Requested action is authorized (no engaged/support roles are assumed).
Cleared hot Ordnance release is authorized.
Cloak Directive/informative call to switch from normal external lighting to covert night vision device (NVD) only compatible lighting.
Closing Decreasing in range.
Cobra ASW torpedo in gyro angle snake search (GASS) mode (eg Mk46).
Cold
Attack geometry will result in a pass or rollout behind the target.
On a leg of the combat air patrol (CAP) pointed away from anticipated threats.
Group( s) heading away from friendly aircraft.
In ASW, designated unit has lost sonar contact.
Color Request for information on a (system) at stated location; usually a request for (system/position) ambiguity resolution. May be used with improved data modem (IDM) data message−color, data.
Comeoff Directive to maneuver as indicated to either regain mutual support or to (left/right/deconflict flight paths for an exchange of engaged and supporting roles; low/dry) implies both visual and tally.
Commit/committed Fighter intent to engage/intercept; controller continues to provide information.
Confetti Chaff lane or corridor.
Cons/conning Threat/bogey aircraft leaving contrails.
Contact
Sensor contact at the stated position.
Acknowledges sighting of a specified reference point.
Continue Continue present maneuver; does not imply clearance to engage or expend ordnance.
Continue dry Ordnance release not authorized.
Cover/covering Directive/informative call to take Surface/Air action or establish an air-to-air (A/A) posture that will allow engagement of a specified target or threat.
Cowboys Ships of an ASW Search and Attack Unit (SAU).
Crank To maneuver beyond the range of a missile; implies illuminating target at radar gimbal limits in a beyond visual range engagement.
Cutoff Request for, or directive to, intercept using cutoff geometry.
Cyclops Any unmanned aerial vehicle (UAV).
|
wikipedia
|
wiki_11073_chunk_2
|
Divine Proportions: Rational Trigonometry to Universal Geometry
|
Overview
The main idea of Divine Proportions is to replace distances by the squared Euclidean distance, renamed in this book as quadrance, and to replace angles by the squares of their sines, renamed in this book as spread and thought of as a measure of separation (rather than an amount of rotation) between two lines. Divine Proportions defines both of these concepts directly from the Cartesian coordinates of points that determine a line segment or a pair of crossing lines, rather than indirectly from distances and angles. Defined in this way, they are rational functions of those coordinates, and can be calculated directly without the need for the square roots needed to calculate distances from coordinates or the inverse trigonometric functions needed to calculate angles from coordinates.
|
wikipedia
|
wiki_6655_chunk_4
|
SL (complexity)
|
By definition, USTCON is complete for SL (all problems in SL reduce to it, including itself). Many more interesting complete problems were found, most by reducing directly or indirectly from USTCON, and a compendium of them was made by Àlvarez and Greenlaw. Many of the problems are graph theory problems on undirected graphs. Some of the simplest and most important SL-complete problems they describe include:
USTCON
Simulation of symmetric Turing machines: does an STM accept a given input in a certain space, given in unary?
Vertex-disjoint paths: are there k paths between two vertices, sharing vertices only at the endpoints? (a generalization of USTCON, equivalent to asking whether a graph is k-connected)
Is a given graph a bipartite graph, or equivalently, does it have a graph coloring using 2 colors?
Do two undirected graphs have the same number of connected components?
Does a graph have an even number of connected components?
Given a graph, is there a cycle containing a given edge?
Do the spanning forests of two graphs have the same number of edges?
Given a graph where all its edges have distinct weights, is a given edge in the minimum weight spanning forest?
Exclusive or 2-satisfiability: given a formula requiring that or hold for a number of pairs of variables , is there an assignment to the variables that makes it true?
|
wikipedia
|
wiki_33113_chunk_28
|
Instructional simulation
|
Barriers to instructional simulation in medicine
Simulations in medicine have been in use as early as the 16th century when the use of training mannequins helped to reduce the high maternal and infant mortality rates. Today they have evolved, to include IVEs, CAVE, robotic surgery, etc., but they are still relatively limited in their use by the health industry.
Medicine is a profession that uses very advanced technical, high risk, as well as behavioral skills. However, unlike other areas with similar requirements (such as aviation), medicine has not totally embraced the use of simulations to assist with necessary medical training. The limited use of simulations for training in the medical field can be explained by several factors, including cost control, relatively limited modeling of the human body, lack of scientific evidence of effectiveness, and resistance to change by professional in the field. (Ziv, et al. 2003). A later study, conducted by Amalberti et al.(2005), points to 5 systemic structural barriers to the use of simulators to advance medical training. These are:
Unlimited decision-making autonomy of individual medical staff; instead, teamwork and regulations should anticipate problems and processes across departments.
Unlimited performance of individuals and of the system; instead, hours of work should be limited and shortage of staff addressed because excessive productivity-not competence, leads to medical errors.
Focus on status of individual; instead, standards of excellence of equivalent actors should be the goal.
Overprotection against personal liability; instead, more consideration should be given to "unintended consequences", and to system-level arbitration to optimize safety strategies.
Overregulation and technical complexities in medicine; instead, simplification of regulations is needed.
The existence of these barriers leads to a lower rate of patient safety, and prevent the health industry to come closer to the goal of "ultrasafe performance," already achieved by the civil aviation and the nuclear power industries
|
wikipedia
|
wiki_23735_chunk_4
|
Bowyer–Watson algorithm
|
function BowyerWatson (pointList)
// pointList is a set of coordinates defining the points to be triangulated
triangulation := empty triangle mesh data structure
add super-triangle to triangulation // must be large enough to completely contain all the points in pointList
for each point in pointList do // add all the points one at a time to the triangulation
badTriangles := empty set
for each triangle in triangulation do // first find all the triangles that are no longer valid due to the insertion
if point is inside circumcircle of triangle
add triangle to badTriangles
polygon := empty set
for each triangle in badTriangles do // find the boundary of the polygonal hole
for each edge in triangle do
if edge is not shared by any other triangles in badTriangles
add edge to polygon
for each triangle in badTriangles do // remove them from the data structure
remove triangle from triangulation
for each edge in polygon do // re-triangulate the polygonal hole
newTri := form a triangle from edge to point
add newTri to triangulation
for each triangle in triangulation // done inserting points, now clean up
if triangle contains a vertex from original super-triangle
remove triangle from triangulation
return triangulation
|
wikipedia
|
wiki_17830_chunk_9
|
Aggregate function
|
STDDEV:
For a finite population with equal probabilities at all points, we have This means that the standard deviation is equal to the square root of the difference between the average of the squares of the values and the square of the average value.
.
. See also
Cross-tabulation a.k.a. Contingency table
Data drilling
Data mining
Data processing
Extract, transform, load
Fold (higher-order function)
Group by (SQL), SQL clause
OLAP cube
Online analytical processing
Pivot table
Relational algebra
Utility functions on indivisible goods#Aggregates of utility functions
XML for Analysis
AggregateIQ References Citations Bibliography
|
wikipedia
|
wiki_13919_chunk_11
|
Useful conversions and formulas for air dispersion modeling
|
The following equation can be used to correct a measured pollutant concentration in an emitted gas (containing a measured O2 content) to an equivalent pollutant concentration in an emitted gas containing a specified reference amount of O2: Thus, a measured concentration of 45 ppmv (dry basis) in a gas having 5 volume % O2 is
45 × ( 20.9 - 3 ) ÷ ( 20.9 - 5 ) = 50.7 ppmv (dry basis) of when corrected to a gas having a specified reference O2 content of 3 volume %. Correcting to a reference carbon dioxide content
|
wikipedia
|
wiki_22522_chunk_3
|
System Simulation
|
British Computer Society IT Award Winner 1994: PLATO-UK with Guy's and St Thomas' Hospital Trust and Royal Botanic Gardens, Kew
British Computer Society IT Award Medallist 1995: ROCKnROM with Michael Wadleigh and Penguin Books
British Computer Society IT Award Medallist 1996: Index+ software system.
BT/New Statesman - Best education website 2001: The 24 Hour Museum http://www.culture24.org.uk/
American Association of Museums Silver Muse Award 2001 - Excellence in the use of media and technology for collections database and research resource: SCRAN http://www.scran.ac.uk
Institute of Information Scientists Jason Farradine Award 2001 - an outstanding piece of work in the information field: SCRAN http://www.scran.ac.uk
National Library for the Blind Visionary Design Award 2002: The British Museum COMPASS website for accessibility to the visually impaired. www.thebritishmuseum.ac.uk/compass
IVCA Biz Net Award Winner - Best public information website 2002: The 24 Hour Museum (since rebranded as "Culture24") http://www.culture24.org.uk/home
BECTA/The Guardian UK Education Website Awards 2002 - shortlisted :SCRAN http://www.scran.ac.uk
Museums and the Web, Culture 24 Best of the Web Winner in the category "long-lived" April 2010
Europeana Foundation, Hack4Europe, Casual Curator winner in the category "Social Inclusion" June 2011
|
wikipedia
|
wiki_2133_chunk_7
|
Prime-factor FFT algorithm
|
A great deal of research has been devoted to schemes for evaluating this re-indexing efficiently, ideally in-place, while minimizing the number of costly modulo (remainder) operations (Chan, 1991, and references). DFT re-expression The above re-indexing is then substituted into the formula for the DFT, and in particular into the product in the exponent. Because , this exponent is evaluated modulo . Similarly, and are implicitly periodic in , so their subscripts are evaluated modulo . First, substitute the Ruritanian mapping into the formula for DFT:
.
|
wikipedia
|
wiki_36885_chunk_1
|
Société de Mathématiques Appliquées et Industrielles
|
SMAI is directed by an administration elected by the general assembly. Its chief activities are:
to organize conferences and workshops,
to publish the thrice-yearly bulletin Matapli, which contains overviews, book reviews, and information about theses and upcoming conferences,
to publish scholarly journals including Modélisation Mathématique et Analyse Numérique (M2AN), Contrôle Optimisation et Calcul des Variations (COCV), Probabilités et Statistiques (P&S), Recherche opérationnelle (RO), ESAIM: Proceedings and Surveys, and the cross-disciplinary journal MathematicS in Action (MathS in A.).
|
wikipedia
|
wiki_25244_chunk_2
|
Hoc (programming language)
|
Examples
The following is a simple example of an interactive calculator session in hoc; text represents hoc's output:
1+2*3
7
angle=PI/3
r=sin(angle)
r
0.866025
r*2
1.73205
And a simple example of functions and flow control:
func atan2(){
if ($1>0){
return atan($2/$1)
} else if ($1<0){
return atan($2/$1)+PI
} else if ($2>0){
return PI/2
} else if ($2<0){
return -PI/2
} else {
print "atan2 domain error"
return 0
}
}
atan2(2,3)
0.982794
atan2(0,0)
atan2 domain error
0.0
|
wikipedia
|
wiki_4779_chunk_7
|
120-cell
|
Polyhedral graph
Considering the adjacency matrix of the vertices representing its polyhedral graph, the graph diameter is 15, connecting each vertex to its coordinate-negation, at a Euclidean distance of 4 away (its circumdiameter), and there are 24 different paths to connect them along the polytope edges. From each vertex, there are 4 vertices at distance 1, 12 at distance 2, 24 at distance 3, 36 at distance 4, 52 at distance 5, 68 at distance 6, 76 at distance 7, 78 at distance 8, 72 at distance 9, 64 at distance 10, 56 at distance 11, 40 at distance 12, 12 at distance 13, 4 at distance 14, and 1 at distance 15. The adjacency matrix has 27 distinct eigenvalues ranging from , with a multiplicity of 4, to 4, with a multiplicity of 1. The multiplicity of eigenvalue 0 is 18, and the rank of the adjacency matrix is 582.
|
wikipedia
|
wiki_939_chunk_8
|
Ford–Fulkerson algorithm
|
A variation of the Ford–Fulkerson algorithm with guaranteed termination and a runtime independent of the maximum flow value is the Edmonds–Karp algorithm, which runs in time. Integral example The following example shows the first steps of Ford–Fulkerson in a flow network with 4 nodes, source and sink . This example shows the worst-case behaviour of the algorithm. In each step, only a flow of is sent across the network. If breadth-first-search were used instead, only two steps would be needed. Notice how flow is "pushed back" from to when finding the path . Non-terminating example
|
wikipedia
|
wiki_14430_chunk_10
|
Scale factor (computer science)
|
Choosing a scale factor
The example above illustrates how certain scale factors can cause unnecessary precision loss or rounding error, highlighting the importance of choosing the right scale factor. Using the scale factor of and converting to binary representations, the following values are obtained:
154/11 = 14 = 1110.0
101/11 = 9.1818... = 1001.00101110...
54/11 = 4.9090... = 100.111010...
3/11 = 0.2727... = 0.010010...
0/11 = 0 = 0.0
160/11 = 14.5454... = 1110.10010...
|
wikipedia
|
wiki_1233_chunk_21
|
ICON (microcomputer)
|
Software
The Bartlett Saga, a four-part game about the History of Canada; consisting of Part I: Refugees in the Wilderness: United Empire Loyalists, 1784-1793; Part II: The Rebels: Rebellion in Upper Canada, 1830-1844; Part III: United We Stand: Confederation, 1864-1873; Part IV: The Golden West: Settling the Plains, 1897-1911
Build-A-Bird [Ergonomics Lab, University of Toronto]
Cargo Sailor (1987), a game about delivering goods to different ports around the world, given the latitude and longitude.
Cross Country Canada, a game of travelling across Canada in a truck, picking up and delivering cargo.
Ernie's Big Splash, a video game including Sesame Street characters.
Logo, an implementation of the Logo programming language.
Northwest Fur Trader, educational software simulating the fur trade in Canada.
Lemonade Stand, an educational game of setting lemonade prices based on the weather forecast.
A Day in the Life Of, a strange game following the life of a student. There was an arcade game inside it where you could catch rabbits.
Spectricon, the drawing software. It used a particularly beautiful noise generator to create dithering patterns.
Offshore Fishing, the fishing game where you try to catch fish and sell for money but avoid the shark at all costs as he will swim through your fishing net.
Watfor, the WATCOM FORTRAN programming language.
Chat, the OS included facilities for sending system-wide messages, which students abused often.
|
wikipedia
|
wiki_27511_chunk_5
|
Certificate (complexity)
|
A more general example, for the problem of determining if a given Turing machine accepts an input in a certain number of steps, is as follows:
L = {<<M>, x, w> | does <M> accept x in |w| steps?}
Show L ∈ NP.
verifier:
gets string c = <M>, x, w such that |c| <= P(|w|)
check if c is an accepting computation of M on x with at most |w| steps
|c| <= O(|w|3)
if we have a computation of a TM with k steps the total size of the computation string is k2
Thus, <<M>, x, w> ∈ L ⇔ there exists c <= a|w|3 such that <<M>, x, w, c> ∈ V ∈ P
|
wikipedia
|
wiki_3058_chunk_9
|
Civil-military co-operation
|
There is a vital need for translating relevant information into CIMIC knowledge. A NATO working group is trying to solve this problem by establishing a CIMIC reporting system that allows information sharing by the CIMIC staff from the tactical to the strategic level. In current operations, the CIMIC staffs are overwhelmed by a huge information flow. To facilitate their work, a CECIL working group has developed practical tools. The aim is to improve CIMIC assessments and develop a smoother information flow within the CIMIC "stove pipe" as well as a better horizontal distribution and sharing of pertinent info with the rest of the staff.
|
wikipedia
|
wiki_11363_chunk_15
|
Quasi-delay-insensitive circuit
|
Skip skip does nothing. It simply acts as a placeholder for pass-through conditions.
Dataless assignment a+ sets the voltage of the node a to Vdd while a- sets the voltage of a to GND.
Assignment a := e evaluates the expression e then assigns the resulting value to the variable a.
Send X!e evaluates the expression e then sends the resulting value across the channel X. X! is a dataless send.
Receive X?a waits until there is a valid value on the channel X then assigns that value to the variable a. X? is a dataless receive.
Probe #X returns the value waiting on the channel X without executing the receive.
Simultaneous composition S * T executes the process fragments S and T at the same time.
Internal parallel composition S, T executes the process fragments S and T in any order.
Sequential composition S; T executes the process fragments S followed by T.
Parallel composition S || T executes the process fragments S and T in any order. This is functionally equivalent to internal parallel composition but with lower precedence.
Deterministic selection [G0 -> S0[]G1 -> S1[]...[]Gn -> Sn] implements choice in which G0,G1,...,Gn are guards which are dataless boolean expressions or data expressions that are implicitly cast using a validity check and S0,S1,...,Sn are process fragments. Deterministic selection waits until one of the guards evaluates to Vdd, then proceeds to execute the guard's associated process fragment. If two guards evaluate to Vdd during the same window of time, an error occurs. [G] is shorthand for [G -> skip] and simply implements a wait.
Non-deterministic selection [G0 -> S0:G1 -> S1:...:Gn -> Sn] is the same as deterministic selection except that more than one guard is allowed to evaluate to Vdd. Only the process fragment associated with the first guard to evaluate to Vdd is executed.
Repetition *[G0 -> S0[]G1 -> S1[]...[]Gn -> Sn] or *[G0 -> S0:G1 -> S1:...:Gn -> Sn] is similar to the associated selection statements except that the action is repeated while any guard evaluates to Vdd. *[S] is shorthand for *[Vdd -> S] and implements infinite repetition.
|
wikipedia
|
wiki_21527_chunk_4
|
Collaborative Study on the Genetics of Alcoholism
|
COGA researchers will interview subjects using the Semi-Structured Assessment for the Genetics of Alcoholism (SSAGA), specifically created for the COGA project. Each subject is asked to participate in the SSAGA, with different versions for adolescents and for parents being interviewed about their children. The SSAGA is a polydiagnostic psychiatric interview that will cover any drug or alcohol use as well as any emotional and/or medical problems the subject may have experienced. The SSAGA is designed to use diagnostic criterion from the DSM III-R, DSM IV, and ICD-10. The SSAGA has been translated into nine languages and has been used in over 275 studies; researchers can use the SSAGA in their own projects. The wide adoption of the SSAGA ensures that data from COGA families are highly compatible with data from other studies and allows COGA to participate in numerous consortia that use meta-analytic methods to combine data and results.
|
wikipedia
|
wiki_3450_chunk_25
|
Jacobi elliptic functions
|
{| class="wikitable" style="text-align:center;
|+ Parameters for the six transformations
!Transformation i||||||cs'||ns'||ds'
|-
! U
| 1 || m || cs || ns || ds
|-
! I
| i || m' || ns || cs || ds
|-
! IR
| i k || −m'/m || ds || cs || ns
|-
! R
| k || 1/m || ds || ns || cs
|-
! RI
|i k1|| 1/m' || ns || ds || cs
|-
! RIR
| k1 || −m/m' || cs || ds || ns
|-
|}
|
wikipedia
|
wiki_4362_chunk_25
|
Database marketing
|
Challenges and limitations
While real-time business intelligence is a reality for select companies, it remains elusive to many as it is dependent on these premises: the percentage of the business that is online, and the degree of level of sophistication of the software. Technology companies like Google, Dell, and Apple are best positioned to capitalize on such intelligence. For other companies, more traditional methods still apply, either to maintain communication with an existing customer base (retention) or, as a more established growth driver, to build, acquire or rent new databases (acquisition). A major challenge for databases is the reality of obsolescence - including the lag time between when data was acquired and when the database is used. This problem can be addressed by online and offline means including traditional methods. An alternative approach is real-time proximity marketing for acquisition purposes.
|
wikipedia
|
wiki_34285_chunk_3
|
Stochastic geometry
|
What is meant by a random object? A complete answer to this question requires the theory of random closed sets, which makes contact with advanced concepts from measure theory. The key idea is to focus on the probabilities of the given random closed set hitting specified test sets. There arise questions of inference (for example, estimate the set which encloses a given point pattern) and theories of generalizations of means etc. to apply to random sets. Connections are now being made between this latter work and recent developments in geometric mathematical analysis concerning general metric spaces and their geometry. Good parametrizations of specific random sets can allow us to refer random object processes to the theory of marked point processes; object-point pairs are viewed as points in a larger product space formed as the product of the original space and the space of parametrization.
|
wikipedia
|
wiki_21313_chunk_3
|
Fair computational tree logic
|
Compute what is called the denotation of the formula φ: the set of states such that M, s |= φ.
Restrict the model to the denotation.
Find the fair SCC.
Obtain the union of all 3 (above).
Compute the states that can reach the union.
|
wikipedia
|
wiki_35155_chunk_3
|
Interservice/Industry Training, Simulation and Education Conference
|
Papers, Tutorials, and Workshops
Each year, I/ITSEC requests submissions for papers and tutorials to be presented at its annual conference. The peer-reviewed process spans half a year as prospective authors must pass multiple quality assurance gates. Authors must first submit an abstract to one of the six sub-committees: education, emerging concepts and innovative technologies, human systems engineering, simulation, training, or the policy, standards, management, and acquisition subcommittee. Each subcommittee consists of government, industry, and academic members. At the abstract meeting, each submission is carefully considered and either accepted or rejected. If accepted, the full paper submission is required a few months later to again be reviewed and either accepted or rejected. Lastly, accepted authors must prepare presentations that are again reviewed by committee members. Abstract submission typically opens in February each year with full, accepted papers due sometime in June and presentations due around September.
|
wikipedia
|
wiki_23443_chunk_4
|
2007–08 United States network television schedule
|
Tuesday
{| class="wikitable" style="width:100%;margin-right:0;text-align:center"
|-
! colspan="2" style="background-color:#C0C0C0;text-align:center"|Network
! style="background-color:#C0C0C0;text-align:center"|8:00 PM
! style="background-color:#C0C0C0;text-align:center"|8:30 PM
! style="background-color:#C0C0C0;text-align:center"|9:00 PM
! style="background-color:#C0C0C0;text-align:center"|9:30 PM
! style="background-color:#C0C0C0;text-align:center"|10:00 PM
! style="background-color:#C0C0C0;text-align:center"|10:30 PM
|-
!rowspan="9"|ABC
!Fall
|Cavemen
|Carpoolers
| style="background:#FFFF00;" colspan="2"|Dancing with the Stars – Results (5/12.3)
|colspan="2" rowspan="3"|Boston Legal
|-
!December
|colspan="2"|Holiday Specials
|According to Jim (Reruns)
|According to Jim (Reruns)
|-
!January
|rowspan="2"|Just for Laughs
|rowspan="2"|Just for Laughs
|rowspan="2"|According to Jim
|Carpoolers
|-
!March
|According to Jim
|colspan="2"|Primetime: What Would You Do?
|-
!April
|rowspan="3"|According to Jim
|rowspan="3"|According to Jim (Reruns)
| style="background:#FFFF00;" colspan="2" rowspan="2"|Dancing with the Stars – Results (5/12.3)
|colspan="2"|Boston Legal
|-
!May
|colspan="2"|Women's Murder Club
|-
!Follow-Up
|Samantha Who?
|Samantha Who?
|colspan="2"|Boston Legal
|-
!Summer
|colspan="2" rowspan="2"|Wipeout
|colspan="2"|I Survived a Japanese Game Show
|colspan="2" rowspan="2"|Primetime
|-
!August
|colspan="2"|Wanna Bet?
|-
!rowspan="6"|CBS
!Fall
| rowspan="6" style="background:#00FFFF;" colspan="2"|NCIS (11/9.2)(Tied with CSI: Miami)
| style="background:#FF66FF;" rowspan="2" colspan="2"|The Unit (30/7.0)(Tied with Shark)
|colspan="2"|Cane
|-
!December
| colspan="2" |48 Hours Mystery
|-
!February
| colspan="2"|Big Brother
| colspan="2"|Jericho
|-
!Mid-April
| style="background:#FF66FF;" colspan="2"|Shark (30/7.0)(Tied with The Unit and Hell's Kitchen)
|colspan="2"|Various Programming
|-
!Summer
|colspan="2"|48 Hours Mystery
|rowspan="2" colspan="2"|Without a Trace
|-
!Follow-up
|colspan="2"|Big Brother
|-
!rowspan="4"|The CW
!Fall
|colspan="2"|Beauty and the Geek
|colspan="2"|Reaper
| style="background:#abbfff;" colspan="2" rowspan="13"|Local Programming
|-
!January
|colspan="2"|Reaper|colspan="2" rowspan="2"|One Tree Hill
|-
!March
|colspan="2" rowspan="2"|Beauty and the Geek
|-
!April
|colspan="2"|Reaper
|-
!rowspan="6"|Fox
!Fall
|colspan="2"|Bones
| style="background:#FFFF00;" colspan="2" rowspan="2"|House (8/10.5)
|-
!January
|colspan="2" style="background:#FFFF00;"|American Idol (1/16.1)
|-
!Mid-February
|colspan="4" style="background:#FFFF00;"|American Idol (1/16.1)
|-
!April
|colspan="2" style="background:#FFFF00;"|American Idol (1/16.1)
|colspan="2" rowspan="2" style="background:#FF66FF;"|Hell's Kitchen (30/7.0)(Tied with Shark and The Unit)
|-
!Summer
|colspan="2" style="background:#00FFFF;"|The Moment of Truth (13/8.8)(Tied with Without a Trace)
|-
!Mid-Summer
|colspan="2"|Kitchen Nightmares
| style="background:#FFFF00;" colspan="2"|House (8/10.5)
|-
!rowspan="3"|MNT
!Fall
|colspan="2"|The Academy (Reruns)
|Jail
|Jail (Reruns)
|-
!December
|colspan="4"|Various Holiday Specials and Movies
|-
!January
|Street Patrol
|Street Patrol (Reruns)
|Jail
|Jail (Reruns)
|-
!rowspan="4"|NBC
!Fall
|The Singing Bee
|colspan="3"|The Biggest Loser
| style="background:#FF66FF;" colspan="2" rowspan="4"|Law & Order: Special Victims Unit (22/7.6)(Tied with Brothers & Sisters, CSI: NY and Heroes)
|-
!Follow-Up
|colspan="4"|The Biggest Loser
|-
!May
|Most Outrageous Moments
|Most Outrageous Moments
|colspan="2"|Quarterlife
|-
!Summer
|colspan="2"|Celebrity Family Feud
|colspan="2"|America's Got Talent
|}
|
wikipedia
|
wiki_10514_chunk_2
|
Balkan Mathematical Olympiad
|
In Cyprus four provincial competitions and a National (Pancyprian) competition are held every year. During this procedure 30 students are selected and two Team Selection Tests are held to determine who will be the six member of national team for BMO. In every competition or test there are four problem usually covering geometry, number theory, algebra, and combinatorics (elementary level) and last four and a half hours each.
Greece
BMO 1990: 1. Dimitris Stathopoulos: Gold Medal; 2. Theodoros Evgeniou: Silver Medal; 3. Athanasios Tsikas: Silver Medal; 4. Andreas Stalidis: Bronze Medal; 5. Dimitris Karakostas: Bronze Medal; 6. Eleni Vlamou: Honorable Mention.
In Greece there are three competitions to select the national team: Those are: Θαλής (Thales) - first round; Ευκλείδης (Euclid) - second round and Αρχιμήδης (Archimedes) - third round
Serbia
BMO 2011: 1.Teodor von Burg 2.Filip Zivanovic 3.Igor Spasojevic 4.Rade Spegar 5.Stefan Mihajlovic 6.Stevan Gajovic
Montenegro
BMO 2011: 1.Radovan Krtolica: Silver Medal 2.Oleg Smiljanic 3.Olja Krastovic 4.Nikola Kovacevic 5.Beco Merulic 6.Aleksandar Dobrasinovic
|
wikipedia
|
wiki_8203_chunk_4
|
Global Infectious Disease Epidemiology Network
|
Additional options allow users to add data (in their own font / language) relevant to their own institution, electronic patient charts, material from the internet, important telephone numbers, drug prices, antimicrobial resistance patterns, etc. This form of custom data is particularly useful when running GIDEON on institutional networks. The data in GIDEON are derived from:
all peer-reviewed journals in the fields of Infectious Diseases, Pediatrics, Internal Medicine, Tropical Medicine, Travel Medicine, Antimicrobial Pharmacology and Clinical Microbiology
a monthly electronic literature search based on all relevant keywords
all available health ministry reports (both printed and electronic)
standard texts
abstracts of major meetings
|
wikipedia
|
wiki_7583_chunk_5
|
International Solid-State Circuits Conference
|
Technical Program Committee
The Technical Program Committee (TPC) in early years was extremely fluid in order to deal with the constantly changing topics in the industry. By 1968 the list of subcommittees had settled to Digital, Analog (Linear), Microwave and Other, where the subcommittee members in Other would address the one-of-a-kind papers. In the 80's, the Microwave Subcommittee was dropped from the program as the overlap between the topics and attendees was diminishing. In addition, Digital split into Digital, Memory and Signal Processing subcommittees. In 1992, Emerging Technologies was launched and chartered to seek out the one-of-a-kind applications which may find a home in ISSCC. Today there are 10 subcommittees: Analog, Data Converters, Energy Efficient Digital (EED), High-Performance Digital (HPD), Imagers, MEMs, Medical and Displays (IMMD), Memory, RF, Technology Directions (formerly Emerging Technologies), Wireless and Wireline.
|
wikipedia
|
wiki_4743_chunk_15
|
List of important publications in statistics
|
Principles and Procedures of Statistics with Special Reference to the Biological Sciences.
Authors: Steel, R.G.D, and Torrie, J. H.
Publication data: McGraw Hill (1960) 481 pages
Description: Excellent introductory text for analysis of variance (one-way, multi-way, factorial, split-plot, and unbalanced designs). Also analysis of co-variance, multiple and partial regression and correlation, non-linear regression, and non-parametric analyses. This book was written before computer programmes were available, so it gives the detail needed to make the calculations manually.Cited in more than 1,381 publications between 1961 and 1975.
Importance: Influence
|
wikipedia
|
wiki_19542_chunk_8
|
Map algebra
|
Here are some examples in MapBasic, the scripting language for MapInfo Professional: # demo for Brown's Pond data set
# Give layers
# altitude
# development – 0: vacant, 1: major, 2: minor, 3: houses, 4: buildings, 5 cement
# water – 0: dry, 2: wet, 3: pond # calculate the slope at each location based on altitude
slope = IncrementalGradient of altitude # identify the areas that are too steep
toosteep = LocalRating of slope
where 1 replaces 4 5 6
where VOID replaces ...
|
wikipedia
|
wiki_34978_chunk_1
|
Directed algebraic topology
|
Directed Spaces
Many mathematical definitions have been proposed to formalise the notion of directed space. E. W. Dijkstra introduced a simple dialect to deal with semaphores, the so-called 'PV language', and to provide each PV program an abstract model: its 'geometric semantics'. Any such model admits a natural partially ordered space (or pospace) structure i.e. a topology and a partial order. The points of the model should be thought of as the states of the program and the partial order as the 'causality' relation between states. Following this approach, the directed paths over the model i.e. the monotonic continuous paths, represent the execution traces of the program. From the computer science point of view, however, the resulting pospaces have a severe drawback. Because partial orders are by definition antisymmetric, their only directed loops i.e. directed paths which end where they start, are the constant loops.
|
wikipedia
|
wiki_984_chunk_18
|
Multiplication algorithm
|
Description
On paper, write down in one column the numbers you get when you repeatedly halve the multiplier, ignoring the remainder; in a column beside it repeatedly double the multiplicand. Cross out each row in which the last digit of the first number is even, and add the remaining numbers in the second column to obtain the product. Examples
This example uses peasant multiplication to multiply 11 by 3 to arrive at a result of 33. Decimal: Binary:
11 3 1011 11
5 6 101 110
2 12 10 1100
1 24 1 11000
—— ——————
33 100001 Describing the steps explicitly:
|
wikipedia
|
wiki_6535_chunk_60
|
Raku (programming language)
|
Tower of Hanoi
Tower of Hanoi is often used to introduce recursive programming in computer science. This implementation uses Raku's multi-dispatch mechanism and parametric constraints:
multi sub hanoi(0, $, $, $) { } # No disk, so do not do anything
multi sub hanoi($n, $a = 'A', $b = 'B', $c = 'C') { # Start with $n disks and three pegs A, B, C
hanoi $n - 1, $a, $c, $b; # firstly move top $n - 1 disks from A to B
say "Move disk $n from peg $a to peg $c"; # then move last disk from A to C
hanoi $n - 1, $b, $a, $c; # lastly move $n - 1 disks from B to C
}
|
wikipedia
|
wiki_7701_chunk_14
|
Chinese Character Code for Information Interchange
|
Character set 0x2122 (plane 1, row 2: mathematical operators)
This row contains mathematical operators. EACC leaves this row empty. The following table is referenced against sources from Taiwan. The following table is referenced against CCCII data provided by the Hong Kong Innovative Users Group, a group of libraries in Hong Kong, and hosted by the University of Hong Kong. It uses an entirely different layout in this row:
|
wikipedia
|
wiki_30110_chunk_24
|
GEORGE (operating system)
|
CE !
IN !,T////
PROG(HWLD)
STEER(LIST,OBJECT)
OUTE(SEMICOMPILED)
WSF(HWLD)
PLAN(CR)
#PRO HWLD40/TEST
#LOW
MESS 12HHELLO WORLD
#PRO
#ENT 0
DISTY '11/MESS'
DEL 2HOK
#END
ENDPROG
////
The LOAD (LO) command loads PROGRAM XPLT (the assembler) from the directory :LIB, it is then started by the RESUME (RM) command. If the run does not HALT with the output LD the job continues at label 1F for error handling.
LO :LIB.PROGRAM XPLT
RM
IF NOT HAL(LD),GO 1F
The ASSIGN (AS) command is used to connect virtual card reader unit 0 to the workfile created above, which is then erased by the ERASE (ER) command. (The erase will be delayed until the file is closed).
AS *CR0,!
ER !
A new workfile is created and the virtual line printer unit 0 assigned to it.
CE !
AS *LP0,!
When PROGRAM XPLT is run it will try to open the disk file in the OUTE directive, We want it to use a temporary workfile so we ask George to MONITOR the open, stopping execution and allowing us to provide the workfile:
MN ON, OPEN
The program in memory (PROGRAM XPLT) is started at location 21.
EN 1
IF NOT MONITOR(OPEN), GO 1F
A new, direct access, workfile is created with 128 word buckets and an initial size of 40K words. The virtual disk channel *DA2 is assigned to it. The program is RESUMED.
CE !(*DA,BUCK1,KWOR40)
AS *DA2,!(WRITE)
RM
If it HALTs with the output OK the job continues at label 1A, if not an error message is displayed and the job exits.
IF HAL(OK),GO 1A
1F DP 0,COMPILATION ERRORS
GO 5EX
The DELETE (DL) command deletes the assembler from memory.
1A DL
Yet another workfile is created to hold the instructions for the linker. As the linker instructions must end with a line "****" the default terminator is used for the INPUT command.
CE !
IN !
*IN ED(SEMICOMPILED)
*OUT ED(PROGRAM TEST)
*LIST
****
The linker, :LIB.PROGRAM XPCK is loaded and initialised.
LO :LIB.PROGRAM XPCK
RM
IF NOT HAL(LD),GO 2F
The virtual card reader is attached to the workfile holding the linker instructions, which is then erased.
AS *CR0,!
ER !
The virtual lineprinter is then assigned in append mode to the last but one workfile created and not yet erased (workfiles are held in a stack, "!" is the top of the stack, "!1" the one under that and so on). The LISTFILE (LF) command is used to print the file on the system printer (the listing will start when the file is closed). The file is then erased (the erase will be delayed until the listing is finished). The virtual disk channel *DA1 is assigned to the top workfile (holding the assembler output) and yet another workfile is created for the linker.
AS *LP0,!1(APPEND)
LF !1,*LP,PA
ER !1
AS *DA1,!
ER !
CE !(*DA,BUCK1,KWOR10)
AS *DA13,!(WRITE)
ER !
A file is created to hold the linker output and attached to virtual disk channel *DA14. The linker is then started at location 21 and if it finishes with the message HH the job continues at label 2A, otherwise an error message is displayed and the job exits.
CE PROGRAM HWLD(*DA,BUCK1,KWOR5)
AS *DA14,PROGRAM HWLD(WRITE)
EN 1
IF DEL(HH),GO 2A
2F DP 0,CONSOLIDATION ERRORS
GO 5EX
At label 2A the program written by the linker is loaded into memory and run starting at location 20, a success message is displayed and the job exits.
2A LO PROGRAM HWLD
EN 0
DP 0,JOB COMPLETED
GO 5EX
If any command failed the WHENEVER command given at the start of the job will force a jump to label 5CE which displays an error message and exits.
5CE DP 0,COMMAND ERROR IN JOB
When the job gets to label 5EX if it has a currently loaded program it is deleted from memory and the ENDJOB (EJ) command terminates the job.
5EX IF COR,DL
EJ ALL
The end of the job is signalled by the terminator string defined by the JOB command.
####
|
wikipedia
|
wiki_9827_chunk_4
|
Mega Man Battle Network (video game)
|
Mega Man Battle Network is set in an ambiguous year in the 21st century ("20XX AD") in an alternate reality to the original Mega Man series. Within the world of Battle Network, the Net has become humanity's primary means of communication, commerce, and even crime. Users are able to "jack in" to the Net and other computerized devices, and explore their various aspects using program avatars called "NetNavis (Network Navigators)" as if they were physical locations. The Net and the inner workings of computers are displayed as a virtual world with which computer programs of all varieties, as personified in a humanoid form, can interact. Users often do so by accessing their NetNavis via a "PET (PErsonal information Terminal)" device. The plot of Mega Man Battle Network follows one such pair, Lan Hikari and his NetNavi MegaMan.EXE. Lan is a fifth grader in the town of ACDC. His father, Dr. Yuichiro Hikari, is one of the world's top scientists and NetNavi researchers. Not long into the story, Lan and MegaMan.EXE take it upon themselves to solve various criminal cases around ACDC involving other Navis and their operators. Some of the confrontations with the various criminals involve desperate, life-threatening situations including a bus rigged to explode, oxygen being cut off at a large party, the entire city's clean water freezing, and school students being re-educated as mindless slaves. The duo continuously crosses paths with Eugene Chaud, an official "NetBattler" commissioned by the government to investigate crimes on the Net. Chaud and his NetNavi ProtoMan.EXE act as rivals to Lan and MegaMan.EXE.
|
wikipedia
|
wiki_89_chunk_113
|
Computer program
|
If a computer program in a computer with a direct memory access chip executes a system call to perform a DMA I/O write operation, then the system call will execute the following instructions:
Create an entry in the device-status table. The operating system maintains this table to keep track of which processes are waiting for which devices. One field in the table is the address of the process control block.
Place all the characters to be sent to the device into a memory buffer.
Set the memory address of the memory buffer to a predetermined device register.
Set the buffer size (an integer) to another predetermined register.
Execute the machine instruction to begin the writing.
Perform a context switch to the next process in the ready queue.
|
wikipedia
|
wiki_3083_chunk_18
|
Social simulation
|
"Generative e-Social Science for Socio-Spatial Simulation" or (GENESIS) is a research node of the UK National Centre for e-Social Science funded by the UK research council ESRC. For further details please see: GENESIS Web Page and Blog.
"National e-Infrastructure for Social Simulation" or (NeISS) is a UK-based project funded by JISC. For further details please see: The NeISS Web Pages.
"Network Models Governance and R&D collaboration networks" or (N.E.M.O) is a research centre whose main focus is to identify ways to create and to assess desirable network structures for typical functions; (e.g. knowledge, creation, transfer, and distribution.) This research will ultimately aid policy-makers at all political levels in improving the effectiveness and efficiency of network-based policy instruments at promoting the knowledge economy in Europe.
"Agent-based Simulations of Market and Consumer Behavior" is another research group that is funded by the Unilever Corporate Research. The current research that is being conducted is investigating the usefulness of agent-based simulations for modeling consumer behavior and to show the potential value and insights it can add to long-established marketing methods.
"New and Emergent World Models Through Individual, Evolutionary and Social Learning" or (New Ties) is a three-year project that will ultimately create a virtual society developed by agent-based simulation. The project will develop a simulated society capable of exploring the environment and developing its own image of this environment and the society through interaction. The goal of the research project is for the simulated society to exhibit individual learning, evolutionary learning and social learning.
Bruch and Mare's project on neighborhood segregation: The purpose of the study is to figure out the reasoning for neighborhood segregation based on race, and to figure out the tipping point or when people become uncomfortable with the integration levels into their neighborhood, and decide to flee from the neighborhood. They set up a model using flash cards, and put the agent's house in the middle and put houses of different races surrounding the agent's house. They asked people how comfortable they would feel with different situations; if they were okay with one situation, they asked another until the neighborhood was fully integrated. Bruch and Mare's results showed that the tipping point was at 50%. When a neighborhood became 50% minority and 50% white, people of both races began to become uncomfortable and white flight began to rise. The use of agent-based modeling showed how useful it can be in the world of sociology, people did not have to answer why they would become uncomfortable, just which situation they were uncomfortable with.
The MAELIA Program (Multi-Agent Emergent Norms Assessment) is a project dealing with the relationships between the users and managers of a natural resource, in that case water, and the related norms and laws that are to be built within them (conventions) or are imposed to them by other actors (institutions). The purpose of the project is to build a generic multiscale platform which is planned to deal with water conflict-related issues.
The Mosi-Agil project is a four-year program funded by the Autonomous Region of Madrid through the program MOSI-AGIL-CM (grant S2013/ICE-3019, co-funded by EU Structural Funds FSE and FEDER). It aims at creating a body of knowledge and practical tools which are necessary to handle more effectively the behavior of occupants of large facilities. Therefore, the project studies the development of ambient intelligence and intelligent environments supported by the use of Agent-Based Social Simulation.
|
wikipedia
|
wiki_7920_chunk_8
|
Physiologically based pharmacokinetic modelling
|
where Fi is blood flow (noted Q in the Figure above), Cart incoming arterial blood concentration, Pi the tissue over blood partition coefficient and Vi the volume of compartment i. A complete set of differential equations for the 7-compartment model shown above could therefore be given by the following table: The above equations include only transport terms and do not account for inputs or outputs.
Those can be modeled with specific terms, as in the following. Modeling inputs
Modeling inputs is necessary to come up with a meaningful description of a chemical's pharmacokinetics. The following examples show how to write the corresponding equations.
|
wikipedia
|
wiki_30906_chunk_9
|
Official statistics
|
Users with a research interest
Users with a research interest are universities, consultants and government agencies. They generally understand something about statistical methodology and want to dig deeper into the facts and the statistical observations; they have an analytical purpose in inventing or explaining interrelations of causes and effects of different phenomena. In this field, official statistics are also used to assess a government's policies. One common point for all these users is their need to be able to trust the official information. They need to be confident that the results published are authoritative and unbiased. Producers of official statistics must maintain a reputation of professionalism and independence.
|
wikipedia
|
wiki_13283_chunk_3
|
Model selection
|
Of the countless number of possible mechanisms and processes that could have produced the data, how can one even begin to choose the best model? The mathematical approach commonly taken decides among a set of candidate models; this set must be chosen by the researcher. Often simple models such as polynomials are used, at least initially . emphasize throughout their book the importance of choosing models based on sound scientific principles, such as understanding of the phenomenological processes or mechanisms (e.g., chemical reactions) underlying the data.
|
wikipedia
|
wiki_891_chunk_1
|
Gold code
|
A set of Gold codes can be generated with the following steps. Pick two maximum length sequences of the same length 2n − 1 such that their absolute cross-correlation is less than or equal to 2(n+2)/2, where n is the size of the linear-feedback shift register used to generate the maximum length sequence (Gold '67). The set of the 2n − 1 exclusive-ors of the two sequences in their various phases (i.e. translated into all relative positions) together with the two maximum length sequences form a set of 2n + 1 Gold code sequences. The highest absolute cross-correlation in this set of codes is 2(n+2)/2 + 1 for even n and 2(n+1)/2 + 1 for odd n.
|
wikipedia
|
wiki_20250_chunk_9
|
Tarjan's strongly connected components algorithm
|
The algorithm in pseudocode
algorithm tarjan is
input: graph G = (V, E)
output: set of strongly connected components (sets of vertices)
index := 0
S := empty stack
for each v in V do
if v.index is undefined then
strongconnect(v)
end if
end for
function strongconnect(v)
// Set the depth index for v to the smallest unused index
v.index := index
v.lowlink := index
index := index + 1
S.push(v)
v.onStack := true
// Consider successors of v
for each (v, w) in E do
if w.index is undefined then
// Successor w has not yet been visited; recurse on it
strongconnect(w)
v.lowlink := min(v.lowlink, w.lowlink)
else if w.onStack then
// Successor w is in stack S and hence in the current SCC
// If w is not on stack, then (v, w) is an edge pointing to an SCC already found and must be ignored
// Note: The next line may look odd - but is correct. // It says w.index not w.lowlink; that is deliberate and from the original paper v.lowlink := min(v.lowlink, w.index)
end if
end for
// If v is a root node, pop the stack and generate an SCC if v.lowlink = v.index then
start a new strongly connected component
repeat
w := S.pop()
w.onStack := false
add w to current strongly connected component
while w ≠ v output the current strongly connected component
end if
end function
|
wikipedia
|
wiki_37803_chunk_14
|
Mars Astrobiology Explorer-Cacher
|
Proposed science instrumentation
The rover would have carried instrumentation sufficient to scientifically select samples for caching. It was assumed that this translates to the following instruments and capabilities:
Must be able to remotely (i.e. with mast-mounted instruments) characterize outcrops and identify features of interest (panoramic camera, Near-IR Spectrometer)
Must be able to collect microscaleimagery of outcrops; contact instrument (microscopic imager)
Must be able to expose unweathered rock surfaces using a surface abrasion tool (abrading bits)
Must be able to measure mineralogy at micro-scales on the abraded rock surfaces; contact instrument (Raman spectroscopy)
Must be able to measure bulk elemental chemistry on the abraded rock surfaces; contact instrument (Alpha particle X-ray spectrometer)
Must be able to measure organic compounds on the abraded rock surfaces; contact instrument (Raman spectroscopy)
Must be able to correlate composition to micro-scale structures and textures in the rocks (microscopic imager)
|
wikipedia
|
wiki_30110_chunk_28
|
GEORGE (operating system)
|
0.0← tc/wrld/ 2.0← r/wrld/world/ 2.29← eThe system macro PLANCOMP is used to compile the file HELLO(/PLAN) to PROGRAM HELO 21.43.46← plancomp *cr hello(/plan),*idhelo FILES ALREADY ONLINE: :LIB.SUBGROUPS-RS(1/V3) :LIB.PROGRAM XPCK(1/V12K)
:LIB.PROGRAM XPLT(1/V8C)
21.43.58 0.58 CORE GIVEN 18944
0.58 :HALTED : LD
DISPLAY : START JOB HELO,
OPEN *DA2 N CA 1641 M=#00100 FN=SEMICOMPILED
1.00: MONITOR
21.43.58 FREE *CR0, 8 TRANSFERS
DISPLAY : COMP OK 84 #HELO
21.43.58 FREE *DA2, 9 TRANSFERS
1.01 :DELETED : FI #XPCK
21.43.58 FREE *TR0, 7 TRANSFERS
21.43.58 FREE *LP0, 83 TRANSFERS
21.43.58 1.01 DELETED,CLOCKED 0.00
21.43.59 1.07 CORE GIVEN 11392
21.43.59 FREE *CR0, 5 TRANSFERS
21.43.59 FREE *DA14,20 TRANSFERS
21.43.59 FREE *DA1, 9 TRANSFERS
21.43.59 FREE *DA2, 2 TRANSFERS
21.43.59 FREE *DA13,7 TRANSFERS
1.07 :DELETED : HH
21.43.59 FREE *LP0, 32 TRANSFERS
21.43.59 FREE *DA15,0 TRANSFERS
21.43.59 1.07 DELETED,CLOCKED 0.00
DISPLAY: PLAN COMPILATION/CONSOLIDATION OKAY
END OF MACRO
The newly compiled PROGRAM HELO is loaded into memory by the LOAD (LD) command, then started with the ENTER (EN) command. It displays the traditional message then deletes itself from memory.
21.43.59← lo program helo 21.44.06← en 21.44.07 1.09 CORE GIVEN 64
DISPLAY : HELLO WORLD
1.09 :DELETED : OK
21.44.07 1.09 DELETED,CLOCKED 0.00
Today's arduous work being finished, the user logs out with the LOGOUT (LT) command. The mill time and money used and remaining are displayed.
21.44.07← lt MAXIMUM ONLINE BS USED 252 KWORDS
21.44.12 1.09 FINISHED : 0 LISTFILES
BUDGET USED LEFT
TIME(M) 70 -97797
MONEY 35 80327
21.44.12←
|
wikipedia
|
wiki_24094_chunk_1
|
Anatomy of a Typeface
|
Background
The book is notable for devoting entire chapters to the development and uses of individual or small groupings of typefaces. Beyond Anatomy of a Typeface Lawson has considered and discussed the classification of types. Within Anatomy, Lawson arranges the typefaces by classification. In his preface, Lawson qualifies his classification: "After using this system in the teaching of typography over a thirty-year period, I know that it is reasonably effective in the initial study of printing types. I am not disposed to consider it faultless by any means. A classification system, after all, is simply a tool ... Its primary purpose is to help people become familiar with these forms preparatory to putting them to effective and constructive typographic use."
|
wikipedia
|
wiki_890_chunk_56
|
Gray code
|
{| class="wikitable infobox" style="text-align: center;"
|+ Subpaths in the Savage–Winkler algorithm
|-
! scope="col" |
! scope="col" | j = 0
! scope="col" | j = 1
! scope="col" | j = 2
! scope="col" | j = 3
|-
! scope="row" | n = 1
| || || ||
|-
! scope="row" | n = 2
| || || ||
|-
! scope="row" | n = 3
| || || ||
|-
! scope="row" | n = 4
| || || ||
|}
|
wikipedia
|
wiki_36728_chunk_26
|
List of important publications in theoretical computer science
|
Description: Edsger Dijkstra's paper Guarded Commands, Nondeterminacy and Formal Derivation of Programs (expanded by his 1976 postgraduate-level textbook A Discipline of Programming) proposes that, instead of formally verifying a program after it has been written (i.e. post facto), programs and their formal proofs should be developed hand-in-hand (using predicate transformers to progressively refine weakest pre-conditions), a method known as program (or formal) refinement (or derivation), or sometimes "correctness-by-construction".
|
wikipedia
|
wiki_20089_chunk_11
|
Diabetes management software
|
Globally, an estimated 422 million adults are living with diabetes mellitus, according to the latest 2016 data from the World Health Organization (WHO). Diabetes prevalence is increasing rapidly; previous 2013 estimates from the International Diabetes Federation put the number at 381 million people having diabetes. The number is projected to almost double by 2030. Type 2 diabetes makes up about 85-90% of all cases. Increases in the overall diabetes prevalence rates largely reflect an increase in risk factors for type 2, notably greater longevity and being overweight.
Diabetes mellitus occurs throughout the world, but is more common is type 2 diabetes in the more developed countries. The greatest increase in prevalence is, however, occurring in low- and middle-income countries including in Asia and Africa, where most patients will probably be found by 2030. The increase in incidence in developing countries follows the trend of urbanization and lifestyle changes, including increasingly sedentary lifestyles, less physically demanding work and the global nutrition transition, marked by increased intake of foods that are high energy-dense but nutrient-poor (often high in sugar and saturated fats, sometimes referred to as the Western pattern diet). The risk of getting type 2 diabetes has been widely found to be associated with lower socio-economic position across countries.[3,6]
The WHO estimates that diabetes resulted in 1.5 million deaths in 2012, making it the 8th leading cause of death. However another 2.2 million deaths worldwide were attributable to high blood glucose and the increased risks of associated complications (e.g. heart disease, stroke, kidney failure), which often result in premature death and are often listed as the underlying cause on death certificates rather than diabetes.[5]
The number of people with diabetes has risen from 108 million in 1980 to 422 million in 2014. The global prevalence of diabetes among adults over 18 years of age has risen from 4.7% in 1980 to 8.5% in 2014. Diabetes prevalence has been rising more rapidly in middle- and low-income countries. Diabetes is a major cause of blindness, kidney failure, heart attacks, stroke and lower limb amputation. In 2012, an estimated 1.5 million deaths were directly caused by diabetes and another 2.2 million deaths were attributable to high blood glucose. Half of all deaths attributable to high blood glucose occur before the age of 70 years. WHO projects that diabetes will be the 7th leading cause of death in 2030 . Healthy diet, regular physical activity, maintaining a normal body weight and avoiding tobacco use are ways to prevent or delay the onset of type 2 diabetes. Diabetes can be treated and its consequences avoided or delayed with diet, physical activity, medication and regular screening and treatment for complications.[6]
Epidemiologic patterns of T1D by demographic, geographic, biologic, cultural and other factors in populations are presented to gain insight about the etiology, natural history, risks, and complications of T1D. Data from large epidemiologic studies worldwide indicate that the incidence of T1D has been increasing by 2–5% worldwide and that the prevalence of T1D is approximately 1 in 300 in the US by 18 years of age. Research on risk factors for T1D is an active area of research to identify genetic and environmental triggers that could potentially be targeted for intervention. While significant advances have been made in the clinical care of T1D with resultant improvements in quality of life and clinical outcomes, much more needs to be done to improve care of, and ultimately find a cure for T1D. Epidemiologic studies have an important on-going role to investigate the complex causes, clinical care, prevention, and cure of T1D.
|
wikipedia
|
wiki_7997_chunk_39
|
Advanced Idea Mechanics
|
Television
Though they go unnamed, a group of A.I.M. agents make a cameo in the Spider-Man and His Amazing Friends animated series episode "The X-Men Adventure". They appear in Firestar's flashback attacking the lab where she and Nathan Price worked at before he became the villain Cyberiad.
A.I.M. appears in the 1994 Iron Man animated series.
A.I.M. appears in the Iron Man: Armored Adventures animated series. A.I.M. appears in the episodes "Ready, A.I.M., Fire", "Panther's Prey", "Designed Only For Chaos", "Uncontrollable", and "Titanium vs. Iron" with the Scientist Supreme, Dr. Basil Sandhurst/The Controller and MODOC being antagonists.
A.I.M. appears in The Avengers: Earth's Mightiest Heroes animated series episodes "The Breakout, Part 1", "Everything is Wonderful", "Widow's Sting", "Hail Hydra", "Alone Against A.I.M.", "Prisoner of War", and "Secret Invasion".
A.I.M. appears in the anime series Marvel Anime: Wolverine. In the episode "Mariko", a group of A.I.M. agents chase Tesshin Asano until Wolverine arrives and slays them. In the episodes "Min" and "Vadhaka", Shingen Yashida and Hideki Kurohagi utilize a robot called Vadhaka, which A.I.M. created for their use.
A.I.M. appears in the Avengers Assemble animated series.
A.I.M. appears in the 2017 Spider-Man animated series. In the episode "Symbiotic Relationship", a black-suited Spider-Man confronts and defeats a group of A.I.M. agents before leaving them for the police. In the episode "School of Hard Knocks", A.I.M. uses an elite boarding school called the Bilderberg Academy as a front for Monica Rappaccini to experiment on students and grant them the combined powers of the captured Captain America, Captain Marvel, and Hulk. Spider-Man and Ms. Marvel infiltrate Bilderberg Academy and undo Rappaccini's experiments while Iron Man and Black Widow capture the A.I.M. agents present. In the episode "A Troubled Mind", A.I.M. steals three mental projection devices and combine them with their robotics to create MODOK, only for both to be defeated by the Superior Spider-Man, Iron Man, Black Widow, and Ms. Marvel. In the episode "Amazing Friends", A.I.M. collaborates with Baron Mordo to capture Groot and use him as a template for mystical wood golems, only to be stopped by Spider-Man, Miles Morales, Ironheart, Doctor Strange, and the Totally Awesome Hulk.
A.I.M. appears in the M.O.D.O.K. animated series. This version is entirely founded and led by MODOK, although he eventually leads the organization to go bankrupt, and allows the rival company GRUMBL to buy it out. Throughout the series, MODOK continually schemes to reclaim his position as the leader of A.I.M. and get rid of GRUMBL CEO Austin Van Der Sleet, although these attempts continually end in failure, leading him to be demoted and replaced by Monica Rappanccini as Scientist Supreme; simultaneously, Austin uses A.I.M.'s resources and technology to further the plans of his superior, Hexus, the Living Corporation. By the end of the first season, MODOK sells his A.I.M. shares to Iron Man, enabling him to buy out A.I.M. from GRUMBL, while MODOK, Monica and A.I.M. subordinate Gary go on to establish A-I-M-2 independently.
|
wikipedia
|
wiki_8588_chunk_37
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+ Identities: scalar-by-vector
! scope="col" width="150" | Condition
! scope="col" width="200" | Expression
! scope="col" width="200" | Numerator layout,i.e. by xT; result is row vector
! scope="col" width="200" | Denominator layout,i.e. by x; result is column vector
|-
| a is not a function of x ||
| ||
|-
| a is not a function of x, u = u(x) ||
| colspan=2|
|-
| u = u(x), v = v(x) ||
| colspan=2|
|-
| u = u(x), v = v(x) ||
| colspan=2|
|-
| u = u(x) ||
| colspan=2|
|-
| u = u(x) ||
| colspan=2|
|-
| u = u(x), v = v(x)
|
|
in numerator layout
|
in denominator layout
|-
| u = u(x), v = v(x), A is not a function of x
|
|
in numerator layout
|
in denominator layout
|-
|
|
|
| , the Hessian matrix
|- style="border-top: 3px solid;"
| a is not a function of x || || ||
|-
| A is not a function of x b is not a function of x || || ||
|-
| A is not a function of x || || ||
|-
| A is not a function of x A is symmetric || || ||
|-
| A is not a function of x || || colspan=2|
|-
| A is not a function of x A is symmetric || || colspan=2|
|-
| || || ||
|-
| a is not a function of x, u = u(x)
|
|
in numerator layout
|
in denominator layout
|-
| a, b are not functions of x || || ||
|-
| A, b, C, D, e are not functions of x || || ||
|-
| a is not a function of x || ||||
|}
|
wikipedia
|
wiki_8051_chunk_31
|
Smith–Waterman algorithm
|
The fastest implementation of the algorithm on CPUs with SSSE3 can be found the SWIPE software (Rognes, 2011), which is available under the GNU Affero General Public License. In parallel, this software compares residues from sixteen different database sequences to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. It is faster than BLAST when using the BLOSUM50 matrix.
|
wikipedia
|
wiki_8828_chunk_4
|
List of compositions by Henry Purcell
|
Catches [Z 240–292]
Z 240, Catch, "A health to the nut-brown lass" (1685)
Z 241, Catch, "An ape, a lion, a fox and an ass" (1686)
Z 242, Catch, "As Roger last night to Jenny lay close" (Unknown)
Z 243, Catch, "Bring the bowl and cool Nantz" (1693–94)
Z 244, Catch, "Call for the reckoning" (Unknown)
Z 245, Catch, "Come let us drink" (Unknown)
Z 246, Catch, "Come my hearts, play your parts" (1685)
Z 247, Catch, "Down, down with Bacchus" (1693)
Z 248, Catch, "Drink on till night be spent" (1686)
Z 249, Catch, "Full bags, a brisk bottle" (1686)
Z 250, Catch, "God save our sovereign Charles" (1685)
Z 251, Catch, "Great Apollo and Bacchus" (Unknown)
Z 252, Catch, "Here's a health, pray let it pass" (Unknown)
Z 253, Catch, "Here's that will challenge all the fair" (1680)
Z 254, Catch, "He that drinks is immortal" (1686)
Z 255, Catch, "If all be true that I do think" (1689)
Z 256, Catch, "I gave her cakes and I gave her ale" (1690)
Z 257, Catch, "Is Charleroy's siege come too?" (1693)
Z 258, Catch, "Let the grave folks go preach" (1685)
Z 259, Catch, "Let us drink to the blades" (1691)
Z 260, Catch, "My lady's coachman, John" (1688)
Z 261, Catch, "Now England's great council's assembled" (1685)
Z 262, Catch, "Now, now we are met and humours agree" (1688)
Z 263, Catch, "Of all the instruments that are" (1693)
Z 264, Catch, "Once in our lives let us drink to our wives" (1686)
Z 265, Catch, "Once, twice, thrice, I Julia tried" (Unknown)
Z 266, Catch, "One industrious insect" (Unknown)
Z 267, Catch, "Pale faces, stand by" (1688)
Z 268, Catch, "Pox on you for a fop" (Unknown)
Z 269, Catch, "Prithee be n't so sad and serious" (Unknown)
Z 270, Catch, "Room for th'express" (1694)
Z 271, Catch, "Since the duke is return's" (1685)
Z 272, Catch, "Since time so kind to us does prove" (Unknown)
Z 273, Catch, "Sir Walter enjoying his damsel" (Unknown)
Z 274, Catch, "Soldier, soldier, take off thy wine" (Unknown)
Z 275, Catch, "Sum up all the delights" (1688)
Z 276, Catch, "The Macedon youth" (1686)
Z 277, Catch, "The miller's daughter riding" (1686)
Z 278, Catch, "The surrender of Limerick" (1691)
Z 279, Catch, "'Tis easy to force" (1685)
Z 280, Catch, "'Tis too late for a coach" (1686)
Z 281, Catch, "'Tis women makes us love" (1685)
Z 282, Catch, "To all lovers of music" (1687)
Z 283, Catch, "To thee, to thee and to a maid" (1685)
Z 284, Catch, "True Englishmen drink a good health" (c. 1689)
Z 285, Catch, "Under a green elm lies Luke Shepherd's helm" (1686)
Z 286, Catch, "Under this stone lies Gabriel John" (1686)
Z 287, Catch, "When V and I together meet" (1686)
Z 288, Catch, "Who comes there?" (1685)
Z 289, Catch, "Wine in a morning makes us frolic and gay" (1686)
Z 290, Catch, "Would you know how we meet" (1685)
Z 291, Catch, "Young Colin cleaving of a beam" (1691)
Z 292, Catch, "Young John the gard'ner" (1683)
|
wikipedia
|
wiki_32226_chunk_4
|
Environmental and Engineering Geophysical Society
|
Since 1988 at the Colorado School of Mines, the symposium has been held over a five-day period at locations throughout the United States, with 150 oral and poster presentations, educational workshops, vendor presentations, and a commercial exhibition. A set of proceedings, comprising technical papers presented at the conference, is distributed on CD and available online at EEGS’ Research Collection site.
|
wikipedia
|
wiki_32283_chunk_11
|
Dehn function
|
Basic properties
If G and H are quasi-isometric finitely presented groups and some finite presentation of G has an isoperimetric function f(n) then for any finite presentation of H there is an isoperimetric function equivalent to f(n). In particular, this fact holds for G = H, where the same group is given by two different finite presentations.
Consequently, for a finitely presented group the growth type of its Dehn function, in the sense of the above definition, does not depend on the choice of a finite presentation for that group. More generally, if two finitely presented groups are quasi-isometric then their Dehn functions are equivalent.
For a finitely presented group G given by a finite presentation (∗) the following conditions are equivalent:
G has a recursive Dehn function with respect to (∗).
There exists a recursive isoperimetric function f(n) for (∗).
The group G has solvable word problem.
In particular, this implies that solvability of the word problem is a quasi-isometry invariant for finitely presented groups.
Knowing the area Area(w) of a relation w allows to bound, in terms of |w|, not only the number of conjugates of the defining relations in (♠) but the lengths of the conjugating elements ui as well. As a consequence, it is known that if a finitely presented group G given by a finite presentation (∗) has computable Dehn function Dehn(n), then the word problem for G is solvable with non-deterministic time complexity Dehn(n) and deterministic time complexity Exp(Dehn(n)). However, in general there is no reasonable bound on the Dehn function of a finitely presented group in terms of the deterministic time complexity of the word problem and the gap between the two functions can be quite large.
|
wikipedia
|
wiki_19619_chunk_8
|
Speech codes theory
|
Dell Hymes constructed the S.P.E.A.K.I.N.G. model to aid in the search for speech codes in specific speech communities. The letters stand for the following (as reported by Miller): Situation (setting or scene)
Participants (analysis of personalities and social positions or relationships)
Ends (goals and outcomes)
Acts (message form, content, etc.)
Key (tone or mode)
Instrumentalities (channels or modalities used)
Norms (framework for producing and processing messages)
Genre (interaction type) Teamsterville and Nacirema
|
wikipedia
|
wiki_9431_chunk_3
|
Altruism (biology)
|
Overview
In ethology (the study of behavior), and more generally in the study of social evolution, on occasion, some animals do behave in ways that reduce their individual fitness but increase the fitness of other individuals in the population; this is a functional definition of altruism. Research in evolutionary theory has been applied to social behaviour, including altruism. Cases of animals helping individuals to whom they are closely related can be explained by kin selection, and are not considered true altruism. Beyond the physical exertions that in some species mothers and in some species fathers undertake to protect their young, extreme examples of sacrifice may occur. One example is matriphagy (the consumption of the mother by her offspring) in the spider Stegodyphus; another example is a male spider allowing a female fertilized by him to eat him. Hamilton's rule describes the benefit of such altruism in terms of Wright's coefficient of relationship to the beneficiary and the benefit granted to the beneficiary minus the cost to the sacrificer. Should this sum be greater than zero a fitness gain will result from the sacrifice.
|
wikipedia
|
wiki_938_chunk_11
|
Kruskal's algorithm
|
A variant of Kruskal's algorithm, named Filter-Kruskal, has been described by Osipov et al. and is better suited for parallelization. The basic idea behind Filter-Kruskal is to partition the edges in a similar way to quicksort and filter out edges that connect vertices of the same tree to reduce the cost of sorting. The following pseudocode demonstrates this.
function filter_kruskal(G) is
if |G.E| < kruskal_threshold:
return kruskal(G)
pivot = choose_random(G.E)
, = partition(G.E, pivot)
A = filter_kruskal()
= filter()
A = A ∪ filter_kruskal()
return A
function partition(E, pivot) is
= ∅, = ∅
foreach (u, v) in E do
if weight(u, v) <= pivot then
= ∪ {(u, v)}
else
= ∪ {(u, v)}
return ,
function filter(E) is
= ∅
foreach (u, v) in E do
if find_set(u) ≠ find_set(v) then
= ∪ {(u, v)}
return
|
wikipedia
|
wiki_944_chunk_8
|
Biophysics
|
Focus as a subfield
While some colleges and universities have dedicated departments of biophysics, usually at the graduate level, many do not have university-level biophysics departments, instead having groups in related departments such as biochemistry, cell biology, chemistry, computer science, engineering, mathematics, medicine, molecular biology, neuroscience, pharmacology, physics, and physiology. Depending on the strengths of a department at a university differing emphasis will be given to fields of biophysics. What follows is a list of examples of how each department applies its efforts toward the study of biophysics. This list is hardly all inclusive. Nor does each subject of study belong exclusively to any particular department. Each academic institution makes its own rules and there is much overlap between departments.
|
wikipedia
|
wiki_36883_chunk_4
|
Laboratory for Computational Cultural Dynamics
|
Application
Modeling the subtle complexities of the interactions between human entities is a challenging problem. The LCCD produces applications based on its theoretical models as a method of testing the accuracy, speed, and ease of use of its technology. These applications vary wildly and include:
T-REX, an automated RDF extractor that crawls between 100,000 and 160,000 pages per day to provide searchable access to worldwide events;
OASYS, a tool that provides both quantitative and qualitative analysis of public opinion on certain topics by analyzing news sources. A more sophisticated version is available commercially as SentiMetrix;
SOMA, a formal, logical-statistical reasoning language through which users can express knowledge about the behaviors of particular groups and combine these rules into a functioning agent;
CAGE, a foray into serious games with the intention of providing a virtual world for the exploration of related data, algorithms, and predictions;
STOP, an online portal through which analysts access data regarding SOMA-modeled terror groups.
|
wikipedia
|
wiki_32099_chunk_1
|
RAPTOR (software)
|
Protein threading vs. homology modeling
Researchers attempting to solve a protein's structure start their study with little more than a protein sequence. Initial steps may include performing a PSI-BLAST or PatternHunter search to locate a similar sequences with a known structure in the Protein Data Bank (PDB). If there are highly similar sequences with known structures, there is a high probability that this protein's structure will be very similar to those known structures as well as functions. If there is no homology found, the researcher must perform either X-ray crystallography or nuclear magnetic resonance (NMR) spectroscopy, both of which require considerable time and resources to yield a structure. Where these techniques are too expensive, time-consuming or limited in scope, researchers can use protein threading software, such as RAPTOR to create a highly reliable model of the protein.
|
wikipedia
|
wiki_1637_chunk_2
|
Relational calculus
|
Example
A relational algebra expression might prescribe the following steps to retrieve the phone numbers and names of book stores that supply Some Sample Book: Join book stores and titles over the BookstoreID.
Restrict the result of that join to tuples for the book Some Sample Book.
Project the result of that restriction over StoreName and StorePhone. A relational calculus expression would formulate this query in the following descriptive or declarative manner: Get StoreName and StorePhone for book stores such that there exists a title BK with the same BookstoreID value and with a BookTitle value of Some Sample Book. Mathematical properties
|
wikipedia
|
wiki_18633_chunk_89
|
Algorithm characterizations
|
"We have not given an official definition of what it is for a numerical function to be computable by a Turing machine, specifying how inputs or arguments are to be represented on the machine, and how outputs or values represented. Our specifications for a k-place function from positive integers to positive integers are as follows:
"(a) [Initial number format:] The arguments m1, ... mk, ... will be represented in monadic [unary] notation by blocks of those numbers of strokes, each block separated from the next by a single blank, on an otherwise blank tape.
Example: 3+2, 111B11
"(b) [Initial head location, initial state:] Initially, the machine will be scanning the leftmost 1 on the tape, and will be in its initial state, state 1.
Example: 3+2, 11111B11
"(c) [Successful computation -- number format at Halt:] If the function to be computed assigns a value n to the arguments that are represented initially on the tape, then the machine will eventually halt on a tape containing a block of strokes, and otherwise blank...
Example: 3+2, 11111
"(d) [Successful computation -- head location at Halt:] In this case [c] the machine will halt scanning the left-most 1 on the tape...
Example: 3+2, 1n1111
"(e) [Unsuccessful computation -- failure to Halt or Halt with non-standard number format:] If the function that is to be computed assigns no value to the arguments that are represented initially on the tape, then the machine either will never halt, or will halt in some nonstandard configuration..."(ibid)
Example: Bn11111 or B11n111 or B11111n
|
wikipedia
|
wiki_38561_chunk_15
|
Comparison of programming paradigms
|
Dynamically dispatched message calls v. direct procedure call overheads
In their Abstract "Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis", Jeffrey Dean, David Grove, and Craig Chambers of the Department of Computer Science and Engineering, at the University of Washington, claim that "Heavy use of inheritance and dynamically-bound messages is likely to make code more extensible and reusable, but it also imposes a significant performance overhead, relative to an equivalent but non-extensible program written in a non-object-oriented manner. In some domains, such as structured graphics packages, the performance cost of the extra flexibility provided by using a heavily object-oriented style is acceptable. However, in other domains, such as basic data structure libraries, numerical computing packages, rendering libraries, and trace-driven simulation frameworks, the cost of message passing can be too great, forcing the programmer to avoid object-oriented programming in the “hot spots” of their application."
|
wikipedia
|
wiki_24061_chunk_25
|
Social ecological model
|
Political and economic policies that support the importance of parent's roles in their children's development such as Head Start or Women Infants and Children programs.
Fostering of societal attitudes that value work done on behalf of children at all levels: parents, teachers, extended family, mentors, work supervisors, legislators.
In community health promotion: identifying high impact leverage points and intermediaries within organizations that can facilitate the successful implementation of health promoting interventions, combining person focused and environmentally based components within comprehensive health promotion programs, and measuring the scope and sustainability of intervention outcomes over prolonged periods. Basis of intervention programs to address issues such as bullying, obesity, overeating and physical activity.
Interventions that use the social ecological model as a framework include mass media campaigns, social marketing, and skills development.
In economics: economics, human habits, and cultural characteristics are shaped by geography. In economics, an output is a function of natural resources, human resources, capital resources, and technology. The environment (macrosystem) dictates a considerable amount to the lifestyle of the individual and the economy of the country. For instance, if the region is mountainous or arid and there is little land for agriculture, the country typically will not prosper as much as another country that has greater resources.
In risk communication: used to assist the researcher to analyze the timing of when information is received and identify the receivers and stakeholders. This situation is an environmental influence that may be very far reaching. The individual's education level, understanding, and affluence may dictate what information he or she receives and processes and through which medium.
In personal health: to prevent illnesses, a person should avoid an environment in which they may be more susceptible to contracting a virus or where their immune system would be weakened. This also includes possibly removing oneself from a potentially dangerous environment or avoiding a sick coworker. On the other hand, some environments are particularly conducive to health benefits. Surrounding oneself with physically fit people will potentially act as a motivator to become more active, diet, or work out at the gym. The government banning trans fat may have a positive top-down effect on the health of all individuals in that state or country.
In human nutrition: used as a model for nutrition research and interventions. The social ecological model looks at multiple levels of influence on specific health behaviors. Levels include intrapersonal (individual's knowledge, demographics, attitudes, values, skills, behavior, self-concept, self-esteem), interpersonal (social networks, social supports, families, work groups, peers, friends, neighbors), organizational (norms, incentives, organizational culture, management styles, organizational structure, communication networks), community (community resources, neighborhood organizations, folk practices, non-profit organizations, informal and formal leadership practices), and public policy level (legislation, policies, taxes, regulatory agencies, laws) Multi-level interventions are thought to be most effective in changing behavior.
In public health: drawing upon this model to address the health of a nation's population is viewed as critically important to the strategic alignment of policy and services across the continuum of population health needs, including the design of effective health promotion and disease prevention and control strategies. Thus also, in the development of universal health care systems, it is appropriate to recognize "Health in All Policies" as the overarching policy framework, with public health, primary health care and community services as the cross-cutting framework for all health and health-related services operating across the spectrum from primary prevention to long term care and end-stage conditions. Although this perspective is both logical and well grounded, the reality is different in most settings, and there is room for improvement everywhere.
In politics: the act of politics is making decisions. A decision may be required of an individual, organization, community, or country. A decision a congressman makes affects anyone in his or her jurisdiction. If one makes the decision not to vote for the President of the United States, one has given oneself no voice in the election. If many other individuals choose not to voice their opinion and/or vote, they have inadvertently allowed a majority of others to make the decision for them. On the international level, if the leadership of the U.S. decides to occupy a foreign country it not only affects the leadership; it also affects U.S. service members, their families, and the communities they come from. There are multiple cross-level and interactive effects of such a decision.
|
wikipedia
|
wiki_18470_chunk_2
|
Calculus of predispositions
|
The procedure of calculating predispositions is linked to two steps – dissection of the system on its constituent elements and integration of the analyzed parts in a new whole. According to Katsenelinboigen, the system is structured by two basic types of parameters – material and positional. The material parameters constitute the skeleton of the system. Relationships between them form positional parameters. The calculus of predispositions primarily deals with
analyzing the system’s material and positional parameters as independent variables and
measuring them in unconditional valuations.
"In order to quantify the evaluation of a position we need new techniques, which I have grouped under the heading of calculus of predispositions. This calculus is based on a weight function, which represents a variation on the well-known criterion of optimality for local extremum. This criterion incorporates material parameters and their conditional valuations.
|
wikipedia
|
wiki_16947_chunk_6
|
List of Alabama Civil War Confederate units
|
Miscellaneous
1st Mobile Infantry (Local Defense)
1st Alabama Conscripts (Echol's Company)
1st Battalion, Cadets
1st Conscripts
1st Mobile Volunteers
5th Battalion (Blount's), Volunteers
5th Battalion, Volunteers
18th Battalion, Volunteers
55th Volunteers
Alabama Conscripts
Alabama Rebels
Alabama Recruits
Allen's Company
Arrington's (Captain) Company A, City Troop (Mobile)
Barbiere's Battalion, Cavalry
Barlow's (Captain) Company, Cavalry
Battalion of Conscripts and Reserves
Bay Batteries
Bowie's (Captain) Company, Cavalry
Brooks' (Captain) Company B, City Troop (Mobile)
Calhoun County Reserves
Callaway's (Captain) Company, Cavalry
Camp of Instruction, Talladega, Alabama
Chisolm's (Captain) Company
Coosa County Reserves
Crawford's (Captain) Company
Darby's (Captain) Company, Auburn Home Guards, Volunteers
Echols' (Lieutenant) Company of Conscripts
Fagg's (Captain) Company, Lowndes Rangers, Volunteers
Falkner's (Captain) Company, Cavalry (Chambers Cavalry)
Fayette County Reserves
Fire Battalion of Mobile
Forrest's Cavalry
Freeman's (Captain) Company, Prison Guard
Gachet's Company, Cavalry
Goldsmith's (Captain) Independent Company, Volunteers
Gorff's (Captain) Company (Mobile Pulaski Rifles)
Graves' Company, Cavalry
Hardy's (Captain) Company (Eufaula Minutemen)
Hert's (Captain) Company
Hilliard's Legion
Holloway's Company, Cavalry
Lee, Jr's., (Captain) Company, Volunteers
Leighton Rangers
Lenoir's (Captain) Independent Company, Cavalry
Lewis' Battalion, Cavalry
Lockett's (Captain) Company, City Guards
Meador's (Captain) Company, Volunteers
Miscellaneous, Alabama
Mobile City Troop
Montgomery Guards
Moreland's Regiment, Cavalry
Morris' (Captain) Company (Mounted Men)
Moses' (Captain) Squadron, Cavalry
Murphy's Battalion, Cavalry
Oden's, John (Captain) Company, Mounted Infantry
Orr's (Captain) Company, Morgan Defenders
Rabby's (Captain) Coast Guard Company No. 1, Volunteers
Randolph County Reserves
Reed's Supporting Force, 2d Congressional District
Rives' (Captain) Supporting Force, 9th Congressional District
Roddey's Escort, Cavalry
Shelby County Reserves
Stewart's (Lieutenant) Detachment, Local Defense
Stuart's Battalion, Cavalry
Talladega County Reserves
Toomer's (Captain) Company, Local Defense and Special Service (Chunchula Guards)
Young's (Captain) Company, Nitre and Mining Corps
|
wikipedia
|
wiki_33342_chunk_31
|
Psychometric software
|
Xcalibre
Xcalibre is a commercial program that performs marginal maximum likelihood estimation of both dichotomous (1PL-Rasch, 2PL, 3PL) and all major polytomous IRT models. The interface is point-and-click; no command code required. Its output includes both spreadsheets and a detailed, narrated report document with embedded tables and figures, which can be printed and delivered to subject matter experts for item review. It is only available from Assessment Systems Corporation.
|
wikipedia
|
wiki_11177_chunk_4
|
Davis–Putnam algorithm
|
function DP-SAT(Φ)
repeat
// unit propagation:
while Φ contains a unit clause {l} do
Φ ← remove-from-formula({l}, Φ);
for every clause c in Φ that contains ¬l do
Φ ← remove-from-formula(c, Φ);
Φ ← add-to-formula(c \ {¬l}, Φ);
// eliminate clauses not in normal form:
for every clause c in Φ that contains both a literal l and its negation ¬l do
Φ ← remove-from-formula(c, Φ);
// pure literal elimination:
while there is a literal l that occurs pure in Φ do
for every clause c in Φ that contains l do
Φ ← remove-from-formula(c, Φ);
// stopping conditions:
if Φ is empty then
return true;
if Φ contains an empty clause then
return false;
// Davis-Putnam procedure:
pick a literal l that occurs with both polarities in Φ
for every clause c in Φ containing l and every clause n in Φ containing its negation ¬l do
// resolve c with n:
r ← (c \ {l}) ∪ (n \ {¬l});
Φ ← add-to-formula(r, Φ);
for every clause c that contains l or ¬l do
Φ ← remove-from-formula(c, Φ);
|
wikipedia
|
wiki_15697_chunk_1
|
Bidirectional scattering distribution function
|
BSDF is a superset and the generalization of the BRDF and BTDF. The concept behind all BxDF functions could be described as a black box with the inputs being any two angles, one for incoming (incident) ray and the second one for the outgoing (reflected or transmitted) ray at a given point of the surface. The output of this black box is the value defining the ratio between the incoming and the outgoing light energy for the given couple of angles. The content of the black box may be a mathematical formula which more or less accurately tries to model and approximate the actual surface behavior or an algorithm which produces the output based on discrete samples of measured data. This implies that the function is 4(+1)-dimensional (4 values for 2 3D angles + 1 optional for wavelength of the light), which means that it cannot be simply represented by 2D and not even by a 3D graph. Each 2D or 3D graph, sometimes seen in the literature, shows only a slice of the function.
Some tend to use the term BSDF simply as a category name covering the whole family of BxDF functions.
The term BSDF is sometimes used in a slightly different context, for the function describing the amount of the scatter (not scattered light), simply as a function of the incident light angle. An example to illustrate this context: for perfectly lambertian surface the BSDF (angle)=const. This approach is used for instance to verify the output quality by the manufacturers of the glossy surfaces.
Another recent usage of the term BSDF can be seen in some 3D packages, when vendors use it as a 'smart' category to encompass the simple well known cg algorithms like Phong, Blinn–Phong etc.
Acquisition of the BSDF over the human face in 2000 by Debevec et al. was one of the last key breakthroughs on the way to fully virtual cinematography with its ultra-photorealistic digital look-alikes. The team was the first in the world to isolate the subsurface scattering component (a specialized case of BTDF) using the simplest light stage, consisting on moveable light source, moveable high-res digital camera, 2 polarizers in a few positions and really simple algorithms on a modest computer. The team utilized the existing scientific knowledge that light that is reflected and scattered from the air-to-oil layer retains its polarization while light that travels within the skin loses its polarization. The subsurface scattering component can be simulated as a steady high-scatter glow of light from within the models, without which the skin does not look realistic. ESC Entertainment, a company set up by Warner Brothers Pictures specially to do the visual effects / virtual cinematography system for The Matrix Reloaded and The Matrix Revolutions isolated the parameters for an approximate analytical BRDF which consisted of Lambertian diffusion component and a modified specular Phong component with a Fresnel type of effect.
|
wikipedia
|
wiki_2287_chunk_16
|
Perfect hash function
|
k-perfect hashing
A hash function is -perfect if at most elements from are mapped onto the same value in the range. The "hash, displace, and compress" algorithm can be used to construct -perfect hash functions by allowing up to collisions. The changes necessary to accomplish this are minimal, and are underlined in the adapted pseudocode below:
(4) for all i∈[r], in the order from (2), do
(5) for l←1,2,...
(6) repeat forming Ki←{l(x)|x∈Bi}
(6) until |Ki|=|Bi| and Ki∩{j|T[j]=k}=∅
(7) let σ(i):= the successful l
(8) for all j∈Ki set T[j]←T[j]+1
|
wikipedia
|
wiki_7898_chunk_3
|
Proof of work
|
Background
One popular system, used in Hashcash, uses partial hash inversions to prove that computation was done, as a goodwill token to send an e-mail. For instance, the following header represents about 252 hash computations to send a message to [email protected] on January 19, 2038: X-Hashcash: 1:52:380119:[email protected]:::9B760005E92F0DAE
|
wikipedia
|
wiki_39597_chunk_12
|
Ancillary services (electric power)
|
U.S. Federal Energy Regulatory Commission 1995, Promoting Wholesale Competition Through Open Access Non-discriminatory Transmission Services by Public Utilities, Docket RM95-8-000, Washington, DC, March 29.
E. Hirst and B. Kirby, “Ancillary Services,” Oak Ridge National Laboratory, Technical Report ORNL/CON 310, February 1996. https://web.archive.org/web/20150225160053/http://web.ornl.gov/~webworks/cpr/rpt/84170.pdf
Operations, Power Exchange. "Guide to Ancillary Services in the National Electricity Market." (2010).
|
wikipedia
|
wiki_3020_chunk_12
|
Power of two
|
Selected powers of two
28 = 256
The number of values represented by the 8 bits in a byte, more specifically termed as an octet. (The term byte is often defined as a collection of bits rather than the strict definition of an 8-bit quantity, as demonstrated by the term kilobyte.)
210 = 1,024
The binary approximation of the kilo-, or 1,000 multiplier, which causes a change of prefix. For example: 1,024 bytes = 1 kilobyte (or kibibyte).
212 = 4,096
The hardware page size of an Intel x86-compatible processor.
215 = 32,768
The number of non-negative values for a signed 16-bit integer.
216 = 65,536
The number of distinct values representable in a single word on a 16-bit processor, such as the original x86 processors.
The maximum range of a short integer variable in the C#, and Java programming languages. The maximum range of a Word or Smallint variable in the Pascal programming language.
The number of binary relations on a 4-element set.
220 = 1,048,576
The binary approximation of the mega-, or 1,000,000 multiplier, which causes a change of prefix. For example: 1,048,576 bytes = 1 megabyte (or mebibyte).
224 = 16,777,216
The number of unique colors that can be displayed in truecolor, which is used by common computer monitors.
This number is the result of using the three-channel RGB system, with 8 bits for each channel, or 24 bits in total.
The size of the largest unsigned integer or address in computers with 24-bit registers or data buses.
229 = 536,870,912
The largest power of two with distinct digits in base ten.
230 = 1,073,741,824
The binary approximation of the giga-, or 1,000,000,000 multiplier, which causes a change of prefix. For example, 1,073,741,824 bytes = 1 gigabyte (or gibibyte).
231 = 2,147,483,648
The number of non-negative values for a signed 32-bit integer. Since Unix time is measured in seconds since January 1, 1970, it will run out at 2,147,483,647 seconds or 03:14:07 UTC on Tuesday, 19 January 2038 on 32-bit computers running Unix, a problem known as the year 2038 problem.
232 = 4,294,967,296
The number of distinct values representable in a single word on a 32-bit processor. Or, the number of values representable in a doubleword on a 16-bit processor, such as the original x86 processors.
The range of an int variable in the Java and C# programming languages.
The range of a Cardinal or Integer variable in the Pascal programming language.
The minimum range of a long integer variable in the C and C++ programming languages.
The total number of IP addresses under IPv4. Although this is a seemingly large number, IPv4 address exhaustion is imminent.
The number of binary operations with domain equal to any 4-element set, such as GF(4).
240 = 1,099,511,627,776
The binary approximation of the tera-, or 1,000,000,000,000 multiplier, which causes a change of prefix. For example, 1,099,511,627,776 bytes = 1 terabyte or tebibyte.
250 = 1,125,899,906,842,624
The binary approximation of the peta-, or 1,000,000,000,000,000 multiplier. 1,125,899,906,842,624 bytes = 1 petabyte or pebibyte.
253 = 9,007,199,254,740,992
The number until which all integer values can exactly be represented in IEEE double precision floating-point format. Also the first power of 2 to start with the digit 9 in decimal.
256 = 72,057,594,037,927,936
The number of different possible keys in the obsolete 56 bit DES symmetric cipher.
260 = 1,152,921,504,606,846,976
The binary approximation of the exa-, or 1,000,000,000,000,000,000 multiplier. 1,152,921,504,606,846,976 bytes = 1 exabyte or exbibyte.
263 = 9,223,372,036,854,775,808
The number of non-negative values for a signed 64-bit integer.
264 = 18,446,744,073,709,551,616
The number of distinct values representable in a single word on a 64-bit processor. Or, the number of values representable in a doubleword on a 32-bit processor. Or, the number of values representable in a quadword on a 16-bit processor, such as the original x86 processors.
The range of a long variable in the Java and C# programming languages.
The range of a Int64 or QWord variable in the Pascal programming language.
The total number of IPv6 addresses generally given to a single LAN or subnet.
One more than the number of grains of rice on a chessboard, according to the old story, where the first square contains one grain of rice and each succeeding square twice as many as the previous square. For this reason the number 264 − 1 is known as the "chess number".
264 − 1 is also the number of moves required to complete the legendary 64-disk version of the Tower of Hanoi.
268 = 295,147,905,179,352,825,856
The first power of 2 to contain all decimal digits.
270 = 1,180,591,620,717,411,303,424
The binary approximation of the zetta-, or 1,000,000,000,000,000,000,000 multiplier. 1,180,591,620,717,411,303,424 bytes = 1 zettabyte (or zebibyte).
280 = 1,208,925,819,614,629,174,706,176
The binary approximation of the yotta-, or 1,000,000,000,000,000,000,000,000 multiplier. 1,208,925,819,614,629,174,706,176 bytes = 1 yottabyte (or yobibyte).
286 = 77,371,252,455,336,267,181,195,264
286 is conjectured to be the largest power of two not containing a zero in decimal.
296 = 79,228,162,514,264,337,593,543,950,336
The total number of IPv6 addresses generally given to a local Internet registry. In CIDR notation, ISPs are given a , which means that 128-32=96 bits are available for addresses (as opposed to network designation). Thus, 296 addresses.
2108 = 324,518,553,658,426,726,783,156,020,576,256
The largest known power of 2 not containing a 9 in decimal.
2126 = 85,070,591,730,234,615,865,843,651,857,942,052,864
The largest known power of 2 not containing a pair of consecutive equal digits.
2128 =
The total number of IP addresses available under IPv6. Also the number of distinct universally unique identifiers (UUIDs).
2168 =
The largest known power of 2 not containing all decimal digits (the digit 2 is missing in this case).
2192 =
The total number of different possible keys in the AES 192-bit key space (symmetric cipher).
2229 = 862,718,293,348,820,473,429,344,482,784,628,181,556,388,621,521,298,319,395,315,527,974,912
2229 is the largest known power of two containing the least number of zeros relative to its power. It is conjectured by Metin Sariyar that every digit 0 to 9 is inclined to appear an equal number of times in the decimal expansion of power of two as the power increases.
2256 =
The total number of different possible keys in the AES 256-bit key space (symmetric cipher).
2333 =
The smallest power of 2 greater than a googol (10100).
21024 =
The maximum number that can fit in an IEEE double-precision floating-point format, and hence the maximum number that can be represented by many programs, for example Microsoft Excel.
282,589,933 =
One more than the largest known prime number . It has 24,862,047 digits.
|
wikipedia
|
wiki_19899_chunk_1
|
MARK IV (software)
|
MARK IV was developed for IBM Systems (360 and 370) and for the RCA Spectra 70. Its main benefit was allowing faster application development on the order of 6 to 10 times faster than doing a system using a 3GL, such as COBOL. MARK IV, being an early 4GL, allowed user development of systems related to business. In a 1971 ad by Informatics, there are several quotes from customers, such as:
We conservatively estimate that the benefits derived from the MARK IV System have completely returned the cost of our investment in a period of less than 3 months.
MARK IV runs ... handle Accounts Receivable, Inventory, Sales Analyses, etc. on about 26 different factories.
|
wikipedia
|
wiki_626_chunk_19
|
Combinatorial chemistry
|
Oftentimes, it is not possible to use expensive equipment, and Schwabacher, et al. describe a simple method of combining parallel synthesis of library members and evaluation of entire libraries of compounds. In their method, a thread that is partitioned into different regions is wrapped around a cylinder, where a different reagent is then coupled to each region which bears only a single species. The thread is then re-divided and wrapped around a cylinder of a different size, and this process is then repeated. The beauty of this method is that the identity of each product can be known simply by its location along the thread, and the corresponding biological activity is identified by Fourier transformation of fluorescence signals.
|
wikipedia
|
wiki_14206_chunk_5
|
Chemistry education
|
Perspective of chemical educators
A second perspective is defined by a self-identified group of chemical educators, faculty members and instructors who, as opposed to declaring their primary interest in a typical area of laboratory research (organic, inorganic, biochemistry, etc.), take on an interest in contributing suggestions, essays, observations, and other descriptive reports of practice into the public domain, through journal publications, books, and presentations. Dr. Robert L. Lichter, then-Executive Director of the Camille and Henry Dreyfus Foundation, speaking in a plenary session at the 16th Biennial Conference on Chemical Education (recent BCCE meetings: ,), posed the question of why do terms like ‘chemical educator' even exist in higher education, when there is a perfectly respectable term for this activity, namely, ‘chemistry professor.’ One criticism of this view is that few professors bring any formal preparation in or background about education to their jobs, and so lack any professional perspective on the teaching and learning enterprise, particularly discoveries made about effective teaching and how students learn.
|
wikipedia
|
wiki_15588_chunk_20
|
N-body simulation
|
An example of a programmatically stable and scalable method for containing kinematic data for a particle is the use of fixed length arrays, which in optimised code allows for easy memory allocation and prediction of consumed resources. In C++, this is trivial:struct Vector3
{
double e[3] = { 0 }; Vector3() {}
~Vector3() {}
|
wikipedia
|
wiki_39905_chunk_12
|
Religious and political symbols in Unicode
|
Tibetan block
The Unicode chart for the Tibetan block notes several religious symbols:
{| class="wikitable" style="text-align:center"
|-
! Symbol !! Code point !! Name and notes
|-
| || U+0FD5 || style="text-align:left" | RIGHT-FACING SVASTI SIGN = gyung drung nang -khor (symbol of good luck and well-being in India)
|-
| || U+0FD6 || style="text-align:left" | LEFT-FACING SVASTI SIGN = gyung drung phyi -khor
|-
| || U+0FD7 || style="text-align:left" | RIGHT-FACING SVASTI SIGN WITH DOTS = gyung drung nang -khor bzhi mig can
|-
| || U+0FD8 || style="text-align:left" | LEFT-FACING SVASTI SIGN WITH DOTS = gyung drung phyi -khor bzhi mig can
|}
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.