id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_21533_chunk_11
|
Constraint (computational chemistry)
|
where is the unconstrained (or uncorrected) position of the ith particle after integrating the unconstrained equations of motion. To satisfy the constraints in the next timestep, the Lagrange multipliers should be determined as the following equation, This implies solving a system of non-linear equations simultaneously for the unknown Lagrange multipliers . This system of non-linear equations in unknowns is commonly solved using Newton–Raphson method where the solution vector is updated using where is the Jacobian of the equations σk:
|
wikipedia
|
wiki_6501_chunk_16
|
Software patent debate
|
U.S. Supreme Court decisions
Several Supreme Court decisions since 2000, as well as the Federal Circuit and district court decisions interpreting and implementing them, have dramatically impacted the status of software patents in the United States. They have particularly affected many thousands of business-method patents that issued as a result of Federal Circuit decisions in the 1990s. The two principal Supreme Court decisions were Bilski v. Kappos and Alice v. CLS Bank, the latter of which confirmed the applicability of the earlier decision Mayo v. Prometheus to computer-related inventions in which a computer was used to implement an abstract principle or preexisting business practice. (These cases are the subject of separate Wikipedia articles, which discuss the background and rulings in these cases in more detail, and supply authorities supporting the generalizations about those cases that follow. Additional detail is found in the Wikipedia article Software patents under United States patent law, along with supporting citations not repeated in this summary of those articles.)
|
wikipedia
|
wiki_4995_chunk_9
|
1960–61 United States network television schedule
|
NBCReturning SeriesAlfred Hitchcock Presents (moved from CBS)
The Art Carney Special
Bachelor Father
Bat Masterson
The Bell Telephone Hour
Bonanza
The Chevy Mystery Show
Concentration
The Deputy
The Dinah Shore Chevy Show
Five Star Jubilee
The Ford Show
The Groucho Show
Happy
The Huntley–Brinkley Report
It Could Be You
Jackpot Bowling starring Milton Berle
Laramie
The Lawless Years
The Loretta Young Show
The Man from Interpol
NBC News Specials
One Happy Family
Perry Como's Kraft Music Hall
The Price Is Right
Riverboat
Shirley Temple's Storybook
Tales of Wells Fargo
This is Your Life
Wagon Train
Westinghouse Playhouse Starring Nanette Fabray and Wendell CoreyNew SeriesAcapulco *The Americans *The Barbara Stanwyck ShowThe Campaign and the Candidates *Dan RavenDanteFive Star Jubilee *Great Ghost TalesThe Groucho ShowHappy *KlondikeMichael ShayneThe Nation's Future *National VelvetOne Happy Family *OutlawsPeter Loves MarySing Along with Mitch *The Tab Hunter ShowTales of Wells Fargo *The Tall ManThrillerWestinghouse Playhouse Starring Nanette Fabray and Wendell Corey*Westinghouse Preview Theatre *Whispering Smith *Not returning from 1959–60:'The Arthur Murray PartyFibber McGee and MollyFive FingersGas Company PlayhouseGillette Cavalcade of SportsLaw of the PlainsmanLove and MarriageM SquadThe Man and the ChallengeMusic on IceNBC PlayhouseNBC Sunday ShowcaseOmnibusOverland TrailPeople Are FunnyRichard Diamond, Private DetectiveStartimeThe Steve Allen Plymouth ShowTateThe TroubleshootersWichita TownWranglerNote: The * indicates that the program was introduced in midseason.
|
wikipedia
|
wiki_35981_chunk_3
|
Control–feedback–abort loop
|
In 1997, Mr. LeDoux used the change of behavior a person exhibits when driving a car at the time a police car pulls in behind them to describe how a change of control occurs. He demonstrated this phenomenon at a 2003 Product Development and Management Association (PDMA) meeting in Denver by showing the action of the first control (traffic, signs and speed) being aborted by the driver and a second control (police car, signs and speed) becoming the primary control. In 2004, Mr. LeDoux worked with Dr. Susan Wheeler, Ed. D., a former Instructional Design Consultant with Nims, Inc. and the present Director of Technology Services at Illinois Central College, to identify the range of uses for the CFA Loop. The CFA Loop is now being used to analyze system activities in several Fortune 100 companies. A discussion of its use is also included in the management book “Takeoff!: The Introduction to Project Management Book that Will Make Your Projects Take Off and Fly!” by Dr. Dan Price, D.M.
|
wikipedia
|
wiki_17908_chunk_14
|
Linear programming relaxation
|
Cutting plane method
Two 0–1 integer programs that are equivalent, in that they have the same objective function and the same set of feasible solutions, may have quite different linear programming relaxations: a linear programming relaxation can be viewed geometrically, as a convex polytope that includes all feasible solutions and excludes all other 0–1 vectors, and infinitely many different polytopes have this property. Ideally, one would like to use as a relaxation the convex hull of the feasible solutions; linear programming on this polytope would automatically yield the correct solution to the original integer program. However, in general, this polytope will have exponentially many facets and be difficult to construct. Typical relaxations, such as the relaxation of the set cover problem discussed earlier, form a polytope that strictly contains the convex hull and has vertices other than the 0–1 vectors that solve the unrelaxed problem.
|
wikipedia
|
wiki_29843_chunk_3
|
Nations: A Simulation Game in International Politics
|
Stephen Fuchs, in the paper Dumping the Dead Folks: Teaching U.S. Foreign Relations, talks about the important place this game plays in the final three days of his college course, "U.S. Foreign Relations since 1920". Fuchs says of this game, "I have not found another teaching device that reinforces as many of my course objectives as Nations does. Nations challenges students to identify the major issues and questions affecting their own nation and to place them in an international context. [...] What becomes apparent in our debriefing session is that the students and teams who best understand and negotiate the fault lines of domestic policy and international relations generally win the game. Analytical, communication, and negotiation skills figure prominently."
|
wikipedia
|
wiki_30674_chunk_1
|
Dutch Open Computer Chess Championship
|
{| class="sortable wikitable"
! # !! Year !! Program !! Champion
|-
| 1||1981||YNCT 1.0||Luuk de Vries
|-
| 2||1982||Gambiet 82||Wim Rens
|-
| 3||1983||Chess 0.5X||Wim Elsenaar
|-
| 4||1984||Chess 0.5X||Wim Elsenaar
|-
| 5||1985||Nona||Frans Morsch
|-
| 6||1986||Nona||Frans Morsch
|-
| 7||1987||REBEL||Ed Schröder
|-
| 8||1988||Quest||Frans Morsch
|-
| 9||1989||REBEL||Ed Schröder
|-
| 10||1990||REBEL||Ed Schröder
|-
| 11||1991||The King||Johan de Koning
|-
| 12||1992||REBEL||Ed Schröder
|-
| 13||1993||The King||Johan de Koning
|-
| 14||1994||Quest||Frans Morsch
|-
| 15||1995||The King||Johan de Koning
|-
| 16||1996||CilkChess||MIT team
|-
| 17||1997||Nimzo||Christian Donninger
|-
| 18||1998||The King||Johan de Koning
|-
| 19||1999||Quest||Frans Morsch, Mathias Feist
|-
| 20||2000||Chess Tiger||Christophe Théron, Jeroen Noomen
|-
| 21||2001||Chess Tiger||Christophe Théron, Jeroen Noomen
|-
| 22||2002||Chess Tiger||Christophe Théron, Jeroen Noomen
|-
| 23||2003||Ruffian||Perola Valfridsson, Martin Blume, Djordje Vidanovic
|-
| 24||2004||Diep ||Vincent Diepeveen
|-
| 25||2005||Zappa||Anthony Cozzie, Erdogan Günes
|-
| 26||2006||Rybka||Vasik Rajlich, Jeroen Noomen
|-
| 27||2007||Rybka||Vasik Rajlich, Jeroen Noomen
|-
| 28||2008||Rybka||Vasik Rajlich, Jeroen Noomen
|-
| 29||2009||Rybka||Vasik Rajlich, Lukas Cimiotti (hardware), Jiří Dufek (opening book), Hans van der Zijden (operator)
|-
| 30||2010||Rybka||Vasik Rajlich, Lukas Cimiotti (hardware), Jiří Dufek (opening book), Hans van der Zijden (operator)
|-
| 31||2011||Pandix||Gyula Horváth
|-
| 32||2012||Rybka||Vasik Rajlich
|}
|
wikipedia
|
wiki_22991_chunk_1
|
Houston Energy
|
|-
| colspan="6" align="center" | Houston Energy (WPFL)
|-
|2000 || 4 || 2 || 0 || 1st American West || Won American Conference Qualifier (Colorado)Won American Conference Championship (Minnesota)Won WPFL Championship (New England)
|-
|2001 || 10 || 0 || 0 || 1st American West || Won American Conference Championship (Opponent Unknown)Won WPFL Championship (Austin)
|-
|2002 || 10 || 0 || 0 || 1st American Conference || Won American Conference Championship (Arizona)Won WPFL Championship (Wisconsin)
|-
|2003 || 7 || 2 || 0 || 2nd National South|| --
|-
|2004 || 7 || 3 || 0 || 2nd American South || Won American Conference Wild Card (Long Beach)Lost American Conference Championship (Dallas)
|-
|2005 || 6 || 4 || 0 || 2nd American South || Lost Divisional Playoffs (Dallas)
|-
|2006 || 7 || 1 || 0 || 1st National East || Won National Conference Championship (Wisconsin)Lost WPFL Championship (Dallas)
|-
|2007 || 7 || 1 || 0 || 1st National Central || Won National Conference Championship (Wisconsin)Lost WPFL Championship (So Cal)
|-
|2008 || colspan="6" rowspan="1" align="center" | Did Not Play
|-
| colspan="6" align="center" | Houston Energy (IWFL)
|-
|2009 || 2 || 6 || 0 || 4th Tier I East South Atlantic || --
|-
|2010* || 5 || 3 || 0 || 4th Tier I West Midwest ||--
|-
|2011 || 0 || 0 || 0 || 1st Tier l East South Atlantic || Lost Tier I Semifinal (Ravens)
|-
|2012 || 6 || 0 || 0 || 1st Tier I South Atlantic || Won Tier I Semifinal (Xplosion)Lost Tier I Conference Championship (Blitz)
|-
|2013 || 7 || 0 || 0 || 1st Southwest || Won Western Conference Semifinal (Blaze) Won Western Conference Championship (Phantomz) Lost IWFL Championship (Phoenix)
|-
|2014 || 5 || 1 || 0 || 1st Southwest || Won Western Conference Semifinal (Phantomz) Won Western Conference Championship (Blaze) Lost IWFL Championship (Passion)
|-
|2015 || 6 || 0 || 0 || 1st Southwest || Lost Western Conference Semifinal (Blaze)
|-
|2016 || 4 || 4 || 0 || 5th Central || --
|-
|2017 || 5 || 2 || 0 || 2nd Central || Won Eastern Conference Semifinal (Queens) Lost Eastern Conference Championship (Yellow Jackets)
|-
|2018 || 4 || 1 || 0 || 2nd Central || Won IWFL Championship (Storm)
|-
| colspan="6" align="center" | Houston Energy (WFA)
|-
|2019 || 6 || 1 || 0 || 3rd WFA II American Midwest || Lost First Round (Blaze)
|-
|2020 || colspan="6" rowspan="1" align="center" | Season cancelled due COVID-19 pandemic
|-
|2021 || 5 || 1 || 0 || 1st WFA II National Midwest || Won First Round (Trojans) Lost WFA II Conference Championship (Storm)
|-
!Totals || 71 || 24 || 0
|colspan="2"| (including playoffs)
|
wikipedia
|
wiki_34053_chunk_1
|
GroupLogic
|
Slate Group Logic: What can a tiny software firm show us about the future of American exports 16-Nov-2010
Mac Observer Interviews Group Logic CEO
BusinessWeek Private Company Information: Group Logic, Inc.
Key Issues for Managed File Transfer, 2009 19 February 2009 | ID:G00165299
Moving Beyond MFT to File Services 29 May 2009 | ID:G00168386
Data Encryption Not Enough to Prevent FTP Credential Theft 6 July 2009 | ID:G00169584
Hype Cycle for Data and Application Security, 2009 17 July 2009 | ID:G00168605
|
wikipedia
|
wiki_7907_chunk_3
|
National Council of Teachers of Mathematics
|
NCTM does not conduct research in mathematics education, but it does publish the Journal for Research in Mathematics Education (JRME). JRME is devoted to the interests of teachers of mathematics and mathematics education at all levels—preschool through adult. JRME is a forum for disciplined inquiry into the teaching and learning of mathematics. The editors encourage the submission of a variety of manuscripts: reports of research, including experiments, case studies, surveys, philosophical studies, and historical studies; articles about research, including literature reviews and theoretical analyses; brief reports of research; critiques of articles and books; and brief commentaries on issues pertaining to research.
|
wikipedia
|
wiki_20089_chunk_1
|
Diabetes management software
|
Features and uses
Conducting regular self-management tasks such as medication and insulin intake, blood sugar checkup, diet observance, and physical exercise are really demanding. This is why the use of diabetes-related apps for the purposes of recording diet and medication intake or blood glucose level is promising to improve the health condition for the patients. There are many products available to help maintain records and analyze trends related to diabetes care. Some support a single diabetes tool such as one manufacturers glucose meter, while others are intended to interface with many manufacturers products. Some diabetes management software is free to download or can be used on-line, while others are for sale (or shareware). Some are simple and easy to use for a single user, while others have very powerful features that support many users in a clinical setting. The emergence of user-friendly mobile devices has resulted in renewed interest in diabetes mobile applications, and there is a 2011 review article of the currently available features compared against evidence-based recommendations for diabetes self-management.
|
wikipedia
|
wiki_6853_chunk_16
|
Mata Amritanandamayi Math
|
Research for a Better World
Through MAM's university, Amrita Vishwa Vidyapeetham, volunteer researchers are conducting research and development in disciplines including nanotechnology, biotechnology, robotics and satellite-enabled software solutions. The stated goal behind the research is: "To harness the power of modern technology to provide effect, targeted aid to communities and individuals in crisis." Projects include a sensor network system for landslide detection, a high-quality low-cost insulin pump for diabetics, a system for early-cancer detection and stem-cell research.
|
wikipedia
|
wiki_3191_chunk_17
|
Time complexity
|
Algorithms which run in quasilinear time include:
In-place merge sort, O(n log2 n)
Quicksort, O(n log n), in its randomized version, has a running time that is O(n log n) in expectation on the worst-case input. Its non-randomized version has an O(n log n) running time only when considering average case complexity.
Heapsort, O(n log n), merge sort, introsort, binary tree sort, smoothsort, patience sorting, etc. in the worst case
Fast Fourier transforms, O(n log n)
Monge array calculation, O(n log n)
|
wikipedia
|
wiki_26170_chunk_1
|
Salem Web Network
|
Crosswalk.com was acquired in 2002, and is built around four primary content areas – faith, family, fun and community. The content is provided by ministries such as Focus on the Family, Insight for Living from Chuck Swindoll, John Piper, John F. MacArthur, and others. The site features movie reviews, music and book reviews, homeschooling resources, a directory, and other Christian resources.
Christianity.com is a Christian web portal, providing articles on current topics, the history of Christianity, apologetics and other topics.
BibleStudyTools.com is an online Bible resource with 31 translations, verse search, Bible commentaries, Bible concordances, Bible dictionaries, reading plans, lexicons, apocrypha, and Christian devotional literature. The website allows users to highlight and underline verses and create Bible reading plans, take and save notes in the online "margins" and share them online. It also includes tools to allow small groups and Sunday school classes to create group pages for studying Scripture together.
OnePlace.com, launched in 1998, has 13 million page views and 1.3 million unique users per month. It provides online streaming of 150 broadcast ministries and 200 radio programs. OnePlace.com received the 2007 National Religious Broadcasters Media Award for Internet-Best Broadcasting Website.
LightSource.com is a Christian video portal streaming over 100 ministry broadcasts with video on demand, podcasts and program archives. Contributors include John F. MacArthur, Greg Laurie, Jack Graham, Joel Osteen, Adrian Rogers, Beth Moore, T.D. Jakes, Joyce Meyer, and others. It received the Best Broadcast Website Award in 2008 by the National Religious Broadcasters.
ChristianJobs.com is an employment website focusing on employment within the Christian community. It claims 241,617 registered members and 44,165 resumes in their database. It provides job postings, résumé listings, eCoaching, eMentoring and a business network.
ChurchStaffing.com is an employment website that aims to connect churches and ministries in the US and Canada with staff candidates. Users may post job openings and résumés, browse church and ministry vacancies, and shop in an online resource store. The site has an agreement with Secure Search to provide faith-based organizations with background checks for staff and volunteers. The site also has free sample job descriptions and a salary comparison database.
CrossDaily.com is a Christian graphics site. The graphics section features photography, video loops, PowerPoint sets, computer wallpaper, clip art and web art, animated and static Christian e-cards, and free Bible trivia games.
CrossCards.com provides e-cards, mobile wallpaper and Christian cell phone ringtones. The CrossCards.com iPhone app was released in 2010.
SermonSearch.com was originally an independent website named "Ministers' Resource Center". In 1997, OnePlace.com purchased the site and renamed it "SermonSearch. com". The focus of the site became presentation of sermons in text format. It includes more than 21,000 sermon outlines, Christian worship backgrounds, motion loops, and video clips that can be downloaded for a fee.
TheFish.com is a website for pop culture news and entertainment reviews from a Christian perspective. Its entertainment culture reviews include movies, DVDs, television, books, video games, and music.
GodTube is a Christian video hosting service. In June 2010 Salem Communications acquired GodTube.com and Tangle.com. Viewers can watch and share videos, access Christian music, read the Bible online through the Online Bible, and upload prayers to the Prayer Wall and network with other users.
TeacherTube is video sharing website designed to allow those in the educational industry, particularly teachers, to share user-generated educational videos and other resources.
Townhall.com is a web-based publication and a print magazine, primarily dedicated to conservative United States politics.
Hot Air is a political commentary website founded by Michelle Malkin, a conservative author and blogger, in 2006. It also carries posts from a selection of conservative and libertarian bloggers in its "Green Room." Salem Communications purchased Hot Air in February 2010.
Jesus.org offers biblically based answers to questions about Jesus Christ's birth, life, death, and resurrection. It presents a database of questions and answers in text, video and audio formats. The answers are written by pastors and scholars including Charles Stanley, Greg Laurie, and John Piper,.
SamaritanFundraising.com is an online fundraising website, acquired by Salem Communications in September 2010. It aims to support churches, schools, youth groups, and other organizations. Their primary fundraising product, the Samaritan Card, gives its user access to discounts and savings at merchants in the United States.
|
wikipedia
|
wiki_34793_chunk_10
|
Canadian Perinatal Network
|
Links to publications
On behalf of the Canadian Perinatal Network Collaborative Group the following are preliminary publications including topics such as knowledge translation, sharing data, standardization of terminology, etc. Please stay tuned for more publications to come.
Massey KA, Magee LA, Dale S, Claydon J, Morris TJ, von Dadelszen P, Liston RM and Ansermino JM. A Current Landscape of Provincial Perinatal Data Collection in Canada. Journal of Obstetrics and Gynaecology of Canada. March 2009.
Massey KA, Morris TJ, Liston RM, von Dadelszen P, Ansermino JM, and Magee LA "Building Knowledge in Maternal and Infant care" in Medical Informatics in Obstetrics and Gynecology. Edited by David Parry and Emma Parry. Auckland New Zealand November 2008.
Massey KA, Ansermino JM von Dadelszen P, Morris TJ, Liston RM, Magee LA. What is SNOMED CT and why should the ISSHP care? Hypertension in Pregnancy. February 2009.
|
wikipedia
|
wiki_31654_chunk_1
|
Mathematical object
|
List of mathematical objects by branch
Number theory
numbers, operations,
Combinatorics
permutations, derangements, combinations
Set theory
sets, set partitions
functions, and relations
Geometry
points, lines, line segments,
polygons (triangles, squares, pentagons, hexagons, ...), circles, ellipses, parabolas, hyperbolas,
polyhedra (tetrahedrons, cubes, octahedrons, dodecahedrons, icosahedrons, ), spheres, ellipsoids, paraboloids, hyperboloids, cylinders, cones.
Graph theory
graphs, trees, nodes, edges
Topology
topological spaces and manifolds.
Linear algebra
scalars, vectors, matrices, tensors.
Abstract algebra
groups,
rings, modules,
fields, vector spaces,
group-theoretic lattices, and order-theoretic lattices.
|
wikipedia
|
wiki_33903_chunk_8
|
Sensacell
|
Examples of Use
The combination of modularity, scalability and durability inherent in a Sensacell network lends itself to a wide variety of applications. In particular, constructed surfaces can be enclosed in or separated by architectural building materials such as glass, plastic, or wood. Therefore, a large-scale interactive space can be created where the installation of similar technology would be impractical or infeasible. Examples in current use include: marketing and display kiosks; interactive museum exhibits; exercise gaming (exergaming); and user-reactive furniture, interactive architectural and interior design installations; multimedia information displays.
|
wikipedia
|
wiki_12134_chunk_2
|
Boolean expression
|
Some languages, e.g., Perl and Ruby, have two sets of Boolean operators, with identical functions but different precedence. Typically these languages use and, or and not for the lower precedence operators. Some programming languages derived from PL/I have a bit string type and use BIT(1) rather than a separate Boolean type. In those languages the same operators serve for boolean operations and bitwise operations. The languages represent OR, AND, NOT and EXCLUSIVE OR by "|", "&", "¬" (infix) and "¬" (prefix). Short-circuit operators
|
wikipedia
|
wiki_25422_chunk_10
|
Eight-point algorithm
|
where is the resulting matrix from Step 2 and the Frobenius matrix norm is used. The solution to the problem is given by first computing a singular value decomposition of : where are orthogonal matrices and is a diagonal matrix which contains the singular values of . In the ideal case, one of the diagonal elements of should be zero, or at least small compared to the other two which should be equal. In any case, set where are the largest and second largest singular values in respectively. Finally, is given by The matrix is the resulting estimate of the essential matrix provided by the algorithm. Normalized algorithm
|
wikipedia
|
wiki_12803_chunk_3
|
Science, technology, engineering, and mathematics
|
Other variations
SMET (science, mathematics, engineering, and technology; previous name)
STREAMi (Science, Technology, Research, Engineering, Arts, Maths, innovation)
STM (Scientific, Technical, and Mathematics; or Science, Technology, and Medicine; or Scientific, Technical, and Medical)
eSTEM (environmental STEM)
STEMIE (Science, Technology, Engineering, Mathematics, Invention and Entrepreneurship); adds Inventing and Entrepreneurship as means to apply STEM to real world problem solving and markets.
iSTEM (invigorating Science, Technology, Engineering, and Mathematics); identifies new ways to teach STEM-related fields.
STEMLE (Science, Technology, Engineering, Mathematics, Law and Economics); identifies subjects focused on fields such as applied social sciences and anthropology, regulation, cybernetics, machine learning, social systems, computational economics and computational social sciences.
MEd Curriculum Studies: STEMS² (Science, Technology, Engineering, Mathematics, Social Sciences and Sense of Place); integrates STEM with social sciences and sense of place.
METALS (STEAM + Logic), introduced by Su Su at Teachers College, Columbia University.
STREM (Science, Technology, Robotics, Engineering, and Mathematics); adds robotics as a field.
STREM (Science, Technology, Robotics, Engineering, and Multimedia); adds robotics as a field and replaces mathematics with media.
STREAM (Science, Technology, Robotics, Engineering, Arts, and Mathematics); adds robotics and arts as fields.
STEEM (Science, Technology, Engineering, Economics, and Mathematics); adds economics as a field.
STEAM (Science, Technology, Engineering, Arts, and Mathematics)
A-STEM (Arts, Science, Technology, Engineering, and Mathematics); more focus and based on humanism and arts.
STEAM (Science, Technology, Engineering, Agriculture, and Mathematics); add Agriculture.
STEAM (Science, Technology, Engineering and Applied Mathematics); more focus on applied mathematics
GEMS (Girls in Engineering, Math, and Science); used for programs to encourage women to enter these fields.
STEMM (Science, Technology, Engineering, Mathematics, and Medicine)
SHTEAM (Science, Humanities, Technology, Engineering, Arts, and Mathematics)
AMSEE (Applied Math, Science, Engineering, and Entrepreneurship)
THAMES (Technology, Hands-On, Arts, Mathematics, Engineering, Science)
THAMES (Technology, Humanities, Arts, Mathematics, Engineering, and Science; includes all three branches of science: natural science, social science, and formal science)
MINT (Mathematics, Informatics, Natural sciences and Technology)
|
wikipedia
|
wiki_1527_chunk_16
|
Generating function
|
The ordinary generating function of a sequence can be expressed as a rational function (the ratio of two finite-degree polynomials) if and only if the sequence is a linear recursive sequence with constant coefficients; this generalizes the examples above. Conversely, every sequence generated by a fraction of polynomials satisfies a linear recurrence with constant coefficients; these coefficients are identical to the coefficients of the fraction denominator polynomial (so they can be directly read off). This observation shows it is easy to solve for generating functions of sequences defined by a linear finite difference equation with constant coefficients, and then hence, for explicit closed-form formulas for the coefficients of these generating functions. The prototypical example here is to derive Binet's formula for the Fibonacci numbers via generating function techniques.
|
wikipedia
|
wiki_23161_chunk_8
|
FAME (database)
|
R Interface:
FAME customers have developed and released as free software an interface that links FAME objects to the open source R statistical package. Originally developed at the Federal Reserve Board, features include:
Time series adaptation of FAME to R
Frequency conformance
A set of fundamental statistical functions SASEFAME:
SAS provides an interface to FAME databases called SASEFAME. This provides dynamic read and write access between a SAS application and FAME databases or a FAME server process TROLL Interface:
TROLL’s interface to FAME provides read and write access from a TROLL application to a FAME Server or directly to a local FAME database
|
wikipedia
|
wiki_34113_chunk_8
|
Shaheen (supercomputer)
|
Institutional partners
The Shaheen system at KAUST is made possible through a joint collaboration between the Cray and KAUST. In addition to IBM and Cray, KSL has partnered with the following partner research institutions and organizations:
The Oxford Center for Collaborative Applied Mathematics (OCCAM) at Oxford University
Massachusetts Institute of Technology (MIT)
Imperial College London
Hong Kong University of Science and Technology
Woods Hole Oceanographic Institution
Institut Français du Pétrole
National University of Singapore
American University in Cairo
Technische Universität München
GE Global Research
King Abdulaziz City for Science & Technology
King Fahd University of Petroleum and Minerals
Saudi Aramco
Wipro Arabia
Indian Institute of Technology Kanpur
|
wikipedia
|
wiki_32949_chunk_6
|
National Economic and Technological Development Zones
|
Further reading
<https://web.archive.org/web/20161220025544/http://www.ide.go.jp/English/Publish/Periodicals/De/pdf/87_01_05.pdf>
China Acadmenic Journals Full-text Database <http://www.eastview.com/>
<http://www.ntpu.edu.tw/econ/files/Journal/20110308170007.pdf>
|
wikipedia
|
wiki_1403_chunk_38
|
List of programming languages by type
|
ARM
Original 32-bit
16-bit Thumb instructions (subset or registers used)
64-bit (major architecture change, more registers)
DEC:
18-bit: PDP-1, PDP-4, PDP-7, PDP-9, PDP-15
12-bit: PDP-5, PDP-8, LINC-8, PDP-12
36-bit: PDP-6, PDP-10, DECSYSTEM-20
16-bit: PDP-11 (influenced VAX and M68000)
32-bit: VAX
64-bit: Alpha
Intel 8008, 8080 and 8085
Zilog Z80
x86:
16-bit x86, first used in the Intel 8086
Intel 8086 and 8088 (the latter was used in the first and early IBM PC)
Intel 80186
Intel 80286 (the first x86 processor with protected mode, used in the IBM AT)
IA-32, introduced in the 80386
x86-64 The original specification was created by AMD. There are vendor variants, but they're essentially the same:
AMD's AMD64
Intel's Intel 64
IBM
305
650
701
702, 705 and 7080
704, 709, 7040, 7044, 7090, 7094
1400 series, 7010
7030
7070
System/360 and successors, including z/Architecture
MIPS
Motorola 6800
Motorola 68000 family (CPUs used in early Apple Macintosh and early Sun computers)
MOS Technology 65xx
6502 (CPU for VIC-20, Apple II, and Atari 800)
6510 (CPU for Commodore 64)
Western Design Center 65816/65802 (CPU for Apple IIGS and (variant) Super Nintendo Entertainment System)
National Semiconductor NS320xx
POWER, first used in the IBM RS/6000
PowerPC – used in Power Macintosh and in many game consoles, particularly of the seventh generation.
Power ISA
Sun Microsystems (Now Oracle) SPARC
UNIVAC
30 bit computers: 490, 492, 494, 1230
36 bit computers
1101, 1103, 1105
1100/2200 series
MCST Elbrus 2000
|
wikipedia
|
wiki_1797_chunk_22
|
Template metaprogramming
|
int main() {
for(int i=0; i < TABLE_SIZE; i++) {
std::cout << table[i] << std::endl; // run time use
}
std::cout << "FOUR: " << FOUR << std::endl;
}
The idea behind this is that the struct Helper recursively inherits from a struct with one more template argument (in this example calculated as INDEX * INDEX) until the specialization of the template ends the recursion at a size of 10 elements. The specialization simply uses the variable argument list as elements for the array.
The compiler will produce code similar to the following (taken from clang called with -Xclang -ast-print -fsyntax-only).
template <int INDEX = 0, int ...D> struct Helper : Helper<INDEX + 1, D..., INDEX * INDEX> {
};
template<> struct Helper<0, <>> : Helper<0 + 1, 0 * 0> {
};
template<> struct Helper<1, <0>> : Helper<1 + 1, 0, 1 * 1> {
};
template<> struct Helper<2, <0, 1>> : Helper<2 + 1, 0, 1, 2 * 2> {
};
template<> struct Helper<3, <0, 1, 4>> : Helper<3 + 1, 0, 1, 4, 3 * 3> {
};
template<> struct Helper<4, <0, 1, 4, 9>> : Helper<4 + 1, 0, 1, 4, 9, 4 * 4> {
};
template<> struct Helper<5, <0, 1, 4, 9, 16>> : Helper<5 + 1, 0, 1, 4, 9, 16, 5 * 5> {
};
template<> struct Helper<6, <0, 1, 4, 9, 16, 25>> : Helper<6 + 1, 0, 1, 4, 9, 16, 25, 6 * 6> {
};
template<> struct Helper<7, <0, 1, 4, 9, 16, 25, 36>> : Helper<7 + 1, 0, 1, 4, 9, 16, 25, 36, 7 * 7> {
};
template<> struct Helper<8, <0, 1, 4, 9, 16, 25, 36, 49>> : Helper<8 + 1, 0, 1, 4, 9, 16, 25, 36, 49, 8 * 8> {
};
template<> struct Helper<9, <0, 1, 4, 9, 16, 25, 36, 49, 64>> : Helper<9 + 1, 0, 1, 4, 9, 16, 25, 36, 49, 64, 9 * 9> {
};
template<> struct Helper<10, <0, 1, 4, 9, 16, 25, 36, 49, 64, 81>> {
static constexpr std::array<int, TABLE_SIZE> table = {0, 1, 4, 9, 16, 25, 36, 49, 64, 81};
};
|
wikipedia
|
wiki_36737_chunk_8
|
Computational complexity of matrix multiplication
|
The current best bound on is , by Josh Alman and Virginia Vassilevska Williams. This algorithm, like all other recent algorithms in this line of research, uses the laser method, a generalization of the Coppersmith–Winograd algorithm, which was given by Don Coppersmith and Shmuel Winograd in 1990 and was the best matrix multiplication algorithm until 2010. The conceptual idea of these algorithms are similar to Strassen's algorithm: a way is devised for multiplying two -matrices with fewer than multiplications, and this technique is applied recursively. The laser method has limitations to its power, and cannot be used to show that .
|
wikipedia
|
wiki_22191_chunk_1
|
Sieve C++ Parallel Programming System
|
Introduction
Sieve is a C++ compiler that will take a section of serial code, which is annotated with sieve markers, and parallelize it automatically. The programmer wraps code they wish to parallelise inside a lexical scope, which is tagged as 'sieve'. Inside this scope, referred to commonly as a 'sieve block', certain rules apply :
All side-effects within the sieve block are delayed until the end of the scope.
Side-effects are defined to be any modifications to data declared outside the sieve block scope.
Only functions annotated with sieve or immediate can be called.
|
wikipedia
|
wiki_6736_chunk_15
|
List of interactive geometry software
|
Deterministic
Languages: Dutch, English, French, Chinese, German, Hungarian, Italian, Japanese, Norwegian Bokmål, Portuguese, Russian, Spanish, Turkish, Welsh
Macros: Yes. Editable and with support for recursion
Java-applet: No
Animation: No
Locus: Yes, but no direct way to place a point on a locus.
Assignments: No
Measurement/Calculations: Yes (the calculator is a bit strange)
Platform: Unix/Linux, Windows, Mac OS (any platform that supports Qt)
Proofs: No
Extra: Editable Live Geometry
|
wikipedia
|
wiki_4287_chunk_12
|
Max Planck Institute for Extraterrestrial Physics
|
The institute was founded in 1963 as a sub-institute of the Max-Planck-Institut für Physik und Astrophysik and established as an independent institute in 1991.
Its main research topics are astronomical observations in spectral regions which are only accessible from space because of the absorbing effects of the Earth's atmosphere, but also instruments on ground-based observatories are used whenever possible.
Scientific work is done in four major research areas that are supervised by one of the directors, respectively: optical and interpretative astronomy (Bender), infrared and sub-millimeter/millimeter astronomy (Genzel), high-energy astrophysics (Nandra), and in the Centre for Astrochemical Studies (Caselli). Within these areas scientists lead individual experiments and research projects organised in about 25 project teams. The research topics pursued at MPE range from the physics of cosmic plasmas and of stars to the physics and chemistry of interstellar matter, from star formation and nucleosynthesis to extragalactic astrophysics and cosmology.
|
wikipedia
|
wiki_33245_chunk_2
|
T-code
|
The transaction for MM module starts with M.
IH09 - Display Material
MM01 - Create Material
MM02 - Change Material
MM03 - Display Material
MM50 - List Extendable Materials
MMBE - Stock Overview
MMI1 - Create Operating Supplies
MMN1 - Create Non-Stock Material
MMS1 - Create Service
MMU1 - Create Non-Valuated Material
ME51N - Create Purchase Requisition
ME52N - Change Purchase Requisition
ME53N - Display Purchase Requisition
ME5A - Purchase Requisitions: List Display
ME5J - Purchase Requisitions for Project
ME5K - Requisitions by Account Assignment
MELB - Purch. Transactions by Tracking No.
ME56 - Assign Source to Purch. Requisition
ME57 - Assign and Process Requisitions
ME58 - Ordering: Assigned Requisitions
ME59 - Automatic Generation of POs
ME54 - Release Purchase Requisition
ME55 - Collective Release of Purchase Reqs.
ME5F - Release Reminder: Purch. Requisition
MB21 - Create Reservation
MB22 - Change Reservation
MB23 - Display Reservation
MB24 - Reservations by Material
MB25 - Reservations by Account Assignment
MB1C - Other Goods Receipts
MB90 - Output Processing for Mat. Documents
MB21 - Create Reservation
MB22 - Change Reservation
MB23 - Display Reservation
MB24 - Reservations by Material
MB25 - Reservations by Account Assignment
MBRL - Return Delivery per Mat. Document
MB1C - Other Goods Receipts
MB90 - Output Processing for Mat. Documents
MB1B - Transfer Posting
MIBC - ABC Analysis for Cycle Counting
MI01 - Create Physical Inventory Document
MI02 - Change Physical Inventory Document
MI03 - Display Physical Inventory Document
MI31 - Batch Input: Create Phys. Inv. Doc.
MI32 - Batch Input: Block Material
MI33 - Batch Input: Freeze Book Inv.Balance
MICN - Btch Inpt:Ph.Inv.Docs.for Cycle Ctng
MIK1 - Batch Input: Ph.Inv.Doc.Vendor Cons.
MIQ1 - Batch Input: PhInvDoc. Project Stock
MI01 - Create Physical Inventory Document
MI02 - Change Physical Inventory Document
MI03 - Display Physical Inventory Document
MI31 - Batch Input: Create Phys. Inv. Doc.
MI32 - Batch Input: Block Material
MI33 - Batch Input: Freeze Book Inv.Balance
MICN - Btch Inpt:Ph.Inv.Docs.for Cycle Ctng
MIK1 - Batch Input: Ph.Inv.Doc.Vendor Cons.
MIQ1 - Batch Input: PhInvDoc. Project Stock
MI01 - Create Physical Inventory Document
MI02 - Change Physical Inventory Document
MI03 - Display Physical Inventory Document
MI31 - Batch Input: Create Phys. Inv. Doc.
MI32 - Batch Input: Block Material
MI33 - Batch Input: Freeze Book Inv.Balance
MICN - Btch Inpt:Ph.Inv.Docs.for Cycle Ctng
MIK1 - Batch Input: Ph.Inv.Doc.Vendor Cons.
MIQ1 - Batch Input: PhInvDoc. Project Stock
MI21 - Print physical inventory document
MI04 - Enter Inventory Count with Document
MI05 - Change Inventory Count
MI06 - Display Inventory Count
MI09 - Enter Inventory Count w/o Document
MI34 - Batch Input: Enter Count
MI35 - Batch Input: Post Zero Stock Balance
MI38 - Batch Input: Count and Differences
MI39 - Batch Input: Document and Count
MI40 - Batch Input: Doc., Count and Diff.
MI08 - Create List of Differences with Doc.
MI10 - Create List of Differences w/o Doc.
MI20 - Print List of Differences
MI11 - Physical Inventory Document Recount
MI07 - Process List of Differences
MI37 - Batch Input: Post Differences
|
wikipedia
|
wiki_17581_chunk_82
|
History of mathematical notation
|
Future of mathematical notation In the history of mathematical notation, ideographic symbol notation has come full circle with the rise of computer visualization systems. The notations can be applied to abstract visualizations, such as for rendering some projections of a Calabi–Yau manifold. Examples of abstract visualization which properly belong to the mathematical imagination can be found in computer graphics. The need for such models abounds, for example, when the measures for the subject of study are actually random variables and not really ordinary mathematical functions. See also
|
wikipedia
|
wiki_1643_chunk_32
|
Make (software)
|
Below is a very simple makefile that by default (the "all" rule is listed first) compiles a source file called "helloworld.c" using the system's C compiler and also provides a "clean" target to remove the generated files if the user desires to start over. The and are two of the so-called internal macros (also known as automatic variables) and stand for the target name and "implicit" source, respectively. In the example below, expands to a space delimited list of the prerequisites. There are a number of other internal macros.
|
wikipedia
|
wiki_19496_chunk_5
|
Equipment codes
|
Radio communication, navigation and approach aid equipment and capabilities
A GBAS landing system
B LPV (APV with SBAS)
C LORAN C
D DME
E1 FMC WPR ACARS
E2 D-FIS ACARS
E3 PDC ACARS
F ADF
G GNSS (If the letter G is used, the types of external GNSS augmentation, if any, are specified in Item 18 following the indicator NAV/ and separated by a space.)
H HF RTF (HF RadioTelephone)
I INS
J1 CPDLC ATN VDL Mode 2
J2 CPDLC FANS 1/A HFDL
J3 CPDLC FANS 1/A VDL Mode A/0
J4 CPDLC FANS 1/A VDL Mode 2
J5 CPDLC FANS 1/A SATCOM (INMARSAT)
J6 CPDLC FANS 1/A SATCOM (MTSAT)
J7 CPDLC FANS 1/A SATCOM (Iridium)
K MLS
L ILS
M1 ATC RTF SATCOM (INMARSAT)
M2 ATC RTF (MTSAT)
M3 ATC RTF (Iridium)
N No COM/NAV equipment for the route carried or is unserviceable.
O VOR
P1-P9 Reserved for RCP
Q (Not allocated)
R PBN approved (If the letter R is used, the performance based navigation levels that can be met are specified in Item 18 following the indicator PBN/.)
S Standard Equipment composed of VHF RTF, VOR and ILS, unless another combination is prescribed by the appropriate ATS authority.
T TACAN
U UHF RTF
V VHF RTF
W RVSM approved
X MNPS approved
Y Indicates 8.33 kHz radio band spacing (a standard requirement)
Z Other equipment carried or other capabilities
|
wikipedia
|
wiki_9226_chunk_29
|
Geobiology
|
While geobiology is a diverse and varied field, encompassing ideas and techniques from a wide range of disciplines, there are a number of important methods that are key to the study of the interaction of life and Earth that are highlighted here.
Laboratory culturing of microbes is used to characterize the metabolism and lifestyle of organisms of interest.
Gene sequencing allows scientists to study the relationships between extant organisms using phylogenetics.
Experimental genetic manipulation or mutagenesis is used to determine the function of genes in living organisms.
Microscopy is used to visualize the microbial world. Microscope work ranges from environmental observation to quantitative studies with DNA probes to high-definition visualization of the microbe-mineral interface by electron microscope (EM).
Isotope tracers can be used to track biochemical reactions to understand microbial metabolism.
Isotope natural abundance in rocks can be measured to look for isotopic fractionation that is consistent with biologic origin.
Detailed environmental characterization is important to understanding what about a habitat might be driving life's evolution and, in turn, how life might be changing that niche. It includes and is not limited to, temperature, light, pH, salinity, concentration of specific molecules like oxygen, and the biologic community.
Sedimentology and stratigraphy are used to read the rocks. The rock record stores a history of geobiologic processes in sediments which can be unearthed through an understanding of deposition, sedimentation, compaction, diagenesis, and deformation.
The search for and study of fossils, while often delegated to the separate field of paleontology, is important in geobiology, though the scale of fossils is typically smaller (micropaleontology).
The biochemical analysis of biomarkers, which are fossilized or modern molecules that are indicative of the presence of a certain group of organisms or metabolism, is used to answer the evidence for life and metabolic diversity questions.
Paleomagnetics is the study of the planet's ancient magnetic field. It is significant to understanding magnetofossils, biomineralization, and global ecosystem changes.
|
wikipedia
|
wiki_1974_chunk_34
|
Exterior algebra
|
where, if the characteristic of the base field K is 0, the alternation Alt of a multilinear map is defined to be the average of the sign-adjusted values over all the permutations of its variables: When the field K has finite characteristic, an equivalent version of the second expression without any factorials or any constants is well-defined: where here is the subset of (k,m) shuffles: permutations σ of the set such that , and . Interior product
|
wikipedia
|
wiki_1934_chunk_20
|
Eclipse (software)
|
Application lifecycle management
Application lifecycle management (ALM) and task management in Eclipse need an optional component called Mylyn (), an open-source implementation of the task-focused interface. It provides an API for tools embedding the task-focused interface. For software developers, it helps a developer work efficiently with many different tasks (such as bugs, problem reports or new features). Tasks are integrated into Mylyn. For all tasks that have been integrated, Mylyn monitors user activity and tries to identify information relevant to the task at hand. It uses this task context to focus the Eclipse UI on the related information. Mylyn can integrate with repositories such as Bugzilla, Trac, Redmine, Mantis, JIRA, Unfuddle, and GitHub. It focuses on improving productivity by reducing searching, scrolling, and navigation. By making task context explicit, Mylyn is also meant to facilitate multitasking, planning, reusing past efforts, and sharing expertise.
|
wikipedia
|
wiki_775_chunk_20
|
Shor's algorithm
|
Discrete logarithms
Given a group with order and generator , suppose we know that , for some , and we wish to compute , which is the discrete logarithm: . Consider the abelian group , where each factor corresponds to modular addition of values. Now, consider the function This gives us an abelian hidden subgroup problem, as corresponds to a group homomorphism. The kernel corresponds to the multiples of . So, if we can find the kernel, we can find . See also
GEECM, a factorization algorithm said to be "often much faster than Shor's"
Grover's algorithm
Peter Shor References
|
wikipedia
|
wiki_9991_chunk_1
|
JEL classification codes
|
Structure
There are 26 primary JEL categories: JEL Subcategories
Each JEL primary category has secondary and tertiary subcategories, for example, under JEL: D – Microeconomics:
JEL: D1 – Household Behavior and Family Economics
JEL: D11 – Consumer Economics: Theory
JEL code (sub)categories, including periodic updates, are referenced at Journal of Economic Literature (JEL) Classification System. Links to definitions of (sub)categories are at JEL Classification Codes Guide with corresponding examples of article titles linked to publication information, such as abstracts.
|
wikipedia
|
wiki_2604_chunk_20
|
Quine–McCluskey algorithm
|
Further reading
(viii+635 pages) (NB. This book was reprinted by Chin Jih in 1969.)
(47 pages)
(4 pages)
(7 pages)
(22 pages)
(16 pages) (NB. QCA, an open source, R based implementation used in the social sciences.)
|
wikipedia
|
wiki_32754_chunk_6
|
Medical simulation
|
The Council of Residency Directors (CORD) has established the following recommendations for simulation
Simulation is a useful tool for training residents and in ascertaining competency. The core competencies most conducive to simulation-based training are patient care, interpersonal skills, and systems based practice.
It is appropriate for performance assessment but there is a scarcity of evidence that supports the validity of simulation in the use for promotion or certification.
There is a need for standardization and definition in using simulation to evaluate performance.
Scenarios and tools should also be formatted and standardized such that EM educators can use the data and count on it for reproducibility, reliability and validity.
|
wikipedia
|
wiki_2443_chunk_55
|
Quantitative genetics
|
In previous sections, dispersive random fertilization (genetic drift) has been considered comprehensively, and self-fertilization and hybridizing have been examined to varying degrees. The diagram to the left depicts the first two of these, along with another "spatially based" pattern: islands. This is a pattern of random fertilization featuring dispersed gamodemes, with the addition of "overlaps" in which non-dispersive random fertilization occurs. With the islands pattern, individual gamodeme sizes (2N) are observable, and overlaps (m) are minimal. This is one of Sewall Wright's array of possibilities. In addition to "spatially" based patterns of fertilization, there are others based on either "phenotypic" or "relationship" criteria. The phenotypic bases include assortative fertilization (between similar phenotypes) and disassortative fertilization (between opposite phenotypes). The relationship patterns include sib crossing, cousin crossing and backcrossing—and are considered in a separate section. Self fertilization may be considered both from a spatial or relationship point of view.
|
wikipedia
|
wiki_22136_chunk_20
|
Simulation hypothesis
|
Testing the hypothesis physically
A method to test one type of simulation hypothesis was proposed in 2012 in a joint paper by physicists Silas R. Beane from the University of Bonn (now at the University of Washington, Seattle), and Zohreh Davoudi and Martin J. Savage from the University of Washington, Seattle. Under the assumption of finite computational resources, the simulation of the universe would be performed by dividing the continuum space-time into a discrete set of points. In analogy with the mini-simulations that lattice-gauge theorists run today to build up nuclei from the underlying theory of strong interactions (known as quantum chromodynamics), several observational consequences of a grid-like space-time have been studied in their work. Among proposed signatures is an anisotropy in the distribution of ultra-high-energy cosmic rays, that, if observed, would be consistent with the simulation hypothesis according to these physicists. In 2017, Campbell et al. proposed several experiments aimed at testing the simulation hypothesis in their paper "On Testing the Simulation Theory".
|
wikipedia
|
wiki_33865_chunk_6
|
Network Caller ID
|
Note A: RING means ring only, no Caller ID, no hangup. CID means Caller ID and simple hangup. FAX and VOICE mean their respective hangup options. Unless otherwise noted, the presence of VOICE indicates the modem will use the default NumberDisconnected.rmd (raw modem file) distributed with NCID.
Note B(1): Zoom and TRIXES. Prior to NCID version 0.89, FAX hangup was not a configurable option, and two blog/forum posts (here and here) have patches to add FAX hangup. Starting with NCID version 0.89, FAX hangup is now a configurable option so the patches are no longer necessary. The NCID developers have been unable to contact the author at Murphy 101 Blog to have the blog updated.
Note B(2): Zoom 3095 USB modems appear to be particularly sensitive to power levels. A common reported symptom is having to unplug and re-plug the modem into the USB port to get it to work. A more detailed discussion can be found here.
Note C: US Robotics 5637. Tested with Fedora, Raspberry Pi and Ubuntu. Connected to the UK British Telecom and US caller id systems. FAX hangup will not hangup the line, will disconnect the modem and will abort ncidd. Several users report problems using this modem with the Raspberry Pi in particular.
Note D: 3Com 3CP2976. Linux utility lspci reports "04:01.0 Serial controller: 3Com Corp, Modem Division 56K FaxModem Model 5610 (rev 01)".
Note E: Works on several Linux distros. Confirmed to work on Raspberry Pi 3 running Ubuntu Mate and Pi 3-B Raspbian Jessie—but does not work if the Raspberry power supply can't do 2 amps
Note F: Works on several Linux distros. Curiously, StarTech says it has a Conexant CX93010 chip, but the one tested responds with CX93001.
Note G: CallerID intentionally disabled by vendor in EEPROM patch. CallerID can be reenabled in any CX93001-based modem via simple RAM patch after ATZ command: AT!4886=00 for Bell FSK countries, AT!4886=01 for V23 FSK (Japan), AT!4886=02 for ETSI FSK (France, Italy, Spain), AT!4886=03 for SIN227 (UK), AT!4886=05 for ETSI DTMF. Sometimes additionally AT!4892=FF may be required.
|
wikipedia
|
wiki_1656_chunk_2
|
List of psychological research methods
|
Archival research
Case study – Although case studies are often included in 'research methods' pages, they are actually not a single research method. Case study methodology involves using a body of different research methods (e.g. interview, observation, self-report questionnaire). Researchers interpret what the data together mean for the area of study. So, case studies are a methodology, not a method.
Computer simulation (modeling)
Event sampling methodology, also referred to as experience sampling methodology (ESM), diary study, or ecological momentary assessment (EMA)
Experiment, often with separate treatment and control groups (see scientific control and design of experiments). See Experimental psychology for many details.
Field experiment
Interview, can be structured or unstructured.
Meta-analysis
Neuroimaging and other psychophysiological methods
Observational study, can be naturalistic (see natural experiment), participant or controlled.
Program evaluation
Quasi-experiment
Self-report inventory
Survey, often with a random sample (see survey sampling)
Twin study
Ethnography
Focus groups
|
wikipedia
|
wiki_3639_chunk_1
|
Statistics New Zealand
|
There are seven organisational subgroups each managed by a Deputy Government Statistician:
Macro-economic and Environment Statistics studies prices, national accounts, develops macro-economic statistics, does government and international accounts, and ANZSIC 06 implementation (facilitating changeover to new classification code developed jointly with Australian statistics officials.)
Social and Population Statistics studies population, social conditions, standard of living, census, and has a census planning manager as well as statisticians helping to develop new social statistics measures.
Standards and Methods studies statistical methods, statistical education and research, solutions and capabilities, information management, and develops new methodologies.
Collections and Dissemination services clients. There is one general manager in Christchurch and one in Auckland. It develops products and services, manages publishing and customer services.
Organisation Direction maintains contacts with key government officials, does internal audits and business planning, manages international relations and the Official Statistics System (OSS), and advises on Māori affairs.
Industry and Labour Statistics studies business indicators, finance and performance, agriculture, energy and work knowledge and skills.
Organisation Development focuses on services for the agency itself, including information technology management, quality assurance, application development and support, finances, corporate support, and human resources.
|
wikipedia
|
wiki_3588_chunk_3
|
Ecological fallacy
|
Consider the following numerical example:
Group A: 80% of people got 40 points and 20% of them got 95 points. The mean score is 51 points.
Group B: 50% of people got 45 points and 50% got 55 points. The mean score is 50 points.
If we pick two people at random from A and B, there are 4 possible outcomes:
A – 40, B – 45 (B wins, 40% probability – 0.8 × 0.5)
A – 40, B – 55 (B wins, 40% probability – 0.8 × 0.5)
A – 95, B – 45 (A wins, 10% probability – 0.2 × 0.5)
A – 95, B – 55 (A wins, 10% probability – 0.2 × 0.5)
Although Group A has a higher mean score, 80% of the time a random individual of A will score lower than a random individual of B.
|
wikipedia
|
wiki_1240_chunk_32
|
Lambert W function
|
where and are real distinct constants, the roots of the quadratic polynomial. Here, the solution is a function which has a single argument but the terms like and are parameters of that function. In this respect, the generalization resembles the hypergeometric function and the Meijer function but it belongs to a different class of functions. When , both sides of () can be factored and reduced to () and thus the solution reduces to that of the standard function. Equation () expresses the equation governing the dilaton field, from which is derived the metric of the or lineal two-body gravity problem in 1 + 1 dimensions (one spatial dimension and one time dimension) for the case of unequal rest masses, as well as the eigenenergies of the quantum-mechanical double-well Dirac delta function model for unequal charges in one dimension.
Analytical solutions of the eigenenergies of a special case of the quantum mechanical three-body problem, namely the (three-dimensional) hydrogen molecule-ion. Here the right-hand side of () is replaced by a ratio of infinite order polynomials in :
|
wikipedia
|
wiki_15814_chunk_2
|
Energy and Environmental Security Initiative
|
International Project on Energy Commitments and Compliance (IPECC)
IPECC is designed to improve and enhance the efforts of governments, non-governmental actors—such as corporations, non-governmental organizations, trade unions, churches—and key decision-makers throughout the world in two ways: First by evaluating the extent to which their existing commitments and pledges are actually working; and second, by facilitating new and better clean and affordable energy solutions. IPECC will provide the information needed to improve the effectiveness of existing commitments and encourage new commitments where necessary. It is designed to track and monitor the implementation of sustainable energy commitments undertaken by governments, corporations and other entities, and to provide detailed information on the extent to which they are being complied with. In doing so it will serve as a watchdog over what is and should be happening with respect to these instruments and the commitments they embody. IPECC
|
wikipedia
|
wiki_38790_chunk_25
|
Educational neuroscience
|
In the last 10 years, there has been an explosion of interest in the role of emotional abilities and characteristics in contributing to success in all aspects of life. The concept of Emotional Intelligence (EI) has gained wide recognition and is featured in the Foresight report on Mental Capital and Wellbeing. Some have made influential claims that EI is more important than conventional cognitive intelligence, and that it can more easily be enhanced. Systematic research has yet to provide much support for these claims, although EI has been found to be associated with academic success and there is some evidence that it may be of particular importance for groups at-risk of academic failure and social exclusion. In spite of the weak evidence base, there has been a focus on promoting the social and emotional competence, mental health and psychological wellbeing of children and young people, particularly in schools as the result of the investment in universal services, prevention and early intervention (e.g., the Social and Emotional Aspects of Learning (SEAL) project in the UK [DfES, 2005, 2007]).
|
wikipedia
|
wiki_17911_chunk_24
|
Belene Nuclear Power Plant
|
Environmental organizations Greenpeace, Friends of the Earth (Europe), Urgewald, Bankwatch, World Information Service on Energy and the Bulgarian NGO BeleNE! oppose the plant's construction, and have expressed the following concerns: negative effect on the tourist industry and the agriculture of northern Bulgaria
safety concerns over the use of nuclear technology
location in a seismic active zone
the expense of the project
risk of terrorist attack
problems with the transportation, procession and preservation of the nuclear waste
complete unnecessity of further nuclear power in the first place, as better options are available.
|
wikipedia
|
wiki_35544_chunk_2
|
Directorate General of Civil Aviation (India)
|
Registration of civil aircraft
Certification of airports
Licensing to pilots, aircraft maintenance engineers, air traffic controllers and flight engineers, and conducting examinations and checks for that purpose
Carrying out amendments to the Aircraft Act, the Aircraft Rules and the Civil Aviation Requirements for complying with the amendments to ICAO Annexes, and initiating proposals for amendment to any other Act or for passing a new Act in order to give effect to an international Convention or amendment to an existing convention.
Formulation of standards of airworthiness for civil aircraft registered in India and grant of certificates of airworthiness to such aircraft
Conducting investigation into incidents and serious incidents involving aircraft up to 2250 kg AUW and taking accident prevention measures, including formulation of implementation of Safety Aviation Management Programmes
Checks on the proficiency of flight crew and other operational personnel such as flight dispatchers and cabin crew
Coordination of ICAO matters with all agencies, sending replies to State letters, and taking all necessary action arising out of the Universal Safety Oversight Audit Programme (USOAP) of ICAO.
Granting Air Operator's Certificates to Indian carriers and regulation of air transport services operating to/from/within/over India by Indian and foreign operators, including clearance of scheduled and non-scheduled flights of such operators
Approval of institutes engaged in flying training including simulator training, AME training, air traffic services training or any other training related with aviation, with a view to ensuring a high quality of training
Approval to aircraft maintenance, repair, design and manufacturing organizations and their continued oversight
A nodal agency for implementing Annex 9 provisions in India and for coordinating matters relating to facilitation at Indian airports, including holding meetings of the National Facilitation Committee DGCA Organisation Manual
Rendering advice to the Government on matters relating to air transport including bilateral air services agreements, on ICAO matters and generally on all technical matters relating to civil aviation, and to act as an overall regulatory and developmental body for civil aviation in the country
Keeping a check on aircraft noise and engine emissions in accordance with ICAO Annex 16 and collaborating with the environmental authorities in this matter, if required
Regulation and oversight of matters related to Air Navigation Services. Coordination at national level for flexi-use of air space by civil and military air traffic agencies and interaction with ICAO for provision of more air routes for civil use through Indian airspace
Promoting indigenous design and manufacture of aircraft and aircraft components by acting as a catalytic agent
Approving training programmes of operators for carriage of dangerous goods, issuing authorizations for carriage of dangerous goods, etc.
Safety Oversight of all entities approved/ certified/ licensed under the Aircraft Rules 1937.
|
wikipedia
|
wiki_29911_chunk_5
|
Feature-oriented programming
|
GenVoca
GenVoca (a portmanteau of the names Genesis and Avoca) is a compositional paradigm for defining programs of product lines. Base programs are 0-ary functions or transformations called values: f -- base program with feature f
h -- base program with feature h and features are unary functions/transformations that elaborate (modify, extend, refine) a program: i + x -- adds feature i to program x
j + x -- adds feature j to program x where + denotes function composition. The design of a program is a named expression, e.g.:
|
wikipedia
|
wiki_217_chunk_22
|
Euclidean algorithm
|
Visualization
The Euclidean algorithm can be visualized in terms of the tiling analogy given above for the greatest common divisor. Assume that we wish to cover an a-by-b rectangle with square tiles exactly, where a is the larger of the two numbers. We first attempt to tile the rectangle using b-by-b square tiles; however, this leaves an r0-by-b residual rectangle untiled, where r0 < b. We then attempt to tile the residual rectangle with r0-by-r0 square tiles. This leaves a second residual rectangle r1-by-r0, which we attempt to tile using r1-by-r1 square tiles, and so on. The sequence ends when there is no residual rectangle, i.e., when the square tiles cover the previous residual rectangle exactly. The length of the sides of the smallest square tile is the GCD of the dimensions of the original rectangle. For example, the smallest square tile in the adjacent figure is 21-by-21 (shown in red), and 21 is the GCD of 1071 and 462, the dimensions of the original rectangle (shown in green).
|
wikipedia
|
wiki_28247_chunk_2
|
Time-utility function
|
Time/Utility Functions The TUF/UA paradigm was originally created to address certain action timeliness, predictability of timeliness, and application QoS-based scheduling needs of various military applications for which traditional real-time concepts and practices are not sufficiently expressive (e.g., for dynamically timeliness-critical systems not having deadlines) and load resilience (e.g., for systems subject to routine action overloads). An important common example class of such applications is missile defense (notionally).
|
wikipedia
|
wiki_2737_chunk_1
|
Eight-circuit model of consciousness
|
Overview
The first four circuits concern themselves with life on Earth, and the survival of the human species. The last four circuits are post-terrestrial, and concern themselves with the evolution of the human species as represented by so-called altered states of consciousness, enlightenment, mystical experiences, psychedelic states of mind, and psychic abilities. The proposal suggests that these altered states of consciousness are recently realized, but not widely utilized. Leary described the first four as "larval circuits", necessary for surviving and functioning in a terrestrial human society, and proposed that the post terrestrial circuits will be useful for future humans who, through a predetermined script, continue to act on their urge to migrate to outer space and live extra-terrestrially. Leary, Wilson, and Alli have written about the idea in-depth, and have explored and attempted to define how each circuit operates, both in the lives of individual people and in societies and civilizations.
|
wikipedia
|
wiki_5878_chunk_22
|
Computational sociology
|
Experimentation and evaluation
Any study or modelling when combined with experimentation needs to be able to address the questions being asked. Computational social science deals with large scale data and the challenge becomes much more evident as the scale grows. How would one design informative simulations on a large scale? And even if a large scale simulation is brought up, how is the evaluation supposed to be performed? Model choice and model complexities
Another challenge is identifying the models that would best fit the data and the complexities of these models. These models would help us predict how societies might evolve over time and provide possible explanations on how things work.
|
wikipedia
|
wiki_492_chunk_84
|
Quantum field theory
|
where is the gauge covariant derivative: where is the coupling constant, are the eight generators of in the fundamental representation ( matrices), and are the structure constants of . Repeated indices are implicitly summed over following Einstein notation. This Lagrangian is invariant under the transformation: where is an element of at every spacetime point :
|
wikipedia
|
wiki_7554_chunk_3
|
Biomedical Informatics Research Network
|
Its interdisciplinary team consists of computer scientists, engineers, physicians, biomedical researchers and other technical experts, including grid computing developers Carl Kesselman of USC ISI, and Ian Foster of Argonne National Laboratories. Co-Principal Investigators are:
Carl Kesselman, Ph.D., a professor in the University of Southern California (USC) Daniel J. Epstein Department of Industrial and Systems Engineering, and a Fellow of the Information Sciences Institute (ISI), its highest honor;
Ian Foster, Ph.D., director of the Computation Institute, a joint project between the University of Chicago and Argonne National Laboratory, and associate director of Argonne's Mathematics and Computer Science Division;
Steven G. Potkin, M.D., a professor in the Department of Psychiatry and Human Behavior at the University of California at Irvine (UCI) and Director of UCI's Brain Imaging Center;
Bruce R. Rosen, M.D., Ph.D., a professor of radiology at Harvard Medical School and Health Sciences and Technology at the Harvard-MIT Division of Health Sciences and Technology, and Director of the Athinoula A. Martinos Center for Biomedical Imaging at the Massachusetts General Hospital in Boston, MA;
Jonathan C. Silverstein, M.D., associate director and senior fellow at the University of Chicago-Argonne National Laboratory Computation Institute, and an associate professor of Surgery, Radiology and Biological Sciences at UC;
Arthur Toga, Ph.D., a professor in the University of Southern California.
|
wikipedia
|
wiki_104_chunk_26
|
Convention on Biological Diversity
|
Scientists working with biodiversity and medical research are expressing fears that the Nagoya Protocol is counterproductive, and will hamper disease prevention and conservation efforts, and that the threat of imprisonment of scientists will have a chilling effect on research. Non-commercial researchers and institutions such as natural history museums fear maintaining biological reference collections and exchanging material between institutions will become difficult, and medical researchers have expressed alarm at plans to expand the protocol to make it illegal to publicly share genetic information, e.g. via GenBank.
|
wikipedia
|
wiki_29823_chunk_11
|
GT-Power
|
Built-in QWK mail and QWK networking support (non-proprietary);
semi-configurable menus and prompts;
support for multiple message areas (ver. 12.10) and file areas (prior to ver. 12.00);
proprietary Netmail Suite with netmail and echomail support (ver. 13.00);
full-screen ANSI message editing;
CD-ROM file area support;
FILE.DIZ support for file uploads;
multinode capable, on a network or under multitasking software, such as DESQview or OS/2;
multinode CB chat (users can chat between nodes);
time banking;
threaded reading of messages;
Carbon-Copy list support in messages;
Return Receipt message support in netmail;
support for up to 999 external BBS door programs (ver. 19.00; doors introduced ver. 12.20);
mailboxes for private user-to-user mail exchange (ver. 19.00);
variable substitution and @ macros for bulletin and menu files;
user-configurable multiple language support;
user-configurable questionnaire/voting booth functions (ver. 12.20);
user-configurable automatic virus scan of uploaded files;
the ability to set up "freebie" file downloads and file areas;
user-configurable access levels and controls (introduced before ver. 12.00);
a task scheduler, for scheduling daily maintenance, etc. (ver. 13.00);
two distinct varieties of RINGBACK service, one of which allows sysops to run a BBS on a voice line (ver. 13.00);
a user maintenance program, called SYSOP (ver. 15.00);
the ability to accept a "hand-off" from front-end programs, such as Binkleyterm.
|
wikipedia
|
wiki_758_chunk_9
|
Simple Network Management Protocol
|
GetRequest A manager-to-agent request to retrieve the value of a variable or list of variables. Desired variables are specified in variable bindings (the value field is not used). Retrieval of the specified variable values is to be done as an atomic operation by the agent. A Response with current values is returned.
SetRequest A manager-to-agent request to change the value of a variable or list of variables. Variable bindings are specified in the body of the request. Changes to all specified variables are to be made as an atomic operation by the agent. A Response with (current) new values for the variables is returned.
GetNextRequest A manager-to-agent request to discover available variables and their values. Returns a Response with variable binding for the lexicographically next variable in the MIB. The entire MIB of an agent can be walked by iterative application of GetNextRequest starting at OID 0. Rows of a table can be read by specifying column OIDs in the variable bindings of the request.
GetBulkRequest A manager-to-agent request for multiple iterations of GetNextRequest. An optimized version of GetNextRequest. Returns a Response with multiple variable bindings walked from the variable binding or bindings in the request. PDU specific non-repeaters and max-repetitions fields are used to control response behavior. GetBulkRequest was introduced in SNMPv2.
Response Returns variable bindings and acknowledgement from agent to manager for GetRequest, SetRequest, GetNextRequest, GetBulkRequest and InformRequest. Error reporting is provided by error-status and error-index fields. Although it was used as a response to both gets and sets, this PDU was called GetResponse in SNMPv1.
Asynchronous notification from agent to manager. While in other SNMP communication, the manager actively requests information from the agent, these are PDUs that are sent from the agent to the manager without being explicitly requested. SNMP traps enable an agent to notify the management station of significant events by way of an unsolicited SNMP message. Trap PDUs include current sysUpTime value, an OID identifying the type of trap and optional variable bindings. Destination addressing for traps is determined in an application-specific manner typically through trap configuration variables in the MIB. The format of the trap message was changed in SNMPv2 and the PDU was renamed SNMPv2-Trap.
Acknowledged asynchronous notification. This PDU was introduced in SNMPv2 and was originally defined as manager to manager communication. Later implementations have loosened the original definition to allow agent to manager communications. Manager-to-manager notifications were already possible in SNMPv1 using a Trap, but as SNMP commonly runs over UDP where delivery is not assured and dropped packets are not reported, delivery of a Trap was not guaranteed. InformRequest fixes this as an acknowledgement is returned on receipt.
|
wikipedia
|
wiki_8143_chunk_4
|
Topological graph theory
|
Example studies
John Hopcroft and Robert Tarjan derived a means of testing the planarity of a graph in time linear to the number of edges. Their algorithm does this by constructing a graph embedding which they term a "palm tree". Efficient planarity testing is fundamental to graph drawing.
|
wikipedia
|
wiki_27559_chunk_7
|
Computer Science (UIL)
|
Official UIL Rules for Computer Science--High School NOTE: This file contains rules for other competitions; Section 928 covers Computer Science.
Study materials from Mike Scott, previous Comp Sci UIL director NOTE: This link contains study materials from Mike Scott, the previous UIL CS director.
2010-2011 Topic List for CS UIL NOTE: This link contains study materials from Mike Scott, the previous UIL CS director.
University Interscholastic League
|}
|
wikipedia
|
wiki_1392_chunk_3
|
Network mapping
|
Graph theory can be used to better understand maps of the internet and to help choose between the many ways to visualize internet maps. Some projects have attempted to incorporate geographical data into their internet maps (for example, to draw locations of routers and nodes on a map of the world), but others are only concerned with representing the more abstract structures of the internet, such as the allocation, structure, and purpose of IP space. Enterprise network mapping
|
wikipedia
|
wiki_3755_chunk_3
|
Function object
|
In C and C++
Consider the example of a sorting routine that uses a callback function to define an ordering relation between a pair of items. The following C program uses function pointers: #include <stdlib.h>
|
wikipedia
|
wiki_11176_chunk_15
|
Boolean-valued model
|
Boolean-valued models and generic objects over countable transitive models
One interpretation of forcing starts with a countable transitive model M of ZF set theory, a partially ordered set P, and a "generic" subset G of P, and constructs a new model of ZF set theory from these objects. (The conditions that the model be countable and transitive simplify some technical problems, but are not essential.) Cohen's construction can be carried out using Boolean-valued models as follows.
Construct a complete Boolean algebra B as the complete Boolean algebra "generated by" the poset P.
Construct an ultrafilter U on B (or equivalently a homomorphism from B to the Boolean algebra {true, false}) from the generic subset G of P.
Use the homomorphism from B to {true, false} to turn the Boolean-valued model MB of the section above into an ordinary model of ZF.
|
wikipedia
|
wiki_15712_chunk_1
|
Programming and Metaprogramming in the Human Biocomputer
|
Summary
The term human biocomputer, coined by Lilly, refers to the "hardware" of the human anatomy. This would include the brain, internal organs, and other human organ systems such as cardiovascular, digestive, endocrine, immune, integumentary, lymphatic, muscular, nervous, reproductive, respiratory, skeletal, and urinary systems. The biocomputer has stored program properties, and self-metaprogramming properties, with limits determinable and to be determined. Definitions
The following definitions are used in the book:
|
wikipedia
|
wiki_2151_chunk_61
|
D (programming language)
|
DustMite is a powerful tool for minimizing D source code, useful when finding compiler or tests issues. dub is a popular package and build manager for D applications and libraries, and is often integrated into IDE support. Examples Example 1
This example program prints its command line arguments. The main function is the entry point of a D program, and args is an array of strings representing the command line arguments. A string in D is an array of characters, represented by immutable(char)[]. import std.stdio: writefln;
|
wikipedia
|
wiki_3292_chunk_22
|
Π-calculus
|
Early and late bisimilarity Early and late bisimilarity were both formulated by Milner, Parrow and Walker in their original paper on the -calculus. A binary relation over processes is an early bisimulation if for every pair of processes ,
whenever then for every name there exists some such that and ;
for any non-input action , if then there exists some such that and ;
and symmetric requirements with and interchanged. Processes and are said to be early bisimilar, written if the pair for some early bisimulation .
|
wikipedia
|
wiki_564_chunk_82
|
Software testing
|
It has been proved that each class is strictly included in the next. For instance, testing when we assume that the behavior of the implementation under test can be denoted by a deterministic finite-state machine for some known finite sets of inputs and outputs and with some known number of states belongs to Class I (and all subsequent classes). However, if the number of states is not known, then it only belongs to all classes from Class II on. If the implementation under test must be a deterministic finite-state machine failing the specification for a single trace (and its continuations), and its number of states is unknown, then it only belongs to classes from Class III on. Testing temporal machines where transitions are triggered if inputs are produced within some real-bounded interval only belongs to classes from Class IV on, whereas testing many non-deterministic systems only belongs to Class V (but not all, and some even belong to Class I). The inclusion into Class I does not require the simplicity of the assumed computation model, as some testing cases involving implementations written in any programming language, and testing implementations defined as machines depending on continuous magnitudes, have been proved to be in Class I. Other elaborated cases, such as the testing framework by Matthew Hennessy under must semantics, and temporal machines with rational timeouts, belong to Class II.
|
wikipedia
|
wiki_26493_chunk_115
|
Comparison of programming languages (associative array)
|
id anObject = [aDictionary valueForKeyPath:@"students.Sally Smart"]; OCaml
The OCaml programming language provides three different associative containers. The simplest is a list of pairs:
|
wikipedia
|
wiki_30881_chunk_5
|
Sustainable engineering
|
Accomplishments from 1992 to 2002
The World Engineering Partnership for Sustainable Development (WEPSD) was formed and they are responsible for the following areas: redesign engineering responsibilities and ethic to sustainable development, analyze and develop a long-term plan, find solution by exchanging information with partners and using new technologies, and solve the critical global environment problems, such as fresh water and climate change
CASI Global was formed mainly as a platform for corporates and governments to share best practices; with a mission to promote the cause and knowledge of csr & sustainability. Thousands of corporates and colleges across the world are now a part of CASI Global with a view to support this mission. CASI also offers Global Fellow programs on finance / operations / manufacturing / supply chain / etc. with a dual specialization in Sustainability. The idea is every professional has inculcate sustainability within their core function & industry. http://www.casiglobal.us/
Developed environmental policies, codes of ethics, and sustainable development guidelines
Earth Charter was restarted as a civil society initiative
The World Bank, United Nations Environmental Program, and the Global Environment Facility joined programs for sustainable development
Launched programs for engineering students and practicing engineers on how to apply sustainable development concepts in their work
Developed new approaches in industrial processes
|
wikipedia
|
wiki_2156_chunk_2
|
The Futurological Congress
|
Plot summary
Ijon Tichy is sent to the Eighth World Futurological Congress in Costa Rica by professor Tarantoga. The conference is set to focus on the world's overpopulation crisis and ways of dealing with it. It is held at the Costa Rica Hilton in Nounas, which is 164 stories tall. Lem is fiercely satirical from the start, and absurdities abound at the Hilton with its guaranteed "BOMB-FREE" rooms and the extravagances of Tichy's suite, which include a palm grove and an "all-girl orchestra [that] played Bach while performing a cleverly choreographed striptease".
|
wikipedia
|
wiki_446_chunk_12
|
Psychological statistics
|
Multivariate Behavioral Research
Multivariate behavioral research is becoming very popular in psychology. These methods include Multiple Regression and Prediction; Moderated and Mediated Regression Analysis; Logistics Regression; Canonical Correlations; Cluster analysis; Multi-level modeling; Survival-Failure analysis; Structural Equations Modeling; hierarchical linear modelling, etc. are very useful for psychological statistics. Journals for statistical application for psychology
There are many specialized journals that publish advances in statistical analysis for psychology:
|
wikipedia
|
wiki_22264_chunk_2
|
Process-oriented programming
|
Some derivations have evolved from the message passing paradigm of Occam to enable uniform efficiency when porting applications between distributed memory and shared memory parallel computers . The first such derived example appears in the programming language Ease designed at Yale University in 1990. Similar models have appeared since in the loose combination of SQL databases and objected oriented languages such as Java, often referred to as object-relational models and widely used in large scale distributed systems today. The paradigm is likely to appear on desktop computers as microprocessors increase the number of processors (multicore) per chip.
|
wikipedia
|
wiki_13634_chunk_2
|
Epistemic modal logic
|
Standard possible worlds model
Most attempts at modeling knowledge have been based on the possible worlds model. In order to do this, we must divide the set of possible worlds between those that are compatible with an agent's knowledge, and those that are not. This generally conforms with common usage. If I know that it is either Friday or Saturday, then I know for sure that it is not Thursday. There is no possible world compatible with my knowledge where it is Thursday, since in all these worlds it is either Friday or Saturday. While we will primarily be discussing the logic-based approach to accomplishing this task, it is worthwhile to mention here the other primary method in use, the event-based approach. In this particular usage, events are sets of possible worlds, and knowledge is an operator on events. Though the strategies are closely related, there are two important distinctions to be made between them:
The underlying mathematical model of the logic-based approach are Kripke semantics, while the event-based approach employs the related Aumann structures based on set theory.
In the event-based approach logical formulas are done away with completely, while the logic-based approach uses the system of modal logic.
Typically, the logic-based approach has been used in fields such as philosophy, logic and AI, while the event-based approach is more often used in fields such as game theory and mathematical economics. In the logic-based approach, a syntax and semantics have been built using the language of modal logic, which we will now describe.
|
wikipedia
|
wiki_1145_chunk_13
|
Poker probability
|
{| class="wikitable" style="font-size: 95%;"
|-
!Hand !! Distinct hands !! Frequency !! Probability !! Cumulative !! Odds against
|-
| 5-high ||align=right| 1 ||align=right| 1,024 || 0.0394% || 0.0394% ||align=right| 2,537.05 : 1
|-
| 6-high ||align=right| 5 ||align=right| 5,120 || 0.197% || 0.236% ||align=right| 506.61 : 1
|-
| 7-high ||align=right| 15 ||align=right| 15,360 || 0.591% || 0.827% ||align=right| 168.20 : 1
|-
| 8-high ||align=right| 35 ||align=right| 35,840 || 1.38% || 2.21% ||align=right| 71.52 : 1
|-
| 9-high ||align=right| 70 ||align=right| 71,680 || 2.76% || 4.96% ||align=right| 35.26 : 1
|-
| 10-high ||align=right| 126 ||align=right| 129,024 || 4.96% || 9.93% ||align=right| 19.14 : 1
|-
| Jack-high ||align=right| 210 ||align=right| 215,040 || 8.27% || 18.2% ||align=right| 11.09 : 1
|-
| Queen-high ||align=right| 330 ||align=right| 337,920 || 13.0% || 31.2% ||align=right| 6.69 : 1
|-
| King-high ||align=right| 495 ||align=right| 506,880 || 19.5% || 50.7% ||align=right| 4.13 : 1
|-
|Total ||align=right|1,287 ||align=right|1,317,888 || 50.7% || 50.7% ||align=right| 0.97 : 1
|}
|
wikipedia
|
wiki_9359_chunk_14
|
Computer-aided production engineering
|
There have been many efforts over the years to develop information models for different
aspects of manufacturing, but no known existing model fully meets the needs of a CAPE ernviroment. Therefore, a life cycle approach is needed to identify the different processes that a CAPE environment must support, and must define all phases of a manufacturing system or subsystem's existence. Some of the major phases which may be included in a system life cycle approach are, requirements identification; system design specification; vendor selection; system development and upgrades; installation, testing, and training; and benchmarking of production operations.
|
wikipedia
|
wiki_14_chunk_34
|
Ada (programming language)
|
begin
Ada.Text_IO.Put_Line ( "The total is: " & Number'Image(j) );
j := Next (j);
end Print_and_Increment; -- package initialization executed when the package is elaborated
begin
while i < Number'Last loop
Print_and_Increment (i);
end loop;
end Example;
This program can be compiled, e.g., by using the freely available open-source compiler GNAT, by executing
gnatmake -z example.adb
|
wikipedia
|
wiki_2514_chunk_23
|
Code name
|
AMD have also been naming their CPUs since 90 nm generations under the K8 micro-architecture after the name of cities around the world. For the CPUs under the Phenom brand, the names of stars were used as code names. For Opteron server CPUs and platforms, cities related to the Ferrari Formula One team were used. Mobile platforms are named after birds (except for Puma). For example:
Single-core Athlon 64 and Athlon 64 FX : Newcastle, Venice, San Diego and Lima
Dual-core Athlon 64 X2 and Athlon 64 FX: Manchester, Toledo, Windsor and Brisbane
Phenom CPUs: Agena (Beta Centauri), Toliman (Alpha Centauri), Kuma (Nu Draconis), Deneb (Alpha Cygni), Propus (Eta Geminorum), Heka (Lambda Orionis), Rana (Delta Eridani), Regor (Gamma Velorum)
Opteron CPUs: Barcelona, Shanghai, São Paulo, Istanbul
Server platforms: Catalunya, Fiorano, Maranello
Mobile CPUs: Griffin, Lion, Swift
Mobile platforms: Kite, Puma, Shrike, Eagle
Apple currently names the major releases of macOS (previously known as Mac OS X) after major California landmarks, such as Mavericks (10.9), Yosemite (10.10), El Capitan (10.11), Sierra (10.12 ), High Sierra (10.13) Mojave (10.14), Catalina (10.15), Big Sur (11.0) and Monterey (12.0). Previous releases were named after big cats: Cheetah (10.0), Puma (10.1), Jaguar (10.2), Panther (10.3), Tiger (10.4), Leopard (10.5), Snow Leopard (10.6), Lion (10.7), and Mountain Lion (10.8). Other former codenames include:
Composers, such as Copland, after composer Aaron Copland; and Gershwin, after George Gershwin.
Women's names, e.g. Jennifer (rumored for the Macintosh IIx), and Lisa.
Varieties of apples, including Cortland for the Apple IIgs, and Macintosh (from McIntosh).
Carl Sagan, which was used for the Power Macintosh 7100 while it was under development. In 1994 astronomer Carl Sagan filed two lawsuits against Apple related to that usage, and lost both, reaching an out-of-court settlement with the company.
Intel often names CPU projects after rivers in the American West, particularly in the state of Oregon (where most of Intel's CPU projects are designed). Examples include Willamette, Deschutes, Yamhill, Tualatin, and Clackamas. See List of Intel codenames.
Microsoft often names projects (in particular, versions of the Microsoft Windows operating systems) after place names. Examples include Chicago (Windows 95), Daytona (Windows NT 3.5), Memphis (Windows 98), Whistler (Windows XP) and Longhorn (Windows Vista).
For a period of time, Mozilla used code names which are mostly named after national parks to reference different versions of the Mozilla Firefox browser:
Firefox 2.0: Bon Echo
Firefox 3.0: Gran Paradiso
Firefox 3.5: Shiretoko
Firefox 3.6: Namoroka
Firefox 4.0: Tumucumaque
Firefox pre-beta: Aurora
Firefox trunk builds: Nightly
Nintendo often uses code names for new consoles. The best-known is that of Wii, which was code-named Revolution for over a year. Others include the GameCube's code name of Dolphin, the Game Boy Advance's code name of Atlantis, the Nintendo 64 as Project Reality, the DS code name Project Nitro, the Game Boy Micro code name Oxygen, the Wii U code name Project Cafe, and Nintendo's latest console Nintendo Switch as NX.
Return of the Jedi was code-named "Blue Harvest" while in production and principal photography. This was reportedly to prevent disruption by fans and the media as well as to avoid price gouging by local merchants and vendors.
The Chamber of Secrets sequel of the Harry Potter film series was code-named "Incident of 57th Street" to disguise the production from its increasingly rabid fanbase, who would seek out filming locations and disrupt production.
|
wikipedia
|
wiki_25063_chunk_7
|
Purely functional data structure
|
Examples
Here is a list of abstract data structures with purely functional implementations:
Stack (first in, last out) implemented as a singly linked list,
Queue, implemented as a real-time queue,
Double-ended queue, implemented as a real-time double-ended queue,
(Multi)set of ordered elements and map indexed by ordered keys, implemented as a red–black tree, or more generally by a search tree,
Priority queue, implemented as a Brodal queue
Random access list, implemented as a skew-binary random access list
Hash consing
Zipper (data structure)
|
wikipedia
|
wiki_2015_chunk_27
|
Computer Go
|
Design philosophies
The only choice a program needs to make is where to place its next stone. However, this decision is made difficult by the wide range of impacts a single stone can have across the entire board, and the complex interactions various stones' groups can have with each other. Various architectures have arisen for handling this problem. The most popular use:
some form of tree search,
the application of Monte Carlo methods,
the application of pattern matching,
the creation of knowledge-based systems, and
the use of machine learning.
Few programs use only one of these techniques exclusively; most combine portions of each into one synthetic system.
|
wikipedia
|
wiki_5688_chunk_2
|
Statement (computer science)
|
assignment
Fortran: variable = expression
Pascal, Algol 60, Ada: variable := expression;
C, C#, C++, PHP, Java: variable = expression;
call
Fortran: CALL subroutine name(parameters)
C, C++, Java, PHP, Pascal, Ada: subroutine name(parameters);
assertion
C, C++, PHP: assert(relational expression);
Java: assert relational expression;
goto
Fortran: GOTO numbered-label
Algol 60: goto label;
C, C++, PHP, Pascal: goto label;
return
Fortran: RETURN value
C, C++, Java, PHP: return value;
|
wikipedia
|
wiki_29746_chunk_1
|
Symposium on Theoretical Aspects of Computer Science
|
STACS proceedings from 1984 to 2007 have been published by Springer Science+Business Media in the Lecture Notes in Computer Science series. The proceedings since 2008 are published by the Leibniz Center for Informatics in the open access series Leibniz International Proceedings in Informatics. The proceedings since are freely available from the conference portal, as well as from DROPS, the Dagstuhl Research Online Publication Server, and from Hyper Articles en Ligne. The conference is indexed by several bibliographic databases, including the DBLP, Google Scholar and The Collection of Computer Science Bibliographies.
|
wikipedia
|
wiki_29444_chunk_12
|
Anki (software)
|
Medical education
Anki is quickly becoming an important resource for many medical students in the US. A study in 2015 at Washington University School of Medicine found that 31% of students who responded to a medical education survey reported using Anki as a study resource. The same study found a positive relationship between the number of unique Anki cards studied and USMLE Step 1 scores in a multi-variate analysis. Some third-party resources, such as Boards and Beyond, have Anki decks based on them.
|
wikipedia
|
wiki_36882_chunk_24
|
Behavioural genetics
|
When described on the metric, the effects of individual genetic variants on complex human behavioural traits and disorders are vanishingly small, with each variant accounting for of variation in the phenotype. This fact has been discovered primarily through genome-wide association studies of complex behavioural phenotypes, including results on substance use, personality, fertility, schizophrenia, depression, and endophenotypes including brain structure and function. There are a small handful of replicated and robustly studied exceptions to this rule, including the effect of APOE on Alzheimer's disease, and CHRNA5 on smoking behaviour, and ALDH2 (in individuals of East Asian ancestry) on alcohol use.
|
wikipedia
|
wiki_27593_chunk_2
|
Document engineering
|
For example, principles of document engineering were applied in the development of the OASIS Universal Business Language. A simple application is where a customer purchases something online. A purchase involves three different business collaborations: between the customer and the online catalog to select the right item, between the retail shop and a credit card authorization service for verification and to charge the customer account, and finally between the retail shop and delivery service in order to ensure the item is delivered to the customer. In order to actualize these internet information exchanges, document engineering addresses the analysis, design, representation, and implementation of the information involved in each step.
|
wikipedia
|
wiki_16523_chunk_14
|
Analogical modeling
|
Analyzing the subcontexts in the table above, we see that there is only 1 subcontext with any disagreements: "3 1 ", which in the dataset consists of "3 1 0 e" and "3 1 1 r". There are 2 disagreements in this subcontext; 1 pointing from each of the exemplars to the other (see the pointer network pictured above). Therefore, only supracontexts containing this subcontext will contain any disagreements. We use a simple rule to identify the homogeneous supracontexts:
If the number if disagreements in the supracontext is greater than the number of disagreements in the contained subcontext, we say that it is heterogeneous; otherwise, it is homogeneous.
There are 3 situations that produce a homogeneous supracontext:
The supracontext is empty. This is the case for "3 - 2", which contains no data points. There can be no increase in the number of disagreements, and the supracontext is trivially homogeneous.
The supracontext is deterministic, meaning that only one type of outcome occurs in it. This is the case for "- 1 2" and "- - 2", which contain only data with the r outcome.
Only one subcontext contains any data. The subcontext does not have to be deterministic for the supracontext to be homogeneous. For example, while the supracontexts "3 1 -" and "- 1 2" are deterministic and only contain one non-empty subcontext, "3 - -" contains only the subcontext "3 1 ". This subcontext contains "3 1 0 e" and "3 1 1 r", making it non-deterministic. We say that this type of supracontext is unobstructed and non-deterministic.
|
wikipedia
|
wiki_30780_chunk_1
|
Sheffield Software Engineering Observatory
|
The Software Engineering Observatory is an empirical software engineering research facility where researchers can use a variety of methodologies to study software developers working on real industrial projects. The software developers are students, both undergraduate and postgraduate and up to 20 group projects were undertaken each year. Thus, researchers can investigate how software developers work in teams, deal with industrial clients and handle the plethora of problems that arise in group projects with tight time-scales.
A key feature is that the Observatory allows multiple teams to work on identical projects concurrently in competition with each other, which allows comparisons to be made of different software development processes.
The Observatory enables researchers to gather data that are relevant to many of the key issues in contemporary software engineering, which will be of interest to both academics and practitioners. The implications of the results so far are that effective software managers must not just understand the technical aspects of the work that their staff are doing, but must also understand their staff as individuals and how they can best work together in teams.
|
wikipedia
|
wiki_20125_chunk_1
|
Igusa zeta function
|
In this situation one associates to a non-constant polynomial the Igusa zeta function where and dx is Haar measure so normalized that has measure 1. Igusa's theorem
showed that is a rational function in . The proof uses Heisuke Hironaka's theorem about the resolution of singularities. Later, an entirely different proof was given by Jan Denef using p-adic cell decomposition. Little is known, however, about explicit formulas. (There are some results about Igusa zeta functions of Fermat varieties.)
|
wikipedia
|
wiki_34540_chunk_9
|
Error correction model
|
VECM
The Engle–Granger approach as described above suffers from a number of weaknesses. Namely it is restricted to only a single equation with one variable designated as the dependent variable, explained by another variable that is assumed to be weakly exogeneous for the parameters of interest. It also relies on pretesting the time series to find out whether variables are I(0) or I(1). These weaknesses can be addressed through the use of Johansen's procedure. Its advantages include that pretesting is not necessary, there can be numerous cointegrating relationships, all variables are treated as endogenous and tests relating to the long-run parameters are possible. The resulting model is known as a vector error correction model (VECM), as it adds error correction features to a multi-factor model known as vector autoregression (VAR). The procedure is done as follows:
|
wikipedia
|
wiki_12097_chunk_13
|
Computational immunology
|
This development would lead to the development of an algorithm which would help to identify the conserved regions of pathogen sequences and in turn would be useful for vaccine development. This would be helpful in limiting the spread of infectious disease. Examples include a method for identification of vaccine targets from protein regions of conserved HLA binding and computational assessment of cross-reactivity of broadly neutralizing antibodies against viral pathogens. These examples illustrate the power of immunoinformatics applications to help solve complex problems in public health. Immunoinformatics could accelerate the discovery process dramatically and potentially shorten the time required for vaccine development. Immunoinformatics tools have been used to design the vaccine against SARS-CoV-2, Dengue virus and Leishmania.
|
wikipedia
|
wiki_4390_chunk_20
|
Quantum algorithm
|
The triangle-finding problem is the problem of determining whether a given graph contains a triangle (a clique of size 3). The best-known lower bound for quantum algorithms is Ω(N), but the best algorithm known requires O(N1.297) queries, an improvement over the previous best O(N1.3) queries. Formula evaluation
A formula is a tree with a gate at each internal node and an input bit at each leaf node. The problem is to evaluate the formula, which is the output of the root node, given oracle access to the input.
|
wikipedia
|
wiki_990_chunk_19
|
Grover's algorithm
|
Quantum partial search
A modification of Grover's algorithm called quantum partial search was described by Grover and Radhakrishnan in 2004. In partial search, one is not interested in finding the exact address of the target item, only the first few digits of the address. Equivalently, we can think of "chunking" the search space into blocks, and then asking "in which block is the target item?". In many applications, such a search yields enough information if the target address contains the information wanted. For instance, to use the example given by L. K. Grover, if one has a list of students organized by class rank, we may only be interested in whether a student is in the lower 25%, 25–50%, 50–75% or 75–100% percentile.
|
wikipedia
|
wiki_3206_chunk_1
|
Codex Leicester
|
The Codex provides an insight into the inquiring mind of the definitive Renaissance artist, scientist and thinker, as well as an exceptional illustration of the link between art and science and the creativity of the scientific process. Overview
The notebook is leather-bound and consists of 36 sheets 29 × 22 cm in size. The manuscript does not take the form of a single linear script, but is rather a mixture of Leonardo's observations and theories on astronomy; the properties of water, rocks, and fossils; air, and celestial light. The topics addressed include:
|
wikipedia
|
wiki_35900_chunk_0
|
Proofs involving ordinary least squares
|
The purpose of this page is to provide supplementary materials for the ordinary least squares article, reducing the load of the main article with mathematics and improving its accessibility, while at the same time retaining the completeness of exposition. Derivation of the normal equations
Define the th residual to be Then the objective can be rewritten
|
wikipedia
|
wiki_34883_chunk_10
|
Improving Access to Psychological Therapies
|
A Payment by Results system is being developed for IAPT, whereby each local Clinical Commissioning Group can reward each local provider according to various targets met for the service and for each client – particularly for how much change in scores on the self-report questionnaires.
The March 2021 issue of the British Journal of Clinical Psychology has highlighted the considerable controversy over IAPT's claims of success, Scott( 2021)26 https://dx.doi.org/10.1111%2Fbjc.12264 and Kellett et al., (2021)27 have responded with their own commentary ‘The costs and benefits of practice-based evidence: Correcting some misunderstandings about the 10-year meta-analysis of IAPT studies’
|
wikipedia
|
wiki_35261_chunk_2
|
Institute for Computational Sustainability
|
The NSF Expeditions in Computing grant supporting ICS has the following goals: To inject Computational Thinking into Sustainability that will provide:
new insights into sustainability questions;
new challenges and new methodologies in Computer Science (analogous to Computational Biology).
To establish a new field, Computational Sustainability:
Focused on computational methods for balancing environmental, economic, and societal needs for a sustainable future.
To establish the Institute for Computational Sustainability (ICS) in order to:
Perform and foster research in Computational Sustainability
Establish a vibrant research community, reaching far beyond the participating members of this Expedition. NSF support
|
wikipedia
|
wiki_24180_chunk_7
|
Lord Francis Powerscourt
|
Death of an Elgin Marble (publication 2014)
The British Museum in Bloomsbury is home to one of the Caryatids, a statue of a maiden that acted as one of the six columns in a temple which stood on the Acropolis in ancient Athens. Lord Elgin had brought her to London in the nineteenth century, and even though now she was over 2,300 years old, she was still rather beautiful - and desirable.
Which is why Lord Francis Powerscourt finds himself summoned by the British Museum to attend a most urgent matter. The Caryatid has been stolen and an inferior copy left in her place. Powerscourt agrees to handle the case discreetly - but then comes the first death: an employee of the British Museum is pushed under a rush hour train before he and the police can question him.
What had he known about the statue's disappearance? And who would want such a priceless object? Powerscourt and his friend Johnny Fitzgerald undertake a mission that takes them deep into the heart of London's Greek community and the upper echelons of English society to uncover the bizarre truth of the vanishing lady...
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.