id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_4912_chunk_8
|
Power Mac G4
|
{| class="wikitable"
|-
!style="background:#ffdead;width:10%"|Component
!style="background:#ffdead;width:30%"|Power Mac G4 (PCI Graphics)
!style="background:#ffdead;width:30%"|Power Mac G4 (AGP Graphics)
!style="background:#ffdead;width:30%"|Power Mac G4 (Gigabit Ethernet)
|-
! Codename
|"Yikes!"
|"Sawtooth, P5, Project E"
|"Mystic, Medusa2, SnakeBite"
|-
! Color
|colspan=3|
|-
! Model identifier
|PowerMac1,2||PowerMac3,1||PowerMac3,3
|-
! Processor
|350 or 400 MHz PowerPC G4 (7400)
|350, 400, 450 or 500 MHz PowerPC G4 (7400)
|400, Dual 450 or Dual 500 MHz PowerPC G4 (7400)
|-
! CPU cache
|colspan=3|64 KB L1, 512 KB or 1 MB backside L2 Cache per CPU (1:2)
|-
! Front side bus
|colspan=3|100 MHz
|-
! Memory
|colspan=1|64, 128, 256, 512 MB, or 1GB PC100 SDRAM<span style="color:#969696">Expandable to 1 GB</span>
|colspan=2|64, 128, 256, 512 MB, 1 or 2 GB PC100 SDRAMExpandable to 2 GB. Only 1.5 GB is seen in Mac OS 9</span>
|-
! Graphics card
|ATI Rage 128 with 16 MB of VRAM 66 MHz PCI Slot
|ATI Rage 128 or ATI Rage 128 Pro with 16 MB of VRAM AGP 2x
|ATI Rage 128 Pro with 16 MB VRAM or ATI Radeon with 32 MB of VRAM AGP 2x w/ADC Monitor support
|-
! rowspan=2| Hard drive
|10 GB ATAUp to 128 GB || 10, 20, or 27 GB 7200-rpm ATA18 or 36 GB 10K-rpm SCSIUp to 128 GB (10.4.11 and newer support hard drives larger than 128 GB with special software) || 20 GB 5400-rpm, 30 or 40 GB 7200-rpm ATA36 or 72 GB 10K-rpm SCSIUp to 128 GB (10.4.11 and newer support Hard Drives larger than 128 GB with special software)
|-
| Ultra ATA/33 || colspan=2| Ultra ATA/66 (Optional Ultra2 LVD SCSI)|-
! Optical drive
|32× CD-ROM or DVD-ROM
|32× CD-ROM, DVD-ROM, or DVD-RAM
|DVD-ROM or DVD-RAM
|-
! Connectivity
|10/100BASE-T Ethernet56k modem
|Optional AirPort 802.11b10/100BASE-T Ethernet56k modem
|Optional AirPort 802.11bGigabit Ethernet56k V.90 modem
|-
! Expansion
|1× Zip drive bay (Zip drive is standard on 450mhz(400mhz pre-2000)and 500mhz(450mhz pre-2000) "Sawtooth" models, optional on all other models)3x 64bit 33 MHz PCI slots1× 66 MHz PCI slot (dedicated to video)
|colspan=2|1× Zip drive bay (optional Zip drive)3x 64-bit 33 MHz PCI slots1× 2× AGP slot (dedicated to video)
|-
! Peripherals
|2× USB 1.12× FireWire 400Built-in mono speakerAudio input mini-jackAudio output mini-jack || 2× USB 1.12× FireWire 4001× Internal FireWire 400Built-in mono speakerAudio input mini-jackAudio output mini-jack || 2× USB 1.12× FireWire 400Built-in mono speakerAudio input mini-jackAudio output mini-jack
|-
! Maximum Operating System
|colspan=3| Mac OS X 10.4.11 "Tiger" and Mac OS 9.2.2<span style="color:#969696">Unofficially can support 10.5 Leopard via 3rd party software
|-
! Weight
|colspan=1|13 kg (28.7 pounds)
|13.6 kg (30 pounds) || 13.6 kg (30 pounds)
|}
|
wikipedia
|
wiki_525_chunk_24
|
Linguistic relativity
|
Whorf’s argument about Hopi speakers’ conceptualization about time is an example of the structure-centered approach to research into linguistic relativity, which Lucy identified as one of three main strands of research in the field. The "structure-centered" approach starts with a language's structural peculiarity and examines its possible ramifications for thought and behavior. The defining example is Whorf's observation of discrepancies between the grammar of time expressions in Hopi and English. More recent research in this vein is Lucy's research describing how usage of the categories of grammatical number and of numeral classifiers in the Mayan language Yucatec result in Mayan speakers classifying objects according to material rather than to shape as preferred by English speakers. However, philosophers including Donald Davidson and Jason Josephson Storm have argued that Whorf's Hopi examples are self-refuting, as Whorf had to translate Hopi terms into English in order to explain how they are untranslatable.
|
wikipedia
|
wiki_20386_chunk_13
|
Commission on Legal Empowerment of the Poor
|
External links
https://web.archive.org/web/20080218060641/http://legalempowerment.undp.org/
https://www.youtube.com/LegalEmpowerment1
https://web.archive.org/web/20100221161016/http://lepknowledgebank.ning.com/
http://www.snap-undp.org/lepknowledgebank
https://web.archive.org/web/20101026195806/http://www.soros.org/initiatives/justice/focus/legal_capacity/projects/lep
http://www.hiil.org/
https://web.archive.org/web/20100906025700/http://www.sum.uio.no/research/poverty/anlep/
http://web.worldbank.org/WBSITE/EXTERNAL/TOPICS/EXTLAWJUSTICE/EXTJUSFORPOO/0,,menuPK:3282947~pagePK:149018~piPK:149093~theSitePK:3282787,00.html
http://lup.lub.lu.se/luur/download?func=downloadFile&recordOId=1613415&fileOId=1613430
|
wikipedia
|
wiki_7965_chunk_14
|
Association for Psychological Science
|
Awards and honors
William James Fellow Award: Honors APS members for their lifetime of significant intellectual contributions to the basic science of psychology. Recipients must be APS members recognized internationally for their outstanding contributions to scientific psychology.
James McKeen Cattell Fellow Award: Recognizes APS members for a lifetime of outstanding contributions to applied psychological research. Recipients must be APS members whose research addresses a critical problem in society at large.
Mentor Award: Recognizes those who have significantly fostered the careers of others, honoring APS members who masterfully help students and others find their own voice and discover their research and career goals.
Janet Taylor Spence Award for Transformative Early Career Contributions: Recognizes transformative early career contributions to psychological science. Award recipients should reflect cutting edge ideas in psychological science.
APS Fellows: Awarded to APS members who have made sustained outstanding contributions to the science of psychology in the areas of research, teaching, service, or application.
APS Rising Star: early-career research award since 2009, which recognizes "researchers whose innovative work has already advanced the field and signals great potential for their continued contributions to psychological science".
Psi Chi/APS Albert Bandura Graduate Research Award: By recognizing and awarding the most outstanding graduate, empirical research paper, the APS Albert Bandura Graduate Research Award promotes the first author's career in psychology by conferring official recognition in various forms from both Psi Chi and APS and a cash prize. This award honors Albert Bandura, a Distinguished Member of Psi Chi and a William James Fellow of APS, for significant lifetime contributions to psychology and for his exemplary and dedicated support and mentoring of students and their research throughout his long professional career.
Scott Lilienfeld APS Travel Award, established in 2020 to fund travel and lodging for one or more graduate students attending the APS Annual Convention
|
wikipedia
|
wiki_19968_chunk_1
|
Correlation (projective geometry)
|
In two dimensions
In the real projective plane, points and lines are dual to each other. As expressed by Coxeter,
A correlation is a point-to-line and a line-to-point transformation that preserves the relation of incidence in accordance with the principle of duality. Thus it transforms ranges into pencils, pencils into ranges, quadrangles into quadrilaterals, and so on.
Given a line m and P a point not on m, an elementary correlation is obtained as follows: for every Q on m form the line PQ. The inverse correlation starts with the pencil on P: for any line q in this pencil take the point . The composition of two correlations that share the same pencil is a perspectivity.
|
wikipedia
|
wiki_554_chunk_39
|
Simplified molecular-input line-entry system
|
Note that % appears in front of the index of ring closure labels above 9; see above. Other examples of SMILES The SMILES notation is described extensively in the SMILES theory manual provided by Daylight Chemical Information Systems and a number of illustrative examples are presented. Daylight's depict utility provides users with the means to check their own examples of SMILES and is a valuable educational tool. Extensions
|
wikipedia
|
wiki_226_chunk_26
|
Functional programming
|
Some research-oriented functional languages such as Coq, Agda, Cayenne, and Epigram are based on intuitionistic type theory, which lets types depend on terms. Such types are called dependent types. These type systems do not have decidable type inference and are difficult to understand and program with. But dependent types can express arbitrary propositions in higher-order logic. Through the Curry–Howard isomorphism, then, well-typed programs in these languages become a means of writing formal mathematical proofs from which a compiler can generate certified code. While these languages are mainly of interest in academic research (including in formalized mathematics), they have begun to be used in engineering as well. Compcert is a compiler for a subset of the C programming language that is written in Coq and formally verified.
|
wikipedia
|
wiki_22629_chunk_25
|
Renewable energy in Australia
|
Oceanlinx is trialling a wave energy system at Port Kembla.
Carnegie Corp of Western Australia is refining a method of using energy captured from passing waves, CETO 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). The company is looking to have a 100MW demonstration project finished within the next four years.
BioPower Systems is developing its 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.
|
wikipedia
|
wiki_5878_chunk_8
|
Computational sociology
|
By the late 1960s and early 1970s, social scientists used increasingly available computing technology to perform macro-simulations of control and feedback processes in organizations, industries, cities, and global populations. These models used differential equations to predict population distributions as holistic functions of other systematic factors such as inventory control, urban traffic, migration, and disease transmission. Although simulations of social systems received substantial attention in the mid-1970s after the Club of Rome published reports predicting that policies promoting exponential economic growth would eventually bring global environmental catastrophe, the inconvenient conclusions led many authors to seek to discredit the models, attempting to make the researchers themselves appear unscientific. Hoping to avoid the same fate, many social scientists turned their attention toward micro-simulation models to make forecasts and study policy effects by modeling aggregate changes in state of individual-level entities rather than the changes in distribution at the population level. However, these micro-simulation models did not permit individuals to interact or adapt and were not intended for basic theoretical research.
|
wikipedia
|
wiki_33714_chunk_6
|
Traditional ecological knowledge
|
Differences from science Fulvio Mazzocchi of the Italian National Research Council's Institute of Atmospheric Pollution contrasts traditional knowledge from scientific knowledge as follows: Aspects of traditional ecological knowledge
The aspects of traditional ecological knowledge provide different typologies in how it is utilized and understood. These are good indicators in how it is used from different perspectives and how they are interconnected, providing more emphasis on "cooperative management to better identify areas of difference and convergence when attempting to bring two ways of thinking and knowing together."
|
wikipedia
|
wiki_97_chunk_4
|
C (programming language)
|
The C language also exhibits the following characteristics:
The language has a small, fixed number of keywords, including a full set of control flow primitives: if/else, for, do/while, while, and switch. User-defined names are not distinguished from keywords by any kind of sigil.
It has a large number of arithmetic, bitwise, and logic operators: , etc.
More than one assignment may be performed in a single statement.
Functions:
Function return values can be ignored, when not needed.
Function and data pointers permit ad hoc run-time polymorphism.
Functions may not be defined within the lexical scope of other functions.
Data typing is static, but weakly enforced; all data has a type, but implicit conversions are possible.
Declaration syntax mimics usage context. C has no "define" keyword; instead, a statement beginning with the name of a type is taken as a declaration. There is no "function" keyword; instead, a function is indicated by the presence of a parenthesized argument list.
User-defined (typedef) and compound types are possible.
Heterogeneous aggregate data types (struct) allow related data elements to be accessed and assigned as a unit.
Union is a structure with overlapping members; only the last member stored is valid.
Array indexing is a secondary notation, defined in terms of pointer arithmetic. Unlike structs, arrays are not first-class objects: they cannot be assigned or compared using single built-in operators. There is no "array" keyword in use or definition; instead, square brackets indicate arrays syntactically, for example month[11].
Enumerated types are possible with the enum keyword. They are freely interconvertible with integers.
Strings are not a distinct data type, but are conventionally implemented as null-terminated character arrays.
Low-level access to computer memory is possible by converting machine addresses to typed pointers.
Procedures (subroutines not returning values) are a special case of function, with an untyped return type void.
A preprocessor performs macro definition, source code file inclusion, and conditional compilation.
There is a basic form of modularity: files can be compiled separately and linked together, with control over which functions and data objects are visible to other files via static and extern attributes.
Complex functionality such as I/O, string manipulation, and mathematical functions are consistently delegated to library routines.
|
wikipedia
|
wiki_30534_chunk_27
|
Communicative ecology
|
While an ecological study aims to be holistic, an appropriate frame for the study must be decided upon at the outset. The scope of communicative ecology research settings is generally restricted to a bounded geographical space. It has been proposed that the communicative ecology framework is suited to studies at the level of the dwelling, neighbourhood, suburb or city (Hearn & Foth, 2007). However, it is also suitable for studies of communicative ecologies that are grounded in online environments. In this case, the setting could be limited to one or several websites (Button & Partridge, 2007).
|
wikipedia
|
wiki_31218_chunk_45
|
Environmental impact of wind power
|
The Peñascal Wind Power Project in Texas is located in the middle of a major bird migration route, and the wind farm uses avian radar originally developed for NASA and the United States Air Force to detect birds as far as away. If the system determines that the birds are in danger of running into the rotating blades, the turbines shut down and are restarted when the birds have passed. A 2005 Danish study used surveillance radar to track migrating birds traveling around and through an offshore wind farm. Less than 1% of migrating birds passing through an offshore wind farm in Rønde, Denmark, got close enough to be at risk of collision, though the site was studied only during low-wind conditions. The study suggests that migrating birds may avoid large turbines, at least in the low-wind conditions the research was conducted in. Furthermore, it is not thought that nocturnal migrants are at higher risk to collision than diurnally active species.
|
wikipedia
|
wiki_38893_chunk_9
|
Movable cellular automaton
|
The εij parameter is used as a measure of deformation of automaton i under its interaction with automaton j. Where qij – is a distance from the center of automaton i to its contact point with automaton j; Ri = di/2 (di – is the size of automaton i). As an example the titanium specimen under cyclic loading (tension – compression) is considered. The loading diagram is shown in the next figure: Advantages of MCA method
Due to mobility of each automaton the MCA method allows to take into account directly such actions as:
|
wikipedia
|
wiki_4356_chunk_7
|
M4 (computer language)
|
Example
The following fragment gives a simple example that could form part of a library for generating HTML code. It defines a commented macro to number sections automatically: divert(-1) m4 has multiple output queues that can be manipulated with the
`divert' macro. Valid queues range from 0 to 10, inclusive, with
the default queue being 0. As an extension, GNU m4 supports more
diversions, limited only by integer type size.
|
wikipedia
|
wiki_23604_chunk_15
|
Energy Exchange Austria
|
teem - Training for Energy and Environmental Markets
Besides its function as a marketplace for spot electricity, EXAA also supports regional initiatives related to electricity markets and provides a training program - teem, for electric utilities and different stakeholders from the energy industry.
The Training for Energy and Environmental Markets was developed by EXAA in cooperation with experts from the CISMO Group and from different strategic partners covering all segments of the energy sector. The goal was to develop a training with focus on the practical aspects of the electricity industry, using the newest data to analyze trends and market developments and provide a wide range of professionals with insights from market practitioners. The transparent and coherent energy insights as well as current developments are not only interesting for energy newcomers but also for employees who want to broaden and update their knowledge.
teem has already achieved the position of market leader in the energy training segment as it convinces delegates with its up-to-date and compact contentcs as well as its great value for money.
|
wikipedia
|
wiki_19197_chunk_24
|
Molecular orbital diagram
|
Diboron
The MO diagram for diboron (B-B, electron configuration 1σg21σu22σg22σu21πu2) requires the introduction of an atomic orbital overlap model for p orbitals. The three dumbbell-shaped p-orbitals have equal energy and are oriented mutually perpendicularly (or orthogonally). The p-orbitals oriented in the z-direction (pz) can overlap end-on forming a bonding (symmetrical) σ orbital and an antibonding σ* molecular orbital. In contrast to the sigma 1s MO's, the σ 2p has some non-bonding electron density at either side of the nuclei and the σ* 2p has some electron density between the nuclei.
|
wikipedia
|
wiki_15793_chunk_0
|
List of MeSH codes (H01)
|
The following is a list of "H" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (G14). Codes following these are found at List of MeSH codes (I01). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – natural sciences
|
wikipedia
|
wiki_2151_chunk_13
|
D (programming language)
|
Other functional features such as currying and common higher-order functions such as map, filter, and reduce are available through the standard library modules std.functional and std.algorithm. import std.stdio, std.algorithm, std.range; void main()
{
int[] a1 = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
int[] a2 = [6, 7, 8, 9]; // must be immutable to allow access from inside a pure function
immutable pivot = 5;
|
wikipedia
|
wiki_8830_chunk_5
|
Loop optimization
|
The unimodular transformation approach uses a single unimodular matrix to describe the combined result of a sequence of many of the above transformations. Central to this approach is the view of the set of all executions of a statement within n loops as a set of integer points in an n-dimensional space, with the points being executed in lexicographical order. For example, the executions of a statement nested inside an outer loop with index i and an inner loop with index j can be associated with the pairs of integers . The application of a unimodular transformation corresponds to the multiplication of the points within this space by the matrix. For example, the interchange of two loops corresponds to the matrix .
|
wikipedia
|
wiki_31800_chunk_3
|
Turku Centre for Computer Science
|
The research in TUCS is focused on TUCS Research Programmes. Currently the research programmes are: Combinatorics, Complex Systems and Computability (Com3) - director Prof. Jarkko Kari
From Computational Biology and Medical Informatics to Health and Wellbeing (BioHealth) - directors Prof. Tapio Salakoski and Prof. Ion Petre
Resilient IT Infrastructures (RITES) - directors Prof. Ivan Porres and Dr. Juha Plosila
Turku Information Systems Research Alliance (TISRA) - directors Prof. Emer. Christer Carlsson and Prof. Jukka Heikkilä
|
wikipedia
|
wiki_2677_chunk_10
|
Orthomolecular medicine
|
Scope
According to Abram Hoffer, orthomolecular medicine does not purport to treat all diseases, nor is it "a replacement for standard treatment. A proportion of patients will require orthodox treatment, a proportion will do much better on orthomolecular treatment, and the rest will need a skillful blend of both." Nevertheless, advocates have said that the right nutrients at the optimum dose for the individual concerned can prevent, treat, and sometimes cure a wide range of medical conditions. Conditions for which orthomolecular practitioners have claimed some efficacy are: acne, alcoholism, allergies, arthritis, autism, bee stings, bipolar disorder, burns, cancer, the common cold, depression, drug addiction, drug overdose, epilepsy, heart diseases, heavy metal toxicity, acute hepatitis, herpes, hyperactivity, hypertension, hypoglycemia, influenza, learning disabilities, mental and metabolic disorders, migraine, mononucleosis, mushroom poisoning, neuropathy & polyneuritis (including multiple sclerosis), osteoporosis, polio, a hypothesised condition called "pyroluria", radiation sickness, Raynaud's disease, mental retardation, schizophrenia, shock, skin problems, snakebite, spider bite, tetanus toxin and viral pneumonia.
|
wikipedia
|
wiki_7662_chunk_50
|
Race and genetics
|
Criticism of race-based medicines
Troy Duster points out that genetics is often not the predominant determinant of disease susceptibilities, even though they might correlate with specific socially defined categories. This is because this research oftentimes lacks control for a multiplicity of socio-economic factors. He cites data collected by King and Rewers that indicates how dietary differences play a significant role in explaining variations of diabetes prevalence between populations.
|
wikipedia
|
wiki_30380_chunk_9
|
Ramer–Douglas–Peucker algorithm
|
The running time of this algorithm when run on a polyline consisting of segments and vertices is given by the recurrence where is the value of index in the pseudocode. In the worst case, or at each recursive invocation and this algorithm has a running time of . In the best case or at each recursive invocation in which case the running time has the well-known solution (via the master theorem for divide-and-conquer recurrences) of . Using (fully- or semi-)Dynamic convex hull data structures, the simplification performed by the algorithm can be accomplished in time.
|
wikipedia
|
wiki_8643_chunk_4
|
Javelin Software
|
Javelin encourages viewing data and algorithms in various self-documenting ways, including simultaneous multiple synchronized views. For example, users can move through the connections between variables on a diagram while seeing the logical roots and branches of each variable. This is an example of what is perhaps its primary contribution—the concept of traceability of a user's logic or model structure through its twelve views. Among its dynamically linked views were: diagram, formulas, table, chart, QuickGraph, worksheet, notes, errors, macro, graph. A complex model can be dissected and understood by others who had no role in its creation, and this remains unique even today.
|
wikipedia
|
wiki_88_chunk_11
|
List of country calling codes
|
Zone 8: East Asia and special services
+800 – Universal International Freephone Service (UIFN)
+801 – unassigned
+802 – unassigned
+803 – unassigned
+804 – unassigned
+805 – unassigned
+806 – unassigned
+807 – unassigned
+808 – Universal International Shared Cost Service (UISC)
+809 – unassigned
+81 –
+82 –
+83x – unassigned (reserved for country code expansion)
+84 –
+850 –
+851 – unassigned
+852 –
+853 –
+854 – unassigned
+855 –
+856 –
+857 – unassigned (formerly ANAC satellite service)
+858 – unassigned (formerly ANAC satellite service)
+859 – unassigned
+86 –
+870 – Inmarsat "SNAC" service
+871 – unassigned (formerly assigned to Inmarsat Atlantic East, discontinued in 2008)
+872 – unassigned (formerly assigned to Inmarsat Pacific, discontinued in 2008)
+873 – unassigned (formerly assigned to Inmarsat Indian, discontinued in 2008)
+874 – unassigned (formerly assigned to Inmarsat Atlantic West, discontinued in 2008)
+875 – unassigned (reserved for future maritime mobile service)
+876 – unassigned (reserved for future maritime mobile service)
+877 – unassigned (reserved for future maritime mobile service)
+878 – Universal Personal Telecommunications Service (UPTS)
+879 – unassigned (reserved for national non-commercial purposes)
+880 –
+881 – Global Mobile Satellite System
+882 – International Networks
+883 – International Networks
+884 – unassigned
+885 – unassigned
+886 –
+887 – unassigned
+888 – Telecommunications for Disaster Relief by OCHA
+889 – unassigned
+89x – unassigned (reserved for country code expansion)
|
wikipedia
|
wiki_35155_chunk_6
|
Interservice/Industry Training, Simulation and Education Conference
|
Each year I/ITSEC hosts a series of special events that reflect emerging topics in the modeling, simulation, and training domain. Special events are devised by the committee members who organize the conference, and special event participants receive invitations versus completing the peer-reviewed paper/tutorial submission process.
In 2015 there were 18 Special Events (a mix of Signature Events, Floor Events, and Focus Events) that included topics such as Live, Virtual, Constructive (LVC), How to predict and manage Black Swan events, artificial intelligence for social interaction simulation, transmedia learning, geospatial environment database standards, cybersecurity, and an Ignite (event) session with invited speakers. Frequently, these special events involve discussion panels, with high-ranking military and civilians personnel among the invited panelists. For instance, each year the conference includes a special event, called the “Congressional Modeling and Simulation Event,” where elected official discusses M&S policies; similarly, another special event, called the “General/Flag Officer Panel,” included active duty military officers and government civilians from the general/flag officer or Senior Executive Service echelons.
|
wikipedia
|
wiki_5072_chunk_46
|
Cell (microprocessor)
|
As first reported by Wired on October 17, 2007, an interesting application of using PlayStation 3 in a cluster configuration was implemented by Astrophysicist Gaurav Khanna, from the Physics department of University of Massachusetts Dartmouth, who replaced time used on supercomputers with a cluster of eight PlayStation 3s. Subsequently, the next generation of this machine, now called the PlayStation 3 Gravity Grid, uses a network of 16 machines, and exploits the Cell processor for the intended application which is binary black hole coalescence using perturbation theory. In particular, the cluster performs astrophysical simulations of large supermassive black holes capturing smaller compact objects and has generated numerical data that has been published multiple times in the relevant scientific research literature. The Cell processor version used by the PlayStation 3 has a main CPU and 6 SPEs available to the user, giving the Gravity Grid machine a net of 16 general-purpose processors and 96 vector processors. The machine has a one-time cost of $9,000 to build and is adequate for black-hole simulations which would otherwise cost $6,000 per run on a conventional supercomputer. The black hole calculations are not memory-intensive and are highly localizable, and so are well-suited to this architecture. Khanna claims that the cluster's performance exceeds that of a 100+ Intel Xeon core based traditional Linux cluster on his simulations. The PS3 Gravity Grid gathered significant media attention through 2007, 2008, 2009, and 2010.
|
wikipedia
|
wiki_10502_chunk_25
|
Encoded Archival Description
|
Citing EAD
There have been some studies about how to cite EAD files with variable granularity. In particular, Buneman and Silvello proposed a rule-based system to automatically create citation snippets to be used as references when citing XML data; a case study is based on EAD. Furthermore, Silvello proposed a framework, which learning from examples, automatically creates references at a different level of coarseness for XML files. This framework has been tested on the Library of Congress collection of EAD files.
|
wikipedia
|
wiki_20594_chunk_4
|
China Economic Databases
|
3. China Economic Books Database
The China Economic Books Database (CEBD) main purpose is to form a comprehensive listing of all books on the topic of China’s economy. The CEBD includes titles from all over the world including both English and Chinese (traditional and simplified) titles. Subjects of the books in the CEBD include China's economic globalization, regional economy, international trade, RMB exchange rate, and domestic economic development, financial market, industry development, commerce, investment, and overall economic policy evaluation and analysis. Every book in the CEBD is listed with relevant search info such as the author/editor’s name(s), publisher, publication date, ISBN, key word(s), and classification. A full listing of the CEBD data sources can be found at .
|
wikipedia
|
wiki_23567_chunk_5
|
Java Class Library
|
JCL Features are accessed through classes provided in packages.
contains fundamental classes and interfaces closely tied to the language and runtime system.
I/O and networking access the platform file system, and more generally networks through the , and packages. For networking, SCTP is available through .
Mathematics package: provides mathematical expressions and evaluation, as well as arbitrary-precision decimal and integer number datatypes.
Collections and Utilities : built-in Collection data structures, and utility classes, for Regular expressions, Concurrency, logging and Data compression.
GUI and 2D Graphics: the AWT package () basic GUI operations and binds to the underlying native system. It also contains the 2D Graphics API. The Swing package () is built on AWT and provides a platform-independent widget toolkit, as well as a Pluggable look and feel. It also deals with editable and non-editable text components.
Sound: interfaces and classes for reading, writing, sequencing, and synthesizing of sound data.
Text: deals with text, dates, numbers and messages.
Image package: and provide APIs to write, read, and modify images.
XML: SAX, DOM, StAX, XSLT transforms, XPath and various APIs for Web services, as SOAP protocol and JAX-WS.
CORBA and RMI APIs, including a built-in ORB
Security is provided by and encryption services are provided by .
Databases: access to SQL databases via
Access to Scripting engines: The package gives access to any conforming Scripting language.
Applets: allows applications to be downloaded over a network and run within a guarded sandbox
Java Beans: provides ways to manipulate reusable components.
Introspection and reflection: java.lang.Class represents a class, but other classes such as Method and Constructor are available in .
|
wikipedia
|
wiki_21775_chunk_2
|
Network for the Promotion of Asian Cinema
|
The NETPAC Award is given at select international film festivals to promote Asian cinema by spotlighting exceptional films and discovering new talents. Among filmmakers who have won this award multiple times are Sri Lanka's Prasanna Vithanage (7 times); China's Wang Xiaoshuai (thrice) and Hao Jie (thrice); the Philippines' Lav Diaz (thrice) and Brillante Mendoza (thrice); Malaysia's Ho Yuhang (thrice); South Korea's Kim Ki-duk (thrice), Jeon Soo-il (twice), and Lee Hae-jun (twice); India's Adoor Gopalakrishnan (twice), Dr. Biju (twice), Shyamaprasad (twice), and P. Sheshadri (twice); Indonesia's Garin Nugroho (twice) and Riri Riza (twice); Iran's Rakhshān Banietemad (twice); Japan's Hiromasa Hirosue (twice) and Sion Sono (twice); Kazakhstan's Adilkhan Yerzhanov (thrice), Serik Aprymov (twice), Rustem Abdrashov (twice), Emir Baigazin (twice), and Nariman Turebayev (twice); Kyrgyzstan's Marat Sarulu (twice); Nepal's Kesang Tseten Lama (twice); Singapore's Boo Junfeng (twice), Royston Tan (twice), and Kan Lume (twice); Taiwan's Doze Niu (twice); and Thailand's Nawapol Thamrongrattanarit (twice).
|
wikipedia
|
wiki_18264_chunk_4
|
MIT Chemistry Department
|
Moungi Bawendi
Stephen L. Buchwald
Jianshu Cao
Sylvia Ceyer
Arup K. Chakraborty
Christopher C. Cummins, Ph.D. 1993
Rick L. Danheiser
John M. Deutch, S.B. 1961, Ph.D. 1966
Mircea Dincă
Catherine L. Drennan
John M. Essigmann, S.M. 1972, Ph.D. 1976
Robert W. Field
Frederick D. Greene
Robert G. Griffin
Mei Hong
Barbara Imperiali
Timothy F. Jamison
Jeremiah Johnson
Daniel S. Kemp
Laura L. Kiessling
Alexander M. Klibanov
Stephen J. Lippard, Ph.D. 1965
Mohammad Movassaghi
Keith A. Nelson
Elizabeth Nolan, Ph.D. 2006
Brad L. Pentelute
Alexander Radosevich
Ronald T. Raines
Gabriela Schlau-Cohen
Richard R. Schrock
Dietmar Seyferth
Alex K. Shalek
Matthew D. Shoulders
Susan Solomon
Jeffrey I. Steinfeld, S.B. 1962
JoAnne Stubbe
Daniel Suess
Yogesh Surendranath, Ph.D. 2011
Timothy M. Swager
Steven R. Tannenbaum, S.B. 1958, Ph.D. 1962
Troy Van Voorhis
Xiao Wang
Alison Wendlandt
Adam Willard
Bin Zhang
|
wikipedia
|
wiki_27471_chunk_2
|
Ornithological Society of New Zealand
|
Aims
The aims of the OSNZ are to:
encourage, organise and promote the study of birds and their habitat use, particularly within the New Zealand region.
foster and support the wider knowledge and enjoyment of birds generally.
promote the recording and wide circulation of the results of bird studies and observations.
produce a journal and other publication containing matters of ornithological interest.
effect co-operation and exchange of information with other organisations with similar aims and objectives.
assist the conservation and management of birds by providing information from which sound management decisions can be derived.
maintain a library of ornithological literature for the use of members and to promote a wider knowledge of birds.
promote the archiving of observations, studies and records of birds, particularly in the New Zealand region.
carry out any other activity which is capable of being conveniently carried out in connection with the above objects, or which directly or indirectly advances those objects or any of them.
|
wikipedia
|
wiki_27777_chunk_21
|
Predicate functor logic
|
From first-order logic to PFL
The following algorithm is adapted from Quine (1976: 300-2). Given a closed formula of first-order logic, first do the following:
Attach a numerical subscript to every predicate letter, stating its degree;
Translate all universal quantifiers into existential quantifiers and negation;
Restate all atomic formulas of the form x=y as Ixy. Now apply the following algorithm to the preceding result: The reverse translation, from PFL to first-order logic, is discussed in Quine (1976: 302-4).
|
wikipedia
|
wiki_33519_chunk_3
|
Fluorous chemistry
|
Through the use of high affinity of fluorous tags (ponytails) for fluorous phases or fluorous-derivatized solid phases allows for near complete recovery of the tagged reagent (i.e., near complete reduction in a chemical waste stream), making the use of fluorous chemistry techniques a popular topic in green chemistry. Partition coefficients
The fluorous character of a molecule can be assessed by its partition coefficient between a perfluorocarbon and a hydrocarbon. In the following table, the data are for perfluoromethylcyclohexane:toluene.
|
wikipedia
|
wiki_28585_chunk_2
|
Struve function
|
Asymptotic forms
For small , the power series expansion is given above. For large , one obtains: where is the Neumann function. Properties
The Struve functions satisfy the following recurrence relations: Relation to other functions
Struve functions of integer order can be expressed in terms of Weber functions and vice versa: if is a non-negative integer then Struve functions of order where is an integer can be expressed in terms of elementary functions. In particular if is a non-negative integer then where the right hand side is a spherical Bessel function.
|
wikipedia
|
wiki_16073_chunk_15
|
George Washington University School of Engineering and Applied Science
|
Computer Science (B.S.)
Technical Tracks:
Computer Security and Information Assurance – for students interested in the design and implementation of secure computing infrastructures.
Artificial Intelligence (AI) – for students interested in artificial intelligence and its applications.
Computational Mathematics and Sciences
Computer Graphics and Digital Media – for students interested in computer graphics, visualization, animation and digital media.
Data Science
Foundations and Theory – for students interested in exploring theory or developing strong foundations, perhaps in preparation for graduate work in Computer Science.
Software engineering and Application Development – for students interested in the software engineering concepts and techniques required for the design and implementation of large software systems and applications.
Systems – for students interested in the software engineering concepts and techniques required for the design and implementation of large software systems and applications.
Individually designed technical track: This track is designed by you with the agreement of your advisor. It will comprise at least three courses, not necessarily with CSci designations, but the content must meet a broad technical requirement that it be closely related to the disciplines of computing.
|
wikipedia
|
wiki_20634_chunk_3
|
Construct (python library)
|
First, the Ethernet header (layer 2):
ethernet = Struct("ethernet_header",
Bytes("destination", 6),
Bytes("source", 6),
Enum(UBInt16("type"),
IPv4=0x0800,
ARP=0x0806,
RARP=0x8035,
X25=0x0805,
IPX=0x8137,
IPv6=0x86DD,
),
)
Next, the IP header (layer 3):
ip = Struct("ip_header",
EmbeddedBitStruct(
Const(Nibble("version"), 4),
Nibble("header_length"),
),
BitStruct("tos",
Bits("precedence", 3),
Flag("minimize_delay"),
Flag("high_throuput"),
Flag("high_reliability"),
Flag("minimize_cost"),
Padding(1),
),
UBInt16("total_length"),
# ...
)
And finally, the TCP header (layer 4):
tcp = Struct("tcp_header",
UBInt16("source"),
UBInt16("destination"),
UBInt32("seq"),
UBInt32("ack"),
# ...
)
Now define the hierarchy of the protocol stack. The following code "binds" each pair of adjacent protocols into a separate unit. Each such unit will "select" the proper next layer based on its contained protocol.
layer4tcp = Struct("layer4",
Embed(tcp),
# ... payload
)
|
wikipedia
|
wiki_18308_chunk_1
|
Mathematical Treatise in Nine Sections
|
This book contains nine chapters:
Da Yan type (Indeterminate equations);
Heaven phenomena
Area of land and field
Surveying
Taxation
Storage of grains
Building construction
Military matters
Price and interest.
Each chapter contains nine problems, a total of 81 problems.
Apart from describing Chinese Remainder Theorem for the first time and providing a constructive proof for it, the text investigated:
Indeterminate equations
"Linglong method" (, roughly "method of harmoniously alternating evolution") for numerical solution of algebraic equations, 570 years before Horner's method
Areas and volumes of geometric objects and
Linear system
|
wikipedia
|
wiki_33770_chunk_0
|
Cristiano Marcello
|
{{Infobox martial artist
| name = Cristiano Marcello
| other_names =
| image =
| image_size = 200px
| alt =
| caption =
| birth_name =
| birth_date =
| birth_place = Rio de Janeiro, Brazil
| death_date =
| death_place =
| death_cause =
| residence = Curitiba, Paraná, Brazil
| nationality = Brazilian
| height =
| weight =
| weight_class = LightweightWelterweight
| reach_in = 72.5
| style =Brazilian Jiu-Jitsu, Muay Thai
| stance =
| fighting_out_of = Curitiba, Brazil
| team = Chute Boxe Academy (1998–2009)Gracie HumaitáTeam Alpha Male (occasionally)CM System (2009–present)
| rank = 4th degree black belt in Brazilian Jiu-Jitsu
| years_active = 1998–2014
| mma_kowin = 2
| mma_subwin = 9
| mma_decwin = 2
| mma_koloss = 3
| mma_subloss =
| mma_decloss = 3
| mma_draw =
| mma_nc =
| trainer = Rickson GracieUrijah FaberRoyler Gracie
| students = Maurício RuaWanderlei SilvaCris CyborgMurilo RuaKazushi SakurabaDaniel AcácioBruno Carvalho-Gomes (CWFC)Bruno Carvalho (Bellator)Mariusz LinkeEvangelista CyborgAssuerio SilvaKevin SouzaMarlon Mathias (EliteXC)Hélio Dipp (Jungle Fight)Jean Silva (PRIDE)Andre AmadeJosé Landi-Jons (Titan Fighting Championships)Marcos Antonio Santana (Shooto)
| url =
| sherdog = 3530
| footnotes =
| updated = May 16, 2013
}}
|
wikipedia
|
wiki_6736_chunk_5
|
List of interactive geometry software
|
GCLC is a dynamic geometry tool for visualizing and teaching geometry, and for producing mathematical illustrations. In GCLC, figures are described rather than drawn. This approach stresses the fact that geometrical constructions are abstract, formal procedures and not figures. A concrete figure can be generated on the basis of the abstract description. There are several output formats, including LaTeX, LaTeX/PStricks, LaTeX/Tikz, SVG and PostScript. There is a built-in geometry theorem prover (based on the area method). GCLC is available for Windows and Linux. WinGCLC is a Windows version of GCLC with a graphical interface that provides a range of additional functionalities. GCLC is open source software (licence CC BY-ND).
|
wikipedia
|
wiki_6856_chunk_10
|
List of minerals recognized by the International Mineralogical Association
|
The name of a new mineral is kept confidential by the IMA until it is approved or until its full description is published, its authors' option (approved decision: 'IMA2009-D'). The IMA uses a code for its own procedures for the supposed new mineral (and so it is a synonym). Ferri-ottoliniite's proposal was assigned code 'IMA2001-067', it was redefined and approved as 'IMA2001-067a' in 2003, for instance (the ottoliniite root name is discredited since 2012).
Current IMA regulations do not allow substances of anthropogenic origin (burning coal mine dumps, coal mine fires, slag, etc.) to be validated as a mineral species. Since 1998, the majority of polymorphs (especially polytypes and polytypoids) are not regarded as separate mineral species anymore.
IMA/CNMNC identifiers are usually written without space, as years don't get meaningful hits on Google search.
"The System of Mineralogy of James Dwight Dana and Edward Salisbury Dana" (8 ed.) was the reference of CNMNC/CNMMN's (IMA) initial work. At the Kobe 2006 general meeting, the IMA council endorsed the creation of an Internet site on minerals ('rruff.info/ima'). So a Master List was needed and the older minerals were reviewed in a document of 130 pages. The final GQN List was published (grandfathered, questionable and published without approval) after a final review of Burke E A J and Nickel E H (approved decision: 'IMA2006-C'). Not only the well established minerals before 1959 was grandfathered (G), but the minerals that could not be discredited as well. The merging of the 'ARD List' (approved, revalidated and discredited) with the 'GQN List' resulted in the first 'IMA/CNMNC List of Mineral Names'. The 2007 draft of the 'IMA/CNMNC List of Mineral Names' was a courtesy of the Materials Data, Inc. (MDI), its 2009 review had important modifications. The RRUFF database was built with the help of the MDI's 2007 draft, the IMA Master List is an update of the MDI's 2009 review. Some grandfathered minerals had their status changed to approved afterwards, based on IMA approved reports. Note: the list of approved minerals was revised with 'The New IMA List of Minerals (September 2012)'.
The IMA was founded in a meeting in Madrid (1958). The CNMMN (now CNMNC) was one of the original eight commissions, it was founded in 1959. Not all grandfathered mineral were first described prior to 1959. Hatrurite, a phase in cement clinker (alite, C3S), was first described in 1977, for instance.
Some mineral names were revised; this changed their first letters. Sodium-pharmacosiderite is now natropharmacosiderite, natroapophyllite is now fluorapophyllite-(Na), for instance. But 2010, hydroxylapatite, fluorapatite, fluorellestadite and chlorapatite had their old names reinstated.
Everything is slower on earth sciences, geology, mineralogy:
Georgius Agricola's De re metallica libri xii though apparently finished in 1550, was published 1556 (the author died 1555).
Some IMA/CNMNC (1959–2000) approved minerals had their complete description published only 2012: 'IMA1998-018' (fluornatromicrolite, published 2011), 'IMA1987-046a' (ferrolaueite, published 2012), 'IMA1978-064' (approval probably based on fake data), 'IMA1977-006' (whelanite, published 2012) and 'IMA1968-003' (discredited, 'IMA2008-B'). 'IMA1995-025' was listed as well, a mistake (natroglaucocerinite, published 1995).
The paper of Armbruster et al. (2006) misunderstood the naming rules and renamed a well established mineral name (hancockite). Hatert et al. (2013) modified the naming rules. and proposal IMA2015 s.p. was accepted, reverting the renaming.
Sample: bergenite was discredited as a barium bearing mineral variety of phosphuranylite (IMA1962 s.p., special procedure). So phosphuranylite was already a valid mineral, and it is listed in the Michael Fleischer's mineral list (1966). Both are listed as grandfathered minerals as they are not listed in the 'ARD List' (approved, revalidated and discredited minerals; 2004).
The review and approval of new mineral is straight forward most of the time, but there are exceptions. Proposal IMA2009-096 was not accepted, proposal IMA2009-096a was approved as fontarnauite (6.DA.60) in 2014. Proposal IMA1995-020 was not accepted, proposal IMA1995-020c was approved as jarandolite (6.CB.25).
Every year some valid names get discredited (in the broader sense).
Tohdite (hydrous alumina) was conditionally approved as 'IMA2004-051'. But the re-examination of the holotype material of akdalaite ((Al2O3)5·H2O, 'IMA1969-002') from the Fersman Mineralogical Museum in Moscow showed that both minerals were identical (space group was corrected).
Tellurocanfieldite was conditionally approved as 'IMA2012-013'. Its approval was withdrawn as further studies showed it to be a Te-rich variety of canfieldite (Y: 1894, 2.BA.70).
Some old minerals were known before their 20th century names were first published.
|
wikipedia
|
wiki_9435_chunk_12
|
Computerized physician order entry
|
Implementation
CPOE systems can take years to install and configure. Despite ample evidence of the potential to reduce medication errors, adoption of this technology by doctors and hospitals in the United States has been slowed by resistance to changes in physician's practice patterns, costs and training time involved, and concern with interoperability and compliance with future national standards. According to a study by RAND Health, the US healthcare system could save more than 81 billion dollars annually, reduce adverse medical events and improve the quality of care if it were to widely adopt CPOE and other health information technology. As more hospitals become aware of the financial benefits of CPOE, and more physicians with a familiarity with computers enter practice, increased use of CPOE is predicted. Several high-profile failures of CPOE implementation have occurred, so a major effort must be focused on change management, including restructuring workflows, dealing with physicians' resistance to change, and creating a collaborative environment.
|
wikipedia
|
wiki_3114_chunk_3
|
Dominator (graph theory)
|
Applications
Dominators, and dominance frontiers particularly, have applications in compilers for computing static single assignment form. A number of compiler optimizations can also benefit from dominators. The flow graph in this case comprises basic blocks. Automatic parallelization benefits from postdominance frontiers. This is an efficient method of computing control dependence, which is critical to the analysis. Memory usage analysis can benefit from the dominator tree to easily find leaks and identify high memory usage.
|
wikipedia
|
wiki_19904_chunk_8
|
Paleontological Research Institution
|
Research
Research has been one of the core functions of the institution since its founding in 1932. Much of the current research done at PRI focuses on fossils and Recent mollusks of the Western hemisphere, in addition to Devonian marine invertebrates and Pleistocene mastodons of New York State. Ongoing projects at PRI include Bivalve Assembling the Tree of Life (BivAToL), a venture to reconstruct the evolutionary origins of bivalve mollusks; the Conservation Paleobiology Workshop; the Mastodon Matrix Project, an effort to sift through the matrix recovered from around the Hyde Park Mastodon; and the Minute 319 Project, which uses samples of baseline benthic Mollusk communities to evaluate the impact of engineered pulse flows in the Colorado River.
|
wikipedia
|
wiki_10803_chunk_5
|
MathSciNet
|
In addition, reviews or bibliographical information on selected articles is included from many engineering, computer science and other applied journals abstracted by MathSciNet. The selection is done by the editors of Mathematical Reviews. The editors accept suggestions to cover additional journals, but do not reconsider missing articles for inclusion. See also
All-Russian Mathematical Portal
Zentralblatt MATH
List of academic databases and search engines References External links Official website Bibliographic databases and indexes
Mathematical databases
Bibliographic databases in computer science
Publications established in 1980
Scholarly search services
|
wikipedia
|
wiki_20076_chunk_2
|
National Center for Engineering and Technology Education
|
References
https://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0426421 National Science Foundation Grant 0426421
http://www.ncete.org/ National Center for Engineering and Technology Education
https://www.nsf.gov/awardsearch/showAward?AWD_ID=0426421
https://eric.ed.gov/?id=ED537364 https://ieeexplore.ieee.org/document/1408718 External links
|
wikipedia
|
wiki_377_chunk_24
|
Mainframe computer
|
In 2007, an amalgamation of the different technologies and architectures for supercomputers and mainframes has led to a so-called gameframe. See also
Channel I/O
Cloud computing
Computer types
Failover
Gameframe
List of transistorized computers
Commodity computing Notes References External links IBM Systems Mainframe Magazine
IBM z Systems mainframes
IBM Mainframe Computer Support Forum since 2003
Univac 9400, a mainframe from the 1960s, still in use in a German computer museum
Lectures in the History of Computing: Mainframes (archived copy from the Internet Archive)
|
wikipedia
|
wiki_2503_chunk_22
|
Computational fluid dynamics
|
where is the equation residual at an element vertex , is the conservation equation expressed on an element basis, is the weight factor, and is the volume of the element. Finite difference method The finite difference method (FDM) has historical importance and is simple to program. It is currently only used in few specialized codes, which handle complex geometry with high accuracy and efficiency by using embedded boundaries or overlapping grids (with the solution interpolated across each grid). where is the vector of conserved variables, and , , and are the fluxes in the , , and directions respectively. Spectral element method
|
wikipedia
|
wiki_473_chunk_17
|
P-code machine
|
var
p, b, t: integer; {program-, base-, topstack-registers}
i: instruction; {instruction register}
s: array [1..stacksize] of integer; {datastore} function base(l: integer): integer;
var b1: integer;
begin
b1 := b; {find base l levels down}
while l > 0 do begin
b1 := s[b1];
l := l - 1
end;
base := b1
end {base};
|
wikipedia
|
wiki_547_chunk_48
|
Scheme (programming language)
|
In R5RS, a suggested implementation of delay and force is given, implementing the promise as a procedure with no arguments (a thunk) and using memoization to ensure that it is only ever evaluated once, irrespective of the number of times force is called (R5RS sec. 6.4). SRFI 41 enables the expression of both finite and infinite sequences with extraordinary economy. For example, this is a definition of the fibonacci sequence using the functions defined in SRFI 41:
|
wikipedia
|
wiki_5189_chunk_4
|
United States Senate Committee on Energy and Natural Resources
|
Jurisdiction
In accordance of Rule XXV of the United States Senate, all proposed legislation, messages, petitions, memorials, and other matters relating to the following subjects is referred to the Senate Committee on Energy and Natural Resources:
Coal production, distribution, and utilization;
Energy policy;
Energy regulation and conservation;
Energy related aspects of deepwater ports;
Energy research and development;
Extraction of minerals from oceans and Outer Continental Shelf lands;
Hydroelectric power, irrigation, and reclamation;
Mining education and research;
Mining, mineral lands, mining claims, and mineral conservation;
National parks, recreation areas, wilderness areas, wild and scenic rivers, historical sites, military parks and battlefields, and on the public domain, preservation of prehistoric ruins and objects of interest;
Naval petroleum reserves in Alaska;
Nonmilitary development of nuclear energy;
Oil and gas production and distribution;
Public lands and forests, including farming and grazing thereon, and mineral extraction therefrom;
Solar energy systems; and,
Territorial possessions of the United States, including trusteeships.
The Committee is also charged to "study and review, on a comprehensive basis, matters relating to energy and resources development, and report thereon from time to time."
|
wikipedia
|
wiki_1195_chunk_95
|
Zero-point energy
|
One may query what this has to do with zero-point energy. Given the complex and adaptive behaviour that arises from nonlinear systems considerable attention in recent years has gone into studying a new class of phase transitions which occur at absolute zero temperature. These are quantum phase transitions which are driven by EM field fluctuations as a consequence of zero-point energy. A good example of a spontaneous phase transition that are attributed to zero-point fluctuations can be found in superconductors. Superconductivity is one of the best known empirically quantified macroscopic electromagnetic phenomena whose basis is recognised to be quantum mechanical in origin. The behaviour of the electric and magnetic fields under superconductivity is governed by the London equations. However, it has been questioned in a series of journal articles whether the quantum mechanically canonised London equations can be given a purely classical derivation. Bostick, for instance, has claimed to show that the London equations do indeed have a classical origin that applies to superconductors and to some collisionless plasmas as well. In particular it has been asserted that the Beltrami vortices in the plasma focus display the same paired flux-tube morphology as Type II superconductors. Others have also pointed out this connection, Fröhlich has shown that the hydrodynamic equations of compressible fluids, together with the London equations, lead to a macroscopic parameter ( = electric charge density / mass density), without involving either quantum phase factors or Planck's constant. In essence, it has been asserted that Beltrami plasma vortex structures are able to at least simulate the morphology of Type I and Type II superconductors. This occurs because the "organised" dissipative energy of the vortex configuration comprising the ions and electrons far exceeds the "disorganised" dissipative random thermal energy. The transition from disorganised fluctuations to organised helical structures is a phase transition involving a change in the condensate's energy (i.e. the ground state or zero-point energy) but without any associated rise in temperature. This is an example of zero-point energy having multiple stable states (see Quantum phase transition, Quantum critical point, Topological degeneracy, Topological order) and where the overall system structure is independent of a reductionist or deterministic view, that "classical" macroscopic order can also causally affect quantum phenomena. Furthermore, the pair production of Beltrami vortices has been compared to the morphology of pair production of virtual particles in the vacuum.
|
wikipedia
|
wiki_12049_chunk_9
|
List of complex and algebraic surfaces
|
Surfaces that are also Shimura varieties:
Hilbert modular surfaces
Humbert surfaces
Picard modular surfaces
Shioda modular surfaces
Elliptic surfaces, surfaces with an elliptic fibration; quasielliptic surfaces constitute a modification this idea that occurs in finite characteristic
Raynaud surfaces and generalized Raynaud surfaces, certain quasielliptic counterexamples to the conclusions of the Kodaira vanishing theorem
Exceptional surfaces, surfaces whose Picard number achieve the bound set by the central Hodge number h1,1
Kähler surfaces, complex surfaces with a Kähler metric; equivalently, surfaces for which the first Betti number b1 is even
Minimal surfaces, surfaces that can't be obtained from another by blowing up at a point; they have no connection with the minimal surfaces of differential geometry
Nodal surfaces, surfaces whose only singularities are nodes
Cayley's nodal cubic, which has 4 nodes
Kummer surfaces, quartic surfaces with 16 nodes
Togliatti surface, a certain quintic with 31 nodes
Barth surfaces, referring to a certain sextic with 65 nodes and decic with 345 nodes
Labs surface, a certain septic with 99 nodes
Endrass surface, a certain surface of degree 8 with 168 nodes
Sarti surface, a certain surface of degree 12 with 600 nodes
Quotient surfaces, surfaces that are constructed as the orbit space of some other surface by the action of a finite group; examples include Kummer, Godeaux, Hopf, and Inoue surfaces
Zariski surfaces, surfaces in finite characteristic that admit a purely inseparable dominant rational map from the projective plane
|
wikipedia
|
wiki_205_chunk_11
|
Eiffel (programming language)
|
Eiffel Software, "The Eiffel Compiler" tecomp and Eiffel-library-developer Gobo have committed to implementing the standard; Eiffel Software's EiffelStudio 6.1 and "The Eiffel Compiler" tecomp implement some of the major new mechanisms—in particular, inline agents, assigner commands, bracket notation, non-conforming inheritance, and attached types. The SmartEiffel team has turned away from this standard to create its own version of the language, which they believe to be closer to the original style of Eiffel. Object Tools has not disclosed whether future versions of its Eiffel compiler will comply with the standard. LibertyEiffel implements a dialect somewhere in between the SmartEiffel language and the standard.
|
wikipedia
|
wiki_22309_chunk_12
|
Compiler Description Language
|
CDL2, which appeared in 1976, kept the principles of CDL1 but made the language suitable for large projects. It introduced modules, enforced data-change-only-on-success, and extended the capabilities of the language somewhat. The optimizers in the CDL2 compiler and especially in the CDL2 Laboratory (an IDE for CDL2) were world-class and not just for their time. One feature of the CDL2 Laboratory optimizer is almost unique: it can perform optimizations across compilation units, i.e., treating the entire program as a single compilation.
|
wikipedia
|
wiki_16523_chunk_10
|
Analogical modeling
|
Variable 1: 0,1,2,3
Variable 2: 0,1,2,3
Variable 3: 0,1,2,3
The two outcomes for the dataset are e and r, and the exemplars are: 3 1 0 e
0 3 2 r
2 1 0 r
2 1 2 r
3 1 1 r We define a network of pointers like so: The solid lines represent pointers between exemplars with matching outcomes; the dotted lines represent pointers between exemplars with non-matching outcomes. The statistics for this example are as follows:
|
wikipedia
|
wiki_24497_chunk_3
|
List of problems in loop theory and quasigroup theory
|
Minimal presentations for loops M(G,2)
For a group , define on x by
, , , . Find a minimal presentation for the Moufang loop with respect to a presentation for .
Proposed: by Petr Vojtěchovský at Loops '03, Prague 2003
Comments: Chein showed in (Chein, 1974) that is a Moufang loop that is nonassociative if and only if is nonabelian. Vojtěchovský (Vojtěchovský, 2003) found a minimal presentation for when is a 2-generated group.
|
wikipedia
|
wiki_37318_chunk_34
|
Extremal principles in non-equilibrium thermodynamics
|
Prospects
Until recently, prospects for useful extremal principles in this area have seemed clouded. C. Nicolis (1999) concludes that one model of atmospheric dynamics has an attractor which is not a regime of maximum or minimum dissipation; she says this seems to rule out the existence of a global organizing principle, and comments that this is to some extent disappointing; she also points to the difficulty of finding a thermodynamically consistent form of entropy production. Another top expert offers an extensive discussion of the possibilities for principles of extrema of entropy production and of dissipation of energy: Chapter 12 of Grandy (2008) is very cautious, and finds difficulty in defining the 'rate of internal entropy production' in many cases, and finds that sometimes for the prediction of the course of a process, an extremum of the quantity called the rate of dissipation of energy may be more useful than that of the rate of entropy production; this quantity appeared in Onsager's 1931 origination of this subject. Other writers have also felt that prospects for general global extremal principles are clouded. Such writers include Glansdorff and Prigogine (1971), Lebon, Jou and Casas-Vásquez (2008), and Šilhavý (1997). It has been shown that heat convection does not obey extremal principles for entropy production and chemical reactions do not obey extremal principles for the secondary differential of entropy production, hence the development of a general extremal principle seems infeasible.
|
wikipedia
|
wiki_22268_chunk_5
|
Research question
|
According to Farrugia et al., the FINER criteria "highlight useful points that may increase the chances of developing a successful research project". These criteria were first suggested in the book Designing Clinical Research by Hulley et al., detailed below.F – Feasible Adequate number of subjects
Adequate technical expertise
Affordable in time and money
Manageable in scope I – Interesting Getting the answer intrigues investigator, peers and community N – Novel Confirms, refutes or extends previous findings E – Ethical Amenable to a study that institutional review board will approve R – Relevant To scientific knowledge
To clinical and health policy
To future research
|
wikipedia
|
wiki_33313_chunk_2
|
University of Kyiv Faculty of Radio Physics, Electronics and Computer Systems
|
Scientific research
The present-day major areas of research are physical electronics, radiophysics, micro-, nano- and quantum electronics, low-temperature plasma physics, semiconductor electronics, medical radiophysics.
Students are widely involved into scientific research and exploration. This is a characteristic feature of the faculty that corresponds to the Bologna Process requirements.
Faculty of radiophysics has established tight relations with scientific and educational centers abroad: United States, France (École centrale de Lyon, Institut polytechnique de Lyon), Taiwan, Germany, the Netherlands, Great Britain, China and others. The teachers, postgraduates and students are involved into international programmes that provide an opportunity to travel abroad and participate in study or research exchange projects.
Explorations are carried out within programmes that include:
nanoelectronics
plasmochemistry
low-temperature plasma
cryogenics
generation-recombination processes in the highly dopped and graded band-gap semiconductors
physical properties of the metal–semiconductor contact
laser spectroscopy
physical processes in the fiber optics flow lines
spin wave electrodynamics and electronics
new radiophysical methods' development for the diagnostics and treatment
|
wikipedia
|
wiki_105_chunk_40
|
Colossus computer
|
Early computer development
The National Museum of Computing (TNMOC)
TNMOC: The 75th anniversary of the first attack
Tony Sale's Codes and Ciphers Contains a great deal of information, including:
Colossus, the revolution in code breaking
Lorenz Cipher and the Colossus
The machine age comes to Fish codebreaking
The Colossus Rebuild Project
The Colossus Rebuild Project: Evolving to the Colossus Mk 2
Walk around Colossus A detailed tour of the replica Colossus – make sure to click on the "More Text" links on each image to see the informative detailed text about that part of Colossus
IEEE lecture – Transcript of a lecture Tony Sale gave describing the reconstruction project
BBC news article reporting on the replica Colossus
BBC news article: "Colossus cracks codes once more"
BBC news article: BBC news article: "Bletchley's code-cracking Colossus" with video interviews 2010-02-02
Website on Copeland's 2006 book with much information and links to recently declassified information
Was the Manchester Baby conceived at Bletchley Park?
online virtual simulation of Colossus
|
wikipedia
|
wiki_18639_chunk_10
|
Math Blaster Episode I: In Search of Spot
|
Addition
Subtraction
Multiplication
Division
Number patterns - Instead of featuring traditional equations, "number patterns" provides the user with a series of numbers with one of the numbers missing. The user must identify the pattern to find the missing number (for example, if the problem presented is "5, 10, 15, _, 25," then the missing number is 20.)
Estimation - The user must round numbers to estimate the answer.
Fractions/decimals/percents - The user must solve problems that involve fractions, decimals and percentages.
Review - features a mix of problems from all the various subjects
|
wikipedia
|
wiki_24497_chunk_34
|
List of problems in loop theory and quasigroup theory
|
Proposed: by Orin Chein at Loops '99, Prague 1999
Solved by: Alexander Grishkov and Andrei Zavarnitsine, 2003
Solution: Every finite Moufang loop has the strong Lagrange property (SLP). Here is an outline of the proof:
According to (Chein et al. 2003), it suffices to show SLP for nonassociative finite simple Moufang loops (NFSML).
It thus suffices to show that the order of a maximal subloop of an NFSML L divides the order of L.
A countable class of NFSMLs was discovered in (Paige 1956), and no other NSFMLs exist by (Liebeck 1987).
Grishkov and Zavarnitsine matched maximal subloops of loops with certain subgroups of groups with triality in (Grishkov and Zavarnitsine, 2003).
|
wikipedia
|
wiki_3646_chunk_4
|
Astrophysics Data System
|
The first suggestion of a database of journal paper abstracts was made at a conference on Astronomy from Large Data-bases held in Garching bei München in 1987. Initial development of an electronic system for accessing astrophysical abstracts took place during the following two years; in 1991 discussions took place on how to integrate ADS with the SIMBAD database, containing all available catalog designations for objects outside the Solar System, to create a system where astronomers could search for all the papers written about a given object.
|
wikipedia
|
wiki_600_chunk_7
|
The Art of Computer Programming
|
Knuth's dedication reads: This series of books is affectionately dedicatedto the Type 650 computer once installed atCase Institute of Technology,with whom I have spent many pleasant evenings. Assembly language in the book
All examples in the books use a language called "MIX assembly language", which runs on the hypothetical MIX computer. Currently, the MIX computer is being replaced by the MMIX computer, which is a RISC version. Software such as GNU MDK exists to provide emulation of the MIX architecture. Knuth considers the use of assembly language necessary for the speed and memory usage of algorithms to be judged.
|
wikipedia
|
wiki_11615_chunk_47
|
Mathematics of Sudoku
|
A variant on Miyuki Misawa's web site replaces sums with relations: the clues are symbols =, < and > showing the relative values of (some but not all) adjacent region sums. She demonstrates an example with only eight relations. It is not known whether this is the best possible. Maximum number of givens
|
wikipedia
|
wiki_31186_chunk_3
|
Computer cluster
|
Basic concepts The desire to get more computing power and better reliability by orchestrating a number of low-cost commercial off-the-shelf computers has given rise to a variety of architectures and configurations.
|
wikipedia
|
wiki_27510_chunk_3
|
List of fictional artificial intelligences
|
2000s
The Oracle, Seraph, Merovingian, Persephone, and the Architect from The Matrix Reloaded. The Agent programs are upgraded. The new Agents included Jackson, Johnson, and Thompson. Agent Smith is now a computer virus with the ability to copy himself using humans and programs. (2003)
The Oracle, Seraph, Sati, Rama Kandra, Kamala, Merovigian, Persephone, Architect, and Smith from The Matrix Revolutions. (2003)
J.A.R.V.I.S. from the Iron Man, Iron Man 2, The Avengers, Iron Man 3, and Avengers: Age of Ultron.
F.R.I.D.A.Y., replacement A.I. for Tony Stark / Iron Man, after J.A.R.V.I.S. is destroyed by Ultron, from the Avengers: Age of Ultron, Captain America: Civil War,, Spider-Man: Homecoming, Avengers: Infinity War and Avengers: Endgame.
|
wikipedia
|
wiki_1466_chunk_25
|
One-instruction set computer
|
subneg4
A variant is also possible with four operands – subneg4. The reversal of minuend and subtrahend eases implementation in hardware. The non-destructive result simplifies the synthetic instructions. Instruction subneg s, m, r, j
(* subtrahend, minuend, result and jump addresses *)
Mem[r] = Mem[m] - Mem[s]
if (Mem[r] < 0)
goto j
|
wikipedia
|
wiki_7035_chunk_7
|
National Council of Examiners for Engineering and Surveying
|
See also
Engineering
Graduate Aptitude Test in Engineering (GATE)
Glossary of engineering
Glossary of civil engineering
Glossary of electrical and electronics engineering
Glossary of mechanical engineering
Glossary of structural engineering
Glossary of biology
Glossary of chemistry
Glossary of economics
Glossary of physics
Glossary of probability and statistics
Washington Accord
Sydney Accord
Dublin Accord
Regulation and licensure in engineering
Accreditation Board for Engineering and Technology (ABET) References External links Professional certification in engineering
American engineering organizations
Organizations based in South Carolina
Organizations established in 1920
Surveying organizations
Geographic data and information organizations in the United States
|
wikipedia
|
wiki_1980_chunk_3
|
Sequent Computer Systems
|
Vestiges of Sequent's innovations live on in the form of data clustering software from PolyServe (subsequently acquired by HP), various projects within OSDL, IBM contributions to the Linux kernel, and claims in the SCO v. IBM lawsuit. History
|
wikipedia
|
wiki_25514_chunk_6
|
Quantum nondemolition measurement
|
Discussion An observable which is conserved under free evolution, is automatically a QND variable. A sequence of ideal projective measurements of will automatically be QND measurements. To implement QND measurements on atomic systems, the measurement strength (rate) is competing with atomic decay caused by measurement backaction. People usually use optical depth or cooperativity to characterize the relative ratio between measurement strength and the optical decay. By using nanophotonic waveguides as a quantum interface, it is actually possible to enhance atom-light coupling with a relatively weak field, and hence an enhanced precise quantum measurement with little disruption to the quantum system.
|
wikipedia
|
wiki_23474_chunk_9
|
Search-based software engineering
|
Optimizing software
The use of SBSE in program optimization, or modifying a piece of software to make it more efficient in terms of speed and resource use, has been the object of successful research. In one instance, a 50,000 line program was genetically improved, resulting in a program 70 times faster on average.
A recent work by Basios et al. shows that by optimising the data structure, Google Guava found 9% improvement on execution time, 13% improvement on memory consumption and 4% improvement on CPU usage separately.
|
wikipedia
|
wiki_26622_chunk_1
|
Materials Simulation Laboratory
|
Structural, mechanical, electronic, and transport properties of advanced materials such as diamond, silicon, organic thin films and single molecules, metal/oxide and metal/organic interfaces, and energetic molecular crystals are of particular interest. All the problems addressed have a tight connection with experimental work being performed by MSL collaborators around the world. Although the dynamical interplay between experiment and theory is the key to success in developing an understanding of the fundamental physics and chemistry of materials, the goal is to use the powerful arsenal of atomic-scale modeling and analytic techniques to attack the problems that are difficult or impossible to study by experiment. For example, the behavior of matter at extreme conditions such as shock compression of materials is studied by molecular dynamics which allows us to investigate the phenomena at sub-nanometer length and sub-picosecond time scales. These time and length scales can not be experimentally studied at the same level of detail as done by theory/modeling. Research projects are currently conducted within the following key areas:
|
wikipedia
|
wiki_11884_chunk_2
|
Zeta function regularization
|
showed that in flat space, in which the eigenvalues of Laplacians are known, the zeta function corresponding to the partition function can be computed explicitly. Consider a scalar field φ contained in a large box of volume V in flat spacetime at the temperature T = β−1. The partition function is defined by a path integral over all fields φ on the Euclidean space obtained by putting τ = it which are zero on the walls of the box and which are periodic in τ with period β. In this situation from the partition function he computes energy, entropy and pressure of the radiation of the field φ. In case of flat spaces the eigenvalues appearing in the physical quantities are generally known, while in case of curved space they are not known: in this case asymptotic methods are needed.
|
wikipedia
|
wiki_2488_chunk_22
|
Quintic function
|
Application to celestial mechanics
Solving for the locations of the Lagrangian points of an astronomical orbit in which the masses of both objects are non-negligible involves solving a quintic. More precisely, the locations of L2 and L1 are the solutions to the following equations, where the gravitational forces of two masses on a third (for example, Sun and Earth on satellites such as Gaia and the James Webb Space Telescope at L2 and SOHO at L1) provide the satellite's centripetal force necessary to be in a synchronous orbit with Earth around the Sun:
|
wikipedia
|
wiki_4013_chunk_16
|
Approximation algorithm
|
Epsilon terms
In the literature, an approximation ratio for a maximization (minimization) problem of c - ϵ (min: c + ϵ) means that the algorithm has an approximation ratio of c ∓ ϵ for arbitrary ϵ > 0 but that the ratio has not (or cannot) be shown for ϵ = 0. An example of this is the optimal inapproximability — inexistence of approximation — ratio of 7 / 8 + ϵ for satisfiable MAX-3SAT instances due to Johan Håstad. As mentioned previously, when c = 1, the problem is said to have a polynomial-time approximation scheme.
|
wikipedia
|
wiki_30333_chunk_0
|
Cyclic (mathematics)
|
There are many terms in mathematics that begin with cyclic:
Cyclic chain rule, for derivatives, used in thermodynamics
Cyclic code, linear codes closed under cyclic permutations
Cyclic convolution, a method of combining periodic functions
Cycle decomposition (graph theory)
Cycle decomposition (group theory)
Cyclic extension, a field extension with cyclic Galois group
Graph theory:
Cycle graph, a connected, 2-regular graph
Cycle graph (algebra), a diagram representing the cycles determined by taking powers of group elements
Circulant graph, a graph with cyclic symmetry
Cycle (graph theory), a nontrivial path in some graph from a node to itself
Cyclic graph, a graph containing at least one graph cycle
Cyclic group, a group generated by a single element
Cyclic homology, an approximation of K-theory used in non-commutative differential geometry
Cyclic module, a module generated by a single element
Cyclic notation, a way of writing permutations
Cyclic number, a number such that cyclic permutations of the digits are successive multiples of the number
Cyclic order, a ternary relation defining a way to arrange a set of objects in a circle
Cyclic permutation, a permutation with one nontrivial orbit
Cyclic polygon, a polygon which can be given a circumscribed circle
Cyclic shift, also known as circular shift
Cyclic symmetry, n-fold rotational symmetry of 3-dimensional space
|
wikipedia
|
wiki_1224_chunk_13
|
Greedy algorithm
|
Examples
The activity selection problem is characteristic of this class of problems, where the goal is to pick the maximum number of activities that do not clash with each other.
In the Macintosh computer game Crystal Quest the objective is to collect crystals, in a fashion similar to the travelling salesman problem. The game has a demo mode, where the game uses a greedy algorithm to go to every crystal. The artificial intelligence does not account for obstacles, so the demo mode often ends quickly.
The matching pursuit is an example of a greedy algorithm applied on signal approximation.
A greedy algorithm finds the optimal solution to Malfatti's problem of finding three disjoint circles within a given triangle that maximize the total area of the circles; it is conjectured that the same greedy algorithm is optimal for any number of circles.
A greedy algorithm is used to construct a Huffman tree during Huffman coding where it finds an optimal solution.
In decision tree learning, greedy algorithms are commonly used, however they are not guaranteed to find the optimal solution.
One popular such algorithm is the ID3 algorithm for decision tree construction.
Dijkstra's algorithm and the related A* search algorithm are verifiably optimal greedy algorithms for graph search and shortest path finding.
A* search is conditionally optimal, requiring an "admissible heuristic" that will not overestimate path costs.
Kruskal's algorithm and Prim's algorithm are greedy algorithms for constructing minimum spanning trees of a given connected graph. They always find an optimal solution, which may not be unique in general.
|
wikipedia
|
wiki_6337_chunk_8
|
Z4 (computer)
|
Specifications
Frequency: (about) 40 hertz
Average calculation speed: 400 ms for an addition, 3 seconds for a multiplication. Approximately 1000 floating point arithmetic operations on average an hour.
Programming: holes in 35 mm film stock, punched on a programming machine
Input: Decimal floating point numbers, punch tape
Output: Decimal floating point numbers, punch tape or Mercedes typewriter
Word length: 32 bits floating point
Elements: (about) 2,500 relays, 21 step-wise relays
Memory: Mechanical memory from the Z1 and Z2 (64 words, 32 bit)
Power consumption: (about) 4 kW
|
wikipedia
|
wiki_9906_chunk_19
|
History of fluid mechanics
|
Daniel Bernoulli
In 1738 Daniel Bernoulli published his Hydrodynamica seu de viribus et motibus fluidorum commentarii. His theory of the motion of fluids, the germ of which was first published in his memoir entitled Theoria nova de motu aquarum per canales quocunque fluentes, communicated to the academy of St Petersburg as early as 1726, was founded on two suppositions, which appeared to him conformable to experience. He supposed that the surface of the fluid, contained in a vessel which is emptying itself by an orifice, remains always horizontal; and, if the fluid mass is conceived to be divided into an infinite number of horizontal strata of the same bulk, that these strata remain contiguous to each other, and that all their points descend vertically, with velocities inversely proportional to their breadth, or to the horizontal sections of the reservoir. In order to determine the motion of each stratum, he employed the principle of the conservatio virium vivarum, and obtained very elegant solutions. But in the absence of a general demonstration of that principle, his results did not command the confidence which they would otherwise have deserved, and it became desirable to have a theory more certain, and depending solely on the fundamental laws of mechanics. Colin Maclaurin and John Bernoulli, who were of this opinion, resolved the problem by more direct methods, the one in his Fluxions, published in 1742, and the other in his Hydraulica nunc primum detecta, et demonstrata directe ex fundamentis pure mechanicis, which forms the fourth volume of his works. The method employed by Maclaurin has been thought not sufficiently rigorous; and that of John Bernoulli is, in the opinion of Lagrange, defective in clearness and precision.
|
wikipedia
|
wiki_11435_chunk_2
|
Computer-assisted orthopedic surgery
|
Procedural Approaches
CAOS does not substantially deviate from traditional surgical procedures, because the intended goal is to improve the overall operative outcome of the surgery. In image-based procedures, the patient still undergoes similar pre-operative screenings (consultations, scans, etc.). However, CAOS allows the surgeon to also create a "patient jig", which is a 3-D printed model of the skeletal structure of interest that aids the surgeon in the pre-operative planning stage. There are a variety of CAOS procedures depending on the system and navigation preferences. CAOS is initially divided into two categories: an active system, in which the entire procedure can be completed by a robot with little or no help necessary from the surgeon; and a passive system, in which a robot or computerized program aids the surgeon in completing the procedure. Regardless of a passive or active system, CAOS requires a mode of navigation to accurately carry out procedures. There are three methods of navigation used to carry out the surgery.
CT-Based: utilizes CT imaging to construct a 3-D* model of the patient's anatomy to guide the surgeon either: through a step-by-step walk through of the procedure; or providing real-time feedback of the operation to the surgeon. Both methods allow the surgeon to easier visualize anatomical landmarks, thus increasing both precision and accuracy of prosthetic implants.
Fluoroscopy-Based: allows the surgeon to take multiple fluoroscopic images (at different angles) of the surgical site, which provides landmarks for instrument and prosthetic placement. Fluoroscopic imaging can be either 2-D or 3-D*, and is static - it does not provide video-like feedback to the surgeon due to its nature of using still images taken during the procedure, but it significantly reduces radiation exposure to the patient.
Imageless: involves the computer constructing a digitized anatomical model of the area of interest by referencing the results of the patient's Orthopedic tests, such as joint rotation angles, flexion/extension angles, etc. Although a digital image is constructed by the computer, there are no image-taking processes in both the pre-operative and intra-operative stages thereby eliminating radiation exposure, and reducing operation time.
*The 3-D images are created when the computer interacts with body parts via infrared lights and gate detectors.
|
wikipedia
|
wiki_31720_chunk_3
|
Exact statistics
|
The approach
All classical statistical procedures are constructed using statistics which depend only on observable random vectors, whereas generalized estimators, tests, and confidence intervals used in exact statistics take advantage of the observable random vectors and the observed values both, as in the Bayesian approach but without having to treat constant parameters as random variables. For example, in sampling from a normal population with mean and variance , suppose and are the sample mean and the sample variance. Then, defining Z and U thus:
and that
.
Now suppose the parameter of interest is the coefficient of variation, . Then, we can easily perform exact tests and exact confidence intervals for based on the generalized statistic
,
where is the observed value of and is the observed value of . Exact inferences on based on probabilities and expected values of are possible because its distribution and the observed value are both free of nuisance parameters.
|
wikipedia
|
wiki_10409_chunk_2
|
JAL (compiler)
|
Sample code
-- JAL 2.3
include 16f877_bert--define the variables
var byte resist--define the pins
pin_a0_direction = input--variable resistor
pin_d7_direction = input--switch
pin_c2_direction = output--pwm led--enable pulse width modulation
PWM_init_frequency (true, true)
forever loop--convert analog on a0 to digital
resist = ADC_read_low_res(0)
-- run measurement through flash memory
program_eeprom_write(2000,resist)
program_eeprom_read(2000,resist)
-- run measurement through data memory
data_eeprom_write(10,resist)
data_eeprom_read(10,resist)
-- if the switch is pressed return random value
if pin_d7 == high then
resist = random_byte
end if--send resistance to PC
serial_sw_write(resist)
delay_100ms(1)
-- set actual PWM duty cycle
PWM_Set_DutyCycle (resist, resist)
end loop
|
wikipedia
|
wiki_10996_chunk_1
|
Cambridge Computer Lab Ring
|
Hall of Fame
The association claims that, as of January 2018, there are 267 companies created by computer lab graduates and staff. A 'Company of the Year' is chosen from this list annually. 2005 Sophos
2006 Codian
2007 Jagex
2008 Xensource
2009 Linguamatics
2010 Ubisense
2011 RealVNC
2012 Trampoline Systems
2013 Raspberry Pi
2014 DeepMind Technologies
2015 SwiftKey
2016 Unikernel Systems
2017 Improbable References External links
Cambridge Computer Lab Ring
Lambert Review of Business-University Collaboration December 2003 2002 establishments in England
Organizations established in 2002
Computer
University of Cambridge Computer Laboratory
|
wikipedia
|
wiki_11718_chunk_14
|
Integrated circuit design
|
Microarchitecture and system-level design
The initial chip design process begins with system-level design and microarchitecture planning. Within IC design companies, management and often analytics will draft a proposal for a design team to start the design of a new chip to fit into an industry segment. Upper-level designers will meet at this stage to decide how the chip will operate functionally. This step is where an IC's functionality and design are decided. IC designers will map out the functional requirements, verification testbenches, and testing methodologies for the whole project, and will then turn the preliminary design into a system-level specification that can be simulated with simple models using languages like C++ and MATLAB and emulation tools. For pure and new designs, the system design stage is where an Instruction set and operation is planned out, and in most chips existing instruction sets are modified for newer functionality. Design at this stage is often statements such as encodes in the MP3 format or implements IEEE floating-point arithmetic. At later stages in the design process, each of these innocent looking statements expands to hundreds of pages of textual documentation.
|
wikipedia
|
wiki_27817_chunk_0
|
Life Science Library
|
The Life Science Library is a series of hardbound books published by Time Life between 1963 and 1967. Each of the 26 volumes explores a major topic of the natural sciences. They are intended for, and written at a level appropriate to, an educated lay readership. In each volume, the text of each of eight chapters is followed by a "Picture Essay" lavishly illustrating the subject of the preceding chapter. They were available in a monthly subscription from Life magazine. Each volume takes complex scientific concepts and provides explanations that can be easily understood. For example, Albert Einstein's theory of relativity is explained in a cartoon about a spy drama involving a train traveling very close to the speed of light; probability is explained with poker hands; and the periodic table of the elements is conveyed with common household items. Although progress has overtaken much of the material in the more than 50 years since their publication, the series' explanations of basic science and the history of discovery remain valid. The consulting editors of the series are microbiologist René Dubos, physicist Henry Margenau, and physicist and novelist C. P. Snow.
|
wikipedia
|
wiki_33874_chunk_6
|
National Center for Computational Sciences
|
Intel Paragon XP/S 5 (1992): The Intel Paragon XP/S 5 provided 128 GP compute nodes arranged in a 16 row by 8 column rectangular mesh consisting of one 8 by 8 group of 16MB nodes and one 8 by 8 group of 32MB nodes. Also available were four 128MB MP compute nodes in a 2 row by 2 column mesh. In addition, there was the128 MB MP boot node, four 32MB GP service nodes and six I/O nodes, five of which were connected to 4.8 GB RAID disks and the sixth to a 16 GB RAID disk. This provided a total of 40 GB of system disk space.
Intel Paragon XP/S 35 (1992): The Intel Paragon XP/S 35 provided 512 compute processors arranged in a 16 row by 32 column rectangular mesh. In addition, there were five service nodes and 27 I/O nodes each connected to a 4.8 GB RAID disk. This provided a total of 130 GB of system disk space. Each of the five service nodes and the 512 compute nodes had 32MB of memory.
Intel Paragon XP/S 150 (1995): The fastest computer in the world at the time of its delivery to ORNL, the Intel Paragon XP/S 150 provided 1,024 nodes arranged in a 16 row by 64 column rectangular mesh. These were MP nodes, which meant there were two compute processors per node. Most of the nodes had 64MB, but 64 of the nodes had 128MB. In addition, there were five service nodes and 127 I/O nodes (119 regular I/O nodes and 4 high-performance SCSI-16 I/O nodes) each connected to a 4.8 GB RAID disk. This provided a total of 610 GB of system disk space.
|
wikipedia
|
wiki_26350_chunk_2
|
International Council on Nanotechnology
|
After a start-up phase, ICON completed its first project in August 2005 with the web publication of a database on nanotechnology environmental, health and safety research (EHS). Initially compiled by a team at Oak Ridge National Laboratory for the Chemical Industry Consultative Board on Advancing Nanotechnology, the database was turned over to ICON in spring 2005 to maintain and make web accessible. Further refinements have been made to the database over the years, including weekly updates, better indexing and search functionalities, and a Virtual Journal of Nanotechnology Environment, Health and Safety interface. The Virtual Journal and database are now widely used by people around the world to find abstracts, citations and links to published research papers on nanotechnology EHS.
|
wikipedia
|
wiki_12666_chunk_16
|
Dynamic energy budget theory
|
However, more recent publications aim to present the DEB theory in an "easier to digest" content to "bridge the ecology-mathematics gap". List of parameters is a direct result of list of processes which are of interest—if only growth under constant food and temperature is of interest, the standard DEB model can be simplified to the von Bertalanffy growth curve. Adding more processes into focus (such as reproduction and/or maturation), and forcing the model with fluctuating (dynamic) environmental conditions, needless to say, will result in more parameters.
|
wikipedia
|
wiki_22898_chunk_4
|
MultiValue database
|
Three of the implementations of MultiValue - PICK version R77, Microdata Reality 3.x, and Prime Information 1.0 - were very similar. In spite of attempts to standardize, particularly by International Spectrum and the Spectrum Manufacturers Association, who designed a logo for all to use, there are no standards across MultiValue implementations. Subsequently, these flavors diverged, although with some cross-over. These streams of MultiValue database development could be classified as one stemming from PICK R83, one from Microdata Reality, and one from Prime Information. Because of the differences, some implementations have provisions for supporting several flavors of the languages. An attempt to document the similarities and differences can be found at the Post-Relational Database Reference (PRDB).
|
wikipedia
|
wiki_21714_chunk_33
|
Energy policy of Australia
|
Energy strategy
In the 2004 White Paper Securing Australia's Energy Future, a number of initiatives were announced to achieve the Australian Government's energy objectives. These include:
a complete overhaul of the fuel excise system to remove A$1.5 billion in excise liability from businesses and households in the period to 2012–13
the establishment of a A$500 million fund to leverage more than A$1 billion in private investment to develop and demonstrate low-emission technologies
a strong emphasis on the urgency and importance of continued energy market reform
the provision of A$75 million for Solar Cities trials in urban areas to demonstrate a new energy scenario, bringing together the benefits of solar energy, energy efficiency and vibrant energy markets
the provision of A$134 million to remove impediments to the commercial development of renewable technologies
incentives for petroleum exploration in frontier offshore areas as announced in the 2004–05 budget
new requirements for business to manage their emissions wisely
a requirement that larger energy users undertake, and report publicly on, regular assessments to identify energy efficiency opportunities.
|
wikipedia
|
wiki_15890_chunk_0
|
List of MeSH codes (A06)
|
The following is a partial list of the "A" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (A05). Codes following these are found at List of MeSH codes (A07). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – endocrine system
|
wikipedia
|
wiki_2292_chunk_5
|
Questionnaire construction
|
Within social science research and practice, questionnaires are most frequently used to collect quantitative data using multi-item scales with the following characteristics:
Multiple statements or questions (minimum ≥3; usually ≥5) are presented for each variable being examined.
Each statement or question has an accompanying set of equidistant response-points (usually 5-7).
Each response point has an accompanying verbal anchor (e.g., “strongly agree”) ascending from left to right.
Verbal anchors should be balanced to reflect equal intervals between response-points.
Collectively, a set of response-points and accompanying verbal anchors are referred to as a rating scale. One very frequently-used rating scale is a Likert scale.
Usually, for clarity and efficiency, a single set of anchors is presented for multiple rating scales in a questionnaire.
Collectively, a statement or question with an accompanying rating scale is referred to as an item.
When multiple items measure the same variable in a reliable and valid way, they are collectively referred to as a multi-item scale, or a psychometric scale.
The following types of reliability and validity should be established for a multi-item scale: internal reliability, test-retest reliability (if the variable is expected to be stable over time), content validity, construct validity, and criterion validity.
Factor analysis is used in the scale development process.
Questionnaires used to collect quantitative data usually comprise several multi-item scales, together with an introductory and concluding section.
|
wikipedia
|
wiki_5770_chunk_11
|
Questionnaire
|
Within social science research and practice, questionnaires are most frequently used to collect quantitative data using multi-item scales with the following characteristics:
Multiple statements or questions (minimum ≥3; usually ≥5) are presented for each variable being examined.
Each statement or question has an accompanying set of equidistant response-points (usually 5-7).
Each response point has an accompanying verbal anchor (e.g., “strongly agree”) ascending from left to right.
Verbal anchors should be balanced to reflect equal intervals between response-points.
Collectively, a set of response-points and accompanying verbal anchors are referred to as a rating scale. One very frequently-used rating scale is a Likert scale.
Usually, for clarity and efficiency, a single set of anchors is presented for multiple rating scales in a questionnaire.
Collectively, a statement or question with an accompanying rating scale is referred to as an item.
When multiple items measure the same variable in a reliable and valid way, they are collectively referred to as a multi-item scale, or a psychometric scale.
The following types of reliability and validity should be established for a multi-item scale: internal reliability, test-retest reliability (if the variable is expected to be stable over time), content validity, construct validity, and criterion validity.
Factor analysis is used in the scale development process.
Questionnaires used to collect quantitative data usually comprise several multi-item scales, together with an introductory and concluding section.
|
wikipedia
|
wiki_15322_chunk_2
|
Advancing Physics
|
Foundations of Physics (assessed via a 1h 30m examination)
Physics in Depth (assessed via a 1h 30m examination) Current A Level
The current A Level course is linear and consists of three examination papers, in addition to a practical endorsement. All content is assessed across the three papers and practical endorsement, as opposed to being split into individual modules. The assessments are as follows: Fundamentals of Physics (assessed via a 2h 15m examination)
Scientific Literacy in Physics (assessed via a 2h 15m examination)
Practical Skills in Physics (assessed via a 1h 30m examination)
Practical Endorsement in Physics (teacher assessed)
|
wikipedia
|
wiki_12925_chunk_4
|
EDA database
|
The OpenAccess design database
Given the importance of a common design database in the EDA industry, the OpenAccess Coalition has been formed to develop, deploy, and support an open-sourced EDA design database with shared control. The data model presented in the OA DB provides a unified model that currently extends from structural RTL through GDSII-level mask data, and now into the reticle and wafer space. It provides a
rich enough capability to support digital, analog, and mixed-signal design data. It provides technology data that can express foundry process design rules through at least 20 nm, contains the definitions of the layers and purposes used in the design, definitions of VIAs and routing rules, definitions of operating points used for analysis, and so on. OA makes extensive use of IC-specific data compression techniques to reduce the memory footprint, to address the size, capacity, and performance problems of previous DBs. As of 2007, OA is the only modern IC database where the implementation is publicly available.
|
wikipedia
|
wiki_22876_chunk_2
|
Advanced Programming Specialist Group
|
From time to time, the Group holds joint meetings with other BCS SGs and Branches, for example:
February 2013, with Enterprise Architecture SG, What is Enterprise Architecture?
January 2013, with Formal Aspects SG (BCS-FACS), Industrial Uses of Formal Methods
May 2010, with Fortran SG, Parallel Programming in Fortran with Coarrays
January 2010 with Computer Conservation Society, The 50th Anniversary of the publication of the Algol 60 Report
October 2006, with Computer Conservation Society, The first 35+ years of IBM Hursley software
November 2005, with Formal Aspects SG (BCS-FACS), Separation Logic References
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.