source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Overlapped%20I/O | Overlapped I/O is a name used for asynchronous I/O in the Windows API. It was introduced as an extension to the API in Windows NT.
Utilizing overlapped I/O requires passing an OVERLAPPED structure to API functions that normally block, including ReadFile(), WriteFile(), and Winsock's WSASend() and WSARecv(). The requested operation is initiated by a function call which returns immediately, and is completed by the OS in the background. The caller may optionally specify a Win32 event handle to be raised when the operation completes. Alternatively, a program may receive notification of an event via an I/O completion port, which is the preferred method of receiving notification when used in symmetric multiprocessing environments or when handling I/O on a large number of files or sockets. The third and the last method to get the I/O completion notification with overlapped IO is to use ReadFileEx() and WriteFileEx(), which allow the User APC routine to be provided, which will be fired on the same thread on completion (User APC is the thing very similar to Unix/POSIX signal, with the main difference being that the signals are using signal numbers from the historically predefined enumeration, while the User APC can be any function declared as "void f(void* context)"). The so-called overlapped API presents some differences depending on the Windows version used.
Asynchronous I/O is particularly useful for sockets and pipes.
Unix and Linux implement the POSIX asynchronous I/O API (AIO). |
https://en.wikipedia.org/wiki/Institute%20of%20Zoology | The Institute of Zoology (IoZ) is the research division of the Zoological Society of London (ZSL) in England. It is a government-funded research institute specialising in scientific issues relevant to the conservation of animal species and their habitats. The Institute is based alongside London Zoo at ZSL's Regent's Park site in the City of Westminster.
The Institute has around 25 full-time research staff, plus postdoctoral research assistants, technicians and Ph.D. students. The Institute is supported by the Higher Education Funding Council for England in partnership with the University of Cambridge, and receives additional research funding from UK research councils (NERC, BBSRC, ESRC) and research charities (the Wellcome Trust and the Leverhulme Trust). Research covers many fundamental aspects of biological sciences which have relevance to the conservation of animal species and their habitats.
The Institute offers research training through Ph.D. studentships, and hosts Undergraduate and Masters level research projects conducted as part of its own M.Sc. courses and courses at other institutions. Undergraduate projects are available at London Zoo and Whipsnade Zoo.
See also
Living Planet Index
Red List Index
Regional Red List
EDGE of Existence Programme
EDGE Species |
https://en.wikipedia.org/wiki/Sausage%20making | The origins of meat preservation are lost to the ages but probably began when humans began to realize the preservative value of salt.
Sausage making originally developed as a means to preserve and transport meat. Primitive societies learned that dried berries and spices could be added to dried meat.
The procedure of stuffing meat into casings remains basically the same today, but sausage recipes have been greatly refined and sausage making has become a highly respected culinary art.
Sausages come in two main types: fresh and cured. Cured sausages may be either cooked or dried. Many cured sausages are smoked, but this is not mandatory. The curing process itself changes the meat and imparts its own flavors. An example is the difference in taste between a pork roast and a ham.
All smoked sausages are cured. The reason is the threat of botulism. The bacterium responsible, Clostridium botulinum, is ubiquitous in the environment, grows in the anaerobic conditions created in the interior of the sausage, and thrives in the to temperature range common in the smoke house and subsequent ambient storage. Thus, for safety reasons, sausages are cured before smoking.
Types of sausages and their storage
Fresh sausages
Fresh sausages are simply seasoned ground meats that are cooked before serving. Fresh sausages normally do not use cure (Prague powder #1) although cure can be used if desired. In addition fresh sausages typically do not use smoke flavors, although liquid smoke can be used. Fresh sausages are never smoked in a cold smoker because of the danger of botulism.
The primary seasoning agents in fresh sausages are salt and sugar along with various savory herbs and spices, and often vegetables, including onion and garlic.
A British fresh sausage typically contains around 10% butcher's rusk, 10% water, 2.5% seasoning, and 77.5% meat. At the point of sale, British sausages will often be labelled as "actual meat content X%". As meat can be fatty or lean, the X% is calcul |
https://en.wikipedia.org/wiki/Paragonimiasis | Paragonimiasis is a food-borne parasitic disease caused by several species of lung flukes belonging to genus Paragonimus. Infection is acquired by eating crustaceans such as crabs and crayfishes which host the infective forms called metacercariae, or by eating raw or undercooked meat of mammals harboring the metacercariae from crustaceans.
More than 40 species of Paragonimus have been identified; 10 of these are known to cause disease in humans. The most common cause of human paragonimiasis is P. westermani, the oriental lung fluke.
About 22 million people are estimated to be affected yearly worldwide. It is particularly common in East Asia. Paragonimiasis is easily mistaken for other diseases with which it shares clinical symptoms, such as tuberculosis and lung cancer.
Life cycle
Not all Paragonimus species infect humans. However, all of them target mammals as their final (definitive) hosts. In mammalian lung tissue, the adult flukes live as encapsulated pairs. As hermaphrodites, they produce and fertilise their own eggs that are released through the respiratory tract. The eggs are excreted to the environment either through the sputum or swallowed and passed out along the faeces.
In the external environment, the eggs remain unembryonated until ideal conditions of temperature and humidity are encountered. Then, they embryonate and develop into ciliated larvae called miracidia. As the egg shells disintegrate, the motile miracidia hatch and swim to seek the first intermediate host, a snail, and penetrate its soft tissues. Each miracidium goes through several developmental stages inside the snail: firstly into a series of daughter cells called sporocysts and then into rediae, which give rise to many worm-like larvae called cercariae. The cercariae penetrate through the body of the snail, emerging into the water. Development in the snail takes about 9 to 13 weeks.
The cercariae then infect the second intermediate host, a crustacean such as a crab or crayfish, where |
https://en.wikipedia.org/wiki/Anamorphosis | Anamorphosis is a distorted projection that requires the viewer to occupy a specific vantage point, use special devices, or both to view a recognizable image. It is used in painting, photography, sculpture and installation, toys, and film special effects. The word is derived from the Greek prefix ana-, meaning "back" or "again", and the word morphe, meaning "shape" or "form". Extreme anamorphosis has been used by artists to disguise caricatures, erotic and scatological scenes, and other furtive images from a casual spectator, while revealing an undistorted image to the knowledgeable viewer.
Types of projection
There are two main types of anamorphosis: perspective (oblique) and mirror (catoptric). More complex anamorphoses can be devised using distorted lenses, mirrors, or other optical transformations.
An oblique anamorphism forms an affine transformation of the subject. Early examples of perspectival anamorphosis date to the Renaissance of the fifteenth century and largely relate to religious themes.
With mirror anamorphosis, a conical or cylindrical mirror is placed on the distorted drawing or painting to reveal an undistorted image. The deformed picture relies on laws regarding angles of incidence of reflection. The length of the flat drawing's curves are reduced when viewed in a curved mirror, such that the distortions resolve into a recognizable picture. Unlike perspective anamorphosis, catoptric images can be viewed from many angles. The technique was originally developed in China during the Ming Dynasty, and the first European manual on mirror anamorphosis was published around 1630 by the mathematician Vaulezard.
Channel anamorphosis or tabula scalata has a different image on each side of a corrugated carrier. A straight frontal view shows an unclear mix of the images, while each image can be viewed correctly from a certain angle.
History
Prehistory
The Stone Age cave paintings at Lascaux may make use of anamorphic technique, because the oblique angle |
https://en.wikipedia.org/wiki/Evolutionary%20ethics | Evolutionary ethics is a field of inquiry that explores how evolutionary theory might bear on our understanding of ethics or morality. The range of issues investigated by evolutionary ethics is quite broad. Supporters of evolutionary ethics have claimed that it has important implications in the fields of descriptive ethics, normative ethics, and metaethics.
Descriptive evolutionary ethics consists of biological approaches to morality based on the alleged role of evolution in shaping human psychology and behavior. Such approaches may be based in scientific fields such as evolutionary psychology, sociobiology, or ethology, and seek to explain certain human moral behaviors, capacities, and tendencies in evolutionary terms. For example, the nearly universal belief that incest is morally wrong might be explained as an evolutionary adaptation that furthered human survival.
Normative (or prescriptive) evolutionary ethics, by contrast, seeks not to explain moral behavior, but to justify or debunk certain normative ethical theories or claims. For instance, some proponents of normative evolutionary ethics have argued that evolutionary theory undermines certain widely held views of humans' moral superiority over other animals.
Evolutionary metaethics asks how evolutionary theory bears on theories of ethical discourse, the question of whether objective moral values exist, and the possibility of objective moral knowledge. For example, some evolutionary ethicists have appealed to evolutionary theory to defend various forms of moral anti-realism (the claim, roughly, that objective moral facts do not exist) and moral skepticism.
History
The first notable attempt to explore links between evolution and ethics was made by Charles Darwin in The Descent of Man (1871). In Chapters IV and V of that work Darwin set out to explain the origin of human morality in order to show that there was no absolute gap between man and animals. Darwin sought to show how a refined moral sense, or cons |
https://en.wikipedia.org/wiki/Peer%20Name%20Resolution%20Protocol | Peer Name Resolution Protocol (PNRP) is a peer-to-peer protocol designed by Microsoft. PNRP enables dynamic name publication and resolution, and requires IPv6.
PNRP was first mentioned during a presentation at a P2P conference in November 2001. It appeared in July 2003 in the Advanced Networking Pack for Windows XP, and was later included in the Service Pack 2 for Windows XP. PNRP 2.0 was introduced with Windows Vista and was available for download for Windows XP Service Pack 2 users. PNRP 2.1 is included in Windows Vista SP1, Windows Server 2008 and Windows XP SP3. PNRP v2 is not available for Windows XP Professional x64 Edition or any edition of Windows Server 2003.
Windows Remote Assistance in Windows 7 uses PNRP, Teredo and IPv6 when connecting using the Easy Connect option.
The design of PNRP is covered by US Patent #7,065,587, issued on June 20, 2006.
Support for PNRP was removed in Windows 10 with version 1909.
PNRP services
The PNRP is a distributed name resolution protocol allowing Internet hosts to publish "peer names" and corresponding IPv6 addresses and optionally other information. Other hosts can then resolve the peer name, retrieve the corresponding addresses and other information, and establish peer-to-peer connections.
With PNRP, peer names are composed of an "authority" and a "qualifier". The authority is identified by a secure hash of an associated public key, or by a place-holder (the number zero) if the peer name is "unsecured". The qualifier is a string, allowing an authority to have different peer names for different services.
If a peer name is secure, the PNRP name records are signed by the publishing authority, and can be verified using its public key. Unsecured peer names can be published by anybody, without possible verification.
Multiple entities can publish the same peer name. For example, if a peer name is associated with a group, any group member can publish addresses for the peer name.
Peer names are published and resolve |
https://en.wikipedia.org/wiki/Nomad%20software | NOMAD is a relational database and fourth-generation language (4GL), originally developed in the 1970s by time-sharing vendor National CSS. While it is still in use today, its widest use was in the 1970s and 1980s. NOMAD supports both the relational and hierarchical database models.
NOMAD provides both interactive and batch environments for data management and application development, including commands for database definition, data manipulation, and reporting. All components are accessible by and integrated through a database-oriented programming language. Unlike many tools for managing mainframe data, which are geared to the needs of professional programmers in MIS departments, NOMAD is particularly designed for (and sold to) application end-users in large corporations. End-users employ Nomad in batch production cycles and in Web-enabled applications, as well as for reporting and distribution via the web or PC desktop.
Capabilities
NOMAD is distinguished by five characteristics:
An intuitive database-oriented fourth-generation programming language (4GL) for creating databases, managing data, and writing applications
An interactive environment in which any 4GL statement may be typed and immediately processed (comparable to interactive tools like PHP or Perl)
Relational database features, supporting lookup tables and the other elements of a normalized relational database
Powerful set-at-a-time operations under the control of simple imperative commands
Accesses data from many sources, such as VSAM, IMS, IDMS, DB2, Oracle, and SQL Server.
NOMAD's language was designed to simplify the application development process, especially for reporting applications. Where possible, common requirements were addressed by intuitive nonprocedural syntax elements, to avoid traditional programming. The heart of the system was the LIST command, which created report output.
LIST BY STATE BY CUST_ID NAME PHONE ACROSS STATUS BALANCE WHERE STATE AMONG('CT','NY')
State Customer ID Nam |
https://en.wikipedia.org/wiki/Endoreduplication | Endoreduplication (also referred to as endoreplication or endocycling) is replication of the nuclear genome in the absence of mitosis, which leads to elevated nuclear gene content and polyploidy. Endoreplication can be understood simply as a variant form of the mitotic cell cycle (G1-S-G2-M) in which mitosis is circumvented entirely, due to modulation of cyclin-dependent kinase (CDK) activity. Examples of endoreplication characterized in arthropod, mammalian, and plant species suggest that it is a universal developmental mechanism responsible for the differentiation and morphogenesis of cell types that fulfill an array of biological functions. While endoreplication is often limited to specific cell types in animals, it is considerably more widespread in plants, such that polyploidy can be detected in the majority of plant tissues.
Examples in nature
Endoreplicating cell types that have been studied extensively in model organisms
Endoreplication, endomitosis and polytenization
Endoreplication, endomitosis and polytenization are three somewhat different processes resulting in polyploidization of a cell in a regulated manner. In endoreplication cells skip M phase completely, resulting in a mononucleated polyploid cell. Endomitosis is a type of cell cycle variation where mitosis is initiated, but some of the processes are not completed. Depending on how far the cell progresses through mitosis, this will give rise to a mononucleated or binucleated polyploid cell. Polytenization arises with under- or overamplification of some genomic regions, creating polytene chromosomes.
Biological significance
Based on the wide array of cell types in which endoreplication occurs, a variety of hypotheses have been generated to explain the functional importance of this phenomenon. Unfortunately, experimental evidence to support these conclusions is somewhat limited:
Cell/organism size
Cell ploidy often correlates with cell size, and in some instances, disruption of endoreplication |
https://en.wikipedia.org/wiki/Lightweight%20Imaging%20Device%20Interface%20Language | Lightweight Imaging Device Interface Language (abbr. LIDIL) is a printer interface definition language used in more recent Hewlett-Packard printers.
This language is commonly used on HP Deskjets that do not support the PCL printer language. As the name suggests, the language only supports the definition of raster documents, and is very limited overall. It is a "host-based" protocol which is advertised with LDL in the CMD: (command set) field of the device ID string. Such models do not support printing ASCII text.
External links
Host-based printing (including LIDIL)
Page description languages
Specification languages |
https://en.wikipedia.org/wiki/Memory-disk%20synchronization | Memory-disk synchronisation is a process used in computers that immediately writes to disk any data queued for writing in volatile memory. Data is often held in this way for efficiency's sake, since writing to disk is a much slower process than writing to RAM. Disk synchronization is needed when the computer is going to be shut down, or occasionally if a particularly important bit of data has just been written.
In Unix-like systems, a disk synchronization may be requested by any user with the sync command.
See also
mmap, a POSIX-compliant Unix system call that maps files or devices into memory
msync, a POSIX-compliant Unix system call that forcefully flush memory to disk and synchronize
Computer memory |
https://en.wikipedia.org/wiki/Partbook | A partbook is a format for printing or copying music in which each book contains the part for a single voice or instrument, especially popular during the Renaissance and Baroque. This format contrasts with the large choirbook, which included all of the voice parts and could be shared by an entire choir. The choirbook still followed the convention to notate the parts separately, but within a double page, likewise part books were arranged that they show the one extract of the composition on the same page.
The production of partbooks appears to have been a cost-cutting measure, as large-scale printing was much more expensive. For example, by 1529, King's College, Cambridge had replaced almost all of its choirbooks with partbooks. The reduced cost also allowed each performer to have his own copy, and partbooks were more portable than a choirbook. They were, however, flimsy, and originals do not survive in large numbers.
Choral scores completely replaced individual vocal parts during the 19th century. While instruments continue to use parts for ease of page turning, these are rarely bound into "books" and are no longer so called. |
https://en.wikipedia.org/wiki/WBSF | WBSF (channel 46), branded on-air as CW 46, is a television station licensed to Bay City, Michigan, United States, serving northeastern Michigan as an affiliate of The CW. It is owned by Cunningham Broadcasting, which maintains a shared services agreement (SSA) with Sinclair Broadcast Group, owner of Flint-licensed Fox affiliate WSMH (channel 66), for the provision of certain services. Sinclair also operates Saginaw-licensed NBC affiliate WEYI-TV (channel 25) under a separate SSA with owner Howard Stirk Holdings.
The three stations share studios on West Pierson Road in Mount Morris Township (with a Flint mailing address); WBSF's transmitter is located at its former studios on West Willard Road in Vienna Township along the Genesee–Saginaw county line (with a Clio mailing address).
History
A permit was issued by the FCC for a new station on channel 46 in Bay City to Vista Communications Group in late 2003. The station was expected to be the WB network affiliate for the Flint/Tri-Cities market.
On October 1, 2004, the station's construction permit was approved. In that same year, Barrington launched WBSF on cable and on WEYI's second digital subchannel, bringing The WB back to the market after a three-year absence (WB programming in-market was last seen on WEYI on a secondary clearance from 1999 to 2001). On February 2, 2005, the FCC transferred the permit to Acme Television then to Barrington Broadcasting.
With the merger of The WB and UPN to become The CW, WBSF became the area's network affiliate in September 2006 when the channel began broadcasting over the air. Because of this, a chance existed that WKBD (which along with WBKP are the only other over-the-air CW affiliates in Michigan) would be dropped from this market's cable systems as both WBSF and WKBD would be CW affiliates. However, in the case of Midland, two CBS affiliates do coexist on the same cable system. This occurred on Charter's Tri-Cities systems which replaced WKBD with MyNetworkTV affiliate WNE |
https://en.wikipedia.org/wiki/Restriction%20site | Restriction sites, or restriction recognition sites, are located on a DNA molecule containing specific (4-8 base pairs in length) sequences of nucleotides, which are recognized by restriction enzymes. These are generally palindromic sequences (because restriction enzymes usually bind as homodimers), and a particular restriction enzyme may cut the sequence between two nucleotides within its recognition site, or somewhere nearby.
Function
For example, the common restriction enzyme EcoRI recognizes the palindromic sequence GAATTC and cuts between the G and the A on both the top and bottom strands. This leaves an overhang (an end-portion of a DNA strand with no attached complement) known as a sticky end on each end of AATT. The overhang can then be used to ligate in (see DNA ligase) a piece of DNA with a complementary overhang (another EcoRI-cut piece, for example).
Some restriction enzymes cut DNA at a restriction site in a manner which leaves no overhang, called a blunt end. Blunt ends are much less likely to be ligated by a DNA ligase because the blunt end doesn't have the overhanging base pair that the enzyme can recognize and match with a complementary pair. Sticky ends of DNA however are more likely to successfully bind with the help of a DNA ligase because of the exposed and unpaired nucleotides. For example, a sticky end trailing with AATTG is more likely to bind with a ligase than a blunt end where both the 5' and 3' DNA strands are paired. In the case of the example the AATTG would have a complementary pair of TTAAC which would reduce the functionality of the DNA ligase enzyme.
Applications
Restriction sites can be used for multiple applications in molecular biology such as identifying restriction fragment length polymorphisms (RFLPs).
Databases
Several databases exist for restriction sites and enzymes, of which the largest noncommercial database is REBASE. Recently, it has been shown that statistically significant nullomers (i.e. short absent motifs wh |
https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead%20method | The Nelder–Mead method (also downhill simplex method, amoeba method, or polytope method) is a numerical method used to find the minimum or maximum of an objective function in a multidimensional space. It is a direct search method (based on function comparison) and is often applied to nonlinear optimization problems for which derivatives may not be known. However, the Nelder–Mead technique is a heuristic search method that can converge to non-stationary points on problems that can be solved by alternative methods.
The Nelder–Mead technique was proposed by John Nelder and Roger Mead in 1965, as a development of the method of Spendley et al.
Overview
The method uses the concept of a simplex, which is a special polytope of n + 1 vertices in n dimensions. Examples of simplices include a line segment on a line, a triangle on a plane, a tetrahedron in three-dimensional space and so forth.
The method approximates a local optimum of a problem with n variables when the objective function varies smoothly and is unimodal. Typical implementations minimize functions, and we maximize by minimizing .
For example, a suspension bridge engineer has to choose how thick each strut, cable, and pier must be. These elements are interdependent, but it is not easy to visualize the impact of changing any specific element. Simulation of such complicated structures is often extremely computationally expensive to run, possibly taking upwards of hours per execution. The Nelder–Mead method requires, in the original variant, no more than two evaluations per iteration, except for the shrink operation described later, which is attractive compared to some other direct-search optimization methods. However, the overall number of iterations to proposed optimum may be high.
Nelder–Mead in n dimensions maintains a set of n + 1 test points arranged as a simplex. It then extrapolates the behavior of the objective function measured at each test point in order to find a new test point and to replace on |
https://en.wikipedia.org/wiki/Mike%20and%20the%20Mad%20Dog | Mike and the Mad Dog was an American sports radio show hosted by Mike Francesa and Christopher "Mad Dog" Russo that aired in afternoons on WFAN in New York City from September 1989 to August 2008. From 2002 the show was simulcast on television on the YES Network. On the radio, the show was simulcast beginning 2007 on WQYK in Tampa, Florida, and from 2004 until 2007 on WROW in Albany, New York.
History
Before Mike and the Mad Dog
Before Francesa and Russo were paired, Russo was an overnight/weekend and fill-in host. He caught the attention of Don Imus, who was impressed with his vibrant personality and brought Russo onto the Imus in the Morning show as its sports reporter.
Meanwhile, Francesa was a midday and weekend host at WFAN, and was known to be knowledgeable but somewhat dry on-air. Like Russo, Francesa got the attention of Imus when he made an on-the-air bet with Francesa that Seton Hall University's basketball team would not make the Final Four in the NCAA tournament. Imus promised Francesa a new Porsche if Seton Hall made the Final Four, which they did. Though Imus found a way around the bet, the dialogue between the two is considered to be among the classic moments in the history of Imus in the Morning.
Paired together
In August 1989, WFAN (which was owned at the time by Emmis Communications) was looking for hosts to replace the controversial Pete Franklin in the afternoon drive time period. Mark Mason, then the program director, floated the idea of teaming Francesa with Russo. At first, the station management thought the idea was crazy because they were no-names at that time. However, because of Francesa and Russo's popularity on the weekends and on Imus in the Morning individually, the station management decided to pair the two together. The show was dubbed Mike and the Mad Dog and debuted on September 5, 1989. However, the decision to pair them on an afternoon show was a surprise to the two men, and a risk. Things were rocky at first. Accordi |
https://en.wikipedia.org/wiki/Full%20Domain%20Hash | In cryptography, the Full Domain Hash (FDH) is an RSA-based signature scheme that follows the hash-and-sign paradigm. It is provably secure (i.e., is existentially unforgeable under adaptive chosen-message attacks) in the random oracle model. FDH involves hashing a message using a function whose image size equals the size of the RSA modulus, and then raising the result to the secret RSA exponent.
Exact security of full domain hash
In the random oracle model, if RSA is -secure, then the full domain hash RSA signature scheme is -secure where,
.
For large this reduces to .
This means that if there exists an algorithm that can forge a new FDH signature that runs in time t, computes at most hashes, asks for at most signatures and succeeds with probability , then there must also exist an algorithm that breaks RSA with probability in time . |
https://en.wikipedia.org/wiki/AMD%2010h | The AMD Family 10h, or K10, is a microprocessor microarchitecture by AMD based on the K8 microarchitecture. The first third-generation Opteron products for servers were launched on September 10, 2007, with the Phenom processors for desktops following and launching on November 11, 2007 as the immediate successors to the K8 series of processors (Athlon 64, Opteron, 64-bit Sempron).
Nomenclature
It appears that AMD has not used K-nomenclature (which originally stood for "Kryptonite" in the K5 processor) from the time after the use of the codename K8 for the AMD K8 or Athlon 64 processor family, since no K-nomenclature naming convention beyond K8 has appeared in official AMD documents and press releases after the beginning of 2005.
The name "K8L" was first coined by Charlie Demerjian in 2005, at the time a writer at The Inquirer, and was used by the wider IT community as a convenient shorthand while according to AMD official documents, the processor family was termed "AMD Next Generation Processor Technology".
The microarchitecture has also been referred to as Stars, as the codenames for desktop line of processors was named under stars or constellations (the initial Phenom models being codenamed Agena and Toliman).
In a video interview, Giuseppe Amato confirmed that the codename is K10.
It was revealed, by The Inquirer itself, that the codename "K8L" referred to a low-power version of the K8 family, later named Turion 64, and that K10 was the official codename for the microarchitecture.
AMD refers to it as Family 10h Processors, as it is the successor of the Family 0Fh Processors (codename K8). 10h and 0Fh refer to the main result of the CPUID x86 processor instruction. In hexadecimal numbering, 0Fh (h represents hexadecimal numbering) equals the decimal number 15, and 10h equals decimal 16. (The "K10h" form that sometimes pops up is an improper hybrid of the "K" code and Family identifier number.)
Schedule of launch and delivery
Timeline
Historical information |
https://en.wikipedia.org/wiki/Hosted%20service%20provider | A hosted service provider (xSP) is a business that delivers a combination of traditional IT functions such as infrastructure, applications (software as a service), security, monitoring, storage, web development, website hosting and email, over the Internet or other wide area networks (WAN). An xSP combines the abilities of an application service provider (ASP) and an Internet service provider (ISP).
This approach enables customers to consolidate and outsource much of their IT needs for a predictable recurring fee. xSPs that integrate web publishing give customers a central repository to rapidly and efficiently distribute information and resources among employees, customers, partners and the general public.
Hosted Service Providers benefit from economies of scale and operate on a one-to-many business model, delivering the same software and services to many customers at once. Customers are charged on a subscription basis.
Services offered
As defined by analyst Ovum.
Repeatable business process-led services shared among several clients
Remotely delivered application services using shared resources
Infrastructure services (both remotely managed and/or hosted services spanning data centre services, managed servers and databases, performance monitoring, security services, storage services and business continuity)
Web hosting- the provision of infrastructure and application services to support the hosting of Web sites.
History
Hard Corps, Inc., formed in December 1999 claimed the moniker 'xSP' and began using it in commerce prior to others.
See also
Web servers
Managed services |
https://en.wikipedia.org/wiki/Tetraphobia | Tetraphobia () is the practice of avoiding instances of the digit . It is a superstition most common in East Asian nations. It represents or can be translated as death or to die.
Rationale
The Chinese word for "four" (, pinyin: sì, jyutping: sei3), sounds quite similar to the word for "death" (, pinyin: sǐ, jyutping: sei2), in many varieties of Chinese. Similarly, the Sino-Japanese, Sino-Korean and Sino-Vietnamese words for "four", shi (し, Japanese) and sa (사, Korean), sound similar or identical to "death" in each language (see Korean numerals, Japanese numerals, Vietnamese numerals). Tetraphobia is known to occur in Korea and Japan since the two words sound identical, but not at all in Vietnam because they carry different tones (in the case of the word for "four", whether it is the Sino-Vietnamese reading tứ or the more common non-Sino-Vietnamese reading tư, neither sounds like the word for "death" which is tử) and Vietnamese does not use Sino-Vietnamese numerals as often in the first place.
Tetraphobia far surpasses triskaidekaphobia (Western superstitions around the number 13). It even permeates the business world in these regions of Asia.
Cultural examples by regions
In Mainland China
Chinese is a tonal language with a comparatively small inventory of permitted syllables, resulting in an exceptionally large number of homophone words. Many of the numbers are homophones or near-homophones of other words and have therefore acquired superstitious meanings.
The Chinese avoid phone numbers and addresses with fours because the pronunciation in "four" and "death" differ only in tone, especially when a combination with another number sounds similar to undesirable expressions. Example: “94” could be interpreted as being dead for a long time.
The People's Republic of China makes free use of the number 4 in many military designations for People's Liberation Army equipment, with examples including the Dongfeng-4 ICBM, Type 094 submarine, and Type 054A frigate, althou |
https://en.wikipedia.org/wiki/Connected%20dominating%20set | In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.
Definitions
A connected dominating set of a graph G is a set D of vertices with two properties:
Any node in D can reach any other node in D by a path that stays entirely within D. That is, D induces a connected subgraph of G.
Every vertex in G either belongs to D or is adjacent to a vertex in D. That is, D is a dominating set of G.
A minimum connected dominating set of a graph G is a connected dominating set with the smallest possible cardinality among all connected dominating sets of G. The connected domination number of G is the number of vertices in the minimum connected dominating set.
Any spanning tree T of a graph G has at least two leaves, vertices that have only one edge of T incident to them. A maximum leaf spanning tree is a spanning tree that has the largest possible number of leaves among all spanning trees of G. The max leaf number of G is the number of leaves in the maximum leaf spanning tree.
Complementarity
If d is the connected domination number of an n-vertex graph G, where n > 2, and l is its max leaf number, then the three quantities d, l, and n obey the simple equation
If D is a connected dominating set, then there exists a spanning tree in G whose leaves include all vertices that are not in D: form a spanning tree of the subgraph induced by D, together with edges connecting each remaining vertex v that is not in D to a neighbor of v in D. This shows that
In the other direction, if T is any spanning tree in G, then the vertices of T that are not leaves form a connected dominating set of G. This shows that Putting these two inequalities together proves the equality
Therefore, in any graph, the sum of the connected domination number and the max leaf number equals the total number of vertices.
Computationally, this implies that determining the connected domination number is equally difficult as fin |
https://en.wikipedia.org/wiki/Motorola%20Solutions | Motorola Solutions, Inc. is an American video equipment, telecommunications equipment, software, systems and services provider that succeeded Motorola, Inc., following the spinoff of the mobile phone division into Motorola Mobility in 2011. The company is headquartered in Chicago, Illinois.
History
Motorola Solutions began trading as a separate independent company on January 4, 2011, under the NYSE symbol MSI. In April 2011, Motorola Solutions completed the sale of its cellular infrastructure business to Nokia Siemens Networks for $975 million in cash. As part of the transaction, approximately 6,900 employees were transferred to Nokia Siemens Networks. The same month, Chinese telecommunications company Huawei and Motorola Solutions settled their intellectual property disputes.
In 2012, Motorola Solutions purchased Psion for $200 million and added it to its Enterprise business. A large majority of the Enterprise business was formerly Symbol Technologies, which Motorola, Inc. had acquired in 2007. On October 27, 2014, Motorola Solutions sold its Enterprise business to Zebra Technologies for $3.45 billion in cash. As part of the sale, approximately 4,500 Motorola Solutions employees from locations throughout the world were transferred to Zebra.
In August 2015, the company received a $1 billion investment from the private equity firm Silver Lake Partners, enabling a stock buyback and providing Silver Lake with two board seats.
In December 2015, the company announced that it would acquire Airwave Solutions, the UK-based operator of the British public safety radio network servicing the police, fire, and ambulance services across England, Scotland, and Wales. The company completed the acquisition on February 19, 2016.
Beginning in March 2017, Motorola Solutions filed a series of lawsuits against China-based two-way radio manufacturer Hytera in the United States, Germany, and Australia, as well as with the United States International Trade Commission (USITC). The comp |
https://en.wikipedia.org/wiki/Bispectrum | In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.
Definitions
The Fourier transform of the second-order cumulant, i.e., the autocorrelation function, is the traditional power spectrum.
The Fourier transform of C3(t1, t2) (third-order cumulant-generating function) is called the bispectrum or bispectral density.
Calculation
Applying the convolution theorem allows fast calculation of the bispectrum: , where denotes the Fourier transform of the signal, and its conjugate.
Applications
Bispectrum and bicoherence may be applied to the case of non-linear interactions of a continuous spectrum of propagating waves in one dimension.
Bispectral measurements have been carried out for EEG signals monitoring. It was also shown that bispectra characterize differences between families of musical instruments.
In seismology, signals rarely have adequate duration for making sensible bispectral estimates from time averages.
Bispectral analysis describes observations made at two wavelengths. It is often used by scientists to analyze elemental makeup of a planetary atmosphere by analyzing the amount of light reflected and received through various color filters. By combining and removing two filters, much can be gleaned from only two filters. Through modern computerized interpolation, a third virtual filter can be created to recreate true color photographs that, while not particularly useful for scientific analysis, are popular for public display in textbooks and fund raising campaigns.
Bispectral analysis can also be used to analyze interactions between wave patterns and tides on Earth.
A form of bispectral analysis called the bispectral index is applied to EEG waveforms to monitor depth of anesthesia.
Biphase (phase of polyspectrum) can be used for detection of phase couplings, noise reduction of polharmonic (particularly, speech ) signal analysis.
A physical interpretation
The bispectrum reflec |
https://en.wikipedia.org/wiki/Table%20of%20spherical%20harmonics | This is a table of orthonormalized spherical harmonics that employ the Condon-Shortley phase up to degree . Some of these formulas are expressed in terms of the Cartesian expansion of the spherical harmonics into polynomials in x, y, z, and r. For purposes of this table, it is useful to express the usual spherical to Cartesian transformations that relate these Cartesian components to and as
Complex spherical harmonics
For ℓ = 0, …, 5, see.
ℓ = 0
ℓ = 1
ℓ = 2
ℓ = 3
ℓ = 4
ℓ = 5
ℓ = 6
ℓ = 7
ℓ = 8
ℓ = 9
ℓ = 10
Visualization of complex spherical harmonics
2D polar/azimuthal angle maps
Below the complex spherical harmonics are represented on 2D plots with the azimuthal angle, , on the horizontal axis and the polar angle, , on the vertical axis. The saturation of the color at any point represents the magnitude of the spherical harmonic and the hue represents the phase.
Polar plots
Below the complex spherical harmonics are represented on polar plots. The magnitude of the spherical harmonic at particular polar and azimuthal angles is represented by the saturation of the color at that point and the phase is represented by the hue at that point.
Polar plots with magnitude as radius
Below the complex spherical harmonics are represented on polar plots. The magnitude of the spherical harmonic at particular polar and azimuthal angles is represented by the radius of the plot at that point and the phase is represented by the hue at that point.
Real spherical harmonics
For each real spherical harmonic, the corresponding atomic orbital symbol (s, p, d, f) is reported as well.
For ℓ = 0, …, 3, see.
ℓ = 0
ℓ = 1
ℓ = 2
ℓ = 3
ℓ = 4
Visualization of real spherical harmonics
2D polar/azimuthal angle maps
Below the real spherical harmonics are represented on 2D plots with the azimuthal angle, , on the horizontal axis and the polar angle, , on the vertical axis. The saturation of the color at any point represents the magnitude of the spherical harmonic and |
https://en.wikipedia.org/wiki/DG/UX | DG/UX is a discontinued Unix operating system developed by Data General for its Eclipse MV minicomputer line, and later the AViiON workstation and server line (both Motorola 88000 and Intel IA-32-based variants).
Overview
DG/UX 1.00, released in March, 1985, was based on UNIX System V Release 2 with additions from 4.1BSD. By 1987, DG/UX 3.10 had been released, with 4.2BSD TCP/IP networking, NFS and the X Window System included. DG/UX 4.00, in 1988, was a comprehensive re-design of the system, based on System V Release 3, and supporting symmetric multiprocessing on the Eclipse MV. The 4.00 filesystem was based on the AOS/VS II filesystem and, using the logical disk facility, could span multiple disks. DG/UX 5.4, released around 1991, replaced the legacy Unix file buffer cache with unified, demand paged virtual memory management. Later versions were based on System V Release 4.
On the AViiON, DG/UX supported multiprocessor machines at a time when most variants of Unix did not. The operating system was also more complete than some other Unix variants; for example, the operating system included a full C compiler (gcc) and also a logical volume manager. The OS was small and compact, but rich in features. It was simple and easy to install and did not require vast resources of memory or processing power. For example, a six-way Pentium Pro-based AViiON would support several hundred users using text terminals.
The volume manager built into the OS was simple, but very powerful. All disk administration could be performed online, without taking any file system offline. This included extending, relocating, mirroring or shrinking. The same functions could be performed on the swap area, allowing in-place migrations of disk storage without downtime. DG/UX 5.4 supported filesystem shrinking, "split mirror" online backup, filesystems up to 2 TB, and filesystem journaling in 1991. Few vendors offered similar features at that time.
DG/UX had a high-performance and stable clustered |
https://en.wikipedia.org/wiki/Bicoherence | In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum. The bicoherence takes values bounded between 0 and 1, which make it a convenient measure for quantifying the extent of phase coupling in a signal. The prefix bi- in bispectrum and bicoherence refers not to two time series xt, yt but rather to two frequencies of a single signal.
The bispectrum is a statistic used to search for nonlinear interactions. The Fourier transform of the second-order cumulant, i.e., the autocorrelation function, is the traditional power spectrum. The Fourier transform of C3(t1,t2) (third-order cumulant) is called bispectrum or bispectral density. They fall in the category of Higher Order Spectra, or Polyspectra and provide supplementary information to the power spectrum. The third order polyspectrum (bispectrum) is the easiest to compute, and hence the most popular.
The difference with measuring coherence (coherence analysis is an extensively used method to study the correlations in frequency domain, between two simultaneously measured signals) is the need for both input and output measurements by estimating two auto-spectra and one cross spectrum. On the other hand, bicoherence is an auto-quantity, i.e. it can be computed from a single signal. The coherence function provides a quantification of deviations from linearity in the system which lies between the input and output measurement sensors. The bicoherence measures the proportion of the signal energy at any bifrequency that is quadratically phase coupled. It is usually normalized in the range similar to correlation coefficient and classical (second order) coherence. It was also used for depth of anasthesia assessment and widely in plasma physics (nonlinear energy transfer) and also for detection of gravitational waves.
Bispectrum and bicoherence may be applied to the case of non-linear interactions of a continuous spectrum of propagating waves in |
https://en.wikipedia.org/wiki/Persulfate | A persulfate (sometimes known as peroxysulfate or peroxodisulfate) is a compound containing the anions or . The anion contains one peroxide group per sulfur center, whereas in , the peroxide group bridges the sulfur atoms. In both cases, sulfur adopts the normal tetrahedral geometry typical for the S(VI) oxidation state. These salts are strong oxidizers.
Ions
Peroxomonosulfate ion,
Peroxydisulfate
Acids
Peroxymonosulfuric acid (Caro's acid), H2SO5
Peroxydisulfuric acid, H2S2O8
Example salts
Sodium peroxomonosulfate, Na2SO5
Potassium peroxymonosulfate, KHSO5
Sodium persulfate (sodium peroxydisulfate), Na2S2O8
Ammonium persulfate (ammonium peroxydisulfate), (NH4)2S2O8
Potassium persulfate (potassium peroxydisulfate), K2S2O8 |
https://en.wikipedia.org/wiki/Flags%20and%20coats%20of%20arms%20of%20the%20Austrian%20states | The flags of the Austrian states show two (or three) stripes in the main colours of the respective arms. These flags are the state flags and are shown with the coats of arms, although it is common for them to be shown without it. Without the coats of arms, some flags are very similar, such as those of Tyrol and Upper Austria (also nearly identical to the flag of Poland). Frequently, the flags are used in vertical variants with or without coat of arms. The coats of arms of the Austrian States are also shown.
See also
Flag of Austria
Coat of arms of Austria |
https://en.wikipedia.org/wiki/Hash%20list | In computer science, a hash list is typically a list of hashes of the data blocks in a file or set of files. Lists of hashes are used for many different purposes, such as fast table lookup (hash tables) and distributed databases (distributed hash tables).
A hash list is an extension of the concept of hashing an item (for instance, a file). A hash list is a subtree of a Merkle tree.
Root hash
Often, an additional hash of the hash list itself (a top hash, also called root hash or master hash) is used. Before downloading a file on a p2p network, in most cases the top hash is acquired from a trusted source, for instance a friend or a web site that is known to have good recommendations of files to download. When the top hash is available, the hash list can be received from any non-trusted source, like any peer in the p2p network. Then the received hash list is checked against the trusted top hash, and if the hash list is damaged or fake, another hash list from another source will be tried until the program finds one that matches the top hash.
In some systems (for example, BitTorrent), instead of a top hash the whole hash list is available on a web site in a small file. Such a "torrent file" contains a description, file names, a hash list and some additional data.
Applications
Hash lists can be used to protect any kind of data stored, handled and transferred in and between computers. An important use of hash lists is to make sure that data blocks received from other peers in a peer-to-peer network are received undamaged and unaltered, and to check that the other peers do not "lie" and send fake blocks.
Usually a cryptographic hash function such as SHA-256 is used for the hashing. If the hash list only needs to protect against unintentional damage unsecured checksums such as CRCs can be used.
Hash lists are better than a simple hash of the entire file since, in the case of a data block being damaged, this is noticed, and only the damaged block needs to be redownloa |
https://en.wikipedia.org/wiki/Merkle%20tree | In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure. A hash tree is a generalization of a hash list and a hash chain.
Demonstrating that a leaf node is a part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes in the tree. Conversely, in a hash list, the number is proportional to the number of leaf nodes itself. A Merkle tree is therefore an efficient example of a cryptographic commitment scheme, in which the root of the tree is seen as a commitment and leaf nodes may be revealed and proven to be part of the original commitment.
The concept of a hash tree is named after Ralph Merkle, who patented it in 1979.
Uses
Hash trees can be used to verify any kind of data stored, handled and transferred in and between computers. They can help ensure that data blocks received from other peers in a peer-to-peer network are received undamaged and unaltered, and even to check that the other peers do not lie and send fake blocks.
Hash trees are used in hash-based cryptography. Hash trees are also used in the InterPlanetary File System (IPFS), Btrfs and ZFS file systems (to counter data degradation); Dat protocol; Apache Wave protocol; Git and Mercurial distributed revision control systems; the Tahoe-LAFS backup system; Zeronet; the Bitcoin and Ethereum peer-to-peer networks; the Certificate Transparency framework; the Nix package manager and descendants like GNU Guix; and a number of NoSQL systems such as Apache Cassandra, Riak, and Dynamo.
Suggestions have been made to use hash trees in trusted computing systems.
The initial Bitcoin implementation of Merkle |
https://en.wikipedia.org/wiki/Point%20plotting | Point plotting is an elementary mathematical skill required in analytic geometry. Invented by René Descartes and originally used to locate positions on military maps, this skill is now assumed of everyone who wants to locate grid 7A on any map.
Using point plotting, one associates an ordered pair of real numbers (x, y) with a point in the plane in a one-to-one manner. As a result, one obtains the 2-dimensional Cartesian coordinate system.
To be able to plot points, one needs to first decide on a point in plane which will be called the origin, and a couple of perpendicular lines, called the x and y axes, as well as a preferred direction on each of the lines. Usually one chooses the x axis pointing right and the y axis pointing up, and these will be named the positive directions. Also, one picks a segment in the plane which is declared to be of unit length. Using rotated versions of this segment, one can measure distances along the x and y axes.
Having the origin and the axes in place, given a pair (x, y) of real numbers, one considers the point on the x axis at distance |x| from the origin and along the positive direction if x≥0, and the other direction otherwise. In the same way one picks the point on the y axis corresponding to the number y. The line parallel to the y axis going through the first point and the line parallel to the x axis going through the second point will intersect at precisely one point, which will be called the point with coordinates (x, y).
See also
Cartesian coordinate system
Graph of a function
Elementary mathematics |
https://en.wikipedia.org/wiki/Spatial%20network%20analysis%20software | Spatial network analysis software packages are analytic software used to prepare graph-based analysis of spatial networks. They stem from research fields in transportation, architecture, and urban planning. The earliest examples of such software include the work of Garrison (1962), Kansky (1963), Levin (1964), Harary (1969), Rittel (1967), Tabor (1970) and others in the 1960s and 70s. Specific packages address their domain-specific needs, including TransCAD for transportation, GIS for planning and geography, and Axman for Space syntax researchers.
Packages
Many packages are available. Many were developed in academia and are freely available or freely available for academic research.
In historical order:
Axman – The (near) original developed by Nick Sheep Dalton of UCL to perform axial line analysis on computers running Mac OS, currently used in more than 50 countries. This spawned offshoots such as Pesh (for the analysis of convex space networks) and SpaceBox (for the analysis of 'all-line' axial maps).
Spatialist – Developed at Georgia Institute of Technology to implement theoretical innovations principally introduced by John Peponis. This software plugs into the MicroStation CAD package to analyse networks of automatically generated 'e-spaces' and 's-spaces'.
Axwoman 1 – Written by Bin Jiang while at UCL. It is a tool to perform axial analysis as a plug-in to ESRI products.
Axwoman 6.2+ – Evolved from Axwoman 1.0 and research by Bin Jiang and his team. Axwoman 6.2 is a free plug-in to ArcMap 10, combined with AxialGen in one installer. Featured functionality includes automatically generating natural streets and axial lines from OpenStreetMap data. The website also contains tutorials.
Depthmap – Developed by Alasdair Turner of UCL. This software initially generated isovists and performed visibility graph analysis of building systems on computers running Windows. It evolved to include automatic generation of axial line networks and analysis of axial line n |
https://en.wikipedia.org/wiki/Acoustic%20metric | In acoustics and fluid dynamics, an acoustic metric (also known as a sonic metric) is a metric that describes the signal-carrying properties of a given particulate medium.
(Generally, in mathematical physics, a metric describes the arrangement of relative distances within a surface or volume, usually measured by signals passing through the region – essentially describing the intrinsic geometry of the region.)
A simple fluid example
For simplicity, we will assume that the underlying background geometry is Euclidean, and that this space is filled with an isotropic inviscid fluid at zero temperature (e.g. a superfluid). This fluid is described by a density field ρ and a velocity field . The speed of sound at any given point depends upon the compressibility which in turn depends upon the density at that point. It requires much work to compress anything more into an already compacted space. This can be specified by the "speed of sound field" c. Now, the combination of both isotropy and Galilean covariance tells us that the permissible velocities of the sound waves at a given point x, has to satisfy
This restriction can also arise if we imagine that sound is like "light" moving through a spacetime described by an effective metric tensor called the acoustic metric.
The acoustic metric is
"Light" moving with a velocity of (not the 4-velocity) has to satisfy
If
where α is some conformal factor which is yet to be determined (see Weyl rescaling), we get the desired velocity restriction. α may be some function of the density, for example.
Acoustic horizons
An acoustic metric can give rise to "acoustic horizons" (also known as "sonic horizons"), analogous to the event horizons in the spacetime metric of general relativity. However, unlike the spacetime metric, in which the invariant speed is the absolute upper limit on the propagation of all causal effects, the invariant speed in an acoustic metric is not the upper limit on propagation speeds. For example, the speed |
https://en.wikipedia.org/wiki/26-bit%20computing | In computer architecture, 26-bit integers, memory addresses, or other data units are those that are 26 bits wide, and thus can represent unsigned values up to 67,108,863. Two examples of computer processors that featured 26-bit memory addressing are certain second generation IBM System/370 mainframe computer models introduced in 1981 (and several subsequent models), which had 26-bit physical addresses but had only the same 24-bit virtual addresses as earlier models, and the first generations of ARM processors.
History
IBM System/370
As data processing needs continued to grow, IBM and their customers faced challenges directly addressing larger memory sizes. In what ended up being a short-term "emergency" solution, a pair of IBM's second wave of System/370 models, the 3033 and 3081, introduced 26-bit real memory addressing, increasing the System/370's amount of physical memory that could be attached by a factor of 4 from the previous 24-bit limit of 16 MB. IBM referred to 26-bit addressing as "extended real addressing," and some subsequent models also included 26-bit support. However, only 2 years later, IBM introduced 31-bit memory addressing, expanding both physical and virtual addresses to 31 bits, with its System/370-XA models, and even the popular 3081 was upgradeable to XA standard.
Given 26-bit's brief history as the state-of-the-art in memory addressing available in IBM's model range, and given that virtual addresses were still limited to 24 bits, software exploitation of 26-bit mode was limited. The few customers that exploited 26-bit mode eventually adjusted their applications to support 31-bit addressing, and IBM dropped support for 26-bit mode after several years producing models supporting 24-bit, 26-bit, and 31-bit modes. The 26-bit mode is the only addressing mode that IBM removed from its line of mainframe computers descended from the System/360. All the other addressing modes, including now 64-bit mode, are supported in current model mainframes.
|
https://en.wikipedia.org/wiki/Alternating%20algebra | In mathematics, an alternating algebra is a -graded algebra for which for all nonzero homogeneous elements and (i.e. it is an anticommutative algebra) and has the further property that for every homogeneous element of odd degree.
Examples
The differential forms on a differentiable manifold form an alternating algebra.
The exterior algebra is an alternating algebra.
The cohomology ring of a topological space is an alternating algebra.
Properties
The algebra formed as the direct sum of the homogeneous subspaces of even degree of an anticommutative algebra is a subalgebra contained in the centre of , and is thus commutative.
An anticommutative algebra over a (commutative) base ring in which 2 is not a zero divisor is alternating.
See also
Alternating multilinear map
Exterior algebra
Graded-symmetric algebra |
https://en.wikipedia.org/wiki/Line%20shaft | A line shaft is a power-driven rotating shaft for power transmission that was used extensively from the Industrial Revolution until the early 20th century. Prior to the widespread use of electric motors small enough to be connected directly to each piece of machinery, line shafting was used to distribute power from a large central power source to machinery throughout a workshop or an industrial complex. The central power source could be a water wheel, turbine, windmill, animal power or a steam engine. Power was distributed from the shaft to the machinery by a system of belts, pulleys and gears known as millwork.
Operation
A typical line shaft would be suspended from the ceiling of one area and would run the length of that area. One pulley on the shaft would receive the power from a parent line shaft elsewhere in the building. The other pulleys would supply power to pulleys on each individual machine or to subsequent line shafts. In manufacturing where there were a large number of machines performing the same tasks, the design of the system was fairly regular and repeated. In other applications such as machine and wood shops where there was a variety of machines with different orientations and power requirements, the system would appear erratic and inconsistent with many different shafting directions and pulley sizes. Shafts were usually horizontal and overhead but occasionally were vertical and could be underground. Shafts were usually rigid steel, made up of several parts bolted together at flanges. The shafts were suspended by hangers with bearings at certain intervals of length. The distance depended on the weight of the shaft and the number of pulleys. The shafts had to be kept aligned or the stress would overheat the bearings and could break the shaft. The bearings were usually friction type and had to be kept lubricated. Pulley lubricator employees were required in order to ensure that the bearings did not freeze or malfunction.
In the earliest applicatio |
https://en.wikipedia.org/wiki/List%20of%20logic%20symbols | In logic, a set of symbols is commonly used to express logical representation. The following table lists many common symbols, together with their name, how they should be read out loud, and the related field of mathematics. Additionally, the subsequent columns contains an informal explanation, a short example, the Unicode location, the name for use in HTML documents, and the LaTeX symbol.
Basic logic symbols
Advanced and rarely used logical symbols
These symbols are sorted by their Unicode value:
Usage in various countries
Poland
in Poland, the universal quantifier is sometimes written ∧, and the existential quantifier as ∨. The same applies for Germany.
Japan
The ⇒ symbol is often used in text to mean "result" or "conclusion", as in "We examined whether to sell the product ⇒ We will not sell it". Also, the → symbol is often used to denote "changed to", as in the sentence "The interest rate changed. March 20% → April 21%".
See also
Józef Maria Bocheński
List of notation used in Principia Mathematica
List of mathematical symbols
Logic alphabet, a suggested set of logical symbols
Logical connective
Mathematical operators and symbols in Unicode
Non-logical symbol
Polish notation
Truth function
Truth table
Wikipedia:WikiProject Logic/Standards for notation |
https://en.wikipedia.org/wiki/Supermatrix | In mathematics and theoretical physics, a supermatrix is a Z2-graded analog of an ordinary matrix. Specifically, a supermatrix is a 2×2 block matrix with entries in a superalgebra (or superring). The most important examples are those with entries in a commutative superalgebra (such as a Grassmann algebra) or an ordinary field (thought of as a purely even commutative superalgebra).
Supermatrices arise in the study of super linear algebra where they appear as the coordinate representations of a linear transformations between finite-dimensional super vector spaces or free supermodules. They have important applications in the field of supersymmetry.
Definitions and notation
Let R be a fixed superalgebra (assumed to be unital and associative). Often one requires R be supercommutative as well (for essentially the same reasons as in the ungraded case).
Let p, q, r, and s be nonnegative integers. A supermatrix of dimension (r|s)×(p|q) is a matrix with entries in R that is partitioned into a 2×2 block structure
with r+s total rows and p+q total columns (so that the submatrix X00 has dimensions r×p and X11 has dimensions s×q). An ordinary (ungraded) matrix can be thought of as a supermatrix for which q and s are both zero.
A square supermatrix is one for which (r|s) = (p|q). This means that not only is the unpartitioned matrix X square, but the diagonal blocks X00 and X11 are as well.
An even supermatrix is one for which the diagonal blocks (X00 and X11) consist solely of even elements of R (i.e. homogeneous elements of parity 0) and the off-diagonal blocks (X01 and X10) consist solely of odd elements of R.
An odd supermatrix is one for which the reverse holds: the diagonal blocks are odd and the off-diagonal blocks are even.
If the scalars R are purely even there are no nonzero odd elements, so the even supermatices are the block diagonal ones and the odd supermatrices are the off-diagonal ones.
A supermatrix is homogeneous if it is either even or odd. The parity, |
https://en.wikipedia.org/wiki/Flags%20of%20the%20autonomous%20communities%20of%20Spain | This gallery of flags of the autonomous communities of Spain shows the distinctive flags of the 17 autonomous communities (constitutionally they are the nationalities and regions in which Spain is territorially organized), plus the autonomous cities of Ceuta and Melilla.
Autonomies
Autonomous communities
See also
Autonomous communities of Spain
Anthems of the autonomous communities of Spain
Coats of arms of the autonomous communities of Spain
Spain geography-related lists
Flags
Culture of Spain
Spain
Spain |
https://en.wikipedia.org/wiki/Flags%20of%20regions%20of%20Italy | The twenty Italian regions (including five autonomous regions) each have their own arms, as well as their own gonfalone; more recently they have taken into use normal flags as well. Many regional flags were adopted on 4 November 1995 for Armed Forces Day of Italy.
Regions
Autonomous regions
Ethnic flag
See also
Flag of Italy
List of Italian flags |
https://en.wikipedia.org/wiki/DBZ%20%28meteorology%29 | Decibel relative to Z, or dBZ, is a logarithmic dimensionless technical unit used in radar, mostly in weather radar, to compare the equivalent reflectivity factor (Z) of a remote object (in mm6 per m3) to the return of a droplet of rain with a diameter of 1 mm (1 mm6 per m3). It is proportional to the number of drops per unit volume and the sixth power of drops' diameter and is thus used to estimate the rain or snow intensity. With other variables analyzed from the radar returns it helps to determine the type of precipitation. Both the radar reflectivity factor and its logarithmic version are commonly referred to as reflectivity when the context is clear. In short, the higher the dBZ value, the more likely it is for severe weather to occur in the form of precipitation.
Values above 20 dBZ usually indicate falling precipitation.
Principle
The radar reflectivity factor (Z) of precipitation is dependent on the number (N0) and size (D) of reflectors (hydrometeors), which includes rain, snow, graupel, and hail. Very sensitive radars can also measure the reflectivity of cloud drops and ice. For an exponential distribution of reflectors, Z is expressed by:
As rain droplets have a diameter on the order of 1 millimetre, Z is in mm6m−3 (μm3). By dividing Z with the equivalent return of a 1 mm drop in a volume of a meter cube (Z0) and using the logarithm of the result (because the values vary greatly from drizzle to hail), one obtains the logarithmic reflectivity LZ, in dBZ:
dBZ values can be converted to rainfall rates (R) in millimetres per hour using the Marshall-Palmer formula:
Other quantities
The definition of Z above shows that a large number of small hydrometeors will reflect as one large hydrometeor. The signal returned to the radar will be equivalent in both situations, so a group of small hydrometeors is virtually indistinguishable from one large hydrometeor on the resulting radar image. The reflectivity image is just one type of image produced by a rada |
https://en.wikipedia.org/wiki/Magnitude%20%28astronomy%29 | In astronomy, magnitude is measure of the brightness of an object, usually in a defined passband. An imprecise but systematic determination of the magnitude of objects was introduced in ancient times by Hipparchus.
Magnitude values do not have a unit. The scale is logarithmic and defined such that a magnitude 1 star is exactly 100 times brighter than a magnitude 6 star. Thus each step of one magnitude is times brighter than the magnitude 1 higher. The brighter an object appears, the lower the value of its magnitude, with the brightest objects reaching negative values.
Astronomers use two different definitions of magnitude: apparent magnitude and absolute magnitude. The apparent magnitude () is the brightness of an object and depends on an object's intrinsic luminosity, its distance, and the extinction reducing its brightness. The absolute magnitude () describes the intrinsic luminosity emitted by an object and is defined to be equal to the apparent magnitude that the object would have if it were placed at a certain distance 10 parsecs for stars. A more complex definition of absolute magnitude is used for planets and small Solar System bodies, based on its brightness at one astronomical unit from the observer and the Sun.
The Sun has an apparent magnitude of −27 and Sirius, the brightest visible star in the night sky, −1.46. Venus at its brightest is -5. The International Space Station (ISS) sometimes reaches a magnitude of −6.
Amateur astronomers commonly express the darkness of the sky in terms of limiting magnitude, i.e. the apparent magnitude of the faintest star they can see with the naked eye. At a dark site, it is usual for people to see stars of 6th magnitude or fainter.
Apparent magnitude is really a measure of illuminance, which can also be measured in photometric units such as lux.
History
The Greek astronomer Hipparchus produced a catalogue which noted the apparent brightness of stars in the second century BCE. In the second century CE the Ale |
https://en.wikipedia.org/wiki/Polycrase | Polycrase or polycrase-(Y) is a black or brown metallic complex uranium yttrium oxide mineral with the chemical formula . It is amorphous. It has a Mohs hardness of 5 to 6 and a specific gravity of 5. It is radioactive due to its uranium content (around 6%). It occurs in granitic pegmatites.
Polycrase forms a continuous series with the niobium rich rare earth oxide euxenite.
It was first described in 1870 at Rasvag, Hidra (Hittero) Island, near Flekkefjord, Norway. It is found in Sweden, Norway, and the United States. |
https://en.wikipedia.org/wiki/Robotech%20Defenders | The Robotech Defenders are a line of scale model kits released by Revell during the early 1980s with an accompanying limited comic series published by DC Comics. Contrary to what their name seems to imply, the "'Robotech Defenders'" are not part of the Robotech anime universe adapted by Carl Macek and released by Harmony Gold USA, but they did adopt the same moniker and logo.
The "Robotech Defenders" were one of two "Robotech" lines released by Revell, the other being the "Robotech Changers". The "Robotech Changers" line initially consisted of three models based on the Valkyrie Variable fighter designs from Macross, and the NEBO model, based upon the Orguss of Super Dimension Century Orguss.
The "Robotech Defenders" model line was tied into a two-issue limited series of the same name, published by DC comics. It shares many common themes with other science fiction series of that time, including invading aliens, and giant mechanical war machines.
Model review
Seeking to capitalize on the Mecha craze of the early 1980s, Model Company Revell went to Japan to look for suitable mecha models prior to 1984. They eventually licensed a number of Takara's Fang of the Sun Dougram models for the "Defenders" line. These models were repackaged with the "Robotech" moniker, and released in North America and Europe.
The humanoid Mech models had an average size of 30 cm, the in-scale humans were about 2 cm.
One of the features of the models (excepting the Human and Grelon miniatures) was that they were not static, but had fully movable joints and removable equipment. Because of the complexity, details and parts they can be challenging and require adult skill level even though they were sold with "ages 12 and up" on their packaging. Experienced modelers found them challenging, especially the Humans and Grelons.
In the North American market, the models met with some success, appealing to both fans of Robotech and the players of Battletech tabletop strategy game. In Europe, howeve |
https://en.wikipedia.org/wiki/Fibonacci%20prime | A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.
The first Fibonacci primes are :
2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437, 2971215073, ....
Known Fibonacci primes
It is not known whether there are infinitely many Fibonacci primes. With the indexing starting with , the first 37 indices n for which Fn is prime are :
n = 3, 4, 5, 7, 11, 13, 17, 23, 29, 43, 47, 83, 131, 137, 359, 431, 433, 449, 509, 569, 571, 2971, 4723, 5387, 9311, 9677, 14431, 25561, 30757, 35999, 37511, 50833, 81839, 104911, 130021, 148091, 201107.
(Note that the actual values Fn rapidly become very large, so, for practicality, only the indices are listed.)
In addition to these proven Fibonacci primes, several probable primes have been found:
n = 397379, 433781, 590041, 593689, 604711, 931517, 1049897, 1285607, 1636007, 1803059, 1968721, 2904353, 3244369, 3340367, 4740217, 6530879.
Except for the case n = 4, all Fibonacci primes have a prime index, because if a divides b, then also divides (but not every prime index results in a Fibonacci prime). That is to say, the Fibonacci sequence is a divisibility sequence.
Fp is prime for 8 of the first 10 primes p; the exceptions are F2 = 1 and F19 = 4181 = 37 × 113. However, Fibonacci primes appear to become rarer as the index increases. Fp is prime for only 26 of the 1,229 primes p below 10,000. The number of prime factors in the Fibonacci numbers with prime index are:
0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 2, 2, 2, 3, 2, 2, 2, 1, 2, 4, 2, 3, 2, 2, 2, 2, 1, 1, 3, 4, 2, 4, 4, 2, 2, 3, 3, 2, 2, 4, 2, 4, 4, 2, 5, 3, 4, 3, 2, 3, 3, 4, 2, 2, 3, 4, 2, 4, 4, 4, 3, 2, 3, 5, 4, 2, 1, ...
, the largest known certain Fibonacci prime is F201107, with 42029 digits. It was proved prime by Maia Karpovich in September 2023. The largest known probable Fibonacci prime is F6530879. It was found by Ryan Propper in August 2022.
It was proved by Nick MacKinnon that the only Fibonacci numbers that are also twin |
https://en.wikipedia.org/wiki/Kan%20extension | Kan extensions are universal constructs in category theory, a branch of mathematics. They are closely related to adjoints, but are also related to limits and ends. They are named after Daniel M. Kan, who constructed certain (Kan) extensions using limits in 1960.
An early use of (what is now known as) a Kan extension from 1956 was in homological algebra to compute derived functors.
In Categories for the Working Mathematician Saunders Mac Lane titled a section "All Concepts Are Kan Extensions", and went on to write that
The notion of Kan extensions subsumes all the other fundamental concepts of category theory.
Kan extensions generalize the notion of extending a function defined on a subset to a function defined on the whole set. The definition, not surprisingly, is at a high level of abstraction. When specialised to posets, it becomes a relatively familiar type of question on constrained optimization.
Definition
A Kan extension proceeds from the data of three categories
and two functors
,
and comes in two varieties: the "left" Kan extension and the "right" Kan extension of along .
The right Kan extension amounts to finding the dashed arrow and the natural transformation in the following diagram:
Formally, the right Kan extension of along consists of a functor and a natural transformation that is couniversal with respect to the specification, in the sense that for any functor and natural transformation , a unique natural transformation is defined and fits into a commutative diagram:
where is the natural transformation with for any object of
The functor R is often written .
As with the other universal constructs in category theory, the "left" version of the Kan extension is dual to the "right" one and is obtained by replacing all categories by their opposites.
The effect of this on the description above is merely to reverse the direction of the natural transformations.
(Recall that a natural transformation between the functors consis |
https://en.wikipedia.org/wiki/Parallel%20projection | In three-dimensional geometry, a parallel projection (or axonometric projection) is a projection of an object in three-dimensional space onto a fixed plane, known as the projection plane or image plane, where the rays, known as lines of sight or projection lines, are parallel to each other. It is a basic tool in descriptive geometry. The projection is called orthographic if the rays are perpendicular (orthogonal) to the image plane, and oblique or skew if they are not.
Overview
A parallel projection is a particular case of projection in mathematics and graphical projection in technical drawing. Parallel projections can be seen as the limit of a central or perspective projection, in which the rays pass through a fixed point called the center or viewpoint, as this point is moved towards infinity. Put differently, a parallel projection corresponds to a perspective projection with an infinite focal length (the distance between the lens and the focal point in photography) or "zoom". Further, in parallel projections, lines that are parallel in three-dimensional space remain parallel in the two-dimensionally projected image.
A perspective projection of an object is often considered more realistic than a parallel projection, since it more closely resembles human vision and photography. However, parallel projections are popular in technical applications, since the parallelism of an object's lines and faces is preserved, and direct measurements can be taken from the image. Among parallel projections, orthographic projections are seen as the most realistic, and are commonly used by engineers. On the other hand, certain types of oblique projections (for instance cavalier projection, military projection) are very simple to implement, and are used to create quick and informal pictorials of objects.
The term parallel projection is used in the literature to describe both the procedure itself (a mathematical mapping function) as well as the resulting image produced by the proce |
https://en.wikipedia.org/wiki/Windows%20CE%205.0 | Windows CE 5.0 (codenamed "Macallan") is a successor to Windows CE 4.2, the third release in the Windows CE .NET family. It was first released on July 9, 2004. Like its predecessors, Windows CE 5.0 is marketed towards the embedded device market and independent device vendors. Windows CE 5.0 is billed as a low-cost, compact, fast-to-market, real-time operating system available for x86, ARM, MIPS, and SuperH microprocessor-based systems.
Windows CE 5.0 builds on previous Windows CE releases in its adoption of shared source. Since 2001, Microsoft has been steadily expanding the available Windows CE source tree with embedded system developers. Windows CE 5.0 is the most open Microsoft operating system to date, though not all of the system is available under shared source agreements. Developers have the freedom to modify down to the kernel level, without the need to share their changes with Microsoft or competitors.
Windows CE 5.x is the base OS for Windows Mobile 6.0, 6.1 and 6.5. On the x86 platform, Windows CE 5.0 competes against Microsoft's other embedded operating systems, Windows XP Embedded and its predecessor Windows NT Embedded.
Platform Builder IDE for Windows CE 5.0 is the last builder tool available as standalone product.
Windows CE vs. Windows XP Embedded
According to Microsoft, Windows CE is preferable to Windows XP Embedded in situations where demanding wireless and multimedia requirements need to be met. The following are the primary considerations for “choosing the right version”:
CPU architecture: Windows CE supports an extensive array of architectures, including x86, whereas Windows XP Embedded only supports the x86 architecture.
Real-time applications: Windows CE is a real-time operating system, while Windows XP Embedded is not by default.
Existing Win32 applications: Windows CE cannot use Win32 binaries, libraries, and drivers without modification.
Memory footprint: The minimum footprint of Windows CE is 350 kilobytes. The minimum footprint |
https://en.wikipedia.org/wiki/Sea%20spray | Sea spray are aerosol particles formed from the ocean, mostly by ejection into Earth's atmosphere by bursting bubbles at the air-sea interface. Sea spray contains both organic matter and inorganic salts that form sea salt aerosol (SSA). SSA has the ability to form cloud condensation nuclei (CCN) and remove anthropogenic aerosol pollutants from the atmosphere. Coarse sea spray has also been found to inhibit the development of lightning in storm clouds.
Sea spray is directly (and indirectly, through SSA) responsible for a significant degree of the heat and moisture fluxes between the atmosphere and the ocean, affecting global climate patterns and tropical storm intensity. Sea spray also influences plant growth and species distribution in coastal ecosystems and increases corrosion of building materials in coastal areas.
Generation
Formation
When wind, whitecaps, and breaking waves mix air into the sea surface, the air regroups to form bubbles, floats to the surface, and bursts at the air-sea interface. When they burst, they release up to a thousand particles of sea spray, which range in size from nanometers to micrometers and can be expelled up to 20 cm from the sea surface. Film droplets make up the majority of the smaller particles created by the initial burst, while jet droplets are generated by a collapse of the bubble cavity and are ejected from the sea surface in the form of a vertical jet. In windy conditions, water droplets are mechanically torn off from crests of breaking waves. Sea spray droplets generated via such a mechanism are called spume droplets and are typically larger in size and have less residence time in air. Impingement of plunging waves on sea surface also generates sea spray in the form of splash droplets . The composition of the sea spray depends primarily on the composition of the water from which it is produced, but broadly speaking is a mixture of salts and organic matter. Several factors determine the production flux of sea spray, e |
https://en.wikipedia.org/wiki/Random%20seed | A random seed (or seed state, or just seed) is a number (or vector) used to initialize a pseudorandom number generator.
For a seed to be used in a pseudorandom number generator, it does not need to be random. Because of the nature of number generating algorithms, so long as the original seed is ignored, the rest of the values that the algorithm generates will follow probability distribution in a pseudorandom manner.
A pseudorandom number generator's number sequence is completely determined by the seed: thus, if a pseudorandom number generator is reinitialized with the same seed, it will produce the same sequence of numbers.
The choice of a good random seed is crucial in the field of computer security. When a secret encryption key is pseudorandomly generated, having the seed will allow one to obtain the key. High entropy is important for selecting good random seed data.
If the same random seed is deliberately shared, it becomes a secret key, so two or more systems using matching pseudorandom number algorithms and matching seeds can generate matching sequences of non-repeating numbers which can be used to synchronize remote systems, such as GPS satellites and receivers.
Random seeds are often generated from the state of the computer system (such as the time), a cryptographically secure pseudorandom number generator or from a hardware random number generator.
See also
Salt (cryptography)
Pseudorandomness
Cryptographic nonce
Initialization vector |
https://en.wikipedia.org/wiki/Falx%20cerebri | The falx cerebri (also known as the cerebral falx) is a large, crescent-shaped fold of dura mater that descends vertically into the longitudinal fissure between the cerebral hemispheres of the human brain, separating the two hemispheres and supporting dural sinuses that provide venous and CSF drainage to the brain. It is attached to the crista galli anteriorly, and blends with the tentorium cerebelli posteriorly.
The falx cerebri is often subject to age-related calcification, and a site of falcine meningiomas.
The falx cerebri is named for its sickle-like shape.
Anatomy
The falx cerebri is a strong, crescent-shaped sheet lying in the sagittal plane between the two hemispheres. It is a dural formation (one of four dural partitions of the brain along with the falx cerebelli, tentorium cerebelli, and diaphragma sellae); it is formed through invagination of the dura mater into the longitudinal fissure between the cerebral hemispheres.
Anteriorly, the falx cerebri is narrower, thinner, and may have a number of perforations. It is broader posteriorly.
Attachments
The falx cerebri attaches anteriorly at the crista galli (proximally to the cribriform plate and to the frontal and ethmoid sinuses).
Posteriorly, it blends into the upper surface of the cerebellar tentorium.
Its convex superior margin is attached to the internal surface of the skull on either side of the midline. This attachment runs as far back as the internal occipital protuberance (the latter representing its posterior-most point of attachment); the superior sagittal sinus runs in the cranial groove between the falx cerebri's two attachments.
The (concave) inferior margin of the falx cerebri is free.
Vascular supply
The falx cerebri receives its blood supply primarily from two vessels; the anterior portion receives blood supply from the anterior meningeal artery (a.k.a. anterior falx artery, or anterior falcine artery) (a branch of the anterior ethmoidal artery), and the posterior portion from the |
https://en.wikipedia.org/wiki/Nested%20radical | In algebra, a nested radical is a radical expression (one containing a square root sign, cube root sign, etc.) that contains (nests) another radical expression. Examples include
which arises in discussing the regular pentagon, and more complicated ones such as
Denesting
Some nested radicals can be rewritten in a form that is not nested. For example,
Another simple example,
Rewriting a nested radical in this way is called denesting. This is not always possible, and, even when possible, it is often difficult.
Two nested square roots
In the case of two nested square roots, the following theorem completely solves the problem of denesting.
If and are rational numbers and is not the square of a rational number, there are two rational numbers and such that
if and only if is the square of a rational number .
If the nested radical is real, and are the two numbers
and where is a rational number.
In particular, if and are integers, then and are integers.
This result includes denestings of the form
as may always be written and at least one of the terms must be positive (because the left-hand side of the equation is positive).
A more general denesting formula could have the form
However, Galois theory implies that either the left-hand side belongs to or it must be obtained by changing the sign of either or both. In the first case, this means that one can take and In the second case, and another coefficient must be zero. If one may rename as for getting Proceeding similarly if it results that one can suppose This shows that the apparently more general denesting can always be reduced to the above one.
Proof: By squaring, the equation
is equivalent with
and, in the case of a minus in the right-hand side,
(square roots are nonnegative by definition of the notation). As the inequality may always be satisfied by possibly exchanging and , solving the first equation in and is equivalent with solving
This equality implies that bel |
https://en.wikipedia.org/wiki/Cerebellar%20tentorium | The cerebellar tentorium or tentorium cerebelli (Latin for "tent of the cerebellum") is an extension of the dura mater between the inferior aspect of the occipital lobes and the superior aspect of the cerebellum. The free border of the tentorium gives passage to the midbrain (the upper-most part of the brainstem).
Structure
Free border
The free border of the tentorium is U-shaped; it forms an aperture - the tentorial notch (tentorial incisure) - which gives passage to the midbrain. The free border of each side extends anteriorly beyond the medial end of the superior petrosal sinus (i.e. the apex of the petrous part of the temporal bone) to overlap the attached margin, thenceforth forming a ridge of dura matter upon the roof of the cavernous sinus, terminating anteriorly by attaching at the anterior clinoid process.
The tentorium slopes superior-ward so that the free border is situated at a more superior level than its bony attachment, thus conforming to the shape of the surfaces of the cerebrum and cerebellum with which it is in contact.
Attached border
The attached margin of the tentorium cerebelli is attached at the edges of the transverse sinuses and superior petrosal sinus (here, the two layers of the tentorium diverge to embrace the sinuses); it thus attaches onto the occipital bone posteriorly, and (the superior angle of) the petrous part of the temporal bone anteriorly.
Anteriorly, its attachment extends to the posterior clinoid processes; posteriorly, it extends to the internal occipital protuberance.
It is attached, behind, by its convex border, to the transverse ridges upon the inner surface of the occipital bone, and there encloses the transverse sinuses; in front, to the superior angle of the petrous part of the temporal bone on either side, enclosing the superior petrosal sinuses.
Relations
The posterior end of the falx cerebri attaches onto the midline of the upper surface of the tentorium; the straight sinus runs along this line of junction. |
https://en.wikipedia.org/wiki/Historical%20Dictionary%20of%20Switzerland | The Historical Dictionary of Switzerland (Dictionnaire historique de la Suisse; DHS) is an encyclopedia on the history of Switzerland. It aims to present the history of Switzerland in the form of an encyclopaedia, published both on paper and on the Internet, in three of the country's national languages: German, French and Italian. When it was completed at the end of 2014, the paper version contained around 36,000 articles divided into thirteen volumes.At the same time, a reduced edition of the dictionary has been published in Romansh under the title Lexicon istoric retic (LIR), and constitutes the first specialist dictionary in the Rhaeto-Romance, Switzerland.
The encyclopedia is published by a foundation under the patronage of the Swiss Academy of Humanities and Social Sciences (SAGW/ASSH) and the Swiss Historical Society (SGG-SHH) and is financed by national research grants.
History of the project
A tradition of historical dictionaries
Since the time of the illustrated chronicles of Diebold Schilling the Elder in the fifteenth century, numerous historical works have appeared in Switzerland: the Chronicon Helveticum by Aegidius Tschudi (1569) contains around a thousand documents, the twenty volumes of the encyclopaedic dictionary Allgemeines Helvetisches, Eydgenössisches, Oder Schweitzerisches Lexicon (General Helvetic, Federal or Swiss Lexicon) were written by Zurich banker and politician between 1747 and 1765,. followed by the Dictionnaire géographique et statistique de la Suisse (Geographical and Statistical Dictionary of Switzerland) by .
The last Swiss historical dictionary to appear between the two world wars was the Dictionnaire historique et biographique de la Suisse (DHBS, Historical & Biographical Dictionary of Switzerland), published in seven volumes between 1921 and 1934. Edited by from Neuchâtel, it was a financial failure, mainly because of the lack of supervision of the authors, who were largely recruited by the cantonal archivists associat |
https://en.wikipedia.org/wiki/Superstabilization | Superstabilization is a concept of fault-tolerance in distributed computing. Superstabilizing distributed algorithms combine the features of self-stabilizing algorithms and dynamic algorithms. A superstabilizing algorithm – just like any other self-stabilizing algorithm – can be started in an arbitrary state, and it will eventually converge to a legitimate state. Additionally, a superstabilizing algorithm will recover rapidly from a single change in the network topology (adding or removing one edge or node in the network).
Any self-stabilizing algorithm recovers from a change in the network topology – the system configuration after a topology change can be treated just like any other arbitrary starting configuration. However, in a self-stabilizing algorithm, the convergence after a single change in the network topology may be as slow as the convergence from an arbitrary starting state. In the study of superstabilizing algorithms, special attention is paid to the time it takes to recover from a single change in the network topology.
Definitions
The stabilization time of a superstabilizing algorithm is defined exactly as in the case of self-stabilizing algorithm: how long it takes to converge to a legitimate state from an arbitrary configuration. Depending on the computational model, time is measured, e.g., in synchronous communication rounds or in asynchronous cycles.
The superstabilization time is the time to recover from a single topology change. It is assumed that the system is initially in a legitimate configuration. Then the network topology is changed; the superstabilization time is the maximum time it takes for the system to reach a legitimate configuration again. Similarly, the adjustment measure is the maximum number of nodes that have to change their state after such changes.
The “almost-legitimate configurations” which occur after one topology change can be formally modelled by using passage predicates: a passage predicate is a predicate that holds af |
https://en.wikipedia.org/wiki/Luther%20rose | The Luther seal or Luther rose is a widely recognized symbol for Lutheranism. It was the seal that was designed for Martin Luther at the behest of John Frederick of Saxony in 1530, while Luther was staying at the Coburg Fortress during the Diet of Augsburg. Lazarus Spengler, to whom Luther wrote his interpretation below, sent Luther a drawing of this seal. Luther saw it as a compendium or expression of his theology and faith, which he used to authorize his correspondence. Luther informed Philipp Melanchthon on 15 September 1530, that the Prince had personally visited him in the Coburg fortress and presented him with a signet ring, presumably displaying the seal.
Components of the seal connected to Luther earlier than 1530
A single rose had been known as Luther's emblem since 1520 when Wolfgang Stöckel in Leipzig published one of Luther's sermons with a woodcut of the reformer. This was the first contemporary depiction of Martin Luther.
Luther's doctor's ring displayed a heartlike shield, the symbol of the Holy Trinity.
Luther's interpretation of his seal
In an 8 July 1530 letter to Lazarus Spengler, Luther interprets his seal:
Use in Byzantine Rite Lutheranism
Churches of Byzantine Rite Lutheranism, such as the Ukrainian Lutheran Church, use the Luther rose with an Orthodox cross in the centre.
Use in coats of arms
The Luther rose is used in many coats of arms. The assumption that Martin Luther had visited any of these places is not confirmed.
German and Austrian arms
See also
Rose (heraldry) – often used both as a charge on a coat of arms and by itself as an heraldic badge
Rose symbolism
Notes
Bibliography
Luther, Martin. D. Martin Luthers Werke, Kritische Gesamtausgabe. Briefwechsel. 18 vols. Weimar: Verlag Hermann Böhlaus Nachfolger, 1930–85. (abbreviated as WABr above).
Luther, Martin. Luther's Works. 55 Volumes. Various translators. St. Louis: Concordia Publishing House; Minneapolis: Fortress Press, 1957–1986. CD-ROM edition, 2001. (abbrevia |
https://en.wikipedia.org/wiki/IEEE%20802.18 | IEEE 802.18, the Radio Regulatory Technical Advisory Group ("RR-TAG"), is a working group of IEEE 802, the LAN/MAN Standards Committee (LMCS). The working group currently has 6 projects on standards for radio-based systems:
IEEE 802.11 (Wireless Local area network- WLAN)
IEEE 802.15 (Wireless Personal area network - WPAN)
IEEE 802.16 (Wireless Metropolitan area network - WMAN)
IEEE 802.20 (Wireless Mobility)
IEEE 802.21 (Hand-off/Interoperability Between Networks)
IEEE 802.22 (Wireless Regional Area Network - WRAN).
The RR-TAG monitors the interests of the above 6 projects, at both national and international levels, and then makes comments and recommends policies to regulators, which balance the interests of all the wireless LMCS projects. |
https://en.wikipedia.org/wiki/Banach%20manifold | In mathematics, a Banach manifold is a manifold modeled on Banach spaces. Thus it is a topological space in which each point has a neighbourhood homeomorphic to an open set in a Banach space (a more involved and formal definition is given below). Banach manifolds are one possibility of extending manifolds to infinite dimensions.
A further generalisation is to Fréchet manifolds, replacing Banach spaces by Fréchet spaces. On the other hand, a Hilbert manifold is a special case of a Banach manifold in which the manifold is locally modeled on Hilbert spaces.
Definition
Let be a set. An atlas of class on is a collection of pairs (called charts) such that
each is a subset of and the union of the is the whole of ;
each is a bijection from onto an open subset of some Banach space and for any indices is open in
the crossover map is an -times continuously differentiable function for every that is, the th Fréchet derivative exists and is a continuous function with respect to the -norm topology on subsets of and the operator norm topology on
One can then show that there is a unique topology on such that each is open and each is a homeomorphism. Very often, this topological space is assumed to be a Hausdorff space, but this is not necessary from the point of view of the formal definition.
If all the Banach spaces are equal to the same space the atlas is called an -atlas. However, it is not a priori necessary that the Banach spaces be the same space, or even isomorphic as topological vector spaces. However, if two charts and are such that and have a non-empty intersection, a quick examination of the derivative of the crossover map
shows that and must indeed be isomorphic as topological vector spaces. Furthermore, the set of points for which there is a chart with in and isomorphic to a given Banach space is both open and closed. Hence, one can without loss of generality assume that, on each connected component of the atlas is an -a |
https://en.wikipedia.org/wiki/Hilbert%20manifold | In mathematics, a Hilbert manifold is a manifold modeled on Hilbert spaces. Thus it is a separable Hausdorff space in which each point has a neighbourhood homeomorphic to an infinite dimensional Hilbert space. The concept of a Hilbert manifold provides a possibility of extending the theory of manifolds to infinite-dimensional setting. Analogously to the finite-dimensional situation, one can define a differentiable Hilbert manifold by considering a maximal atlas in which the transition maps are differentiable.
Properties
Many basic constructions of the manifold theory, such as the tangent space of a manifold and a tubular neighbourhood of a submanifold (of finite codimension) carry over from the finite dimensional situation to the Hilbert setting with little change. However, in statements involving maps between manifolds, one often has to restrict consideration to Fredholm maps, that is, maps whose differential at every point is Fredholm. The reason for this is that Sard's lemma holds for Fredholm maps, but not in general. Notwithstanding this difference, Hilbert manifolds have several very nice properties.
Kuiper's theorem: If is a compact topological space or has the homotopy type of a CW complex then every (real or complex) Hilbert space bundle over is trivial. In particular, every Hilbert manifold is parallelizable.
Every smooth Hilbert manifold can be smoothly embedded onto an open subset of the model Hilbert space.
Every homotopy equivalence between two Hilbert manifolds is homotopic to a diffeomorphism. In particular every two homotopy equivalent Hilbert manifolds are already diffeomorphic. This stands in contrast to lens spaces and exotic spheres, which demonstrate that in the finite-dimensional situation, homotopy equivalence, homeomorphism, and diffeomorphism of manifolds are distinct properties.
Although Sard's Theorem does not hold in general, every continuous map from a Hilbert manifold can be arbitrary closely approximated by a smooth map |
https://en.wikipedia.org/wiki/Rattleback | A rattleback is a semi-ellipsoidal top which will rotate on its axis in a preferred direction. If spun in the opposite direction, it becomes unstable, "rattles" to a stop and reverses its spin to the preferred direction.
This spin-reversal appears to violate the law of the conservation of angular momentum. Moreover, for most rattlebacks the motion will happen when the rattleback is spun in one direction, but not when spun in the other. Some exceptional rattlebacks will reverse when spun in either direction.
This makes the rattleback a physical curiosity that has excited human imagination since prehistoric times.
A rattleback may also be known as a "anagyre", "(rebellious) celt", "Celtic stone", "druid stone", "rattlerock", "Robinson Reverser", "spin bar", "wobble stone" (or "wobblestone") and by product names including "ARK", "Bizzaro Swirl", "Space Pet" and "Space Toy".
History
Archeologists who investigated ancient Celtic and Egyptian sites in the 19th century found celts which exhibited the spin-reversal motion. The antiquarian word celt (the "c" is soft, pronounced as "s") describes lithic tools and weapons shaped like an adze, axe, chisel, or hoe.
The first modern descriptions of these celts were published in the 1890s when Gilbert Walker wrote his "On a curious dynamical property of celts" for the Proceedings of the Cambridge Philosophical Society in Cambridge, England, and "On a dynamical top" for the Quarterly Journal of Pure and Applied Mathematics in Somerville, Massachusetts, US.
Additional examinations of rattlebacks were published in 1909 and 1918, and by the 1950s and 1970s, several more examinations were made. But, the popular fascination with the objects has increased notably since the 1980s when no fewer than 28 examinations were published.
Size and materials
Rattleback artifacts are typically stone and come in various sizes. Modern ones sold as novelty puzzles and toys are generally made of plastic, wood, or glass, and come in sizes from a |
https://en.wikipedia.org/wiki/VESA%20Digital%20Flat%20Panel | The VESA Digital Flat Panel (DFP) interface standard specifies a video connector and digital TMDS signaling for flat-panel displays. It features 20 pins and uses the PanelLink protocol; the standard is based on the preceding VESA Plug and Display (P&D) standard, ratified in 1997. Unlike the later, electrically-compatible Digital Visual Interface (DVI, 1999), DFP never achieved widespread implementation.
History
P&D combined analog and digital video with data over USB and FireWire to reduce cable clutter, but the feature creep resulted in an unpopular, expensive connector. Compaq described DFP as a "transition" step between the analog VGA connector and P&D: DFP was designed by a consortium including Compaq, Hewlett-Packard, and ATI Technologies as a smaller, simpler connector, dropping support for analog video and data in favor of transmitting exclusively digital video signals.
The connector was used by displays such as the Compaq Presario FP400, FP500, FP700, Fp720, 5204, and 5280. It was offered on graphics cards such as the Xpert LCD, and Rage LT Pro by ATI Technologies, and the Oxygen GVX1 by 3Dlabs.
Design
DFP is compatible electrically with P&D (and by extension, DVI); DFP uses the Display Data Channel (DDC) standard level DDC2B for operation and the Extended Display Identification Data (EDID) protocol to identify the display to the host. Like the preceding P&D, DFP uses the PanelLink TMDS protocol developed by Silicon Image for digital video signals.
The DFP standard specifies a 20-pin mini D ribbon connector; however, as the signal protocols are identical, DFP connectors generally are compatible with devices equipped with a DVI interface by using a passive adaptor.
All DFP-compliant devices are required to support resolutions of 640×400, 720×400, and 640×480 (each at a refresh rate of 60Hz) as a minimum level of interoperability, although the resulting display may not necessarily be centered or scaled.
DFP was superseded by DVI because DFP, like P&D, is |
https://en.wikipedia.org/wiki/Trailblazer%20%28video%20game%29 | Trailblazer is a racing video game developed by Mr. Chip Software and published by Gremlin Graphics for the ZX Spectrum, Commodore 64, Atari 8-bit family, Amstrad CPC and Commodore 16/Plus/4 in 1986 (there was also an enhanced version on Amstrad CPC 3" disc). It was ported to the Amiga and Atari ST.
In 2005 a remake for the Gizmondo was released, and was also adapted in 2011 for the PS3, PlayStation Portable, PS Vita and PlayStation TV as part of the Playstation Mini series.
The game received a direct sequel titled Cosmic Causeway: Trailblazer II in 1987.
Gameplay
Trailblazer is a racing game which players play as a soccer ball along a series of suspended passages. The game can be played either in time trial or arcade mode and four track. The races usually last between 15 and 45 seconds. Special fields on the track let the ball jump (blue), slow down (red), speed up (green) or warp speed the ball (white), invert the controls (cyan/light blue), bounce it backwards (purple) or are holes (black).
Development
Shaun Southern had made some great games for the Commodore 16 before he moved onto the Amiga and the game was inspired by the arcade game Metrocross.
Reception
The game was reviewed in 1990 in Dragon #158 by Hartley, Patricia, and Kirk Lesser in "The Role of Computers" column, as part of the Mastertronic MEGA Pack of 10 games previously released in Europe. The reviewers gave the game 5 out of 5 stars, stating: "Our favorite on this disk; racing on Cosmic Causeway roads against the clock or against a robot. This one was really fun".
Zzap!64'''s reviewers also enjoyed the game which they thought was "an excellent variation on the race game theme". The overall rating given was 93%, qualifying the C64 version for the magazine's Sizzler award. Steve Panak, reviewing the Atari 8-bit version for ANALOG Computing, concluded that "the game is the most original arcade action wristbuster to come down the pike in a long time, and one of the best two-player competition |
https://en.wikipedia.org/wiki/Nanchung | Nanchung is an invertebrate TRP channel that acts to sense mechanical force. Drosophila nanchung mutants show deficits in antennal sensation, including hearing and hygrosensation, and are unable to transduce sound stimuli. |
https://en.wikipedia.org/wiki/Cellular%20neural%20network | In computer science and machine learning, cellular neural networks (CNN) or cellular nonlinear networks (CNN) are a parallel computing paradigm similar to neural networks, with the difference that communication is allowed between neighbouring units only. Typical applications include image processing, analyzing 3D surfaces, solving partial differential equations, reducing non-visual problems to geometric maps, modelling biological vision and other sensory-motor organs.
CNN is not to be confused with convolutional neural network (also colloquially called CNN).
CNN architecture
Due to their number and variety of architectures, it is difficult to give a precise definition for a CNN processor. From an architecture standpoint, CNN processors are a system of finite, fixed-number, fixed-location, fixed-topology, locally interconnected, multiple-input, single-output, nonlinear processing units. The nonlinear processing units are often referred to as neurons or cells. Mathematically, each cell can be modeled as a dissipative, nonlinear dynamical system where information is encoded via its initial state, inputs and variables used to define its behavior. Dynamics are usually continuous, as in the case of Continuous-Time CNN (CT-CNN) processors, but can be discrete, as in the case of Discrete-Time CNN (DT-CNN) processors.
Each cell has one output, by which it communicates its state with both other cells and external devices. Output is typically real-valued, but can be complex or even quaternion, i.e. a Multi-Valued CNN (MV-CNN). Most CNN processors, processing units are identical, but there are applications that require non-identical units, which are called Non-Uniform Processor CNN (NUP-CNN) processors, and consist of different types of cells.
Chua-Yang CNN
In the original Chua-Yang CNN (CY-CNN) processor, the state of the cell was a weighted sum of the inputs and the output was a piecewise linear function. However, like the original perceptron-based neural networks, the |
https://en.wikipedia.org/wiki/SMBRelay | SMBRelay and SMBRelay2 are computer programs that can be used to carry out SMB man-in-the-middle (mitm) attacks on Windows machines. They were written by Sir Dystic of CULT OF THE DEAD COW (cDc) and released March 21, 2001 at the @lantacon convention in Atlanta, Georgia. More than seven years after its release, Microsoft released a patch that fixed the hole exploited by SMBRelay. This fix only fixes the vulnerability when the SMB is reflected back to the client. If it is forwarded to another host, the vulnerability can be still exploited.
SMBRelay
SMBrelay receives a connection on UDP port 139 and relays the packets between the client and server of the connecting Windows machine to the originating computer's port 139. It modifies these packets when necessary.
After connecting and authenticating, the target's client is disconnected and SMBRelay binds to port 139 on a new IP address. This relay address can then be connected to directly using "net use \\192.1.1.1" and then used by all of the networking functions built into Windows. The program relays all of the SMB traffic, excluding negotiation and authentication. As long as the target host remains connected, the user can disconnect from and reconnect to this virtual IP.
SMBRelay collects the NTLM password hashes and writes them to hashes.txt in a format usable by L0phtCrack for cracking at a later time.
As port 139 is a privileged port and requires administrator access for use, SMBRelay must run as an administrator access account. However, since port 139 is needed for NetBIOS sessions, it is difficult to block.
According to Sir Dystic, "The problem is that from a marketing standpoint, Microsoft wants their products to have as much backward compatibility as possible; but by continuing to use protocols that have known issues, they continue to leave their customers at risk to exploitation... These are, yet again, known issues that have existed since day one of this protocol. This is not a bug but a fundamental |
https://en.wikipedia.org/wiki/Super%20Cobra | Super Cobra is a horizontally scrolling shooter developed by Konami, originally released as an arcade video game in 1981. It was published by Konami in Japan in March 1981 and manufactured and distributed by Stern in North America on June 22. It is the spiritual sequel to the Scramble arcade game released earlier in 1981. Super Cobra contains eleven distinct sections, versus six in Scramble, and is significantly more difficult, requiring maneuvering through tight spaces early in the game.
The game was a commercial success, selling 12,337 arcade cabinets in the United States within four months, becoming Stern's third best-selling arcade game. Super Cobra was widely ported by Parker Brothers, and there are Adventure Vision and standalone versions from Entex.
Gameplay
The player controls a helicopter through tight caverns, and the slightest misstep will result in the loss of a life. However, unlike Scramble, the game can be continued where the player left off by adding more credits and pressing FIRE (but he/she loses all points upon continuing).
The joystick accelerates, decelerates, moves up, and moves down. The helicopter uses a laser and bomb to destroy defenders, tanks, and UFOs while infiltrating 10 Super Cobra defense systems.
The ship has a limited fuel supply, which is depleted over time. More fuel can be acquired by destroying fuel tanks in the game.
The game is divided into ten sections, plus a finale, each with a different style of terrain and different obstacles. Players navigate through ten levels and a base, where they must safely make it through the level and remove the booty. The levels are described as follows:
Player must maneuver the chopper over mountainous terrain against fast and slow firing rockets.
Chopper faces Arcing missiles over a mountain terrain.
Smart Bombs flying in groups of four over mountainous terrain. Rockets appear, but do not fire.
Single Smart Bombs over mountainous terrain. Again, Rockets appear, but do not fire.
Cho |
https://en.wikipedia.org/wiki/Hormonal%20sentience | Hormonal sentience, first described by Robert A. Freitas Jr., describes the information processing rate in plants, which are mostly based on hormones instead of neurons like in all major animals (except sponges). Plants can to some degree communicate with each other and there are even examples of one-way-communication with animals.
Acacia trees produce tannin to defend themselves when they are grazed upon by animals. The airborne scent of the tannin is picked up by other acacia trees, which then start to produce tannin themselves as a protection from the nearby animals.
When attacked by caterpillars, some plants can release chemical signals to attract parasitic wasps that attack the caterpillars.
A similar phenomenon can be found not only between plants and animals, but also between fungi and animals. There exists some sort of communication between a fungus garden and workers of the leaf-cutting ant Atta sexdens rubropilosa. If the garden is fed with plants that are poisonous for the fungus, it signals this to the ants, which then will avoid fertilizing the fungus garden with any more of the poisonous plant.
The Venus flytrap, during a 1- to 20-second sensitivity interval, counts two stimuli before snapping shut on its insect prey, a processing peak of 1 bit/s. Mass is 10–100 grams, so the flytrap's SQ is about +1. Plants generally take hours to respond to stimuli though, so vegetative SQs (Sentience Quotient) tend to cluster around -2.
See also
Biosemiotics
Phytosemiotics
Plant cognition
Plant perception (physiology)
:Category:Plant cognition |
https://en.wikipedia.org/wiki/List%20of%20fractals%20by%20Hausdorff%20dimension | According to Benoit Mandelbrot, "A fractal is by definition a set for which the Hausdorff-Besicovitch dimension strictly exceeds the topological dimension."
Presented here is a list of fractals, ordered by increasing Hausdorff dimension, to illustrate what it means for a fractal to have a low or a high dimension.
Deterministic fractals
Random and natural fractals
See also
Fractal dimension
Hausdorff dimension
Scale invariance
Notes and references
Further reading
External links
The fractals on Mathworld
Other fractals on Paul Bourke's website
Soler's Gallery
Fractals on mathcurve.com
1000fractales.free.fr - Project gathering fractals created with various software
Fractals unleashed
IFStile - software that computes the dimension of the boundary of self-affine tiles
Hausdorff Dimension
Hausdorff Dimension
Mathematics-related lists |
https://en.wikipedia.org/wiki/MultiDimensional%20eXpressions | Multidimensional Expressions (MDX) is a query language for online analytical processing (OLAP) using a database management system. Much like SQL, it is a query language for OLAP cubes. It is also a calculation language, with syntax similar to spreadsheet formulae.
Background
The MultiDimensional eXpressions (MDX) language provides a specialized syntax for querying and manipulating the multidimensional data stored in OLAP cubes. While it is possible to translate some of these into traditional SQL, it would frequently require the synthesis of clumsy SQL expressions even for very simple MDX expressions. MDX has been embraced by a wide majority of OLAP vendors and has become the standard for OLAP systems.
History
MDX was first introduced as part of the OLE DB for OLAP specification in 1997 from Microsoft. It was invented by the group of SQL Server engineers including Mosha Pasumansky. The specification was quickly followed by commercial release of Microsoft OLAP Services 7.0 in 1998 and later by Microsoft Analysis Services. The latest version of the OLE DB for OLAP specification was issued by Microsoft in 1999.
While it was not an open standard, but rather a Microsoft-owned specification, it was adopted by a wide range of OLAP vendors.
The XML for Analysis specification referred back to the OLE DB for OLAP specification for details on the MDX Query Language. In Analysis Services 2005, Microsoft added some MDX Query Language extensions like subselects. Products like Microsoft Excel 2007 started to use these new MDX Query Language extensions. Some refer to this newer variant of MDX as MDX 2005.
mdXML
In 2001 the XMLA Council released the XML for Analysis (XMLA) standard, which included mdXML as a query language. In the XMLA 1.1 specification, mdXML is essentially MDX wrapped in the XML <Statement> tag.
MDX data types
There are six primary data types in MDX
Scalar. Scalar is either a number or a string. It can be specified as a literal, e.g. number 5 or string " |
https://en.wikipedia.org/wiki/Paul%20Zeitz | Paul Zeitz (born July 5, 1958) is a Professor of Mathematics at the University of San Francisco. He is the author of The Art and Craft of Problem Solving, and a co-author of Statistical Explorations with Excel.
Biography
In 1974 Paul Zeitz won the USA Mathematical Olympiad (USAMO) and was a member of the first American team to participate in the International Mathematical Olympiad (IMO). The following year he graduated from Stuyvesant High School.
He earned a Westinghouse scholarship and graduated from Harvard University in 1981.
Since 1985, he has composed and edited problems for several national math contests, including the USAMO. He has helped train several American IMO teams, most notably the 1994 "Dream Team", the first team from any country to score a perfect 252 in the Olympiad. (The only other team to have ever done so was China's 2022 team.)
Zeitz founded the Bay Area Math Meet in 1994 and co-founded the Bay Area Mathematical Olympiad in 1999. In 1999 he wrote The Art and Craft of Problem Solving , a popular book on problem solving.
In 2003 Zeitz received from the Mathematical Association of America the Deborah and Franklin Haimo Awards for Distinguished College or University Teaching of Mathematics. |
https://en.wikipedia.org/wiki/Aposematism | Aposematism is the advertising by an animal to potential predators that it is not worth attacking or eating. This unprofitability may consist of any defenses which make the prey difficult to kill and eat, such as toxicity, venom, foul taste or smell, sharp spines, or aggressive nature. These advertising signals may take the form of conspicuous coloration, sounds, odours, or other perceivable characteristics. Aposematic signals are beneficial for both predator and prey, since both avoid potential harm.
The term was coined in 1877 by Edward Bagnall Poulton for Alfred Russel Wallace's concept of warning coloration. Aposematism is exploited in Müllerian mimicry, where species with strong defences evolve to resemble one another. By mimicking similarly coloured species, the warning signal to predators is shared, causing them to learn more quickly at less of a cost.
A genuine aposematic signal that a species actually possesses chemical or physical defences is not the only way to deter predators. In Batesian mimicry, a mimicking species resembles an aposematic model closely enough to share the protection, while many species have bluffing deimatic displays which may startle a predator long enough to enable an otherwise undefended prey to escape.
There is good evidence for aposematism in terrestrial animals; its existence in marine animals is possible but disputed.
Etymology
The term aposematism was coined by the English zoologist Edward Bagnall Poulton in his 1890 book The Colours of Animals. He based the term on the Ancient Greek words ἀπό apo 'away' and σῆμα sēma 'sign', referring to signs that warn other animals away.
Defense mechanism
The function of aposematism is to prevent attack, by warning potential predators that the prey animal has defenses such as being unpalatable or poisonous. The easily detected warning is a primary defense mechanism, and the non-visible defenses are secondary. Aposematic signals are primarily visual, using bright colors and high-con |
https://en.wikipedia.org/wiki/Communalness | Communalness, as suggested by Robert A. Freitas Jr., is a level of an emergent phenomenon which originates from electronic sentience, and represents a broader mode of thinking than just normal consciousness. While consciousness is limited to the individual, communalness describes a complex organization of numerous individuals which on a higher level is tightly connected to each other. Such an organization would maybe have the same intimate awareness of its own existence as a whole as people have consciousness of their own bodies.
See also
Collective consciousness
Collective identity
Collective intelligence
Collective memory
Group mind (science fiction)
Hormonal sentience
Neurohacking
External links
Xenopsychology by Robert A. Freitas Jr.
Science fiction themes
Consciousness
Superorganisms
Emergence |
https://en.wikipedia.org/wiki/31-bit%20computing | In computer architecture, 31-bit integers, memory addresses, or other data units are those that are 31 bits wide.
In 1983, IBM introduced 31-bit addressing in the System/370-XA mainframe architecture as an upgrade to the 24-bit physical and virtual, and transitional 24-bit-virtual/26-bit physical, addressing in System/370. This enhancement allowed address spaces to be 128 times larger, permitting programs to address memory above 16 MB (referred to as "above the line"). Support for COBOL, FORTRAN and later on Linux/390 were included.
In the early 1980s, the Motorola 68012 was introduced; it had 32-bit data and address registers, as the Motorola 68010 did, but instead of providing the lower 24 bits of an address on the address pins, it provided all but bit 30 on the address pins.
31-bit computer
The Librascope LGP-30 was an early off-the-shelf computer. The LGP-30 was first manufactured in 1956, at a retail price of $47,000, .
It was a binary, 31-bit word computer with a 4096-word drum memory. There were 32 bit locations per drum word, but only 31 were used, permitting a "restoration of magnetic flux in the head" at the 32nd bit time. The number of vacuum tubes was minimized by using solid-state diode logic, a bit-serial architecture and multiple use of each of its 15 flip-flops.
The LGP-30 was commonly referred to as a desk computer. Its height, width, and depth, excluding the typewriter shelf, was 33 by 44 by 26 inches (84 by 112 by 66 cm). It weighed about 800 pounds (360 kg), and was mounted on sturdy casters which facilitated moving the unit.
IBM mainframes with 31-bit addressing
In the System/360, other than the 360/67, and early System/370 architectures, the general-purpose registers were 32 bits wide, the machine did 32-bit arithmetic operations, and addresses were always stored in 32-bit words, so the architecture was considered 32-bit, but the machines ignored the top 8 bits of the address resulting in 24-bit addressing.
With the System/370-XA archit |
https://en.wikipedia.org/wiki/24-bit%20computing | Notable 24-bit machines include the CDC 924 – a 24-bit version of the CDC 1604, CDC lower 3000 series, SDS 930 and SDS 940, the ICT 1900 series, the Elliott 4100 series, and the Datacraft minicomputers/Harris H series.
The term SWORD is sometimes used to describe a 24-bit data type with the S prefix referring to sesqui.
The range of unsigned integers that can be represented in 24 bits is 0 to 16,777,215 ( in hexadecimal). The range of signed integers that can be represented in 24 bits is −8,388,608 to 8,388,607.
Usage
The IBM System/360, announced in 1964, was a popular computer system with 24-bit addressing and 32-bit general registers and arithmetic. The early 1980s saw the first popular personal computers, including the IBM PC/AT with an Intel 80286 processor using 24-bit addressing and 16-bit general registers and arithmetic, and the Apple Macintosh 128K with a Motorola 68000 processor featuring 24-bit addressing and 32-bit registers.
The eZ80 is a microprocessor and microcontroller family, with 24-bit registers and therefore 24-bit linear addressing, that is binary compatible with the 8/16-bit Z80.
The 65816 is a microprocessor and microcontroller family with 16-bit registers and 24-bit bank switched addressing. It is binary compatible with the 8-bit 6502.
Several fixed-point digital signal processors have a 24-bit data bus, selected as the basic word length because it gave the system a reasonable precision for the processing audio (sound). In particular, the Motorola 56000 series has three parallel 24-bit data buses, one connected to each memory space: program memory, data memory X, and data memory Y.
Engineering Research Associates (later merged into UNIVAC) designed a series of 24-bit drum memory machines including the Atlas, its commercial version the UNIVAC 1101, the ATHENA computer, the UNIVAC 1824 guidance computer, etc. Those designers selected a 24-bit word length because the Earth is roughly 40 million feet in diameter, and an intercontinen |
https://en.wikipedia.org/wiki/I%20Wish%20It%20Would%20Rain | "I Wish It Would Rain" is a 1967 song recorded by the Temptations for the Motown label (under the "Gordy" imprint) and produced by Norman Whitfield.
Release
Issued with the Melvin Franklin-led "I Truly, Truly Believe" as its B-side, "I Wish It Would Rain" peaked for three weeks in February and March 1968 at number four on the Billboard Hot 100 pop singles chart and at the number-one position on the Billboard R&B singles chart. The single was the focal point of the Temptations' 1968 album The Temptations Wish It Would Rain.
Billboard described the single as an "easy beat blues rocker" that "will soar to the top in short order." Cash Box said that "touches of Bacarachian style add a refreshingly new dimension to the terrific sound of the Temptations" and that "hard percussion and coasting strings give a solidity and gentleness to the soul vocal."
Personnel
Lead vocals by David Ruffin
Background vocals by Eddie Kendricks, Melvin Franklin, Paul Williams, and Otis Williams
Written by Norman Whitfield, Barrett Strong, and Rodger Penzabene
Produced by Norman Whitfield
Instrumentation by The Funk Brothers.
Cover versions
"I Wish It Would Rain" has been covered by a number of artists, including:
The Faces recorded a 1973 cover, which was a hit in the United Kingdom.
Gladys Knight & the Pips, peaking in the US at number 41 pop and 15 R&B.
Aretha Franklin, on the 1983 album Get It Right.
New Zealand singer songwriter, Jon Stevens recorded and released a version of the song in 1994, with money raised benefiting drought-stricken farmers. The song peaked at number 49 in New Zealand.
Bruce Springsteen recorded the song for his 2022 album Only the Strong Survive.
Notes
1967 singles
1968 singles
1973 singles
1994 singles
2007 singles
The Temptations songs
Marvin Gaye songs
Gladys Knight & the Pips songs
Jon Stevens songs
Renée Geyer songs
Ike & Tina Turner songs
Songs written by Barrett Strong
Songs written by Norman Whitfield
Songs written by Rodger Penzabene
Song |
https://en.wikipedia.org/wiki/Microchimerism | Microchimerism is the presence of a small number of cells in an individual that have originated from another individual and are therefore genetically distinct. This phenomenon may be related to certain types of autoimmune diseases although the responsible mechanisms are unclear. The term comes from the prefix "micro" + "chimerism" based on the hybrid Chimera of Greek mythology. The concept was first discovered in the 1960s with the term gaining usage in the 1970s.
Types
Human
In humans (and perhaps in all placentals), the most common form is fetomaternal microchimerism (also known as fetal cell microchimerism or fetal chimerism) whereby cells from a fetus pass through the placenta and establish cell lineages within the mother. Fetal cells have been documented to persist and multiply in the mother for several decades. The exact phenotype of these cells is unknown, although several different cell types have been identified, such as various immune lineages, mesenchymal stem cells, and placental-derived cells. A 2012 study at the Fred Hutchinson Cancer Research Center, Seattle, has detected cells with the Y chromosome in multiple areas of the brains of deceased women.
Fetomaternal microchimerism occurs during pregnancy and shortly after giving birth for most women. However, not all women who have had children contain fetal cells. Studies suggest that fetomaternal microchimerism could be influenced by killer-cell immunoglobulin-like (KIR) ligands. Lymphocytes also influence the development of persisting fetomaternal microchimerism since natural killer cells compose about 70% of lymphocytes in the first trimester of pregnancy. KIR patterns on maternal natural killer cells of the mother and KIR ligands on the fetal cells could have an effect on fetomaternal microchimerism. In one study, mothers with KIR2DS1 exhibited higher levels of fetomaternal microchimerism compared to mothers who were negative for this activating KIR.
The potential health consequences of these cel |
https://en.wikipedia.org/wiki/KPackage | KPackage was KDE's package manager frontend.
It supported BSD, Debian, Gentoo, RPM and Slackware packages. It provided a GUI for the management and upgrade of existing packages and the installation and acquirement of new packages. Additionally, it provided functionality to help manage package caches. KPackage was part of kdeadmin, and was developed at KDE.org.
See also
PackageKit
Synaptic (software)
Ubuntu Software Center |
https://en.wikipedia.org/wiki/Whole%20sour%20cabbage | Whole sour cabbage (, , literally: "cabbage soured in heads") is a fermented vegetable food preserve, popular in Eastern European and Balkan cuisines. It is similar to sauerkraut, with the difference that it is prepared through the lacto-fermentation for several weeks of whole heads of cabbage, not separate leaves or grated mass. No vinegar or boiling is required. It is a homemade food preserve, commonly prepared in large barrels filled with whole cabbage heads and water salted with sea salt.
Preparation
After the external leaves and core have been removed, the cabbage heads are salted, packed into the barrel as densely as possible (another reason why a round form is required) and covered with salted water (4–6% of salt). A heavy load (a rock, for example) is placed above, to keep them under the water, in anaerobic conditions. From time to time the water has to be reversed (flushed from the bottom of the barrel and then again sluiced onto the top), adding more (always with salt) if necessary. A higher salinity makes the fermentation slower, while an insufficient salinity makes it unsafe. Higher temperatures require a higher salinity. The fermentation should be done at 16-22 °C. The best temperature is 18-20 °C. A cabbage fermented at a lower temperature has a better fragrance. The best known microorganisms involved in the process include Leuconostoc mesenteroides, Lactobacillus brevis, Enterococcus faecalis, Pediococcus acidilactici and Lactobacillus plantarum.
Use
Sour cabbage is a popular Bosnian, Bulgarian, Croatian, Macedonian, Romanian, and Serbian food, consumed mainly during the winter half of the year, both raw or cooked. Raw, it is a very popular winter salad, usually served dusted with pepper powder (aleva paprika) and/or black pepper, but also as-is. In cooking, it is used for sarma, and in other dishes, such as podvarak.
See also |
https://en.wikipedia.org/wiki/Cumulina | Cumulina (October 3, 1997 - May 5, 2000), a mouse, was the first animal cloned from adult cells that survived to adulthood. She was cloned using the Honolulu technique developed by "Team Yana", the Ryuzo Yanagimachi research group at the former campus of the John A. Burns School of Medicine located at the University of Hawai'i at Mānoa. Cumulina was a brown Mus musculus or common house mouse. She was named after the cumulus cells surrounding the developing oocyte in the ovarian follicle in mice. Nuclei from these cells were put into egg cell devoid of their original nuclei in the Honolulu cloning technique. All other mice produced by the Yanagimachi lab are just known by a number.
Cumulina was able to produce two healthy litters. She was retired after the second.
Cumulina's preserved remains can be visited at the Institute for Biogenesis Research, a part of the John A. Burns School of Medicine laboratory, in Honolulu, Hawaii.
Some of her descendants have been displayed at the Bishop Museum and the Museum of Science and Industry in Chicago, Illinois. |
https://en.wikipedia.org/wiki/High%20Precision%20Event%20Timer | The High Precision Event Timer (HPET) is a hardware timer available in modern x86-compatible personal computers. Compared to older types of timers available in the x86 architecture, HPET allows more efficient processing of highly timing-sensitive applications, such as multimedia playback and OS task switching. It was developed jointly by Intel and Microsoft and has been incorporated in PC chipsets since 2005. Formerly referred to by Intel as a Multimedia Timer, the term HPET was selected to avoid confusion with the software multimedia timers introduced in the MultiMedia Extensions to Windows 3.0.
Older operating systems that do not support a hardware HPET device can only use older timing facilities, such as the programmable interval timer (PIT) or the real-time clock (RTC). Windows XP, when fitted with the latest hardware abstraction layer (HAL), can also use the processor's Time Stamp Counter (TSC), or ACPI Power Management Timer (ACPI PMTIMER), together with the RTC to provide operating system features that would, in later Windows versions, be provided by the HPET hardware. Confusingly, such Windows XP systems quote "HPET" connectivity in the device driver manager even though the Intel HPET device is not being used.
Features
An HPET chip consists of a 64-bit up-counter (main counter) counting at a frequency of at least 10 MHz, and a set of (at least three, up to 256) comparators. These comparators are 32- or 64-bit-wide. The HPET is programmed via a memory mapped I/O window that is discoverable via ACPI. The HPET circuit in modern PCs is integrated into the southbridge chip.
Each comparator can generate an interrupt when the least significant bits are equal to the corresponding bits of the 64-bit main counter value. The comparators can be put into one-shot mode or periodic mode, with at least one comparator supporting periodic mode and all of them supporting one-shot mode. In one-shot mode the comparator fires an interrupt once when the main counter reaches the |
https://en.wikipedia.org/wiki/Data%20structure%20diagram | A data structure diagram (DSD) is the visual representation of a certain kind of data model that contains entities, their relationships, and the constraints that are placed on them. It is an older alternative to the entity–relationship model.
The basic graphic notation elements of DSDs are boxes which represent entities. Arrow symbols represent relationships. Data structure diagrams are most useful for documenting complex data entities.
Overview
A data structure diagram is a diagram type that is used to depict the structure of data elements in the data dictionary. The data structure diagram is a graphical alternative to the composition specifications within such data dictionary entries.
The data structure diagrams is a predecessor of the entity–relationship model (E–R model). In DSDs, attributes are specified inside the entity boxes rather than outside of them, while relationships are drawn as boxes composed of attributes which specify the constraints that bind entities together. DSDs differ from the E–R model in that the E–R model focuses on the relationships between different entities, whereas DSDs focus on the relationships of the elements within an entity.
There are several styles for representing data structure diagrams, with the notable difference in the manner of defining cardinality. The choices are between arrow heads, inverted arrow heads (crow's feet), or numerical representation of the cardinality.
Bachman diagram
A Bachman diagram is a certain type of data structure diagram, and is used to design the data with a network or relational "logical" model, separating the data model from the way the data is stored in the system. The model is named after database pioneer Charles Bachman, and mostly used in computer software design.
In a relational model, a relation is the cohesion of attributes that are fully and not of every key in that relation. The coupling between the relations is based on accordant attributes. For every relation, a rectangle has t |
https://en.wikipedia.org/wiki/Power%20Wheels | Power Wheels is a brand of battery-powered ride-on toy cars for kids ages one to seven years old. Power Wheels ride-ons are built with kid-sized, realistic features – in some cases, real working features like FM radios, opening/closing doors and hoods, and both forward and reverse motion.
History
The product itself was created by an Italian company, Peg Perego, which started up in 1949. Peg-Perego eventually began using gel cell batteries in their wheeled machines, and the product line was launched. The Power Wheels brand name dates back to 1984, when San Francisco-based toy company Kransco acquired Pines of America, makers of battery-powered vehicles for children. Two years later, Kransco renamed the line "Power Wheels". By 1990 sales of the battery-powered vehicles reached over 1,000,000 per year.
In 1994, the Power Wheels Line was bought by Mattel, who placed it under their Fisher-Price subsidiary. With the addition of new vehicle licenses the new Power Wheels lines did well.
In 1999, Fisher-Price announced the Harley-Davidson Motorcycle Ride-On – which contributed to a year of record sales for the entire product line.
Power Wheels vehicles
Power Wheels ride-on cars, trucks and motorcycles have been sold with more than 100 model names.
The latest line of Power Wheels features small scale versions of popular real world vehicles, including the Jeep Wrangler, Jeep Hurricane, Ford F-150, Ford Mustang, Kawasaki KFX quad, Harley-Davidson motorcycle, Cadillac Escalade EXT as well as Lightning McQueen from the Pixar’s film Cars, and a Thomas the Tank Engine with a circle of track.
Safety recalls
The first recall in 1991 involved the 18 Volt Porsche 911, in which the contacts in the foot pedal switch could weld together in use. If this were to happen, the motor would remain running and the vehicle would continue moving forward, unable to stop. A new accelerator pedal was fitted that eliminated the possibility of welded contacts.
In 1998, Fisher-Price undertook |
https://en.wikipedia.org/wiki/Pythagoras%20tree%20%28fractal%29 | The Pythagoras tree is a plane fractal constructed from squares. Invented by the Dutch mathematics teacher Albert E. Bosman in 1942, it is named after the ancient Greek mathematician Pythagoras because each triple of touching squares encloses a right triangle, in a configuration traditionally used to depict the Pythagorean theorem.
If the largest square has a size of L × L, the entire Pythagoras tree fits snugly inside a box of size 6L × 4L. The finer details of the tree resemble the Lévy C curve.
Construction
The construction of the Pythagoras tree begins with a square. Upon this square are constructed two squares, each scaled down by a linear factor of /2, such that the corners of the squares coincide pairwise. The same procedure is then applied recursively to the two smaller squares, ad infinitum. The illustration below shows the first few iterations in the construction process.
This is the simplest symmetric triangle. Alternatively, the sides of the triangle are recursively equal proportions, leading to the sides being proportional to the square root of the inverse golden ratio, and the areas of the squares being in golden ratio proportion.
Area
Iteration n in the construction adds 2n squares of area , for a total area of 1. Thus the area of the tree might seem to grow without bound in the limit as n → ∞. However, some of the squares overlap starting at the order 5 iteration, and the tree actually has a finite area because it fits inside a 6×4 box.
It can be shown easily that the area A of the Pythagoras tree must be in the range 5 < A < 18, which can be narrowed down further with extra effort. Little seems to be known about the actual value of A.
Varying the angle
An interesting set of variations can be constructed by maintaining an isosceles triangle but changing the base angle (90 degrees for the standard Pythagoras tree). In particular, when the base half-angle is set to (30°) = arcsin(0.5), it is easily seen that the size of the squares remains constan |
https://en.wikipedia.org/wiki/Serial%20presence%20detect | In computing, serial presence detect (SPD) is a standardized way to automatically access information about a memory module. Earlier 72-pin SIMMs included five pins that provided five bits of parallel presence detect (PPD) data, but the 168-pin DIMM standard changed to a serial presence detect to encode more information.
When an ordinary modern computer is turned on, it starts by doing a power-on self-test (POST). Since about the mid-1990s, this process includes automatically configuring the hardware currently present. SPD is a memory hardware feature that makes it possible for the computer to know what memory is present, and what memory timings to use to access the memory.
Some computers adapt to hardware changes completely automatically. In most cases, there is a special optional procedure for accessing BIOS parameters, to view and potentially make changes in settings. It may be possible to control how the computer uses the memory SPD data—to choose settings, selectively modify memory timings, or possibly to completely override the SPD data (see overclocking).
Stored information
For a memory module to support SPD, the JEDEC standards require that certain parameters be in the lower 128 bytes of an EEPROM located on the memory module. These bytes contain timing parameters, manufacturer, serial number and other useful information about the module. Devices utilizing the memory automatically determine key parameters of the module by reading this information. For example, the SPD data on an SDRAM module might provide information about the CAS latency so the system can set this correctly without user intervention.
The SPD EEPROM firmware is accessed using SMBus, a variant of the I²C protocol. This reduces the number of communication pins on the module to just two: a clock signal and a data signal. The EEPROM shares ground pins with the RAM, has its own power pin, and has three additional pins (SA0–2) to identify the slot, which are used to assign the EEPROM |
https://en.wikipedia.org/wiki/Strapwork | In the history of art and design, strapwork is the use of stylised representations in ornament of ribbon-like forms. These may loosely imitate leather straps, parchment or metal cut into elaborate shapes, with piercings, and often interwoven in a geometric pattern. In early examples there may or may not be three-dimensionality, either actual in curling relief ends of the elements, or just represented in two dimensions. As the style continued, these curling elements became more prominent, often turning into scrollwork, where the ends curl into spirals or scrolls. By the Baroque scrollwork was a common element in ornament, often partly submerged by other rich ornament.
European strapwork is a frequent background and framework for grotesque ornament – arabesque or candelabra figures filled with fantastical creatures, garlands and other elements – which were a frequent decorative motif in 16th-century Northern Mannerism, and revived in the 19th century and which may appear on walls – painted, in frescos, carved in wood, or moulded in plaster or stucco – or in graphic work. The Europeanized arabesque patterns called moresque are also very often combined with strapwork, especially in tooled and gilded bookbindings.
Scrollwork is a variant that tended to replace strapwork almost completely by the Baroque. It is less geometric and more organic, more three dimensional, and with emphasis on the curling ends of the "straps". The Italian artists at the Palace of Fontainebleau had already moved onto this by the 1530s, but in provincial work in northern Europe flat strapwork panels continued for another century or more.
Where there is no suggestion of three dimensions – curling ends and the like – the decoration may also be called bandwork or "interlaced bands", the more technically correct term. Peter Fuhring derives this style from Islamic ornament.
Italy
Strapwork designs, influenced by Islamic ornament, are found on tooled book-covers in Italy and Spain by the mid |
https://en.wikipedia.org/wiki/Joconde | Joconde is the central database created in 1975 and now available online, maintained by the French Ministry of Culture, for objects in the collections of the main French public and private museums listed as Musées de France, according to article L. 441-1 of the Code du patrimoine amounting to more than 1,200 institutions.
"La Joconde" is the French name of the Mona Lisa, which like about half of the collections of the Louvre, is included in the database, as one of 295 items by, after, or connected with Leonardo da Vinci; of these, only 42 works are by Leonardo da Vinci, including 6 paintings. By November 2012, Joconde contained over 475,000 object online and over 290,000 with images, from 366 collections in France, including 209,350 drawings, 63,547 paintings, 34,561 prints, 34,102 sculptures or 16,631 costumes and their accessories and is still expanding. By June 2022 it counted 636,405 objects.
The database is not only dedicated to the information of the public but as well to the needs of the administrators and curators of the museums, thanks to the online presentation of professional tools to facilitate notably the museums collections cataloguing and state inventory (récolement). This explains the great precision of the listings. Since the museums participate on a voluntary basis to the regular enrichment of the database, some can present a large part of their collection, while others appear only because of the mere permanent deposits made by the first ones.
Live on the French Minitel system from 1992, the database went online in 1995. Originally just for objects from the fine arts and decorative arts, in 2004 Joconde was united with what had been separate databases for objects from archeology and ethnology. It comes under the "Direction des Musées de France" (DMF) section of the Ministry.
A small number of the best known objects have a prose commentary. Not all images are in colour, especially for the archaeological collections. When an object created a |
https://en.wikipedia.org/wiki/Game%20physics | Computer animation physics or game physics are laws of physics as they are defined within a simulation or video game, and the programming logic used to implement these laws. Game physics vary greatly in their degree of similarity to real-world physics. Sometimes, the physics of a game may be designed to mimic the physics of the real world as accurately as is feasible, in order to appear realistic to the player or observer. In other cases, games may intentionally deviate from actual physics for gameplay purposes. Common examples in platform games include the ability to start moving horizontally or change direction in mid-air and the double jump ability found in some games. Setting the values of physical parameters, such as the amount of gravity present, is also a part of defining the game physics of a particular game.
There are several elements that form components of simulation physics including the physics engine, program code that is used to simulate Newtonian physics within the environment, and collision detection, used to solve the problem of determining when any two or more physical objects in the environment cross each other's path.
Physics simulations
There are two central types of physics simulations: rigid body and soft-body simulators. In a rigid body simulation objects are grouped into categories based on how they should interact and are less performance intensive. Soft-body physics involves simulating individual sections of each object such that it behaves in a more realistic way.
Particle systems
A common aspect of computer games that model some type of conflict is the explosion. Early computer games used the simple expedient of repeating the same explosion in each circumstance. However, in the real world an explosion can vary depending on the terrain, altitude of the explosion, and the type of solid bodies being impacted. Depending on the processing power available, the effects of the explosion can be modeled as the split and shattered comp |
https://en.wikipedia.org/wiki/Dikaryon | The dikaryon is a nuclear feature that is unique to certain fungi. (The green alga Derbesia had been long considered an exception, until the heterokaryotic hypothesis was challenged by later studies.) Compatible cell-types can fuse cytoplasms (plasmogamy). When this occurs, the two nuclei of two cells pair off and cohabit without fusing (karyogamy). This can be maintained for all the cells of the hyphae by synchronously dividing so that pairs are passed to newer cells. In the Ascomycota this attribute is most often found in the ascogenous hyphae and ascocarp while the bulk of the mycelium remains monokaryotic. In the Basidiomycota this is the dominant phase, with most Basidiomycota monokaryons weakly growing and short-lived.
The formation of a dikaryon is a plesiomorphic character for the subkingdom Dikarya, which consists of the Basidiomycota and the Ascomycota. The formation of croziers in the Ascomycota and of clamp connections in the Basidiomycota facilitates maintenance of the dikaryons. However, some fungi in each of these phyla have evolved other methods for maintaining the dikaryons, and therefore neither croziers nor clamp connections are ubiquitous in either phylum.
Etymology
The name dikaryon comes from the Greek δι- (di-) meaning "two" and κάρυον (karyon) meaning "nut", referring to the cell nucleus.
See also
Binucleated cells (as a pathological state)
Heterokaryon
Multinucleated cells
Syncytium |
https://en.wikipedia.org/wiki/Trimyristin | Trimyristin is a saturated fat and the triglyceride of myristic acid with the chemical formula C45H86O6. Trimyristin is a white to yellowish-gray solid that is insoluble in water, but soluble in ethanol, acetone, benzene, chloroform, dichloromethane, ether, and TBME.
Occurrence
Trimyristin is found naturally in many vegetable fats and oils.
Isolation from nutmeg
The isolation of trimyristin from powdered nutmeg is a common introductory-level college organic chemistry experiment. It is an uncommonly simple natural product extraction because nutmeg oil generally consists of over eighty percent trimyristin. Trimyristin makes up between 20-25% of the overall mass of dried, ground nutmeg. Separation is generally carried out by steam distillation and purification uses extraction from ether followed by distillation or rotary evaporation to remove the volatile solvent. The extraction of trimyristin can also be done with diethyl ether at room temperature, due to its high solubility in the ether. The experiment is frequently included in curricula, both for its relative ease and to provide instruction in these techniques. Trimyristin can then be used to prepare myristic acid or one of its salts as an example of saponification.
See also
Linolein |
https://en.wikipedia.org/wiki/Hal%20Varian | Hal Ronald Varian (born March 18, 1947, in Wooster, Ohio) is Chief Economist at Google and holds the title of emeritus professor at the University of California, Berkeley where he was founding dean of the School of Information. Varian is an economist specializing in microeconomics and information economics.
Early life
Hal Varian was born on March 18, 1947, in Wooster, Ohio. He received his B.S. from MIT in economics in 1969 and both his M.A. in mathematics and Ph.D. in economics from the University of California, Berkeley in 1973.
Career
Varian taught at MIT, Stanford University, the University of Oxford, the University of Michigan, the University of Siena and other universities around the world. He has two honorary doctorates, from the University of Oulu, Finland in 2002, and a Dr. h. c. from the Karlsruhe Institute of Technology (KIT), Germany, awarded in 2006. He is emeritus professor at the University of California, Berkeley, where he was founding dean of the School of Information.
Varian joined Google in 2002 as chief economist, and has worked on the design of advertising auctions, econometrics, finance, corporate strategy, and public policy.
Varian is the author of two bestselling textbooks: Intermediate Microeconomics, an undergraduate microeconomics text, and Microeconomic Analysis, an advanced text aimed primarily at first-year graduate students in economics. Together with Carl Shapiro, he co-authored Information Rules: A Strategic Guide to the Network Economy and The Economics of Information Technology: An Introduction. According to the Open Syllabus Project, Varian is the fourth most frequently cited author on college syllabi for economics courses.
In September 2023, Varian was called to testify by the DOJ in the U.S. et al. v. Google lawsuit on a memo he wrote in 2003: "Thoughts on Google v Microsoft." with the subject "We should be careful about what we say in both public and private". The DOJ also brought up memos where Varian instructed Google e |
https://en.wikipedia.org/wiki/Sealed%20server | A sealed server is a type of server which is designed to run without users logging in. This setup has several potential benefits over a traditional server:
Stronger security. Since users do not log in, it is possible for a sealed server to use stronger authentication than a password mechanism.
Transparency. Since files are not accessed directly, a sealed server can store its payload in any format, without the clients needing any information about this.
Less opportunity for user error. Since a user does not have full control over the files on the server, there is less opportunity for them to, for example, change the mode of a private file to be world-readable.
A sealed server is primarily useful for data-centric mechanisms such as email, and is unsuited to file-centric protocols such as FTP.
Servers (computing) |
https://en.wikipedia.org/wiki/Complex%20wavelet%20transform | The complex wavelet transform (CWT) is a complex-valued extension to the standard discrete wavelet transform (DWT). It is a two-dimensional wavelet transform which provides multiresolution, sparse representation, and useful characterization of the structure of an image. Further, it purveys a high degree of shift-invariance in its magnitude, which was investigated in. However, a drawback to this transform is that it exhibits (where is the dimension of the signal being transformed) redundancy compared to a separable (DWT).
The use of complex wavelets in image processing was originally set up in 1995 by J.M. Lina and L. Gagnon in the framework of the Daubechies orthogonal filters banks . It was then generalized in 1997 by Prof. Nick Kingsbury
of Cambridge University.
In the area of computer vision, by exploiting the concept of visual contexts, one can quickly focus on candidate regions, where objects of interest may be found, and then compute additional features through the CWT for those regions only. These additional features, while not necessary for global regions, are useful in accurate detection and recognition of smaller objects. Similarly, the CWT may be applied to detect the activated voxels of cortex and additionally the temporal independent component analysis (tICA) may be utilized to extract the underlying independent sources whose number is determined by Bayesian information criterion .
Dual-tree complex wavelet transform
The Dual-tree complex wavelet transform (DTCWT) calculates the complex transform of a signal using two separate DWT decompositions (tree a and tree b). If the filters used in one are specifically designed different from those in the other it is possible for one DWT to produce the real coefficients and the other the imaginary.
This redundancy of two provides extra information for analysis but at the expense of extra computational power. It also provides approximate shift-invariance (unlike the DWT) yet still allows perfect reconst |
https://en.wikipedia.org/wiki/Retarded%20time | In electromagnetism, electromagnetic waves in vacuum travel at the speed of light c, according to Maxwell's Equations. The retarded time is the time when the field began to propagate from the point where it was emitted to an observer. The term "retarded" is used in this context (and the literature) in the sense of propagation delays.
Retarded and advanced times
The calculation of the retarded time tr or t′ is nothing more than a simple "speed-distance-time" calculation for EM fields.
If the EM field is radiated at position vector r′ (within the source charge distribution), and an observer at position r measures the EM field at time t, the time delay for the field to travel from the charge distribution to the observer is |r − r′|/c, so subtracting this delay from the observer's time t gives the time when the field actually began to propagate - the retarded time, t′.
The retarded time is:
which can be rearranged to
showing how the positions and times correspond to source and observer.
Another related concept is the advanced time ta, which takes the same mathematical form as above, but with a “+” instead of a “−”:
and is so-called since this is the time the field will advance from the present time t. Corresponding to retarded and advanced times are retarded and advanced potentials.
Retarded position
The retarded position can be obtained from the current position of a particle by subtracting the distance it has travelled in the lapse from the retarded time to the current time.
For an inertial particle, this position can be obtained by solving this equation:
,
where rc is the current position of the source charge distribution and v its velocity.
Application
Perhaps surprisingly - electromagnetic fields and forces acting on charges depend on their history, not their mutual separation. The calculation of the electromagnetic fields at a present time includes integrals of charge density ρ(r', tr) and current density J(r', tr'') using the retarded times and sou |
https://en.wikipedia.org/wiki/Subculture%20%28biology%29 | In biology, a subculture is either a new cell culture or a microbiological culture made by transferring some or all cells from a previous culture to fresh growth medium. This action is called subculturing or passaging the cells. Subculturing is used to prolong the lifespan and/or increase the number of cells or microorganisms in the culture.
Role
Cell lines and microorganisms cannot be held in culture indefinitely due to the gradual rise in metabolites which may be toxic, the depletion of nutrients present in the culture medium, and an increase in cell count or population size due to growth. Once nutrients are depleted and levels of toxic byproducts increase, microorganisms in culture will enter the stationary phase, where proliferation is greatly reduced or ceased (the cell density value plateaus). When microorganisms from this culture are transferred into fresh media, nutrients trigger the growth of the microorganisms which will go through lag phase, a period of slow growth and adaptation to the new environment, followed by log phase, a period where the cells grow exponentially.
Subculture is therefore used to produce a new culture with a lower density of cells than the originating culture, fresh nutrients and no toxic metabolites allowing continued growth of the cells without risk of cell death. Subculture is important for both proliferating (e.g. a microorganism like E. coli) and non-proliferating (e.g. terminally differentiated white blood cells) cells. Subculturing can also be used for growth curve calculations (ex. generation time) and obtaining log-phase microorganisms for experiments (ex. Bacterial transformation).
Typically, subculture is from a culture of a certain volume into fresh growth medium of equal volume, this allows long-term maintenance of the cell line. Subculture into a larger volume of growth medium is used when wanting to increase the number of cells for, for example, use in an industrial process or scientific experiment.
Passage number |
https://en.wikipedia.org/wiki/Kell%20factor | The Kell factor, named after RCA engineer Raymond D. Kell, is a parameter used to limit the bandwidth of a sampled image signal to avoid the appearance of beat frequency patterns when displaying the image in a discrete display device, usually taken to be 0.7. The number was first measured in 1934 by Raymond D. Kell and his associates as 0.64 but has suffered several revisions given that it is based on image perception, hence subjective, and is not independent of the type of display. It was later revised to 0.85 but can go higher than 0.9, when fixed pixel scanning (e.g., CCD or CMOS) and fixed pixel displays (e.g., LCD or plasma) are used, or as low as 0.7 for electron gun scanning.
From a different perspective, the Kell factor defines the effective resolution of a discrete display device since the full resolution cannot be used without viewing experience degradation. The actual sampled resolution will depend on the spot size and intensity distribution. For electron gun scanning systems, the spot usually has a Gaussian intensity distribution. For CCDs, the distribution is somewhat rectangular, and is also affected by the sampling grid and inter-pixel spacing.
Kell factor is sometimes incorrectly stated to exist to account for the effects of interlacing. Interlacing itself does not affect Kell factor, but because interlaced video must be low-pass filtered (i.e., blurred) in the vertical dimension to avoid spatio-temporal aliasing (i.e., flickering effects), the Kell factor of interlaced video is said to be about 70% that of progressive video with the same scan line resolution.
The beat frequency problem
To understand how the distortion comes about, consider an ideal linear process from sampling to display. When a signal is sampled at a frequency that is at least double the Nyquist frequency, it can be fully reconstructed by low-pass filtering since the first repeat spectra does not overlap the original baseband spectra. In discrete displays the image signal is n |
https://en.wikipedia.org/wiki/Omo%20remains | The Omo remains are a collection of hominin bones discovered between 1967 and 1974 at the Omo Kibish sites near the Omo River, in Omo National Park in south-western Ethiopia. The bones were recovered by a scientific team from the Kenya National Museums directed by Richard Leakey and others. The remains from Kamoya's Hominid Site (KHS) were called Omo I and those from Paul I. Abell's Hominid Site (PHS) were called Omo II.
Fossils
The bones found include two partial skulls, four jaws, a legbone, approximately two hundred teeth, and several other fossilized parts. Both of the specimens, Omo I and Omo II, are classified as anatomically modern humans (Homo sapiens), but they differ from each other in morphological traits. The Omo I fossils indicate more modern traits, while studies of the postcranial remains of Omo II indicate an overall modern human morphology with some primitive features. The fossils were found in a layer of tuff, between a lower, older geologic layer named Member I and a higher, newer layer dubbed Member III. The Omo I and Omo II hominin fossils were taken from similar stratigraphic levels above Member I.
Because of the very limited fauna and the few stone artifacts that were found at the sites when the original Omo remains were discovered, the provenance and estimated age of the Kibish hominids are uncertain. In 2008, new bone remains were discovered from Awoke's Hominid Site (AHS). The AHS fossil's tibia and fibula were unearthed from Member I, the same layer from which the other Omo remains derive.
Dating and implications
About 30 years after the original finds, a detailed stratigraphic analysis of the area surrounding the fossils was conducted. The Member I layer was argon-dated to 195,000 years ago, and the (higher layer) Member III was dated to 105,000 years ago. Numerous recent lithic records verify the tool technology from Members I and III to the Middle Stone Age.
The lower layer, Member I, (below the fossils) is considerably older than t |
https://en.wikipedia.org/wiki/List%20of%20storage%20area%20network%20management%20systems | This is a list of Storage area network (SAN) management systems. A storage area network is a dedicated network that provides access to consolidated, block level data storage.
Systems
Brocade Network Advisor
Cisco Fabric Manager
Enterprise Fabric Connectivity (EFC) Manager
EMC ControlCenter
EMC VisualSRM
EMC Invista
Hitachi Data Systems HiCommand
HP OpenView Storage Area Manager
IBM SAN Volume Controller
Symantec Veritas Command Central Storage
KernSafe Cross-Platform iSCSI SAN |
https://en.wikipedia.org/wiki/Message%20in%20a%20bottle | A message in a bottle (abbrev. MIB) is a form of communication in which a message is sealed in a container (typically a bottle) and released into a conveyance medium (typically a body of water).
Messages in bottles have been used to send distress messages, in crowdsourced scientific studies of ocean currents, as memorial tributes, to send deceased loved ones' ashes on a final journey, to convey expedition reports, and to carry letters or reports from those believing themselves to be doomed. Invitations to prospective pen pals and letters to actual or imagined love interests have also been sent as messages in bottles.
The lore surrounding messages in bottles has often been of a romantic or poetic nature.
Use of the term "message in a bottle" has expanded to include metaphorical uses or uses beyond its traditional meaning as bottled messages released into oceans. The term has been applied to plaques on craft launched into outer space, interstellar radio messages, stationary time capsules, balloon mail, and containers storing medical information for use by emergency medical personnel.
With a growing awareness that bottles constitute waste that can harm the environment and marine life, environmentalists tend to favor biodegradable drift cards and wooden blocks.
History and uses
Bottled messages may date to about 310 B.C., in water current studies reputed to have been carried out by Greek philosopher Theophrastus. The Japanese medieval epic The Tale of the Heike records the story of an exiled poet who, in about 1177 A.D., launched wooden planks on which he had inscribed poems describing his plight. In the sixteenth century, Queen Elizabeth I reputedly created an official position of "Uncorker of Ocean Bottles", and—thinking some bottles might contain secrets from British spies or fleets—decreed that anyone else opening the bottles could face the death penalty. (However, it has been argued that this is a myth.) In the nineteenth century, literary works such as Edgar |
https://en.wikipedia.org/wiki/Interruptible%20operating%20system | An interruptible operating system is an operating system with ability to handle multiple interrupts concurrently, or in other words, which allow interrupts to be interrupted.
Concurrent interrupt handling essentially mean concurrent execution of kernel code and hence induces the additional complexity of concurrency control in accessing kernel datastructures.
It also means that the system can stop any program that is already running, which is a feature on nearly all modern operating systems.
See also
Operating system
Operating System Projects
Interrupts |
https://en.wikipedia.org/wiki/Coherence%20%28statistics%29 | In probability theory and statistics, coherence can have several different meanings. Coherence in statistics is an indication of the quality of the information, either within a single data set, or between similar but not identical data sets. Fully coherent data are logically consistent and can be reliably combined for analysis.
In probability
When dealing with personal probability assessments, or supposed probabilities derived in nonstandard ways, it is a property of self-consistency across a whole set of such assessments.
In gambling strategy
One way of expressing such self-consistency is in terms of responses to various betting propositions, as described in relation to coherence (philosophical gambling strategy).
In Bayesian decision theory
The coherency principle in Bayesian decision theory is the assumption that subjective probabilities follow the ordinary rules/axioms of probability calculations (where the validity of these rules corresponds to the self-consistency just referred to) and thus that consistent decisions can be obtained from these probabilities.
In time series analysis
In time series analysis, and particularly in spectral analysis, it is used to describe the strength of association between two series where the possible dependence between the two series is not limited to simultaneous values but may include leading, lagged and smoothed relationships.
The concepts here are sometimes known as coherency and are essentially those set out for coherence as for signal processing. However, note that the quantity coefficient of coherence may sometimes be called the squared coherence. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.