title
stringlengths 1
149
⌀ | section
stringlengths 1
1.9k
⌀ | text
stringlengths 13
73.5k
|
|---|---|---|
Maximum satisfiability problem
|
Hardness
|
The MAX-SAT problem is OptP-complete, and thus NP-hard, since its solution easily leads to the solution of the boolean satisfiability problem, which is NP-complete.
It is also difficult to find an approximate solution of the problem, that satisfies a number of clauses within a guaranteed approximation ratio of the optimal solution. More precisely, the problem is APX-complete, and thus does not admit a polynomial-time approximation scheme unless P = NP.
|
Maximum satisfiability problem
|
Weighted MAX-SAT
|
More generally, one can define a weighted version of MAX-SAT as follows: given a conjunctive normal form formula with non-negative weights assigned to each clause, find truth values for its variables that maximize the combined weight of the satisfied clauses. The MAX-SAT problem is an instance of weighted MAX-SAT where all weights are 1.
Approximation algorithms 1/2-approximation Randomly assigning each variable to be true with probability 1/2 gives an expected 2-approximation. More precisely, if each clause has at least k variables, then this yields a (1 − 2−k)-approximation. This algorithm can be derandomized using the method of conditional probabilities.
|
Maximum satisfiability problem
|
Weighted MAX-SAT
|
(1-1/e)-approximation MAX-SAT can also be expressed using an integer linear program (ILP). Fix a conjunctive normal form formula F with variables x1, x2, ..., xn, and let C denote the clauses of F. For each clause c in C, let S+c and S−c denote the sets of variables which are not negated in c, and those that are negated in c, respectively. The variables yx of the ILP will correspond to the variables of the formula F, whereas the variables zc will correspond to the clauses. The ILP is as follows: The above program can be relaxed to the following linear program L: The following algorithm using that relaxation is an expected (1-1/e)-approximation: Solve the linear program L and obtain a solution O Set variable x to be true with probability yx where yx is the value given in O.This algorithm can also be derandomized using the method of conditional probabilities.
|
Maximum satisfiability problem
|
Weighted MAX-SAT
|
3/4-approximation The 1/2-approximation algorithm does better when clauses are large whereas the (1-1/e)-approximation does better when clauses are small. They can be combined as follows: Run the (derandomized) 1/2-approximation algorithm to get a truth assignment X.
Run the (derandomized) (1-1/e)-approximation to get a truth assignment Y.
Output whichever of X or Y maximizes the weight of the satisfied clauses.This is a deterministic factor (3/4)-approximation.
Example On the formula where ϵ>0 , the (1-1/e)-approximation will set each variable to True with probability 1/2, and so will behave identically to the 1/2-approximation. Assuming that the assignment of x is chosen first during derandomization, the derandomized algorithms will pick a solution with total weight 3+ϵ , whereas the optimal solution has weight 4+ϵ
|
Maximum satisfiability problem
|
Solvers
|
Many exact solvers for MAX-SAT have been developed during recent years, and many of them were presented in the well-known conference on the boolean satisfiability problem and related problems, the SAT Conference. In 2006 the SAT Conference hosted the first MAX-SAT evaluation comparing performance of practical solvers for MAX-SAT, as it has done in the past for the pseudo-boolean satisfiability problem and the quantified boolean formula problem.
|
Maximum satisfiability problem
|
Solvers
|
Because of its NP-hardness, large-size MAX-SAT instances cannot in general be solved exactly, and one must often resort to approximation algorithms and heuristicsThere are several solvers submitted to the last Max-SAT Evaluations: Branch and Bound based: Clone, MaxSatz (based on Satz), IncMaxSatz, IUT_MaxSatz, WBO, GIDSHSat.
Satisfiability based: SAT4J, QMaxSat.
Unsatisfiability based: msuncore, WPM1, PM2.
|
Maximum satisfiability problem
|
Special cases
|
MAX-SAT is one of the optimization extensions of the boolean satisfiability problem, which is the problem of determining whether the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE. If the clauses are restricted to have at most 2 literals, as in 2-satisfiability, we get the MAX-2SAT problem. If they are restricted to at most 3 literals per clause, as in 3-satisfiability, we get the MAX-3SAT problem.
|
Maximum satisfiability problem
|
Related problems
|
There are many problems related to the satisfiability of conjunctive normal form Boolean formulas.
|
Maximum satisfiability problem
|
Related problems
|
Decision problems: 2SAT 3SAT Optimization problems, where the goal is to maximize the number of clauses satisfied: MAX-SAT, and the corresponded weighted version Weighted MAX-SAT MAX-kSAT, where each clause has exactly k variables: MAX-2SAT MAX-3SAT MAXEkSAT The partial maximum satisfiability problem (PMAX-SAT) asks for the maximum number of clauses which can be satisfied by any assignment of a given subset of clauses. The rest of the clauses must be satisfied.
|
Maximum satisfiability problem
|
Related problems
|
The soft satisfiability problem (soft-SAT), given a set of SAT problems, asks for the maximum number of those problems which can be satisfied by any assignment.
The minimum satisfiability problem.
The MAX-SAT problem can be extended to the case where the variables of the constraint satisfaction problem belong to the set of reals. The problem amounts to finding the smallest q such that the q-relaxed intersection of the constraints is not empty.
|
Amplification factor
|
Amplification factor
|
In general an amplification factor is the numerical multiplicative factor by which some quantity is increased.
In structural engineering the amplification factor is the ratio of second order to first order deflections.
In electronics the amplification factor, or gain, is the ratio of the output to the input of an amplifier, sometimes represented by the symbol AF.
In numerical analysis the amplification factor is a number derived using Von Neumann stability analysis to determine stability of a numerical scheme for a partial differential equation.
|
Non-photo blue
|
Non-photo blue
|
Non-photo blue (or non-repro blue) is a common tool in the graphic design and print industry, being a particular shade of blue that cannot be detected by graphic arts camera film. This allows layout editors to write notes to the printer on the print flat (the image that is to be photographed and sent to print) which will not show in the final form. It also allows artists to lay down sketch lines without the need to erase after inking.
|
Non-photo blue
|
Change in function
|
More recently, with digital scanning and image manipulation, non-photo blue fulfills its function in a different way. The artist can do their sketch and inking in the traditional manner and scan the page. Most scanners will detect the light blue lines. However, shifting to greyscale and increasing the contrast and brightness of the scanned image causes the blue to disappear. Another common approach involves replacing the blue channel with another channel – typically the red channel. The exact processes may differ depending on the scanner, settings and image-editing software, but the concept remains the same.
|
Non-photo blue
|
Black ink
|
The difference between the non-photo blue and black ink is great enough that digital image manipulation can separate the two easily. If a black-and-white bitmap setting is scanned in, the exposure or threshold number can be set high enough to detect the black ink or dark images being scanned, but low enough to leave out the non-photo blue. On a threshold scale of 0–255, this number would be approximately 140. Only with a considerably low threshold setting will the blue be detected; this however may greatly distort black lines and add a lot of noise and black speckles, making the image potentially almost unrecognizable. Scanning in black-and-white makes it possible for the non-photo blue still to serve its original purpose, as notes and rough sketching lines can be placed throughout the image being scanned and remain undetected by the scan head.
|
Higher-order function
|
Higher-order function
|
In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following: takes one or more functions as arguments (i.e. a procedural parameter, which is a parameter of a procedure that is itself a procedure), returns a function as its result.All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see Functor (disambiguation).
|
Higher-order function
|
Higher-order function
|
In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form (τ1→τ2)→τ3
|
Higher-order function
|
General examples
|
map function, found in many functional programming languages, is one example of a higher-order function. It takes as arguments a function f and a collection of elements, and as the result, returns a new collection with f applied to each element from the collection.
Sorting functions, which take a comparison function as a parameter, allowing the programmer to separate the sorting algorithm from the comparisons of the items being sorted. The C standard function qsort is an example of this.
filter fold apply Function composition Integration Callback Tree traversal Montague grammar, a semantic theory of natural language, uses higher-order functions
|
Higher-order function
|
Support in programming languages
|
Direct support The examples are not intended to compare and contrast programming languages, but to serve as examples of higher-order function syntax In the following examples, the higher-order function twice takes a function, and applies the function to some value twice. If twice has to be applied several times for the same f it preferably should return a function rather than a value. This is in line with the "don't repeat yourself" principle.
|
Higher-order function
|
Support in programming languages
|
APL Or in a tacit manner: C++ Using std::function in C++11: Or, with generic lambdas provided by C++14: C# Using just delegates: Or equivalently, with static methods: Clojure ColdFusion Markup Language (CFML) Common Lisp D Dart Elixir In Elixir, you can mix module definitions and anonymous functions Alternatively, we can also compose using pure anonymous functions.
|
Higher-order function
|
Support in programming languages
|
Erlang In this Erlang example, the higher-order function or_else/2 takes a list of functions (Fs) and argument (X). It evaluates the function F with the argument X as argument. If the function F returns false then the next function in Fs will be evaluated. If the function F returns {false, Y} then the next function in Fs with argument Y will be evaluated. If the function F returns R the higher-order function or_else/2 will return R. Note that X, Y, and R can be functions. The example returns false.
|
Higher-order function
|
Support in programming languages
|
F# Go Notice a function literal can be defined either with an identifier (twice) or anonymously (assigned to variable plusThree).
|
Higher-order function
|
Support in programming languages
|
Haskell J Explicitly, or tacitly, Java (1.8+) Using just functional interfaces: Or equivalently, with static methods: JavaScript With arrow functions: Or with classical syntax: Julia Kotlin Lua MATLAB OCaml PHP or with all functions in variables: Note that arrow functions implicitly capture any variables that come from the parent scope, whereas anonymous functions require the use keyword to do the same.
|
Higher-order function
|
Support in programming languages
|
Perl or with all functions in variables: Python Python decorator syntax is often used to replace a function with the result of passing that function through a higher-order function. E.g., the function g could be implemented equivalently: R Raku In Raku, all code objects are closures and therefore can reference inner "lexical" variables from an outer scope because the lexical variable is "closed" inside of the function. Raku also supports "pointy block" syntax for lambda expressions which can be assigned to a variable or invoked anonymously.
|
Higher-order function
|
Support in programming languages
|
Ruby Rust Scala Scheme Swift Tcl Tcl uses apply command to apply an anonymous function (since 8.6).
XACML The XACML standard defines higher-order functions in the standard to apply a function to multiple values of attribute bags.
The list of higher-order functions in XACML can be found here.
XQuery Alternatives Function pointers Function pointers in languages such as C, C++, and Pascal allow programmers to pass around references to functions. The following C code computes an approximation of the integral of an arbitrary function: The qsort function from the C standard library uses a function pointer to emulate the behavior of a higher-order function.
Macros Macros can also be used to achieve some of the effects of higher-order functions. However, macros cannot easily avoid the problem of variable capture; they may also result in large amounts of duplicated code, which can be more difficult for a compiler to optimize. Macros are generally not strongly typed, although they may produce strongly typed code.
|
Higher-order function
|
Support in programming languages
|
Dynamic code evaluation In other imperative programming languages, it is possible to achieve some of the same algorithmic results as are obtained via higher-order functions by dynamically executing code (sometimes called Eval or Execute operations) in the scope of evaluation. There can be significant drawbacks to this approach: The argument code to be executed is usually not statically typed; these languages generally rely on dynamic typing to determine the well-formedness and safety of the code to be executed.
|
Higher-order function
|
Support in programming languages
|
The argument is usually provided as a string, the value of which may not be known until run-time. This string must either be compiled during program execution (using just-in-time compilation) or evaluated by interpretation, causing some added overhead at run-time, and usually generating less efficient code.
|
Higher-order function
|
Support in programming languages
|
Objects In object-oriented programming languages that do not support higher-order functions, objects can be an effective substitute. An object's methods act in essence like functions, and a method may accept objects as parameters and produce objects as return values. Objects often carry added run-time overhead compared to pure functions, however, and added boilerplate code for defining and instantiating an object and its method(s). Languages that permit stack-based (versus heap-based) objects or structs can provide more flexibility with this method.
|
Higher-order function
|
Support in programming languages
|
An example of using a simple stack based record in Free Pascal with a function that returns a function: The function a() takes a Txy record as input and returns the integer value of the sum of the record's x and y fields (3 + 7).
Defunctionalization Defunctionalization can be used to implement higher-order functions in languages that lack first-class functions: In this case, different types are used to trigger different functions via function overloading. The overloaded function in this example has the signature auto apply.
|
Drawing room play
|
Drawing room play
|
A drawing room play is a type of play, developed during the Victorian period in the United Kingdom, in which the actions take place in a drawing room or which is designed to be reenacted in the drawing room of a home. The common practice of entertaining a guest in the home led to the creation of this category of plays and while the drawing room itself has fallen out of favour, the play format has continued to provide a source of entertainment. While there is no date or authority directly ascribed to the term drawing room play, there is evidence that the term was derived from the English habit of putting on these short works for guests while entertaining in the drawing room of the home. In French usage the room and the social gathering it contained are equally the salon.
|
Drawing room play
|
Types
|
Beginning with the early forms of drama, the drawing room play has evolved to encompass comedy as well as to include the forms of the dramatic monologue. The play format itself has also grown out of the traditional drawing room performance and back into main street theatre and film. Drawing room comedy is also sometimes called the "comedy of manners." Many of the drawing room plays adapted some form of social criticism in the transition from the Victorian period into the Modern era.The genre is comedy
|
Drawing room play
|
Examples
|
The Elder Statesman (1959) was the last of T. S. Eliot's drawing room works.
Oscar Wilde's The Importance of Being Earnest is one of the most widely known examples of the drawing room play.
Several of the collected works of Noël Coward are also considered typical of the form.
Paul Rudnick's Regrets Only is a contemporary drawing room comedy released in 2006.
Additional authors include Clement Scott, Walter Besant, Grace Luce Irwin and Arnold Bennett.
|
Drawing room play
|
Sources
|
Nicholas Cooper, Houses of the Gentry 1480-1680 (English Heritage) 1999: "Parlours and withdrawing rooms 289-93.
|
Lamination (geology)
|
Lamination (geology)
|
In geology, lamination (from Latin lāmina 'thin layer') is a small-scale sequence of fine layers (PL: laminae; SG: lamina) that occurs in sedimentary rocks. Laminae are normally smaller and less pronounced than bedding. Lamination is often regarded as planar structures one centimetre or less in thickness, whereas bedding layers are greater than one centimetre. However, structures from several millimetres to many centimetres have been described as laminae. A single sedimentary rock can have both laminae and beds.
|
Lamination (geology)
|
Description
|
Lamination consists of small differences in the type of sediment that occur throughout the rock. They are caused by cyclic changes in the supply of sediment. These changes can occur in grain size, clay percentage, microfossil content, organic material content or mineral content and often result in pronounced differences in colour between the laminae. Weathering can make the differences even more clear.
|
Lamination (geology)
|
Description
|
Lamination can occur as parallel structures (parallel lamination) or in different sets that make an angle with each other (cross-lamination). It can occur in many different types of sedimentary rock, from coarse sandstone to fine shales, mudstones or in evaporites.
Because lamination is a small structure, it is easily destroyed by bioturbation (the activity of burrowing organisms) shortly after deposition. Lamination therefore survives better under anoxic circumstances, or when the sedimentation rate was high and the sediment was buried before bioturbation could occur.
|
Lamination (geology)
|
Origin
|
Lamination develops in fine grained sediment when fine grained particles settle, which can only happen in quiet water. Examples of sedimentary environments are deep marine (at the seafloor) or lacustrine (at the bottom of a lake), or mudflats, where the tide creates cyclic differences in sediment supply.Laminae formed in glaciolacustrine environments (in glacier lakes) are a special case. They are called varves. Quaternary varves are used in stratigraphy and palaeoclimatology to reconstruct climate changes during the last few hundred thousand years.
|
Lamination (geology)
|
Origin
|
Lamination in sandstone is often formed in a coastal environment, where wave energy causes a separation between grains of different sizes.
|
European College of Veterinary Anaesthesia and Analgesia
|
European College of Veterinary Anaesthesia and Analgesia
|
The European College of Veterinary Anesthesia and Analgesia (ECVAA) is one of 25 veterinary specialist colleges recognized by the European Board of Veterinary Specialization, comprising more than 35 distinct specialties.
|
European College of Veterinary Anaesthesia and Analgesia
|
History
|
ECVA was inaugurated on 1 January 1995 and was formally registered in the Netherlands on May 22, 1997 as a non-profit organization. Application for de facto recognition was possible until 31 December 1997. During this period 44 de facto specialists were appointed. The first exam took place in 1997.
In 2003 ECVA acquired full recognition-status by the European Board of Veterinary Specialization (EBVS) and has continued to grow since then. The name of the College was changed to the European College of Veterinary Anesthesia and Analgesia (ECVAA) in 2007.
|
European College of Veterinary Anaesthesia and Analgesia
|
Membership
|
In order to become an EBVS European Specialist in Veterinary Anesthesia and Analgesia, veterinarians need to fulfil the following requirements: (1) have worked as a veterinarian in general practice for two years or have completed a rotating internship, which covers different specialties for at least one year, (2) have successfully completed a three year specialized postgraduate training programme in anesthesia, analgesia and intensive care coordinated by an ECVAA Diplomate, (3) have published two peer-reviewed articles in internationally recognized scientific journals and submitted a case log and two case reports and (4) have successfully passed the written and practical/oral parts of the qualifying examinations. Diplomates of the European Colleges have to pass a re-validation process every five years to retain the European Specialist title. As of March 2020, there have been 227 members recognized ECVAA Diplomates. The current president is Matthew Gurney.
|
European College of Veterinary Anaesthesia and Analgesia
|
Function
|
ECVAA and the Association of Veterinary Anesthetists, of which all Diplomates of ECVAA are members are the main scientific organizations consulted by EU and national authorities for their expert opinion on matters related to veterinary anesthesia and analgesia, protection of animals used for experimental and other scientific purposes etc. ECVAA contributes substantially to animal welfare, not only by alleviating pain and stress of the animals, but also by assisting Animal Welfare Associations in various ways. Diplomates have also been consulted to provide specialist opinion during the registration process of veterinary drugs in the National and European Medicines Agencies.
|
Chalkstick fracture
|
Chalkstick fracture
|
Chalkstick fractures are fractures, typically of long bones, in which the fracture is transverse to the long axis of the bone, like a broken stick of chalk. A healthy long bone typically breaks like a hard woody stick as the collagen in the matrix adds remarkable flexibility to the mineral and the energy can run up and down the growth rings of bone. The bones of children will even follow a greenstick fracture pattern.
|
Chalkstick fracture
|
Chalkstick fracture
|
Chalkstick fractures are particularly common in Paget's disease of bone, and osteopetrosis. It is also seen in cases of fused spine as in a patient with ankylosing spondylitis.
|
Jewellery cleaning
|
Jewellery cleaning
|
Jewelry cleaning is the practice of removing dirt or tarnish from jewelry to improve its appearance.
|
Jewellery cleaning
|
Methods and risks
|
Some kinds of jewelry can be cleaned at home while others are suggested to be done by a professional. Jewelry made from gold and sterling silver are examples of jewelry that can be cleaned at home, while platinum should not be due to how at-risk platinum is of scratching. Jewelry with gemstones such as diamonds or sapphires can be cleaned at home as well using mild soap and warm water. However, gemstones such as opals and pearls should be done professionally. Another issue is the age of jewelry, as certain materials or build strategies of older jewelry (such as from the Georgian era) may have restrictions, such as not being able to get wet without damage. Keeping your jewelry clean helps to ensure that the gemstone(s) keep a good appearance and prevents dirt and grease (among others) from loosening them. Dirty jewelry may also cause skin irritation.A professional cleaning may take anywhere from a few minutes to a few days depending on the circumstances. The cleaner would first inspect the jewelry to ensure that the gemstones are accounted for and secured. Materials that can handle it are often placed in an ultrasonic bath using a cleaning solution and later put through a steam cleaner, while more sensitive materials will go through light brushing in soapy water. Following this, they are rinsed, dried, and inspected. A jeweler may provide their customers with sudsy ammonia cleaning kits, while another may sell small ultrasonic cleaners. Some gemstones, such as white topaz, have an overlay to produce certain colors. Ultrasonic cleaning can remove this coating.
|
Jewellery cleaning
|
Ultrasonic jewellery cleaning
|
Ultrasonic cleaners are useful for jewelry cleaning and removing tarnish. They use ultrasound waves and chemicals combined to create bubbles that "cling" to the foreign particles such as dirt, oil, and unknown substances. The high frequency waves are sent out and pull the contaminants off the object. The bubbles collapse after they attach to the contaminants and move to the surface of the chemical solution creating what appears to be a boiling solution.
|
Jewellery cleaning
|
Cleanliness of gems
|
Colored dye or smudges can affect the perceived color of a gem. Historically, some jewelers' diamonds were mis-graded due to smudges on the girdle, or dye on the culet. Current practice is to thoroughly clean a gem before grading its color as well as clarity.How a gem can be safely cleaned depends upon its individual characteristics and therefore its susceptibility to damage.
|
Nucleoside-diphosphatase
|
Nucleoside-diphosphatase
|
In enzymology, a nucleoside-diphosphatase (EC 3.6.1.6) is an enzyme that catalyzes the chemical reaction a nucleoside diphosphate + H2O ⇌ a nucleotide + phosphateThus, the two substrates of this enzyme are nucleoside diphosphate and H2O, whereas its two products are nucleotide and phosphate.
|
Nucleoside-diphosphatase
|
Nucleoside-diphosphatase
|
This enzyme belongs to the family of hydrolases, specifically those acting on acid anhydrides in phosphorus-containing anhydrides. The systematic name of this enzyme class is nucleoside-diphosphate phosphohydrolase. Other names in common use include thiamine pyrophosphatase, UDPase, inosine diphosphatase, adenosine diphosphatase, IDPase, ADPase, adenosinepyrophosphatase, guanosine diphosphatase, guanosine 5'-diphosphatase, inosine 5'-diphosphatase, uridine diphosphatase, uridine 5'-diphosphatase, nucleoside diphosphate phosphatase, type B nucleoside diphosphatase, GDPase, CDPase, nucleoside 5'-diphosphatase, type L nucleoside diphosphatase, NDPase, and nucleoside diphosphate phosphohydrolase. This enzyme participates in purine metabolism and pyrimidine metabolism.
|
Nucleoside-diphosphatase
|
Structural studies
|
As of late 2007, two structures have been solved for this class of enzymes, with PDB accession codes 2H2N and 2H2U.
|
Panda Cloud Antivirus
|
Panda Cloud Antivirus
|
Panda Cloud Antivirus is an antivirus software developed by Panda Security, a free and a paid version are available. It is cloud-based in the sense that files are scanned on a remote server without using processing power of the user's machine. The cloud technology is based on Panda's Collective Intelligence. It can run constantly, providing protection against viruses and malicious websites but slowing the system to some extent, or do a system scan.
|
Panda Cloud Antivirus
|
Features
|
According to Panda Security, Panda Cloud Antivirus is able to detect viruses, trojans, worms, spyware, dialers, hacking tools, hacker and other security risks.Panda Cloud Antivirus relies on its "Collective Intelligence" and the cloud for up-to-date information. It normally uses an Internet connection to access up-to-date information; if the Internet cannot be accessed, it will use a local cache of "the most common threats in circulation".
|
Panda Cloud Antivirus
|
Reviews
|
An April 2009 review found Panda Cloud Antivirus 1.0 to be clean, fast, simple, easy to use, and with good detection rates. The same review scored Panda 100.00% in malware detection and 100.0% in malicious URL detection. Its overall score was 100%, a strong protection factor considering it is software.When version 1.0 was released on November 10, 2009, PC Magazine reviewed Panda Cloud Antivirus and gave it an Editor's Choice Award for Best AV.TechRadar's review states "We think that Panda Cloud Antivirus is best viewed as a defense tool rather than a utility for cleaning up a system that's already riddled with infection."
|
Panda Cloud Antivirus
|
License
|
The free edition of Panda Cloud Antivirus is released under a license. Its usage is exclusively allowed for private households, state schools, non-governmental and non-profit organizations.
|
Haloperidol decanoate
|
Haloperidol decanoate
|
Haloperidol decanoate, sold under the brand name Haldol Decanoate among others, is a typical antipsychotic which is used in the treatment of schizophrenia. It is administered by injection into muscle at a dose of 100 to 200 mg once every 4 weeks or monthly. The dorsogluteal site is recommended. A 3.75-cm (1.5-inch), 21-gauge needle is generally used, but obese individuals may require a 6.5-cm (2.5-inch) needle to ensure that the drug is indeed injected intramuscularly and not subcutaneously. Haloperidol decanoate is provided in the form of 50 or 100 mg/mL oil solution of sesame oil and benzyl alcohol in ampoules or pre-filled syringes. Its elimination half-life after multiple doses is 21 days. The medication is marketed in many countries throughout the world.
|
Coloplast
|
Coloplast
|
Coloplast A/S is a Danish multinational company that develops, manufactures and markets medical devices and services related to ostomy, urology, continence, and wound care.
|
Coloplast
|
History
|
Coloplast was founded in 1957 by Aage Louis-Hansen. His son Niels Peter Louis-Hansen owns 20% of the company and is deputy chairman. It employs more than 12,000 people and operates around the world, with sales activities in 53 countries and production in Denmark, Hungary, France, China and the US. It has its global headquarters in Humlebæk, Denmark. Its United States operations and North American headquarters are based in Minneapolis, Minnesota. The company manufactures and supplies products to hospitals and institutions, as well as wholesalers and retailers. In selected markets, Coloplast is a direct supplier to consumers.
|
Coloplast
|
History
|
The company had revenues of DKK 18.554 billion in 2020/2021. Europe constitutes the biggest market with 63% of sales, while 22% of sales are in North America and 15% in the rest of the world. Coloplast is listed on the Danish Stock Exchange, and has for a number of years been represented among the 20 most traded shares in the country.In 2016, Coloplast was listed as the 22nd most innovative company in the world by Forbes Forbes. In 2015, Coloplast was listed as the 33rd most innovative company in the world by Forbes Magazine. The company has been featured in The Star Tribune's annual list of top employers in Minnesota.In November 2021, Coloplast announced the acquisition for 2.5 billion dollars of Atos Medical, specialized in laryngectomy, which belonged to PAI Partners.
|
Coloplast
|
Acquisitions
|
In 2010, the company acquired Mpathy Medical Devices.In November 2016, Coloplast acquired Comfort Medical for $160 million. Comfort Medical was a direct-to-consumer medical supplier based in Coral Springs, Florida. Prior to the acquisition from Coloplast, Comfort Medical had acquired Medical Direct Club as well as Liberty Medical's urological business area in 2015. In 2020, Coloplast announced the acquisitions of Hope Medical and Rocky Medical Supply, and integrated the organizations into Comfort Medical.In November 2021, Coloplast announced it would acquire Atos Medical and its laryngectomy technology for 2.16 billion euros ($2.49 billion).
|
Coloplast
|
Transvaginal surgical mesh lawsuits
|
In 2019, the U.S. Food and Drug Administration ordered Coloplast and Boston Scientific to halt the sale and distribution of transvaginal surgical mesh implants for failure to prove their mesh products were safe and effective for the repair of pelvic organ prolapse. Coloplast was one of several companies that had previously settled multimillion-dollar lawsuits for damages caused by transvaginal mesh implants.
|
Gold heptafluoride
|
Gold heptafluoride
|
Gold heptafluoride is a gold(V) compound with the empirical formula AuF7. The synthesis of this compound was first reported in 1986. However, current calculations suggest that the structure of the synthesized molecule was actually a difluorine ligand on a gold pentafluoride core, AuF5·F2. That would make it the first difluorine complex and the first compound containing a fluorine atom with an oxidation state of zero. The gold(V)–difluorine complex is calculated to be 205 kJ/mol more stable than gold(VII) fluoride. The vibrational frequency at 734 cm−1 is the hallmark of the end-on coordinated difluorine molecule.
|
Associative browsing
|
Associative browsing
|
Associative browsing is the professional name for several methods of browsing the web. These methods are usually assisted by some sort of a discovery tool and are considered to be more intuitive.
The tools that serve the associative browsing are similarity/relevancy tools. They use different algorithms to analyze the content and the user in order to offer him or direct him to the next link in what is considered his associative chain.
One of the more familiar sites to use the associative browsing method was Pandora.com, the site used a relevancy engine to bring users music they would like according to the music they are listening right now. The site's algorithm tried to forecast the next link (in this case a song) in the user's associative chain.
|
Associative browsing
|
Associative browsing
|
Associative browsing can be done without the discovery tools but due to the internet overload of information this can be done on a very thin surface line. For example, when you are looking at shoes on the Nike website you can type Puma.com and continue surfing associatively, but your intuitive recalling of shoes websites is limited and at some point you will be forced to perform a search.
|
Associative browsing
|
Associative browsing
|
The difference between searching and associative browsing is in the "flow" of the events. While in associative browsing you are surfing from site to site following your associative chain, in search mode you are inquiring information which will help you develops an associative chain.
The implementation of associative browsing can be on different levels and on different subjects. The discovery tools can try to guess the next link in one's associative chain, the next song one will hear, the next site one will visit or the next product one will shop for.
|
Orthonormality
|
Orthonormality
|
In linear algebra, two vectors in an inner product space are orthonormal if they are orthogonal (or perpendicular along a line) unit vectors. A set of vectors form an orthonormal set if all vectors in the set are mutually orthogonal and all of unit length. An orthonormal set which forms a basis is called an orthonormal basis.
|
Orthonormality
|
Intuitive overview
|
The construction of orthogonality of vectors is motivated by a desire to extend the intuitive notion of perpendicular vectors to higher-dimensional spaces. In the Cartesian plane, two vectors are said to be perpendicular if the angle between them is 90° (i.e. if they form a right angle). This definition can be formalized in Cartesian space by defining the dot product and specifying that two vectors in the plane are orthogonal if their dot product is zero.
|
Orthonormality
|
Intuitive overview
|
Similarly, the construction of the norm of a vector is motivated by a desire to extend the intuitive notion of the length of a vector to higher-dimensional spaces. In Cartesian space, the norm of a vector is the square root of the vector dotted with itself. That is, ‖x‖=x⋅x Many important results in linear algebra deal with collections of two or more orthogonal vectors. But often, it is easier to deal with vectors of unit length. That is, it often simplifies things to only consider vectors whose norm equals 1. The notion of restricting orthogonal pairs of vectors to only those of unit length is important enough to be given a special name. Two vectors which are orthogonal and of length 1 are said to be orthonormal.
|
Orthonormality
|
Intuitive overview
|
Simple example What does a pair of orthonormal vectors in 2-D Euclidean space look like? Let u = (x1, y1) and v = (x2, y2).
Consider the restrictions on x1, x2, y1, y2 required to make u and v form an orthonormal pair.
From the orthogonality restriction, u • v = 0.
From the unit length restriction on u, ||u|| = 1.
From the unit length restriction on v, ||v|| = 1.Expanding these terms gives 3 equations: x1x2+y1y2=0 x12+y12=1 x22+y22=1 Converting from Cartesian to polar coordinates, and considering Equation (2) and Equation (3) immediately gives the result r1 = r2 = 1. In other words, requiring the vectors be of unit length restricts the vectors to lie on the unit circle.
After substitution, Equation (1) becomes cos cos sin sin θ2=0 . Rearranging gives tan cot θ2 . Using a trigonometric identity to convert the cotangent term gives tan tan (θ2+π2) ⇒θ1=θ2+π2 It is clear that in the plane, orthonormal vectors are simply radii of the unit circle whose difference in angles equals 90°.
|
Orthonormality
|
Definition
|
Let V be an inner-product space. A set of vectors {u1,u2,…,un,…}∈V is called orthonormal if and only if ∀i,j:⟨ui,uj⟩=δij where δij is the Kronecker delta and ⟨⋅,⋅⟩ is the inner product defined over V
|
Orthonormality
|
Significance
|
Orthonormal sets are not especially significant on their own. However, they display certain features that make them fundamental in exploring the notion of diagonalizability of certain operators on vector spaces.
Properties Orthonormal sets have certain very appealing properties, which make them particularly easy to work with.
Theorem. If {e1, e2, ..., en} is an orthonormal list of vectors, then Theorem. Every orthonormal list of vectors is linearly independent.
|
Orthonormality
|
Significance
|
Existence Gram-Schmidt theorem. If {v1, v2,...,vn} is a linearly independent list of vectors in an inner-product space V , then there exists an orthonormal list {e1, e2,...,en} of vectors in V such that span(e1, e2,...,en) = span(v1, v2,...,vn).Proof of the Gram-Schmidt theorem is constructive, and discussed at length elsewhere. The Gram-Schmidt theorem, together with the axiom of choice, guarantees that every vector space admits an orthonormal basis. This is possibly the most significant use of orthonormality, as this fact permits operators on inner-product spaces to be discussed in terms of their action on the space's orthonormal basis vectors. What results is a deep relationship between the diagonalizability of an operator and how it acts on the orthonormal basis vectors. This relationship is characterized by the Spectral Theorem.
|
Orthonormality
|
Examples
|
Standard basis The standard basis for the coordinate space Fn is Any two vectors ei, ej where i≠j are orthogonal, and all vectors are clearly of unit length. So {e1, e2,...,en} forms an orthonormal basis.
Real-valued functions When referring to real-valued functions, usually the L² inner product is assumed unless otherwise stated. Two functions ϕ(x) and ψ(x) are orthonormal over the interval [a,b] if (1)⟨ϕ(x),ψ(x)⟩=∫abϕ(x)ψ(x)dx=0,and 1.
Fourier series The Fourier series is a method of expressing a periodic function in terms of sinusoidal basis functions.
Taking C[−π,π] to be the space of all real-valued functions continuous on the interval [−π,π] and taking the inner product to be ⟨f,g⟩=∫−ππf(x)g(x)dx it can be shown that sin sin sin cos cos cos (nx)π},n∈N forms an orthonormal set.
However, this is of little consequence, because C[−π,π] is infinite-dimensional, and a finite set of vectors cannot span it. But, removing the restriction that n be finite makes the set dense in C[−π,π] and therefore an orthonormal basis of C[−π,π].
|
Orthonormality
|
Sources
|
Axler, Sheldon (1997), Linear Algebra Done Right (2nd ed.), Berlin, New York: Springer-Verlag, p. 106–110, ISBN 978-0-387-98258-8 Chen, Wai-Kai (2009), Fundamentals of Circuits and Filters (3rd ed.), Boca Raton: CRC Press, p. 62, ISBN 978-1-4200-5887-1
|
Ankyrin repeat domain 11
|
Ankyrin repeat domain 11
|
Ankyrin repeat domain 11 is a protein that in humans is encoded by the ANKRD11 gene.
|
Ankyrin repeat domain 11
|
Function
|
This locus encodes an ankyrin repeat domain-containing protein. The encoded protein inhibits ligand-dependent activation of transcription. Mutations in this gene have been associated with KBG syndrome, which is characterized by macrodontia, distinctive craniofacial features, short stature, skeletal anomalies, global developmental delay, seizures and intellectual disability. Alternatively spliced transcript variants have been described. Related pseudogenes exist on chromosomes 2 and X.
|
4-Oxo-2-nonenal
|
4-Oxo-2-nonenal
|
4-Oxo-2-nonenal is a lipid peroxidation product that can structurally alter proteins and induce α-synuclein oligomers.
|
Freight terminal
|
Freight terminal
|
A freight terminal is a processing node for freight. They may include airports, seaports, container ports, goods stations, railroad terminals and trucking terminals. As most freight terminals are located at ports, many cargo containers can be seen around the area.
|
Vancomycin-resistant Staphylococcus aureus
|
Vancomycin-resistant Staphylococcus aureus
|
Vancomycin-resistant Staphylococcus aureus (VRSA) are strains of Staphylococcus aureus that have acquired resistance to the glycopeptide antibiotic vancomycin. Resistance in VRSA is conferred by the plasmid mediated vanA gene and operon. Although VRSA infections are limited, VRSA is still a potential threat to public health because treatment options are limited since the bacteria is resistant to many of the standard drugs used to treat S. aureus infections. Furthermore, resistance can be transferred from one bacteria to another.
|
Vancomycin-resistant Staphylococcus aureus
|
Mechanism of acquired resistance
|
Vancomycin-resistant Staphylococcus aureus was first reported in the United States in 2002. To date, documented cases of VRSA have acquired resistance through uptake of a vancomycin resistance gene cluster from Enterococcus (i.e. VRE). The acquired mechanism is typically the vanA gene and operon from a plasmid in Enterococcus faecium or Enterococcus faecalis.This mechanism differs from strains of vancomycin-intermediate Staphylococcus aureus (VISA), which appear to develop elevated MICs to vancomycin through sequential mutations resulting in a thicker cell wall and the synthesis of excess amounts of D-ala-D-ala residues.
|
Vancomycin-resistant Staphylococcus aureus
|
Diagnosis
|
The diagnosis of vancomycin-resistant Staphylococcus aureus (VRSA) is performed by performing susceptibility testing on a single S. aureus isolate to vancomycin. This is accomplished by first assessing the isolate's minimum inhibitory concentration (MIC) using standard laboratory methods, including disc diffusion, gradient strip diffusion, and automated antimicrobial susceptibility testing systems. Once the MIC is known, resistance is determined by comparing the MIC with established breakpoints Resistant or "R" designations are assigned based on agreed upon values called breakpoints. Breakpoints are published by standards development organizations such as the U.S. Clinical and Laboratory Standards Institute (CLSI), the British Society for Antimicrobial Chemotherapy (BSAC) and the European Committee on Antimicrobial Susceptiblity Testing (EUCAST).
|
Vancomycin-resistant Staphylococcus aureus
|
Treatment of infection
|
For isolates with a vancomycin minimum inhibitory concentration (MIC) > 2 µg/mL, an alternative to vancomycin should be used. The approach is to treat with at least one agent to which VISA/VRSA is known to be susceptible by in vitro testing. The agents that are used include daptomycin, linezolid, telavancin, ceftaroline, quinupristin–dalfopristin. For people with methicillin-resistant Staphylococcus aureus (MRSA) bacteremia in the setting of vancomycin failure the IDSA recommends high-dose daptomycin, if the isolate is susceptible, in combination with another agent (e.g. gentamicin, rifampin, linezolid, TMP-SMX, or a beta-lactam antibiotic).
|
Vancomycin-resistant Staphylococcus aureus
|
History
|
Three classes of vancomycin-resistant S. aureus have emerged that differ in vancomycin susceptibilities: vancomycin-intermediate S. aureus (VISA), heterogeneous vancomycin-intermediate S. aureus (hVISA), and high-level vancomycin-resistant S. aureus (VRSA).
|
Vancomycin-resistant Staphylococcus aureus
|
History
|
Vancomycin-intermediate S. aureus (VISA) Vancomycin-intermediate S. aureus (VISA) ( or ) was first identified in Japan in 1996 and has since been found in hospitals elsewhere in Asia, as well as in the United Kingdom, France, the U.S., and Brazil. It is also termed GISA (glycopeptide-intermediate Staphylococcus aureus), indicating resistance to all glycopeptide antibiotics. These bacterial strains present a thickening of the cell wall, which is believed to reduce the ability of vancomycin to diffuse into the division septum of the cell required for effective vancomycin treatment.
|
Vancomycin-resistant Staphylococcus aureus
|
History
|
Vancomycin-resistant S. aureus (VRSA) High-level vancomycin resistance in S. aureus has been rarely reported. In vitro and in vivo experiments reported in 1992 demonstrated that vancomycin resistance genes from Enterococcus faecalis could be transferred by gene transfer to S. aureus, conferring high-level vancomycin resistance to S. aureus. Until 2002 such a genetic transfer was not reported for wild S. aureus strains. In 2002, a VRSA strain ( or ) was isolated from a patient in Michigan. The isolate contained the mecA gene for methicillin resistance. Vancomycin MICs of the VRSA isolate were consistent with the VanA phenotype of Enterococcus species, and the presence of the vanA gene was confirmed by polymerase chain reaction. The DNA sequence of the VRSA vanA gene was identical to that of a vancomycin-resistant strain of Enterococcus faecalis recovered from the same catheter tip. The vanA gene was later found to be encoded within a transposon located on a plasmid carried by the VRSA isolate. This transposon, Tn1546, confers vanA-type vancomycin resistance in enterococci.As of 2019, 52 VRSA strains have been identified in the United States, India, Iran, Pakistan, Brazil, and Portugal.
|
Vancomycin-resistant Staphylococcus aureus
|
History
|
Heterogeneous vancomycin-intermediate S. aureus (hVISA) The definition of hVISA according to Hiramatsu et al. is a strain of Staphylococcus aureus that gives resistance to vancomycin at a frequency of 10−6 colonies or even higher.
|
Paste up
|
Paste up
|
Paste up is a method of creating or laying out publication pages that predates the use of the now-standard computerized page design desktop publishing programs. Completed, or camera-ready, pages are known as mechanicals or mechanical art. In the offset lithography process, the mechanicals would be photographed with a stat camera to create a same-size film negative for each printing plate required.
|
Paste up
|
Paste up
|
Paste up relied on phototypesetting, a process that would generate "cold type" on photographic paper that usually took the form of long columns of text. These printouts were often a single column in a scroll of narrow (3-inch or 4-inch) paper that was as deep as the length of the story.
|
Paste up
|
Paste up
|
A professional known variously as a paste-up artist, layout artist, mechanical artist, production artist, or compositor would cut the type into sections and arrange it carefully across multiple columns. For example, a 15 inch strip could be cut into three 5-inch sections. Headlines and other typographic elements were often created and supplied separately by the typesetter, leaving it to the paste up artist to determine their final position on the page.
|
Paste up
|
Paste up
|
Adhesive was then applied to the back side of these strips, either by applying rubber cement with a brush or passing them through a machine that would apply a wax adhesive. The adhesives were intentionally made semi-permanent, allowing the strips to be removed and moved around the layout if it needed to be changed. The strips would be adhered to a board, usually a stiff white paper on which the artist would draw the publication's margins and columns, either lightly in pencil or in non-photographic blue ink, a light cyan color that would be ignored by the orthochromatic film used to make printing plates in offset lithography. For magazines, newspapers, and other recurring projects, often the boards would be pre-printed in this color.
|
Paste up
|
Paste up
|
Other camera-ready materials like photostats and line art would also be prepared with adhesive and attached to the boards. Continuous-tone photographs would need halftoning, which would require black paper or red film (which photo-imaged the same as black) to be trimmed and placed on the board in place of the image; in the process of creating the negative film for the printing plates, the solid black area would create a clear spot on the negative, called a window. The photographs would be converted to halftone film separately and then positioned in this window to complete the page (although this process was typically performed by a different worker, known as a negative "stripper").
|
Paste up
|
Paste up
|
Once a page was complete, the board would be attached to an easel and photographed in order to create a negative, which was then used to make a printing plate.
Paste up was preceded by hot type and cold type technologies. Starting in the 1990s, many newspapers started doing away with paste up, switching to desktop publishing software that allows pages to be designed completely on a computer. Such software includes QuarkXPress, PageMaker and InDesign.
|
Distorted thread locknut
|
Distorted thread locknut
|
A distorted thread locknut, is a type of locknut that uses a deformed section of thread to keep the nut from loosening from vibrations or rotation of the clamped item. They are broken down into four types: elliptical offset nuts, centerlock nuts, toplock nuts and partially depitched (Philidas) nuts.
|
Distorted thread locknut
|
High temperature use
|
Because these nuts are solid metal, they are effective in elevated temperature settings, unlike nyloc nuts. High grade nuts can withstand temperatures up to 1,400 °F (760 °C).
|
Distorted thread locknut
|
Safety factors
|
High strength distorted thread nuts cannot be used with low strength fasteners because the hard nut will act like a die and destroy the threads on the fastener.
|
Distorted thread locknut
|
Elliptical offset nuts
|
Elliptical offset nuts is a catch-all category that encompasses designs known as oval locknuts or non-slotted hex locknuts,. The salient feature is that the thread form has been deformed at one end so that the threads are no longer perfectly circular. The deformed end is usually shaped into an ellipse or obround triangle. These are known as one-way nuts as the nut may be easily started on the male fastener from the bottom non-deformed portion, but are practically impossible to start from the deformed end. As the male fastener reaches the deformed section it stretches the threads of the nut elastically back into a circle. This action increases the friction between the nut and the fastener greatly and creates the locking action. Due to the elastic nature of the deformation the nuts can be reused indefinitely.
|
Distorted thread locknut
|
Centerlock nuts
|
Center lock nuts are similar to elliptical offset nuts, except that they are distorted in the middle of the nut. This allows the nut to be started from either side.
|
Distorted thread locknut
|
Toplock nuts
|
Toplock nuts are also similar to elliptical offset nuts, except that the whole thread on one end is not distorted. Instead only three small sections of the thread are deformed on one end.
|
Distorted thread locknut
|
Partially depitched nuts
|
Partially depitched nuts are commonly called Philidas nuts, after their originator and current manufacturer, and differ from the above three nut types insofar as a portion of the thread is displaced axially, this being facilitated by one or more slots perpendicular to the axis.
|
Quantum cognition
|
Quantum cognition
|
Quantum cognition is an emerging field which applies the mathematical formalism of quantum theory to model cognitive phenomena such as information processing by the human brain, language, decision making, human memory, concepts and conceptual reasoning, human judgment, and perception. The field clearly distinguishes itself from the quantum mind as it is not reliant on the hypothesis that there is something micro-physical quantum-mechanical about the brain. Quantum cognition is based on the quantum-like paradigm or generalized quantum paradigm or quantum structure paradigm that information processing by complex systems such as the brain, taking into account contextual dependence of information and probabilistic reasoning, can be mathematically described in the framework of quantum information and quantum probability theory.
|
Quantum cognition
|
Quantum cognition
|
Quantum cognition uses the mathematical formalism of quantum theory to inspire and formalize models of cognition that aim to be an advance over models based on probability theory. The field focuses on modeling phenomena in cognitive science that have resisted traditional techniques or where traditional models seem to have reached a barrier (e.g., human memory), and modeling preferences in decision theory that seem paradoxical from a traditional rational point of view (e.g., preference reversals). Since the use of a quantum-theoretic framework is for modeling purposes, the identification of quantum structures in cognitive phenomena does not presuppose the existence of microscopic quantum processes in the human brain.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.