source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Cantor%27s%20paradise | Cantor's paradise is an expression used by in describing set theory and infinite cardinal numbers developed by Georg Cantor. The context of Hilbert's comment was his opposition to what he saw as L. E. J. Brouwer's reductive attempts to circumscribe what kind of mathematics is acceptable; see Brouwer–Hilbert controversy.
References
Saharon Shelah. You can enter Cantor's paradise! Paul Erdős and his mathematics, II (Budapest, 1999), 555–564, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, 2002.
Peckhaus, Volker. Fixing Cantor's paradise: the prehistory of Ernst Zermelo's axiomatization of set theory. New approaches to classes and concepts, 11–22, Stud. Log. (Lond.), 14, Coll. Publ., London, 2008.
"About Cantor's Paradise". Medium. A Medium Corporation. Retrieved 24 January 2021.
Set theory
David Hilbert |
https://en.wikipedia.org/wiki/Risk%20of%20Rain | Risk of Rain is a 2013 platform game developed by Hopoo Games and published by Chucklefish. The game, initially made by a two-student team from the University of Washington using the GameMaker engine, was funded through Kickstarter before being released on Microsoft Windows in November 2013. Ports for OS X and Linux versions were released a year later, with consoles versions being released in the later half of the 2010s.
In Risk of Rain, players control the survivor of a space freighter crash on a strange planet. Players attempt to survive by killing monsters and collecting items that can boost their offensive and defensive abilities. The game features a difficulty scale that increases with time, requiring the player to choose between spending time building experience and completing levels quickly before the monsters become more difficult. The game supports up to ten cooperative players in online play and up to two players in local play. A sequel, Risk of Rain 2, was released in August 2020, while a remastered version of the game is scheduled for a November 2023 release on Windows and Nintendo Switch under the title Risk of Rain Returns.
Gameplay
At the start of the game, the player selects one of twelve characters. Initially, one character is available, the Commando. As the player completes various in-game objectives, more characters become available. Each character has various statistics and a set of unique moves; for example, the sniper has the ability to hit creatures from a long distance for large, piercing damage but their firing rate is slow, while the commando can do rapid, moderate damage at close range.
Throughout the game, the goal is to locate a teleporter, always placed in a random location on the level. As the players hunt for it, they will encounter monsters; upon death, the monsters will drop in-game money and will provide the players experience. As the players gain experience they will level up, gaining more hit points and damage. Money can be u |
https://en.wikipedia.org/wiki/VPNBook | VPNBook is a VPN service offering servers in multiple countries.
Description
The service connects to a VPN via OpenVPN client or a PPTP connection. There are minimal variety of geographic locations. Available servers include the United States, Canada and Romania. VPNBook can be used to bypass some governmental restrictions. The service can be connected to by two ways, by connection via a third-party OpenVPN client or through PPTP. The Mac OS X, iOS, Android, Ubuntu, and Windows operating systems all have PPTP support built in.
The software (OpenVPN clients) can be used also, that provides the protocol stack, file system, and process scheduling. OpenVPN uses SSL protocol which is generally more secure than Layer 2 Tunnel Protocol's PPTP.
Reception
In a review done by PC Magazine, it was concluded that the service is a good choice among free VPN services, even though it has certain functionality flaws. TechRadar reviewed VPNBook negatively, criticizing its poor performance and lack of desktop and mobile apps.
See also
Comparison of virtual private network services
References
External links
Free security software
Computer network security
Virtual private network services |
https://en.wikipedia.org/wiki/Sensorization | Sensorization is a modern technology trend to insert many similar sensors in any device or application. Some scientists believe that sensorization is one of main requirements for third technological revolution.
As a result of significant prices drop in recent years there is a trend to include large number of sensors with the same or different function in one device. An example is the evolution of the iPhone.
See also
Acsensorize
References
Sensorization
Technology forecasting
Measuring instruments |
https://en.wikipedia.org/wiki/Epitranscriptome | Within the field of molecular biology, the epitranscriptome includes all the biochemical modifications of the RNA (the transcriptome) within a cell. In analogy to epigenetics that describes "functionally relevant changes to the genome that do not involve a change in the nucleotide sequence", epitranscriptomics involves all functionally relevant changes to the transcriptome that do not involve a change in the ribonucleotide sequence. Thus, the epitranscriptome can be defined as the ensemble of such functionally relevant changes.
There are several types of RNA modifications that impact gene expression. These modifications happen to many types of cellular RNA including, but not limited to, ribosomal RNA (rRNA), transfer RNA (tRNA), messenger RNA (mRNA), and small nuclear RNA (snRNA). The most common and well-understood mRNA modification at present is N6-Methyladenosine (m6A), which has been observed to occur an average of three times in every mRNA molecule.
Currently, work is focused on determining the types of and location of RNA modifications, determining if these modification have function, and if so, what is their mechanism of action. Similar to the epigenome, the epitranscriptome has "writers" and "erasers" that mark RNA and "readers" that translate those marks into function. One function that has been elucidated involves the enzyme adenosine deaminase (ADAR), which acts on RNA. ADAR affects a series of cellular processes, including alternative splicing, microRNAs, the innate immune system, and leads to protein recoding especially for important receptors in the central nervous system.
Chemical Modifications of RNA
N6-Methyladenosine (m6A)
m6A describes the methylation of the nitrogen at position 6 in the adenosine base within mRNA. Discovered in 1974, m6A is the most abundant eukaryotic mRNA modification; most mRNAs contain approximately three m6A residues. However, some mRNA transcripts do not contain any m6A at all, while others may have 10 or more. The ter |
https://en.wikipedia.org/wiki/Groundwater%20banking | Groundwater banking is a water management mechanism designed to increase water supply reliability. Groundwater can be created by using dewatered aquifer space to store water during the years when there is abundant rainfall. It can then be pumped and used during years that do not have a surplus of water. People can manage the use of groundwater to benefit society through the purchasing and selling of these groundwater rights. The surface water should be used first, and then the groundwater will be used when there is not enough surface water to meet demand. The groundwater will reduce the risk of relying on surface water and will maximize expected income. There are regulatory storage-type aquifer recovery and storage systems which when water is injected into it gives the right to withdraw the water later on. Groundwater banking has been implemented into semi-arid and arid southwestern United States because this is where there is the most need for extra water. The overall goal is to transfer water from low-value to high-value uses by bringing buyers and sellers together.
Groundwater storage concepts
The bank is an aquifer used as an underground storage tank, and the recharge of water causes an increase in the volume of water stored in the aquifer to have increasing water levels. In the case of a withdrawal there would be a decrease in water levels. The amount of water depends also on a couple of other factors including groundwater pumping by other users, leakage, and natural recharge. The recharge of water by land application or injection increases the volume of water, and then some of the water will be used at a future time. It can be looked at as inputs of water minus outputs is equal to the change in water storage.
Another aspect is the hydrology which is the difference between dynamic and static response to recharge and abstraction. The water levels will rise or fall in the well during recharge and recovery. Once recharge and recovery stops the water levels retu |
https://en.wikipedia.org/wiki/Dennard%20scaling | In semiconductor electronics, Dennard scaling, also known as MOSFET scaling, is a scaling law which states roughly that, as transistors get smaller, their power density stays constant, so that the power use stays in proportion with area; both voltage and current scale (downward) with length. The law, originally formulated for MOSFETs, is based on a 1974 paper co-authored by Robert H. Dennard, after whom it is named.
Derivation
Dennard's model of MOSFET scaling implies that, with every technology generation:
Transistor dimensions could be scaled by −30% (0.7×). This has the following effects simultaneously:
The area of an individual device reduces by 50%, because area is length times width.
The capacitance associated with the device, C, is reduced by 30% (0.7×), because capacitance varies with area over distance.
To keep the electric field unchanged, the voltage, V, is reduced by 30% (0.7×), because voltage is field times length.
Characteristics such as current and transition time are likewise scaled down by 30%, due to their relationship with capacitance and voltage.
Overall circuit delay is assumed to be dominated by transition time, so it too is reduced by 30%.
The above effects lead to an increase in operating frequency, f, by about 40% (1.4×), because frequency varies with one over delay.
Power consumption of an individual transistor decreases by 50%, because active power is CV2f.
Therefore, in every technology generation, the area and power consumption of individual transistors is halved. In other words, if the transistor density doubles, power consumption (with twice the number of transistors) stays the same.
Relation with Moore's law and computing performance
Moore's law says that the number of transistors doubles approximately every two years. Combined with Dennard scaling, this means that performance per joule grows even faster, doubling about every 18 months (1.5 years). This trend is sometimes referred to as Koomey's law. The rate of doubling |
https://en.wikipedia.org/wiki/Posted%20write | A posted write is a computer bus write transaction that does not wait for a write completion response to indicate success or failure of the write transaction. For a posted write, the CPU assumes that the write cycle will complete with zero wait states, and so doesn't wait for the done. This speeds up writes considerably. For starters, it doesn't have to wait for the done response, but it also allows for better pipelining of the datapath without much performance penalty.
A non-posted write requires that a bus transaction responds with a write completion response to indicate success or failure of the transaction, and is naturally much slower than a posted write since it requires a round trip delay similar to read bus transactions.
In reference to memory bus accesses, a posted write is referred to as a posted memory write (PMW).
See also
CPU cache
Computer memory
References
PCI System Architecture, Don Anderson, Tom Shanley, MindShare, Inc - 1999
External links
Computer hardware buses and slots pinouts with brief descriptions
Computer buses
Digital electronics
Motherboard |
https://en.wikipedia.org/wiki/Nanoprobing | Nanoprobing is method of extracting device electrical parameters through the use of nanoscale tungsten wires, used primarily in the semiconductor industry. The characterization of individual devices is instrumental to engineers and integrated circuit designers during initial product development and debug. It is commonly utilized in device failure analysis laboratories to aid with yield enhancement, quality and reliability issues and customer returns. Commercially available nanoprobing systems are integrated into either a vacuum-based scanning electron microscope (SEM) or atomic force microscope (AFM). Nanoprobing systems that are based on AFM technology are referred to as Atomic Force nanoProbers (AFP).
Principles and operation
AFM based nanoprobers, enable up to eight probe tips to be scanned to generate high resolution AFM topography images, as well as Conductive AFM, Scanning Capacitance, and Electrostatic Force Microscopy images. Conductive AFM provides pico-amp resolution to identify and localize electrical failures such as shorts, opens, resistive contacts and leakage paths, enabling accurate probe positioning for current-voltage measurements. AFM based nanoprobers enable nanometer scale device defect localization and accurate transistor device characterization without the physical damage and electrical bias induced by high energy electron beam exposure.
For SEM based nanoprobers, the ultra-high resolution of the microscopes that house the nanoprobing system allow the operator to navigate the probe tips with precise movement, allowing the user to see exactly where the tips will be landed, in real time. Existing nanoprobe needles or “probe tips” have a typical end-point radius ranging from 5 to 35 nm. The fine tips enable access to individual contacts nodes of modern IC transistors. Navigation of the probe tips in SEM based nanoprobers are typically controlled by precision piezoelectric manipulators. Typical systems have anywhere from 2 to 8 probe manipulato |
https://en.wikipedia.org/wiki/List%20of%20tallest%20buildings%20in%20Jakarta | Jakarta is the capital of Indonesia and the largest city by population in Southeast Asia. The city is a blend as well as contrast of business districts with modern skyscrapers and kampungs with traditional Indonesian style architecture. Jakarta has architecturally significant buildings in a wide range of styles spanning distinct historical and cultural periods. Architectural styles reflect Malay, Javanese, Arabic, Chinese and Dutch influences.
In December 2019, there were 964 highrise buildings and 244 skyscrapers in Jakarta. The city has 127 completed skyscrapers with (150m+) height and another 52 more under construction. At present four supertall buildings (300m+) are being constructed in the city and another five supertall buildings are in proposal stage. Average age of the buildings of the city is about 8 years. Jakarta has more highrise buildings than that of Beijing. There are many other highrise and skyscrapers within Greater Jakarta outside DKI Jakarta, which are not included in this article. As of July 2021, there are 46 skyscrapers in Jakarta, which are taller than 200 meters. Jakarta has the highest numbers of 200-meter-plus skyscrapers among Southeast Asian cities. Seven 200-meter-plus skyscrapers were completed in 2015 in Jakarta, which was the highest among the cities in the world during that year. The city ranked third in the world by completing five 200-meter-plus skyscrapers during 2017.
The first high rise building in the city was Sarinah, which was built in 1963. The first building over 100m in Jakarta was Wisma Nusantara, which was built in 1967 and was the tallest building in Southeast Asia at that time Between 1983 and 1996, the tallest building in the city was Graha Mandiri. The first skyscraper above 250 meters height is Wisma 46 (262 m), which was constructed in 1996 and held the 'unbeatable' record of being the tallest building for nearly 20 years. As of October 2021, Autograph Tower is the tallest building and Indosiar Television Tower i |
https://en.wikipedia.org/wiki/Digital%20Forensics%20Framework | Digital Forensics Framework (DFF) was a computer forensics open-source software. It is used by professionals and non-experts to collect, preserve and reveal digital evidence without compromising systems and data.
User interfaces
Digital Forensics Framework offers a graphical user interface (GUI) developed in PyQt and a classical tree view. Features such as recursive view, tagging, live search and bookmarking are available. Its command line interface allows the user to remotely perform digital investigation. It comes with common shell functions such as completion, task management, globing and keyboard shortcuts. DFF can run batch scripts at startup to automate repetitive tasks. Advanced users and developers can use DFF directly from a Python interpreter to script their investigation.
Distribution methods
In addition to the source code package and binary installers for Linux and Windows, Digital Forensics Framework is available in operating system distributions as is typical in free and open-source software (FOSS), including Debian, Fedora and Ubuntu.
Other Digital Forensics Framework methods available are digital forensics oriented distribution and live cd:
DEFT Linux Live CD
Kali Linux
Publications
"Scriptez vos analyses forensiques avec Python et DFF" in the French magazine MISC
Several presentations about DFF in conferences: "Digital Forensics Framework" at ESGI Security Day "An introduction to digital forensics" at RMLL 2013
Published books that mention Digital Forensics Framework are:
Digital Forensics with Open Source Tools (Syngress, 2011)
Computer Forensik Hacks (O'Reilly, 2012)
Malwares - Identification, analyse et éradication (Epsilon, 2013)
Digital Forensics for Handheld Devices (CRC Press Inc, 2012)
In literature
Saving Rain: The First Novel in The Rain Trilogy
White papers
Selective Imaging Revisited
A survey of main memory acquisition and analysis techniques for the windows operating system
Uforia : Universal forensic indexer and ana |
https://en.wikipedia.org/wiki/Rigidity%20theory%20%28physics%29 | Rigidity theory, or topological constraint theory, is a tool for predicting properties of complex networks (such as glasses) based on their composition. It was introduced by James Charles Phillips in 1979 and 1981, and refined by Michael Thorpe in 1983. Inspired by the study of the stability of mechanical trusses as pioneered by James Clerk Maxwell, and by the seminal work on glass structure done by William Houlder Zachariasen, this theory reduces complex molecular networks to nodes (atoms, molecules, proteins, etc.) constrained by rods (chemical constraints), thus filtering out microscopic details that ultimately don't affect macroscopic properties. An equivalent theory was developed by P.K. Gupta A.R. Cooper in 1990, where rather than nodes representing atoms, they represented unit polytopes. An example of this would be the SiO tetrahedra in pure glassy silica. This style of analysis has applications in biology and chemistry, such as understanding adaptability in protein-protein interaction networks. Rigidity theory applied to the molecular networks arising from phenotypical expression of certain diseases may provide insights regarding their structure and function.
In molecular networks, atoms can be constrained by radial 2-body bond-stretching constraints, which keep interatomic distances fixed, and angular 3-body bond-bending constraints, which keep angles fixed around their average values. As stated by Maxwell's criterion, a mechanical truss is isostatic when the number of constraints equals the number of degrees of freedom of the nodes. In this case, the truss is optimally constrained, being rigid but free of stress. This criterion has been applied by Phillips to molecular networks, which are called flexible, stressed-rigid or isostatic when the number of constraints per atoms is respectively lower, higher or equal to 3, the number of degrees of freedom per atom in a three-dimensional system.
The same condition applies to random packing of spheres, which a |
https://en.wikipedia.org/wiki/Malware%20analysis | Malware analysis is the study or process of determining the functionality, origin and potential impact of a given malware sample such as a virus, worm, trojan horse, rootkit, or backdoor. Malware or malicious software is any computer software intended to harm the host operating system or to steal sensitive data from users, organizations or companies. Malware may include software that gathers user information without permission.
Use cases
There are three typical use cases that drive the need for malware analysis:
Computer security incident management: If an organization discovers or suspects that some malware may have gotten into its systems, a response team may wish to perform malware analysis on any potential samples that are discovered during the investigation process to determine if they are malware and, if so, what impact that malware might have on the systems within the target organizations' environment.
Malware research: Academic or industry malware researchers may perform malware analysis simply to understand how malware behaves and the latest techniques used in its construction.
Indicator of compromise extraction: Vendors of software products and solutions may perform bulk malware analysis in order to determine potential new indicators of compromise; this information may then feed the security product or solution to help organizations better defend themselves against attack by malware.
Types
The method by which malware analysis is performed typically falls under one of two types:
Static malware analysis: Static or Code Analysis is usually performed by dissecting the different resources of the binary file without executing it and studying each component. The binary file can also be disassembled (or reverse engineered) using a disassembler such as IDA or Ghidra. The machine code can sometimes be translated into assembly code which can be read and understood by humans: the malware analyst can then read the assembly as it is correlated with specific functi |
https://en.wikipedia.org/wiki/Splaysort | In computer science, splaysort is an adaptive comparison sorting algorithm based on the splay tree data structure.
Algorithm
The steps of the algorithm are:
Initialize an empty splay tree
For each data item in the input order, insert it into the splay tree
Traverse the splay tree in inorder to find the sorted order of the data
Thus, the algorithm may be seen as a form of insertion sort or tree sort, using a splay tree to speed up each insertion.
Analysis
Based on the amortized analysis of splay trees, the worst case running time of splaysort, on an input with n data items, is O(n log n), matching the time bounds for efficient non-adaptive algorithms such as quicksort, heap sort, and merge sort.
For an input sequence in which most items are placed close to their predecessor in the sorted order, or are out of order with only a small number of other items, splaysort can be faster than O(n log n), showing that it is an adaptive sort. To quantify this, let dx be the number of positions in the input that separate x from its predecessor, and let ix be the number of items that appear on one side of x in the input and on the other side of x in the output (the number of inversions that involve x). Then it follows from the dynamic finger theorem for splay trees that the total time for splaysort is bounded by
and by
.
Splaysort can also be shown to be adaptive to the entropy of the input sequence.
Experimental results
In experiments by , splaysort was slower than quicksort on tables of random numbers by a factor of 1.5 to 2, and slower than mergesort by smaller factors. For data consisting of larger records, again in a random order, the additional amount of data movement performed by quicksort significantly slowed it down compared to pointer-based algorithms, and the times for splaysort and mergesort were very close to each other. However, for nearly presorted input sequences (measured in terms of the number of contiguous monotone subsequences in the data, the number o |
https://en.wikipedia.org/wiki/Kaleidocycle | A kaleidocycle or flextangle is a flexible polyhedron connecting six tetrahedra (or disphenoids) on opposite edges into a cycle. If the faces of the disphenoids are equilateral triangles, it can be constructed from a stretched triangular tiling net with four triangles in one direction and an even number in the other direction.
The kaleidocycle has degenerate pairs of coinciding edges in transition, which function as hinges. The kaleidocycle has an additional property that it can be continuously twisted around a ring axis, showing 4 sets of 6 triangular faces. The kaleidocycle is invariant under twists about its ring axis by , where is an integer, and can therefore be continuously twisted.
Kaleidocycles can be constructed from a single piece of paper (with dimensions ) without tearing or using adhesive. Because of this and their continuous twisting property, they are often given as examples of simple origami toys. The kaleidocycle is sometimes called a flexahedron in analogy to the planar flexagon, which has similar symmetry under flexing transformations.
Examples
This animation demonstrates the flexing of a kaleidocycle around its ring axis. The four sets of 6 triangular faces are shown in different colours (with every other face in each set of six shown in grey for contrast).
Variations
Beyond 6 sides, higher even number of tetrahedra, 8, 10, 12, etc, can be chained together. These models will leave a central gap, depending on the proportions of the triangle faces.
History
Wallace Walker coined the word kaleidocycle in the 1950s from the Greek kalos (beautiful), eidos (form), and kyklos (ring).
In 1977 Doris Schattschneider and Wallace Walker published a book about them using M.C. Escher patterns.
Cultural uses
The shape was called a flextangle by characters in the 2018 science fantasy adventure film A Wrinkle in Time, which depicted a paper model with its inner faces colored with hearts and patterns which become hidden when those faces are folded together |
https://en.wikipedia.org/wiki/Nanolinux | NanoLinux
is an open source, free and very lightweight Linux distribution that requires only 14 MB of disk space including tiny versions of the most common desktop applications and several games. It is based on the Core version of the Tiny Core Linux
distribution and uses Busybox, Nano-X instead of X.Org, FLTK 1.3.x as the default GUI toolkit, and SLWM (super-lightweight window manager). The included applications are mainly based on FLTK.
Applications included in the distribution
Nanolinux includes several lightweight applications, including:
Dillo graphical web browser
FlWriter word processor
Sprsht spreadsheet application
FLTDJ personal information manager
AntiPaint painting application
Fluff file manager
NXterm terminal emulator
Flcalc calculator
FlView image viewer
Fleditor text editor
FlChat IRC client
FlMusic CD player
FlRadio internet radio
Webserver, mount tool, system statistics, package install utility.
The distribution also includes several games, such as Tuxchess, Checkers, NXeyes, Mastermind, Sudoku and Blocks.
Support for TrueType fonts and UTF-8 is also provided. Nanolinux is distributed as Live CD ISO images, installation on flash disk
and hard disk
is documented on its Wiki pages.
System requirements
Minimal configuration:
The Live CD version without swapfile requires 64 MB of RAM and 14 MB of disk space.
See also
Comparison of Linux live distributions
Lightweight Linux distribution
List of Linux distributions that run from RAM
References
Nanolinux on Softpedia
RedesZone
wordpress.com
External links
Light-weight Linux distributions
Operating system distributions bootable from read-only media
Linux distributions without systemd
Linux distributions |
https://en.wikipedia.org/wiki/Honey%20dill | Honey dill is a condiment consisting of honey, mayonnaise, and dried dill that is unique to Manitoba, Canada. It is often used as a dipping sauce for chicken fingers as well as for sweet potato fries. The sauce was mistakenly invented at Mitzi's Chicken Finger Restaurant in downtown Winnipeg. The restaurant specialized in chicken fingers, the meal for which the sauce is mostly used. Its owner tried to copy a different recipe by taste from another restaurant, but got the recipe wrong. The accidental sauce was so popular at the restaurant, that it took off locally in the province. President's Choice marketed a brand nationally, however, sales outside Manitoba were too slow. Today most production is done by a local Winnipeg producer or in-house at restaurants.
References
Condiments
Food ingredients
Culture of Manitoba
Cuisine of Manitoba |
https://en.wikipedia.org/wiki/Mathai%20Joseph | Mathai Joseph is an Indian computer scientist and author.
Early life and education
Joseph studied for a BSc in physics at Wilson College (Mumbai, India, 1962) and an MSc in the same subject at the University of Mumbai in 1964. He later studied for a Postgraduate Diploma in electronics at the Welsh College of Advanced Technology (1965) and then undertook a PhD in computing at Churchill College, Cambridge under the supervision of David Wheeler (awarded 1968).
From 1968 to 1985, Joseph worked on programming as a fellow and senior research scientist at the Tata Institute of Fundamental Research (Mumbai, India) and then became professor of computer science at the University of Warwick in England for 12 years (1985–97). He returned to India in 1997. He then worked in industry as Executive Director at the Tata Research Development and Design Centre (Pune) and as Executive Vice-President at Tata Consultancy Services (1997–2007).
Career
Joseph was a visiting professor at Carnegie-Mellon University (1980–81), Eindhoven University of Technology (1990–92), the University of Warwick (1997–98), and the University of York (2001–04). He was Board Chair of UNU-IIST (2004–06, United Nations University, Macau). Joseph was the first person from India to be elected to the Council of the ACM. In addition, he was a member of the ACM India Council until 2012. He chaired the ACM India Education Committee until 2014.
Mathai Joseph's main research interest is in the area of formal methods related to computer systems, including real-time systems. His most cited paper, "Finding Response Times in a Real-Time System", with over 1,500 citations on Google Scholar in 2021, was joint work with Paritosh Pandya, published in The Computer Journal in 1986. This paper won a 2020 Test-of-Time Award, announced at the 27th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2021).
Joseph's joint work with Zhiming Liu on fault tolerance gives a formal model that precisely defines the |
https://en.wikipedia.org/wiki/Four-spiral%20semigroup | In mathematics, the four-spiral semigroup is a special semigroup generated by four idempotent elements. This special semigroup was first studied by Karl Byleen in a doctoral dissertation submitted to the University of Nebraska in 1977. It has several interesting properties: it is one of the most important examples of bi-simple but not completely-simple semigroups; it is also an important example of a fundamental regular semigroup; it is an indispensable building block of bisimple, idempotent-generated regular semigroups. A certain semigroup, called double four-spiral semigroup, generated by five idempotent elements has also been studied along with the four-spiral semigroup.
Definition
The four-spiral semigroup, denoted by Sp4, is the free semigroup generated by four elements a, b, c, and d satisfying the following eleven conditions:
a2 = a, b2 = b, c2 = c, d2 = d.
ab = b, ba = a, bc = b, cb = c, cd = d, dc = c.
da = d.
The first set of conditions imply that the elements a, b, c, d are idempotents. The second set of conditions imply that a R b L c R d where R and L are the Green's relations in a semigroup. The lone condition in the third set can be written as d ωl a, where ωl is a biorder relation defined by Nambooripad. The diagram below summarises the various relations among a, b, c, d:
Elements of the four-spiral semigroup
General elements
Every element of Sp4 can be written uniquely in one of the following forms:
[c] (ac)m [a]
[d] (bd)n [b]
[c] (ac)m ad (bd)n [b]
where m and n are non-negative integers and terms in square brackets may be omitted as long as the remaining product is not empty. The forms of these elements imply that Sp4 has a partition Sp4 = A ∪ B ∪ C ∪ D ∪ E where
A = { a(ca)n, (bd)n+1, a(ca)md(bd)n : m, n non-negative integers }
B = { (ac)n+1, b(db)n, a(ca)m(db) n+1 : m, n non-negative integers }
C = { c(ac)m, (db)n+1, (ca)m+1(db)n+1 : m, n non-negative integers }
D = { d(bd)n, (ca)m+1(db)n+1d |
https://en.wikipedia.org/wiki/Rauhan%20Puolesta | Rauhan Puolesta (Finnish: Pro Peace) is a cultural and news magazine published in Helsinki, Finland. It has been circulated since 1957.
History and profile
Rauhan Puolesta was established in 1957. It is published by the Finnish Peace Committee. The magazine, based in Helsinki, appears six times a year and disseminates the news about the committee. The magazine has both in print and online versions. The newsletter of the Africa Committee in Finland is also published in the magazine.
See also
List of magazines in Finland
References
External links
1957 establishments in Finland
Bi-monthly magazines published in Finland
Cultural magazines
Finnish-language magazines
Magazines established in 1957
Magazines published in Helsinki
News magazines published in Europe
Online magazines
Political magazines published in Finland |
https://en.wikipedia.org/wiki/Denjoy%E2%80%93Carleman%E2%80%93Ahlfors%20theorem | The Denjoy–Carleman–Ahlfors theorem states that the number of asymptotic values attained by a non-constant entire function of order ρ on curves going outwards toward infinite absolute value is less than or equal to 2ρ. It was first conjectured by Arnaud Denjoy in 1907.
Torsten Carleman showed that the number of asymptotic values was less than or equal to (5/2)ρ in 1921.
In 1929 Lars Ahlfors confirmed Denjoy's conjecture of 2ρ.
Finally, in 1933, Carleman published a very short proof.
The use of the term "asymptotic value" does not mean that the ratio of that value to the value of the function approaches 1 (as in asymptotic analysis) as one moves along a certain curve, but rather that the function value approaches the asymptotic value along the curve. For example, as one moves along the real axis toward negative infinity, the function approaches zero, but the quotient does not go to 1.
Examples
The function is of order 1 and has only one asymptotic value, namely 0. The same is true of the function but the asymptote is attained in two opposite directions.
A case where the number of asymptotic values is equal to 2ρ is the sine integral , a function of order 1 which goes to −π/2 along the real axis going toward negative infinity, and to +π/2 in the opposite direction.
The integral of the function is an example of a function of order 2 with four asymptotic values (if b is not zero), approached as one goes outward from zero along the real and imaginary axes.
More generally, with ρ any positive integer, is of order ρ and has 2ρ asymptotic values.
It is clear that the theorem applies to polynomials only if they are not constant. A constant polynomial has 1 asymptotic value, but is of order 0.
References
Analytic geometry
Theorems in analysis |
https://en.wikipedia.org/wiki/Bernhard%20Steffen%20%28computer%20scientist%29 | Bernhard Steffen (born 31 May 1958 in Kiel, West Germany) is a German computer scientist and professor at the TU Dortmund University, Germany. His research focuses on various facets of formal methods ranging from program analysis and verification, to workflow synthesis, to test-based modeling, and machine learning.
After his PhD at the University of Kiel he spent two years as a research fellow at the LFCS (Edinburgh, Scotland) where he co-developed the Edinburgh Concurrency Workbench and authored one of the earliest papers on how to adequately model probabilistic processes, before joining the University of Aarhus in 1989 as a postdoc. From 1990 to 1992 he was associate professor at the RWTH Aachen, before he became full professor at the University of Passau. Since 1997 he holds the chair of programming systems at TU Dortmund University where he was Dean of Computer Science between 2002 and 2006 as well as a member of the Senate in 2006 and 2007. In Dortmund he developed the concept of active automata learning to towards a practical means for model-based testing that does not require any a priori models. Recently his interest shifted towards the application of formal methods for explaining machine learning.
His conceptual background comprises abstract interpretation, computer-aided verification and explanation, automata learning, and the development of domain-specific languages that guarantee properties by design. This is witnessed by receiving the Most Influential PLDI Paper Award for Lazy Code Motion, which is given 10 years in retrospective, and the CAV Artifact Award for the Open-Source LearnLib. Finally, in 2019 he was awarded the title of Honorary Professor of the AMITY School of Engineering and Technology.
Furthermore, Steffen is founding Editor in Chief of STTT, Co-Founder of TACAS, ETAPS, ISoLA, RERS and member of the editorial board of LNCS.
Journal and conference foundations
Bernhard Steffen co-founded the following journals and conferences
Tools |
https://en.wikipedia.org/wiki/Ethereum | Ethereum is a decentralized blockchain with smart contract functionality. Ether (Abbreviation: ETH; sign: Ξ) is the native cryptocurrency of the platform. Among cryptocurrencies, ether is second only to bitcoin in market capitalization. It is open-source software.
Ethereum was conceived in 2013 by programmer Vitalik Buterin. Additional founders of Ethereum included Gavin Wood, Charles Hoskinson, Anthony Di Iorio and Joseph Lubin. In 2014, development work began and was crowdfunded, and the network went live on 30 July 2015. Ethereum allows anyone to deploy permanent and immutable decentralized applications onto it, with which users can interact. Decentralized finance (DeFi) applications provide financial instruments which do not directly rely on financial intermediaries like brokerages, exchanges, or banks. This facilitates borrowing against cryptocurrency holdings or lending them out for interest. Ethereum also allows users to create and exchange non-fungible tokens (NFTs), which are tokens that can be tied to unique digital assets, such as images. Additionally, many other cryptocurrencies utilize the ERC-20 token standard on top of the Ethereum blockchain and have utilized the platform for initial coin offerings.
On 15 September 2022, Ethereum transitioned its consensus mechanism from proof-of-work (PoW) to proof-of-stake (PoS) in an upgrade process known as "the Merge". This has cut Ethereum's energy usage by 99%.
History
Founding (2013–2014)
Ethereum was initially described in late 2013 in a white paper by Vitalik Buterin, a programmer and co-founder of Bitcoin Magazine, that described a way to build decentralized applications. Buterin argued to the Bitcoin Core developers that Bitcoin and blockchain technology could benefit from other applications besides money and that it needed a more robust language for application development that could lead to real-world assets, such as stocks and property, to the blockchain. In 2013, Buterin briefly worked with eT |
https://en.wikipedia.org/wiki/Mike%20Little | Mike Little (born 12 May 1962) is an English web developer and writer. He is the co-founder of the free and open source web software WordPress along with Matt Mullenweg.
Biography
Mike Little was born in 1962 to a Nigerian father who was a musician and an English mother in England. He was educated at Stockport School.
In 2003, Little and Matt Mullenweg started working on a project in which they built on b2/cafelog and later named it WordPress, releasing the first version on 27 May 2003.
In June 2013, Little was awarded the SAScon's "Outstanding Contribution to Digital" award for his part in co-founding and developing WordPress.
Bibliography
Douglass, Robert T.; Little, Mike; Smith, Jared W. (2006).Building Online Communities With Drupal, PhpBB, and WordPress
References
External links
Personal site
Living people
Black British people
English people of Nigerian descent
Social entrepreneurs
Web development
Computer programmers
Web developers
1962 births
WordPress
Free software programmers |
https://en.wikipedia.org/wiki/Google%20DeepMind | DeepMind Technologies Limited, doing business as Google DeepMind, is a British-American artificial intelligence research laboratory which serves as a subsidiary of Google. Founded in the UK in 2010, it was acquired by Google in 2014, The company is based in London, with research centres in Canada, France, Germany and the United States.
Google DeepMind has created neural network models that learn how to play video games in a fashion similar to that of humans, as well as Neural Turing machines (neural networks that can access external memory like a conventional Turing machine),, resulting in a computer that loosely resembles short-term memory in the human brain.
DeepMind made headlines in 2016 after its AlphaGo program beat a human professional Go player Lee Sedol, a world champion, in a five-game match, which was the subject of a documentary film. A more general program, AlphaZero, beat the most powerful programs playing go, chess and shogi (Japanese chess) after a few days of play against itself using reinforcement learning. In 2020, DeepMind made significant advances in the problem of protein folding with AlphaFold. In July 2022, it was announced that over 200 million predicted protein structures, representing virtually all known proteins, would be released on the AlphaFold database.
DeepMind posted a blog post on 28 April 2022 on a single visual language model (VLM) named Flamingo that can accurately describe a picture of something with just a few training images. In July 2022, DeepMind announced the development of DeepNash, a model-free multi-agent reinforcement learning system capable of playing the board game Stratego at the level of a human expert. The company merged with Google AI's Google Brain division to become Google DeepMind in April 2023.
History
The start-up was founded by Demis Hassabis, Shane Legg and Mustafa Suleyman in September 2010. Hassabis and Legg first met at the Gatsby Computational Neuroscience Unit at University College London (UCL). |
https://en.wikipedia.org/wiki/TeleSign | Telesign is a company based in Marina Del Rey California, United States providing digital identity and programmable communications APIs to prevent fraud and enable omnichannel engagement. Telesign’s risk-scoring API analyzes phone number attributes acquired during the authentication process to assist companies with onboarding new customers securely and maintaining account integrity. Joe Burton is the current CEO of the company.
History
Founded in 2005 as a Communications Platform as a Service company by Darren Berkovitz, Ryan Disraeli and Stacy Stubblefield, the company pioneered Two-factor authentication services, a secure supplementary method of preventing illicit access to online accounts.
Co-founders Disraeli, Stubblefield and Berkowitz were named as USC alumni entrepreneurs of the year. TeleSign was an early project of the technology incubator Curious Minds.
As of 2014, the company had raised $49 million in funds.
In April 2017, TeleSign announced that it is being acquired by BICS, a Belgium-based company for $230 million.
In December 2021, TeleSign announced it intends to go public via a business combination with North Atlantic Acquisition Corporation (NASDAQ: NAAC).
References
Internet security
Companies based in Los Angeles
Companies established in 2005
2017 mergers and acquisitions |
https://en.wikipedia.org/wiki/Phonetotopy | Phonetotopy is the concept that articulatory features as well as perceptual features of speech sounds are ordered in the brain in a similar way as tone (tonotopy), articulation and its somatosensory feedback (somatotopy), or visual location of an object (retinotopy). It is assumed that a phonetotopic ordering of speech sounds as well as of syllables can be found at a supramodal speech processing level (i.e. at a phonetic speech processing level) within the brain.
The concept of phonetotopy was introduced in Kröger et al. (2009) on the basis of modeling speech production, speech perception, as well as speech acquisition. Moreover, fMRI measurements on ordering of vowels with respect to phonetic features as well as EEG-array measurements on vowel and syllable articulation support this concept.
The concept of phonetotopy at least underpins the concept of distinctive features, which are phonetically based features of speech sounds (i.e. based in perceptual as well as in articulatory domain), but which as well are linguistically (or phonologically) relevant, and thus are realized in a language specific way in humans.
References
Neuroscience
Phonetics
Brain |
https://en.wikipedia.org/wiki/Oncomatryx | Oncomatryx Biopharma S. L. is a pharmaceutical biotechnology company that develops personalized treatments against invasive cancer as well as tests for its early detection. Established by Laureano Simón, PhD, Oncomatryx thus engages twofold in the fight against invasive kinds of cancer, such as pancreatic cancer or invasive breast cancer, all of which have high mortality rates.
Oncomatryx's research focuses on peritumoral stroma, which has been found to take part in promoting cancer invasiveness and curtailing treatment efficacy.
Laureano Simón
Laureano Simón began his business career in 2000 with the creation of Progenika Biopharma S.A., a personalized medicine company which was acquired by Grifols in February 2013.
Dr. Simón holds a Ph.D. in Chemical Sciences (Molecular Biology) by the Universidad Autónoma de Madrid, a master's degree in Biotechnology by the University of Navarra, an MSc by the “University of Wisconsin-Madison” and a bachelor's degree in Pharmacy by the University of Santiago de Compostela. He has patented, among others, clinical products such as BLOODchip and LIPOchip.
Research and development
The company bases its R&D on the recent discovery that tumor cells generate changes in the cells that surround them as well as in the extracellular matrix, facilitating invasion metastases.
Oncomatryx and its collaborators and advisors have proved that peritumoral stroma, which is constituted by mesenchymal cells and extracellular matrix, plays a key role in tumor invasiveness and metastasis, at the same time being a physical barrier that prevents anti-cancer agents from reaching tumor cells.
Oncomatryx is developing a new generation of biological anti-tumor drugs, combining cytotoxic molecules and monoclonal antibodies specifically directed towards tumor associated stroma.
Scientific Advisory Board
Franco Dosio, Ph.D. Professor, Department of Drug Science and Technology. Università degli Studi di Torino. Torino, Italy.
Tomás Girbés, Ph.D. Profes |
https://en.wikipedia.org/wiki/Long%20interspersed%20nuclear%20element | Long interspersed nuclear elements (LINEs) (also known as long interspersed nucleotide elements or long interspersed elements) are a group of non-LTR (long terminal repeat) retrotransposons that are widespread in the genome of many eukaryotes. LINEs contain an internal Pol II promoter to initiate transcription into mRNA, and encode one or two proteins, ORF1 and ORF2. The functional domains present within ORF1 vary greatly among LINEs, but often exhibit RNA/DNA binding activity. ORF2 is essential to successful retrotransposition, and encodes a protein with both reverse transcriptase and endonuclease activity.
LINEs are the most abundant transposable element within the human genome, with approximately 20.7% of the sequences identified as being derived from LINEs. The only active lineage of LINE found within humans belongs to the LINE-1 class, and is referred to as L1Hs. The human genome contains an estimated 100,000 truncated and 4,000 full-length LINE-1 elements. Due to the accumulation of random mutations, the sequence of many LINEs has degenerated to the extent that they are no longer transcribed or translated. Comparisons of LINE DNA sequences can be used to date transposon insertions in the genome.
History of discovery
The first description of an approximately 6.4 kb long LINE-derived sequence was published by J. Adams et al. in 1980.
Classification of LINEs
Based on structural features and the phylogeny of the essential protein ORF2p, LINEs can be separated into six main groups, referred to as R2, RanI, L1, RTE, I and Jockey. These groups can further be subdivided into at least 28 clades.
In plant genomes, so far only LINEs of the L1 and RTE clade have been reported. Whereas L1 elements diversify into several subclades, RTE-type LINEs are highly conserved, often constituting a single family.
In fungi, Tad, L1, CRE, Deceiver and Inkcap-like elements have been identified, with Tad-like elements appearing exclusively in fungal genomes.
All LINEs encode a |
https://en.wikipedia.org/wiki/PSSC%20Labs | PSSC Labs is a California-based company that provides supercomputing solutions in the United States and internationally. Its products include "high-performance" servers, clusters, workstations, and RAID storage systems for scientific research, government and military, entertainment content creators, developers, and private clouds. The company has implemented clustering software from NASA Goddard's Beowulf project in its supercomputers designed for bioinformatics, medical imaging, computational chemistry and other scientific applications.
Timeline
PSSC Labs was founded in 1984 by Larry Lesser. In 1998, it manufactured the Aeneas Supercomputer for Dr. Herbert Hamber of the University of California, Irvine (the physics and astronomy department); it was based on Linux and had a maximum speed of 20.1 Gigaflops.
In 2001, the company developed CBeST, software packages, utilities and custom scripts used to ease the cluster administration process.
In 2003 the company released the third version of its cluster management software with support for 32-bit and 64-bit AMD and Intel processors, Linux kernel and other open source tools.
In 2005, PSSC Labs demonstrated its new water-cooling technology for high-performance computers at the ACM/IEEE Supercomputing Conference in Seattle, Washington.
In 2007 the company focused on supercomputer development for life sciences researchers and announced its technological solution for full-genome data analysis, including assembly, read mapping, and analysis of large amounts of high-throughput DNA and RNA sequencing data.
In 2008 PSSC Labs designed the Powerserve Quattro I/A 4000 supercomputer for genome sequencing. In 2013 it released CloudOOP Server Platform for Big Data Analytics / Hadoop Server which offers up to 50TB of storage space in just 1RU.
The company Joined Cloudera Partner Program the following year and certified the CloudOOP 12000 in 2014 which is compatible with Cloudera Enterprise 5. In the same year MapR started using |
https://en.wikipedia.org/wiki/Henry%20Langdon%20Childe | Henry Langdon Childe (1781–1874) was an English showman, known as a developer of the magic lantern and dissolving views, a precursor of the dissolve in cinematic technique. While the priority question on the technical innovations Childe used is still debated, he established the use of double and triple lanterns for special theatrical effects, to the extent that the equipment involved became generally available through suppliers to other professionals. By the 1840s the "dissolving view", rooted in Gothic horror, had become a staple of illustrated talks with restrained animations.
Early life
Childe was born in Poole, Dorset the youngest of three children. He and his wife Elizabeth had one daughter Maria. She is recorded in the 1851 census as an artist in glass, living in Lambeth with her parents.
Development of lantern technique
Paul de Philipsthal used a magic lantern in London in 1802, for a phantasmagoria; he used effects such as animation of images, and a lantern on rails so that images could be changed in size. Childe reportedly worked for Philipsthal. He demonstrated his own magic lantern at the Sanspareil Theatre which was replaced by 1806, by the Adelphi Theatre.
The magic lantern had not advanced much from the 17th century to the latter part of the 18th century. Childe used achromatic lenses and an improved oil-lamp; and moved to the limelight, then associated with Thomas Drummond. The limelight has also been attributed to Robert Hare, and Goldsworthy Gurney. In Childe's hands, it increased the scale and brightness of the projected images at public performances.
It was the combination of the double image and the improved lighting that made the lantern technique standard for a time; credit for this advance in projection, underpinning "dissolving views" in practice, has been given to John Benjamin Dancer. The innovations of Childe and the instrument-maker Edward Marmaduke Clarke (the "biscenascope") played a part in displacing the diorama as a fashionable |
https://en.wikipedia.org/wiki/NFC%20Institute%20of%20Engineering%20and%20Fertilizer%20Research | The NFC Institute of Engineering and Fertilizer Research (NFC-IEFR) is an oldest engineering institute located in Faisalabad, Punjab, Pakistan. It is affiliated with University of Engineering and Technology, Lahore for awarding of degrees.
Recognition
Accredited by Pakistan Engineering Council.
Affiliated with University of Engineering and Technology, Lahore
Campus
The university is spread over 25 acres. The main building of the institute has administration wing, central library, spectacular air-conditioned auditorium, seminar hall, conference room, IT and linguistic laboratories and research and development department. The academic block is composed of offices for faculty members, classrooms, laboratories and computational lab. For the extension of facilities in the IE&FR campus, a three-story multi purposes block has been constructed, which comprises a large number of multi-disciplined laboratories, classrooms and offices for faculty members.
Academics
Degree programs
The disciplines and the degree programs offered by the institute have been tabulated below. The regular duration of BS and MS/M Phil degree programs is 4 and 2 years, respectively.
Societies
Following is a list of the officially constituted societies:
ASHRAE NFC Faisalabad Student Branch
ASME IE&FR Student Section
IEFRian Forum
Hostel Society
Blood Donors Society
Debating Society
IEEE NFC Student Branch - Lahore Section
Media Club - NFC IEFR (Media)
See also
NFC Institute of Engineering and Technology, Multan
References
External links
Engineering universities and colleges in Pakistan
Research institutes in Pakistan
Universities and colleges in Faisalabad District
Engineering research institutes
Educational institutions established in 1998
1998 establishments in Pakistan |
https://en.wikipedia.org/wiki/Kihara%20Memorial%20Foundation%20Academic%20Award | The is an award for biological sciences in Japan. It is awarded annually by the Kihara Memorial Yokohama Foundation for the Achievement of Life Sciences, to commemorate Hitoshi Kihara, Japan's pioneer geneticist.
Award information
The Kihara Memorial Foundation Award is presented to young researchers who have conducted outstanding original research in life sciences. At the annual award presentation held at the Kihara Institute for Biological Research, winners receive 2 million yen, a diploma, and a silver statuette of Benthamidia japonica (Japanese flowering dogwood).
Award winners
Notable award winners are:
1993: Taisei Nomura, Osaka University
1994: Makoto Asashima, University of Tokyo
1995: Takashi Gojobori, National Institute of Genetics
1999: Takao Kondo, Nagoya University
2001: Kunihiro Matsumoto, Nagoya University
2002: Shigeo Ohno, Yokohama City University
2006: Nobuki Matsuoka, Nagoya University
2009: Takashi Araki, Kyoto University
2011: Ken Shirasu, RIKEN
2014: Yukiko Goto, University of Tokyo
See also
List of biology awards
References
External links
Awards established in 1993
Biology awards
Early career awards
Foundations based in Japan
Japanese science and technology awards |
https://en.wikipedia.org/wiki/Open%20Data%20Description%20Language | The Open Data Description Language (OpenDDL) is a generic text-based language that is designed to store arbitrary data in a concise human-readable format. It can be used as a means for easily exchanging information among many programs or simply as a method for storing a program's data in an editable format.
The exact syntax of OpenDDL is described on the website openddl.org as well as in an appendix of the Open Game Engine Exchange Specification.
Structures
An OpenDDL file is composed of a sequence of structures that can be either user-defined types or built-in primitive data types. The declaration of a structure consists of an identifier followed by an optional name, an optional property list, and finally, the structure's contents enclosed in braces. Raw data is always contained within structures whose identifiers are one of the data types described in the next section. For example, one may define a Point structure that holds the floating-point coordinates of a three-dimensional point as follows.
Point
{
float {1.0, 2.0, 3.0}
}
Structures can have names that allow them to be referenced from other parts of the file. Names can be global (unique throughout the file) or local (unique within the enclosing structure). A global name consists of a dollar sign followed by an identifier, and a local name consists of a percent sign followed by a dollar sign. The Point structure above could be given the global name "position" as follows.
Point $position
{
float {1.0, 2.0, 3.0}
}
Another structure could then include a reference to this point by using the ref data type:
ref {$position}
Data types
OpenDDL defines the 15 primitive data types described in the following table. Each type has at a long name and a short name. Additionally, the floating-point types each have alternate long and short names.
Compatible Libraries
Official OpenDDL Library
References
External links
Official OpenDDL website
Data serialization formats
Open formats |
https://en.wikipedia.org/wiki/Clock%20Constraints%20Specification%20Language | The Clock Constraint Specification Language or CCSL, is a software language for modeling relations among so-called clocks. It is part of the time model defined in the UML Profile for MARTE.
CCSL provides a concrete syntax to handle logical clocks. The term logical clock refers to Leslie Lamport's logical clocks and its usage in CCSL is directly inspired from Synchronous programming languages (like Esterel or Signal).
A solver of CCSL constraints is implemented in the TimeSquare tool.
References
Time
Unified Modeling Language |
https://en.wikipedia.org/wiki/Parted%20Magic | Parted Magic is a commercial Linux distribution based on Slackware that comes with disk partitioning and data recovery tools. It is sold as a Linux-based bootable disk. The distribution's nomenclature is derived from the names of the GNU Parted and PartitionMagic software packages.
Features
The program is directly bootable from a CD, USB flash drive, or through a network using PXE on PC hardware, and does not require installation, or the presence of an installed operating system.
Although originally designed for mechanical hard disk drives, Parted Magic is suitable for use also with solid state drives and can perform an ATA Secure Erase (a method that is built into the hard drive controller to return the drive into its factory state).
Parted Magic supports reading and writing to a variety of modern file systems, including ext3, ext4, FAT, exFAT, and NTFS, and as such is able to access disk drives formatted for use under Microsoft Windows and Linux systems.
The software distribution includes networking support, and comes with the Firefox web browser.
System requirements
As of version 11.11.11, Parted Magic supports x86-64 processors natively (32-bit x86 processors were previously supported), and requires a computer with at least a 64-bit Intel-compatible processor and 2GB of RAM. Secure boot is also supported. x86 versions from 2013_09_26 do not require the Physical Address Extension (PAE) computer processor feature.
All versions starting from 2020_08_23 no longer support 32-bit x86 systems.
Availability
Up to version 2013.08.01 the distribution was freely available for download from the official website and the project page on SourceForge. The distribution moved to a pay-for-download business model, despite the packaged software being free and open source.
See also
SystemRescue – completely libre and free-to-download Live CD/USB system rescue disc
gparted – partition editor included with Parted Magic
Disk partitioning
List of disk partitioning software
|
https://en.wikipedia.org/wiki/Paritosh%20Pandya | Paritosh K. Pandya is an Indian computer scientist based at the Tata Institute of Fundamental Research (TIFR) in Mumbai, India. Since 2020, he is an adjunct professor at IIT Bombay.
Paritosh Pandya studied for a BE degree in Electronics at the Maharaja Sayajirao University of Baroda (1980), MTech degree in Computer Science at IIT Kanpur (1982), and a PhD in Computer Science at Bombay University/TIFR (1988).
From 1988, Paritosh Pandya has held academic posts at TIFR. He was a researcher at the Oxford University Computing Laboratory in England during 1989–91, on leave from TIFR, undertaking research with Jonathan Bowen, Jifeng He, and Tony Hoare, amongst others, as part of the ESPRIT ProCoS project on "Provably Correct Systems". He then returned to TIFR, where he has spent most of his career. Pandya leads the Theoretical Computer Science Group there.
Pandya's main research interest is in the area of formal methods, including real-time systems. He has been especially involved with research concerning Duration Calculus, including the DCVALID model-checking tool. His most cited paper, "Finding Response Times in a Real-Time System", with over 1,500 citations on Google Scholar in 2021, was joint work with Mathai Joseph, published in The Computer Journal in 1986. This paper won a 2020 Test-of-Time Award, announced at the 27th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2021).
Paritosh Pandya has been a member of the Editorial Board for the Formal Aspects of Computing journal published by Springer.
References
External links
Paritosh Pandya on Mendeley
Year of birth missing (living people)
Living people
Place of birth missing (living people)
Maharaja Sayajirao University of Baroda alumni
IIT Kanpur alumni
University of Mumbai alumni
Tata Institute of Fundamental Research alumni
Indian computer scientists
Theoretical computer scientists
Formal methods people
Members of the Department of Computer Science, University of Oxford
Academ |
https://en.wikipedia.org/wiki/AAA%20%28video%20game%20industry%29 | In the video game industry, AAA (Triple-A) is an informal classification used to classify video games produced and distributed by a mid-sized or major publisher, which typically have higher development and marketing budgets than other tiers of games. In the mid-2010s, the term "AAA+" was used to describe AAA type games that generated additional revenue over time, in a similar fashion to massively multiplayer online games, by using games-as-a-service methods such as season passes and expansion packs. The similar construction "III" (Triple-I) has also been used to describe high-production-value games in the indie game industry.
History
The term "AAA" began to be used in the late 1990s, when a few development companies started using the expression at gaming conventions in the US. The term was borrowed from the credit industry's bond ratings, where "AAA" bonds represented the safest opportunity most likely to meet their financial goals.
One of the first video games to be produced at a blockbuster or AAA scale was Squaresoft's Final Fantasy VII (1997), which cost an estimated (inflation adjusted ) to develop, making it the most expensive video game ever produced up until then, with its unprecedented cinematic CGI production values, movie-like presentation, orchestral music, and innovative blend of gameplay with dynamic cinematic camerawork. Its expensive advertisement campaign was also unprecedented for a video game, with a combined production and marketing budget estimated to be (inflation adjusted ). Its production budget record was later surpassed by Sega AM2's Shenmue (1999), estimated to have cost (inflation adjusted ).
By the seventh generation of video game consoles (late 2000s), AAA game development on the Xbox 360 or PlayStation 3 game consoles typically cost in the low tens of millions of dollars ($15m to $20m) for a new game, with some sequels having even higher total budgets – for example Halo 3 is estimated to have had a development cost of $30m, a |
https://en.wikipedia.org/wiki/International%20Principles%20on%20the%20Application%20of%20Human%20Rights%20to%20Communications%20Surveillance | The International Principles on the Application of Human Rights to Communications Surveillance (also called the "Necessary and Proportionate Principles" or just "the Principles") is a document which attempts to "clarify how international human rights law applies in the current digital environment".
Communications surveillance (that is to say, mass surveillance of communications) conflicts with a number of international human rights, mainly that of privacy. As a result, communications surveillance may only occur when prescribed by law necessary to achieve legitimate aim, and proportionate to the aim used.
The document consists of 13 principles developed to provide society groups, industry, governments, and others with a framework to assess whether current and proposed surveillance laws or statutes conflict with International Human Rights law.
History
The inception of the principles occurred as a result of a meeting between over 40 experts in privacy and security in Brussels, October 2012. After the initial consultation, a second meeting in Rio de Janeiro took place in December 2012 with the participation of the United Nations Special Rapporteur. Global consultation followed via conference calls every month between January and May 2013.
The drafting process, led by Access Now, EFF and Privacy International, along with several NGO's, Criminal Lawyers, Human rights advocates and privacy advocates were finalized and published for the first time on 10 July 2013 online at www.necessaryandproportionate.org.
In September 2013 at the 24th session of the UN Human Rights Council in Geneva, they were launched officially.
The principles have now been adopted globally by more than 400 organizations. The global adoption necessitated a number of primarily superficial textual changes in the language of the document for the purposes of translation. This occurred between March and May 2014.
The effect and intention of the principles remained the same, and the final and authorita |
https://en.wikipedia.org/wiki/Kimchi%20%28software%29 | Kimchi is a web management tool to manage Kernel-based Virtual Machine (KVM) infrastructure. Developed with HTML5, Kimchi is developed to intuitively manage KVM guests, create storage pools, manage network interfaces (bridges, VLANs, NAT), and perform other related tasks. The name is an extended acronym for KVM infrastructure management. It is an Apache-licensed project hosted on GitHub, and incubated by oVirt.org.
References
Kimchi Page @ Github
Kimchi @ KVM Forum Presentation by Adam Litke
Kimchi announcement @ Developers Works
Kimchi being submitted as oVirt incubated project
Virtualization software
Web development |
https://en.wikipedia.org/wiki/Power%20management%20system | On marine vessels the Power Management System PMS is in charge of controlling the electrical system. Its task is to make sure that the electrical system is safe and efficient. If the power consumption is larger than the power production capacity, load shedding is used to avoid blackout. Other features could be to automatic start and stop consumers (e.g., diesel generators) as the load varies.
A complete switchboard and generator control system
The marine Power Management System PMS is a complete switchboard and generator control system to synchronize the auxiliary engines of the ships by implementing automatic load sharing and optimizing the efficiency of the power plant. It handles various configurations of generators driven by diesel engines, steam turbines, and main engines in combination with switchboards of various complexity.
Power Management System PMS Operation
Electrical energy in any combination of the Generators is implemented according to calculations of the electric power tables of each vessel. PMS System decides which Generators combination will be the best according to the Load Consumptions. The capacity of the Generators is such that in the event of any one generating set will be stopped then it will still be possible to supply all services necessary to provide normal operational conditions of propulsion and safety. Furthermore, it will be sufficient to start the largest motor of the ship without causing any other motor to stop or having any adverse effect on other equipment in operation. In general a PMS Power Management System performs the following functions on a Ship:
Automatic Synchronizing
Automatic Load Sharing
Automatic Start/Stop/Stby Generators according to Load Demand
Large Motors Automatic Blocking
Load Analysis and Monitoring
Three (3) Phase Management and Voltage Matching
Redundant Power Distribution
Frequency Control
Blackout Start
Selection of Generators Priority (first leading main, second and third stby generator in se |
https://en.wikipedia.org/wiki/MANIC%20%28cognitive%20architecture%29 | MANIC, formerly known as PMML.1, is a cognitive architecture developed by the predictive modeling and machine learning laboratory at University of Arkansas. It differs from other cognitive architectures in that it tries to "minimize novelty". That is, it attempts to organize well-established techniques in computer science, rather than propose any new methods for achieving cognition. While most other cognitive architectures are inspired by some neurological observation, and are subsequently developed in a top-down manner to behave in some manner like a brain, MANIC is inspired only by common practices in computer science, and was developed in a bottom-up manner for the purpose of unifying various methods in machine learning and artificial intelligence.
Overview
At the highest level, MANIC describes a software agent that, supposedly, will exhibit cognitive intelligence. The agent's artificial brain comprises two major components: a learning system and a decision-making system.
Learning system
The learning system models the agent's environment as a dynamical system. It consists of an "observation function", which maps from the agent's current beliefs to predicted observations, and a "transition function", which maps from current beliefs to future beliefs in the next time-step. The observation function is implemented with a generative deep learning architecture. It is trained in an unsupervised manner from the observations that the agent makes. The intrinsic representations of those observations become the agents "beliefs". The transition function is trained in a supervised manner, to predict the next beliefs from the current ones. The entire learning system is based loosely on a 2011 paper by Michael S. Gashler that describes a method for training a deep neural network to model a simple dynamical system from visual observations.
Decision-making system
The decision-making system consists of a planning module and a contentment function. The planning module uses an evo |
https://en.wikipedia.org/wiki/Software-defined%20perimeter | A software-defined perimeter (SDP), also called a "black cloud", is an approach to computer security which evolved from the work done at the Defense Information Systems Agency (DISA) under the Global Information Grid (GIG) Black Core Network initiative around 2007. Software-defined perimeter (SDP) framework was developed by the Cloud Security Alliance (CSA) to control access to resources based on identity. Connectivity in a Software Defined Perimeter is based on a need-to-know model, in which device posture and identity are verified before access to application infrastructure is granted. Application infrastructure is effectively “black” (a DoD term meaning the infrastructure cannot be detected), without visible DNS information or IP addresses. The inventors of these systems claim that a Software Defined Perimeter mitigates the most common network-based attacks, including: server scanning, denial of service, SQL injection, operating system and application vulnerability exploits, man-in-the-middle, pass-the-hash, pass-the-ticket, and other attacks by unauthorized users.
Background
The premise of the traditional enterprise network architecture is to create an internal network separated from the outside world by a fixed perimeter that consists of a series of firewall functions that block external users from coming in, but allows internal users to get out. Traditional fixed perimeters help protect internal services from external threats via simple techniques for blocking visibility and accessibility from outside the perimeter to internal applications and infrastructure. But the weaknesses of this traditional fixed perimeter model are becoming ever more problematic because of the popularity of user-managed devices and phishing attacks, providing untrusted access inside the perimeter, and SaaS and IaaS extending the perimeter into the internet. Software defined perimeters address these issues by giving application owners the ability to deploy perimeters that retain the |
https://en.wikipedia.org/wiki/Oracle%20Advertising | Oracle Advertising, formerly Datalogix, is a cloud-based consumer data collection, activation, and measurement platform for use by digital advertisers. Datalogix was a consumer data collection company based in Westminster, Colorado that provided offline consumer spending data to marketers. In December 2014, Oracle signed an agreement to acquire Datalogix. After the acquisition, Datalogix's name changed to Oracle Data Cloud, which later became Oracle Advertising. Oracle Advertising is part of the Oracle Advertising and Customer Experience (CX) application suite.
This collected data, which includes purchase data from stores, credit cards, and loyalty cards, helps marketing teams determine their ad campaigns' effectiveness and those that will potentially increase profits, with Datalogix clients including retail stores, grocers, travel agencies, PepsiCo, Ford, and the Dr. Pepper Snapple Group. After consumer spending behaviors are measured, the information is sold to advertising companies and publishers, such as Facebook, Google, Twitter, Snapchat, and Pinterest. Advertisers then use the information obtained to tailor online ads and reach new or existing customers. In turn, publishers use the data to determine the amount of profit advertisers earn and to convince them to purchase more ads that will feature on their websites. Advertisers and publishers have used Datalogix to help increase profits, as the use of digital media continues to expand.
In 2017, Oracle also acquired Moat, an ad measurement company, which also became part of Oracle Data Cloud, now Oracle Advertising. The Moat acquisition added measurement and analytics capabilities to allow advertisers to track and measure media, as well as the performance of interactions with online ads.
BlueKai, acquired by Oracle in 2014, is a cloud-based data collection platform that uses website cookies to collect online tracking data. The tracking data is then used by marketers to target users with ads specific to their |
https://en.wikipedia.org/wiki/OpenAutonomy | OpenAutonomy is a protocol facilitating decentralized social networking and other web services. The design of the system allows users to interoperate across different internet servers and domains with no central mediating authority. Further, each user can also possess application instances running on different internet servers and domains yet still interacting with each other across these boundaries.
The intent of the technology and its users is to build a distributed, federated, extensible web platform to compete with the current "walled garden" approach. The idea is to break the boundaries between services/servers and web/native and allowing everything to inter-operate with an emphasis on: extensibility, innovation, privacy, and freedom.
OpenAutonomy Applications/Use-Cases
OpenAutonomy currently has innate applications which lend themselves to several use-cases where users are in full control of their content with the use of trust groups: a social networking application, an event application which is used to announce events and add photos from those events which can then be shared, a personal cloud storage location with the option of file collaboration, a messaging system to message other users and the ability to add personal and general RSS feeds catering to a user's own interests from anywhere on the web for a user's own as well as potentially collaborative shared use.
As the OpenAutonomy user base is distributed across multiple internet domains, a federated login system is provided to allow these users to interact as first-class entities on any OpenAutonomy server.
Anyone can run an OpenAutonomy server or extend the capabilities of existing servers and applications by defining their own application protocols.
As of February 9th, 2020, the hyperlink to the website redirects to a DNS sales company.
See also
Comparison of software and protocols for distributed social networking
References
External links
Open Autonomy Inc. (runs the reference implemen |
https://en.wikipedia.org/wiki/Cook%20Islands%20Natural%20Heritage%20Trust | The Cook Islands Natural Heritage Trust is a programme of the Government of the Cook Islands to collect and integrate scientific and traditional information on local organisms (plants, animals and microbes) and related subjects (geology, ethnography etc...); which can be accessed at the Cook Islands Biodiversity database. The programme and driving force behind the CINHT is Gerald McCormack. Originally the Cook Islands Natural Heritage Project, the programme came about when Gerald felt, in the course of his educational work, that there should be a list of the local flora and fauna available to locals. This modest goal expanded over the years and continues to expand with Gerald at the helm.
The Natural Heritage Project was initiated by Sir Geoffrey Henry within his Prime Minister's Department in 1990. The Project moved into the Natural Heritage Trust when it was established in 1999 by an Act of Parliament. At this time the project employed its first assistant - funded by NZ Ministry of Foreign Affairs & Trade, and administered by Volunteer Service Abroad - a taxonomic specialist graduate from New Zealand to work with Gerald on identifying and entering species into the developing multimedia database of flora and fauna. See more about the Cook Islands Biodiversity database.
The primary funding for the trust and its database is from the Cook Islands Government. In addition, there has been essential funding from NZAID, SDC, Bishop Museum, PBIN, GEF, and UNDP.
Gerald McCormack is Director of the Cook Islands Natural Heritage Trust and was coordinator of the project to transfer the Rimatara lorikeet (kura in Cook Islands Māori) at Atiu to establish a reserve population.
References
External links
Cook Islands Biodiversity & Natural Heritage
Biodiversity
Environment of the Cook Islands |
https://en.wikipedia.org/wiki/Server%20Base%20System%20Architecture | The Server Base System Architecture (SBSA) is a hardware system architecture for servers based on 64-bit ARM processors.
Rationale
Historically, ARM-based products have often been tailored for specific applications and power profiles. Variation between ARM-based hardware platforms has been an impediment requiring operating system adjustments for each product.
The SBSA seeks to strengthen the ARM ecosystem by specifying a minimal set of standardized features so that an OS built for this standard platform should function correctly without modification on all hardware products compliant with the specification.
Features
CPU features
Memory management
Peripheral access
Interrupts
Watchdog (errant system detection)
Existing specifications for USB, PCIe, ACPI, TPM, and other standards are incorporated to solidify the specification.
Server Base Boot Requirements
Firmware issues are addressed separately in the Server Base Boot Requirements (SBBR) specification.
Platform validation
The Architecture Compliance Suite (ACS) checks whether an environment is compliant with the SBSA specification, and is provided under an Apache 2 open source license. It is available at https://github.com/ARM-software/sbsa-acs.
Compliance levels
The specification defines levels of compliance, with level 0 being the most basic, and successive levels building on prior levels. In the words of the spec, "Unless explicitly stated, all specification items belonging to level N apply to levels greater than N."
Level 0, 1, and 2
Levels 0, 1, and 2 have been deprecated and folded into level 3.
Level 3
Level 3 contains base-level specifications for:
PE (Processing Element--a core) features
Memory map
Interrupt controller
PPI (peripheral interrupt) assignments
MMU behavior
Clock and timer subsystem
Wake up semantics
Power state semantics
Watchdogs
Peripheral subsystems
Level 4
Extends level 3, e.g. with support for RAS fault recovery extensions of ARMv8.2 spec.
Leve |
https://en.wikipedia.org/wiki/Moduli%20stack%20of%20principal%20bundles | In algebraic geometry, given a smooth projective curve X over a finite field and a smooth affine group scheme G over it, the moduli stack of principal bundles over X, denoted by , is an algebraic stack given by: for any -algebra R,
the category of principal G-bundles over the relative curve .
In particular, the category of -points of , that is, , is the category of G-bundles over X.
Similarly, can also be defined when the curve X is over the field of complex numbers. Roughly, in the complex case, one can define as the quotient stack of the space of holomorphic connections on X by the gauge group. Replacing the quotient stack (which is not a topological space) by a homotopy quotient (which is a topological space) gives the homotopy type of .
In the finite field case, it is not common to define the homotopy type of . But one can still define a (smooth) cohomology and homology of .
Basic properties
It is known that is a smooth stack of dimension where is the genus of X. It is not of finite type but locally of finite type; one thus usually uses a stratification by open substacks of finite type (cf. the Harder–Narasimhan stratification), also for parahoric G over curve X see and for G only a flat group scheme of finite type over X see.
If G is a split reductive group, then the set of connected components is in a natural bijection with the fundamental group .
The Atiyah–Bott formula
Behrend's trace formula
This is a (conjectural) version of the Lefschetz trace formula for when X is over a finite field, introduced by Behrend in 1993. It states: if G is a smooth affine group scheme with semisimple connected generic fiber, then
where (see also Behrend's trace formula for the details)
l is a prime number that is not p and the ring of l-adic integers is viewed as a subring of .
is the geometric Frobenius.
, the sum running over all isomorphism classes of G-bundles on X and convergent.
for a graded vector space , provided the series on the right absolut |
https://en.wikipedia.org/wiki/Honey%20encryption | Honey encryption is a type of data encryption that "produces a ciphertext, which, when decrypted with an incorrect key as guessed by the attacker, presents a plausible-looking yet incorrect plaintext password or encryption key."
Creators
Ari Juels and Thomas Ristenpart of the University of Wisconsin, the developers of the encryption system, presented a paper on honey encryption at the 2014 Eurocrypt cryptography conference.
Method of protection
A brute-force attack involves repeated decryption with random keys; this is equivalent to picking random plaintexts from the space of all possible plaintexts with a uniform distribution. This is effective because even though the attacker is equally likely to see any given plaintext, most plaintexts are extremely unlikely to be legitimate i.e. the distribution of legitimate plaintexts is non-uniform. Honey encryption defeats such attacks by first transforming the plaintext into a space such that the distribution of legitimate plaintexts is uniform. Thus an attacker guessing keys will see legitimate-looking plaintexts frequently and random-looking plaintexts infrequently. This makes it difficult to determine when the correct key has been guessed. In effect, honey encryption "[serves] up fake data in response to every incorrect guess of the password or encryption key."
The security of honey encryption relies on the fact that the probability of an attacker judging a plaintext to be legitimate can be calculated (by the encrypting party) at the time of encryption. This makes honey encryption difficult to apply in certain applications e.g. where the space of plaintexts is very large or the distribution of plaintexts is unknown. It also means that honey encryption can be vulnerable to brute-force attacks if this probability is miscalculated. For example, it is vulnerable to known-plaintext attacks: if the attacker has a crib that a plaintext must match to be legitimate, they will be able to brute-force even Honey Encrypted data i |
https://en.wikipedia.org/wiki/Port%20Control%20Protocol | Port Control Protocol (PCP) is a computer networking protocol that allows hosts on IPv4 or IPv6 networks to control how the incoming IPv4 or IPv6 packets are translated and forwarded by an upstream router that performs network address translation (NAT) or packet filtering. By allowing hosts to create explicit port forwarding rules, handling of the network traffic can be easily configured to make hosts placed behind NATs or firewalls reachable from the rest of the Internet (so they can also act as network servers), which is a requirement for many applications.
Additionally, explicit port forwarding rules available through PCP allow hosts to reduce the amount of generated traffic by eliminating workarounds in form of outgoing NAT keepalive messages, which are required for maintaining connections to servers and for various NAT traversal techniques such as TCP hole punching. At the same time, less generated traffic reduces the power consumption, directly improving the battery runtime for mobile devices.
PCP was standardized in 2013 as a successor to the NAT Port Mapping Protocol (NAT-PMP), with which it shares similar protocol concepts and packet formats. PCP adds support for IPv6 and additional NAT scenarios.
In environments where a Universal Plug and Play Internet Gateway Device (UPnP IGD) is used in the local network, an interworking function between the UPnP IGD and PCP is required to be embedded in the IGD. The UPnP IGD-PCP Interworking Function is specified in RFC6970.
DHCP (IPv4 and IPv6) options to configure hosts with Port Control Protocol (PCP) server IP addresses are specified in RFC7291. The procedure to follow for selecting a server among a list of PCP servers is discussed in RFC7488.
In environments where NAT64 is deployed, PCP allows to learn the IPv6 prefix(es) used by a PCP-controlled NAT64 device to build IPv4-converted IPv6 addresses by the NAT64 (RFC7225).
Overview
Many applications and network equipment deployments require their network loc |
https://en.wikipedia.org/wiki/Colonel%20Meow | Colonel Meow (October 11, 2011 – January 29, 2014) was an American Himalayan–Persian crossbreed cat, who temporarily held the 2014 Guinness world record for the longest fur on a cat (nine inches or about 23 cm). He became an Internet celebrity when his owners posted pictures of his scowling face to Facebook and Instagram. He was lovingly known by his hundreds of thousands of followers as an "adorable fearsome dictator", a "prodigious Scotch drinker" and "the angriest cat in the world".
Background
Colonel Meow was rescued by Seattle Persian and Himalayan Rescue and was later adopted at a Petco by his owner Anne Avey. He rose to internet fame after his owner posted a picture of his angry-looking scowl to Facebook and Instagram.
Health complications and death
In November 2013, Colonel Meow was hospitalized due to heart problems and underwent a difficult surgery and blood transfusion. On January 30, 2014, his owner announced on Facebook that Colonel Meow had died. She also expressed gratitude for the support of his more than 350,000 followers.
In July 2014, Friskies posted an ad entitled "Cat Summer" and announced that for each view they would donate one meal to needy cats in Colonel Meow's name. The video stars Grumpy Cat as well as other famous internet cats.
See also
Lil Bub
List of individual cats
Notes
References
External links
Colonel Meow in Guinness World Records 2014
Colonel Meow #10 of 101 Best Instagram Cats to Follow and Love
2014 animal deaths
American Internet celebrities
Animals on the Internet
Biological records
Cats in popular culture
Individual cats in the United States
Internet memes about cats
Male mammals
World record holders |
https://en.wikipedia.org/wiki/Harder%E2%80%93Narasimhan%20stratification | In algebraic geometry and complex geometry, the Harder–Narasimhan stratification is any of a stratification of the moduli stack of principal G-bundles by locally closed substacks in terms of "loci of instabilities". In the original form due to Harder and Narasimhan, G was the general linear group; i.e., the moduli stack was the moduli stack of vector bundles, but, today, the term refers to any of generalizations. The scheme-theoretic version is due to Shatz and so the term "Shatz stratification" is also used synonymously. The general case is due to Behrend.
References
Further reading
Nitin Nitsure, Schematic Harder-Narasimhan Stratification
Algebraic geometry
Stratifications |
https://en.wikipedia.org/wiki/Chemical%20Engineering%20Science | Chemical Engineering Science is a peer-reviewed scientific journal covering all aspects of chemical engineering. It is published by Elsevier and was established in 1951. The editor-in-chief is A.P.J. Middelberg (University of Queensland).
Abstracting and indexing
The journal is abstracted and indexed in:
According to the Journal Citation Reports, the journal has a 2019 impact factor of 3.871.
References
External links
Chemical engineering journals
Elsevier academic journals
Academic journals established in 1951
Semi-monthly journals
English-language journals |
https://en.wikipedia.org/wiki/Isotropic%20solid | In condensed matter physics and continuum mechanics, an isotropic solid refers to a solid material for which physical properties are independent of the orientation of the system. While the finite sizes of atoms and bonding considerations ensure that true isotropy of atomic position will not exist in the solid state, it is possible for measurements of a given property to yield isotropic results, either due to the symmetries present within a crystal system, or due to the effects of orientational averaging over a sample (e.g. in an amorphous solid or a polycrystalline metal). Isotropic solids tend to be of interest when developing models for physical behavior of materials, as they tend to allow for dramatic simplifications of theory; for example, conductivity in metals of the cubic crystal system can be described with single scalar value, rather than a tensor. Additionally, cubic crystals are isotropic with respect to thermal expansion and will expand equally in all directions when heated.
Isotropy should not be confused with homogeneity, which characterizes a system’s properties as being independent of position, rather than orientation. Additionally, all crystal structures, including the cubic crystal system, are anisotropic with respect to certain properties, and isotropic to others (such as density).
The anisotropy of a crystal’s properties depends on the rank of the tensor used to describe the property, as well as the symmetries present within the crystal. The rotational symmetries within cubic crystals, for example, ensure that the dielectric constant (a 2nd rank tensor property) will be equal in all directions, whereas the symmetries in hexagonal systems dictate that the measurement will vary depending on whether the measurement is made within the basal plane. Due to the relationship between the dielectric constant and the optical index of refraction, it would be expected for cubic crystals to be optically isotropic, and hexagonal crystals to be optically anis |
https://en.wikipedia.org/wiki/Mega%20Builders | Mega Builders is a documentary television series appearing on the Discovery Channel and Science Channel. Each episode takes a look into the people and the machines involved into the construction of many huge engineering projects.
Episode list
Season 1
Season 2
Season 3
Season 4
Season 5
Reception
See also
Extreme Engineering
Megastructures (TV series)
Ultimate Factories
External links
Engineering projects
Discovery Channel (Canada) original programming
Documentary television series about industry
Construction in the United States
Channel 5 documentary series
2005 Canadian television series debuts
2010 Canadian television series endings
2000s Canadian documentary television series |
https://en.wikipedia.org/wiki/Hamnet%20Holditch | Rev. Hamnet Holditch, also spelled Hamnett Holditch (1800 – 12 December 1867), was an English mathematician who was President of Gonville and Caius College, Cambridge. In 1858, he introduced the result in geometry now known as Holditch's theorem.
Hamnet Holditch was born in 1800 in King's Lynn, the son of George Holditch, pilot and harbour-master. Educated at King's Lynn Grammar School under Rev. Martin Coulcher, he matriculated at Gonville and Caius College, Cambridge in 1818, and graduated B.A. in 1822 (Senior Wrangler and 1st Smith's Prize), M.A. in 1825.
At Gonville and Caius College, Holditch was a junior fellow from 1821 and a senior fellow from 1823, and held the college posts of lecturer in Hebrew and Greek, registrar, steward, salarist (1823–28), bursar (1828–31), and President (1835–67).
He died at Gonville and Caius College on 12 December 1867, aged 67, and was buried at North Wootton.
Although Holditch produced ten mathematical papers, he was extremely idle as a tutor. John Venn, an undergraduate at Caius in the 1850s then a Caius Fellow from 1857, noted that Holditch, despite his succession of college offices, "beyond a few private pupils, never took part in educational work":
He was the only son of George Holditch, and had two sisters.
Bibliography
Rev. Hamnett Holditch, "Concise Demonstration of the Property of the Parabola", The London and Edinburgh Philosophical Magazine and Journal of Science, vol. 10, 1837, pp. 35–36. (Google Books)
Hamnett Holditch, "On Rolling Curves", Transactions of the Cambridge Philosophical Society, vol. 7, (1842), pp. 61–86. (Google Books)
Rev. H. Holditch, "On Small Finite Oscillations", Transactions of the Cambridge Philosophical Society, Volume the Eighth, Cambridge, 1849, pp. 89–104. (Google Books)
Rev. Hamnet Holditch, "On the Caustic by Reflection from a Spherical Surface", The Quarterly Journal of Pure and Applied Mathematics, vol. 1, London, 1857, pp. 93–111. (Google Books)
Rev. Hamnet Holditch, "Geometrical |
https://en.wikipedia.org/wiki/Gesture%20Description%20Language | Gesture Description Language (GDL or GDL Technology) is a method of describing and automatic (computer) syntactic classification of gestures and movements created
by doctor Tomasz Hachaj (PhD) and professor Marek R. Ogiela(PhD, DSc).
GDL uses context-free formal grammar named GDLs (Gesture Description Language script). With GDLs it is possible to define rules that describe set of gestures. Those rules play similar role as rules in classic expert systems. With rules it is possible to define static body positions (so called key frames) and sequences of key frames that create together definitions of gestures or movements. The recognition is done by forward chaining inference engine.
The latest GDL implementations utilize Microsoft Kinect controller and enable real time classification. The license for GDL-based software allows using those programs for educational and scientific purposes for free.
References
Classification algorithms
Formal languages
Gesture recognition |
https://en.wikipedia.org/wiki/Virginia%20Walbot | Virginia Walbot (born 1946) is an American agriculturalist and botanist who is a professor in the Department of Biology at Stanford University. She investigates maize development with a focus on factors involved in male sterility.<ref>[Wang, Dongxue, David S. Skibbe, and Virginia Walbot. "Maize Male Sterile 8 (Ms8), A Putative Β-1,3-Galactosyltransferase, Modulates Cell Division, Expansion, And Differentiation During Early Maize Anther Development." Plant Reproduction 26.4 (2013): 329-338. Academic Search Premier. Web. 1 Feb. 2014.]</ref>
Life
Walbot first began working with corn when she used to help grow and sell it on her family's farm in Southern California. Later in the 1970s she met Barbara McClintock, who was very influential. That is when Walbot began visiting McClintock's lab in Cold Spring Harbor and became devoted to studying maize development and reproduction.
In 1967, Walbot received a B.A. degree in biology at Stanford University. In 1969–1972, attended Yale to work on embryogenesis, where she earned an M.Phil. and Ph.D. She attended the University of Georgia on a postdoctoral appointment. She became a faculty Member at Washington University in St. Louis. Later Walbot returned to Stanford as a professor in the Department of Biology.
Walbot first worked with maize while working with Ed Coe in the University of Missouri.
Walbot participates in societies including the American Society for Cell Biology, AAAS, AIBS, Genetics Society, and International Society for Plant Molecular Biology
Published two books, Developmental Biology in 1987 and The Maize Handbook'' in 1993.
Walbot has published hundreds of journal articles.
Administrative appointments
Elected to the Steering Committee of the Faculty Senate, Stanford (2009 - 2011)
Elected to Faculty Senate, Stanford (2009–2011)
Elected to Faculty Senate, Stanford (1999–2001)
Committee on Committees, Stanford (2000–2001)
Committee on Research, Stanford (2003–2005)
Honors and awards
Recognized as a Pionee |
https://en.wikipedia.org/wiki/Freedom%20to%20Read%20Foundation | The Freedom to Read Foundation (FTRF) is an American non-profit anti-censorship organization, established in 1969 by the American Library Association. The organization has been active in First Amendment-based challenges to book removals from libraries, and in anti-surveillance work. In addition to its legal work, the FTRF engages in advocacy and public awareness, such as its sponsorship of the annual celebration of "Banned Books Week".
History
The FTRF was established in 1969 by members of the American Library Association, including Judith Krug, Alexander Allain, and Carrie C Robinson. The organization was founded as "the American Library Association's response to its members' interest in having adequate means to support and defend librarians whose positions are jeopardized because of their resistance to abridgments of the First Amendment; and to set legal precedent for the freedom to read on behalf of all people".
The FTRF was set up in conjunction with the ALA's Office of Intellectual Freedom instead of as a separate entity because of the work ALA was already doing to protect the First Amendment and intellectual freedom. When the Foundation was being planned for and organized, Allain expressed concern in a letter to the Director of the Intellectual Freedom Office, Judith Krug, that ALA members would forget what the ALA has done and continues to do for intellectual freedom by covering themselves in this new umbrella of aid and assistance in the FTRF. Allain felt that there should be overlap of both organizations so that the focus remained centered on intellectual freedom and could be worked on in harmony.
Allain also felt that in forming the FTRF with the ALA, the Foundation would be able to benefit from some of the clout and connections that ALA already had. He also suggested keeping policies between the two organizations similar because of his belief in the good work that the ALA does; he was continuously concerned about the ALA in his creation of the foundat |
https://en.wikipedia.org/wiki/ParaHoxozoa | ParaHoxozoa (or Parahoxozoa) is a clade of animals that consists of Bilateria, Placozoa, and Cnidaria. The relationship of this clade relative to the two other animal lineages Ctenophora and Porifera is debated. Some phylogenomic studies have presented evidence supporting Ctenophora as the sister to Parahoxozoa and Porifera as the sister group to the rest of animals (e.g. ). Some studies have presented evidence supporting Porifera as the sister to Parahoxozoa and Ctenophora as the sister group to the rest of animals (e.g. ).
Phylogeny
The tree below, which is congruent with the vast majority of these phylogenomic studies, conveys this uncertainty with a polytomy.
ParaHoxozoa or Parahoxozoa
Though "ParaHox" genes are usually referred to in CamelCase and the original paper that named the clade used "ParaHoxozoa", the single initial cap format "Parahoxozoa" has become more common in the literature as CamelCase is not standard in zoological nomenclature.
Characteristics
Parahoxozoa was defined by the presence of several gene (sub)classes (HNF, CUT, PROS, ZF, CERS, K50, S50-PRD), as well as Hox/ParaHox-ANTP from which the name of this clade originated. It was later proposed and contested that a gene of the same class (ANTP) as the Hox/ParaHox, the NK gene and the Cdx Parahox gene, is also present in Porifera, the sponges. Regardless of whether a ParaHox gene is ever definitively identified, Parahoxozoa, as originally defined, is monophyletic and therefore continues to be used as such.
Planula-acoel, triploblasty, and bilaterian similarities
The original Bilateria are hypothesized to be a bottom dwelling worm with a single body opening. A through-gut may already have developed with the Ctenophora however. The through-gut may have developed from the corners of a single opening with lips fusing. E.g. Acoela resemble the planula larvae of some Cnidaria, which exhibit some bilaterian symmetry. They are vermiform, just as the cnidarian Buddenbrockia is. Placozoa has b |
https://en.wikipedia.org/wiki/Parks%E2%80%93Bielschowsky%20three-step%20test | The Parks–Bielschowsky three-step test, also known as Park's three-step test or Bielschowsky head tilt test, is a method used to isolate the paretic extraocular muscle, particularly superior oblique muscle and trochlear nerve (IVth cranial nerve), in acquired vertical double vision. It was originally described by Marshall M. Parks.
Bielschowsky's head tilt test
Step 1: Determine which eye is hypertropic in primary position. If there is right hypertropia in primary position, then the depressors of the R eye (IR/SO) or the elevators of the L eye are weak (SR/IO).
Step 2: Determine whether the hypertropia increases on right or left gaze. The vertical rectus muscles have their greatest vertical action when the eye is abducted. The oblique muscles have their greatest vertical action when the eye is adducted.
Step 3: Determine whether the hypertropia increases on right or left head tilt. During right head tilt, the right eye intorts (SO/SR) and the left eye extorts (IO/IR).
When a healthy individual tilts their head, the superior oblique and superior rectus muscles of the eye closest to the shoulder keep the eye level. The inferior oblique and inferior rectus muscles keep the other eye level. In patients with superior oblique palsy, the superior rectus muscle’s action is not counteracted by the superior oblique muscles. This leads to vertical deviation of the affected eye when the head is tilted towards the affected eye. However, there is no deviation when the head is tilted towards the unaffected eye because the superior oblique muscle is not stimulated in the affected eye, but rather it is stimulated in the unaffected eye. When there is a discrepancy in ocular deviation based on which way the head is tilted, the patient is diagnosed with unilateral palsy of the superior oblique muscle due to damage in the Trochlear Nerve.
People with superior oblique palsy on one side experience double vision, which is improved or even abolished by tilting the head towards the |
https://en.wikipedia.org/wiki/Power%20Processing%20Element | The Power Processing Element (PPE) comprises a Power Processing Unit (PPU) and a 512 KB L2 cache. In most instances the PPU is used in a PPE. The PPU is a 64-bit dual-threaded in-order PowerPC 2.02 microprocessor core designed by IBM for use primarily in the game consoles PlayStation 3 and Xbox 360, but has also found applications in high performance computing in supercomputers such as the record setting IBM Roadrunner.
The PPU is used as a main CPU core in three different processor designs:
The Cell Broadband Engine (Cell BE) which is used primarily in Sony's PlayStation 3 gaming console. It uses the PPE and comes in three versions, a 90 nm, a 65 nm and a 45 nm part.
The PowerXCell 8i which is a version of the Cell BE with enhanced FPU and memory subsystem. It was only manufactured as a single 65 nm version.
The XCPU which is used in a three core configuration and a unified 1 MB L2 cache inside Microsoft's Xbox 360. It comes in three versions, the 90 nm and 65 nm versions, and the 45 nm XCGPU with an integrated graphics processor from ATI.
Main features
64-bit, dual-threaded core
3.2 GHz typical clockrate
32 KB L1 instruction cache
32 KB L1 data cache
512 KB unified L2 cache, 8-way set associative in the PPE variant.
Compatible with 64-bit PowerPC ISA v.2.02 (POWER4 and PowerPC 970)
AltiVec SIMD functionality
Execution units
Branch Unit (BRU)
Fixed Point Integer Unit (FXU)
Load and Store Unit (LSU)
Floating-Point Unit (FPU)
Vector Media Extension Unit (VMX)
In-order
The PPU is an in-order processor, but it has some unique traits which allow it to achieve some benefits of out-of-order execution without expensive re-ordering hardware. Upon reaching an L1 cache miss - it can execute past the cache miss, stopping only when an instruction is actually dependent on a load. It can send up to 8 load instructions to the L2 cache out-of-order. It has an instruction delay pipe - a side path that allows it to execute instructions that would normally c |
https://en.wikipedia.org/wiki/Kotlin%20%28programming%20language%29 | Kotlin () is a cross-platform, statically typed, general-purpose high-level programming language with type inference. Kotlin is designed to interoperate fully with Java, and the JVM version of Kotlin's standard library depends on the Java Class Library,
but type inference allows its syntax to be more concise. Kotlin mainly targets the JVM, but also compiles to JavaScript (e.g., for frontend web applications using React) or native code via LLVM (e.g., for native iOS apps sharing business logic with Android apps). Language development costs are borne by JetBrains, while the Kotlin Foundation protects the Kotlin trademark.
On 7 May 2019, Google announced that the Kotlin programming language was now its preferred language for Android app developers. Since the release of Android Studio 3.0 in October 2017, Kotlin has been included as an alternative to the standard Java compiler. The Android Kotlin compiler produces Java 8 bytecode by default (which runs in any later JVM), but lets the programmer choose to target Java 9 up to 20, for optimization, or allows for more features; has bidirectional record class interoperability support for JVM, introduced in Java 16, considered stable as of Kotlin 1.5.
Kotlin has support for the web with Kotlin/JS, either through a classic interpreter-based backend which has been declared stable since version 1.3, or an intermediate representation-based backend which has been declared stable since version 1.8. Kotlin/Native (for e.g. Apple silicon support) is considered beta since version 1.3.
History
In July 2011, JetBrains unveiled Project Kotlin, a new language for the JVM, which had been under development for a year. JetBrains lead Dmitry Jemerov said that most languages did not have the features they were looking for, with the exception of Scala. However, he cited the slow compilation time of Scala as a deficiency. One of the stated goals of Kotlin is to compile as quickly as Java. In February 2012, JetBrains open sourced the project |
https://en.wikipedia.org/wiki/Bogdan%20Suceav%C4%83 | Bogdan Suceavă (born September 27, 1969) is a Romanian-American mathematician and writer, working as professor of mathematics at California State University Fullerton. He is also a honorary research professor with the STAR-UBB Institute, Babeș-Bolyai University, Cluj-Napoca, Romania.
Biography
He was born in Curtea de Argeș, Romania. Growing up, Suceavă spent his holidays with his maternal grandparents at Nucșoara, a remote community that maintained its traditions, unbroken by the collectivisation elsewhere of Nicolae Ceaușescu's regime. There he absorbed Balkan folk-tales and myths, which would inform some of his literary works. Suceavă mentioned his maternal grandmother was a cousin of Elisabeta Rizea, a figure of the Romanian anti-communist resistance movement.
Suceavă went to school in Pitești, Găești, Târgoviște, and Bucharest, as his family moved several times. After the Romanian Revolution of 1989, he attended the University of Bucharest, where he obtained his undergraduate degree in mathematics and master's degree in mathematics, with a focus on geometry. He then moved to the United States to study at the Michigan State University for his doctorate. His thesis, titled New Riemannian and Kählerian Curvature Invariants and Strongly Minimal Submanifolds, was written under the supervision of Bang-Yen Chen.
Following his doctorate in 2002, Suceavă was hired by California State University, Fullerton. In the spring of 2023 Suceavă was presented at California State University, Fullerton with the L. Donald Shields Excellence in Scholarship and Creativity Award.
Career
Mathematics
At the age of 13, Suceavă won a prize at the Romanian National Mathematical Olympiad, following which he was encouraged to pursue mathematics as a viable career. During his undergraduate years he studied mathematical analysis with Solomon Marcus and Ion Colojoară, algebra with Constantin Vraciu and Constantin Niță, geometry with Adriana Turtoi, Stere Ianuș, and Liviu Nicolescu, among o |
https://en.wikipedia.org/wiki/Nikolai%20G%C3%BCnther | Nikolai Maximovich Günther (, also transliterated as Nicholas M. Gunther or N. M. Gjunter) ( – May 4, 1941) was a Russian mathematician known for his work in potential theory and in integral and partial differential equations: later studies have uncovered his contributions to the theory of Gröbner bases.
He was an Invited Speaker of the ICM in 1924 at Toronto, in 1928 at Bologna, and in 1932 at Zurich.
Selected publications
. A large paper aimed at showing the applications of Radon integrals to problems of mathematical physics: the Mathematical Reviews review refers to a 1949 reprint published by the Chelsea Publishing Company.
.
, reviewed also by and by .
. The second edition of the monograph , now a classical textbook in potential theory, translated from the Russian original (edition cured by V. I. Smirnov and H. L. Smolitskii), which was also translated in German as .
See also
Harmonic function
Integral equation
Radon measure
Notes
References
Biographical and general references
. The "Mathematics in the USSR during its first thirty years 1917–1947" is an opus describing the developments of Soviet mathematics during the first thirty years of its existence. It consists of several survey articles, authored by Soviet experts and reviewing briefly the contributions of Soviet mathematicians to a chosen field during the years from 1917 to 1947: it was later expanded as the two volume survey (Kurosh et al. 1959a, 1959b).
. The "Mathematics in the USSR during its first forty years 1917–1957" is an opus in two volumes describing the developments of Soviet mathematics during the first forty years of its existence. This is the first volume, titled "Survey articles" and consists exactly of such kind of articles authored by Soviet experts and reviewing briefly the contributions of Soviet mathematicians to a chosen field, during the years from 1917 to 1957.
. The "Mathematics in the USSR during its first forty years 1917–1957" is an opus in two volumes describing the |
https://en.wikipedia.org/wiki/MIMO-OFDM | Multiple-input, multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) is the dominant air interface for 4G and 5G broadband wireless communications. It combines multiple-input, multiple-output (MIMO) technology, which multiplies capacity by transmitting different signals over multiple antennas, and orthogonal frequency-division multiplexing (OFDM), which divides a radio channel into a large number of closely spaced subchannels to provide more reliable communications at high speeds. Research conducted during the mid-1990s showed that while MIMO can be used with other popular air interfaces such as time-division multiple access (TDMA) and code-division multiple access (CDMA), the combination of MIMO and OFDM is most practical at higher data rates.
MIMO-OFDM is the foundation for most advanced wireless local area network (wireless LAN) and mobile broadband network standards because it achieves the greatest spectral efficiency and, therefore, delivers the highest capacity and data throughput. Greg Raleigh invented MIMO in 1996 when he showed that different data streams could be transmitted at the same time on the same frequency by taking advantage of the fact that signals transmitted through space bounce off objects (such as the ground) and take multiple paths to the receiver. That is, by using multiple antennas and precoding the data, different data streams could be sent over different paths. Raleigh suggested and later proved that the processing required by MIMO at higher speeds would be most manageable using OFDM modulation, because OFDM converts a high-speed data channel into a number of parallel lower-speed channels.
Operation
In modern usage, the term "MIMO" indicates more than just the presence of multiple transmit antennas (multiple input) and multiple receive antennas (multiple output). While multiple transmit antennas can be used for beamforming, and multiple receive antennas can be used for diversity, the word "MIMO" refers to the simultane |
https://en.wikipedia.org/wiki/Molecular%20paleontology | Molecular paleontology refers to the recovery and analysis of DNA, proteins, carbohydrates, or lipids, and their diagenetic products from ancient human, animal, and plant remains. The field of molecular paleontology has yielded important insights into evolutionary events, species' diasporas, the discovery and characterization of extinct species.
loo
In shallow time, advancements in the field of molecular paleontology have allowed scientists to pursue evolutionary questions on a genetic level rather than relying on phenotypic variation alone. By applying molecular analytical techniques to DNA in Recent animal remains, one can quantify the level of relatedness between any two organisms for which DNA has been recovered. Using various biotechnological techniques such as DNA isolation, amplification, and sequencing scientists have been able to gain expanded new insights into the divergence and evolutionary history of countless recently extinct organisms. In February 2021, scientists reported, for the first time, the sequencing of DNA from animal remains, a mammoth in this instance, over a million years old, the oldest DNA sequenced to date.
In deep time, compositional heterogeneities in carbonaceous remains of a diversity of animals, ranging in age from the Neoproterozoic to the Recent, have been linked to biological signatures encoded in modern biomolecules via a cascade of oxidative fossilization reactions. The macromolecular composition of carbonaceous fossils, some Tonian in age, preserve biological signatures reflecting original biomineralization, tissue types, metabolism, and relationship affinities (phylogeny).
History
The study of molecular paleontology is said to have begun with the discovery by Abelson of 360 million year old amino acids preserved in fossil shells. However, Svante Pääbo is often the one considered to be the founder of the field of molecular paleontology.
The field of molecular paleontology has had several major advances since the 1950s an |
https://en.wikipedia.org/wiki/BattleHack | BattleHack (or Battle Hack in the 2013 series) was a series of global hackathon contests organised by PayPal. Competitors were required to solve a local problem by coding. Winners of the first prize of each contest got an axe as the trophy, and admission to the world finals where competitors competed for the $100,000 grand prize. Competitors retain the ownership of their applications made in the contests.
In 2016 PayPal/Braintree shut down the developer relations program along with all related programs such as BattleHack.
It was announced that BattleHack would be returning however as of Jan 16, 2018 the domain name lapsed and has since moved into new ownership.
See also
Hackathon
References
External links
Hacker culture
Software development events |
https://en.wikipedia.org/wiki/Foodomics | Foodomics was defined in 2009 as "a discipline that studies the Food and Nutrition domains through the application and integration of advanced -omics technologies to improve consumer's well-being, health, and knowledge". Foodomics requires the combination of food chemistry, biological sciences, and data analysis.
The study of foodomics became under the spotlight after it was introduced in the first international conference in 2009 at Cesena, Italy. Many experts in the field of omics and nutrition were invited to this event in order to find the new approach and possibility in the area of food science and technology. However, research and development of foodomics today are still limited due to high throughput analysis required. The American Chemical Society journal called Analytical Chemistry dedicated its cover to foodomics in December 2012.
Foodomics involves four main areas of omics:
Genomics, which involves investigation of genome and its pattern.
Transcriptomics, which explores a set of gene and identifies the difference among various conditions, organisms, and circumstance, by using several techniques including microarray analysis;
Proteomics, studies every kind of proteins that is a product of the genes. It covers how protein functions in a particular place, structures, interactions with other proteins, etc.;
Metabolomics, includes chemical diversity in the cells and how it affects cell behavior;
Advantages of foodomics
Foodomics greatly helps the scientists in an area of food science and nutrition to gain a better access to data, which is used to analyze the effects of food on human health, etc. It is believed to be another step towards better understanding of development and application of technology and food. Moreover, the study of foodomics leads to other omics sub-disciplines, including nutrigenomics which is the integration of the study of nutrition, gene and omics.
Colon cancer
Foodomics approach is used to analyze and establish the links betwee |
https://en.wikipedia.org/wiki/Sony%20NEX-6 | The Sony NEX-6 is a digital camera announced on 12 September 2012. It is a mirrorless interchangeable lens camera or MILC, and this has a smaller body form factor than a traditional DSLR, whilst retaining the sensor size and features of an APS-C-sized model. It is targeted at experienced users, enthusiasts and professionals. It is replaced by the α6000.
References
NEX-6
NEX-6
Live-preview digital cameras |
https://en.wikipedia.org/wiki/Resource%20management%20%28computing%29 | In computer programming, resource management refers to techniques for managing resources (components with limited availability).
Computer programs may manage their own resources by using features exposed by programming languages ( is a survey article contrasting different approaches), or may elect to manage them by a host – an operating system or virtual machine – or another program.
Host-based management is known as resource tracking, and consists of cleaning up resource leaks: terminating access to resources that have been acquired but not released after use. This is known as reclaiming resources, and is analogous to garbage collection for memory. On many systems, the operating system reclaims resources after the process makes the exit system call.
Controlling access
The omission of releasing a resource when a program has finished using it is known as a resource leak, and is an issue in sequential computing. Multiple processes wish to access a limited resource can be an issue in concurrent computing, and is known as resource contention.
Resource management seeks to control access in order to prevent both of these situations.
Resource leak
Formally, resource management (preventing resource leaks) consists of ensuring that a resource is released if and only if it is successfully acquired. This general problem can be abstracted as "before, body, and after" code, which normally are executed in this order, with the condition that the after code is called if and only if the before code successfully completes, regardless of whether the body code executes successfully or not. This is also known as execute around or a code sandwich, and occurs in various other contexts, such as a temporary change of program state, or tracing entry and exit into a subroutine. However, resource management is the most commonly cited application. In aspect-oriented programming, such execute around logic is a form of advice.
In the terminology of control flow analysis, resource release |
https://en.wikipedia.org/wiki/DEGAS%20%28software%29 | DEGAS (D.E.G.A.S., Design & Entertainment Graphic Arts System) is a bitmap graphics editor created by Tom Hudson for the Atari ST and published by Batteries Included in 1985. Hudson created some of the sample paintings that shipped with DEGAS.
Development
The working title of DEGAS was HUDraw, where "HUD" stood for "Hudson."
Gary Yost of Antic Software wanted to publish DEGAS, but Hudson chose Batteries Included because "they were, in my opinion, the best Atari software company at the time." Yost and Antic Software published Hudson's next program, CAD 3D.
File formats
Legacy
Antic magazine published winners of an art competition for those using the software in July 1986.
DEGAS was followed in 1986 with DEGAS Elite. It adds multiple work screens, color-cycling animation, and other features.
See also
NeoChrome
References
External links
DEGAS Elite advertisement
1985 software
Raster graphics editors
Atari ST software |
https://en.wikipedia.org/wiki/Micropyle%20%28zoology%29 | A micropyle is a pore in the membrane covering the ovum, through which a sperm enters.
Micropyles are also found in sporozoites of some digenetic microorganisms such as Plasmodium at the anterior part of the cell that ultimately leads towards the apical cap. Examples of other organisms that have micropyles are the Bombyx mandarina and the Ceratitis capitata.
References
Reproduction |
https://en.wikipedia.org/wiki/INtime | The INtime Real Time Operating System (RTOS) family is based on a 32-bit RTOS conceived to run time-critical operations cycle-times as low as 50μs. INtime RTOS runs on single-core, hyper-threaded, and multi-core x86 PC platforms from Intel and AMD. It supports two binary compatible usage configurations; INtime for Windows, where the INtime RTOS runs alongside Microsoft Windows®, and INtime Distributed RTOS, where INtime runs one.
Like its iRMX predecessors, INtime is a real-time operating system, and like DOSRMX and iRMX for Windows, it runs concurrently with a general-purpose operating system on a single hardware platform.
History
Initial Release
INtime 1.0 was originally introduced in 1997 in conjunction with the Windows NT operating system. Since then it has been upgraded to include support for all subsequent protected-mode Microsoft Windows platforms, Windows XP to Windows 10.
INtime can also be used as a stand-alone RTOS. INtime binaries are able to run unchanged when running on a stand-alone node of the INtime RTOS. Unlike Windows, INtime can run on an Intel 80386 or equivalent processor. Current versions of the Windows operating system generally require at least a Pentium level processor in order to boot and execute.
Version 2.2
After spinning off from Radisys in 2000 development work on INtime continued at TenAsys Corporation. In 2003 TenAsys released version 2.2 of INtime.
Notable features of version 2.2 include:
Real-time Shared Libraries, or RSLs, which are the functional equivalent of the Windows Dynamically Loaded Libraries, or DLLs.
Support for the development of USB clients, and USB host control drivers for OHCI, UHCI and EHCI (USB 2.0) devices.
A new timing acquisition and display application called ""INscope"" is released.
Notes
Real-time operating systems
Embedded operating systems |
https://en.wikipedia.org/wiki/Tor2web | Tor2web (pronounced "Tor to Web") is a software project to allow Tor hidden services to be accessed from a standard browser without being connected to the Tor network. It was created by Aaron Swartz and Virgil Griffith.
History
Tor is a network which enables people to use the Internet anonymously (though with known weaknesses) and to publish content on "hidden services", which exist only within the Tor network for security reasons and thus are typically only accessible to the relatively small number of people using a Tor-connected web browser. Aaron Swartz and Virgil Griffith developed Tor2web in 2008 as a way to support whistleblowing and other forms of anonymous publishing through Tor, allowing materials to remain anonymous while making them accessible to a broader audience. In an interview with Wired Swartz explained that Tor is great for anonymous publishing, but because its focus is not user-friendliness and thus not many people would install it, he wanted to "produce this hybrid where people could publish stuff using Tor and make it so that anyone on the internet could view it".
The software developed by Swartz and Griffith is today considered version 1.0. Since then, it has been maintained and developed by Giovanni Pellerano from the Hermes Center for Transparency and Digital Human Rights as part of the GlobaLeaks Project, with financial support from the Open Technology Fund. Version 2.0 was released in August 2011, and version 3.0 is in beta .
Operation and security
Rather than typical top-level domains like .com, .org, or .net, hidden service URLs end with .onion and are only accessible when connected to Tor. Tor2web acts as a specialized proxy or middleman between hidden services and users, making them visible to people who are not connected to Tor. To do so, a user takes the URL of a hidden service and replaces .onion with .onion.to.
Like Tor, Tor2web operates using servers run voluntarily by an open community of individuals and organizations.
Tor2we |
https://en.wikipedia.org/wiki/One-shot%20deviation%20principle | The one-shot deviation principle (also known as single-deviation property) is the principle of optimality of dynamic programming applied to game theory. It says that a strategy profile of a finite multi-stage extensive-form game with observed actions is a subgame perfect equilibrium (SPE) if and only if there exist no profitable single deviation for each subgame and every player. In simpler terms, if no player can increase their expected payoff by deviating from their original strategy via a single action (in just one stage of the game), then the strategy profile is an SPE. In other words, no player can profit by deviating from the strategy in one period and then reverting to the strategy.
Furthermore, the one-shot deviation principle is very important for infinite horizon games, in which the principle typically does not hold, since it is not plausible to consider an infinite number of strategies and payoffs in order to solve. In an infinite horizon game where the discount factor is less than 1, a strategy profile is a subgame perfect equilibrium if and only if it satisfies the one-shot deviation principle.
Definitions
The following is the paraphrased definition from Watson (2013)
To check whether strategy s is a subgame perfect Nash equilibrium, we have to ask every player i and every subgame, if considering s, there is a strategy s’ that yields a strictly higher payoff for player i than does s in the subgame. In a finite multi-stage game with observed actions, this analysis is equivalent to looking at single deviations from s, meaning s’ differs from s at only one information set (in a single stage). Note that the choices associated with s and s’ are the same at all nodes that are successors of nodes in the information set where s and s’ prescribe different actions.
Example
Consider a symmetric game with two players in which each player makes binary choice decisions, A or B, in each of three stages. In each stage, the players observe the choices made in t |
https://en.wikipedia.org/wiki/Surround%20suppression | Surround suppression is where the relative firing rate of a neuron may under certain conditions decrease when a particular stimulus is enlarged. It has been observed in electrophysiology studies of the brain and has been noted in many sensory neurons, most notably in the early visual system. Surround suppression is defined as a reduction in the activity of a neuron in response to a stimulus outside its classical receptive field.
The necessary functional connections with other neurons influenced by stimulation outside a particular area and by dynamic processes in general, and the absence of a theoretical description of a system state to be treated as a baseline, deprive the term "classical receptive field" of functional meaning. The descriptor "surround suppression" suffers from a similar problem, as the activities of neurons in the "surround" of the "classical receptive field are similarly determined by connectivities and processes involving neurons beyond it.) This nonlinear effect is one of many that reveals the complexity of biological sensory systems, and the connections of properties of neurons that may cause this effect (or its opposite) are still being studied. The characteristics, mechanisms, and perceptual consequences of this phenomenon are of interest to many communities, including neurobiology, computational neuroscience, psychology, and computer vision.
Background
The classical model of early vision presumes that each neuron responds independently to a specific stimulus in a localized area of the visual field. (According to Carandini et al (2005), this computational model, which may be fit to various datasets, "degrade[s] quickly if we change almost any aspect of the test stimulus.") The stimulus and corresponding location in the visual field are collectively called the classical receptive field. However, not all effects can be explained by via ad hoc independent filters. Surround suppression is one of an infinite number of possible effects in which |
https://en.wikipedia.org/wiki/Biotechnology%20Heritage%20Award | The Biotechnology Heritage Award recognizes individuals who have made significant contributions to the development of biotechnology through discovery, innovation, and public understanding. It is presented annually at the Biotechnology Innovation Organization (BIO) Annual International Convention by the Biotechnology Innovation Organization (BIO, formerly the Biotechnology Industry Organization) and the Science History Institute (formerly the Chemical Heritage Foundation). The purpose of the award is "to encourage emulation, inspire achievement, and promote public understanding of modern science, industry, and economics".
Recipients
The award is given yearly and was first presented in 1999.
Ivor Royston, 2020
Janet Woodcock, 2019
William Rastetter, 2018
John C. Martin, 2017
Stanley Norman Cohen, 2016
Moshe Alafi and William K. Bowes, 2015
Robert S. Langer, 2014
George Rosenkranz, 2013
Nancy Chang, 2012
Joshua S. Boger, 2011
Arthur D. Levinson, 2010
Robert T. Fraley, 2009
Henri A. Termeer, 2008
Ronald E. Cape, 2007
Alejandro Zaffaroni, 2006
Paul Berg, 2005
Leroy Hood, 2004
William J. Rutter, 2003
Walter Gilbert, 2002
Francis S. Collins and J. Craig Venter, 2001
Herbert Boyer and Robert A. Swanson, 2000
George B. Rathmann, 1999
Photo Gallery
See also
List of biology awards
References
Biology awards
American science and technology awards
Awards established in 1999
1999 establishments in the United States |
https://en.wikipedia.org/wiki/Mero%C3%AB%20Head | The Meroë Head, or Head of Augustus from Meroë, is a larger-than-life-size bronze head depicting the first Roman emperor, Augustus, that was found in the ancient Nubian site of Meroë in modern Sudan in 1910. Long admired for its striking appearance and perfect proportions, it is now part of the British Museum's collection. It was looted from Roman Egypt in 24 BC by the forces of queen Amanirenas of Kush and brought back to Meroë, where it was buried beneath the staircase of a temple.
Discovery and excavation
The head was excavated by the British archaeologist John Garstang in December 1910 at Meroë, which had been the capital of the Kingdom of Kush for several centuries. It was found near a mound (M292) under what was once a temple staircase. The statue had been purposely buried over 1900 years prior and had been well preserved due to the hot, dry conditions. His excavation report states, “Just outside the doorway of this chamber, and buried in a clean pocket of sand [two and a half meters from the surface] there was a Roman bronze portrait head of heroic size.” Garstang was eager to share his findings with the world, so he shipped it off to London as soon as possible. The bust was donated to the British Museum by the Sudan Excavation Committee with the support of the National Art Collections Fund in 1911.
The excavation covered the entire lost city of Meroë. It took two excavations of the area to come across the head. Among other structures, the excavation team uncovered the ruins of a temple of Ammon, the ornately decorated temple in which the head was buried, and two large buildings speculated to be palaces.
This large undertaking was financed by the Sudan Excavation Committee, composed of the National Museum of Scotland, the Ny Carlsberg Glyptotek, and the Royal Museums of Fine Arts of Belgium. According to Thorston Opper's The Meroë Head of Augustus (Objects in Focus), the "committee was an international consortium of museum professionals, academics, and wea |
https://en.wikipedia.org/wiki/Mitro | Mitro was a password manager for individuals and teams that securely saved users' logins, and allowed users to log in and share access.
On October 6, 2015, the Mitro service shut down.
The successor to Mitro is named Passopolis; this is a password manager built upon the Mitro source code.
History
Mitro was founded in 2012 by Vijay Pandurangan, Evan Jones, and Adam Hilss.
On July 31, 2014, the Mitro team announced that they would join Twitter, and at the same time, they released the source code for Mitro on GitHub as free software under GPL.
The Mitro team announced the shuttering of the Mitro service with the following timeline:
July 11, 2015: Initial announcement that Mitro would be shut down
July 18, 2015: Creating new accounts was disabled
August 4, 2015: Final email warning about imminent shutdown was sent
September 24, 2015: Mitro become read-only
October 6, 2015: Mitro service was turned off
October 31, 2015: All Mitro user data permanently destroyed
The Mitro team explained the reason for shutting down the service was that the cost and administrative burden to maintain the service in their spare time with their own money had become too much. Given that they could not properly manage a service that people rely on for their security, they needed to stop running it.
Former customers were encouraged to move to Passopolis, and independent project that uses the open source Mitro code, or use alternatives such as 1Password, Dashlane, or LastPass.
On October 5, 2015, Mitro was officially terminated by Twitter.
Investors
Seed Funding
Mitro was backed by $1.2 million in seed funding from Google Ventures and Matrix Partners.
Features
Password generator
Password sharing
One-click login
Two factor authentication
Cross-platform and cross-browser compatibility
Browser extensions: Chrome, Firefox, Safari
Mobile solutions for Android and iOS
Security
Mitro uses Google's Keyczar on the server and Keyczar JS implementation on the browser.
Master key is |
https://en.wikipedia.org/wiki/Ted%20Livingston%20%28Kik%29 | Ted Livingston (born 1987) is founder of Kik Messenger that provides mobile messaging service.
Early life
Livingston was born in Toronto. As a child, Livingston had a passion for building Lego structures and automated machines in his basement. He continues following this interest on the school robotics team.
From 1997 to 2005, Livingston attended the Crescent School, in Toronto. He later stated that Crescent "provided an education which couldn't be more perfect for me as an individual. It allowed me to grow and develop my own philosophies and directions in life."
2005–Present: UWaterloo and Kik
Livingston took a mechatronics bachelor's degree at the University of Waterloo from 2005 to 2009 in order to "pursue his dream of building robots." He participated in the Waterloo co-op program there, with placements at Honda and the City of Toronto government. Livingston eventually landed a co-op position as a system engineering project coordinator at Research in Motion.
In December 2007, eight months into his co-op, Livingston was promoted by Research in Motion to "Technical Product Management Coordinator". In 2008, he turned down a full-time job to return to school at the advice of his manager.
Back at Waterloo, Livingston decided to take part in the Velocity program, a startup-focused community where he founded Kik Messenger instead of completing his degree.
Kik now competes with Facebook and WeChat. At its peak in 2015 it boasted over 275 million registered users, and it was used by approximately 40 percent of American teens. In 2015 Chinese Internet giant Tencent invested $50 million into Kik.
In 2014, Forbes placed him on their "Top 30 under 30" in their technology list.
In November 2015, Torontolife ranked Livingston at #20 on their "Toronto's 50 Most Influential,".
References
Mobile computers
Living people
1987 births
Canadian chairpersons of corporations |
https://en.wikipedia.org/wiki/Cyclic%20sieving | In combinatorial mathematics, cyclic sieving is a phenomenon by which evaluating a generating function for a finite set at roots of unity counts symmetry classes of objects acted on by a cyclic group.
Definition
Let C be a cyclic group generated by an element c of order n. Suppose C acts on a set X. Let X(q) be a polynomial with integer coefficients. Then the triple (X, X(q), C) is said to exhibit the cyclic sieving phenomenon (CSP) if for all integers d, the value X(e2id/n) is the number of elements fixed by cd. In particular X(1) is the cardinality of the set X, and for that reason X(q) is regarded as a generating function for X.
Examples
The q-binomial coefficient
is the polynomial in q defined by
It is easily seen that its value at q = 1 is the usual binomial coefficient , so it is a generating function for the subsets of {1, 2, ..., n} of size k. These subsets carry a natural action of the cyclic group C of order n which acts by adding 1 to each element of the set, modulo n. For example, when n = 4 and k = 2, the group orbits are
(of size 2)
and
(of size 4).
One can show that evaluating the q-binomial coefficient when q is an nth root of unity gives the number of subsets fixed by the corresponding group element.
In the example n = 4 and k = 2, the q-binomial coefficient is
evaluating this polynomial at q = 1 gives 6 (as all six subsets are fixed by the identity element of the group); evaluating it at q = −1 gives 2 (the subsets {1, 3} and {2, 4} are fixed by two applications of the group generator); and evaluating it at q = ±i gives 0 (no subsets are fixed by one or three applications of the group generator).
List of cyclic sieving phenomena
In the Reiner–Stanton–White paper, the following example is given:
Let α be a composition of n, and let W(α) be the set of all words of length n with αi letters equal to i. A descent of a word w is any index j such that . Define the major index on words as the sum of all descents.
The triple e |
https://en.wikipedia.org/wiki/Timable | Timable is an online event listing platform in Hong Kong, consisting of websites and mobile apps, co-founded by Sam Yuen and Mike Ko in 2010. It displays popular events happening in the city, including concerts, dramas, exhibitions, festivals, events for family, etc. The name refers to its attempt to create a platform that allows users to search by time. Users can search for events, matching their spare time.
Timable, an original word, means "able to time" according to the explanation on its website. The letter "e" is omitted in the word based on common English grammar, like "scalable", "writable". The name is often misspelled as "timeable" or "timetable". At the moment, there is no corresponding Chinese name for Timable.
Listings are contributed by event organizers in Web 2.0 approach, or published by Timable Editors. By the end of 2013, over 23,000 events have been recorded.
History
2010-07-11: Launch of Facebook page
2010-07-14: Official launch of Timable.com
2010–2009: Launch of mobile website
2011–2012: Joined Cyberport incubation programme
2012–2004: Timable co-operates with Yahoo! Hong Kong and launches "Timable on Yahoo!"
2012-08-31: Release of iPhone iOS app
2013-10-13: Release of Android app
Awards
2010: Awarded Cyberport Creative Micro Fund (CCMF)
2011: 2011 Top 10 .hk Website Competition – Merit Prize in SME Group
2013-04-08: Hong Kong ICT Awards 2013 – Best Mobile Apps (Mobile Marketing) Silver Award
Media coverage
2011-03-03: Article by Samson Tam – published on local newspaper Sing Tao Daily and website hksilicon.com
2012-01-29: Interview by Asia Television (www.hkatv.com)
2012-06-06: Interview by One Media Trading Express
2012-10-22: Interview by STHeadline
2013-03-25: Report by TVB Weekly
2013-08-05: Interview by Apple Daily
2013-08-07: Interview by Hong Kong Economic Times
2013-11-14: Report by STHeadline
2013-12-27: Interview by i-CABLE News Channel
References
External links
Main website
Web services |
https://en.wikipedia.org/wiki/Retina%20medical%20search | Retina medical search is a free search engine for doctors or medical students. It is a Google custom search engine and the actual coverage is unknown. It claims to cover credible physician level documents and categorizes them in various ways.
See also
Google Scholar
List of academic databases and search engines
Scirus
External links
Retina medical Search website
Online databases |
https://en.wikipedia.org/wiki/Infodemiology | Infodemiology was defined by Gunther Eysenbach in the early 2000s as information epidemiology. It is an area of science research focused on scanning the internet for user-contributed health-related content, with the ultimate goal of improving public health. It is also defined as the science of mitigating public health problems resulting from an infodemic.
Origin of term
Eysenbach first used the term in the context of measuring and predicting the quality of health information on the Web (i.e., measuring the "supply" side of information).
He later included in his definition methods and techniques which are designed to automatically measure and track health information "demand" (e.g., by analyzing search queries) as well as "supply" (e.g., by analyzing postings on webpages, in blogs, and news articles, for example through GPHIN) on the Internet with the overarching goal of informing public health policy and practice. In 2013, the Infovigil Project was launched in an effort to bring the research community together to help realize this goal. It is funded by the Canadian Institutes of Health Research.
Eysenbach demonstrated his point by showing a correlation between flu-related searches on Google (demand data) and flu-incidence data. The method is shown to be better and more timely (i.e., can predict public health events earlier) than traditional syndromic surveillance methods such as reports by sentinel physicians.
Application
Researchers have applied an infodemiological approach to studying the spread of HIV/AIDS, SARS and influenza, vaccination uptake, antibiotics consumption, the incidence of multiple sclerosis, patterns of alcohol consumption, the efficacy of using the social web for personalization of health treatment, the contexts of status epilepticus patients, factors of Abdominal pain and its impact on quality of life and the effectiveness of the Great American Smokeout anti-smoking awareness event. Applications outside the field of health care include urban |
https://en.wikipedia.org/wiki/IEC%20Electronics | IEC Electronics Corp. was set up in 1966 and now is based in Newark, New York. The company focuses on electronic contract manufacturing services (EMS), such as the circuit cards, loads of cable and wire harness assemblies, and precision sheet metal components, for military, aerospace, medical devices, and other industry markets. In addition, the company provides services like testing and detection of counterfeit electronic parts, component risk mitigation and advanced failure analysis. IEC Electronics acquired Southern California Braiding, Inc. in 2010 to further develop IEC’s subsidiary, IEC Electronics Wire and Cable, Inc.. The company also has another subsidiary, namely Albuquerque. In October 2021, the company was acquired by Creation Technologies.
History
In June 2013, Glancy Binkow & Goldberg LLP, on behalf of investors of IEC, filed a class action lawsuit against the Company for issuing false and/or misleading statements.
On February 17, 2015, the company received a deficiency letter from the New York Stock Exchange (NYSE). The reasons for deficiency included failure to file a quarterly report in a timely manner. The company has been actively trying to prevent their stock from being delisted. IEC had until May 11, 2015, to submit a plan to the NYSE. Failure to submit and follow their approved plan, would get them delisted.
In February 2018, IEC Electronics announced they would be building a new facility in Newark, New York to expand production capabilities. The new 150,000 square foot facility, which will be located at the Silver Hill Technology Park, is projected to open in mid-2020. This business expansion is expected to create 362 new jobs while retaining 463 positions in New York State.
Products
All the related products are based on the company’s on-site analytical laboratories, real-time and automated data surveillance, component tracking systems, and the new product incubation centers, under ISO 9001:2008, ISO 13485 and ISO 14001 and many other st |
https://en.wikipedia.org/wiki/Requirement%20diagram | A requirement diagram is a diagram specially used in SysML in which requirements and the relations between them and their relationship to other model elements are shown as discussed in the following paragraphs.
Derive requirement relationship
If a requirement is derived from another requirement, their relation is named "derive requirement relationship".
Namespace containment
If a requirement is contained in another requirement, their relation is named "namespace containment".
Satisfy relationship
If a requirement is satisfied by a design element, their relation is named "satisfy relationship".
Copy relationship
If a requirement is a copy of another requirement, their relation is named "copy relationship".
Verify relationship
If there exists a relation between a requirement and a test case verifying this requirement, their relation is named "verify relationship".
Test case
A test case is defined by a flow checking whether the system under consideration satisfies a requirement.
Refine relationship
If a requirement is refined by other requirements / model elements, the relation is named "refine relationship".
Trace relationship
If there exists a relation between a requirement and an arbitrary model element traced by this requirement, their relation is named "trace relationship".
References
Systems Modeling Language
Software requirements
Systems engineering |
https://en.wikipedia.org/wiki/Wooded%20meadow | Wooded meadows (also named wood-meadows, park meadows, etc.) are ecosystems in temperate forest regions. They are sparse natural stands with a regularly mowed herbaceous layer.
While frequent throughout Europe during the Medieval period and before, wooded meadows have largely disappeared. Wooded meadows originated with the practices of hunter-gatherer communities. They were important in terms of social organization around a natural resource and determined much of the community's interactions with the natural world. In the early 20th century, wooded meadows were used for fruit cultivation in Sweden; however, their prevalence has decreased substantially due to changes in land management and a movement toward more intensive types of agroecosystems. The more typical, calcicolous wooded meadows are common around the Baltic Sea.
Wooded meadows have high species richness. In some of the current Estonian wooded meadows, world-record species densities have been recorded (up to 76 species of vascular plants per square meter).
Literature
Kull, Kalevi; Kukk, Toomas; Lotman, Aleksei 2003. When culture supports biodiversity: The case of wooded meadow. In: Roepstorff, Andreas; Bubandt, Nils; Kull, Kalevi (eds.) 2003. Imagining Nature: Practices of Cosmology and Identity. Aarhus: Aarhus University Press, 76–96. (pdf)
References
External links
On wooded meadows at the Estonian Seminatural Community Conservation Association site
Ecology
Grasslands
Habitats
Land management
Meadows |
https://en.wikipedia.org/wiki/Head%20I | Head I is a relatively small oil and tempera on hardboard painting by the Irish-born British figurative artist Francis Bacon. Completed in 1948, it is the first in a series of six heads, the remainder of which were painted the following year in preparation for a November 1949 exhibition at the Hanover Gallery in London. Like the others in the series, it shows a screaming figure alone in a room, and focuses on the open mouth. The work shows a skull which has disintegrated on itself and is largely a formless blob of flesh. The entire upper half has disappeared, leaving only the jaw, mouth and teeth and one ear still intact. It is the first of Bacon's paintings to feature gold background railings or bars; later to become a prominent feature of his 1950s work, especially in the papal portraits where they would often appear as enclosing or cages around the figures. It is not known what influences were behind the image; most likely they were multiple – press or war photography, and critic Denis Farr detects the influence of Matthias Grünewald.
Bacon juxtaposes traditional elements of portraiture with loose, spontaneous brushwork. In some passages he has rubbed or brushed out (perhaps with a cloth) the paint, a technique art historian Armin Zweite describes as "productive vandalism". There are a number of ambiguous elements in the work. The hanging tassel rest just above the figure's right ear, giving the impression that it has hooked the head and is pulling it sideways. The gold railings suggest in the top right suggest the corner of a room, while those in the center background may be the headboard of a bed. The upper half is largely void of detail, while the lower portion, particularly the lower third has been heavily reworked, and consists of a blending of white, gray and black pigments.
The use of heavy impasto gives the impression of animal skin; critic Robert Melville described the "color of wet, black snakes lightly powdered with dust". In 1951 Bacon said of his |
https://en.wikipedia.org/wiki/List%20of%20biophysically%20important%20macromolecular%20crystal%20structures | Crystal structures of protein and nucleic acid molecules and their complexes are central to the practice of most parts of biophysics, and have shaped much of what we understand scientifically at the atomic-detail level of biology. Their importance is underlined by the United Nations declaring 2014 as the International Year of Crystallography, as the 100th anniversary of Max von Laue's 1914 Nobel prize for discovering the diffraction of X-rays by crystals. This chronological list of biophysically notable protein and nucleic acid structures is loosely based on a review in the Biophysical Journal. The list includes all the first dozen distinct structures, those that broke new ground in subject or method, and those that became model systems for work in future biophysical areas of research.
Myoglobin
1960 - Myoglobin was the very first high-resolution crystal structure of a protein molecule. Myoglobin cradles an iron-containing heme group that reversibly binds oxygen for use in powering muscle fibers, and those first crystals were of myoglobin from the sperm whale, whose muscles need copious oxygen storage for deep dives. The myoglobin 3-dimensional structure is made up of 8 alpha-helices, and the crystal structure showed that their conformation was right-handed and very closely matched the geometry proposed by Linus Pauling, with 3.6 residues per turn and backbone hydrogen bonds from the peptide NH of one residue to the peptide CO of residue i+4. Myoglobin is a model system for many types of biophysical studies, especially involving the binding process of small ligands such as oxygen and carbon monoxide.
Hemoglobin
1960 - The Hemoglobin crystal structure showed a tetramer of two related chain types and was solved at much lower resolution than the monomeric myoglobin, but it clearly had the same basic 8-helix architecture (now called the "globin fold"). Further hemoglobin crystal structures at higher resolution [PDB 1MHB, 1DHB) soon showed the coupled change of |
https://en.wikipedia.org/wiki/Quot%20scheme | In algebraic geometry, the Quot scheme is a scheme parametrizing sheaves on a projective scheme. More specifically, if X is a projective scheme over a Noetherian scheme S and if F is a coherent sheaf on X, then there is a scheme whose set of T-points is the set of isomorphism classes of the quotients of that are flat over T. The notion was introduced by Alexander Grothendieck.
It is typically used to construct another scheme parametrizing geometric objects that are of interest such as a Hilbert scheme. (In fact, taking F to be the structure sheaf gives a Hilbert scheme.)
Definition
For a scheme of finite type over a Noetherian base scheme , and a coherent sheaf , there is a functorsending towhere and under the projection . There is an equivalence relation given by if there is an isomorphism commuting with the two projections ; that is,is a commutative diagram for . Alternatively, there is an equivalent condition of holding . This is called the quot functor which has a natural stratification into a disjoint union of subfunctors, each of which is represented by a projective -scheme called the quot scheme associated to a Hilbert polynomial .
Hilbert polynomial
For a relatively very ample line bundle and any closed point there is a function sending
which is a polynomial for . This is called the Hilbert polynomial which gives a natural stratification of the quot functor. Again, for fixed there is a disjoint union of subfunctorswhereThe Hilbert polynomial is the Hilbert polynomial of for closed points . Note the Hilbert polynomial is independent of the choice of very ample line bundle .
Grothendieck's existence theorem
It is a theorem of Grothendieck's that the functors are all representable by projective schemes over .
Examples
Grassmannian
The Grassmannian of -planes in an -dimensional vector space has a universal quotientwhere is the -plane represented by . Since is locally free and at every point it represents a -plane, it has the cons |
https://en.wikipedia.org/wiki/Biotechcellence | Biotechcellence is a national level technical symposium. It was established by the co-operative efforts of Department of Biotechnology (DBT) and Association of Bio-technologists of Anna University. The symposium aims to highlight advancements in biotechnology that have taken place over the years in the medical, industrial, and agricultural fields. It provides an opportunity for participants to interact with prominent personalities associated with biotechnology and its related fields.
Centre for Biotechnology
The Centre for Biotechnology (CBT) was established in 1987 at the Anna University- supported by the Department of Biotechnology, Delhi and the University Grants Commission, Delhi, with the following objectives:
To provide educational and training facilities in different areas of Biotechnology
To carry out fundamental research in the frontier areas of Biotechnology and
To promote research and consultancy activities in the development of various areas of Biotechnology
The Centre For Biotechnology was one of the first departments to offer Industrial Biotechnology (IBT) as a professional course, and later began courses in Pharmaceutical Technology and Food Technology as added specializations.
History
Biotechcellence was started in the year 1994 by the Association of Biotechnologists, Anna University. Biotechcellence has hosted many notable people of both scientific and industrial backgrounds including James Watson, Jules Hoffmann, and Dr. Madhan Babu, Cambridge University.
Biotechcellence 2017
Biotechcellence 2017, the 23rd edition of Biotechcellence, was hosted from March 9-11, 2017 at Anna University. It consists of the symposium, events and workshops.
The following events were held as a part of Biotechcellence 2017:
Oral Presentation
Poster Presentation
Bacteriography
Pick Your Brains
Cerebrus
5+ Online Events
The workshops a part of Biotechcellence 2017 were:
Stem Cell Technology
Food Adulteration Analysis
Bio-Informatics
References
Website
|
https://en.wikipedia.org/wiki/Suslin%20homology | In mathematics, the Suslin homology is a homology theory attached to algebraic varieties. It was proposed by Suslin in 1987, and developed by . It is sometimes called singular homology as it is analogous to the singular homology of topological spaces.
By definition, given an abelian group A and a scheme X of finite type over a field k, the theory is given by
where C is a free graded abelian group whose degree n part is generated by integral subschemes of , where is an n-simplex, that are finite and surjective over .
References
Algebraic geometry |
https://en.wikipedia.org/wiki/Smooth%20topology | In algebraic geometry, the smooth topology is a certain Grothendieck topology, which is finer than étale topology. Its main use is to define the cohomology of an algebraic stack with coefficients in, say, the étale sheaf .
To understand the problem that motivates the notion, consider the classifying stack over . Then in the étale topology; i.e., just a point. However, we expect the "correct" cohomology ring of to be more like that of as the ring should classify line bundles. Thus, the cohomology of should be defined using smooth topology for formulae like Behrend's fixed point formula to hold.
Notes
References
Unfortunately this book uses the incorrect assertion that morphisms of algebraic stacks induce morphisms of lisse-étale topoi. Some of these errors were fixed by .
Algebraic geometry |
https://en.wikipedia.org/wiki/Fast%20interrupt%20request | Fast interrupt request (FIQ) is a specialized type of interrupt request, which is a standard technique used in computer CPUs to deal with events that need to be processed as they occur, such as receiving data from a network card, or keyboard or mouse actions. FIQs are specific to the ARM architecture, which supports two types of interrupts; FIQs for fast, low-latency interrupt handling, and standard interrupt requests (IRQs), for more general interrupts.
An FIQ takes priority over an IRQ in an ARM system. Also, only one FIQ source at a time is supported. This helps reduce interrupt latency as the interrupt service routine can be executed directly without determining the source of the interrupt. A context save is not required for servicing an FIQ since it has its own set of banked registers. This reduces the overhead of context switching.
FIQ mode has many banked register and hence not requiring major context switching i.e. the PUSH and POP operations. This is why it's called as fast interrupt.
FIQ is mainly used for data transfers like DMA operation.
FIQ or fast interrupts can be disabled by clearing the F bit in the CPSR(Current Program Status Register)
register
References
External links
Debugging ARM kernels using fast interrupts, LWN.net, May 29, 2014, by Daniel Thompson
Interrupts |
https://en.wikipedia.org/wiki/The%20Intercept | The Intercept is an online American nonprofit news organization that publishes articles and podcasts.
The Intercept has published in English since its founding in 2014, and in Portuguese since the 2016 launch of the Brazilian edition staffed by a local team of Brazilian journalists. The organization has been involved in several controversies.
History
The Intercept was founded by journalists Glenn Greenwald, Jeremy Scahill, and Laura Poitras. It was launched in February 2014 by First Look Media with funding by eBay co-founder Pierre Omidyar. The publication initially reported on documents released by Edward Snowden. Co-founders Greenwald and Poitras subsequently left amid public disagreements about the leadership and direction of the organization. In January 2023 it spun off from the First Look Institute as an independent nonprofit organization.
The Intercept Brasil
In August 2016, The Intercept launched a Brazilian version, The Intercept Brasil, edited in Portuguese, aimed at Brazilian political news, and produced by a team of Brazilian journalists. The Intercept Brasil also features translated news from the English edition.
In June 2019, The Intercept Brasil released leaked Telegram messages exchanged between judge Sérgio Moro, prosecutor Deltan Dallagnol and other Operation Car Wash prosecutors. In the wake of the reporting, the Brazilian government in January 2020 indicted Glenn Greenwald on cybercrimes charges in connection with his efforts to protect his sources, the legitimacy of President Jair Bolsonaro's election was called into question, and the Supreme Federal Court of Brazil in April–June 2021 annulled former President Luiz Inácio Lula da Silva's 2018 conviction on corruption charges.
Podcasts
Intercepted
Intercepted is a weekly podcast hosted by investigative journalist Jeremy Scahill and produced by First Look Media. The podcast uses interviews, round table discussions, and journalistic narrative to present investigative reporting, analysis, an |
https://en.wikipedia.org/wiki/Indicator%20vector | In mathematics, the indicator vector or characteristic vector or incidence vector of a subset T of a set S is the vector such that if and if
If S is countable and its elements are numbered so that , then where if and if
To put it more simply, the indicator vector of T is a vector with one element for each element in S, with that element being one if the corresponding element of S is in T, and zero if it is not.
An indicator vector is a special (countable) case of an indicator function.
Example
If S is the set of natural numbers , and T is some subset of the natural numbers, then the indicator vector is naturally a single point in the Cantor space: that is, an infinite sequence of 1's and 0's, indicating membership, or lack thereof, in T. Such vectors commonly occur in the study of arithmetical hierarchy.
Notes
Basic concepts in set theory
Vectors (mathematics and physics) |
https://en.wikipedia.org/wiki/Net%20neutrality%20in%20the%20Netherlands | On June 4, 2012, the Netherlands became the first country in Europe and the second in the world, after Chile, to enact a network neutrality law. The main net neutrality provision of this law requires that "Providers of public electronic communication networks used to provide Internet access services as well as providers of Internet access services will not hinder or slow down services or applications on the Internet".
History
The 2009 EU Telecoms Package left much leeway for member states to implement their own net neutrality directives. The first proposal by the Minister of Economic Affairs, Agriculture and Innovation was submitted to the House of Representatives on November 3, 2010.
In April 2011, Dutch telecommunications company KPN announced that it would start to block services such as VoIP and instant messaging unless customers paid a fee. Later that week, Vodafone said it was already blocking those services. During an investors meeting in May, KPN admitted to using deep packet inspection. These events accelerated the implementation of net neutrality, as a house majority was against the blocking of specific Internet services.
On June 22, 2011, the house voted for the amendment of the Telecommunications Act with net neutrality regulations. The Labour Party mistakenly voted for an amendment supported by the Christian parties SGP, CU and CDA that would allow filtering by ISPs for ideological reasons. A rectification was later plugged into an unrelated amendment.
The amendment was passed by the Senate in 2012, and with the publication of the amendment and the rectification in the official journal of the Netherlands on June 4 and June 5, respectively, network neutrality became the law.
Overview
Article 7.4a of the Telecommunications Act prohibits the hindrance or slowing down of services or applications on the Internet by ISPs and network owners. Deviation from this rule is only allowed:
to reduce congestion, while treating similar traffic equally;
to pre |
https://en.wikipedia.org/wiki/Postcoital%20bleeding | Postcoital bleeding is bleeding from the vagina after sexual intercourse and may or may not be associated with pain. The bleeding can be from the uterus, cervix, vagina and other tissue or organs located near the vagina. Postcoital bleeding can be one of the first indications of cervical cancer. There are other reasons why vaginal bleeding may occur after intercourse. Some people will bleed after intercourse for the first time but others will not. The hymen may bleed if it is stretched since it is thin tissue. Other activities may have an effect on the vagina such as sports and tampon use. Postcoital bleeding may stop without treatment. In some instances, postcoital bleeding may resemble menstrual irregularities. Postcoital bleeding may occur throughout pregnancy. The presence of cervical polyps may result in postcoital bleeding during pregnancy because the tissue of the polyps is more easily damaged. Postcoital bleeding can be due to trauma after consensual and non-consensual sexual intercourse.
A diagnosis to determine the cause will include obtaining a medical history and assessing the symptoms. Treatment is not always necessary.
Causes
Vaginal bleeding after sex is a symptom that can indicate:
pelvic inflammatory disease
pelvic organ prolapse
uterine disease
chlamydia or other sexually transmitted infection
atrophic vaginitis
childbirth
inadequate vaginal lubrication
benign polyps
cervical erosion (inflammation of the cervix)
cervical or vaginal cancer
anatomical abnormality of the uterus, vagina or both.
pregnancy
endometrial polyps
endometrial hyperplasia
endometrial carcinoma
leiomyomata
cervicitis
cervical dysplasia
endometriosis
coagulation defects
trauma
Bleeding from hemorrhoids and vulvar lesions can be mistaken for postcoital bleeding. Post coital bleeding can occur with discharge, itching, or irritation. This may be due to Trichomonas or Candida. A lack of estrogen can make vaginal tissue thinner and more suscepti |
https://en.wikipedia.org/wiki/Toponome | The toponome is the spatial network code of proteins and other biomolecules in morphologically intact cells and tissues. It is mapped and decoded by imaging cycler microscopy (ICM) in situ able to co-map many thousand supermolecules in one sample (tissue section or cell sample at high subcellular resolution). The term "toponome" is derived from the ancient Greek nouns "topos" (τόπος: "place, position") and "nomos" (νόμος: "law"), and the term "toponomics" refers to the study of the toponome. It was introduced by Walter Schubert in 2003. It addresses the fact that the network of biomolecules in cells and tissues follows topological rules enabling coordinated actions. For example, the cell surface toponome provides the spatial protein interaction code for the execution of a cell movement, a "code of conduct". This is intrinsically dependent on the specific spatial arrangement of similar and dissimilar compositions of supermolecules (compositional periodicity) with a specific spatial order along a cell surface membrane. This spatial order is periodically repeated when the cell tries to enter the exploratory state from the spherical state (spatial periodicity). This spatial toponome code is hierarchically organized with lead biomolecule(s), anti-colocated (absent) biomolecule(s) and wildcard molecules which are variably associated with the lead biomolecule(s). It has been shown that inhibition of lead molecule(s) in a surface membrane leads to disassembly of the corresponding biomolecular network and loss of function.
Citations
Systems biology
Bioinformatics
Omics
Topology |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.