id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_27985_chunk_17
|
Bees algorithm
|
for i= 1 : group_random % For the remaining random bees
beeIndex = beeIndex + 1;
solution(beeIndex,1:maxParameters)= generate_random_solution(maxParameters,min, max); % generate a new random solution at the index beeIndex
solution(beeIndex,maxParameters+1)= evaluate_fitness(solution); % evaluate its fitness
sorted_population(beeIndex,:) = [solution(1 : maxParameters),fit]; % copy the new random solution and its fitness to the sorted population matrix
end
sorted_population=sortrows(sorted_population); % sort the population based on their fitnesses
Best_solution_sofar=sorted_population(1,:);
disp('Best:');disp(Best_solution_sofar); % Display the best solution of current iteration
end % end of GBA's main loop
end % end of main function
|
wikipedia
|
wiki_428_chunk_5
|
Online algorithm
|
Online problems
A problem exemplifying the concepts of online algorithms is the Canadian Traveller Problem. The goal of this problem is to minimize the cost of reaching a target in a weighted graph where some of the edges are unreliable and may have been removed from the graph. However, that an edge has been removed (failed) is only revealed to the traveller when she/he reaches one of the edge's endpoints. The worst case for this problem is simply that all of the unreliable edges fail and the problem reduces to the usual Shortest Path Problem. An alternative analysis of the problem can be made with the help of competitive analysis. For this method of analysis, the offline algorithm knows in advance which edges will fail and the goal is to minimize the ratio between the online and offline algorithms' performance. This problem is PSPACE-complete.
|
wikipedia
|
wiki_25511_chunk_40
|
Nuclear power in China
|
Summary of nuclear power plants Where multiple reactors are operational/under construction/planned at a given site, the capacity given is to be understood for all reactors at this site applicable to the given column, not a per reactor figure. Fuel cycle China is evaluating the construction of a high level waste (HLW) repository in the Gobi Desert, probably constructed near Beishan starting around 2041.
|
wikipedia
|
wiki_20326_chunk_8
|
Shrinkage (statistics)
|
Hausser and Strimmer "develop a James-Stein-type shrinkage estimator, resulting in a procedure that is highly efficient statistically as well as computationally. Despite its simplicity, ...it outperforms eight other entropy estimation procedures across a diverse range of sampling scenarios and data-generating models, even in cases of severe undersampling. ...method is fully analytic and hence computationally inexpensive. Moreover, ...procedure simultaneously provides estimates of the entropy and of the cell frequencies. ...The proposed shrinkage estimators of entropy and mutual information, as well as all other investigated entropy estimators, have been implemented in R (R Development Core Team, 2008). A corresponding R package “entropy” was deposited in the R archive CRAN and is accessible at the URL https://cran.r-project.org/web/packages/entropy/ under the GNU General Public License."
|
wikipedia
|
wiki_5418_chunk_7
|
Engineering notation
|
{| class="wikitable" style="padding:0; text-align:center; width:0"
! colspan="5" | SI prefixes
|-
!style="text-align:center" colspan="2" | Prefix
!style="text-align:center" colspan="3" | Representations
|-
! style="text-align:center" | Name
! style="text-align:center" | Symbol
! style="text-align:center" | Base 1000
! style="text-align:center" | Base 10
! style="text-align:center" | Value
|-
| yotta
| Y
| style="text-align:left;" | 10008
| style="text-align:left;" | 1024
| style="text-align:right;" |
|-
| zetta
| Z
| style="text-align:left;" | 10007
| style="text-align:left;" | 1021
| style="text-align:right;" |
|-
| exa
| E
| style="text-align:left;" | 10006
| style="text-align:left;" | 1018
| style="text-align:right;" |
|-
| peta
| P
| style="text-align:left;" | 10005
| style="text-align:left;" | 1015
| style="text-align:right;" |
|-
| tera
| T
| style="text-align:left;" | 10004
| style="text-align:left;" | 1012
| style="text-align:right;" |
|-
| giga
| G
| style="text-align:left;" | 10003
| style="text-align:left;" | 109
| style="text-align:right;" |
|-
| mega
| M
| style="text-align:left;" | 10002
| style="text-align:left;" | 106
| style="text-align:right;" |
|-
| kilo
| k
| style="text-align:left;" | 10001
| style="text-align:left;" | 103
| style="text-align:right;" |
|- style="background-color:#EEE"
| colspan="2" |
| style="text-align:left;" | 10000
| style="text-align:left;" | 100
| style="text-align:center;" | 1
|-
| milli
| m
| style="text-align:left;" | 1000−1
| style="text-align:left;" | 10−3
| style="text-align:left;" |
|-
| micro
| μ
| style="text-align:left;" | 1000−2
| style="text-align:left;" | 10−6
| style="text-align:left;" |
|-
| nano
| n
| style="text-align:left;" | 1000−3
| style="text-align:left;" | 10−9
| style="text-align:left;" |
|-
| pico
| p
| style="text-align:left;" | 1000−4
| style="text-align:left;" | 10−12
| style="text-align:left;" |
|-
| femto
| f
| style="text-align:left;" | 1000−5
| style="text-align:left;" | 10−15
| style="text-align:left;" |
|-
| atto
| a
| style="text-align:left;" | 1000−6
| style="text-align:left;" | 10−18
| style="text-align:left;" |
|-
| zepto
| z
| style="text-align:left;" | 1000−7
| style="text-align:left;" | 10−21
| style="text-align:left;" |
|-
| yocto
| y
| style="text-align:left;" | 1000−8
| style="text-align:left;" | 10−24
| style="text-align:left;" |
|}
|
wikipedia
|
wiki_36736_chunk_17
|
Conditional probability
|
{| class="wikitable" style="background:silver; text-align:center; width:300px"
|+ Table 2
! rowspan=2 colspan=2 | +
! colspan=6 | D2
|-
! scope="col" | 1
! scope="col" | 2
! scope="col" | 3
! scope="col" | 4
! scope="col" | 5
! scope="col" | 6
|-
! rowspan=6 scope="row" | D1
! 1
| style="background:red;" | 2 || style="background:red;" | 3 || style="background:red;" | 4 || style="background:red;" | 5 || 6 || 7
|-
! scope="row" | 2
| style="background:red;" | 3 || style="background:red;" | 4 || style="background:red;" | 5 || 6 || 7 || 8
|-
! scope="row" | 3
| style="background:red;" | 4 || style="background:red;" | 5 || 6 || 7 || 8 || 9
|-
! scope="row" | 4
| style="background:red;" | 5 || 6 || 7 || 8 || 9 || 10
|-
! scope="row" | 5
| 6 || 7 || 8 || 9 || 10 || 11
|- style="background: red;"
|-
! scope="row" | 6
| 7 || 8 || 9 || 10 || 11 || 12
|- style="background: red;"
|}
|
wikipedia
|
wiki_2114_chunk_2
|
Edmonds–Karp algorithm
|
Pseudocode
algorithm EdmondsKarp is
input:
graph (graph[v] should be the list of edges coming out of vertex v in the
original graph and their corresponding constructed reverse edges
which are used for push-back flow.
Each edge should have a capacity, flow, source and sink as parameters,
as well as a pointer to the reverse edge.)
s (Source vertex)
t (Sink vertex)
output:
flow (Value of maximum flow)
flow := 0 (Initialize flow to zero)
repeat
(Run a breadth-first search (bfs) to find the shortest s-t path.
We use 'pred' to store the edge taken to get to each vertex,
so we can recover the path afterwards)
q := queue()
q.push(s)
pred := array(graph.length)
while not empty(q)
cur := q.pull()
for Edge e in graph[cur] do
if pred[e.t] = null and e.t ≠ s and e.cap > e.flow then
pred[e.t] := e
q.push(e.t)
if not (pred[t] = null) then
(We found an augmenting path.
See how much flow we can send)
df := ∞
for (e := pred[t]; e ≠ null; e := pred[e.s]) do
df := min(df, e.cap - e.flow)
(And update edges by that amount)
for (e := pred[t]; e ≠ null; e := pred[e.s]) do
e.flow := e.flow + df
e.rev.flow := e.rev.flow - df
flow := flow + df
until pred[t] = null (i.e., until no augmenting path was found)
return flow
|
wikipedia
|
wiki_25804_chunk_5
|
Serviceability (computer)
|
Additional characteristics and capabilities that have been observed in service tools:
Time of data collection: some tools can collect data immediately, as soon as problem occurs, others are delayed in collecting data.
Pre-analyzed, or not-yet-analyzed data: some tools collect ‘external’ data, while others collect ‘internal’ data. This is seen when comparing system messages (natural language-like statements in the user’s native language) vs. ‘binary’ storage dumps.
Partial or full set of system state data: some tools collect a complete system state vs. a partial system state (user or partial ‘binary’ storage dump vs. complete system dump).
Raw or analyzed data: some tools display raw data, while others analyze it (examples storage dump formatters that format data, vs. ‘intelligent’ data formatters (“ANALYZE” is a common verb) that combine product knowledge with analysis of state variables to indicate the ‘meaning’ of the data.
Programmable tools vs. ‘fixed function’ tools. Some tools can be altered to get varying amounts of data, at varying times. Some tools have only a fixed function.
Automatic or manual? Some tools are built into a product, to automatically collect data when a fault or failure occurs. Other tools have to be specifically invoked to start the data collection process.
Repair or non-repair? Some tools collect data as a fore-runner to an automatic repair process (self-healing/fault tolerant). These tools have the challenge of quickly obtaining unaltered data before the desired repair process starts.
|
wikipedia
|
wiki_30079_chunk_8
|
Autonomic Network Architecture
|
As a first step, a network based on the predominant infrastructure of Ethernet switches and wireless access points will be built. The goal is to demonstrate self-organization of individual nodes into a network. The design of such network should potentially scale to large network meshes in the range of 105 active (routing) elements. Obviously, the consortium alone will not have resources to literally build a network of 105 nodes. In order to show scalability, three approaches are envisaged: a) overlay for interconnecting the participating sites, b) simulations, and c) a distributed open collaborative approach similar to successful initiatives such as “SETI@Home”, “Folding@Home”, to include external experimentators and to disseminate ANA results.
|
wikipedia
|
wiki_38249_chunk_54
|
Algorithmic skeleton
|
SkeTo
The SkeTo project is a C++ library which achieves parallelization using MPI. SkeTo is different from other skeleton libraries because instead of providing nestable parallelism patterns, SkeTo provides parallel skeletons for parallel data structures such as: lists, trees, and matrices. The data structures are typed using templates, and several parallel operations can be invoked on them. For example, the list structure provides parallel operations such as: map, reduce, scan, zip, shift, etc...
|
wikipedia
|
wiki_34910_chunk_57
|
Watson (computer)
|
Further reading
Baker, Stephen (2012) Final Jeopardy: The Story of Watson, the Computer That Will Transform Our World, Mariner Books.
Jackson, Joab (2014). IBM bets big on Watson-branded cognitive computing PCWorld: Jan 9, 2014 2:30 PM
Greenemeier, Larry. (2013). Will IBM's Watson Usher in a New Era of Cognitive Computing? Scientific American. Nov 13, 2013 |* Lazarus, R. S. (1982).
Kelly, J.E. and Hamm, S. ( 2013). Smart Machines: IBM's Watson and the Era of Cognitive Computing. Columbia Business School Publishing
|
wikipedia
|
wiki_37642_chunk_4
|
Polymorphic recursion
|
Functional programming data structures often use polymorphic recursion to simplify type error checks and solve problems with nasty "middle" temporary solutions that devour memory in more traditional data structures such as trees. In the two citations that follow, Okasaki (pp. 144–146) gives a CONS example in Haskell wherein the polymorphic type system automatically flags programmer errors. The recursive aspect is that the type definition assures that the outermost constructor has a single element, the second a pair, the third a pair of pairs, etc. recursively, setting an automatic error finding pattern in the data type. Roberts (p. 171) gives a related example in Java, using a Class to represent a stack frame. The example given is a solution to the Tower of Hanoi problem wherein a stack simulates polymorphic recursion with a beginning, temporary and ending nested stack substitution structure.
|
wikipedia
|
wiki_15212_chunk_10
|
Low-energy electron diffraction
|
An electron gun from which monochromatic electrons are emitted by a cathode filament which is at a negative potential, typically 10–600 V, with respect to the sample. The electrons are accelerated and focused into a beam, typically about 0.1 to 0.5 mm wide, by a series of electrodes serving as electron lenses. Some of the electrons incident on the sample surface are backscattered elastically, and diffraction can be detected if sufficient order exists on the surface. This typically requires a region of single crystal surface as wide as the electron beam, although sometimes polycrystalline surfaces such as highly oriented pyrolytic graphite (HOPG) are sufficient.
A high-pass filter for scattered electrons in the form of a retarding field analyzer, which blocks all but elastically scattered electrons. It usually contains three or four hemispherical concentric grids. Because only radial fields around the sampled point would be allowed and the geometry of the sample and the surrounding area is not spherical, the space between the sample and the analyzer has to be field-free. The first grid, therefore, separates the space above the sample from the retarding field. The next grid is at a negative potential to block low energy electrons, and is called the suppressor or the gate. To make the retarding field homogeneous and mechanically more stable another grid at the same potential is added behind the second grid. The fourth grid is only necessary when the LEED is used like a tetrode and the current at the screen is measured, when it serves as screen between the gate and the anode.
A hemispherical positively-biased fluorescent screen on which the diffraction pattern can be directly observed, or a position-sensitive electron detector. Most new LEED systems use a reverse view scheme, which has a minimized electron gun, and the pattern is viewed from behind through a transmission screen and a viewport. Recently, a new digitized position sensitive detector called a delay-line detector with better dynamic range and resolution has been developed.
|
wikipedia
|
wiki_16469_chunk_12
|
Nanyang Technological University Libraries
|
Abdul Aziz, N., Chia, Y. B., & Loh, H. (2010). Sowing the seeds: towards reaping a harvest using social web applications in Nanyang Technological University Library. IFLA World Library and Information Congress (WLIC) 2010, (August), 1–25. Retrieved from http://dr.ntu.edu.sg/handle/10220/6450
|
wikipedia
|
wiki_1696_chunk_18
|
Relevance logic
|
Humberstone models
Urquhart showed that the semilattice logic for R is properly stronger than the positive fragment of R. Lloyd Humberstone provided an enrichment of the operational models that permitted a different truth condition for disjunction. The resulting class of models generates exactly the positive fragment of R. An operational frame is a quadruple , where is a non-empty set, , and {, } are binary operations on . Let be defined as . The frame conditions are the following.
|
wikipedia
|
wiki_2418_chunk_4
|
Source lines of code
|
Consider this snippet of C code as an example of the ambiguity encountered when determining SLOC:
for (i = 0; i < 100; i++) printf("hello"); /* How many lines of code is this? */ In this example we have:
1 physical line of code (LOC),
2 logical lines of code (LLOC) (for statement and printf statement),
1 comment line.
|
wikipedia
|
wiki_4683_chunk_40
|
Powers (comics)
|
DC/Jinxworld reprints:
Powers: Book One trade paperback (2018, collects Vol. 1 #1–11, the complete Powers comic strips from Comic Shop News, the Powers Coloring/Activity Book; )
Powers: Book Two trade paperback (2019, collects Vol. 1 #12–24; Annual 1 )
Powers: Book Three trade paperback (2019, collects Vol. 1 #25–37; )
Powers: Book Four trade paperback (2019, collects Vol. 2 #1–18; )
Powers: Book Five trade paperback (2019, collects Vol. 2 #19–30, Annual 2008; )
Powers: Book Six trade paperback (2019, collects Vol. 3 #1–11 )
Powers: Book Seven trade paperback (2019, collects Bureau Vol. 1+2 #1–12 )
Powers: Script Book'' (reprints original scripts for Vol. 1 #1–11; )
|
wikipedia
|
wiki_13635_chunk_11
|
Software pipelining
|
The prologue and epilogue handle iterations at the beginning and end of the loop. Here is a possible prologue for our example above:
; loop prologue (arranged on lines for clarity)
A(1)
A(2), B(1)
A(3), B(2), C(1)
A(4), B(3), C(2) ; cannot start D(1) yet
A(5), B(4), C(3), D(1)
A(6), B(5), C(4), D(2), E(1)
Each line above corresponds to an iteration of the main pipelined loop, but without the instructions for iterations that have not yet begun. Similarly, the epilogue progressively removes instructions for iterations that have completed:
; loop epilogue (arranged on lines for clarity)
B(bignumber), C(bignumber-1), D(bignumber-3), E(bignumber-4), F(bignumber-5)
C(bignumber), D(bignumber-2), E(bignumber-3), F(bignumber-4)
D(bignumber-1), E(bignumber-2), F(bignumber-3)
D(bignumber), E(bignumber-1), F(bignumber-2)
E(bignumber), F(bignumber-1)
F(bignumber)
|
wikipedia
|
wiki_2506_chunk_10
|
Tissue engineering
|
In 1960, Wichterle and Lim were the first to publish experiments on hydrogels for biomedical applications by using them in contact lens construction. Work on the field developed slowly over the next two decades, but later found traction when hydrogels were repurposed for drug delivery. In 1984, Charles Hull developed bioprinting by converting a Hewlett-Packard inkjet printer into a device capable of depositing cells in 2-D. Three dimensional (3-D) printing is a type of additive manufacturing which has since found various applications in medical engineering, due to its high precision and efficiency. With biologist James Thompson's development of first human stem cell lines in 1998 followed by transplantation of first laboratory-grown internal organs in 1999 and creation of the first bioprinter in 2003 by the University of Missouri when they printed spheroids without the need of scaffolds, 3-D bioprinting became more conventionally used in medical field than ever before. So far, scientists have been able to print mini organoids and organs-on-chips that have rendered practical insights into the functions of a human body. Pharmaceutical companies are using these models to test drugs before moving on to animal studies. However, a fully functional and structurally similar organ hasn't been printed yet. A team at University of Utah has reportedly printed ears and successfully transplanted those onto children born with defects that left their ears partially developed.
Today hydrogels are considered the preferred choice of bio-inks for 3-D bioprinting since they mimic cells' natural ECM while also containing strong mechanical properties capable of sustaining 3-D structures. Furthermore, hydrogels in conjunction with 3-D bioprinting allow researchers to produce different scaffolds which can be used to form new tissues or organs. 3-D printed tissues still face many challenges such as adding vasculature. Meanwhile, 3-D printing parts of tissues definitely will improve our understanding of the human body, thus accelerating both basic and clinical research.
|
wikipedia
|
wiki_12562_chunk_11
|
POWER3
|
References
- gives more information about POWER1, POWER2, and POWER3
O'Connell, F. P.; White, S. W. (6 November 2000). "POWER3: The next generation of PowerPC processors". IBM Journal of Research and Development, Volume 44, Number 6.
Song, Peter (17 November 1997). "IBM's Power3 to Replace P2SC". Microprocessor Report.
International Business Machines Corporation (5 October 1998). New IBM POWER3 chip. Press release.
|
wikipedia
|
wiki_561_chunk_8
|
Spaghetti code
|
Here is another example of Spaghetti code with embedded GOTO statements.
INPUT "How many numbers should be sorted? "; T
DIM n(T)
FOR i = 1 TO T
PRINT "NUMBER:"; i
INPUT n(i)
NEXT i
'Calculations:
C = T
E180:
C = INT(C / 2)
IF C = 0 THEN GOTO C330
D = T - C
E = 1
I220:
f = E
F230:
g = f + C
IF n(f) > n(g) THEN SWAP n(f), n(g)
f = f - C
IF f > 0 THEN GOTO F230
E = E + 1
IF E > D THEN GOTO E180
GOTO I220
C330:
PRINT "The sorted list is"
FOR i = 1 TO T
PRINT n(i)
NEXT i
|
wikipedia
|
wiki_30349_chunk_16
|
Global Energy and Water Exchanges
|
Second phase (2003–2012)
Phase II, "Full Implementation" (2003–2012) of GEWEX is to "exploit new capabilities" developed during phase I such as new satellite information and, increasingly, new models. These include changes in the Earth's energy budget and water cycle, contribution of processes in climate feedback, causes of natural variability, predicting changes on seasonal or annual timescales, and how changes impact water resources. Phase II of is designed to be active models that have use to regional resource managers in real time. Some phases, such as the GAME (GEWEX Asia Monsoon Experiment) are already completed . GEWEX has become an umbrella program for the coordination of studies and experiments around the world. Reports from the phase I are still being produced and it will be some time before the results of the second phase are available. The experiment is still in progress.
|
wikipedia
|
wiki_17114_chunk_6
|
Fragment molecular orbital
|
In the FMO book published in 2009, one can find 10 illustrated chapters written by the experts in the FMO development and applications, as well as a CDROM with
annotated samples of input and output files, Facio modelling software and video tutorials (AppliGuide movies, showing mouse clicks) for treating difficult PDB files with Facio. In addition to this book, there are several chapters published in other books. There are three general reviews of FMO published.
|
wikipedia
|
wiki_33079_chunk_3
|
List of programmes broadcast by 8TV (Malaysian TV network)
|
3.03 A.M
5 Jingga
8 Chart Show
8 Corners
8TV 18th Anniversary Bonanza (8 January 2022) (Sponsored by Abbott Laboratories - Ensure Malaysia - Ensure Gold) (Reality Television) (Repeated on 15 January 2022)
8 E-Channel (formerly known as 8 E-News)
8 E-News Mini Concert (8 January 2022)
8 E-News (2004-2021)
8 E-News 2022
8TV Express Live
8 Mini Century 8TV Express 8TV Global Watch (30 April 2018 until 31 December 2019) (Last broadcast by NTV7 on 2 March 2018 before migrating to 8TV)
8TV Mandarin News (Daily broadcast)
8TV Nite Live The 8TV Quickie (8 January 2004) (replaced by 8TV Express)
8 Style ACCCIM Centennial History Documentary (25 June 2021) (Reality Television)
Alam's Story Alert Alice in Wonderland (repeat of NTV7 drama)
Amusing Race Away from Home (repeat of NTV7 drama)
A New Journey (February 2021)
A New Journey (Season 8) (11 June 2021) (Reality Television) (Repeat broadcast on 21 June 2021)
A New Journey CNY Special 2022 (31 January 2022) (Reality Television) (Repeat broadcast on 2 February 2022)
A beautiful world (repeat of NTV7 drama)
Back to the Foodture (8 August 2021) (Reality Television)
Beautiful World - My Pet Lover (5 November 2017) (Drama repeated on 19 September 2021) (Local drama series)
Behind The Scam Behind The Scam (Season 2) (10 November 2019) (Repeat broadcast on 3 October 2020) (10 episodes) (Repeat broadcast on 24 June 2021) (3 episodes) (Repeat broadcast on 2 October 2021) (4 episodes)
Best In The World The Best of Latte Blogger BoyBonus Vacation (13 February 2021)
Brilliant Mind Budget 2022 (29 October 2021)
CJ Wow Shop Celebrity Chat Celebrities Living REC (2 July 2021) (Reality Television) (Repeat broadcast on 2 October 2021) (2 episodes back to back)
China Star Click to Health (10 October 2021) (Reality Television) (Repeat broadcast on 14 October 2021)
Cook Vs Chef (16 January 2022) (Sponsored by Panasonic Malaysia) (Reality Television)
Crime Scene Da Funki Monkee Destinasi Bajet (Reality Television - Travel Show)
Didik TV@8TV(Chinese Version) (Beginning 3 January 2022)
Discover Smiles Zoom Malaysia Double Triple or Nothing Double Triple or Nothing Kids Durian, Kaya, Teh Tarik (24 February 2019) (Reality Television - Game Show)
Durian, Kaya, Teh Tarik (Season Two) (2020) (Reality Television - Game Show)
Durian, Kaya, Teh Tarik (Season Three) (18 April 2021) (Reality Television - Game Show)
Durian, Kaya, Teh Tarik (Season Four) (13 February 2022) (Reality Television - Game Show)
Durian, Kaya, Teh Tarik CNY Special 2022 (1 February 2022, 2 February 2022), (Repeat broadcast on 4 February 2022, 5 February 2022)
Eve's Diary Eyes on You Family Health (11 July 2021) (Reality Television) (Repeat broadcast on 15 July 2021)
Family Singing Show (2 August 2020) (Sponsored by Ebene) (Reality Television)
Family Singing Show CNY Special (12 February 2021) (Reality Television) (Festive: Chinese New Year Singing Show)
Family Singing Show Season 2 (6 June 2021) (Sponsored by Ginvera) (Reality Television)
Famous Chinese Cuisine Fantasia: A Modern Fairy Tale Folks and Tales Footprints in history Fortune Special 2021 (31 January 2021) (Reality Television - Festive: Chinese New Year Seasonal Fortune Telling Show)
Fortune Special 2022 (9 January 2022) (Reality Television - Festive: Chinese New Year Seasonal Fortune Telling Show) (Repeat broadcast on 24 January, 25 January, 31 January and 8 February 2022)
G-Thang Ghost Girls Day Out (26 November 2021) (Reality Television) (Repeat broadcast on 29 November 2021)
Go-Go-Go Go Travel (Reality Television - Travel Show)
Gol & Gincu The Series Gol & Gincu The Series#Season 1 (4 June 2006)
Gol & Gincu The Series#Season 2 (8 July 2007)
Growth Behind The Sun (6 October 2017) (Repeat on 7 August 2020)
The Gossip World Health Amazing! (Coming Soon in 2022)
Hey Morning Hip Hoppin Asia Ho Chak! (Reality Television)
Ho Chak! Japan (2017)
Ho Chak! 2021/Ho Chak! Eat Live Well (18 April 2021) (Show resume on 7 November 2021) (Reality Television) (Repeat broadcast on 12 November 2021)
Ho Chak! CNY Special 2022 (30 January 2022) (Repeat broadcast on 2 February 2022)
Homecoming (8TV variety show) (Coming Soon in Season 2 on 15 April 2022)
Hot Chef Hot FM AM KREW I am not a loser (repeat of NTV7 drama)
I Can See Your Voice Malaysia Mandarin Season 1 (20 August 2017) (Reality Television)
I Can See Your Voice Malaysia Season 2 (19 August 2018) (Repeat broadcast on 7 November 2021) (Reality Television)
I Dare You! I Wanna Be A Model I Wanna Sing Identity Switched (repeat of NTV7 drama)
In-Laws 2 (repeat of NTV7 drama)
Journey To Royal Cuisine Jade Awards (Coming Soon 24 September 2022) (Live on 8TV & Astro)
Kan-Cheong Kitchen (Reality Television)
King of Dessert King Of Travelogue (11 February 2022) (Reality Television - Travel Show) (Repeat broadcast on 15 February 2022)
KL Lights Latte @ 8 Let's Cycle Let's Cycle (Season Two) (Repeat broadcast on 8 September 2021)
Let's Cycle (Season Three) (Repeat broadcast on 8 December 2021)
Living Delight (moved from NTV7)
Living Delight x Wow Shop (2021/2022)
Love At First Song (7 November 2021) (Sponsored by Cuckoo Malaysia - Wonderdewi by Wonderlab) (Reality Television)
Love in Seoul Majalah 3: All Covid-19 Specials Series (Mandarin Subtitled) (Reality Television - Documentary)
Majalah 3: The Cries for Help of Klang Valley (2 January 2022) (Mandarin Subtitled) (Reality Television - Documentary)
Malaysian Idol (Reality Television)
Malaysia's Most Beautiful MasterChef Malaysia (Reality Television) (Coming Soon in Late July 2022)
The Memoir Of Majie (Repeat of NTV7 drama)
Memories Puzzle (Repeat broadcast on 23 August 2021)(Reality Television)
Midday Mandarin News Miss Malaysia Tourism Pageant 2021 (1 May 2021) (Reality Television)
Miss Tourism International 2021/22 (19 December 2021) (Reality Television)
Mission I'm Possible Money Matters (4 September 2020) (Sponsored by Abbott Laboratories - Ensure Malaysia - Ensure Gold) (Reality Television)
Money Matters (Season Two) (5 March 2021) (Reality Television)
Money Matters (Season Three) (20 August 2021) (Reality Television) (Repeat broadcast on 23 August 2021)
Move It! Nescafé Kick-Start A New Journey Next Miss Universe Malaysia Now Everyone Can Fly To Australia Ohayo On The Brink (repeat of NTV7 drama)
One in a Million (2006-2009) (Reality Television)
Oppa! Oppa! (repeat of NTV7 drama)
Part Of The Game Perfect Match Persona (repeat of NTV7 drama)
Please Give Me a Job! Pre-Budget Talk Show (29 October 2021)
Project Runway Malaysia (Reality Television)
Project Superstar (Reality Television)
Pulse of life (repeat of NTV7 drama)
Punch and Jude Realiti Reel Review Revolving Heart (repeat of NTV7 drama)
Running Man Malaysia Mandarin (Coming Soon in May 2022)
Secret of SuccessSinging in the Spring (5 February 2018) (Local drama series) (Drama repeated on 2 January 2022) (2 episodes back to back)
Shila Amzah Masterclass (27 November 2021) (Broadcast suspended on 8 January) (Broadcast resumed on 15 January) (Sponsored by Duopharma - Flavettes Effervescent H-Drate) (Reality Television)
Shopee Fortune Box (18 January 2021 - 8 February 2021) (Reality Television)
So You Think You Can Dance Spec-Ops Star Avenue (repeat of NTV7 drama)
Step Forward Summer Live Concert
Summer Brothers (repeat of NTV7 drama)
Superhero at home (repeat of NTV7 drama)
Taste of Malaysia: Martin Yan (Chinese) (Reality Television - Cooking Show)
Taste of Chinese New Year Taste of life Taste of Memory (5 June 2021) (Reality Television) (Repeat broadcast on 24 July 2021) (Repeat broadcast on 6 February 2022)
Teman The Elite Talk (5 November 2021) (Reality Television)
The Injustice Stranger (repeat of NTV7 drama)
The Liar (repeat of NTV7 drama)
The Precedents (repeat of NTV7 drama)
The Pulse Of Life (repeat of NTV7 drama)
The Turning Point (repeat of NTV7 drama)
The Undercover (repeat of NTV7 drama)
Total Europe Explore Together, here we are (Coming Soon in Season 2 in Mid-Year 2022)
Top Student (2019) (Reality Television)
Top Student 2020 (20 December 2020) (Reality Television)
Treasure Hunt in Malaysia Trippin Twenty Hundred The Ultimate Power Group The Ultimate Power Song The Ultimate Power Star The Ultimate Prom Nite Unchained Fate Unveil The Truth Upin & Ipin (Singapore Mandarin dub)
We Are One Malaysia Welcome to the Rail World Welcome to the Rail World Japan Without Boundaries Wow Shop (Formerly known as CJ Wow Shop) (1 November 2020) (Daily) (Reality Television - Teleshopping/Shopping channels)
Yoohoo 2022 (1 February 2022) (Reality Television)
The Z Power (2019) (Sponsored by Massimo and V soy) (Reality Television)
The Z Power 2020 (11 October 2020) (Sponsored by GlaxoSmithKline - Scott's DHA Gummies) (Reality Television)
The Z Power Special (11 April 2021 and 18 April 2021) (Reality Television)
Sky (6 May 2007)
Goodnight DJ Season 1 (6 January 2008) (Repeat broadcast on 16 August 2021) (Timeslot on 23 August 2021 onwards)
Step of Dance (6 July 2008)
Love Is Not Blind (23 November 2008)
A Cup of Love (5 July 2009)
The Adjusters (25 October 2009) (Repeat broadcast on 15 November 2021)
My Secret Chef (29 August 2010)
Goodnight DJ Season 2 (17 October 2010) (Repeat broadcast on 27 September 2021)
The Adjusters 2 (2 October 2011)
Model A la Mode (8 December 2011)
The Beat (18 November 2012)
Dive into Love (3 March 2013) (Repeat broadcast on 7 June 2021)
Justice Bao Jr. (17 August 2013)
Mr. Bun (1 December 2013)
The Stalker (10 December 2015)
|
wikipedia
|
wiki_31884_chunk_12
|
Polyhedral combinatorics
|
A theorem of (previously conjectured by Micha Perles) states that one can reconstruct the face structure of a simple polytope from its graph. That is, if a given undirected graph is the skeleton of a simple polytope, there is only one polytope (up to combinatorial equivalence) for which this is true. This is in sharp contrast with (non-simple) neighborly polytopes whose graph is a complete graph; there can be many different neighborly polytopes for the same graph. Another proof of this theorem based on unique sink orientations was given by , and showed how to use this theorem to derive a polynomial time algorithm for reconstructing the face lattices of simple polytopes from their graphs. However, testing whether a given graph or lattice can be realized as the face lattice of a simple polytope is equivalent (by polarity) to realization of simplicial polytopes, which was shown to be complete for the existential theory of the reals by .
|
wikipedia
|
wiki_11913_chunk_30
|
Code of Virginia
|
Titles of the Code of Virginia
Note: repealed titles have been omitted
Title 1 - General Provisions
Title 2.2 - Administration of Government
Title 3.2 - Agriculture, Animal Care, and Food
Title 4.1 - Alcoholic Beverage Control Act
Title 5.1 - Aviation
Title 6.2 - Financial Institutions and Services
Title 8.01 - Civil Remedies and Procedure
Title 8.1A - Uniform Commercial Code - General Provisions
Title 8.2 - Commercial Code - Sales
Title 8.2A - Commercial Code - Leases
Title 8.3A - Commercial Code - Negotiable Instruments
Title 8.4 - Commercial Code - Bank Deposits and Collections
Title 8.4A - Commercial Code - Funds Transfers
Title 8.5A - Uniform Commercial Code - Letters of Credit
Title 8.7 - Commercial Code - Warehouse Receipts, Bills of Lading and Other Documents of Title
Title 8.8A - Commercial Code - Investment Securities
Title 8.9A - Commercial Code - Secured Transactions
Title 8.10 - Commercial Code - Effective Date - Transitional Provisions
Title 8.11 - 1973 Amendatory Act - Effective Date and Transition Provisions
Title 9.1 - Commonwealth Public Safety
Title 10.1 - Conservation
Title 11 - Contracts
Title 12.1 - State Corporation Commission
Title 13.1 - Corporations
Title 15.2 - Counties, Cities and Towns
Title 16.1 - Courts Not of Record
Title 17.1 - Courts of Record
Title 18.2 - Crimes and Offenses Generally
Title 19.2 - Criminal Procedure
Title 20 - Domestic Relations
Title 21 - Drainage, Soil Conservation, Sanitation and Public Facilities Districts
Title 22.1 - Education
Title 23 - Educational Institutions
Title 24.2 - Elections
Title 25.1 - Eminent Domain
Title 27 - Fire Protection
Title 28.2 - Fisheries and Habitat of the Tidal Waters
Title 29.1 - Game, Inland Fisheries and Boating
Title 30 - General Assembly
Title 32.1 - Health
Title 33.2 - Highways and Other Surface Transportation Systems
Title 34 - Homestead and Other Exemptions
Title 35.1 - Hotels, Restaurants, Summer Camps, and Campgrounds
Title 36 - Housing
Title 37.2 - Behavioral Health and Developmental Services
Title 38.2 - Insurance
Title 40.1 - Labor and Employment
Title 41.1 - Land Office
Title 42.1 - Libraries
Title 43 - Mechanics' and Certain Other Liens
Title 44 - Military and Emergency Laws
Title 45.1 - Mines and Mining
Title 46.2 - Motor Vehicles
Title 47.1 - Notaries and Out-of-State Commissioners
Title 48 - Nuisances
Title 49 - Oaths, Affirmations and Bonds
Title 50 - Partnerships
Title 51.1 - Pensions, Benefits, and Retirement
Title 51.5 - Persons with Disabilities
Title 52 - Police (State)
Title 53.1 - Prisons and Other Methods of Correction
Title 54.1 - Professions and Occupations
Title 55 - Property and Conveyances
Title 56 - Public Service Companies
Title 57 - Religious and Charitable Matters; Cemeteries
Title 58.1 - Taxation
Title 59.1 - Trade and Commerce
Title 60.2 - Unemployment Compensation
Title 61.1 - Warehouses, Cold Storage and Refrigerated Locker Plants
Title 62.1 - Waters of the State, Ports and Harbors
Title 63.2 - Welfare (Social Services)
Title 64.2 - Wills, Trusts, and Fiduciaries
Title 65.2 - Workers' Compensation
Title 66 - Juvenile Justice
Title 67 - Virginia Energy Plan
|
wikipedia
|
wiki_8588_chunk_47
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+Identities: scalar-by-scalar, with matrices involved
! scope="col" width="175" | Condition
! scope="col" width="100" | Expression
! scope="col" width="100" | Consistent numerator layout,i.e. by Y and XT
! scope="col" width="100" | Mixed layout,i.e. by Y and X
|-
| U = U(x) || || colspan=2|
|-
| U = U(x) || || colspan=2|
|-
| U = U(x) ||
| colspan=2 |
|-
| U = U(x) || ||
||
|-
| A is not a function of x, g(X) is any polynomial with scalar coefficients, or any matrix function defined by an infinite polynomial series (e.g. eX, sin(X), cos(X), ln(X), etc.); g(x) is the equivalent scalar function, g′(x) is its derivative, and g′(X) is the corresponding matrix function. || || colspan=2|
|-
| A is not a function of x || || colspan=2|
|}
|
wikipedia
|
wiki_6253_chunk_4
|
Median (geometry)
|
Three congruent triangles
In 2014 Lee Sallows discovered the following theorem:
The medians of any triangle dissect it into six equal area smaller triangles as in the figure above where three adjacent pairs of triangles meet at the midpoints D, E and F. If the two triangles in each such pair are rotated about their common midpoint until they meet so as to share a common side, then the three new triangles formed by the union of each pair are congruent. Formulas involving the medians' lengths
The lengths of the medians can be obtained from Apollonius' theorem as:
|
wikipedia
|
wiki_34944_chunk_1
|
List of broadband over power line deployments
|
Active
North America:
United States: The United Telecom Council publishes the Federal Communications Commission (FCC)-mandated BPL Interference Resolution website, which provides a list of all BPL deployments in the US.
Canada:
Quebec: As of 2005, PLC communication technology developed by Ariane Controls is being installed inside and outside existing buildings to control lights and other energy-hungry devices. The cheap devices allow energy consumption to be better managed, and so save much energy and bring a clear return on investment.
Western Europe:
Sweden: Vattenfall is using PLC technology at 1200 baud for automatic meter reading based on an Iskraemeco product.
Central and Eastern Europe, and Eurasia:
Russian Federation: Electro-com has deployed widely BPL/PLC technology and offers internet access service in Moscow, Nizhny Novgorod, Ryazan, Kaluga and Rostov-on-Don, planning to extend coverage to main Russian cities. Currently the company does not provide other services, though plans to start providing telephone, and television services someday. Base equipment is a DefiDev modem with a DS2 chipset. The company had 35,000 subscribers and an annual growth of 15-20%. The company has, however, halted operations in Moscow in September, 2008, having sold its client network to an IDSL internet provider.
Romania: In January, 2006, the Ministry of Communications and Information Technology introduced a PLC trial in the rural locality of Band, Mureș County, offering phone and broadband internet access for €7 per month. The technology was introduced to 50 households. If successful, the technology will be extended to other rural areas throughout Romania.
Montenegro: In March, 2002, the Internet Crna Gora biggest internet provider in Montenegro launched a pilot project in town of Cetinje.
Serbia: In August 2002, the Star Engineering from Niš launched a pilot project to show a completely new way to access the Internet, which is a new in that time in most countries around the world.
Hungary: The first powerline service in Hungary was realized in September, 2003, in the Riverside apartment house in Budapest by 23Vnet Ltd. The PLC equipment was supplied by ASCOM Powerline. After four months the service was counting 100 users from 450 apartment owners. The bandwidth is 4.5 Mbit/s.
Asia, Pacific, and Oceania:
InovaTech has been particularly active, with many successful trials in Australia, China, Hong Kong, Taiwan, Indonesia, Malaysia, and the Philippines. InovaTech recently widened its focus to include Europe, the Middle East and Africa, where it has undertaken several successful field trials and is believed to be readying commercial operations in several locations. InovaTech is also understood to have a long-term trial running in Russia. One of the most active solution providers, InovaTech is the first vendor to develop an integrated offering which integrates telecommunications and energy management capabilities.
The Philippines is deploying broadband over power lines nationwide.
Indonesia:
PT Kejora Gemilang Internusa "KEJORA", under their banner PLANET BROADBAND, is currently rolling out broadband over power line, with over 300,000 homes expected to be enabled by August 2010. PT. Kejora Gemilang Internusa signed an 8-year Joint Venture concession agreement with ICON+ a division of PT. Perusahaan Listrik Negara (Indonesia electricity company). Under the terms of the agreement PLAnet Broadband are to supply BPL/PLC to Jakarta West and West Java. The first stage of the project will see BPL/PLC services delivered to the door of 300,000 homes with continued rollout to follow. PLAnet Broadband are the industry leader in the BPL PLC Asian Pacific market and were the first provider to offer BPL Internet commercially within Indonesia. PLAnet Broadband currently offer 3-Play services with WAN access speeds from 256kbit/s – 10Mbit/s and LAN access speeds from 85-200Mbit/s current developments are continuing in INDONESIA, MALAYSIA, SINGAPORE, PHILIPPINES & CHINA. PLAnet Broadband have very strong partnerships with China-based manufacturing companies for supply of Head-End, Reapeters, Couplers and CPE. further information can be viewed on PLANET BROADBAND at their website www.planetbroadband.kejora.net
Another company, PT. Broadband Powerline Indonesia, has been developing broadband over power line in apartment buildings since 2006. PT. BPI also produces data couplers to make broadband over powerline possible in three phases (R, S, T) with a single master.
India : In India IIIT Allahabad has undertaken a project in co-operation with Corinex Communications Canada to implement a prototype of BPL for University campus and nearby villages.
Africa and the Middle East:
Egypt: The Engineering Office for Integrated Projects (EOIP) has deployed PLC technology widely in Alexandria, Fayed, and Tanta. Based on a locally developed system, the company provides AMR for electricity utilities. Currently, the company has about 70,000 subscribers.
South Africa: Goal Technology Solutions (GTS) trialled the technology and is offering service in the suburbs of Pretoria, and plans to extend it to other areas. The tests were done with Mitsubishi equipment using a DS2 chipset, and the company claims a maximum throughput of 90 Mbit/s although initially only "512 Kbits/s ADSL equivalent speeds" are available. Now it uses DefiDev's equipment, and according to GTS's website, it will expand available bandwidth up to 5-20 Mbit/s.
Ghana:
Cactel Communications, Ltd. successfully deployed an MV solution pilot project in the Graphic Communications Group in Accra in June, 2005.
A Cactel Remote Energy Management System (REMS) pilot project for the Electricity Company of Ghana (ECG) is running a 40-user pilot project at the University of Ghana in Legon. The current project combines fiber, radio link, Wi-Fi and PLC to provide broadband internet access and telephony. It showcases the interoperability of PLC technology and the company's expertise in emerging market design and deployment. Cactel hopes to deploy nationally, and is in deliberations with the national stakeholders and with Ghana's Ministry of Communications (MoC).
AllTerra Communications successfully implemented a pilot test of broadband over power lines in Akosombo. In partnership with VRA, this test involves demonstrating transmission of broadband from medium to low voltage signals. AllTerra is working with VRA to expand the pilot project to include essential grid management utilities that will help balance and manage the current electricity transmission throughout their various substations. Using IT as a catalyst for economic development, AllTerra is expanding into numerous areas throughout Ghana.
Vobiss Solutions Ltd successfully implemented a Hybrid Fibre BPL pilot network within EMEFS Hillview Estate in collaboration with ECG.
Saudi Arabia:
ElectroNet has been working with the Saudi Electric Company since 2005 on a pilot project using broadband over power lines over medium voltage cables and linking into low voltage distribution within a shopping mall. The pilot project also integrates automatic meter readers.
Powerlines Communications Co. Ltd. implemented an AMR pilot project for Saudi Electricity Company in 2006. The project was located in the city of Jeddah on the west coast of Saudi Arabia. Digital KWh meters were installed in parallel with analog KWh meters. Readings taken by the Saudi Electricity Company showed variations of less than 1%. A BPL pilot project was included.
Saudi Arabian Computer Management Consultants (SACMAC) has signed a deal to become an official system integrator and distributor for Mitsubishi PLC. It is expected to become a great success, because the existing broadband service, monopolized by the Saudi Telecom Company, is expensive and has poor customer service (some clients report that company techs arrive months after ordering). SACMAC has declined to talk about specifics of availability and price but says it will start rolling out the service in a few months (as of May 2006) and its price will be lower than current broadband providers.
|
wikipedia
|
wiki_1797_chunk_10
|
Template metaprogramming
|
In C++11 and C++20, constexpr and consteval were introduced to let the compiler execute code. Using constexpr and consteval, one can use the usual recursive factorial definition with the non-templated syntax. Compile-time code optimization The factorial example above is one example of compile-time code optimization in that all factorials used by the program are pre-compiled and injected as numeric constants at compilation, saving both run-time overhead and memory footprint. It is, however, a relatively minor optimization.
|
wikipedia
|
wiki_37003_chunk_1
|
Principles of Geometry
|
Singles, 12" and 7"
A Mountain For President EP (2007, Tigersushi)
Interstate Highway System (2008, Tigersushi)
The Effect Of Adding Another Zero (Principles Of Geometry's Distributive & Associative Part One) (2009, Tigersushi/Pandamaki Records)
P.O.G vs. THE EDITS EP (edits by KRIKOR, PILOOSKI & JOAKIM) (2011, Tigersushi Records) Remixes External links
Label Tigersushi, Principles of Geometry publishing company
Official Myspace
Official Facebook Page
Official Facebook group References
|
wikipedia
|
wiki_17588_chunk_2
|
Gayatri Vidya Parishad College of Engineering
|
Library
The Library is names as 'Prof. B. Sarvesvara Rao Library' named after the former president of Gayatri Vidya Parishad, Emeritus Professor of Economics of Andhra University and Economic Adviser to the Government of Nigeria. The library is well equipped with modern facilities and resources in the form of CD / DVD -ROMs, Video Cassettes. Online Databases, Micro Documents, Video Cassettes, Books, Journals Thesis, Project Reports, Back Volume of Journals, Video Lessons from NPTEL. The library being a member of AICTE-INDEST consortium under the aegis of the Ministry of Human Resource and Development provides online access to IEL/IEEE, ASME, ACSE, Science Direct and DOAJ Journals through DELNET and houses 9,200 titles, 34,000 volumes, 130 national journals, 70 international journals and a digital library in which students can access 240 IEEE journals and 600 other journals through the Springer Science+Business Media Engineering Data Units.
|
wikipedia
|
wiki_1737_chunk_4
|
Low-level programming language
|
Example: A function in hexadecimal representation of 32-bit x86 machine code to calculate the nth Fibonacci number:
8B542408 83FA0077 06B80000 0000C383
FA027706 B8010000 00C353BB 01000000
B9010000 008D0419 83FA0376 078BD989
C14AEBF1 5BC3
|
wikipedia
|
wiki_21442_chunk_12
|
Differential item functioning
|
Logistic regression
Logistic regression approaches to DIF detection involve running a separate analysis for each item. The independent variables included in the analysis are group membership, an ability matching variable typically a total score, and an interaction term between the two. The dependent variable of interest is the probability or likelihood of getting a correct response or endorsing an item. Because the outcome of interest is expressed in terms of probabilities, maximum likelihood estimation is the appropriate procedure. This set of variables can then be expressed by the following regression equation:
Y = β0 + β1M + β2G + β3MG
where β0 corresponds to the intercept or the probability of a response when M and G are equal to 0 with remaining βs corresponding to weight coefficients for each independent variable. The first independent variable, M, is the matching variable used to link individuals on ability, in this case a total test score, similar to that employed by the Mantel-Haenszel procedure. The group membership variable is denoted G and in the case of regression is represented through dummy coded variables. The final term MG corresponds to the interaction between the two above mentioned variables.
For this procedure, variables are entered hierarchically. Following the structure of the regression equation provided above, variables are entered by the following sequence: matching variable M, grouping variable G, and the interaction variable MG. Determination of DIF is made by evaluating the obtained chi-square statistic with 2 degrees of freedom. Additionally, parameter estimate significance is tested.
From the results of the logistic regression, DIF would be indicated if individuals matched on ability have significantly different probabilities of responding to an item and thus differing logistic regression curves. Conversely, if the curves for both groups are the same, then the item is unbiased and therefore DIF is not present. In terms of uniform and nonuniform DIF, if the intercepts and matching variable parameters for both groups are not equal, then there is evidence of uniform DIF. However, if there is a nonzero interaction parameter, this is an indication of nonuniform DIF.
|
wikipedia
|
wiki_20261_chunk_0
|
List of 4000-series integrated circuits
|
The following is a list of CMOS 4000-series digital logic integrated circuits. In 1968, the original 4000-series was introduced by RCA. Although more recent parts are considerably faster, the 4000 devices operate over a wide power supply range (generally 3V to 15V, some devices higher ) and are well suited to unregulated battery powered applications and interfacing with sensitive analogue electronics, where the slower operation may be an EMC advantage.
The earlier datasheets included the internal schematics of the gate architectures and a number of novel designs are able to 'mis-use' this additional information to provide semi-analog functions for timing skew and linear signal amplification. Due to the popularity of these parts, other manufacturers released pin-to-pin compatible logic devices and kept the 4000 sequence number as an aid to identification of compatible parts. However, other manufacturers use different prefixes and suffixes on their part numbers, and not all devices are available from all sources or in all package sizes.
|
wikipedia
|
wiki_1768_chunk_6
|
Moment-generating function
|
Examples
Here are some examples of the moment-generating function and the characteristic function for comparison. It can be seen that the characteristic function is a Wick rotation of the moment-generating function when the latter exists.
{|class="wikitable"
|-
! Distribution
! Moment-generating function
! Characteristic function
|-
|Degenerate
|
|
|-
| Bernoulli
|
|
|-
| Geometric
|
|
|-
| Binomial
|
|
|-
|Negative binomial
|
|
|-
| Poisson
|
|
|-
| Uniform (continuous)
|
|
|-
| Uniform (discrete)
|
|
|-
|Laplace
|
|
|-
| Normal
|
|
|-
| Chi-squared
|
|
|-
|Noncentral chi-squared
|
|
|-
| Gamma
|
|
|-
| Exponential
|
|
|-
| Multivariate normal
|
|
|-
| Cauchy
|Does not exist
|
|-
|Multivariate Cauchy
|
wikipedia
|
wiki_6465_chunk_2
|
PC PowerPlay
|
Inbox: Letters to the editor and Snippets (A small section where a sentence of a writer's letter is used in a comical fashion. Currently snippets have been removed from the section.)
The Big Picture: A double-page screenshot of the game featured as the cover story. This is followed by the cover story itself (usually a preview of a major upcoming game).
Extended Memory: An opinion piece reflecting on the state of games today in relation to older, obsolete games and genres.
Jam:. James Cottee discusses issues of a general gaming nature. This section was previously titled "Out to Play".
Generation XX: Meghann O'Neill provided a look at gaming from a female perspective.
10 To Watch: Originally named "Incoming". A round-up of ten major soon to be released games.
PCPP Interview: An interview with a well known indie games developer. Topics include their inspirations and influences that shaped their developed games.
Reviews: A section where games are reviewed and given a rating out of 10, based on graphics, sound, gameplay, replayability, etc.
MyPC: A reader submits a picture of their computer, along with its specifications, recent upgrades, and other information. (The magazine points out 10 humorous points within the photo, and usually provides the reader with a prize.)
Hotware: Includes commercial products, some computer related, others not, which the reader may find interesting. (Usually, there is at least one product that costs a substantial amount of money.)
Tech: A selection of the latest technology is reviewed and discussed. This has expanded substantially after the removal of other tech columns like "ReShuffle".
The Beast: A list of components needed to build an incredibly powerful gaming PC costing extravagant amounts of money. (The descriptions of the components used has extended significantly after the removal of the "Beastie" column.)
The Menagerie: Consists of three computer builds with different budgets in mind. The hardware included in this section is usually low to mid range in ability, strictly following a "bang for buck" ideal.
State of Play: Includes four parts, discussing the characteristics and recent changes occurring in four different genres of gaming: MMOs, RPGs, RTS', and Indies.
Next Month: A whole page of games' artwork with the date of the next issue's publication date shown below.
|
wikipedia
|
wiki_1061_chunk_28
|
Bresenham's line algorithm
|
Further reading
Patrick-Gilles Maillot's Thesis an extension of the Bresenham line drawing algorithm to perform 3D hidden lines removal; also published in MICAD '87 proceedings on CAD/CAM and Computer Graphics, page 591 - .
Line Thickening by Modification To Bresenham's Algorithm, A.S. Murphy, IBM Technical Disclosure Bulletin, Vol. 20, No. 12, May 1978.
rather than [which] for circle extension use: Technical Report 1964 Jan-27 -11- Circle Algorithm TR-02-286 IBM San Jose Lab or A Linear Algorithm for Incremental Digital Display of Circular Arcs February 1977 Communications of the ACM 20(2):100-106 DOI:10.1145/359423.359432
|
wikipedia
|
wiki_35561_chunk_4
|
Kernighan–Lin algorithm
|
function Kernighan-Lin(G(V, E)) is
determine a balanced initial partition of the nodes into sets A and B
do
compute D values for all a in A and b in B
let gv, av, and bv be empty lists
for n := 1 to |V| / 2 do
find a from A and b from B, such that g = D[a] + D[b] − 2×c(a, b) is maximal
remove a and b from further consideration in this pass
add g to gv, a to av, and b to bv
update D values for the elements of A = A \ a and B = B \ b
end for
find k which maximizes g_max, the sum of gv[1], ..., gv[k]
if g_max > 0 then
Exchange av[1], av[2], ..., av[k] with bv[1], bv[2], ..., bv[k]
until (g_max ≤ 0)
return G(V, E)
|
wikipedia
|
wiki_18836_chunk_3
|
Engineering design process
|
Research
Various stages of the design process (and even earlier) can involve a significant amount of time spent on locating information and research. Consideration should be given to the existing applicable literature, problems and successes associated with existing solutions, costs, and marketplace needs. The source of information should be relevant. Reverse engineering can be an effective technique if other solutions are available on the market. Other sources of information include the Internet, local libraries, available government documents, personal organizations, trade journals, vendor catalogs and individual experts available.
|
wikipedia
|
wiki_11487_chunk_7
|
SIESTA (computer program)
|
Applications
Since its implementation, SIESTA has become quite popular, being increasingly used by researchers in geosciences, biology, and engineering (apart from those in its natural habitat of materials physics and chemistry) and has been applied to a large variety of systems including surfaces, adsorbates, nanotubes, nanoclusters, biological molecules, amorphous semiconductors, ferroelectric films, low-dimensional metals, etc. See also
Quantum chemistry computer programs References
Postprint available at .
|
wikipedia
|
wiki_15168_chunk_17
|
PLS (complexity)
|
A PLS-reduction from a local search problem to a local search problem is a
tight PLS-reduction if for any instance of , a subset of solutions
of instance of can be chosen, so that the following properties are satisfied: contains, among other solutions, all local optima of
For every solution of , a solution of can be constructed in polynomial time, so that
If the transition graph of contains a direct path from to , and , but all internal path vertices are outside , then for the corresponding solutions and holds either or contains an edge from to Relationship to other complexity classes
|
wikipedia
|
wiki_7001_chunk_0
|
List of NATO country codes
|
This is the list of NATO country codes. Up to and including the seventh edition of STANAG 1059, these were two-letter codes (digrams). The eighth edition, promulgated February 19, 2004, and effective April 1, 2004, replaced all codes with new ones based on the ISO 3166-1 alpha-2 codes. Additional codes cover gaps in the ISO coverage, deal with the imaginary countries used for exercise purposes, and designate large geographical groupings and water bodies (ranging from oceans to rivers). It consists of two-letter codes for geographical entities, four-letter codes for subdivisions, and lists the ISO three-letter codes for reference. The digrams match the FIPS 10-4 codes with a few exceptions.
|
wikipedia
|
wiki_1706_chunk_2
|
Logistics engineering
|
Logistics engineering as a discipline is a very important aspect of systems engineering that also includes reliability engineering. It is the science and process whereby reliability, maintainability, and availability are designed into products or systems. It includes the supply and physical distribution considerations above as well as more fundamental engineering considerations. Logistics engineers work with complex mathematical models that consider elements such as mean time between failures (MTBF), mean time to failure (MTTF), mean time to repair (MTTR), failure mode and effects analysis (FMEA), statistical distributions, queueing theory, and a host of other considerations. For example, if we want to produce a system that is 95% reliable (or improve a system to achieve 95% reliability), a logistics engineer understands that total system reliability can be no greater than the least reliable subsystem or component. Therefore, our logistics engineer must consider the reliability of all subcomponents or subsystems and modify system design accordingly. If a subsystem is only 50% reliable, one can concentrate on improving the reliability of that subsystem, design in multiple subsystems in parallel (5 in this case would achieve approximately 97% reliability of that subsystem), purchase and store spare subsystems for rapid change out, establish repair capability that would get a failed subsystem back in operation in the required amount of time, and/or choose any combination of those approaches to achieve the optimal cost vs. reliability solution. Then the engineer moves onto the next subsystem.
|
wikipedia
|
wiki_32075_chunk_23
|
Small cancellation theory
|
Other basic properties of small cancellation groups
Let (∗) be a C′(1/6) presentation. Then an element g in G has order n > 1 if and only if there is a relator r in R of the form r = sn in F(X) such that g is conjugate to s in G. In particular, if all elements of R are not proper powers in F(X) then G is torsion-free.
If (∗) is a finite C′(1/6) presentation, the group G is word-hyperbolic.
If R and S are finite symmetrized subsets of F(X) with equal normal closures in F(X) such that both presentations and satisfy the C′(1/6) condition then R = S.
If a finite presentation (∗) satisfies one of C′(1/6), C′(1/4)–T(4), C(6), C(4)–T(4), C(3)–T(6) then the group G has solvable word problem and solvable conjugacy problem
|
wikipedia
|
wiki_7025_chunk_34
|
Specified complexity
|
Dembski's book No Free Lunch'' was criticised for not addressing the work of researchers who use computer simulations to investigate artificial life. According to Shallit:
The field of artificial life evidently poses a significant challenge to Dembski's claims about the failure of evolutionary algorithms to generate complexity. Indeed, artificial life researchers regularly find their simulations of evolution producing the sorts of novelties and increased complexity that Dembski claims are impossible. See also
List of topics characterized as pseudoscience
Teleological argument
Texas sharpshooter fallacy Notes and references
|
wikipedia
|
wiki_8879_chunk_14
|
HITS algorithm
|
Non-converging pseudocode
G := set of pages
for each page p in G do
p.auth = 1 // p.auth is the authority score of the page p
p.hub = 1 // p.hub is the hub score of the page p
function HubsAndAuthorities(G)
for step from 1 to k do // run the algorithm for k steps
for each page p in G do // update all authority values first
p.auth = 0
for each page q in p.incomingNeighbors do // p.incomingNeighbors is the set of pages that link to p
p.auth += q.hub
for each page p in G do // then update all hub values
p.hub = 0
for each page r in p.outgoingNeighbors do // p.outgoingNeighbors is the set of pages that p links to
p.hub += r.auth
|
wikipedia
|
wiki_32564_chunk_6
|
Construction estimating software
|
Sophisticated, cost estimating and Efficient Project Delivery Software systems are also available to integrate various construction delivery methods such as Integrated Project Delivery, Job Order Contracting, and others (IDIQ, JOC, SABER...) simultaneously and securely. These systems enable cost estimators and project managers to collaboratively work with multiple projects, multiple estimates, and multiple contracts. A 'short list' of additional capabilities includes the ability to work with multiple cost books/guides/UPBs, track project status, automatically compare estimates, easily copy/paste, clone, and reuse estimates, and integrated sophisticated visual estimating and quantity take-off (QTO) tools. Owners, contractors, architects and engineers are moving to advanced cost estimating and management systems, and many oversight groups such are beginning to also require their use. The level of collaboration, transparency, and information re-use enabled by Cost Estimating and Efficient Project Delivery Software drives 15-25%+ reductions in procurement cycles, six to ten times faster estimating, reduce overall project times, as a significant reduction in change orders and the virtual elimination of contract related legal disputes.
|
wikipedia
|
wiki_5549_chunk_15
|
Nanotechnology education
|
Germany
Kaiserslautern University of Technology - master's, certificate short term courses (Distance Learning)
Bielefeld University - master's
Karlsruhe Institute of Technology, graduate degrees
University of Duisburg-Essen - bachelor's, master's
University of Erlangen–Nuremberg - bachelor's, master's
University of Hamburg - bachelor's, master's
University of Hannover - bachelor's
University of Kassel - bachelor's
Ludwig-Maximilians-Universität München - Ph.D
Munich University of Applied Sciences - master's
Saarland University - bachelor's
University of Ulm - master's
University of Würzburg - bachelor's
|
wikipedia
|
wiki_13301_chunk_4
|
Aspects of Physics
|
Discography
Systems of Social Recalibration (2002)
"Pulse Width"
"Level 4.2"
"S.Id"
"Reson"
"Everything Else We Must Pass O"
"Entrainment"
"Contact" Marginalized Information Forms One: Ping (2004)
"Logo (Observer)"
"Ping"
"Neutrino"
"QQ47"
"Piano Pill"
"Plippus"
"Ohmf"
"Reversevent"
"Jatchtas"
"Arnologer"
"Scene of Changery"
|
wikipedia
|
wiki_3972_chunk_4
|
Chemical database
|
There are two principal techniques for representing chemical structures in digital databases As connection tables / adjacency matrices / lists with additional information on bond (edges) and atom attributes (nodes), such as:
MDL Molfile, PDB, CML
As a linear string notation based on depth first or breadth first traversal, such as:
SMILES/SMARTS, SLN, WLN, InChI
|
wikipedia
|
wiki_8381_chunk_10
|
Monotone (software)
|
, possible drawbacks of Monotone include:
Potential users cannot check out (or commit) from behind a proxy (very common in corporate environments) due to non-http protocol.
Performance issues for certain operations (most noticeable initial pull) Implementation Monotone is implemented in modern-dialect C++ on top of the Boost library, the Botan cryptography library, and the SQLite database library. Monotone supports customization and extension via hook functions written in the Lua programming language. The monotone build process is automated with BuildBot and includes extensive regression tests. See also Comparison of revision control software
List of revision control software References
|
wikipedia
|
wiki_2443_chunk_40
|
Quantitative genetics
|
Continued genetic drift – increased dispersion and inbreeding
Previous discussion on genetic drift examined just one cycle (generation) of the process. When the sampling continues over successive generations, conspicuous changes occur in σ2p, q and f. Furthermore, another "index" is needed to keep track of "time": t = 1 .... y where y = the number of "years" (generations) considered. The methodology often is to add the current binomial increment (Δ = "de novo") to what has occurred previously. The entire Binomial Distribution is examined here. [There is no further benefit to be had from an abbreviated example.]
|
wikipedia
|
wiki_7647_chunk_22
|
Minkowski's question-mark function
|
/* Minkowski's question-mark function */
double minkowski(double x) {
long p = x;
if ((double)p > x) --p; /* p=floor(x) */
long q = 1, r = p + 1, s = 1, m, n;
double d = 1, y = p;
if (x < (double)p || (p < 0) ^ (r <= 0))
return x; /* out of range ?(x) =~ x */
for (;;) { /* invariants: q * r - p * s == 1 && (double)p / q <= x && x < (double)r / s */
d /= 2;
if (y + d == y)
break; /* reached max possible precision */
m = p + r;
if ((m < 0) ^ (p < 0))
break; /* sum overflowed */
n = q + s;
if (n < 0)
break; /* sum overflowed */
|
wikipedia
|
wiki_1152_chunk_79
|
Microsoft PowerPoint
|
PowerPoint 7.0
For Windows: July 1995
Part of Microsoft Office for Windows 95. Innovations included: new animation effects, real curves and textures, black and white view, autocorrect, insert symbol, meeting support features such as "Meeting Minder."
"A complete rewrite of the product from the ground up in C++, full object model with internal VBA programmability."
System requirements: (Windows) 386 DX PC or higher, Windows 95, 6 MB RAM.
|
wikipedia
|
wiki_554_chunk_36
|
Simplified molecular-input line-entry system
|
The SMILES specification includes elaborations on the @ symbol to indicate stereochemistry around more complex chiral centers, such as trigonal bipyramidal molecular geometry. Isotopes
Isotopes are specified with a number equal to the integer isotopic mass preceding the atomic symbol. Benzene in which one atom is carbon-14 is written as [14c]1ccccc1 and deuterochloroform is [2H]C(Cl)(Cl)Cl. Examples
|
wikipedia
|
wiki_1618_chunk_2
|
BASIC Programming
|
Input is given through two Atari keypad controllers, which came with special overlays to show how to type the different commands and letters. Programs are restricted to 64 characters in size and normally 9 lines of code, limiting the programs that can be written (users can disable all windows except Program and keep selecting "New Line" until 11 lines of code are present). Language features VCS BASIC supported the following keywords:
Statements: Print
Structure: Goto, If-Then-Else
Graphics: Clear
Functions: Hit, Key
Math: + - × ÷ Mod
Relational operators: < > =
|
wikipedia
|
wiki_559_chunk_16
|
Solution (chemistry)
|
In the following equations, A is solvent, B is solute, and C is concentration. Solute volume contribution is considered through the ideal solution model.
Case 1: amount (mL) of solvent volume VA is given. Solute mass mB = C VA dA /(100-C/dB)
Case 2: amount of solute mass mB is given. Solvent volume VA = mB (100/C-1/ dB )
Case 3: amount (mL) of final solution volume Vt is given. Solute mass mB = C Vt /100; Solvent volume VA=(100/C-1/ dB) mB
Case 2: solute mass is known, VA = mB 100/C
Case 3: total solution volume is known, same equation as case 1. VA=Vt; mB = C VA /100
|
wikipedia
|
wiki_33927_chunk_1
|
Wave power in Australia
|
Projects
Portland, Victoria, Australia - Ocean Power Technologies (Australasia) Pty Ltd is developing a 19 megawatts wave power station connected to the grid near Portland, Victoria. The project has received an AU $66.46 million grant from the Federal Government of Australia.
Oceanlinx is trialling a wave energy system at Port Kembla - Thousands of air filled balloons are submerged under water and energy is collected by the changes in the depth of the water column changing the pressure in the balloons.
A wave power project at Douglas Point, South Australia
BioPower Systems are developing their bioWAVE system anchored to the seabed that would generate electricity through the movement of buoyant blades as waves pass, in a swaying motion similar to the way sea plants, such as kelp, move. It expects to complete pilot wave and tidal projects off northern Tasmania this year.
Inside Western Australia, Carnegie Wave Energy are refining a technology called CETO, which uses energy captured from passing waves to generate high-pressure sea water. This is piped onshore to drive a turbine and to create desalinated water. A series of large buoys is tethered to piston pumps anchored in waters deep. The rise and fall of passing waves drives the pumps, generating water pressures of up to 1,000 pounds per square inch (psi). Carnegie's first commercial wave farm is due to be completed on Garden Island, near Perth, Western Australia, by mid 2014.
Wave Swell Energy is installing a trial wave generator unit in the harbour at Grassy, King Island. It is a 200 kW unit which will be connected to the island's existing microgrid, which also utilises wind, solar, battery and diesel.
|
wikipedia
|
wiki_5760_chunk_19
|
Skeleton (computer programming)
|
Algorithmic skeleton frameworks are used in parallel programming to abstractly describe the methods in question for later development. The frameworks are not limited to a single type, and each of these types have different purposes to increase the efficiency of the developer’s program. These can be categorised into three main types: data-parallel, task-parallel and resolution. Data-Parallel
These skeleton algorithms are used to develop programs that work on large data based software, usually identifying the connections between data for later use. Data parallel algorithms include ‘maps’, ‘forks’ and ‘reduces’ or ‘scans’.
|
wikipedia
|
wiki_7011_chunk_7
|
Mathnet
|
Math and science
Real principles of math and science and mathematical tools used by the detectives to solve crimes include:
Alphanumerics ("The Case of the Unnatural")
Fibonacci sequence and modular arithmetic (see also Pisano period) ("The Case of the Willing Parrot")
Kinematics ("The Problem of the Missing Baseball")
Chromatic scale ("The Problem of the Passing Parade")
Displacement of fluids ("The Problem of the Trojan Hamburger")
Hamiltonian path ("The Case of the Smart Dummy")
Process of elimination ("The Case of the Great Car Robbery", "The View from the Rear Terrace")
Number patterns ("The Case of the Missing Air")
Bar charts and line charts ("The Case of the Purloined Policies", "The Case of the Great Car Robbery")
|
wikipedia
|
wiki_815_chunk_63
|
Reed–Solomon error correction
|
Encoder
Here we present a simple Matlab implementation for an encoder.
function [encoded] = rsEncoder(msg, m, prim_poly, n, k)
% RSENCODER Encode message with the Reed-Solomon algorithm
% m is the number of bits per symbol
% prim_poly: Primitive polynomial p(x). Ie for DM is 301
% k is the size of the message
% n is the total size (k+redundant)
% Example: msg = uint8('Test')
% enc_msg = rsEncoder(msg, 8, 301, 12, numel(msg));
% Get the alpha
alpha = gf(2, m, prim_poly);
% Get the Reed-Solomon generating polynomial g(x)
g_x = genpoly(k, n, alpha);
% Multiply the information by X^(n-k), or just pad with zeros at the end to
% get space to add the redundant information
msg_padded = gf([msg zeros(1, n - k)], m, prim_poly);
% Get the remainder of the division of the extended message by the
% Reed-Solomon generating polynomial g(x)
[~, remainder] = deconv(msg_padded, g_x);
% Now return the message with the redundant information
encoded = msg_padded - remainder;
end
|
wikipedia
|
wiki_14419_chunk_25
|
List of African-American mathematicians
|
1990s
Ron Buckmire (b. 1968 in Grenada), degrees from Rensselaer Polytechnic Institute (PhD, mathematics).
Edray Goins (born 1972), degrees from California Institute of Technology and Stanford University (PhD, mathematics).
Rudy Horne (1968–2017), degrees from University of Oklahoma and University of Colorado Boulder (PhD, applied mathematics). Mathematical consultant for the movie Hidden Figures.
Trachette Jackson (born 1972), degrees from Arizona State University and University of Washington (PhD, mathematics).
Chawne Kimber (born 1971), degrees from University of North Carolina and University of Florida (PhD, mathematics).
Marilyn Strutchens (born 1962), degrees from the University of Georgia (PhD, mathematics education).
Aissa Wade (b. 1967 in Senegal), degrees from University Montpellier 2, France (PhD, mathematics).
Talitha Washington (born 1974), degrees from Spelman College and University of Connecticut (PhD, mathematics).
|
wikipedia
|
wiki_22524_chunk_5
|
Integrative bioinformatics
|
Data warehousing approaches
In the data warehousing strategy, the data from different sources are extracted and integrated in a single database. For example, various 'omics' datasets may be integrated to provide biological insights into biological systems. Examples include data from genomics, transcriptomics, proteomics, interactomics, metabolomics. Ideally, changes in these sources are regularly synchronized to the integrated database. The data is presented to the users in a common format. Many programs aimed to aid in the creation of such warehouses are designed to be extremely versatile to allow for them to be implemented in diverse research projects. One advantage of this approach is that data is available for analysis at a single site, using a uniform schema. Some disadvantages are that the datasets are often huge and difficult to keep up to date. Another problem with this method is that it is costly to compile such a warehouse.
|
wikipedia
|
wiki_323_chunk_4
|
Latency (engineering)
|
Capital markets
Minimizing latency is of interest in the capital markets, particularly where algorithmic trading is used to process market updates and turn around orders within milliseconds. Low-latency trading occurs on the networks used by financial institutions to connect to stock exchanges and electronic communication networks (ECNs) to execute financial transactions. Joel Hasbrouck and Gideon Saar (2011) measure latency based on three components: the time it takes for information to reach the trader, execution of the trader's algorithms to analyze the information and decide a course of action, and the generated action to reach the exchange and get implemented. Hasbrouck and Saar contrast this with the way in which latencies are measured by many trading venues who use much more narrow definitions, such as, the processing delay measured from the entry of the order (at the vendor's computer) to the transmission of an acknowledgement (from the vendor's computer). Electronic trading now makes up 60% to 70% of the daily volume on the New York Stock Exchange and algorithmic trading close to 35%. Trading using computers has developed to the point where millisecond improvements in network speeds offer a competitive advantage for financial institutions.
|
wikipedia
|
wiki_509_chunk_24
|
Revolution
|
Further, social science research on revolution, primarily work in political science, has begun to move beyond individual or comparative case studies towards large-N empirical studies assessing the causes and implications of revolution. Initial studies generally rely on the Polity Project's data on democratization. Such analyses, like those by Enterline, Maoz, and Mansfield and Snyder, identify revolutions based on regime changes indicated by a change in the country's score on Polity's autocracy to democracy scale. More recently, scholars like Jeff Colgan have argued that Polity, which measures the degree of democratic or autocratic authority in a state's governing institutions based on the openness of executive recruitment, constraints on executive authority, and political competition, is inadequate because it measures democratization, not revolution, and fails to account for regimes which come to power by revolution but fail to change the structure of the state and society sufficiently to yield a notable difference in Polity score. Instead, Colgan offers a new data set on revolutionary leaders which identifies governments that "transform the existing social, political, and economic relationships of the state by overthrowing or rejecting the principal existing institutions of society." This most recent data set has been employed to make empirically-based contributions to the literature on revolution by identifying links between revolution and the likelihood of international disputes.
|
wikipedia
|
wiki_8246_chunk_28
|
Computer recycling
|
Junkyard Computing
The term junkyard computing is a colloquial expression for using old or inferior hardware to fulfill computational tasks while handling reliability and availability on software level. It utilizes abstraction of computational resources via software, allowing hardware replacement at very low effort. Ease of replacement is hereby a corner point since hardware failures are expected at any time due to the condition of the underlying infrastructure. This paradigm became more widely used with the introduction of cluster orchestration software like Kubernetes or Apache Mesos, since large monolithic applications require reliability and availability on machine level whereas this kind of software is fault tolerant by design. Those orchestration tools also introduced fairly fast set-up processes allowing to use junkyard computing economically and even making this pattern applicable in the first place. Further use cases were introduced when continuous delivery was getting more widely accepted. Infrastructure to execute tests and static code analysis was needed which requires as much performance as possible while being extremely cost effective. From an economical and technological perspective, junkyard computing is only practicable for a small number of users or companies. It already requires a decent number of physical machines to compensate for hardware failures while maintaining the required reliability and availability. This implies a direct need for a matching underling infrastructure to house all the computers and servers. Scaling this paradigm is also quite limited due to the increasing importance of factors like power efficiency and maintenance efforts, making this kind of computing perfect for mid-sized applications.
|
wikipedia
|
wiki_2125_chunk_3
|
Option style
|
Difference in value
Assuming an arbitrage-free market, a partial differential equation known as the Black-Scholes equation can be derived to describe the prices of derivative securities as a function of few parameters. Under simplifying assumptions of the widely adopted Black model, the Black-Scholes equation for European options has a closed-form solution known as the Black-Scholes formula. In general, no corresponding formula exist for American options, but a choice of methods to approximate the price are available (for example Roll-Geske-Whaley, Barone-Adesi and Whaley, Bjerksund and Stensland, binomial options model by Cox-Ross-Rubinstein, Black's approximation and others; there is no consensus on which is preferable). Obtaining a general formula for American options is one of finance's unsolved problems.
|
wikipedia
|
wiki_39080_chunk_3
|
Princeton Application Repository for Shared-Memory Computers
|
Traditional benchmarks that were publicly available before PARSEC were generally limited in their scope of included application domains or typically only available in an unparallelized, serial version. Parallel programs were only prevalent in the domain of High-Performance Computing and on a much smaller scale in business environments. Chip-multiprocessors however were expected to be heavily used in all areas of computing such as with parallelized consumer applications. Workloads The PARSEC Benchmark Suite is available in version 2.1, which includes the following workloads:
|
wikipedia
|
wiki_5878_chunk_24
|
Computational sociology
|
Heterogeneous or ensemble models
Integrating simple models which perform better on individual tasks to form a Hybrid model is an approach that can be looked into. These models can offer better performance and understanding of the data. However the trade-off of identifying and having a deep understanding of the interactions between these simple models arises when one needs to come up with one combined, well performing model. Also, coming up with tools and applications to help analyse and visualize the data based on these hybrid models is another added challenge. Impact
Computational sociology can bring impacts to science, technology and society.
|
wikipedia
|
wiki_14915_chunk_3
|
Spatial database
|
Spatial Measurements: Computes line length, polygon area, the distance between geometries, etc.
Spatial Functions: Modify existing features to create new ones, for example by providing a buffer around them, intersecting features, etc.
Spatial Predicates: Allows true/false queries about spatial relationships between geometries. Examples include "do two polygons overlap" or 'is there a residence located within a mile of the area we are planning to build the landfill?' (see DE-9IM)
Geometry Constructors: Creates new geometries, usually by specifying the vertices (points or nodes) which define the shape.
Observer Functions: Queries which return specific information about a feature such as the location of the center of a circle.
|
wikipedia
|
wiki_88_chunk_7
|
List of country calling codes
|
Originally, larger countries such as Spain, the United Kingdom and France were assigned two-digit codes to compensate for their usually longer domestic numbers. Small countries, such as Iceland, were assigned three-digit codes. Since the 1980s, all new assignments have been three-digit regardless of countries' populations.
+30 –
+31 –
+32 –
+33 –
+34 –
+350 –
+351 –
+351 291 – (landlines only)
+351 292 – (landlines only, Horta, Azores area)
+351 295 – (landlines only, Angra do Heroísmo area)
+351 296 – (landlines only, Ponta Delgada and São Miguel Island area)
+352 –
+353 –
+354 –
+355 –
+356 –
+357 – (including )
+358 –
+358 18 –
+359 –
+36 – (formerly assigned to Turkey, now at +90)
+37 – unassigned (formerly assigned to East Germany until its reunification with West Germany, now at +49)
+370 – (formerly +7 012)
+371 – (formerly +7 013)
+372 – (formerly +7 014)
+373 – (formerly +7 042)
+374 – (formerly +7 885)
+374 47 – (landlines, formerly +7 893)
+374 97 – (mobile phones)
+375 –
+376 – (formerly +33 628)
+377 – (formerly +33 93)
+378 – (interchangeably with +39 549; earlier was allocated +295 but never used)
+379 – (assigned but uses +39 06698).
+38 – unassigned (formerly assigned to Yugoslavia until its break-up in 1991)
+380 –
+381 –
+382 –
+383 –
+384 – unassigned
+385 –
+386 –
+387 –
+388 – unassigned (formerly assigned to the European Telephony Numbering Space)
+389 –
+39 –
+39 06 698 – (assigned +379 but not in use)
+39 0549 – (interchangeably with +378)
+40 –
+41 –
+41 91 – Campione d'Italia, an Italian enclave
+42 – unassigned (formerly assigned to Czechoslovakia until its breakup in 1993)
+420 –
+421 –
+422 – unassigned
+423 – (formerly +41 75)
+424 – unassigned
+425 – unassigned
+426 – unassigned
+427 – unassigned
+428 – unassigned
+429 – unassigned
+43 –
+44 –
+44 1481 –
+44 1534 –
+44 1624 –
+45 –
+46 –
+47 –
+47 79 –
+48 –
+49 –
|
wikipedia
|
wiki_7003_chunk_25
|
Hematopoietic stem cell
|
The reconstitution kinetics are very heterogeneous. However, using symbolic dynamics, one can show that they fall into a limited number of classes. To prove this, several hundred experimental repopulation kinetics from clonal Thy-1lo SCA-1+ lin−(B220, CD4, CD8, Gr-1, Mac-1 and Ter-119) c-kit+ HSC were translated into symbolic sequences by assigning the symbols "+", "-", "~" whenever two successive measurements of the percent donor-type cells have a positive, negative, or unchanged slope, respectively. By using the Hamming distance, the repopulation patterns were subjected to cluster analysis yielding 16 distinct groups of kinetics. To finish the empirical proof, the Laplace add-one approach{{clarify|date=August 2015 was used to determine that the probability of finding kinetics not contained in these 16 groups is very small. By corollary, this result shows that the hematopoietic stem cell compartment is also heterogeneous by dynamical criteria.
|
wikipedia
|
wiki_1651_chunk_13
|
Richard Powers
|
1985 Rosenthal Award of American Academy and Institute of Arts and Letters
1985 PEN/Hemingway Special Citation
1989 MacArthur Fellowship
1991 Time Book of the Year
1993 Finalist, National Book Award
1996 Swanlund Professorship, University of Illinois
1998 Business Week Best Business Books of 1998
1998 Elected Fellow, American Academy of Arts and Sciences
1999 James Fenimore Cooper Prize, American Society of Historians
1999 Lannan Literary Award
2000 Vursell Award, American Academy and Institute of Arts and Letters
2000 Elected Fellow, Center for Advanced Study, University of Illinois
2001 Corrington Award for Literary Excellence, Centenary College
2001 Author of the Year, Illinois Association of Teachers of English
2003 Pushcart Prize
2003 Dos Passos Prize For Literature, Longwood University
2003 W. H. Smith Literary Award (Great Britain)
2004 Ambassador Book Award
2006 National Book Award for Fiction
New York Times Notable Book, 2003, 2000, 1998, 1995, 1991
Best Books of 2003: Chicago Tribune, Christian Science Monitor, St. Louis Post-Dispatch, Newsday, London Evening Standard, Time Out (London), San Jose Mercury News
Finalist, National Book Critics Circle Award, 2003, 1995, 1991, 1985
2006 Finalist, Pulitzer Prize for Fiction
2010 Elected Member, American Academy of Arts and Letters
2014 Man Booker Prize (longlist)
2014 California Book Awards Silver Medal Fiction winner for Orfeo
2018 Man Booker Prize (shortlist)
2019 Pulitzer Prize for Fiction
2019 PEN Oakland Josephine Miles Literary Award for The Overstory
2020 William Dean Howells Medal for The Overstory
2021 Booker Prize (shortlist)
2021 Longlist, National Book Award
|
wikipedia
|
wiki_2864_chunk_30
|
Magic number (programming)
|
Magic string
List of file signatures
FourCC
Hard coding
Magic (programming)
NaN (Not a Number)
Enumerated type
Hexspeak, for another set of magic values
Nothing up my sleeve number about magic constants in cryptographic algorithms
Time formatting and storage bugs, for problems that can be caused by magics
Sentinel value (aka flag value, trip value, rogue value, signal value, dummy data)
Canary value, special value to detect buffer overflows
XYZZY (magic word)
Fast inverse square root, using the constant 0x5F3759DF References
|
wikipedia
|
wiki_29057_chunk_2
|
Minimum energy performance standard
|
Examples
A refrigerating appliance is required to maintain temperatures inside its compartments within specified limits, and to operate (including defrosting) in a specified ambient temperature while using at most a specified amount of electricity; the energy use allowed varies according to volume, number of doors, the function of the various compartments and other parameters. This graph shows the dramatic reduction in electricity use in U.S. refrigerators following the introduction of a series of first California then U.S. MEPS starting in the mid-1970s:
|
wikipedia
|
wiki_540_chunk_28
|
Systems engineering
|
The main reason for using mathematical models and diagrams in trade studies is to provide estimates of system effectiveness, performance or technical attributes, and cost from a set of known or estimable quantities. Typically, a collection of separate models is needed to provide all of these outcome variables. The heart of any mathematical model is a set of meaningful quantitative relationships among its inputs and outputs. These relationships can be as simple as adding up constituent quantities to obtain a total, or as complex as a set of differential equations describing the trajectory of a spacecraft in a gravitational field. Ideally, the relationships express causality, not just correlation. Furthermore, key to successful systems engineering activities are also the methods with which these models are efficiently and effectively managed and used to simulate the systems. However, diverse domains often present recurring problems of modeling and simulation for systems engineering, and new advancements are aiming to crossfertilize methods among distinct scientific and engineering communities, under the title of 'Modeling & Simulation-based Systems Engineering'.
|
wikipedia
|
wiki_30809_chunk_8
|
Justesen code
|
Let R be a Reed-Solomon code of length N = 2m − 1, rank K and minimum weight N − K + 1. The symbols of R are elements of F = GF(2m) and the codewords are obtained by taking every polynomial ƒ over F of degree less than K and listing the values of ƒ on the non-zero elements of F in some predetermined order. Let α be a primitive element of F. For a codeword a = (a1, ..., aN) from R, let b be the vector of length 2N over F given by
|
wikipedia
|
wiki_15398_chunk_11
|
Roxxon Energy Corporation
|
Super-operatives
Delphine Courtney - An assistant to Jerry Jaxon.
Cypress - An assassin. He targeted Mikhail and Yuri, but was opposed by Meggan and Shadowcat.
Dogs of War - Agents of Simon Krieger.
Afghan -
Bulldog -
Doberman -
Greyhound -
Labrador -
Mastiff -
Rottweiler -
Shepherd -
Wolfhound -
Grasshopper / Douglas Taggert - Armored security.
Grasshopper / Neil Shelton - Armored security.
Killer Shrike / Simon Maddicks - Bodyguard of Brand's Jersey branch leader James Melvin.
Manticore - He original worked under Brand Corp.
Jason Quartermaster - A superhuman scientist. He worked for Rand-Meachum and was a double agent for Roxxon. He was knocked into his own universal solvent by Luke Cage.
Saboteur - An armored agent. She acted as an agent of Republic Oil and Natural Gas in an attempt to sabotage Stark Industries but was defeated by Iron Man. She would later be killed by the Grim Reaper.
Serpent Squad -
Anaconda / Blanche "Blondie" Sitznski -
Black Mamba / Tanya Sealy -
Death Adder / Roland Burroughs -
Sidewinder / Seth Voelker -
S.H.I.E.L.D. Mandroids -
Stratosfire / Sandy Vincent - Roxxon's superhuman secretary. She was empowered in a similar manner to Sunturion but acted as a hero to improve Roxxon's public image. She was killed by Sunturion activating Roxxon's Zed Control Unit within her armour.
Windshear / Colin Ashworthe Hume - An enhanced mutant.
Ogre, Razor Wire and Lightning Fist - Three costumed operatives protecting the company's interests on the island nation of Taino in the Caribbean Sea. They are consumed and destroyed by a mutated zombie virus, and the airborne virus reconstructs their bodies into a skeletal being, which is later destroyed by the Man-Thing.
Strikeforce B.E.R.S.E.R.K.E.R. - A small platoon of Roxxon's most elite of elite special forces strictly loyal to the company and its shady designs. After hearing Loki's tale, Dario Agger had them drink blood from the heart of a burning dragon, turning them into mystical Hulk-like creatures with strength, toughness and a warrior's fury comparable to both gods and monsters.
|
wikipedia
|
wiki_33706_chunk_48
|
Domain-specific multimodeling
|
The coordination method can best be seen as a conceptual framework that prescribes a certain workflow when working with multiple languages. The three successive steps that constitute this workflow are not supported by an integrated workbench or development environment. The focus is rather on extending the developer's existing environments to add support for (1) identification, (2) specification, and (3) application. The main advantage of this approach has been that developers have actually tested our work and given us feedback. This kind of evaluation of the method is valuable because it reduces the risk of solving a purely hypothetical problem. Several papers introduce the different steps of the coordination method, report on this evaluation, and elaborates on the technical aspects of each individual experiment. Overall, the results have been promising: a significant number of errors have been found in production systems and given rise to a constructive dialog with developers on future tool requirements. A development process based on these guidelines and supported by tools constitutes a serious attempt to solve the coordination problem and make domain-specific multimodeling a practical proposition.
|
wikipedia
|
wiki_32779_chunk_0
|
Spectral Database for Organic Compounds
|
The Spectral Database for Organic Compounds (SDBS) is a free online searchable database hosted by the National Institute of Advanced Industrial Science and Technology (AIST) in Japan, that contains spectral data for ca 34,000 organic molecules. The database is available in English and in Japanese and it includes six types of spectra: laser Raman spectra, electron ionization mass spectra (EI-MS), Fourier-transform infrared (FT-IR) spectra, 1H nuclear magnetic resonance (1H-NMR) spectra, 13C nuclear magnetic resonance (13C-NMR) spectra and electron paramagnetic resonance (EPR) spectra. The construction of the database started in 1982. Most of the spectra were acquired and recorded in AIST and some of the collections are still being updated. Since 1997, the database can be accessed free of charge, but its use requires agreeing to a disclaimer; the total accumulated number of times accessed reached 550 million by the end of January, 2015.
|
wikipedia
|
wiki_32378_chunk_1
|
Fugue (hash function)
|
The selling point of Fugue is the authors' claimed proof that a wide range of current attack strategies based on differential cryptanalysis cannot be efficient against Fugue. It is also claimed to be competitive with the NIST hash function SHA-256 in both software and hardware efficiency, achieving up to 36.2 cycles per byte on an Intel Family 6 Model 15 Xeon 5150, and up to 25 cycles per byte on an Intel Core 2 processor T7700. On 45 nm Core2 processors, e.g. T9400, Fugue-256 runs at 16 cycles per byte using SSE4.1 instructions. On the newer Westmere architectures (32 nm), e.g. Core i5, Fugue-256 runs at 14 cycles/byte.
|
wikipedia
|
wiki_7215_chunk_28
|
Schönhage–Strassen algorithm
|
This section explains a number of important practical optimizations that have been considered when implementing Schönhage–Strassen in real systems. It is based primarily on a 2007 work by Gaudry, Kruppa, and Zimmermann describing enhancements to the GNU Multi-Precision Library. Below a certain cutoff point, it's more efficient to perform the recursive multiplications using other algorithms, such as Toom–Cook multiplication. The results must be reduced mod 2n + 1, which can be done efficiently as explained above in Shift optimizations with shifts and adds/subtracts.
|
wikipedia
|
wiki_26716_chunk_19
|
Construction and management simulation
|
Factory simulation games
Factory simulation or optimization games typically involve the efficient conversion of resources into products through a combination of a labor workforce and automated systems. Some of these are closer to business simulations, where the player is challenged to make products in a cost-effective manner by establishing production lines to compete with other virtual competitors, such as in Big Pharma and Good Company. Other factory simulators are based on open-world survival games, with the goal to build enough parts from raw materials found in the world while fending off hostiles to be able to escape or achieve a very large-scale production target, such as in Factorio, Satisfactory, and Dyson Sphere Program. Other examples of this genre are Mindustry that combines factory simulation with the Tower defense genre and Shapez.io, which has adopted the minimalistic art style of the .io Browser games.
|
wikipedia
|
wiki_2861_chunk_12
|
Cooley–Tukey FFT algorithm
|
The above re-expression of a size-N DFT as two size-N/2 DFTs is sometimes called the Danielson–Lanczos lemma, since the identity was noted by those two authors in 1942 (influenced by Runge's 1903 work). They applied their lemma in a "backwards" recursive fashion, repeatedly doubling the DFT size until the transform spectrum converged (although they apparently didn't realize the linearithmic [i.e., order N log N] asymptotic complexity they had achieved). The Danielson–Lanczos work predated widespread availability of mechanical or electronic computers and required manual calculation (possibly with mechanical aids such as adding machines); they reported a computation time of 140 minutes for a size-64 DFT operating on real inputs to 3–5 significant digits. Cooley and Tukey's 1965 paper reported a running time of 0.02 minutes for a size-2048 complex DFT on an IBM 7094 (probably in 36-bit single precision, ~8 digits). Rescaling the time by the number of operations, this corresponds roughly to a speedup factor of around 800,000. (To put the time for the hand calculation in perspective, 140 minutes for size 64 corresponds to an average of at most 16 seconds per floating-point operation, around 20% of which are multiplications.)
|
wikipedia
|
wiki_7920_chunk_11
|
Physiologically based pharmacokinetic modelling
|
Skin depot
The absorption of a chemical deposited on skin can also be modeled using first order terms. It is best in that case to separate the skin from the other tissues, to further differentiate exposed skin and non-exposed skin, and differentiate viable skin (dermis and epidermis) from the stratum corneum (the actual skin upper layer exposed). This is the approach taken in [Bois F., Diaz Ochoa J.G. Gajewska M., Kovarich S., Mauch K., Paini A., Péry A., Sala Benito J.V., Teng S., Worth A., in press, Multiscale modelling approaches for assessing cosmetic ingredients safety, Toxicology. doi: 10.1016/j.tox.2016.05.026]
|
wikipedia
|
wiki_26297_chunk_1
|
Polish Logic
|
Library of Congress cataloging data
LC Control No.: 67106639
Type of Material: Book (Print, Microform, Electronic, etc.)
Personal Name: McCall, Storrs, comp.
Main Title: Polish logic, 1920-1939 papers by Ajdukiewicz [and others];
Published/Created: Oxford, Clarendon P., 1967.
Description: [2] viii, 406 p. 23 cm.
Subjects: Logic, Symbolic and mathematical--Addresses, essays, lectures.
LC Classification: BC135 .M18 History of logic
1967 non-fiction books
Logic books
|
wikipedia
|
wiki_32818_chunk_68
|
Matrix (mathematics)
|
Applications
There are numerous applications of matrices, both in mathematics and other sciences. Some of them merely take advantage of the compact representation of a set of numbers in a matrix. For example, in game theory and economics, the payoff matrix encodes the payoff for two players, depending on which out of a given (finite) set of alternatives the players choose. Text mining and automated thesaurus compilation makes use of document-term matrices such as tf-idf to track frequencies of certain words in several documents. Complex numbers can be represented by particular real 2-by-2 matrices via
|
wikipedia
|
wiki_7023_chunk_13
|
Federated database system
|
Schema matching, schema mapping
Dealing with incompatible data types or query syntax is not the only obstacle to a concrete implementation of an FDBS. In systems that are not planned top-down, a generic problem lies in matching semantically equivalent, but differently named parts from different schemas (=data models) (tables, attributes). A pairwise mapping between n attributes would result in mapping rules (given equivalence mappings) - a number that quickly gets too large for practical purposes. A common way out is to provide a global schema that comprises the relevant parts of all member schemas and provide mappings in the form of database views. Two principal approaches depend on the direction of the mapping:
Global as View (GaV): the global schema is defined in terms of the underlying schemas
Local as View (LaV): the local schemas are defined in terms of the global schema
Both are examples of data integration, called the schema matching problem.
|
wikipedia
|
wiki_4663_chunk_33
|
Boyer–Moore string-search algorithm
|
k = len(P) - 1 # Represents alignment of end of P relative to T
previous_k = -1 # Represents alignment in previous phase (Galil's rule)
while k < len(T):
i = len(P) - 1 # Character to compare in P
h = k # Character to compare in T
while i >= 0 and h > previous_k and P[i] == T[h]: # Matches starting from end of P
i -= 1
h -= 1
if i == -1 or h == previous_k: # Match has been found (Galil's rule)
matches.append(k - len(P) + 1)
k += len(P) - F[1] if len(P) > 1 else 1
else: # No match, shift by max of bad character and good suffix rules
char_shift = i - R[alphabet_index(T[h])][i]
if i + 1 == len(P): # Mismatch happened on first attempt
suffix_shift = 1
elif L[i + 1] == -1: # Matched suffix does not appear anywhere in P
suffix_shift = len(P) - F[i + 1]
else: # Matched suffix appears in P
suffix_shift = len(P) - 1 - L[i + 1]
shift = max(char_shift, suffix_shift)
previous_k = k if shift >= i + 1 else previous_k # Galil's rule
k += shift
return matches
|
wikipedia
|
wiki_11626_chunk_3
|
Internet Low Bitrate Codec
|
Parameters and features
Sampling frequency 8 kHz/16 bit (160 samples for 20 ms frames, 240 samples for 30 ms frames)
Controlled response to packet loss, delay and jitter
Fixed bitrate (15.2 kbit/s for 20 ms frames, 13.33 kbit/s for 30 ms frames)
Fixed frame size (304 bits per block for 20 ms frames, 400 bits per block for 30 ms frames)
Robustness similar to pulse-code modulation (PCM) with packet loss concealment, like the ITU-T G.711
CPU load similar to G.729A, with higher basic quality and better response to packet loss
Royalty-free
Since 2011 it is available under an open source (3-clause BSD license) license as a part of the open source WebRTC project. (previously commercial use of the source code supplied by GIPS required a licence)
PSQM testing under ideal conditions yields mean opinion scores of 4.14 for iLBC (15.2 kbit/s), compared to 4.3 for G.711 (μ-law)
|
wikipedia
|
wiki_8025_chunk_15
|
Timeline of jet power
|
1944
BMW tests the 003R, a 003 with an additional rocket engine mounted "in parallel" to the BMW 003A turbojet it is combined with; and produces an even more powerful "mixed-power" engine.
April: With internal design efforts underway at most engine companies, Power Jets have little possibility of profitability, and are nationalized, becoming a pure research lab as the National Gas Turbine Establishment.
June: Design work on a gas turbine engine for powering tanks begins under the direction of Müller, who left Heinkel in 1942. The first such system, the GT 101, is completed in November and fit to a Panther tank for testing.
June: A Derwent II engine is modified with an additional turbine stage powering a gearbox and five-bladed propeller. The resulting RB.50, or Rolls-Royce Trent, is not further developed, but is test flown on a modified Gloster Meteor.
The Junkers Ju 287 jet bomber is tested.
The BMW 018 engine is tested. Work ends soon after when the entire tooling and parts supply are destroyed in a bombing raid.
The Junkers Jumo 012 engine is tested, it stands as the most powerful engine in the world for some time, at .
The J35, a development of an earlier turboprop effort, runs for the first time.
Ford builds a copy of the V-1's engine, known as the PJ-31-1.
The Ishikawajima Ne-20 first runs in Japan. Originally intending to build a direct copy of the BMW 003, the plans never arrived and the Japanese engineers instead built an entirely new design based on a single cutaway image and several photographs.
The Doblhof WNF-4 flies, the first ramjet-powered helicopter.
April 5: The nearly complete prototype of the Leduc 010 ramjet-powered aircraft, under construction at the Montaudran airfield near Toulouse, France, unbeknownst to German occupation authorities, is heavily damaged by a Royal Air Force bombing raid.
April: The Messerschmitt Me 262 first enters combat service Germany.
June: The Messerschmitt Me 262 enters squadron service in Germany.
July: The Gloster Meteor enters squadron service in the United Kingdom.
27 July: First combat mission flown by a Gloster Meteor
4 August: Gloster Meteors shot down two pulsejet-powered V-1 flying bombs
A design competition starts in Germany to build a simple jet fighter, the Volksjäger. The contract is eventually won by the Heinkel He 162 Spatz (sparrow), to be powered by the BMW 003.
October 27 - After a short 6-month period Rolls-Royce designs and builds the Rolls-Royce Nene at , but it sees only limited use in the United Kingdom, and is first run on this date.
December: Northrop's T-37 turboprop is tested. The design never matures and work is later stopped in the late 1940s.
|
wikipedia
|
wiki_10423_chunk_2
|
Self-documenting code
|
Practical considerations
There are certain practical considerations that influence whether and how well the objectives for a self-documenting system can be realized. uniformity of naming conventions
consistency
scope of the application and system requirements Examples
Below is a very simple example of self-documenting code, using naming conventions in place of explicit comments to make the logic of the code more obvious to human readers. size_t count_alphabetic_chars(const char *text)
{
if (text == NULL)
return 0; size_t count = 0;
|
wikipedia
|
wiki_815_chunk_17
|
Reed–Solomon error correction
|
There are different encoding procedures for the Reed–Solomon code, and thus, there are different ways to describe the set of all codewords.
In the original view of , every codeword of the Reed–Solomon code is a sequence of function values of a polynomial of degree less than k. In order to obtain a codeword of the Reed–Solomon code, the message symbols (each within the q-sized alphabet) are treated as the coefficients of a polynomial p of degree less than k, over the finite field F with q elements.
In turn, the polynomial p is evaluated at n ≤ q distinct points of the field F, and the sequence of values is the corresponding codeword. Common choices for a set of evaluation points include {0, 1, 2, ..., n − 1}, {0, 1, α, α2, ..., αn−2}, or for n < q, {1, α, α2, ..., αn−1}, ... , where α is a primitive element of F.
|
wikipedia
|
wiki_25050_chunk_1
|
Sums of powers
|
Sums of squares arise in many contexts. For example, in geometry, the Pythagorean theorem involves the sum of two squares; in number theory, there are Legendre's three-square theorem and Jacobi's four-square theorem; and in statistics, the analysis of variance involves summing the squares of quantities.
Faulhaber's formula expresses as a polynomial in n, or alternatively in term of a Bernoulli polynomial.
Fermat's right triangle theorem states that there is no solution in positive integers for and .
Fermat's Last Theorem states that is impossible in positive integers with k>2.
The equation of a superellipse is . The squircle is the case .
Euler's sum of powers conjecture (disproved) concerns situations in which the sum of n integers, each a kth power of an integer, equals another kth power.
The Fermat-Catalan conjecture asks whether there are an infinitude of examples in which the sum of two coprime integers, each a power of an integer, with the powers not necessarily equal, can equal another integer that is a power, with the reciprocals of the three powers summing to less than 1.
Beal's conjecture concerns the question of whether the sum of two coprime integers, each a power greater than 2 of an integer, with the powers not necessarily equal, can equal another integer that is a power greater than 2.
The Jacobi–Madden equation is in integers.
The Prouhet–Tarry–Escott problem considers sums of two sets of kth powers of integers that are equal for multiple values of k.
A taxicab number is the smallest integer that can be expressed as a sum of two positive third powers in n distinct ways.
The Riemann zeta function is the sum of the reciprocals of the positive integers each raised to the power s, where s is a complex number whose real part is greater than 1.
The Lander, Parkin, and Selfridge conjecture concerns the minimal value of m + n in
Waring's problem asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s kth powers of natural numbers.
The successive powers of the golden ratio φ obey the Fibonacci recurrence:
|
wikipedia
|
wiki_2949_chunk_12
|
Mechanics' institute
|
21st century revival
Across the world, there is a move to sustain and revive mechanics' institutes and related institutions as subscription libraries, sometimes incorporating or expanding their earlier functions. There have been several worldwide conferences, known as the Mechanics' Worldwide Conference, of representatives of, or people who have an interest in, mechanics' institutes. As of 2021, there have been five such conferences:
2004: Buildings, Books and Beyond: Mechanics' Worldwide, at Swinburne University, Prahran, Victoria, and the Prahran Mechanics' Institute, Australia
2009: Self Help: Mechanics' Worldwide, at the Bath Royal Literary and Scientific Institution, Bath, Somerset, England
2012: Buildings, Books and Blackboards – Intersecting Narratives: Mechanics' Worldwide, RMIT University, Melbourne, Australia (a combined conference of the Australian and New Zealand History of Education Society (ANZHES), under the auspices of MIV and incorporating the 10th Library history forum)
2016: Reinvention: Thriving in the 21st Century Mechanics' Worldwide, Mechanics' Institute, San Francisco, California, U.S.
2021: Mechanics' Institutes: Past, Present and Future – Mechanics' Institutes Worldwide, at Heriot-Watt University, Edinburgh, Scotland, and online (due to the COVID-19 pandemic)
|
wikipedia
|
wiki_8556_chunk_3
|
Copycat (software)
|
Comparison to other cognitive architectures
Copycat differs considerably in many respects from other cognitive architectures such as ACT-R, Soar, DUAL, Psi, or subsumption architectures. Copycat is Hofstadter's most popular model. Other models presented by Hofstadter et al. are similar in architecture, but different in the so-called microdomain, their application, e.g. Letter Spirit, etc.
|
wikipedia
|
wiki_15588_chunk_18
|
N-body simulation
|
Reif and Tate prove that if the n-body reachability problem is defined as follows – given n bodies satisfying a fixed electrostatic potential law, determining if a body reaches a destination ball in a given time bound where we require a poly(n) bits of accuracy and the target time is poly(n) is in PSPACE. On the other hand, if the question is whether the body eventually reaches the destination ball, the problem is PSPACE-hard. These bounds are based on similar complexity bounds obtained for ray tracing. Example Simulations
|
wikipedia
|
wiki_28723_chunk_6
|
Neuroscience Information Framework
|
The NIF Data Federation searches deep database content of over 150 databases including: various NCBI databases (PubMed, Gensat, Entrez Gene, Homologene, GEO) as well as many large and small databases that have something to do with neuroscience including Gemma (microarray data from the nervous system), CCDB & CIL (images of neurons and astrocytes, mainly), GeneNetwork, AgingGenesDB, XNAT, 1000 Functional Connectomes. The 'complete' list (as of April 2013) can be found in the table below. An updated list can be found on the Data Federation page.
In addition many databases that have very similar types of data have been integrated into 'virtual databases', which combine many databases into one table. For example, the AntibodyRegistry combines data from 200+ vendors, the NIF Integrated BrainGeneExpression combines gene expression data from Gensat, Alan Brain, and Mouse Genome Informatics, the Connectivity view combines six databases that have statements about nervous system connectivity, the Integrated Animal view combines data about experimental animal catalogs available to researchers from transgenic or inbred worms, zebrafish, mice and rats. We add more of these as data are registered, so check back to this page to see the current contents.
For an exhaustive and up to date list of Databases and Datasets registered to NIF please check this page www.neurolex.org. The table below was updated April 9, 2013.
|
wikipedia
|
wiki_19039_chunk_2
|
Biological Radio
|
Samples and influences
The timings above are those listed on the sleeve, however the tracks tend to flow sometimes without obvious boundaries and some of the samples listed below may relate to the preceding or following track.
Biological Radio contains a sample from "Lightning Flash" by Big Youth; the quotation "this is ZQI" is a sample from the 1982 film Countryman. The "Yabby Yabby You" chant is from "Conquering Lion" by Yabby You.
Moving On samples "Daisy Bell" 'sung' by an IBM 704 computer at Bell Labs in 1961, an early example of speech synthesis.
Third Wave includes a sample of dialogue ("a new electric dimension") from the 1992 film The Lawnmower Man.
The Lost Tribe contains the quotation "Earth, a biosphere; a complex, subtly balanced life support system" taken from 90's sample libraries (such as AMG Global Trance Mission vol.1) and AKAI samplers. But the full original source is still unknown, probably it is from TV or radio show. This sample can be found on Enigma's 1996 track "Morphing Thru Time", also such projects as Asia 2001, Abscess, Planet B.E.N. & Spiralkinda used this sample.
Earth Angel: "Look! Way up there in the sky!" is a snatch of dialogue from the 1975 film Picnic at Hanging Rock.
Messengers: "It's a mathematical certainty that somewhere among the millions of stars, there is another planet that speaks English" is a quote from the film if....; "there's no reason to be afraid" is a line from Gremlins (1984).
Heat The Pot: The opening "he introduced them to a strange substance that was to have an enormous effect on them: tea" is from Eric Idle's 1978 film The Rutles (All You Need Is Cash). "Send in a nice pot of tea and a couple of fairy cakes, will you?" is spoken by Lionel Jeffries in the 1963 film The Wrong Arm of the Law. At the very end of the track Oliver Reed saying "nice to have company for tea..." is extracted from The Adventures of Baron Munchausen (1988).
Ali Baba - the opening section and rhythm is lifted from "The Poor Barber" by Dirty Harry & The Aggrovators. There is a reference to a barber's chair in Dreadzone's lyrics.
Dream Within A Dream takes its title from, and quotes, the Edgar Allan Poe poem of the same title. The dialogue used is again from Picnic at Hanging Rock.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.