id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_8051_chunk_7
|
Smith–Waterman algorithm
|
Let and be the sequences to be aligned, where and are the lengths of and respectively.
Determine the substitution matrix and the gap penalty scheme.
- Similarity score of the elements that constituted the two sequences
- The penalty of a gap that has length
Construct a scoring matrix and initialize its first row and first column. The size of the scoring matrix is . The matrix uses 0-based indexing.
Fill the scoring matrix using the equation below.
where
is the score of aligning and ,
is the score if is at the end of a gap of length ,
is the score if is at the end of a gap of length ,
means there is no similarity up to and .
Traceback. Starting at the highest score in the scoring matrix and ending at a matrix cell that has a score of 0, traceback based on the source of each score recursively to generate the best local alignment.
|
wikipedia
|
wiki_8059_chunk_8
|
Tufts University School of Engineering
|
Bioengineering (M.S.)
Biomedical Engineering (Certificate, M.S., Ph.D.)
Biotechnology Engineering (Certificate, Ph.D.)
Chemical and Biological Engineering (M.S., Ph.D.)
Civil and Environmental Engineering (Certificate, M.S., Ph.D.)
Cognitive Science (Joint Ph.D.)
Computer Engineering (Certificate, M.S.)
Computer Science (Certificate, M.S., Ph.D., Post-baccalaureate)
Cybersecurity and Public Policy (M.S.)
Data Science (Certificate, M.S.)
Electrical Engineering (M.S.)
Electrical and Computer Engineering (P.h.D.)
Engineering Education (Certificate)
Engineering Management (M.S.)
Environmental Management (Certificate)
Human Factors Engineering (M.S.)
Human Factors in Medical Devices and Systems (Certificate)
Human-Computer Interaction (Certificate)
Human-Robot Interaction (M.S., joint Ph.D.)
Innovation and Management (M.S.)
Manufacturing Engineering (Certificate)
Materials Science and Engineering (M.S., joint Ph.D.)
Mechanical Engineering (M.S., Ph.D.)
Microwave and Wireless Engineering (Certificate)
Offshore Wind Energy Engineering (M.S.)
Software Systems Engineering (M.S.)
|
wikipedia
|
wiki_27426_chunk_2
|
Priyadarshini Engineering College
|
Central Library in an area of 1114 sq.m. The library has 48,652 books with 11,087 titles. The library subscribes to 65 national and 61 international journals, eight magazines, and six newspapers. It contains 1524 back volumes of journals and 243 CD ROM's. Books are classified and arranged according to the Universally Decimal Classification (UDC) scheme. The library has an institutional membership with the DELNET access. The library subscribed e–resources are available per AICTE MANDATORY subscribing IEEE, and ASME. In addition to this, departments have their own departmental library. All students of management studies are provided with four news papers daily. These are: Business Line, Business Standard, Economic Times and Financial Express. The online Public Access catalogue (OPAC) is available. The college intends to provide the NPTEL (National Program Technology Enhanced Learning) through online web and web video courses in engineering and humanities stream.
|
wikipedia
|
wiki_36045_chunk_2
|
Energy rebate program
|
History In the past, data center designers and operators focused more on data center reliability than on energy efficiency. Equipment cooling concerns and the costs of water cooled infrastructure in large scale IBM centers, for instance, was a significant, though secondary issue, in buying decisions. Increasingly data center power density is leading to power and cooling limitations, companies have significant interest in energy efficiency as a potential solution to data center issues. Customers are searching to justify their costs on annual electricity costs, cooling costs, and power costs. Utilizing energy efficient equipment and testing results of your data center enable companies to pin point where potential cost-cutting procedures can take place.
|
wikipedia
|
wiki_26493_chunk_175
|
Comparison of programming languages (associative array)
|
- val m = StringMap.insert (StringMap.empty, "Sally Smart", "555-9999")
val m = StringMap.insert (m, "John Doe", "555-1212")
val m = StringMap.insert (m, "J. Random Hacker", "553-1337");
val m =
T
{cnt=3,key="John Doe",
left=T {cnt=1,key="J. Random Hacker",left=E,right=E,value="553-1337"},
right=T {cnt=1,key="Sally Smart",left=E,right=E,value="555-9999"},
value="555-1212"} : string StringMap.map
- StringMap.find (m, "John Doe");
val it = SOME "555-1212" : string option
|
wikipedia
|
wiki_594_chunk_11
|
Tree (data structure)
|
Enumerating all the items
Enumerating a section of a tree
Searching for an item
Adding a new item at a certain position on the tree
Deleting an item
Pruning: Removing a whole section of a tree
Grafting: Adding a whole section to a tree
Finding the root for any node
Finding the lowest common ancestor of two nodes Traversal and search methods
|
wikipedia
|
wiki_2933_chunk_15
|
One-way function
|
Discrete exponential and logarithm
Modular exponentiation can be done in polynomial time. Inverting this function requires computing the discrete logarithm. Currently there are several popular groups for which no algorithm to calculate the underlying discrete logarithm in polynomial time is known. These groups are all finite abelian groups and the general discrete logarithm problem can be described as thus. Let G be a finite abelian group of cardinality n. Denote its group operation by multiplication. Consider a primitive element and another element . The discrete logarithm problem is to find the positive integer k, where , such that:
|
wikipedia
|
wiki_18835_chunk_4
|
Genetics of aggression
|
Results from several decades of long-term follow-up of scores of unselected XYY males identified in eight international newborn chromosome screening studies in the 1960s and 1970s have replaced pioneering but biased studies from the 1960s (that used only institutionalized XYY men), as the basis for current understanding of the XYY genotype and established that XYY males are characterized by increased height but are not characterized by aggressive behavior. Though the link currently between genetics and aggression has turned to an aspect of genetics different from chromosomal abnormalities, it is important to understand where the research started and the direction it is moving towards today.
|
wikipedia
|
wiki_6902_chunk_22
|
Parity (physics)
|
Centrosymmetric molecules at equilibrium have a centre of symmetry at their midpoint (the nuclear center of mass). This includes all homonuclear diatomic molecules as well as certain symmetric molecules such as ethylene, benzene, xenon tetrafluoride and sulphur hexafluoride. For centrosymmetric molecules, the point group contains the operation i which is not to be confused with the parity operation. The operation i involves the inversion of the electronic and vibrational displacement coordinates at the nuclear centre of mass. For centrosymmetric molecules the operation i commutes with the rovibronic (rotation-vibration-electronic) Hamiltonian and can be used to label such states. Electronic and vibrational states of centrosymmetric molecules are either unchanged by the operation i, or they are changed in sign by i. The former are denoted by the subscript g and are called gerade, while the latter are denoted by the subscript u and are called ungerade. The complete Hamiltonian of a centrosymmetric molecule
does not commute with the point group inversion operation i because of the effect of the nuclear hyperfine Hamiltonian. The nuclear hyperfine Hamiltonian can mix the rotational levels of g and u vibronic states (called ortho-para mixing) and give rise to ortho-para transitions
|
wikipedia
|
wiki_3476_chunk_4
|
Alienators: Evolution Continues
|
Characters
Scientist Ira Kane – His expertise, along with his excitement and passion about science, helps him lead the team in eliminating the Genus.
Scientist Harry Block – A coach who always keeps up on game scores, etc., and loves coaching the women's team. His strategies help the team to victory.
Lt. Lucy Mai – A tough and aggressive but benevolent lieutenant trained by a Special Forces team called The Blue Berets. She is very talented with martial arts and acrobatic.Lucy uses many kinds of gymnastics ( such as handsprings, cartwheels or rolls) in fighting to keep balance and defeat enemies with perfect agility and strength.She is revealed to be a fan of Broadway.
Teenage "wannabe fireman" Wayne Grey (who's been renamed Wayne Green) – A 17-year-old firefighter-in-training. Being the first human infected with alien DNA, he develops a "sympathetic mutation", causing him to mutate parallel to any Genus strains encountered.
Scientist Allison Reed has no direct work with the Alienators, but is mentioned a few times, no longer retaining a relationship with Ira like in the movie. She is shown to have no physical training. She can use her knowledge on the fight with Genuses
General Russell Woodman is the pompous windbag in charge of giving the alienators missions.
G.A.S.S.I.E.: Stands for "Genetically Altered Symbiotic Stasis in Evolution", and is the team's pet. It was an alien cell originally neutralized by Ira. It evolved into Gassie, a slime creature that yips and behaves just as a dog, who can detect and track other Genus creatures. When Gassie detects the Genus, he quivers and emits a foul odor. He is close with Wayne
Scopes- the Genus's leader. Super intelligent, maniacal, arrogant, and intent on taking over the universe. His most common form is as a humanoid octopus... though he's also taken on the form of a humanoid wasp, a humanoid cockroach, a centaur with zebra stripes and eland horns, a humanoid tree, a humanoid fusion of a bull and a horse, an organic gargoyle, a humanoid spider, an octopus fused with a wendigo, and more. His name is a reference to the Scopes trial.
General Granger- An arrogant and treacherous general who seeks to use the Genus to conquer Earth, eventually becoming Scopes' pawn.
|
wikipedia
|
wiki_900_chunk_28
|
Natural deduction
|
A discussion of the introduction and elimination forms for higher-order logic is beyond the scope of this article. It is possible to be in-between first-order and higher-order logics. For example, second-order logic has two kinds of propositions, one kind quantifying over terms, and the second kind quantifying over propositions of the first kind. Different presentations of natural deduction Tree-like presentations
Gentzen's discharging annotations used to internalise hypothetical judgments can be avoided by representing proofs as a tree of sequents Γ ⊢A instead of a tree of A true judgments.
|
wikipedia
|
wiki_14683_chunk_5
|
PowerDesigner
|
Version History
1989 - The first commercial release of AMC*Designor (version 2.0) in France
1992 - The first commercial release of S-Designer in the US.
1994 - ProcessAnalyst was added to the suite in 1994.
1995 - S-Designer becomes PowerDesigner, AMC*Designor becomes PowerAMC
1997 - PowerDesigner 6.0 releases.
1998 - WarehouseArchitect was added.
1999 - PowerDesigner 7.0 was rewritten to take advantage of newer technologies and to provide an interface more consistent with other Sybase products.
December 2001 - PowerDesigner 9.5 was initially released, with maintenance releases through 2003.
December 2004 - Version 10.0 (Minerva release)
2005 - Version 11.0
January 2006 - PowerDesigner 12.0 released with metadata mappings and reporting features
August 2006 - PowerDesigner 12.1 released with enhanced support for Microsoft Visual Studio and SQL Server
July 2007 - PowerDesigner 12.5 released with new ETL (Extract, transform, load) and EII (Enterprise Information Integration) modeling and full UML 2.0 diagrams support
October 2008 - PowerDesigner 15.0 released with new Enterprise Architecture Model, customizable frameworks support (Zachman Framework, FEAF, ...), Impact and Lineage Analysis Diagram, logical data model, Barker's Notation, Project support and lot more
November 2011 - PowerDesigner 16.0 released with new Shell, Role-based UI, Glossary, Impact analysis on the repository, Sybase IQ reference architecture wizard, New database support, Web portal enhancements
January 2013 - PowerDesigner 16.5 released with new features supporting SAP Platform: SAP HANA, SAP BusinessObjects, SAP Netweaver and SAP Solution Manager
March 2016 - PowerDesigner 16.6 released with Support for SAP HANA Calculation Views and SAP HANA Core Data Services (CDS). PowerDesigner Web can now edit Enterprise Architecture and Requirements Models.
April 2020 - PowerDesigner 16.7 released with new features supporting: Export from Web privilege, Limit the choice of model types offered in New Model dialog, New models added, Customize link symbol labels, Generate Models using the CSN notation, OAuth 2.0 Client Credentials authentication
|
wikipedia
|
wiki_24713_chunk_3
|
Michael Barr (mathematician)
|
External links
Toposes, Triples and Theories, updated edition of text published in 1983.
Category Theory for Computing Science updated edition of text published in 1999.
http://www.tac.mta.ca/tac (Theory and Applications of Categories)
https://web.archive.org/web/20080704125156/http://www.math.rutgers.edu/hha/geninfo.html (Homology, Homotopy and Applications)
|
wikipedia
|
wiki_18865_chunk_2
|
Asansol Engineering College
|
Academics
The institute offers ten undergraduate courses:-
B.Tech. in Electronics and Communication Engineering (ECE)- 4 years [Approved intake - 120]
B.Tech. in Applied Electronics and Instrumentation (AEIE)- 4 years [Approved intake - 60]
B.Tech. in Electrical Engineering (EE)- 4 years [Approved intake - 120]
B.Tech. in Mechanical Engineering (ME)- 4 years [Approved intake - 120]
B.Tech. in Computer Science and Engineering (CSE)- 4 years [Approved intake - 120]
B.Tech. in Civil Engineering (CE)- 4 years [Approved intake - 60]
B.Tech. in Information Technology (IT)- 4 years [Approved intake - 120]
BCA- 3 years [Approved intake - 60]
BBA- 3 years [Approved intake - 60]
BBA (Insurance & Risk Management)- 3 years [Approved intake - 60]
|
wikipedia
|
wiki_30059_chunk_19
|
Topological data analysis
|
Mathematically speaking, MAPPER is a variation of the Reeb graph. If the is at most one dimensional, then for each , The added flexibility also has disadvantages. One problem is instability, in that some change of the choice of the cover can lead to major change of the output of the algorithm. Work has been done to overcome this problem. Three successful applications of MAPPER can be found in Carlsson et al. A comment on the applications in this paper by J. Curry is that "a common feature of interest in applications is the presence of flares or tendrils."
|
wikipedia
|
wiki_33723_chunk_18
|
Bron–Kerbosch algorithm
|
Worst-case analysis
The Bron–Kerbosch algorithm is not an output-sensitive algorithm: unlike some other algorithms for the clique problem, it does not run in polynomial time per maximal clique generated. However, it is efficient in a worst-case sense: by a result of , any n-vertex graph has at most 3n/3 maximal cliques, and the worst-case running time of the Bron–Kerbosch algorithm (with a pivot strategy that minimizes the number of recursive calls made at each step) is O(3n/3), matching this bound.
|
wikipedia
|
wiki_5528_chunk_30
|
Hyperpolarization (physics)
|
This disease-causing verdict agent is the biomarker is existing extremely trace amount especially initial state of the disease. Therefore, identifying or getting images of biomarker is tricky and, in few circumstances, uncertain by NMR tech. Hence, we must use the contrasting agent to enhance the images at least to visualize level to Physicians. As molecules of biomarker is less abundant in vivo system. The NMR or MRI experiment provides a very small signal even in some cases, the analyzer can miss the signal peak in data due to the lack in abundance of biomarkers. Therefore, to make sure, to reach the true conclusion about the existence of trouble-causing biomarkers, we need to enhance the probe (contrasting mechanisms) to get the clear peak at the most visible level of peak height as well as the position of the peak in data. If it is possible to gather the acceptable and clearly interpretable data from NMR or MRI experiment by using the contrasting agent, then experts can take a right initial step to recover the patients who already have been suffering from cancer. Among the various technique to get the enhanced data in MRI experiment, SEOP is one of them.
|
wikipedia
|
wiki_18072_chunk_7
|
Queensland Academy for Science, Mathematics and Technology
|
Student entry to QASMT is via a multi-stage selection process. Following application, students sit a general academic test designed by eduTest. This exam is presented to students in several parts: an English comprehension exam, an English writing exam, a mathematics, verbal and non-verbal reasoning. The entrance for Year 7 can be written in Year 5 and 6 while a harder test is given in Year 8 and 9 to successfully enter for Year 10 (starting 2021, tests are only able to be taken in 5-6 as the school completes its middle school expansion). Successful students who reach the specified benchmark in all exams then progress to an interview with Education Queensland and QASMT's staff. The interview panel assess each candidates' suitability to the Academy's learning environment and their ability to contribute to the Academy community. Three main criteria are assessed: motivation and like-mindedness; personal capabilities and knowledge of the Academy; and work ethic and past reports. Students who are successful in the interview receive a formal invitation to attend the Academy.
|
wikipedia
|
wiki_10592_chunk_7
|
Nomad software
|
Another example of NOMAD's power is illustrated by Nicholas Rawlings in his comments for the Computer History Museum about NCSS (see citation below). He reports that James Martin asked Rawlings for a NOMAD solution to a standard problem Martin called the Engineer's Problem: "give 6% raises to engineers whose job ratings had an average of 7 or better." Martin provided a "dozen pages of COBOL, and then just a page or two of Mark IV, from Informatics." Rawlings offered the following single statement, performing a set-at-a-time operation, to show how trivial this problem was with NOMAD:
|
wikipedia
|
wiki_33651_chunk_4
|
History of cell membrane theory
|
Thus, by the early twentieth century the chemical, but not the structural nature of the cell membrane was known. Two experiments in 1924 laid the groundwork to fill in this gap. By measuring the capacitance of erythrocyte solutions Fricke determined that the cell membrane was 3.3 nm thick. Although the results of this experiment were accurate, Fricke misinterpreted the data to mean that the cell membrane is a single molecular layer. Because the polar lipid headgroups are fully hydrated, they do not show up in a capacitance measurement meaning that this experiment actually measured the thickness of the hydrocarbon core, not the whole bilayer. Gorter and Grendel approached the problem from a different perspective, performing a solvent extraction of erythrocyte lipids and spreading the resulting material as a monolayer on a Langmuir-Blodgett trough. When they compared the area of the monolayer to the surface area of the cells, they found a ratio of two to one. Later analyses of this experiment showed several problems including an incorrect monolayer pressure, incomplete lipid extraction and a miscalculation of cell surface area. In spite of these issues the fundamental conclusion- that the cell membrane is a lipid bilayer- was correct.
|
wikipedia
|
wiki_28999_chunk_4
|
Basic Latin (Unicode block)
|
Number of symbols, letters and control codes
The table below shows the number of letters, symbols and control codes in each of the subheadings in the C0 Controls and Basic Latin block. Block Variants
Several of the characters are defined to render as a standardized variant if followed by variant indicators. A variant is defined for a zero with a short diagonal stroke: U+0030 DIGIT ZERO, U+FE00 VS1 (0︀).
|
wikipedia
|
wiki_9784_chunk_2
|
Cellomics
|
Applications
Like many of the -omics, e.g., genomics and proteomics, applications have grown in depth and breadth over time. Currently there are over 40 different application areas that cellomics is used in, including the analysis of 3-D cell models, angiogenesis, and cell-signalling. Originally a tool used by the pharmaceutical industry for screening, cellomics has now expanded into academia to better understand cell function in the context of the cell. Cellomics is used in both academic and industrial life-science research in areas, such as cancer research, neuroscience research, drug discovery, consumer products safety, and toxicology; however, there are many more areas for which cellomics could provide a much deeper understanding of cellular function.
|
wikipedia
|
wiki_3807_chunk_7
|
Arial Unicode MS
|
Versions
Version 0.84 was supplied with Microsoft Office 2000 and the standalone versions of that suite's applications—except Publisher 2000 SR-1. It includes 51,180 glyphs (38,911 characters), supports 32 code pages, and contains Latin and Han Ideographic OpenType layout tables. The code pages supported are 1250 (Latin 2: East Europe), 1251 (Cyrillic), 1252 (Latin 1), 1253 (Greek), 1254 (Turkish), 1255 (Hebrew), 1256 (Arabic), 1257 (Windows Baltic), Code page 1258 (Vietnamese), 437 (US), 708 (Arabic; ASMO 708), 737 (Greek), 775 (MS-DOS Baltic), 850 (WE/Latin 1), 852 (Latin 2), 855 (IBM Cyrillic; primarily Russian), 857 (MS-DOS IBM Turkish), 860 (MS-DOS Portuguese), 861 (MS-DOS Icelandic), 862 (Hebrew), 863 (MS-DOS Canadian French), 864 (Arabic), 865 (MS-DOS Nordic), 866 (MS-DOS Russian), 869 (IBM Greek), 874 (Thai), 932 (ShiftJIS/Japan), 936 (Chinese: Simplified), 949 (Korean Wansung), 950 (Chinese: Traditional), "Macintosh Character Set" (US Roman), and "Windows OEM Character Set". It covers all code points containing non-control characters in Unicode 2.0 and allows only preview and print embedding.
|
wikipedia
|
wiki_11553_chunk_4
|
Teen Power Inc.
|
Books
#1 - The Ghost of Raven Hill - Narrated by Liz
#2 - The Sorcerer's Apprentice - Narrated by Tom (co-author John St Claire)
#3 - The Disappearing TV Star - Narrated by Richelle (co-author Mary Forrest)
#4 - Cry of the Cat - Narrated by Elmo (co-author Mary Forrest)
#5 - Beware the Gingerbread House - Narrated by Sunny
#6 - Green for Danger - Narrated by Nick (co-author John St Clair)
#7 - Breaking Point - Narrated by Liz
#8 - The Secret of Banyan Bay - Narrated by Tom (co-author John St Clair)
#9 - The Bad Dog Mystery - Narrated by Richelle (co-author Mary Forrest)
#10 - Poison Pen - Narrated by Elmo (co-author Mary Forrest)
#11 - The Missing Millionaire - Narrated by Sunny
#12 - Crime in the Picture - Narrated by Nick (co-author John St Clair)
#13 - Nowhere to Run - Narrated by Liz
#14 - Dangerous Game - Narrated by Tom (co-author Robert Sexton)
#15 - Haunted House - Narrated by Sunny
#16 - The Case of Crazy Claude - Narrated by Nick (co-author Robert Sexton)
#17 - Fear in Fashion - Narrated by Richelle (co-author Mary Forrest)
#18 - Danger in Rhyme - Narrated by Elmo (co-author Mary Forrest)
#19 - Cry Wolf - Narrated by Liz
#20 - Photo Finish - Narrated by Tom (co-author Robert Sexton)
#21 - Stage Fright - Narrated by Richelle (co-author Sam Kester)
#22 - Saint Elmo's Fire - Narrated by Elmo (co-author Robert Sexton)
#23 - Bad Apples - Narrated by Sunny
#24 - The War of the Work Demons - Narrated by Nick (co-author Robert Sexton)
#25 - Dirty Tricks - Narrated by Richelle (co-author Kate Rowe)
#26 - Hot Pursuit - Narrated by Elmo (co-author Kate Rowe)
#27 - Hit or Miss - Narrated by Liz (co-author Kate Rowe)
#28 - Deep Freeze - Narrated by Tom (co-author Kate Rowe)
#29 - The Secret Enemy - Narrated by Sunny
#30 - Dead End - Narrated by Nick
|
wikipedia
|
wiki_27418_chunk_16
|
Raima Database Manager
|
Database Design Language (DDL)
Non-SQL (core) DDL Features:
C struct-like record type (table) declarations.
Network model set declarations for defining 1-many inter-record relationships.
Support for direct, B-tree, and hashed record access.
In-memory database or file declarations. A database can be designed to be either on-disk or in-memory, or a hybrid where some parts reside in-memory while others are stored on disk.
Circular record types (tables). Circular tables store a user-specified maximum number of records (rows). When that maximum has been reached, newly inserted records are stored in the location occupied by the oldest one. Circular tables are important for storing status data on resource-restricted devices.
Supported datatypes: 8, 16, 32, and 64 bit signed or unsigned integers, float, double, decimal (BCD), fixed or variable-length character or wide character, binary or character large objects (blobs), date, time, timestamp, guid/uuid, and db_addr (database address—aka, rowid).
Support for struct and array data fields.
Optional user control over database file organization and page sizes.
SQL DDL Features:
Declared referential integrity support automatically implemented using RDM's network model sets.
Support for direct, B-tree, and hashed row access.
In-memory database or table declarations.
Circular tables.
Virtual tables declarations that provide SQL access to external data sources (e.g., real-time sensor data).
Supported data types: boolean, tinyint, smallint, integer, bigint, decimal, real, float/double, binary/varbinary, long varbinary, char/varchar, wchar/wvarchar, long varchar, long wvarchar, date, time, timestamp, guid/uuid, rowid (foreign and primary keys).
Domain declarations.
|
wikipedia
|
wiki_19236_chunk_2
|
2006–07 EDF Energy Cup
|
Group B
{| class="wikitable" style="text-align: center;"
|-
!width="200"|Team
!width="20"|Pld
!width="20"|W
!width="20"|D
!width="20"|L
!width="20"|F
!width="20"|A
!width="20"|Pts
|- bgcolor=#ccffcc
|align=left| Cardiff Blues
|3||3||0||0||107||56||13
|-
|align=left| London Irish
|3||1||0||2||56||78||5
|-
|align=left| Saracens
|3||1||0||2||79||91||4
|-
|align=left| London Wasps
|3||1||0||2||58||75||4
|}
|
wikipedia
|
wiki_1265_chunk_17
|
Appendix (anatomy)
|
Such a function may be useful in a culture lacking modern sanitation and healthcare practice, where diarrhea may be prevalent. Current epidemiological data on the cause of death in developed countries collected by the World Health Organization in 2001 show that acute diarrhea is now the fourth leading cause of disease-related death in developing countries (data summarized by The Bill and Melinda Gates Foundation). Two of the other leading causes of death are expected to have exerted limited or no selection pressure. Additional images See also
Meckel's diverticulum References Further reading
|
wikipedia
|
wiki_14753_chunk_3
|
Ultimate Power
|
Reed requests funding from S.H.I.E.L.D. to send advanced data retrieval probes into neighboring dimensions for inter-dimensional research and exploration purposes. S.H.I.E.L.D. Director Nick Fury refuses, not wishing to risk inter-dimensional security solely to potentially cure Ben Grimm. Fury also bans Reed from attempting the project on his own time.
|
wikipedia
|
wiki_21673_chunk_0
|
Algebraic modeling language
|
Algebraic modeling languages (AML) are high-level computer programming languages for describing and solving high complexity problems for large scale mathematical computation (i.e. large scale optimization type problems). One particular advantage of some algebraic modeling languages like AIMMS, AMPL, GAMS,
MathProg,
Mosel,
and
OPL
is the similarity of their syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization, which is supported by certain language elements like sets, indices, algebraic expressions, powerful sparse index and data handling variables, constraints with arbitrary names. The algebraic formulation of a model does not contain any hints how to process it.
|
wikipedia
|
wiki_8168_chunk_44
|
Business process re-engineering
|
Ongoing continuous improvement
Many organizational change theorists hold a common view of organizations adjusting gradually and incrementally and responding locally to individual crises as they arise Common elements are:
BPR is a successive and ongoing process and should be regarded as an improvement strategy that enables an organization to make the move from a traditional functional orientation to one that aligns with strategic business processes.
Continuous improvement is defined as the propensity of the organization to pursue incremental and innovative improvements in its processes, products, and services. The incremental change is governed by the knowledge gained from each previous change cycle.
It is essential that the automation infrastructure of the BPR activity provides for performance measurements in order to support continuous improvements. It will need to efficiently capture appropriate data and allow access to appropriate individuals.
To ensure that the process generates the desired benefits, it must be tested before it is deployed to the end-users. If it does not perform satisfactorily, more time should be taken to modify the process until it does.
A fundamental concept for quality practitioners is the use of feedback loops at every step of the process and an environment that encourages constant evaluation of results and individual efforts to improve.
At the end user's level, there must be a proactive feedback mechanism that provides for and facilitates resolutions of problems and issues. This will also contribute to a continuous risk assessment and evaluation which are needed throughout the implementation process to deal with any risks at their initial state and to ensure the success of the reengineering efforts.
Anticipating and planning for risk handling is important for dealing effectively with any risk when it first occurs and as early as possible in the BPR process. It is interesting that many of the successful applications of reengineering described by its proponents are in organizations practicing continuous improvement programs.
Hammer and Champy (1993) use the IBM Credit Corporation as well as Ford and Kodak, as examples of companies that carried out BPR successfully due to the fact that they had long-running continuous improvement programs.
|
wikipedia
|
wiki_890_chunk_68
|
Gray code
|
An STGC for P = 30 and n = 5 is reproduced here:
{|class="wikitable" style="text-align:center; background:#FFFFFF; border-width:0;"
|+ Single-track Gray code for 30 positions
! Angle || Code
|rowspan="7" style="text-align:center; background:#FFFFFF; border-width:0;"|
! Angle || Code
|rowspan="7" style="text-align:center; background:#FFFFFF; border-width:0;"|
! Angle || Code
|rowspan="7" style="text-align:center; background:#FFFFFF; border-width:0;"|
! Angle || Code
|rowspan="7" style="text-align:center; background:#FFFFFF; border-width:0;"|
! Angle || Code
|-
| 0° || || 72° || || 144° || || 216° || || 288° ||
|-
| 12° || || 84° || || 156° || || 228° || || 300° ||
|-
| 24° || || 96° || || 168° || || 240° || || 312° ||
|-
| 36° || || 108° || || 180° || || 252° || || 324° ||
|-
| 48° || || 120° || || 192° || || 264° || || 336° ||
|-
| 60° || || 132° || || 204° || || 276° || || 348° ||
|}
|
wikipedia
|
wiki_7662_chunk_42
|
Race and genetics
|
Gene-environment interactions
Lorusso and Bacchini argue that self-identified race is of greater use in medicine as it correlates strongly with risk-related exposomes that are potentially heritable when they become embodied in the epigenome. They summarise evidence of the link between racial discrimination and health outcomes due to poorer food quality, access to healthcare, housing conditions, education, access to information, exposure to infectious agents and toxic substances, and material scarcity. They also cite evidence that this process can work positively – for example, the psychological advantage of perceiving oneself at the top of a social hierarchy is linked to improved health. However they caution that the effects of discrimination do not offer a complete explanation for differential rates of disease and risk factors between racial groups, and the employment of self-identified race has the potential to reinforce racial inequalities.
|
wikipedia
|
wiki_3472_chunk_20
|
List of important publications in computer science
|
Comments on "the Case for the Reduced Instruction Set Computer"
DW Clark, WD Strecker
Computer Architecture News, 1980.
Online version(PDF) Description: The CRAY-1 Computer System
RM Russell
Communications of the ACM, January 1978, volume 21, number 1, pages 63–72.
Online version(PDF)
|
wikipedia
|
wiki_12930_chunk_8
|
Video Encoded Invisible Light
|
See also
VEIL Interactive Technologies
Method for transmitting data on viewable portion of a video signal, July 25, 2000
United States Patent 6,229,572 Method for transmitting data on viewable portion of a video signal, May 8, 2001
United States Patent 6,661,905 Method for transmitting data on a viewable portion of a video signal, December 9, 2003
United States Patent 6,992,726 Method and system for enhanced modulation of video signals, January 31, 2006
United States Patent Application Method and system for embedding device positional data in video signals, March 10, 2005
|
wikipedia
|
wiki_34121_chunk_2
|
Brain simulation
|
The Blue Brain Project intends to create a computer simulation of a mammalian cortical column down to the molecular level. By one estimate, a full reconstruction of the human connectome using the methodology of the Blue Brain Project would require a zettabyte of data storage. Examples Caenorhabditis elegans (roundworm)
|
wikipedia
|
wiki_2477_chunk_31
|
Dive computer
|
Some dive computers provide additional functionality, generally a subset of those listed below:
Breathing gas oxygen analyser
Electronic compass
Gas blending calculator
Global navigation satellite receiver (only works at the surface)
Light-meter
Lunar phase indicator (useful for estimating tidal conditions)
Magnetometer (for detecting ferrous metal)
Pitch and roll angle
Stopwatch
Time of day in a second time zone
Time to surface after another 5 minutes at current depth on current gas.
Gauge mode (overrides decompression monitoring, and just records and displays depth and time and leaves the diver to control decompression by following tables). Selecting gauge mode may reset the tissue saturation records to default, which invalidates any further decompression calculations until the diver has fully desaturated.
Air integration (AI)– Some dive computers are designed to measure, display, and monitor pressure in one or more diving cylinders. The computer is either connected to the first stage by a high pressure hose, or uses a pressure transducer on the regulator first stage to provide a wireless data signal indicating remaining cylinder pressure, The signals are encoded to eliminate the risk of one diver's computer picking up a signal from another diver's transducer, or interference from other sources. Some dive computers can receive a signal from more that one remote pressure transducer. The Ratio iX3M Tech and others can process and display pressures from up to 10 transmitters.
Workload modification of decompression algorithm based on gas consumption rate from integrated gas pressure monitor.
Heart rate monitor from remote transducer. This can also be used to modify the decompression algorithm to allow for an assumed workload.
Graphic display of calculated tissue compartment inert gas tensions during and after the dive.
Indication of computed decompression ceiling in addition to the more usual next stop depth. The effects on decompression risk of following the ceiling rather than remaining below the stop depth is not known, but stop depths are arbitrarily chosen for the calculation of decompression tables, and time spent at any depth below the indicated ceiling depth is processed by the same algorithm.
Display of supersaturation of limiting tissue as a percentage of M-value in the event of an immediate ascent. This is an indicator of decompression risk in the event of an emergency ascent.
Display of current supersaturation of limiting tissue as a percentage of M-value during ascent. This is an indication of decompression stress and risk in real time.
Multiple active gases for open circuit and closed circuit diluent.
Deactivation of gas options during dive in case of lost gas. This will trigger the computer to recalculate the estimated time to surface without the deactivated gases.
Definition of a new gas during the dive to allow calculations for decompression on gas supplied by another diver.
Battery charge status.
Alternative decompression algorithms.
Features and accessories:
Peizo-electric buttons (no moving parts)
User input by directional tapping
Rechargeable batteries.
Wireless charging.
Optional battery types. For example the Shearwater Perdix and Petrel 2 can use 1,5V alkaline cells or 3.6V lithium cells provided they have the same physical format (AA).
User changeable batteries.
Battery redundancy.
User selected display colours (useful for the colour-blind), and variable brightness.
Screen inversion for ambidextrous use of units with plug-in cable connections for oxygen monitors.
Mask or mouthpiece mounted head-up display. (NERD)
Wireless downloading of dive log data.
Firmware upgrades over the Internet via Bluetooth or USB cable from smart phone or personal computer.
Display prompts for changing settings.
Twin straps or bungee straps for improved security.
Strap extensions for wristwatch format computers to allow for fitting over the forearm on bulky diving suits.
Aftermarket straps, for improved security.
Screen protectors, in the form of a self-adhesive transparent plastic film or a rigid transparent plastic cover.
Software for downloading, display and analysis of logged data. Most downloadable dive computers have a proprietary application, and many can also interface with open source software such as Subsurface. Some can download via a smartphone to the cloud.
|
wikipedia
|
wiki_12058_chunk_4
|
Logical equality
|
The truth table of p EQ q (also written as p = q, p ↔ q, Epq, p ≡ q, or p == q) is as follows: {| class="wikitable" style="text-align:center"
|+ Logical equality
! p
! q
! p = q
|-
| 0 || 0 || 1
|-
| 0 || 1 || 0
|-
| 1 || 0 || 0
|-
| 1 || 1 || 1
|} Alternative descriptions
|
wikipedia
|
wiki_28264_chunk_16
|
Marshalling (computer science)
|
Unmarshaller in JAXB
The process of unmarshalling the XML data into an executable Java object is taken care of by the in-built Unmarshaller class. It also validates the XML data as it gets unmarshalled. The unmarshal methods defined in the Unmarshaller class are overloaded for the different types of XML inputs. Some of the important implementations of unmarshal methods:
Unmarshalling from an XML File:
JAXBContext jcon = JAXBContext.newInstance("com.acme.foo");
Unmarshaller umar = jcon.createUnmarshaller();
Object obj = umar.unmarshal(new File("input.xml"));
Unmarshalling from an XML file in InputStream:
InputStream istr = new FileInputStream("input.xml");
JAXBContext jcon = JAXBContext.newInstance("com.acme.foo");
Unmarshaller umar = jcon.createUnmarshaller();
Object obj = umar.unmarshal(istr);
Unmarshalling from an XML file in a URL:
JAXBContext jcon = JAXBContext.newInstance("com.acme.foo");
Unmarshaller umar = jcon.createUnmarshaller();
URL url = new URL("http://merrilllynch.employee/input.xml");
Object obj = umar.unmarshal(url);
|
wikipedia
|
wiki_11804_chunk_6
|
Salt bridge (protein and supramolecular)
|
The difference in pKa can be quantified to reflect the salt bridge’s contribution to free energy. Using Gibbs free energy:
ΔG = −RT ln(Keq), where R is the universal gas constant, T is the temperature in kelvins, and Keq is the equilibrium constant of a reaction in equilibrium. The deprotonation of His31 is an acid equilibrium reaction with a special Keq known as the acid dissociation constant, Ka: His31-H+ His31 + H+. The pKa is then related to Ka by the following: pKa = −log(Ka). Calculation of the free energy difference of the mutant and wild-type can now be done using the free energy equation, the definition of pKa, the observed pKa values, and the relationship between natural logarithms and logarithms. In the T4 lysozyme example, this approach yielded a calculated contribution of about 3 kcal/mol to the overall free energy. A similar approach can be taken with the other participant in the salt bridge, such as Asp70 in the T4 lysozyme example, by monitoring its shift in pKa after mutation of His31.
|
wikipedia
|
wiki_20261_chunk_5
|
List of 4000-series integrated circuits
|
Two to eight input logic gates:
4093 = Quad 2-Input NAND (schmitt trigger inputs) (pinout compatible with 4011)
40107 = Dual 2-Input NAND (136 mA open drain outputs) (DIP-8 package)
{| class="wikitable"
|-
! Configuration !! AND !! NAND !! OR !! NOR !! XOR !! XNOR
|-
| Quad 2-Input || 4081 || 4011 || 4071 || 4001 || 4070 || 4077
|-
| Triple 3-Input || 4073 || 4023 || 4075 || 4025 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|-
| Dual 4-Input || 4082 || 4012 || 4072 || 4002 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|-
| Single 8-Input || 4068 || 4068 || 4078 || 4078 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|}
Note: The 4068 & 4078 has two outputs Q and . The 4048 is an 8-input gate too (see below). The 4572 has a NOR gate and NAND gate (see above).
|
wikipedia
|
wiki_4287_chunk_10
|
Max Planck Institute for Extraterrestrial Physics
|
Exploration of the Ionosphere and Magnetosphere by means of ion clouds (1963–1985)
The first map of the galactic gamma-ray emission ( > 70 MeV) as measured with the satellite COS-B (1978)
Measurement of the magnetic field of the neutron star Her-X1 using the cyclotron line emission (balloon experiments 1978)
Experimental proof of the reconnection process (1979)
The artificial comet (AMPTE 1984/85)
Numerical simulation of a collision-free shock wave (1990)
The first map of the X-ray sky as measured with the imaging X-ray telescope on board the ROSAT satellite (1993)
First gamma-ray sky map in the energy range 3 to 10 MeV as measured with the imaging Compton telescope COMPTEL on board CGRO (1994)
The plasma-crystal experiment and its successors on the International Space Station (1996–2013)
The measurement of the element- and isotope-composition of the solar wind by the CELIAS experiment on board the SOHO satellite (1996)
The first detection of water-molecule lines in an expanding shell of a star using the Fabry-Perot spectrometer on board the ISO satellite (1996)
First detection of X-ray emission from comets and planets (1996, 2001)
Determining the energy source for ultraluminous infrared galaxies with the satellite ISO (1998)
Detection of gamma-ray line emission (44Ti) from supernova remnants (1998)
Deep observations of the extragalactic X-ray sky with ROSAT, XMM-Newton and Chandra and resolving the background radiation into individual sources (since 1998)
Confirmation that a supermassive black hole resides at the centre of our galaxy (2002)
Detection of a binary active galactic nucleus in X-rays (2003)
Reconstruction of the evolution history of stars in elliptical galaxies (2005)
Stellar disks rotating around the black hole in the Andromeda galaxy (2005)
Determining the gas content of normal galaxies in the early universe (since 2010)
Resolving the cosmic infrared background into individual galaxies with Herschel (2011)
|
wikipedia
|
wiki_9606_chunk_3
|
Melon (chemistry)
|
According to Komatsu, a characterized form of melon consists of oligomers that can be described as condensations of 10 units of melem tautomer with loss of ammonia . In this structure 2-imino-heptazine units are connected by amino bridges, from carbon 8 of one unit to nitrogen 4 of the next unit. X-ray diffraction data and other evidence indicate that the oligomer is planar, and the triangular heptazine cores have alternating orientations.
|
wikipedia
|
wiki_26180_chunk_9
|
Physical unclonable function
|
Over 40 types of PUF have been suggested. These range from PUFs that evaluate an intrinsic element of a pre-existing integrated electronic system to concepts that involve explicitly introducing random particle distributions to the surface of physical objects for authentication. All PUFs are subject to environmental variations such as temperature, supply voltage and electromagnetic interference, which can affect their performance. Therefore, rather than just being random, the real power of a PUF is its ability to be different between devices, but simultaneously to be the same under different environmental conditions on the same device.
|
wikipedia
|
wiki_10392_chunk_7
|
Punjab Engineering College
|
Collaborations
The college has collaborated with national and international educational institutions for student exchange programs. MoUs have been signed with corporates to attract projects and internships. Some of these collaborations are:
PEC has collaborations with a large number of international companies and universities To name a few such as
PGIMER, Chandigarh
NITIE, Mumbai
ABB Global Industries & Services Ltd. Bangalore
Minda Corporation Ltd Noida
Intel Technologies India Pvt. Ltd., Bangalore, Mumbai
Central Tool Room, Ludhiana
CONCAVE Research Centre, Concordia University, Canada
Central Scientific Instruments Organization, Chandigarh
Swaraj Division (a unit of FES M&M), Mohali
MICROSOFT
Mohali Industries Association, Mohali
Philips India Ltd.PEC-ESIGELEC France collaboration (Feb, 2009)
MoA between PEC and Siemens Software to develop a centre of excellence at PEC.
Solar tech Park at PEC campus established in support with Bergen group of Companies
PEC-ABB collaboration (Jan, 2009)
PEC-UWA collaboration (Jan, 2009)
PEC-JCB collaboration initiated (Sep, 2008)
PEC-Philips collaboration (Sep, 2008)
PEC-CSIO collaboration (Aug, 2008)
|
wikipedia
|
wiki_7072_chunk_7
|
Nested function
|
if (first < last) {
int pivotIndex = partition();
quickSort(first, pivotIndex - 1);
quickSort(pivotIndex + 1, last);
}
}
quickSort(0, size - 1);
}
Another example is the following implementation of the Hoare partition based quicksort using C++11 lambda expression syntax:
template<typename RandomAccessIterator>
auto Sort(RandomAccessIterator Begin, RandomAccessIterator End)->void {
auto Partition = [&]() {
//Hoare partition scheme
auto &Pivot = *Begin;
auto ForwardCursor = Begin;
auto BackwardCursor = End - 1;
auto PartitionPositionFound = false;
auto LocatePartitionPosition = [&]() {
while (*ForwardCursor < Pivot)
++ForwardCursor;
while (Pivot < *BackwardCursor)
--BackwardCursor;
if (ForwardCursor >= BackwardCursor)
PartitionPositionFound = true;
else
Swap(*ForwardCursor, *BackwardCursor);
};
//Trivial helper function
auto MoveOnAndTryAgain = [&]() {
++ForwardCursor;
--BackwardCursor;
};
//Brief outline of the actual partition process
while (true) {
LocatePartitionPosition();
if (PartitionPositionFound)
return BackwardCursor + 1;
else
MoveOnAndTryAgain();
}
};
//Brief outline of the quicksort algorithm
if (Begin < End - 1) {
auto PartitionPosition = Partition();
Sort(Begin, PartitionPosition);
Sort(PartitionPosition, End);
}
}
|
wikipedia
|
wiki_1022_chunk_31
|
Abstraction (computer science)
|
In general, to determine appropriate abstraction, one must make many small decisions about scope (domain analysis), determine what other systems one must cooperate with (legacy analysis), then perform a detailed object-oriented analysis which is expressed within project time and budget constraints as an object-oriented design. In our simple example, the domain is the barnyard, the live pigs and cows and their eating habits are the legacy constraints, the detailed analysis is that coders must have the flexibility to feed the animals what is available and thus there is no reason to code the type of food into the class itself, and the design is a single simple Animal class of which pigs and cows are instances with the same functions. A decision to differentiate DairyAnimal would change the detailed analysis but the domain and legacy analysis would be unchanged—thus it is entirely under the control of the programmer, and it is called an abstraction in object-oriented programming as distinct from abstraction in domain or legacy analysis.
|
wikipedia
|
wiki_17505_chunk_3
|
EH postcode area
|
The New Town area, north of Queen Street and northwards to Stockbridge.
The West End, including some of Edinburgh's financial district
The Tollcross and Fountainbridge areas.
|
|-
! EH4
| EDINBURGH
| Radiates from the older and more central areas out to the suburban areas added to them, as the city grew outwards during the 20th century. EH4, then, branches out from Dean Village and Comely Bank along a corridor centred on the A90 as far as Barnton and Cramond. Central to this area is the Sainsbury's in Craigleith Retail Park adjacent to the A90.
|
|-
! EH5
| EDINBURGH
| Based on a village formerly separate from the city; in this case, Granton on the Firth of Forth. EH5 extends inwards from the coast to Ferry Road.
|
|-
! EH6
| EDINBURGH
| Covers Leith, as well as Newhaven bordering it on the west.
|
|-
! EH7
| EDINBURGH
| The inner city area between central Edinburgh and Leith, and radiates out to Restalrig and Craigentinny.
|
|-
! EH8
| EDINBURGH
| The inner city Southside, Newington and Canongate areas, in the west of the postcode area. It spreads eastwards around Holyrood Park to take in areas like Abbeyhill and Mountcastle; being in east Edinburgh these areas have no obvious connection with the Southside. However the postcode effectively takes in the area surrounding Holyrood Park.
|
|-
! EH9
| EDINBURGH
| The inner city, Marchmont and Grange, Blackford and around Minto Street, including Causewayside.
|
|-
! EH10
| EDINBURGH
| A corridor along the A702 from Bruntsfield, through Morningside as far as Fairmilehead.
| City of Edinburgh, Midlothian
|-
! EH11
| EDINBURGH
| A corridor (rather thin in shape) along the A71 from Haymarket Station, through Gorgie and Stenhouse to Sighthill and the Calders.
|
|-
! EH12
| EDINBURGH
| A corridor along the A8 from Haymarket through Murrayfield and Corstorphine as far as the Gyle.
|
|-
! EH13
| EDINBURGH
| Based on the previously separate village of Colinton, and including Oxgangs.
|
|-
! EH14
| BALERNO, CURRIE, EDINBURGH, JUNIPER GREEN
| A corridor in south-west Edinburgh starting at Slateford, through Longstone, Wester Hailes, Juniper Green, Currie and on to Balerno.
|
|-
! EH15
| EDINBURGH
| Based on Portobello and Duddingston, formerly separate settlements to Edinburgh.
|
|-
! EH16
| EDINBURGH
| Based on the formerly separate village of Liberton. It extends north and north-east to Cameron Toll, Craigmillar and Niddrie.
|
|-
! EH17
| EDINBURGH
| Based on the formerly separate village of Gilmerton, taking in Moredun and extending westwards as far as Mortonhall.
|
|-
! EH28
| NEWBRIDGE
| Newbridge, Ratho
| City of Edinburgh Council
|-
! EH29
| KIRKLISTON
| Kirkliston
| City of Edinburgh Council
|-
! EH30
| SOUTH QUEENSFERRY
| South Queensferry
| City of Edinburgh Council|
|-
! EH77
| EDINBURGH
| Special postcode used by Census 2021
|-
! EH91
| EDINBURGH
| Special postcode used by Jobcentre Plus
|-
! EH95
| EDINBURGH
| Special postcode used by Scottish Gas.
|-
! EH99
| EDINBURGH
| Special postcode used by the Scottish Parliament.
|
|}
|
wikipedia
|
wiki_1760_chunk_21
|
PowerPC 7xx
|
In 2015 Rochester Electronics started providing legacy support for the devices. Freescale has discontinued all 750 designs in favor of designs based on the PowerPC e500 core (PowerQUICC III). Device list
This list is a complete list of known 750 based designs. The pictures are illustrations and not to scale.
|
wikipedia
|
wiki_6951_chunk_32
|
Temporal database
|
Approaches to minimize the complexities of schema evolution are:
to use a semi-structured database/NoSQL database which reduces the complexities of modeling attribute data but provides no features for handling multiple time axes.
to use a database capable of storing both semi-structured data for attributes and structured data for time axes (e.g., SnowflakeDB, PostgreSQL) Implementations in notable products
The following implementations provide temporal features in a relational database management system (RDBMS).
|
wikipedia
|
wiki_14358_chunk_23
|
K-theory (physics)
|
Some authors have proposed radically different solutions to this puzzle. For example, propose that instead of twisted K-theory, II string theory configurations should be classified by elliptic cohomology. Researchers
Prominent researchers in this area include Edward Witten, Peter Bouwknegt, Angel Uranga, Emanuel Diaconescu, Gregory Moore, Anton Kapustin, Jonathan Rosenberg, Ruben Minasian, Amihay Hanany, Hisham Sati, Nathan Seiberg, Juan Maldacena, Daniel Freed, and Igor Kriz. See also
Kalb–Ramond field Notes References
. . . . . . . . . . .
|
wikipedia
|
wiki_2138_chunk_21
|
Nuclear chemistry
|
Selective Actinide Extraction (SANEX). As part of the management of minor actinides, it has been proposed that the lanthanides and trivalent minor actinides should be removed from the PUREX raffinate by a process such as DIAMEX or TRUEX. In order to allow the actinides such as americium to be either reused in industrial sources or used as fuel the lanthanides must be removed. The lanthanides have large neutron cross sections and hence they would poison a neutron-driven nuclear reaction. To date, the extraction system for the SANEX process has not been defined, but currently, several different research groups are working towards a process. For instance, the French CEA is working on a bis-triazinyl pyridine (BTP) based process.
|
wikipedia
|
wiki_2151_chunk_24
|
D (programming language)
|
Here, the use of static if, D's compile-time conditional construct, is demonstrated to construct a template that performs the same calculation using code that is similar to that of the function above: template Factorial(ulong n) {
static if (n < 2)
enum Factorial = 1;
else
enum Factorial = n * Factorial!(n-1);
} In the following two examples, the template and function defined above are used to compute factorials. The types of constants need not be specified explicitly as the compiler infers their types from the right-hand sides of assignments:
|
wikipedia
|
wiki_11287_chunk_1
|
Software build
|
Tools such as Git, AccuRev or StarTeam help with these tasks by offering tools to tag specific points in history as being important, and more. Code quality
Also known as static program analysis/static code analysis this function is responsible for checking developers have adhered to the seven axes of code quality: comments, unit tests, duplication, complexity, coding rules, potential bugs and architecture & design. Ensuring a project has high-quality code results in fewer bugs and influences nonfunctional requirements such as maintainability, extensibility and readability, which have a direct impact on the ROI for a business.
|
wikipedia
|
wiki_11490_chunk_6
|
List of airports by ICAO code: E
|
EB – Private heliports
EBAK – Antwerp/Kiel Heliport – Antwerp
EBAS – Schilde/'s-Gravenwezel Heliport – Schilde
EBBC – Brecht/Luyckx Heliport – Brecht
EBBH – Brecht/Keysers Heliport – Brecht
EBBM – Brakel/Michelbeke Heliport – Michelbeke
EBBV – Brecht/Vochten Heliport – Brecht
EBCH – Shape Pad Heliport – Les Bruyères
EBDI – Diksmuide Heliport – Diksmuide
EBDL – Dilsen-Stokkem/Lanklaar Heliport – Dilsen-Stokkem
EBDR – Antwerp/Commandant Fourcault Heliport – Antwerp
EBDW – Diest/Webbekom Heliport – Diest
EBEB – Evergem/Belzele Heliport – Evergem
EBEN – Ranst/Engles Heliport – Ranst
EBFR – Francorchamps Heliport – Francorchamps
EBHA – Ham Heliport – Ham
EBHL – Halen Heliport – Halen
EBHM – Hasselt/Maasland Heliport – Hasselt
EBHO – Holsbeek Heliport – Holsbeek
EBHT – Houthalen Heliport – Houthalen-Helchteren
EBKR – Kruishoutem/Sons Heliport – Kruishoutem
EBKU – Kuurne Heliport – Kuurne
EBKW – Knokke-Heist/Westkapelle Heliport – Knokke-Heist
EBLM – Meulebeke Heliport – Meulebeke
EBLR – Reninge Heliport – Reninge
EBLT – Lint Heliport – Lint
EBLU – Lummen Heliport – Lummen
EBLY – Ranst/Lymar Heliport – Ranst
EBLZ – Zaffelare Heliport – Lochristi
EBME – Meerbeek Heliport – Meerbeek
EBMW – Meise/Wolvertem Heliport – Meise
EBNH – Oostende Heliport – Ostend
EBNK – Nokere/Suys Heliport – Nokere
EBNP – Neerpelt/Tilburgs Heliport – Neerpelt
EBOB – Oud-Heverlee/Blanden Heliport – Oud-Heverlee
EBOO – Oostdijckbank Heliport –
EBPW – Pecq/Warcoing Heliport – Pecq
EBRO – Ranst/Van Den Bosch Heliport – Ranst
EBRR – Roeselare/Rumbeke Heliport – Rumbeke
EBSW – Sint-Pieters-Leeuw Heliport – Sint-Pieters-Leeuw
EBTK – Tielen/Kasterlee Heliport – Kasterlee
EBVE – Oeren Heliport – Veurne
EBVU – Rotselaar Heliport – Rotselaar
EBWA – Waasmunster Heliport – Waasmunster
EBWI – Wingene Heliport – Wingene
EBWZ – Wingene/Zwevezele Heliport – Wingene
EBZI – Zingem Heliport – Zingem
EBZM – Zomergem Heliport – Zomergem
EBZO – Zonnebeke/Zandvoorde Heliport – Zandvoorde
|
wikipedia
|
wiki_15960_chunk_0
|
List of MeSH codes (J02)
|
The following is a partial list of the "J" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (J01). Codes following these are found at List of MeSH codes (K01). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – food and beverages
|
wikipedia
|
wiki_6311_chunk_14
|
Code reuse
|
Design patterns A design pattern is a general solution to a recurring problem. Design patterns are more conceptual than tangible and can be modified to fit the exact need. However, abstract classes and interfaces can be reused to implement certain patterns. Frameworks Developers generally reuse large pieces of software via third-party applications and frameworks. Though frameworks are usually domain-specific and applicable only to families of applications. Higher-order function In functional programming higher-order functions can be used in many cases where design patterns or frameworks were formerly used. Retrocomputing
|
wikipedia
|
wiki_2443_chunk_133
|
Quantitative genetics
|
For the first example (two full first-cousins), their GRC = 0.5; for the second case (a full first and second cousin), their GRC = 0.3536.
All of these relationships (GRC) are applications of path-analysis. A summary of some levels of relationship (GRC) follow. Resemblances between relatives
These, in like manner to the Genotypic variances, can be derived through either the gene-model ("Mather") approach or the allele-substitution ("Fisher") approach. Here, each method is demonstrated for alternate cases.
|
wikipedia
|
wiki_5466_chunk_57
|
Quantum logic gate
|
Unitary transformations that are not in the set of gates natively available at the quantum computer (the primitive gates) can be synthesised, or approximated, by combining the available primitive gates in a circuit. One way to do this is to factor the matrix that encodes the unitary transformation into a product of tensor products (i.e. series and parallel circuits) of the available primitive gates. The group U(2q) is the symmetry group for the gates that act on qubits. Factorization is then the problem of finding a path in U(2q) from the generating set of primitive gates. The Solovay–Kitaev theorem shows that given a sufficient set of primitive gates, there exist an efficient approximate for any gate. For the general case with a large number of qubits this direct approach to circuit synthesis is intractable.
|
wikipedia
|
wiki_30767_chunk_0
|
Alternant code
|
In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes. Definition
An alternant code over GF(q) of length n is defined by a parity check matrix H of alternant form Hi,j = αjiyi, where the αj are distinct elements of the extension GF(qm), the yi are further non-zero parameters again in the extension GF(qm) and the indices range as i from 0 to δ − 1, j from 1 to n.
|
wikipedia
|
wiki_9784_chunk_5
|
Cellomics
|
Data management
Large numbers of images and amounts of data need to be managed when doing cellomics research. Data and image volumes can quickly range from 11MB to 1TB in less than a year, which is why cellomics uses the power of informatics to collect, organize, and archive all of this information. Secure and effective data mining requires the associated metadata to be captured and integrated into the data management model. Due to the critical nature of cellomics data management, implementing cellomics studies often requires inter-departmental cooperation between information technology and the life science research group leading the study. References Cell imaging
Omics
|
wikipedia
|
wiki_580_chunk_52
|
Tractatus Logico-Philosophicus
|
Umass.edu, (Contains German, and Ogden and Pears & McGuinness translations side-by-side-by-side)
Gutenberg.org (Ogden translation)
TractatusLogico-Philosophicus (As a hierarchically nested document)
The Tractatus (Easier-to-read nested Ogden translation with original symbols and images)
Philosurfical.open.ac.uk Research software tool aimed at facilitating the study of the Tractatus. The text is available in German and in both English translations (Ogden & Pears-McGuinness)
Graphical tabs-centered version of Tractatus Logico-Philosophicus (based on Pears & McGuinness translation)
LibriVox audiobook version of Tractatus Logico-Philosophicus (Ogden translation) (Version 1)
LibriVox audiobook version of Tractatus Logico-Philosophicus (Ogden translation) (Version 2)
Tree-like version of Tractatus Logico-Philosophicus (Ogden translation)
|
wikipedia
|
wiki_24800_chunk_0
|
Path-based strong component algorithm
|
In graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with two stacks, one to keep track of the vertices in the current component and the second to keep track of the current search path. Versions of this algorithm have been proposed by , , , , and ; of these, Dijkstra's version was the first to achieve linear time.
|
wikipedia
|
wiki_12870_chunk_1
|
Dexterity (programming language)
|
History of Dexterity
Great Plains Dexterity is a proprietary programming language and technology, designed in the late 1980s with the goal to build a platform-independent graphical accounting package - Great Plains Dynamics. Dexterity itself is written in C (with the hope that C would provide platform independence). The user can install Dexterity from the Dynamics GP CD #2 and it allows custom pieces to be seamlessly integrated with the Dynamics GP interface.
|
wikipedia
|
wiki_14278_chunk_1
|
Museum of Roman Civilization
|
It houses, among other things:
a model of Archaic Rome (Room XVIII)
a scale model of ancient Rome in the age of Constantine I by Italo Gismondi (Room XXXVII-XXXVIII), derived from the Forma Urbis Romae map and integrated with archeological discoveries. This model is at a 1:250 scale and is made of plaster. The model was begun in 1935 and completed in 1971. This model is today the most important reference for any serious attempt of reconstruction of the Ancient Rome: it has been used for the "Rome Reborn 1.0" 3D Visualization Project (B. Frischer, Director, University of Virginia; D. Favro, Associate Director, UCLA; D. Abernathy, Director of 3D Modeling, University of Virginia; G. Guidi, Director of 3D Scanning, Politecnico di Milano). Gismondi's model can be seen also in a few shots of Ridley Scott's Gladiator.
examples of late imperial and early Christian art
a complete sequence of casts of the spiral reliefs round Trajan's Column, arranged in horizontal rows at ground level to facilitate reading.
a reconstructed Roman library based on that in the Villa Adriana at Tivoli
|
wikipedia
|
wiki_4466_chunk_21
|
E8 (mathematics)
|
where is the Euclidean inner product and are the simple roots. The entries are independent of the choice of simple roots (up to ordering). The Cartan matrix for E8 is given by
The determinant of this matrix is equal to 1. Simple roots A set of simple roots for a root system Φ is a set of roots that form a basis for the Euclidean space spanned by Φ with the special property that each root has components with respect to this basis that are either all nonnegative or all nonpositive. Given the E8 Cartan matrix (above) and a Dynkin diagram node ordering of:
|
wikipedia
|
wiki_6259_chunk_8
|
Viking lander biological experiments
|
Labeled release
The labeled release (LR) experiment (PI: Gilbert Levin, Biospherics Inc.) gave the most promise for exobiologists. In the LR experiment, a sample of Martian soil was inoculated with a drop of very dilute aqueous nutrient solution. The nutrients (7 molecules that were Miller-Urey products) were tagged with radioactive 14C. The air above the soil was monitored for the evolution of radioactive 14CO2 (or other carbon-based) gas as evidence that microorganisms in the soil had metabolized one or more of the nutrients. Such a result was to be followed with the control part of the experiment as described for the PR below. The result was quite a surprise, considering the negative results of the first two tests, with a steady stream of radioactive gases being given off by the soil immediately following the first injection. The experiment was done by both Viking probes, the first using a sample from the surface exposed to sunlight and the second probe taking the sample from underneath a rock; both initial injections came back positive. Sterilization control tests were subsequently carried out by heating various soil samples. Samples heated for 3 hours at 160 °C gave off no radioactive gas when nutrients were injected, and samples heated for 3 hours at 50 °C exhibited a substantial reduction in radioactive gas released following nutrient injection. A sample stored at 10 °C for several months was later tested showing significantly reduced radioactive gas release.
|
wikipedia
|
wiki_7654_chunk_9
|
Software transactional memory
|
Composable operations
In 2005, Tim Harris, Simon Marlow, Simon Peyton Jones, and Maurice Herlihy described an STM system built on Concurrent Haskell that enables arbitrary atomic operations to be composed into larger atomic operations, a useful concept impossible with lock-based programming. To quote the authors:
|
wikipedia
|
wiki_32283_chunk_2
|
Dehn function
|
The idea of an isoperimetric function for a finitely presented group goes back to the work of Max Dehn in 1910s. Dehn proved that the word problem for the standard presentation of the fundamental group of a closed oriented surface of genus at least two is solvable by what is now called Dehn's algorithm. A direct consequence of this fact is that for this presentation the Dehn function satisfies Dehn(n) ≤ n. This result was extended in 1960s by Martin Greendlinger to finitely presented groups satisfying the C'(1/6) small cancellation condition. The formal notion of an isoperimetric function and a Dehn function as it is used today appeared in late 1980s – early 1990s together with the introduction and development of the theory of word-hyperbolic groups. In his 1987 monograph "Hyperbolic groups" Gromov proved that a finitely presented group is word-hyperbolic if and only if it satisfies a linear isoperimetric inequality, that is, if and only if the Dehn function of this group is equivalent to the function f(n) = n. Gromov's proof was in large part informed by analogy with filling area functions for compact Riemannian manifolds where the area of a minimal surface bounding a null-homotopic closed curve is bounded in terms of the length of that curve.
|
wikipedia
|
wiki_7597_chunk_25
|
OverPower
|
Promo cards
Besides the expansion sets, many Overpower cards were released as special promotions. The original Any Hero specials, by example, were comic book inserts in various Marvel comic books released in October 1995. Most promotional cards were never released in any expansion set, but some were reprinted in Mission Control and Monumental OverPower, but with different artwork. Promotional cards were considered legal to use in tournament decks.
A list of all existing promotional cards follows:
Original Marvel Any Hero Specials - 5 Any Hero special cards, available as random inserts in the following Marvel comics, one per comic, all released in October 1995: Amazing Spider-Man #397, Avengers #391, Captain America #444, Excalibur #90, Fantastic Four #405, Green Goblin #1, Incredible Hulk #434, Iron man #321, Spider-Man #63, Starjammers #1, Uncanny X-Men #325, Web of Spider-Man #128, X-Factor #115, X-Force #47, X-Man #8 and X-Men #45.
Web-Headed Wizard Any Hero Special - Available as an insert in Wizard Magazine #50 (Oct 1995).
Oversized 5" by 7" Hero Placards - Identical to the character cards of the original Marvel OverPower, but bigger. Available as a Mail-Away offer, in three groups of 13 placards each, in the following magazines: Wizard Magazine #52 (Oct 1995), InQuest Magazine (Dec 1995) and OverPower Legion Monthly Venture #4 (Summer 1996).
Hillshire Farms Expansion Set - 10 characters (5 reprints from Marvel OverPower, 4 reprints from Powersurge and 1 new, Doppelganger), 9 specials (1 Any Hero and 8 for existing OverPower and Powersurge characters) and 1 universe card, all related to Spider-Man storyline. Available as inerts in boxes of Lunch 'N Munch Hillshire Farms pre-packaged lunches, 2 per box, Summer 1996. The Any Hero special was reprinted in the IQ OverPower set. Doppelganger was reprinted in the Monumental OverPower set.
Powersurge Any Hero Specials - 2 Any Hero special cards, Confusion and Savage Land, available as inserts in the InQuest Magazine #9 (Jan 1996) and Combo Magazine #21 (Feb 1996), respectively.
Fighting 6 Prototype card - A level 6 Fighting power card, slightly different from the one released with Marvel Overpower. Available as an insert in Ventura Magazine #1 (July/August 1995), and in OverPower Legion Monthly Venture (the official OverPower newspaper) #5 (Nov 1996).
Prerelease Event cards - 2 event cards, available as inserts in Inquest Magazine #13 (Jan 1996), Wizard Magazine #57 (May 1996) and Wizard Wolverine Tribute Edition Magazine (Fall 1996), 1 per magazine. Both would be released in the Mission Control set.
Galactus character card - Available as an insert in OverPower Legion Monthly Venture #2 (April 1996).
Captain Universe card - A universe card, available as an insert in Wizard Magazine #58 and InQuest Magazine #14, both June 1996.
OverPower Powersurge Invincibles - 1 character (Adam Warlock) and 3 specials, available on purchasing Kay-Bee Toys Exclusive OverPower Powersurge Invincibles action figures, Winter 1996. There were four different figures (Adam Warlock, Bone Claws Wolverine, Scarlet Spider and Night Armor Iron Man), each came with a different card. Those 4 cards were reprinted in the Monumental Overpower set.
Hideout Discovered! Any Mission Event - Given to the attendants of GenCon'96, held at Milwaukee, Wisconsin, August 1996.
Onslaught OverPower Expansion Set - 34 cards, being 4 characters (Dark Beast, Holocaust, Onslaught and Post ), 18 specials (6 for each character except Dark Beast), 1 mission of 7 cards and 5 events. The characters, specials and events were available as random inserts in the following Marvel Comics, 2 per comic, all released in October 1996: Amazing Spider-Man #416, Cable #36, Excalibur #102, Incredible Hulk #446, The Sensational Spider-Man #9, Spectacular Spider-Man #239, 2099: World of Tomorrow #2, X-Factor #127, X-Force #59 and X-Man #20. The cards had borders that were unique. The mission cards (and also the characters) were randomly inserted in packs of Marvel Ultra Onslaught Trading Cards, released Fall 1996, at the rate of 1 per 9 packs. All cards were obtainable through a mail-away offer with the purchasing of IQ OverPower booster packs. The characters, but not the specials were reprinted with new artwork in the Monumental OverPower set. Two additional new specials for each character (except for Dark Beast) were released in subsequent Overpower sets.
DC Any Character Specials - 6 Any Character special cards. Arkham Asylum could be obtained purchasing a sealed box of DC OverPower at the Berkeley Games Distributor. Likewise, The Fortress of Solitude could be obtained purchasing a sealed box at the WarGames West Distributor, and came as an insert in OverPower Legion Monthly Venture #7 (Apr 1997). The Batcave and Deal with the Devil were available as inserts in Combo Magazine #23 and Tuff Stuff's Collect Magazine (both Nov 1996). Justice League of America was a prize in a sanctioned tournament in 1997, and Urban Hunters was obtainable through an exclusive DC Comics SASE offer (Spring 1997).
Batman Holographic character cards - 6 variant character cards from the Batman storyline, randomly inserted in packs of the Batman Holo Series Trading Cards (1 per 72 packs), Winter 1996.
Any Power level 5 power card - Released as an insert in Combo Magazine #24 (Jan 1997).
Marvel vs Wildstorms Chromium character cards - 8 character cards, being 5 new (Black King, Brass, Crystal, Team X and Wynonna Earp) and 3 variant characters, randomly inserted in packs of Marvel vs Wildstorms Trading Cards, released Summer 1997, at the rate of 1 per 7 packs.
Beyonder character card - Available as an insert in OverPower Legion Monthly Venture #6 (March 1997). Beyonder's power grid contained 4 "infinite" symbols. Unlike Galactus, who had all 8's in 3 stats, Beyonder cannot just play "any" power card. He came with a special set of rules that stated his power grid was the combined total of all other active characters on his team. Thus, when a character gets KOed, Beyonder's stats could potentially be reduced. If he was the last character on a team, he maintained the power grid of the last active teammate. In addition, his inherent ability to play "any" non-OPD special, was limited to only specials of characters in your deck, to prevent abuse.
Accidental Inserts - 6 cards (1 Any Character special, 1 location, 2 universe cards and 2 tactic cards), meant to be promotional cards but accidentally inserted in some Classic OverPower packs, became ultra-rare cards. The location and one of the tactic cards were reprinted in the X-Men OverPower set.
Spawn Finite Power special card - Given to the attendants of Wizard World Convention, held at Chicago, Illinois, July 1998, this card was incorrectly cut. A correctly cut version was given as a prize at tournaments in 1999. This card was reprinted with the same artwork in the Image OverPower set. Originally intended to be an 'Any Hero' special, this card was mistakenly printed as a Spawn Special Card. Instead of fixing it, it was just decided that the card would play as printed.
MegaPower Expansion Set - 10 cards, being 1 location and 9 specials for X-Men storyline characters, available for selling at the official OverPower website at Winter 1999. The Specials were meant to be part of the X-Men OverPower set, but were left out.
Warlock character card - Available as an insert in Wizard Magazine #96 and InQuest Gamer Magazine #52, both released August 1999.
|
wikipedia
|
wiki_982_chunk_20
|
Institute of Electrical and Electronics Engineers
|
See also
Certified Software Development Professional (CSDP) program of the IEEE Computer Society
Glossary of electrical and electronics engineering
Engineering and Technology History Wiki
Eta Kappa Nu – IEEE HKN Honor society
IEEE Standards Association
Institution of Engineering and Technology (UK)
List of IEEE awards
List of IEEE conferences
List of IEEE Fellows References External links IEEE Xplore, research database and online digital library archive
IEEE History Center Institute of Electrical and Electronics Engineers
1963 establishments in New York (state)
Organizations based in New York City
Piscataway, New Jersey
Professional associations based in the United States
Standards organizations in the United States
|
wikipedia
|
wiki_31870_chunk_2
|
Frame technology (software engineering)
|
A substantial literature now exists that explains how FT can facilitate most aspects of software's life-cycle, including domain modeling, requirements gathering, architecture and design, construction, testing, documentation, fine tuning and evolution. Independent comparisons of FT to alternative approaches confirm that the time and resources needed to build and maintain complex systems can be substantially reduced. One reason: FT shields programmers from software's inherent redundancies: FT has reproduced COTS object-libraries from equivalent XVCL frame libraries that are two-thirds smaller and simpler; custom business applications are routinely specified and maintained by Netron FusionSPC frames that are 5% – 15% of the size of their assembled source files.
|
wikipedia
|
wiki_38745_chunk_3
|
Divergence (statistics)
|
Definition
Given a differentiable manifold M, a divergence on M is a function satisfying:
D(p, q) ≥ 0 for all p, q ∈ M (non-negativity),
D(p, q) = 0 if and only if p = q (identity of indiscernibles),
the quadratic part of the Taylor expansion of D(p, p + dp) defines a Riemannian metric on M.
Concretely, for every point in M, given a coordinate chart with coordinate denoted by x, the divergence is infinitesimally expressed as for a positive-definite matrix gx, where the matrix depends on the coordinate chart and the point x. The corresponding inner product gp on the tangent space TpM, which is independent of the coordinate chart (but varies by point p), is a Riemannian metric on M.
|
wikipedia
|
wiki_4743_chunk_7
|
List of important publications in statistics
|
Truth and Probability
Author: Frank P. Ramsey
Publication data: * Ramsey, Frank Plumpton; "Truth and Probability" (PDF), Chapter VII in The Foundations of Mathematics and other Logical Essays (1931).
Online version: https://web.archive.org/web/20080227205205/http://cepa.newschool.edu/het//texts/ramsey/ramsess.pdf
Description: Ramsey proposes elucidating a person's subjective probability for a proposition using a sequence of bets. Ramsey described his work as an elaboration of some pragmatic ideas of C. S. Peirce, which were expressed in "How to Make Our Ideas Clear".
Importance: Popularized the "Ramsey test" for eliciting subjective probabilities.
|
wikipedia
|
wiki_2638_chunk_8
|
French Alternative Energies and Atomic Energy Commission
|
Research centres for military applications
CEA DAM Île-de-France, Bruyères-le-Châtel, Essonne
CEA Cesta, Gironde
CEA Gramat
CEA Valduc, Côte-d'Or
CEA Le Ripault, Indre-et-Loire Subsidiaries and minority interests
Orano (4.8%)
STMicroelectronics (2.87% indirectly) CEA in Academics
|
wikipedia
|
wiki_26324_chunk_1
|
Energy Autonomy
|
Synopsis
In the book Scheer discusses that for the past two hundred years industrial civilization has relied predominantly upon fossil fuels, which are abundant and cheap but also have adverse social and environmental effects. Scheer argues that it would be more beneficial if they transition to renewable energy and distributed, decentralized energy generation, as this is a model that has already been proven to be successful. Much progress with renewable energy commercialization has already been made in Europe where the renewable energy industry is a multi-billion Euro industry with high growth rates.
|
wikipedia
|
wiki_90_chunk_16
|
Cumulative distribution function
|
Solution: using the given table of probabilities for each potential range of X and Y, the joint cumulative distribution function may be constructed in tabular form: Definition for more than two random variables
For random variables , the joint CDF is given by Interpreting the random variables as a random vector yields a shorter notation: Properties
Every multivariate CDF is:
Monotonically non-decreasing for each of its variables,
Right-continuous in each of its variables, The probability that a point belongs to a hyperrectangle is analogous to the 1-dimensional case: Complex case
|
wikipedia
|
wiki_990_chunk_8
|
Grover's algorithm
|
Problem description
As input for Grover's algorithm, suppose we have a function . In the "unstructured database" analogy, the domain represent indices to a database, and if and only if the data that x points to satisfies the search criterion. We additionally assume that only one index satisfies , and we call this index ω. Our goal is to identify ω. We can access f with a subroutine (sometimes called an oracle) in the form of a unitary operator Uω that acts as follows:
|
wikipedia
|
wiki_30380_chunk_12
|
Ramer–Douglas–Peucker algorithm
|
References External links
Boost.Geometry support Douglas–Peucker simplification algorithm
Implementation of Ramer–Douglas–Peucker and many other simplification algorithms with open source licence in C++
XSLT implementation of the algorithm for use with KML data.
You can see the algorithm applied to a GPS log from a bike ride at the bottom of this page
Interactive visualization of the algorithm
Implementation in F#
Ruby gem implementation
JTS, Java Topology Suite, contains Java implementation of many algorithms, including the Douglas-Peucker algorithm
Rosetta Code (Implementations in many languages)
|
wikipedia
|
wiki_34618_chunk_3
|
School of Electronics and Computer Science, University of Southampton
|
Research
The research conducted by ECS has achieved the top 5* rating in the last two Research Assessment Exercises, and in 2003 it was awarded the prestigious ‘best 5*’ rating by the Higher Education Funding Council for England (HEFCE). ECS currently contains six research groups:
Agents, Interaction and Complexity
Communications, Signal Processing and Control
Electronic and Software Systems
Electronics and Electrical Engineering
Nano Research Group
Web and Internet Science Fire and reconstruction
|
wikipedia
|
wiki_17964_chunk_8
|
National Engineering Laboratory
|
Cabinet Office archive
Scottish Screen Archive. Why Scotland, Why East Kilbride? (dramatised account of a tour by two businessmen (one English, the other American) of the New Town of East Kilbride containing descriptor of NEL and some footage of James Watt building with 'floating chair') External links
TUV NEL site
TRL
LGC
BRE
NAFEMS
NMO (National Measurement Office) website
DIUS (Department for Innovation, Universities and Skills) website
|
wikipedia
|
wiki_34110_chunk_3
|
Computer Model Railroad Interface
|
Build your own Universal Computer Interface (out of print, second edition)
Paperback: 410 pages
Publisher: McGraw-Hill (1997)
(hc)
(pbk.)
The Railroader's C/MRI Applications Handbook (version 2.1, 1999)
Spiral bound, 8.5x11 paper: ~250 pages
Self-published by JLC Enterprises, Grand Rapids, MI
The Railroader's C/MRI Applications Handbook (version 2.2, 2000)
Spiral bound, 8.5x11 paper: ~250 pages
Self-published by JLC Enterprises, Grand Rapids, MI
|
wikipedia
|
wiki_38180_chunk_1
|
Conservation biology of parasites
|
A note published in 1990 pointed out that the captive breeding and reintroduction program to save the black-footed ferret would cause the loss of its specific parasites and demanded "equal rights for parasites". A paper in 1992 warned that not only the loss of certain host species from the wild, but host population bottlenecks or the fragmentation of host populations would predictably lead to the extinction of host-specific parasites. The paper also noted that parasites exert selective pressures upon their host populations that increase host genetic diversity. At first, this view met with open scepticism. However, it became clear that the co-extinction of hosts and their specific parasites is likely to increase the current estimates of extinction rates significantly. A decade later, a study focusing on highly host-specific groups such as fig wasps, parasites, butterflies, and myrmecophil butterflies estimated the number of parasites put at risk by the endangered status of the host at about 6300. Other authors argued that host-specific parasite faunae have an unexpected advantage for conservation scientists. Their genealogies and population genetic patterns may help to illuminate their hosts' evolutionary and demographic history. Recently, scientists suggested that rich parasite faunae are inevitably needed for healthy ecosystem functioning and also that parasites and mutualists are the most endangered species on Earth. Even vets have started to argue about the conservational values of parasite species.
|
wikipedia
|
wiki_6285_chunk_7
|
Förster resonance energy transfer
|
depends on the donor-to-acceptor separation distance with an inverse 6th-power law due to the dipole–dipole coupling mechanism:
with being the Förster distance of this pair of donor and acceptor, i.e. the distance at which the energy transfer efficiency is 50%.
The Förster distance depends on the overlap integral of the donor emission spectrum with the acceptor absorption spectrum and their mutual molecular orientation as expressed by the following equation:
where is the fluorescence quantum yield of the donor in the absence of the acceptor, is the dipole orientation factor, is the refractive index of the medium, is the Avogadro constant, and is the spectral overlap integral calculated as
where is the donor emission spectrum, is the donor emission spectrum normalized to an area of 1, and is the acceptor molar extinction coefficient, normally obtained from an absorption spectrum.
The orientation factor is given by
where denotes the normalized transition dipole moment of the respective fluorophore, and denotes the normalized inter-fluorophore displacement.
= 2/3 is often assumed. This value is obtained when both dyes are freely rotating and can be considered to be isotropically oriented during the excited-state lifetime. If either dye is fixed or not free to rotate, then = 2/3 will not be a valid assumption. In most cases, however, even modest reorientation of the dyes results in enough orientational averaging that = 2/3 does not result in a large error in the estimated energy-transfer distance due to the sixth-power dependence of on . Even when is quite different from 2/3, the error can be associated with a shift in , and thus determinations of changes in relative distance for a particular system are still valid. Fluorescent proteins do not reorient on a timescale that is faster than their fluorescence lifetime. In this case 0 ≤ ≤ 4.
|
wikipedia
|
wiki_18975_chunk_4
|
Code wheel
|
2-ply
A simple 2-ply code wheel consisted of two circular sheets, both with challenge symbols printed at intervals around the rim, and with the back sheet containing a table of responses printed to fit to the circle, and the front sheet a series of holes allowing the responses to be viewed, each hole labelled with a challenge symbol. The computer would present three challenge symbols, and the user would read the response by rotating the front sheet until the first two challenge symbols were aligned with each other on the rim of the wheel, then read the response from the hole indicated by the third challenge symbol. This type of codewheel was used for a large number of games, such as Neuromancer, and Cybercon 3 (which used a code wheel printed on carbon paper).
|
wikipedia
|
wiki_26525_chunk_0
|
Materials science in science fiction
|
Materials science in science fiction is the study of how materials science is portrayed in works of science fiction. The accuracy of the materials science portrayed spans a wide range – sometimes it is an extrapolation of existing technology, sometimes it is a physically realistic portrayal of a far-out technology, and sometimes it is simply a plot device that looks scientific, but has no basis in science. Examples are:
Realistic case: In 1944, the science fiction story "Deadline" by Cleve Cartmill depicted the atomic bomb. The properties of various radioactive isotopes are critical to the proposed device, and the plot. This technology was real, unknown to the author.
Extrapolation: In the 1979 novel The Fountains of Paradise, Arthur C. Clarke wrote about space elevators - basically long cables extending from the Earth's surface to geosynchronous orbit. These require a material with enormous tensile strength and light weight. Carbon nanotubes are strong enough in theory, so the idea is plausible; while one cannot be built today, it violates no physical principles.
Plot device: An example of an unsupported plot device is scrith, the material used to construct Ringworld, in the novels by Larry Niven. Scrith possesses unreasonable strength, and is unsupported by physics as it is known, but needed for the plot.
|
wikipedia
|
wiki_27723_chunk_3
|
Mathieu group M24
|
M24 can be built starting from PSL(3,4), the projective special linear group of 3-dimensional space over the finite field with 4 elements . This group, sometimes called M21, acts on the projective plane over the field F4, an S(2,5,21) system called W21. Its 21 blocks are called lines. Any 2 lines intersect at one point.
M21 has 168 simple subgroups of order 360 and 360 simple subgroups of order 168. In the larger projective general linear group PGL(3,4) both sets of subgroups form single conjugacy classes, but in M21 both sets split into 3 conjugacy classes. The subgroups respectively have orbits of 6, called hyperovals, and orbits of 7, called Fano subplanes. These sets allow creation of new blocks for larger Steiner systems. M21 is normal in PGL(3,4), of index 3. PGL(3,4) has an outer automorphism induced by transposing conjugate elements in F4 (the field automorphism). PGL(3,4) can therefore be extended to the group PΓL(3,4) of projective semilinear transformations, which is a split extension of M21 by the symmetric group S3. PΓL(3,4) has an embedding as a maximal subgroup of M24.
|
wikipedia
|
wiki_30380_chunk_11
|
Ramer–Douglas–Peucker algorithm
|
Further reading
Urs Ramer, "An iterative procedure for the polygonal approximation of plane curves", Computer Graphics and Image Processing, 1(3), 244–256 (1972)
David Douglas & Thomas Peucker, "Algorithms for the reduction of the number of points required to represent a digitized line or its caricature", The Canadian Cartographer 10(2), 112–122 (1973)
John Hershberger & Jack Snoeyink, "Speeding Up the Douglas–Peucker Line-Simplification Algorithm", Proc 5th Symp on Data Handling, 134–143 (1992). UBC Tech Report TR-92-07 available at http://www.cs.ubc.ca/cgi-bin/tr/1992/TR-92-07
R.O. Duda and P.E. Hart, "Pattern classification and scene analysis", (1973), Wiley, New York (https://web.archive.org/web/20110715184521/http://rii.ricoh.com/~stork/DHS.html)
|
wikipedia
|
wiki_8759_chunk_2
|
POWER4
|
The POWER4 has a unified L2 cache, divided into three equal parts. Each has its own independent L2 controller which can feed 32 bytes of data per cycle. The Core Interface Unit (CIU) connects each L2 controller to either the data cache or instruction cache in either of the two processors. The Non-Cacheable (NC) Unit is responsible for handling instruction serializing functions and performing any noncacheable operations in the storage topology. There is an L3 cache controller, but the actual memory is off-chip. The GX bus controller controls I/O device communications, and there are two 4-byte wide GX buses, one incoming and the other outgoing. The Fabric Controller is the master controller for the network of buses, controlling communications for both L1/L2 controllers, communications between POWER4 chips {4-way, 8-way, 16-way, 32-way} and POWER4 MCM's. Trace-and-Debug, used for First Failure Data Capture, is provided. There is also a Built In Self Test function (BIST) and Performance Monitoring Unit (PMU). Power-on reset (POR) is supported.
|
wikipedia
|
wiki_51_chunk_48
|
Biostatistics
|
Other studies Ecology, ecological forecasting
Biological sequence analysis
Systems biology for gene network inference or pathways analysis.
Population dynamics, especially in regards to fisheries science.
Phylogenetics and evolution Tools There are a lot of tools that can be used to do statistical analysis in biological data. Most of them are useful in other areas of knowledge, covering a large number of applications (alphabetical). Here are brief descriptions of some of them:
|
wikipedia
|
wiki_361_chunk_60
|
Mathematical logic
|
Applications
"Mathematical logic has been successfully applied not only to mathematics and its foundations (G. Frege, B. Russell, D. Hilbert, P. Bernays, H. Scholz, R. Carnap, S. Lesniewski, T. Skolem), but also to physics (R. Carnap, A. Dittrich, B. Russell, C. E. Shannon, A. N. Whitehead, H. Reichenbach, P. Fevrier), to biology (J. H. Woodger, A. Tarski), to psychology (F. B. Fitch, C. G. Hempel), to law and morals (K. Menger, U. Klug, P. Oppenheim), to economics (J. Neumann, O. Morgenstern), to practical questions (E. C. Berkeley, E. Stamm), and even to metaphysics (J. [Jan] Salamucha, H. Scholz, J. M. Bochenski). Its applications to the history of logic have proven extremely fruitful (J. Lukasiewicz, H. Scholz, B. Mates, A. Becker, E. Moody, J. Salamucha, K. Duerr, Z. Jordan, P. Boehner, J. M. Bochenski, S. [Stanislaw] T. Schayer, D. Ingalls)." "Applications have also been made to theology (F. Drewnowski, J. Salamucha, I. Thomas)."
|
wikipedia
|
wiki_5644_chunk_8
|
Concurrency (computer science)
|
The Concurrency Representation Theorem in the actor model provides a fairly general way to represent concurrent systems that are closed in the sense that they do not receive communications from outside. (Other concurrency systems, e.g., process calculi can be modeled in the actor model using a two-phase commit protocol.) The mathematical denotation denoted by a closed system is constructed increasingly better approximations from an initial behavior called using a behavior approximating function to construct a denotation (meaning ) for as follows: In this way, can be mathematically characterized in terms of all its possible behaviors.
|
wikipedia
|
wiki_6860_chunk_0
|
Camelot Software Planning
|
{{Infobox company
| name = Camelot Co., Ltd.
| trade_name = Camelot Software Planning
| logo = Camelot Software Planning logo.png
| type = Kabushiki gaisha
| native_name = 株式会社キャメロット
| native_name_lang = ja
| romanized_name = Kabushiki gaisha Kyamerotto
| former_names = Sega CD4 (Consumer Development Studio 4)Sonic! Software Planning
| foundation = (As Sonic! Software Planning) (As Camelot Co. Ltd)
| location = Tokyo. Japan
| key_people = Hiroyuki TakahashiShugo TakahashiMotoi Sakuraba
| industry = Video games
| products = {{unbulleted list|Shining series|Golden Sun series|Mario sports games}}
| revenue =
| parent = Sega (1990–1995)
| num_employees = 45 (as of April 2021)
| homepage =
}}
|
wikipedia
|
wiki_1266_chunk_19
|
Postcodes in the United Kingdom
|
Postcodes linked to a variety of UK geographies
The Office for National Statistics (ONS Geography) maintains and publishes a series of freely available, downloadable postcode products that link all current and terminated UK postcodes to a range of administrative, health, statistical and other geographies using the Code-Point Open grid reference. Formatting
|
wikipedia
|
wiki_5408_chunk_15
|
Incivility
|
Movements and organizations promoting civility
Dr. P.M. Forni, a professor at Johns Hopkins University, co-founded the Johns Hopkins Civility Project in 1997. An aggregation of academic and community outreach activities, the JHCP aimed at assessing the significance of civility, manners and politeness in contemporary society. The JHCP has been reconstituted as The Civility Initiative at Johns Hopkins, which Dr. Forni now directs. This Web site is designed to introduce Dr. Forni's work on civility and to offer links to related material (http://sites.jhu.edu/civility/index.html).
The Civility Project is a voluntary, grassroots movement of people from diverse backgrounds who agree that, at this critical time in America's history, solutions to our most pressing problems will be found only through a more civil exchange of ideas. A web-based organization, CivilityProject.org hopes to promote more civility in public discourse. Mark DeMoss and long-time Clinton advisor Lanny Davis launched The Civility Project (http://www.CivilityProject.org) earlier 2009.
Choose Civility is an ongoing community-wide initiative, led by Howard County Library, to position Howard County, Maryland as a model of civility. The project intends to enhance respect, empathy, consideration and tolerance in Howard County (http://www.choosecivility.org).
The National Civility Center is a not-for-profit organization established in 2000 to help people make their communities better places to live. They believe that a comprehensive approach to community improvement—one that engages all local stakeholders around shared ideas and a unified plan for action—can help community members and organizations become more effective at solving tough social issues (http://www.civilitycenter.org).
The Institute for Civility believes there are two key threats to the effectiveness and efficiency of our governing process today. A nation experiencing both polarization and citizen apathy is a nation at risk. The institute works to reduce polarization in society by focusing on the very public civility (or lack of it!) in the governing process by facilitating dialogue, teaching respect, and building civility (http://www.instituteforcivility.org/ and http://www.civilityblog.org/).
"The Civility Institute" (http://www.civilityinstitute.com), founded by Dr. Benet Davetian (author of Civility-A Cultural History), conducts research on civility and provides consultations for institutions, schools, corporations. The goal of the institute is to offer beneficiaries with a practical understanding of the social psychology of civility and how civility can be increased without interfering with the mandates of a competitive society.
|
wikipedia
|
wiki_25322_chunk_32
|
Outer space (mathematics)
|
Applications and generalizations
The closure of in the length function topology is known to consist of (Fn-equivariant isometry classes of) all very small minimal isometric actions of Fn on R-trees. Here the closure is taken in the space of all minimal isometric "irreducible" actions of on -trees, considered up to equivariant isometry. It is known that the Gromov topology and the axes topology on the space of irreducible actions coincide, so the closure can be understood in either sense. The projectivization of with respect to multiplication by positive scalars gives the space which is the length function compactification of and of , analogous to Thurston's compactification of the Teichmüller space.
Analogs and generalizations of the Outer space have been developed for free products, for right-angled Artin groups, for the so-called deformation spaces of group actions and in some other contexts.
A base-pointed version of Outer space, called Auter space, for marked metric graphs with base-points, was constructed by Hatcher and Vogtmann in 1998. The Auter space shares many properties in common with the Outer space, but only comes with an action of .
|
wikipedia
|
wiki_23735_chunk_1
|
Bowyer–Watson algorithm
|
Description
The Bowyer–Watson algorithm is an incremental algorithm. It works by adding points, one at a time, to a valid Delaunay triangulation of a subset of the desired points. After every insertion, any triangles whose circumcircles contain the new point are deleted, leaving a star-shaped polygonal hole which is then re-triangulated using the new point. By using the connectivity of the triangulation to efficiently locate triangles to remove, the algorithm can take O(N log N) operations to triangulate N points, although special degenerate cases exist where this goes up to O(N2).
|
wikipedia
|
wiki_19306_chunk_1
|
BV4.1 (software)
|
System requirements: Windows PC (Windows NT 4.0/Windows 98+).
Support of the file formats Excel, ACCESS, SQL Server and CSV.
User-friendly graphical user interface.
Analyses of monthly and quarterly time series.
Possibility of mass production of time series decompositions and seasonal adjustments.
Various possibilities of graphic evaluations of analysis results.
Possibility to execute so-called successive analyses, i.e. analyses where the analysis spans are extended gradually by one additional period. This option is useful for examining such revisions of analysis results originating from the BV4.1 procedure itself.
|
wikipedia
|
wiki_18206_chunk_4
|
Outline of trigonometry
|
Hansen's problem
Snellius–Pothenot problem
Great-circle distance – how to find that distance if one knows the latitude and longitude.
Resection (orientation)
Vincenty's formulae
Geographic distance
Triangulation in three dimensions Navigation Haversine formula
Rule of marteloio Engineering Belt problem
Phase response
Phasor
Rake (angle) Analog devices Dialing scales
Gunter's quadrant
Gunter's scale
Protractor
Scale of chords Calculus
|
wikipedia
|
wiki_2151_chunk_63
|
D (programming language)
|
Example 2
The following shows several D capabilities and D design trade-offs in a short program. It iterates over the lines of a text file named words.txt, which contains a different word on each line, and prints all the words that are anagrams of other words. import std.stdio, std.algorithm, std.range, std.string; void main() {
dstring[] [dstring] signature2words;
|
wikipedia
|
wiki_4891_chunk_5
|
Boolean function
|
Negation normal form, an arbitrary mix of AND and ORs of the arguments and their complements
Disjunctive normal form, as an OR of ANDs of the arguments and their complements
Conjunctive normal form, as an AND of ORs of the arguments and their complements
Canonical normal form, a standardized formula which uniquely identifies the function:
Algebraic normal form or Zhegalkin polynomial, as a XOR of ANDs of the arguments (no complements allowed)
Full (canonical) disjunctive normal form, an OR of ANDs each containing every argument or complement (minterms)
Full (canonical) conjunctive normal form, an AND of ORs each containing every argument or complement (maxterms)
Blake canonical form, the OR of all the prime implicants of the function
Boolean formulas can also be displayed as a graph:
Propositional directed acyclic graph
Digital circuit diagram of logic gates, a Boolean circuit
And-inverter graph, using only AND and NOT
In order to optimize electronic circuits, Boolean formulas can be minimized using the Quine–McCluskey algorithm or Karnaugh map.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.