source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Comparison%20of%20audio%20network%20protocols | The following is a comparison of audio over Ethernet and audio over IP audio network protocols and systems.
Notes
References
Audio network protocols
Audio network protocols |
https://en.wikipedia.org/wiki/Intel%20Binary%20Compatibility%20Standard | The Intel Binary Compatibility Standard (iBCS) is a standardized application binary interface (ABI) for Unix operating systems on Intel-386-compatible computers, published by AT&T, Intel and SCO in 1988, and updated in 1990. It extends source-level standards such as POSIX and XPG3 by standardizing various operating system interfaces, including the filesystem hierarchy layout (i.e., the locations of system files and installed programs), so that Unix programs would run on the various vendor-specific Unix implementations for Intel hardware (such as Xenix, SCO Unix and System V implementations). The second edition, announced in 1990, added an interface specification for VGA graphics.
iBCS, edition 2, was supported by various Unix versions, such as UnixWare and third-party implementations. A Linux implementation was developed ca. 1994, enabling Linux to run commercial Unix applications such as WordPerfect.
There have been several security issues in various iBCS implementations over the years.
See also
Filesystem Hierarchy Standard (FHS)
Linux Standard Base (LSB)
References
Unix history
Unix standards |
https://en.wikipedia.org/wiki/Amazon%20Aurora | Amazon Aurora is a relational database service developed and offered by Amazon Web Services beginning in October 2014. Aurora is available as part of the Amazon Relational Database Service (RDS).
History
Aurora offered MySQL compatible service upon its release in 2014. It added PostgreSQL compatibility in October 2017.
In August 2017, Aurora Fast Cloning (copy-on-write) feature was added allowing customers to create copies of their databases. In May 2018, Aurora Backtrack was added which allows developers to rewind database clusters without creating a new one. It became possible to stop and start Aurora Clusters in September 2018. In August 2018, Amazon began to offer a serverless version.
In 2019 the developers of Aurora won the SIGMOD Systems Award for fundamentally redesigning relational database storage for cloud environments.
Features
Aurora automatically allocates database storage space in 10-gigabyte increments, as needed, up to a maximum of 128 terabytes. Aurora offers automatic, six-way replication of those chunks across three availability zones for improved availability and fault-tolerance.
Aurora provides users with performance metrics, such as query throughput and latency. It provides fast database cloning.
Aurora Multi-Master allows creation of multiple read-write instances in an Aurora database across multiple availability zones, which enables uptime-sensitive applications to achieve continuous write availability through instance failure.
MySQL compatibility
Amazon designed Aurora to be compatible with MySQL, meaning that tools for querying or managing MySQL databases (such as the command-line client and the MySQL Workbench graphical user-interface) can be used. As of December 2021, Amazon Aurora is compatible with MySQL 5.6, 5.7, and 8.0. It supports InnoDB as a storage engine.
Performance
Amazon claims fivefold performance improvements on benchmarking tests over MySQL on the same hardware, due to "tightly integrating the database engine with an SSD-based virtualized storage layer purpose-built for database workloads, reducing writes to the storage system, minimizing lock contention and eliminating delays created by database process threads". Other independent tests have shown that Aurora performs better than competing technologies on some, but not all, combinations of workload and instance type.
See also
Amazon Relational Database Service
Amazon DocumentDB
References
External links
Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases - SIGMOD'17 (ACM digital library)
2014 software
Aurora
Cloud databases |
https://en.wikipedia.org/wiki/Winograd%20schema%20challenge | The Winograd schema challenge (WSC) is a test of machine intelligence proposed in 2012 by Hector Levesque, a computer scientist at the University of Toronto. Designed to be an improvement on the Turing test, it is a multiple-choice test that employs questions of a very specific structure: they are instances of what are called Winograd schemas, named after Terry Winograd, professor of computer science at Stanford University.
On the surface, Winograd schema questions simply require the resolution of anaphora: the machine must identify the antecedent of an ambiguous pronoun in a statement. This makes it a task of natural language processing, but Levesque argues that for Winograd schemas, the task requires the use of knowledge and commonsense reasoning.
Nuance Communications announced in July 2014 that it would sponsor an annual WSC competition, with a prize of $25,000 for the best system that could match human performance. However, the prize is no longer offered.
The challenge is considered defeated in 2019 since a number of transformer-based language models achieved accuracies of over 90%.
Background
The Winograd Schema Challenge was proposed in the spirit of the Turing test. Proposed by Alan Turing in 1950, the Turing test plays a central role in the philosophy of artificial intelligence. Turing proposed that, instead of debating whether a machine can think, the science of AI should be concerned with demonstrating intelligent behavior, which can be tested. But the exact nature of the test Turing proposed has come under scrutiny, especially since an AI chatbot named Eugene Goostman claimed to pass it in 2014. One of the major concerns with the Turing test is that a machine could easily pass the test with brute force and/or trickery, rather than true intelligence.
The Winograd schema challenge was proposed in 2012 in part to ameliorate the problems that came to light with the nature of the programs that performed well on the test.
Turing's original proposal was what he called the imitation game, which involves free-flowing, unrestricted conversations in English between human judges and computer programs over a text-only channel (such as teletype). In general, the machine passes the test if interrogators are not able to tell the difference between it and a human in a five-minute conversation.
Weaknesses of the Turing test
The performance of Eugene Goostman exhibited some of the Turing test's problems. Levesque identifies several major issues, summarized as follows:
Deception: The machine is forced to construct a false identity, which is not part of intelligence.
Conversation: A lot of interaction may qualify as "legitimate conversation"—jokes, clever asides, points of order—without requiring intelligent reasoning.
Evaluation: Humans make mistakes and judges often would disagree on the results.
Winograd schemas
The key factor in the WSC is the special format of its questions, which are derived from Winograd schemas. Questions of this fo |
https://en.wikipedia.org/wiki/Rich-club%20coefficient | The rich-club coefficient is a metric on graphs and networks, designed to measure the extent to which well-connected nodes also connect to each other. Networks which have a relatively high rich-club coefficient are said to demonstrate the rich-club effect and will have many connections between nodes of high degree. The rich-club coefficient was first introduced in 2004 in a paper studying Internet topology.
The "Rich-club" effect has been measured and noted on scientific collaboration networks and air transportation networks. It has been shown to be significantly lacking on protein interaction networks.
Definition
Non-normalized form
The rich-club coefficient was first introduced as an unscaled metric parametrized by node degree ranks. More recently, this has been updated to be parameterized in terms of node degrees k , indicating a degree cut-off. The rich-club coefficient for a given network N is then defined as:
where is the number of edges between the nodes of degree greater than or equal to k, and is the number of nodes with degree greater than or equal to k. This measures how many edges are present between nodes of degree at least k, normalized by how many edges there could be between these nodes in a complete graph. When this value is close to 1 for values of k close to , it is interpreted that high degree nodes of the network are well connected. The associated subgraph of nodes with degree at least k is also called the "Rich Club" graph.
Normalized for topology randomization
A criticism of the above metric is that it does not necessarily imply the existence of the rich-club effect, as it is monotonically increasing even for random networks. In certain degree distributions, it is not possible to avoid connecting high degree hubs. To account for this, it is necessary to compare the above metric to the same metric on a degree distribution preserving randomized version of the network. This updated metric is defined as:
where is the rich-club metric on a maximally randomized network with the same degree distribution of the network under study. This new ratio discounts unavoidable structural correlations that are a result of the degree distribution, giving a better indicator of the significance of the rich-club effect.
For this metric, if for certain values of k we have , this denotes the presence of the rich-club effect.
Generalizations
General richness properties
The natural definition of a node's "richness" is its number of neighbours. If instead we replace this with a generic richness metric on nodes r, then we can rewrite the unscaled Rich-Club coefficient as:
Where we are instead considering the sub graph on only nodes with a richness measure of at least r. For example, on scientific collaboration networks, replacing the degree richness (number of coauthors) with a strength richness (number of published papers), the topology of the rich club graph changes dramatically.
Related metrics
Assortativity
The Assortativi |
https://en.wikipedia.org/wiki/Eudonia%20linealis | Eudonia linealis is a species of moth in the family Crambidae. This species is endemic to New Zealand. It is classified as "Data Deficient" by the Department of Conservation.
Taxonomy
It was originally described by Francis Walker in 1866 using a specimen collected in Nelson by T. R. Oxley and named Scoparia linealis. Hudson discussed this species in his 1928 publication The Butterflies and Moths of New Zealand as a synonym of Scoparia submarginalis. 1988 John S. Dugdale placed the species in the genus Eudonia. There is debate as to whether this species is recognised as the type specimen is lacking its abdomen. It has been hypothesized that the holotype of this species, held at the Natural History Museum, London, may be a worn specimen of Eudonia philerga.
Description
Walker described the species as follows:
Distribution
This species is endemic to New Zealand. The type specimen was collected in Nelson. This species has possibly been rediscovered at Canaan Downs on Takaka Hill by Ian Millar.
Conservation status
This species has been classified as having the "Data Deficient" conservation status under the New Zealand Threat Classification System.
References
External links
Image of holotype specimen
Moths described in 1866
Eudonia
Endemic fauna of New Zealand
Moths of New Zealand
Taxa named by Francis Walker (entomologist)
Endemic moths of New Zealand |
https://en.wikipedia.org/wiki/Gwapings%20Live%21 | Gwapings Live! is a Philippine television variety show broadcast by GMA Network. Hosted by Mark Anthony Fernandez, Jomari Yllana, Eric Fructuoso and Jao Mapa, it premiered on October 4, 1992. The show concluded on October 10, 1993, with a total of 51 episodes.
References
1992 Philippine television series debuts
1993 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine variety television shows |
https://en.wikipedia.org/wiki/Runa%20Capital | Runa Capital is an international venture capital firm headquartered in Luxembourg that invests in deep tech (AI, machine learning, middleware, open source, etc), cloud business software, fintech, edutech and digital health startups in early stages. From 2010 through 2022 Runa Capital raised 3 funds and invested in over 100 companies in more than 14 countries of Europe and North America, including Nginx, MariaDB, Zopa, Brainly, drchrono, Smava, and Mambu.
History
Runa Capital was founded by technological entrepreneurs Serg Bell and Ilya Zubarev (founders of Acronis and Parallels), and their MIPT university friend Dmitry Chikhachev. The idea of the venture firm took shape in 2009 and was formally incorporated in 2010. The partners contributed their own money into the first fund and raised capital from friends and other international investors including Achim Weiss and Andreas Gauger, founders of German hosting provider 1&1, and Edward Nicholson, former CEO of Brunswick-UBS.
In 2011, Andre Bliznyuk joined Runa Capital as a General partner. In 2022, the firm promoted its principials Konstantin Vinogradov and Michael Fanfant to general partners focusing on Europe and the U.S., respectively. As of June 2022, the firm had over 427 million dollars under management in 3 funds.
Funds
Runa Capital I, firm's first namesake fund was launched in 2010, reached its final size of $135 million by 2012 and was focused on investments from seed to Series B stage. The initial idea was to fund globally oriented Eastern European startups in the fields of cloud computing, machine learning, virtualization, mobile and internet apps, but later the partners expanded their investment area to Europe and USA.
Runa Capital II was launched in 2014 and reached $135 million by 2016 with large commitments from the first fund's backers. The second fund aimed at Series A and B rounds. The firm's new office was opened in California in 2015.
Runa Capital III exceeded the target sum of $135 and reached $157 million in May 2020. The third fund followed the focus on deep tech with additional interest towards quantum computing startups.
Runa Capital Opportunity Fund I was launched in May 2022 and raised $69 million by Autumn 2022.
Investments
Runa Capital invests from $1 million to $10 million, largely in Series A rounds. From 2010 through 2022 it invested in over 100 companies, equally split between North America and Europe:
Affiliated funds
Quantum Wave (QWave) headquartered in Boston is a $30 million early-stage fund focused on companies working in the field of quantum technology. Serg Bell is QWave's venture partner. According to TechCrunch, QWave effectively served as a "materials science" arm for Runa Capital. Its notable investments include Swiss quantum cryptography startup ID Quantique that was acquired by SK Telecom in 2018.
References
External links
Venture capital firms of the United States
Financial services companies based in California
Companies based |
https://en.wikipedia.org/wiki/Culture%20Complex%20station | Culture Complex () is an underground station of the Gwangju Metro Line 1 in Gwangsan-dong, Dong District, Gwangju, South Korea.
Station Layout
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Dong District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Geumnamno%204%28sa%29-ga%20station | Geumnamno 4(sa)-ga station () is a station of Gwangju Metro Line 1 in Chunggeum-dong, Dong District, Gwangju, South Korea.
Station Layout
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Dong District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Geumnamno%205%28o%29-ga%20station | Geumnamno 5(o)-ga station () is a station of Gwangju Metro Line 1 in Buk-dong, Buk District, Gwangju, South Korea.
Station Layout
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Buk District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Dolgogae%20station | Dolgogae station () is a station of Gwangju Metro Line 1 in Wolsan-dong, Nam District, Gwangju, South Korea.
Station layout
Exits
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Buk District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Nongseong%20station | Nongseong station () is a station of Gwangju Metro Line 1 in Nongseong-dong, Seo District, Gwangju, South Korea.
Station layout
Exits
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Seo District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Hwajeong%20station%20%28Gwangju%29 | Hwajeong station () is a station of Gwangju Metro Line 1 in Hwajeong-dong, Seo District, Gwangju, South Korea.
Station layout
Exits
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Seo District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Ssangchon%20station | Ssangchon station () is a station of Gwangju Metro Line 1 in Ssangchon-dong, Seo District, Gwangju, South Korea.
Station layout
Exits
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Seo District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/Sangmu%20station | Sangmu station () is a station of Gwangju Metro Line 1 in Maneuk-dong, Seo District, Gwangju, South Korea.
Station layout
Exits
External links
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Cyber station information from Gwangju Metropolitan Rapid Transit Corporation
Gwangju Metro stations
Seo District, Gwangju
Railway stations in South Korea opened in 2004 |
https://en.wikipedia.org/wiki/GR%201 | The long distance footpath GR 1 is one of the paths in the grand randonnée network in France. It takes in the great forests outside Paris.
Course
Porte Maillot
The starting point is the Porte Maillot metro station.
Bois de Boulogne to Forêt de Marly
The path crosses the bois de Boulogne, goes around the hippodrome de Longchamp, crosses the Seine by the Avre footbridge (built by Gustave Eiffel) and goes into Saint-Cloud.
It crosses the parc de Saint-Cloud and comes out at Marnes-la-Coquette.
It comes to Vaucresson, then La Celle-Saint-Cloud, the upper part of Louveciennes and the edge of the park of the former Château de Marly then enters the Marly Forest.
From Forêt de Marly to Forêt de Rambouillet
It goes through Feucherolles (where it will eventually terminate), the small village of Davron, Thiverval-Grignon and comes to Neauphle-le-Vieux zigzagging through the countryside via Saint-Germain-de-la-Grange.
It comes to Méré then Montfort-l'Amaury where it enters the Forest of Rambouillet.
It comes out of the forest at Gazeran to go through Rambouillet town, then back into the forest as far as Saint-Arnoult-en-Yvelines.
From Forêt de Rambouillet to Forêt de Fontainebleau
It then crosses the Forest of Saint-Arnoult to Dourdan and goes along the valley of the river Orge as far as Breuillet.
It crosses the wood of Baville de Saint-Yon to Boissy-sous-Saint-Yon going through Saint-Sulpice-de-Favières, then Torfou and Lardy.
Then it goes into the parc naturel régional of the French Gâtinais, through Janville-sur-Juine, Boissy-le-Cutté, D'Huison-Longueville, Vayres-sur-Essonne, Boutigny-sur-Essonne, Buno-Bonnevaux, turns off towards Malesherbes following the valley of the river Essonne, then goes through the Forest of Fontainebleau from Le Vaudoué to Melun.
From Forêt de Fontainebleau to Forêt de Crécy
It passes in front of the Château de Vaux-le-Vicomte, then goes to Blandy, Champeaux, Andrezel, Verneuil-l'Étang, Chaumes-en-Brie, Fontenay-Trésigny, Marles-en-Brie, La Houssaye-en-Brie and crosses the Forest of Crécy up to Crécy-la-Chapelle.
It goes through Bouleurs and Nanteuil-lès-Meaux, arriving at the river Marne at Meaux.
From Forêt de Crécy to Feucherolles
The GR 1 completes its circuit at Feucherolles.
References
External links
Comité Régional de la Randonnée Pédestre d'Île-de-France
GR1 Around Ile de France region (Full itinerary)
Streets in Paris
Roads in France |
https://en.wikipedia.org/wiki/National%20Highway%2013%20%28India%29 | National Highway 13 (NH 13), part of the larger Trans-Arunachal Highway network, is a 1,559 km long two-lane national highway across Arunachal Pradesh in India running from Tawang in northwest to Wakro in southeast. Entire route became operational in 2018 when 6.2 km long Dibang River Bridge was completed across Dibang River. Sela Tunnel, a shorter alternative route with target completion by Jan/Feb 2022, will provide all-weather connectivity. Before the renumbering of highways, it was known as NH 229 and NH52. This strategically important highway enhances Indian military's capabilities in combating the threat of China's Western Theater Command opposite India's eastern sector of Line of Actual Control.
Route
NH13 links Tawang, Bomdila, Nechipu, Seppa, Sagalie, Ziro, Daporijo, Along, Pasighat, Tezu and terminates at its junction with NH-15 near Wakro in the state of Arunachal Pradesh.
Junctions
near Joram
near Hoj
near Pasighat
near Pasighat
near Meka
near Meka
near Hawacamp
Terminal near Wakro.
See also
Arunachal Frontier Highway, proposed along Indo-China border across upper Arunachal Pradesh
Arunachal East-West Corridor, proposed across foothills of lower upper Arunachal Pradesh
List of National Highways in India (by Highway Number)
List of National Highways in India
National Highways Development Project
References
External links
NH 13 on OpenStreetMap, retrieved 19 September 2021.
National highways in India
National Highways in Arunachal Pradesh |
https://en.wikipedia.org/wiki/Link-centric%20preferential%20attachment | In mathematical modeling of social networks, link-centric preferential attachment
is a node's propensity to re-establish links to nodes it has previously been in contact with in time-varying networks. This preferential attachment model relies on nodes keeping memory of previous neighbors up to the current time.
Background
In real social networks individuals exhibit a tendency to re-connect with past contacts (ex. family, friends, co-workers, etc.) rather than strangers. In 1970, Mark Granovetter examined this behaviour in the social networks of a group of workers and identified tie strength, a characteristic of social ties describing the frequency of contact between two individuals. From this comes the idea of strong and weak ties, where an individual's strong ties are those she has come into frequent contact with. Link-centric preferential attachment aims to explain the mechanism behind strong and weak ties as a stochastic reinforcement process for old ties in agent-based modeling where nodes have long-term memory.
Examples
In a simple model for this mechanism, a node's propensity to establish a new link can be characterized solely by , the number of contacts it has had in the past. The probability for a node with n social ties to establish a new social tie could then be simply given by
where c is an offset constant. The probability for a node to re-connect with old ties is then
Figure 1. shows an example of this process: in the first step nodes A and C connect to node B, giving B a total of two social ties. With c = 1, in the next step B has a probability P(2) = 1/(2 + 1) = 1/3 to create a new tie with D, whereas the probability to reconnect with A or C is twice that at 2/3.
More complex models may take into account other variables, such as frequency of contact, contact and intercontact duration, as well as short term memory effects.
Effects on the spreading of contagions / weakness of strong ties
Understanding the evolution of a network's structure and how it can influence dynamical processes has become an important part of modeling the spreading of contagions. In models of social and biological contagion spreading on time-varying networks link-centric preferential attachment can alter the spread of the contagion to the entire population. Compared to the classic rumour spreading process where nodes are memory-less, link-centric preferential attachment can cause not only a slower spread of the contagion but also one less diffuse. In these models an infected node's chances of connecting to new contacts diminishes as their size of their social circle grows leading to a limiting effect on the growth of n. The result is strong ties with a node's early contacts and consequently the weakening of the diffusion of the contagion.
See also
BA model
Network science
Interpersonal tie
References
Network theory
Stochastic processes |
https://en.wikipedia.org/wiki/Shared%20snapshot%20objects | In distributed computing, a shared snapshot object is a type of data structure, which is shared between several threads or processes. For many tasks, it is important to have a data structure, that can provide a consistent view of the state of the memory. In practice, it turns out that it is not possible to get such a consistent state of the memory by just accessing one shared register after another, since the values stored in individual registers can be changed at any time during this process. To solve this problem, snapshot objects store a vector of n components and provide the following two atomic operations: update(i,v) changes the value in the ith component to v, and scan() returns the values stored in all n components.
Snapshot objects can be constructed using atomic single-writer multi-reader shared registers.
In general, one distinguishes between single-writer multi-reader (swmr) snapshot objects and multi-writer multi-reader (mwmr) snapshot objects. In a swmr snapshot object, the number of components matches the number of processes and only one process Pi is allowed to write to the memory position i and all the other processes are allowed to read the memory. In contrast, in a mwmr snapshot object all processes are allowed to write to all positions of the memory and are allowed to read the memory as well.
General
A shared memory is partitioned into multiple parts. Each of these parts holds a single data value. In the single-writer multi-reader case each process Pi has a memory position i assigned and only this process is allowed to write to the memory position. However, every process is allowed to read any position in the memory. In the multi-writer multi-reader case, the restriction changes and any process is allowed to change any position of the memory. Any process Pi {1,...,n} in an n-process system is able to perform two operations on the snapshot object: scan() and update(i,v). The scan operation has no arguments and returns a consistent view of the memory. The update(i,v) operation updates the memory at the position i with the value v.
Both types of operations are considered to occur atomically between the call by the process and the return by the memory. More generally speaking, in the data vector each entry dk corresponds to the argument of the last linearized update operation, which updates part k of the memory.
In order to get the full benefit of shared snapshot objects, in terms of simplifications for validations and constructions, there are two other restrictions added to the construction of snapshot objects. The first restriction is an architectural one, meaning that any snapshot object is constructed only with single-writer multi-reader registers as the basic element. This is possible for single-writer multi-reader snapshots. For multi-writer multi-reader snapshot objects it is possible to use multi-reader multi-writer registers, which can in turn be constructed from single-writer multi-reader registers.
In distribut |
https://en.wikipedia.org/wiki/Jorel%27s%20Brother | Jorel's Brother (Portuguese: Irmão do Jorel) is a Brazilian animated television series created by Juliano Enrico and produced by TV Quase and Copa Studio for Cartoon Network Brazil since 2012. The series debuted on September 22, 2014, and is notable for being the first animated production exclusively produced by Cartoon Network Brazil (although their first very original production was the short series Santo vs The Clones), in which was confirmed that the show premiere in the region on February 2, 2015.
On December 8, 2015, it was announced that Jorel's Brother had been renewed for a second season. On May 25, 2017, the series was renewed for a third season. On September 24, 2020, the series was picked up for distribution rights by Cake Entertainment.
Plot
The series shows the daily life of an eccentric and extravagant family. Jorel is the middle child, with silky hair and a sweet and attractive way to win girls, which makes him the most popular guy in town. However, the show does not revolve around him, but around his younger brother, a shy and nameless boy just called "Jorel's Brother". Being overshadowed by the fame and popularity of his older brother, Jorel's Brother tries to gain his own identity and be someone important in the family. Each situation revolves around a typical confusion set in a Brazilian family atmosphere of late 80's, amid surreal and nonsense adventures, always from the perspective of Jorel's Brother.
Characters
Main
Jorel's Brother (voiced by Andrei Duarte): A small, cowardly and naive 8-year-old boy with curly hair and crooked teeth. He is the youngest son of the family who seeks his own identity and tries to be popular, like his older brother Jorel. Despite his efforts, he always returns to his original status of an ordinary kid at the end of every episode. Jorel's Brother's real name was never revealed on the show.
Jorel (voiced by Juliano Enrico): Jorel's Brother's elder brother. With an athletic physique, a calm personality, and long silky hair, he is regarded as the pride of the family, loved by all the girls and the most popular kid in the neighborhood. He always wins and gets to be the center of attention. Jorel's Brother tries to be as popular as him, but he lives to fail. His voice was never revealed on the show.
Mr. Edson (voiced by César Marchetti): Jorel's Brother's father. He is a neurotic father who dedicates his spare time to the revolutionary theater and conceptual cinema. He's always giving his children advice based on his crazy life experiences.
Mrs. Danuza (voiced by Tânia Gaidarji): Jorel's Brother's mother. She is an active, athletic woman, and a former Olympic champion on several modalities. She's constantly concerned about her children's well-being.
Granny Gigi (voiced by Cecília Lemes): Maternal grandmother of Jorel's Brother. She's a sarcastic old lady who's tough and has a strange lollipop-sucking obsession. When she was younger, she performed dangerous and daring stunts in action movie |
https://en.wikipedia.org/wiki/Range%20query%20tree | In computer science, a Range Query Tree, or RQT, is a term for referring to a data structure that is used for performing range queries and updates on an underlying array, which is treated as the leaves of the tree. RQTs are, in principle, complete binary trees with a static structure, where each node stores the result of applying a fixed binary operation to a range of the tree's leaves (or elements of the underlying array).
A Range Query Tree uses O(n) storage, where n is the size of the array on top of which the structure is built, and can be constructed in O(n) time. Range Query Trees support performing range queries and updates on its leaves in O(log n) time.
Range Query Trees are usually wrongly referred to as Segment Trees or Range Trees, both of them inaccurate terms since they also refer to other already existing structures.
Range Query Trees can be generalized to higher dimension spaces, and can also be implemented with two Fenwick Trees when the range operations are sums.
Structure description
A Range Query Tree is a complete binary tree that has a static structure, meaning that its content can be changed but not its size. The values of the underlying array over which the associative operation needs to be performed are stored in the leaves of the tree and the number of values have to be padded to the next power of two with the identity value for the associative operation used.
Each node of the tree represents an interval of the underlying array of values. The root node represents the whole padded length of the array and each of its two children represent the first and second half of the interval respectively. The nodes in the tree are generated recursively in this manner until they represent one single element in the underlying array.
Storage requirements
A Range Query Tree with an underlying array of size n (padded to a power of two) has n leaves and a total of nodes which requires O(n) storage requirement.
References
Trees (data structures)
Geometric data structures |
https://en.wikipedia.org/wiki/David%20Maher | David Maher is a computer scientist and the chief technology officer and executive vice president of Intertrust Technologies. He is also a Bell Labs Fellow and was chief architect for AT&T's STU-III secure voice, data and video products used by the White House and the United States Department of Defense.
Life
David Maher joined Intertrust Technologies in 1999 as the chief technology officer. Prior to joining Intertrust, Maher worked at AT&T where he held several positions including Head of Secure Systems Research Department. Maher holds a Ph.D. in mathematics from Lehigh University.
Prior to joining Intertrust, Maher was the chief scientist for AT&T Secure Communications Systems. While at AT&T, he was the security architect for AT&T's Internet services platform as well as the chief architect for the STU-III secure voice, data and video products which have been used by the White House and the Department of Defense. Maher joined Bell Labs in 1981 and was recognized as a Bell Labs Fellow for his work there.
Maher has also taught electrical engineering, mathematics, and computer science at several institutions.
References
Year of birth missing (living people)
Living people
American chief technology officers
American computer scientists
Scientists at Bell Labs
Lehigh University alumni
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/MusicHound | MusicHound (often stylized as musicHound) was a compiler of genre-specific music guides published in the United States by Visible Ink Press between 1996 and 2002. After publishing eleven album guides, the MusicHound series was sold to London-based Music Sales Group, whose company Omnibus Press had originally distributed the books outside America. The series' founding editor was Gary Graff, formerly a music critic with the Detroit Free Press.
Subtitled "The Essential Album Guide", each publication typically contained entries providing an overview of an artist's career and dividing their work into categories such as "what to buy", "what's next", "what to avoid" and "worth searching for". Among the MusicHound album guides were titles dedicated to rock, blues, classical, jazz, world music, swing, and soundtrack recordings. Further to the canine analogy in the series title, albums were graded according to a "bone" rating system: five bones constituting the highest score, down to a bold-rendered "woof!", signifying "dog food".
Graff has said that he had envisioned the books as buyer's guides, specifically: "something akin to a good record store clerk or that fellow shopper you meet while you're looking through the racks and with whom you strike up a spontaneous conversation". Gale-owned Visible Ink also published a series of VideoHound film guides, beginning with 1996's Golden Movie Retriever.
MusicHound Rock: The Essential Album Guide
Edited by Gary Graff and published in 1996, MusicHound Rock was the first guide in the series. A revised edition appeared in 1999, co-edited by Graff and Daniel Durchholz. Among the guide's reviewers were US music critics Joel Selvin (San Francisco Chronicle), Mark J. Petracca (Creem), Greg Kot (Chicago Tribune, Rolling Stone), Brian Mansfield (USA Today), Thor Christensen (Dallas Morning News, Spin), and Roger Catlin (Hartford Courant). Other contributors included: Gary Pig Gold, who went on to work on six subsequent MusicHound guides; Grant Alden and Peter Blackstock, co-founding editors of No Depression magazine; The Big Takeover publisher Jack Rabid, who had previously written for Trouser Presss record guide; Guitar World editor Alan Paul; and Anders Wright, news editor of the music website Wall of Sound. In 1996, the book contained entries for some 2500 artists; in this first edition, the reviewers deemed that 541 albums were worthy of a five-bone rating.
The 1999 edition came with a CD, supplied by Capitol Records, and included "What album changed your life?" sidebars written by celebrity musicians. Among the latter contributors were the following: Joan Baez, Peter Buck, Adam Clayton, Phil Collins, Jakob Dylan, Ben Harper, Mickey Hart, Lenny Kravitz, Simon LeBon, Stevie Nicks, Lou Reed, Robbie Robertson, Gene Simmons, Patti Smith, Paul Stanley, Sting and Pete Townshend. The book's foreword was written by Doug Fieger, singer and guitarist with the Knack. Writing in The Riverfront Times in July 1999, Jason Toon n |
https://en.wikipedia.org/wiki/Scoparia%20cordata | Scoparia cordata is a moth in the family Crambidae. It was described by Wei-Chun Li in 2012. It is found in Jiangxi, China.
References
Moths described in 2012
Scorparia |
https://en.wikipedia.org/wiki/Masque%20Attack | Masque Attack is the name of an iOS vulnerability identified and named by computer security company FireEye in July 2014. FireEye privately informed Apple Inc. of the issue on July 26, 2014 and disclosed the vulnerability to the public on November 10, 2014 through a blog post on their website. The vulnerability is identified to exist on iOS 7.1.1, 7.1.2, 8.0, 8.1 and 8.1.1 beta, and on jailbroken and non-jailbroken iOS devices. The vulnerability consists of getting users to download and install apps that have been deceptively created with the same bundle identifier as an existing legitimate app. The deceptive app can then replace and pose as the legitimate app, as long as the app was not one pre-installed along with iOS (i.e., the default Apple apps) – and thus, the reason FireEye gave for naming the vulnerability "Masque Attack".
Once the deceptive app is installed, the malicious parties can access any data entered by the user, such as account credentials.
On November 13, 2014, the United States Computer Emergency Readiness Team (US-CERT, part of the Department of Homeland Security) released Alert bulletin TA14-317A, regarding the Masque Attack.
Apple stated on November 14 that they were not aware of any incidents in which one of their customers had been affected by the attack.
References
IOS |
https://en.wikipedia.org/wiki/Pollination%20network | A pollination network is a bipartite mutualistic network in which plants and pollinators are the nodes, and the pollination interactions form the links between these nodes. The pollination network is bipartite as interactions only exist between two distinct, non-overlapping sets of species, but not within the set: a pollinator can never be pollinated, unlike in a predator-prey network where a predator can be depredated. A pollination network is two-modal, i.e., it includes only links connecting plant and animal communities.
Nested structure of pollination networks
A key feature of pollination networks is their nested design. A study of 52 mutualist networks (including plant-pollinator interactions and plant-seed disperser interactions) found that most of the networks were nested. This means that the core of the network is made up of highly connected generalists (a pollinator that visits many different species of plant), while specialized species interact with a subset of the species that the generalists interact with (a pollinator that visits few species of plant, which are also visited by generalist pollinators). As the number of interactions in a network increases, the degree of nestedness increases as well. One property that results from nested structure of pollination networks is an asymmetry in specialization, where specialist species are often interacting with some of the most generalized species. This is in contrast to the idea of reciprocal specialization, where specialist pollinators interact with specialist plants. Similar to the relationship between network complexity and network nestedness, the amount of asymmetry in specialization increases as the number of interactions increases.
Modularity of networks
Another feature that is common in pollination networks is modularity. Modularity occurs when certain groups of species within a network are much more highly connected to each other than they are with the rest of the network, with weak interactions connecting different modules.
Within modules it has been shown that individual species play certain roles. Highly specialized species often only interact with individuals within their own module and are known as ‘peripheral species’; more generalized species can be thought of as ‘hubs’ within their own module, with interactions between many different species; there are also species which are very generalized which can act as ‘connectors’ between their own module and other modules. A study of three separate networks, all of which showed modularity, revealed that hub species were always plants and not the insect pollinators. Previous work has found that networks will become nested at a smaller size (number of species) than that where networks frequently become modular.
Species loss and robustness to collapse
There is substantial interest into the robustness of pollination networks to species loss and collapse, especially due to anthropogenic factors such as habitat destruction. The stru |
https://en.wikipedia.org/wiki/Winter%20%28TV%20series%29 | Winter is an Australian mystery-drama-thriller television series which premiered on the Seven Network on 4 February 2015, and concluded on 11 March 2015. The series is a spin off of the 2014 telemovie, The Killing Field. It stars Rebecca Gibney and Peter O'Brien reprising their roles from the telemovie.
Plot
In Kings Cross, Sydney, Indiana Hope (Sara West) is a troubled girl who is living in a strip club with her friend and roommate. One night, while crossing the road Indiana is hit by an ongoing car where the car quickly flees the scene and leaves Indiana's unconscious body on the street. Meanwhile, Karly Johansson is chased through her home by an unknown figure who viciously attacks her and pushes her off a cliff to her death below. Her body is found on the rocks by her mother.
Following the successful Mingara murder case, Detective Sergeant Eve Winter (Rebecca Gibney) has taken time off her crime career. After she receives a call, she is sent to Rocky Point, a beautiful seaside fishing town off Sydney where 23-year-old mother Karly Johansson has been murdered. At the scene, Eve meets her husband Luke Thompson (Zac Drayson) who is a fisherman and hysterically breaks down after seeing his dead wife. Eve meets Judith, Karly's mother and sister Lauren (Kate Mulvany). She also meets ambitious Detective Alesia Taylor (Antonia Prebble) who befriends Eve. While there, she reunites with Detective Sergeant Lachlan McKenzie (Peter O'Brien), who has feelings towards Eve. Lachlan suspects that Karly's murder has a connection to a murder case 8 years ago where Paul Paget's wife was found dead on the rocks and he was framed for murder. Eve and Lachlan visit Paget who says that he has nothing to do with it. Paget commits suicide days after which angers Lachlan, believing that he might be the killer.
Eve also hears of Indiana's hit and run accident and rushes to the hospital where she meets Detective Sergeant Jake Harris (Matt Nable) who Eve has a hatred for and also meets her roommate Sharni. That night, Indiana is attacked at the hospital by an unknown figure and escapes.
As the season unfolds, everyone's pasts are revealed. Karly and Indiana were best friends and got a tattoo that means friendship. Karly's dying father Bjorn Johansson (Lewis Fitz-Gerald) had raped Indiana. Indiana's real name is actually Katherine Indiana Hope Ziegler and is the daughter of Peter Ziegler, the Director of Public Prosecutions. Indiana's father kicked her out of home for being a troubled teen and asked a friend in the police to place her with the Johanssons. It is also revealed that Ziegler is not interested in Indiana, his daughter from his first marriage, and more concerned about protecting his public image and new family.
Believing Indiana can help with the case, Eve hires her sister Melanie Winter (Rachel Gordon) who attempts to unlock Indiana's mind using hypnosis, given that Melanie is a child psychiatrist. Indiana runs off after Melanie asks why Karly was crying a |
https://en.wikipedia.org/wiki/X28 | X28 may refer to:
X.28, ITU-T standard specifying the interface between asynchronous character-mode data terminal equipment (DTE), such as computer terminals, and a Packet Assembler/Disassembler (PAD) that connects the DTE to a packet switched network such as an X.25 network
X-28 or Osprey Osprey I, a single-seat flying boat
X28 (New York City bus) |
https://en.wikipedia.org/wiki/Human%20disease%20network | A human disease network is a network of human disorders and diseases with reference to their genetic origins or other features. More specifically, it is the map of human disease associations referring mostly to disease genes. For example, in a human disease network, two diseases are linked if they share at least one associated gene. A typical human disease network usually derives from bipartite networks which consist of both diseases and genes information. Additionally, some human disease networks use other features such as symptoms and proteins to associate diseases.
History
In 2007, Goh et al. constructed a disease-gene bipartite graph using information from OMIM database and termed human disease network. In 2009, Barrenas et al. derived complex disease-gene network using GWAs (Genome Wide Association studies). In the same year, Hidalgo et al. published a novel way of building human phenotypic disease networks in which diseases were connected according to their calculated distance. In 2011, Cusick et al. summarized studies on genotype-phenotype associations in cellular context. In 2014, Zhou, et al. built a symptom-based human disease network by mining biomedical literature database.
Properties
A large-scale human disease network shows scale-free property. The degree distribution follows a power law suggesting that only a few diseases connect to a large number of diseases, whereas most diseases have few links to others.
Such network also shows a clustering tendency by disease classes.
In a symptom-based disease network, disease are also clustered according to their categories. Moreover, diseases sharing the same symptom are more likely to share the same genes and protein interactions.
See also
Bioinformatics
Genome
Network theory
Network medicine
References
External links
https://web.archive.org/web/20080625034729/http://hudine.neu.edu/
http://www.barabasilab.com/pubs/CCNR-ALB_Publications/200705-14_PNAS-HumanDisease/200705-14_PNAS-HumanDisease-poster.pdf
https://www.nytimes.com/2008/05/06/health/research/06dise.html
Network theory |
https://en.wikipedia.org/wiki/Technology%20transfer%20in%20computer%20science | Technology transfer in computer science refers to the transfer of technology developed in computer science or applied computing research, from universities and governments to the private sector. These technologies may be abstract, such as algorithms and data structures, or concrete, such as open source software packages.
Examples
Notable examples of technology transfer in computer science include:
References
Computer science
Computer science
Computing-related lists |
https://en.wikipedia.org/wiki/Individual%20mobility | Individual human mobility is the study that describes how individual humans move within a network or system. The concept has been studied in a number of fields originating in the study of demographics. Understanding human mobility has many applications in diverse areas, including spread of diseases, mobile viruses, city planning, traffic engineering, financial market forecasting, and nowcasting of economic well-being.
Data
In recent years, there has been a surge in large data sets available on human movements. These data sets are usually obtained from cell phone or GPS data, with varying degrees of accuracy. For example, cell phone data is usually recorded whenever a call or a text message has been made or received by the user, and contains the location of the tower that the phone has connected to as well as the time stamp. In urban areas, user and the telecommunication tower might be only a few hundred meters away from each other, while in rural areas this distance might well be in region of a few kilometers. Therefore, there is varying degree of accuracy when it comes to locating a person using cell phone data. These datasets are anonymized by the phone companies so as to hide and protect the identity of actual users. As example of its usage, researchers used the trajectory of 100,000 cell phone users within a period of six months, while in much larger scale trajectories of three million cell phone users were analyzed.
GPS data are usually much more accurate even though they usually are, because of privacy concerns, much harder to acquire. Massive amounts of GPS data describing human mobility are produced, for example, by on-board GPS devices on private vehicles. The GPS device automatically turns on when the vehicle starts, and the sequence of GPS points the device produces every few seconds forms a detailed mobility trajectory of the vehicle. Some recent scientific studies compared the mobility patterns emerged from mobile phone data with those emerged from GPS data.
Researchers have been able to extract very detailed information about the people whose data are made available to public. This has sparked a great amount of concern about privacy issues. As an example of liabilities that might happen, New York City released 173 million individual taxi trips. City officials used a very weak cryptography algorithm to anonymize the license number and medallion number, which is an alphanumeric code assigned to each taxi cab. This made it possible for hackers to completely de-anonymize the dataset, and even some were able to extract detailed information about specific passengers and celebrities, including their origin and destination and how much they tipped.
Characteristics
At the large scale, when the behaviour is modelled over a period of relatively long duration (e.g. more than one day), human mobility can be described by three major components:
trip distance distribution
radius of gyration
number of visited locations
Brockmann, by |
https://en.wikipedia.org/wiki/Structural%20cut-off | The structural cut-off is a concept in network science which imposes a degree cut-off in the degree distribution of a finite size network due to structural limitations (such as the simple graph property). Networks with vertices with degree higher than the structural cut-off will display structural disassortativity.
Definition
The structural cut-off is a maximum degree cut-off that arises from the structure of a finite size network.
Let be the number of edges between all vertices of degree and if , and twice the number if .
Given that multiple edges between two vertices are not allowed, is bounded by the maximum number of edges between two degree classes .
Then, the ratio can be written
,
where is the average degree of the network, is the total number of vertices, is the probability a randomly chosen vertex will have degree , and is the probability that a randomly picked edge will connect on one side a vertex with degree with a vertex of degree .
To be in the physical region, must be satisfied.
The structural cut-off is then defined by
.
Structural cut-off for neutral networks
The structural cut-off plays an important role in neutral (or uncorrelated) networks, which do not display any assortativity. The cut-off takes the form
which is finite in any real network.
Thus, if vertices of degree exist, it is physically impossible to attach enough edges between them to maintain the neutrality of the network.
Structural disassortativity in scale-free networks
In a scale-free network the degree distribution is described by a power law with characteristic exponent , .
In a finite scale free network, the maximum degree of any vertex (also called the natural cut-off), scales as
.
Then, networks with , which is the regime of most real networks, will have diverging faster than in a neutral network. This has the important implication that an otherwise neutral network may show disassortative degree correlations if .
This disassortativity is not a result of any microscopic property of the network, but is purely due to the structural limitations of the network.
In the analysis of networks, for a degree correlation to be meaningful, it must be checked that the correlations are not of structural origin.
Impact of the structural cut-off
Generated networks
A network generated randomly by a network generation algorithm is in general not free of structural disassortativity.
If a neutral network is required, then structural disassortativity must be avoided.
There are a few methods by which this can be done:
Allow multiple edges between the same two vertices. While this means that the network is no longer a simple network, it allows for sufficient edges to maintain neutrality.
Simply remove all vertices with degree . This guarantees that no vertex is subject to structural limitations in its edges, and the network is free of structural disassortativity.
Real networks
In some real networks, the same methods as for generated networks |
https://en.wikipedia.org/wiki/Eagle%20Eye%20Networks | Eagle Eye Networks, Inc. (EEN) is an American company providing cloud-based video surveillance products
for physical security and business operations applications.
History
Eagle Eye Networks was founded in 2012 by Dean Drako, Barracuda Networks' founder and former CEO. Drako said he started the company after frustrations with trying to deploy and use existing video surveillance systems for remote management while he was CEO of Barracuda.
The company and its first product, the Eagle Eye Cloud Security Camera Video Management System, were announced in January 2014. The company announced its channel partner program the following month.
Eagle Eye Networks announced a multimillion-dollar series B venture round investment in July 2014, including an investment by Michael Dell's private family venture fund, MSD Capital. Michael Dell stated that he made the investment primarily because of CEO Drako's earlier success with Barracuda Networks. Enrique Salem, previous CEO of Symantec and Austin Ventures also invested in the round.
The company announced a new data center in Austin, Texas in September 2014.
In February 2015, Diebold, financial self-service, security and services corporation, and Eagle Eye Networks announced an alliance to deliver cloud-based video services which would stream and store live and recorded video, generate notifications and support real-time analytics. According to Diebold, EEN had developed the industry's first cloud-based video solution with an open API.
CEO Drako bought Brivo cloud access control company for $50 million in June 2015. Drako said he saw the opportunity to accelerate the cloud technology shift underway in the physical security industry by integrating Brivo's cloud access control with EEN cloud video surveillance. The two companies continued to operate separately.
In April 2017, EEN and Swift Sensors announced a partnership to deliver cloud-based wireless sensor and video surveillance across multiple industries, enabling users to check video as needed, based on sensor data.
In 2020, EEN raised $40 million in Series E funding from Accel for a total of $100 million since the company was founded in 2012. The company said it planned to use the funding to further develop artificial intelligence (AI) analytics on its cloud-based video surveillance platform, and to continue its growth. In 2023, it partnered with Brivo to raise 192 million to focusing on the use of AI related to physical security.
In 2023, EEN raised $100M in financing from SECOM. Drako continues to own the majority of Eagle Eye.
Products
Eagle Eye Cloud Security Camera Video Management System is a cloud-managed video surveillance system that links analog and IP cameras with an on-site bridge or cloud managed video recorder appliance which transmit the encrypted video recording to Eagle Eye's cloud data center.
The system supports mobile apps for system installation, remote video viewing, and system management, with alerts for motion detection, |
https://en.wikipedia.org/wiki/High-level%20language%20computer%20architecture | A high-level language computer architecture (HLLCA) is a computer architecture designed to be targeted by a specific high-level programming language (HLL), rather than the architecture being dictated by hardware considerations. It is accordingly also termed language-directed computer design, coined in and primarily used in the 1960s and 1970s. HLLCAs were popular in the 1960s and 1970s, but largely disappeared in the 1980s. This followed the dramatic failure of the Intel 432 (1981) and the emergence of optimizing compilers and reduced instruction set computer (RISC) architectures and RISC-like complex instruction set computer (CISC) architectures, and the later development of just-in-time compilation (JIT) for HLLs. A detailed survey and critique can be found in .
HLLCAs date almost to the beginning of HLLs, in the Burroughs large systems (1961), which were designed for ALGOL 60 (1960), one of the first HLLs. The best known HLLCAs may be the Lisp machines of the 1970s and 1980s, for the language Lisp (1959). At present the most popular HLLCAs are Java processors, for the language Java (1995), and these are a qualified success, being used for certain applications. A recent architecture in this vein is the Heterogeneous System Architecture (2012), which HSA Intermediate Layer (HSAIL) provides instruction set support for HLL features such as exceptions and virtual functions; this uses JIT to ensure performance.
Definition
There are a wide variety of systems under this heading. The most extreme example is a Directly Executed Language (DEL), where the instruction set architecture (ISA) of the computer equals the instructions of the HLL, and the source code is directly executable with minimal processing. In extreme cases, the only compiling needed is tokenizing the source code and feeding the tokens directly to the processor; this is found in stack-oriented programming languages running on a stack machine. For more conventional languages, the HLL statements are grouped into instruction + arguments, and infix order is transformed to prefix or postfix order. DELs are typically only hypothetical, though they were advocated in the 1970s.
In less extreme examples, the source code is first parsed to bytecode, which is then the machine code that is passed to the processor. In these cases, the system typically lacks an assembler, as the compiler is deemed sufficient, though in some cases (such as Java), assemblers are used to produce legal bytecode which would not be output by the compiler. This approach was found in the Pascal MicroEngine (1979), and is currently used by Java processors.
More loosely, a HLLCA may simply be a general-purpose computer architecture with some features specifically to support a given HLL or several HLLs. This was found in Lisp machines from the 1970s onward, which augmented general-purpose processors with operations specifically designed to support Lisp.
Examples
The Burroughs Large Systems (1961) were the first HLLCA, desi |
https://en.wikipedia.org/wiki/Design%20smell | In computer programming, design smells are "structures in the design that indicate violation of fundamental design principles and negatively impact design quality". The origin of the term "design smell" can be traced to the term "code smell" which was featured in the book Refactoring: Improving the Design of Existing Code by Martin Fowler.
Details
Different authors have defined the word "smell" in different ways:
N. Moha et al.: "Code and design smells are poor solutions to recurring implementation and design problems."
R. C. Martin: "Design smells are the odors of rotting software."
Fowler: "Smells are certain structures in the code that suggest (sometimes they scream for) the possibility of refactoring."
Design smells indicate the accumulated design debt (one of the prominent dimensions of technical debt). Bugs or unimplemented features are not accounted as design smells. Design smells arise from the poor design decisions that make the design fragile and difficult to maintain. It is a good practice to identify design smells in a software system and apply appropriate refactoring to eliminate it to avoid accumulation of technical debt.
The context (characterized by various factors such as the problem at hand, design eco-system, and platform) plays an important role to decide whether a certain structure or decision should be considered as a design smell. Generally, it is appropriate to live with design smells due to constraints imposed by the context. Nevertheless design smells should be tracked and managed as technical debt because they degrade the overall system quality over time.
Common design smells
Missing abstraction when clumps of data or encoded strings are used instead of creating an abstraction. Also known as "primitive obsession" and "data clumps".
Multifaceted abstraction when an abstraction has multiple responsibilities assigned to it. Also known as "conceptualization abuse".
Duplicate abstraction when two or more abstractions have identical names or implementation or both. Also known as "alternative classes with different interfaces" and "duplicate design artifacts".
Deficient encapsulation when the declared accessibility of one or more members of an abstraction is more permissive than actually required.
Unexploited encapsulation when client code uses explicit type checks (using chained if-else or switch statements that check for the type of the object) instead of exploiting the variation in types already encapsulated within a hierarchy.
Broken modularization when data and/or methods that ideally should have been localized into a single abstraction are separated and spread across multiple abstractions.
Insufficient modularization when an abstraction exists that has not been completely decomposed, and a further decomposition could reduce its size, implementation complexity, or both.
Circular dependency. Cyclically-dependent modularization when two or more abstractions depend on each other directly or indirectly (crea |
https://en.wikipedia.org/wiki/Trams%20in%20Kryvyi%20Rih | The Kryvyi Rih tramway network is part of the public transport system of Kryvyi Rih, city in Ukraine. The tram network serves as the backbone of the transit system, serving both under the name of the "Kryvyi Rih Rapid Tram" municipal corporation.
In operation since 1935, the Kryvyi Rih tram network is one of world's largest tram networks, operating on 88.1 kilometres of total route. As of 2014, it was composed of 13 lines. The system is operated by the Kryvyi Rih City Council under the supervision of the city community.
On May 1, 2021, Kryvyi Rih became the first city in Ukraine to introduce free travel in public transport for its citizens. In order not to pay for municipal transport one must show a special electronic "Kryvyi Rih Citier Card".
On April 27, 2022, free travel in Kryvyi Rih became available to all the tram, bus, trolleybus and the Metro passengers.
Network
Rolling stock
Current fleet
See also
Kryvyi Rih Metrotram
List of town tramway systems in Europe
References
External links
Kryvyi Rih
Transport in Kryvyi Rih
Tourist attractions in Kryvyi Rih
Metre gauge railways in Ukraine
Kryvyi Rih |
https://en.wikipedia.org/wiki/Trolleybuses%20in%20Kryvyi%20Rih | The Kryvyi Rih trolleybus system forms part of the public transport network serving Kryvyi Rih, Ukraine.
History
In operation since 1957, the system presently comprises 23 routes, and is managed by the Kryvyi Rih City Council. It uses a fleet of 76 trolleybuses, which partly are articulated vehicles. On 1 May 2021 Kryvyi Rih became the first city in Ukraine to introduce free travel in public transport for its citizens. In order not to pay for municipal transport one must show a special electronic "Kryvyi Rih Card".
Network
Пл. Визволення — ст. Кривий Ріг-Головний
Пл. Визволення — тролейбусне депо No.2
ст. Кривий Ріг — ст. Кривий Ріг-Головний
пл. 30-річчя Перемоги — пл. Толстого
к-тр Зарічний — ЦГЗК
к-тр Зарічний — ст. Роковата (працює у вихідні дні та на свята)
Пл. Визволення — ПівдГЗК
Пл. Визволення — КЦРЗ
Спорткомплекс — ККХП-2
Спорткомплекс — ПівнГЗК(РЗФ-1)
ст. Кривий Ріг — КЦРЗ (через м-н Юність)
Пл. Визволення — ст. Кривий Ріг — пл. Горького — пл. Визволення (кільцевий)
Пл. Визволення — пл. Горького — Пл. Визволення (кільцевий, у зворотному напрямку маршруту No.12)
КЦРЗ-КЦРЗ (ч/з Юність, Більшовик, Піонер, 173 кв.)
ПівнГЗК(РЗФ-1) — РЗФ-2
ПЗРК — 10-й мікрорайон (раз на годину)
"Електрозаводська"— пл. Толстого
Спорткомплекс — 10-й мікрорайон (раз на 2 години)
Пл. Визволення — Розвилка
Пл. Визволення — ст. Кривий Ріг-Головний (через Розвилку)
ст. Кривий Ріг — ст. Кривий Ріг-Головний (через Розвилку)
вул. Серафимовича — вул. Вернадського (кільцевий)
ст Роковата — Пл. Визволення
Rolling stock
Current fleet
See also
List of trolleybus systems in Ukraine
References
External links
Kryvyi Rih
Kryvyi Rih
1957 establishments in Ukraine
Transport in Kryvyi Rih
Tourist attractions in Kryvyi Rih |
https://en.wikipedia.org/wiki/Super%20S%C3%A1bados | Super Sábados (Super Saturdays) was a TV game and variety show of Telemundo Puerto Rico, which aired from 1984 to 1991. From 1987 to 1989, was also broadcast by Telemundo Network in the United States. In many cities, it competed with the Univision game show "Sabado Gigante".
The program was created by the Argentine producers Oscar and Carlos Sacco, who were father and son. This show was five hours and was on every Saturday night. It hold first place in ratings for many years. It had many hosts through the years like, Johanna Rosaly, Luis Antonio Cosme, Dagmar Rivera, Rosita Velazquez, Eddie Miró, Rolando Barral and sometimes Otilio Warrington also known as Bizcocho.
References
Telemundo original programming
1980s American television series
1990s American television series
1990s Puerto Rican television series
1980s Puerto Rican television series |
https://en.wikipedia.org/wiki/Thea%20D.%20Hodge | Thea Drell Hodge (November 8, 1922 – March 3, 2008) was a member of the Association for Computing Machinery and a cofounder of the Minneapolis chapter of the Association for Women in Computing. Hodge was a pioneer for women in computer science and mentored many women in the field.
Life and work
Theresa E. Drell was born in Atlantic City, New Jersey to Tully Drell and Rose White. She attended Antioch College in Ohio, where she met her husband, Philip Gibson Hodge, and graduated magna cum laude from Hunter College in New York City in 1946. She married when she was 20 years old.
Hodge worked at New York University from 1943 to 1944, then spent 1960–1967 at Illinois Institute of Technology. She headed computer centers and supervised staff working in Illinois and Minnesota. From 1967 to 1968, Hodge worked at the University of Chicago. Hodge was hired by Northwestern University in 1968, before moving to the University of Minnesota in 1971, where she worked in departments at Cray Research and the university until her retirement in 1990.
Personal life
She and Philip Hodge had three children.
She died March 3, 2008, in Menlo Park, and was buried in Alta Mesa Memorial Park, Palo Alto, California.
Awards
2004: Association for Computing Machinery Special Interest Group on University and College Computing Services Hall of Fame
Selected publications
Thea D. Hodge. (1974). The Minnesota Computer Time-Sharing Network. EDUCOM.
Thea D. Hodge. (1978). Two-way communication between User Services and Systems programmers. In Proceedings of the 6th annual ACM SIGUCCS conference on User services (SIGUCCS '78). Association for Computing Machinery, New York, NY, USA, 9. DOI:https://doi.org/10.1145/800131.804257
Mary C. Boyd, Lincoln Fetcher, Sara K. Graffunder, and Thea D. Hodge. (1980). Pros and cons of various user education modes. In Proceedings of the 8th annual ACM SIGUCCS conference on User services (SIGUCCS '80). Association for Computing Machinery, New York, NY, USA, 86. DOI:https://doi.org/10.1145/800086.802763
Thea Hodge, Barbara Morgan, Barbara Wolfe, Elizabeth Little, and Douglas Van Houweling. (1983). User Services: past, present, future summary of panel discussion at USC X, Chicago. SIGUCCS Newsl. 13, 1 (Spring 1983), 5–8. DOI:https://doi.org/10.1145/1098785.1098786
References
1922 births
2008 deaths
American computer scientists
American women computer scientists
Fellows of the Association for Computing Machinery
New York University staff
Illinois Institute of Technology people
University of Chicago staff
Northwestern University staff
University of Minnesota people
20th-century American women scientists
20th-century American scientists
21st-century American women
Hunter College alumni |
https://en.wikipedia.org/wiki/Penny%20Crane%20Award%20for%20Distinguished%20Service | The Penny Crane Award for Distinguished Service is an award issued by the Association for Computing Machinery's Special Interest Group on University and College Computing Services. It was established in 2000 to recognise individuals who have made significant contributions to the Special Interest Group, and to computing in higher education.
Recipients
Source: ACM
2000 – Jane Caviness
2001 – John H. (Jack) Esbin
2002 – John Bucher
2003 – Russell Vaught
2004 – Linda Hutchison
2005 – J. Michael Yohe
2006 – Jennifer Fajman
2007 – Dennis Mar
2008 – Jerry Smith
2009 – Robert Paterson
2010 – Lida Larsen
2011 – Leila Lyonsi
2012 – no recipient
2013 – Terris Wolff
2014 – Cynthia Dooling
2015 – Bob Haring-Smith
2016 – Phil Isensee
2017 – Tim Foley
2018 – Nancy Bauer
2019 – Kelly Wainwright
2022 – Melissa Bauer
See also
See Qualifications and Nominations page, at the ACM SIGUCCS Web Page.
Penny Crane Award Web Page at ACM/SIGUCCS
Penny Crane memory book
List of computer science awards
References
Awards of the Association for Computing Machinery
Awards established in 2000
Computer science awards
Distinguished service awards
Education awards |
https://en.wikipedia.org/wiki/ACM%20SIGUCCS%20Hall%20of%20Fame%20Award | The Association for Computing Machinery Special Interest Group on University and College Computing Services Hall of Fame Award was established by the Association for Computing Machinery to recognize individuals whose specific contributions have had a positive impact on the organization and therefore on the professional careers of the members and their institutions.
Recipients
2000 Alicia Ewing Towster
2000 Frank A Thomas
2000 John E Skelton
2000 Gordon R Sherman
2000 Rita Seplowitz Saltz
2000 Robert W Lutz
2000 Ralph E Lee
2000 William Heinbecker
2000 Jane Shearin Caviness
2000 Jean Bonney
2001 James R Wruck
2001 Barbara Wolfe
2001 Lawrence W Westermeyer
2001 Russel S Vaught
2001 Jerry Niebaum
2001 James L Moss
2001 Polley Ann McClure
2001 Elizabeth R Little
2001 Priscilla Jane Huston
2001 John H "Jack" Esbin
2002 Terris Wolff
2002 Lois Secrist
2002 Jerry Martin
2002 Carl Malstrom
2002 Geraldine MacDonald
2002 Sheri Prupis
2002 Larry Pickett
2002 Diane Jung
2002 Fred Harris
2002 John Bucher
2003 Michael Yohe
2003 Vincent H Swoyer
2003 Beth Ruffo
2003 Dennis Mar
2003 Leila C Lyons
2003 Linda Hutchison
2003 Tex Hull
2003 Patrick J Gossman
2004 Stan Yagi
2004 Alan Herbert
2004 Susan Nycum
2004 Greydon D Freeman
2004 Lida Larsen
2004 M Lloyd Edwards
2004 Thea Drell Hodge
2004 Linda Downing
2005 Mervin E Muller
2005 Glen R Ingram
2005 Jennifer Fajman
2005 Jim Bostick
2005 Kay K Beach
2006 Leland H Williams
2006 Chris Jones
2006 Marion F Taylor
2006 John W Hamblen
2006 Glenda E Moum
2006 Jayne Ashworth
2007 Shiree Moreland
2007 Phil Isensee
2007 Kathy Mayberry
2007 Bonnie Hites
2007 Jeanne Kellogg
2007 Susan Hales
2008 Jerry Smith
2008 Robert Paterson
2008 John Lateulere
2008 Jack McCredie
2009 Glenn Ricart
2009 Lynnell Lacy
2009 Teresa Lockard
2009 Jim Kerlin
2009 Nancy Bauer
2010 Jennifer "Jen" Whiting
2010 Ann Amsler
2011 Richard Nelson
2011 Alex Nagorski
2011 Timothy Foley
2012 No recipients
2013 Jim Yucha
2013 Christine Vucinich
2013 Leila Shahbender
2013 Cindy Sanders
2013 Carol Rhodes
2013 Patti Mitch
2013 Greg Hanek
2013 Gale Fritsche
2014 Elizabeth Wagnon
2014 Robert Haring-Smith
2014 Parrish Nnambi
2014 Karen McRitchie
2015 Jacquelynn Hongosh
2016 Debbie Fisher
2016 Naomi Fujimura
2016 Takashi Yamanoue
2017 Melissa Bauer
2017 Allan Chen
2017 Beth Rugg
2017 Kelly Wainwright
2018 Miranda Carney-Morris
2018 Trevor Murphy
2018 Mo Nishiyama
2018 Gail Rankin
2019 No recipients
2020 Chester Andrews
2020 Mat Felthousen
2020 Dan Herrick
2020 Chris King
2020 Becky Lineberry
See also
List of computer science awards
See Qualifications and Nominations page, at the ACM SIGUCCS Web Page.
Hall of Fame Web Page at ACM/SIGUCCS
Referenc |
https://en.wikipedia.org/wiki/Ganale%20Doria | Ganale Doria is a dam located near Genale on the river Shabelle. It was built in the south of Somalia in the 1920s along with an extensive network of canals. The dam (called originally Dam of Genale Doria) was strongly promoted by Cesare Maria De Vecchi - Italian governor of Italian Somalia from 1924 to 1928 - in order to provide water for irrigation of a vast territory between Genale, Merca and Vittorio di Africa, to be given in concession to colonists.
The dam
The Genale Dam should be remembered not so much for the intrinsic importance (though fairly innovative by the 1920s, being built with reinforced concrete) but especially for the difficulties in the realization and for the great improvements for the social and economic life of the area. The dam also improved the image of colonial Italy in the world.
Regarding the construction difficulties, the following are only the most significant among those who had to overcome the Italian builders according to Gaetano De Angelis:
The weather was inclement with frequent floods of the river, which naturally slowed the process and forced to work often 24 hours a day and with artificial light rather poor.
The foundation ground was muddy and forced to work with the nearly continuous use of pumps.
There were no cranes, excavators etc.: the work was done with shovels, buckets and especially "man strength". At certain times to remove 40,000 cubic meters of soil worked together more than 1,000 indigenous workers.
The material necessary to the work came from Mogadishu, mainly for the iron and timber needed. The bulk (crushed stone, cement, sand, etc.) came from Merca (about 14 km away) and because to reach this small town there was the need to bypass interposed moving sand dunes (in the 1920s there were no roads there), transportation was done with "caravans" of camels because the trucks could not be used. So, were required 120,000 transports by camel (or a caravan of 350-400 camels per day for the duration of the work).
Construction began in January 1926 and despite the difficulties mentioned, ended in October of the same year. The inauguration took place on October 28, 1926 (anniversary of Fascism in Italy) and was christened by the countess Rina De Vecchi of Val Cismon, to whom the workers made homage of the model of the dam.
Actually for some experts (like Tripodi) the question arises how it all could get to the end in such a short time and without major incidents: no loss of life happened. Fascist propaganda pinpointed that the dam was done without enhancing the distinction of class or color - although the work was done in very difficult conditions.
Data
The Shebelle ("river of leopards" in Somali), in the area of Genale where the dam was built, flows in a vast plain between 65–70 meters above sea level and is 13.5 km from the Indian Ocean (point of minimum distance, near Merca). Between the plain and the sea, however, there are sand dunes that are partly movable and rise in height up to 100–130 meter |
https://en.wikipedia.org/wiki/Elise%20Hu | Elise Hu is an American broadcast journalist who hosts the TED Talks Daily podcast and serves as host-at-large for NPR. From 2015 to 2018, she was the network's first Seoul, South Korea, bureau chief.
Life and education
Hu was born in St. Louis, Missouri, to Chinese-American immigrants, and grew up in suburban Missouri and Texas. She graduated from Plano Senior High School in Plano, Texas. During high school, she and friends were paid $100 each to appear in national 7-Up advertisements, after which agents scouted Hu to work as a model for a few years into college. She interned at WFAA-TV in Dallas before earning a bachelor's degree in broadcast journalism from the University of Missouri School of Journalism.
She was married to Matt Stiles, a reporter, with whom she has three daughters. She speaks Mandarin Chinese.
Career
Hu began her career as a television reporter for stations including KWTX-TV, KVUE-TV and WYFF-TV, and then was among the founding journalists at the Texas Tribune, a digital news startup.
She joined NPR in 2011 and opened the Seoul bureau in early 2015, where she oversaw coverage of South Korea, North Korea and Japan. She hosted video series on NPR named "Elise Tries," which received a Gracie Award from the Alliance for Women in Media Foundation, and "Future You, With Elise Hu." As of 2020, she is host-at-large based at NPR West, filling in on programs such as "It's Been a Minute"; correspondent for Vice News; and co-founder of the podcast production company Reasonable Volume.
Her reporting has been honored with a National Edward R. Murrow Award for Video, a Gannett Foundation Award for Innovation in Watchdog Journalism, beat reporting awards from the Texas Associated Press. The Austin Chronicle twice named her "Best of Austin" for reporting and social media work.
Hu is a senior fellow at the USC Annenberg Innovation Lab, a director on the Grist.org board, and a member of the Council on Foreign Relations. She previously served as a guest co-anchor on Tech News Today on TWIT, an adjunct instructor for Georgetown University and an adviser and blogger for the John S. and James L. Knight Foundation.
Her book, Flawless: Lessons in Looks and Culture from the K-Beauty Capital was published by E.P. Dutton, an imprint of Penguin Random House, in May 2023. It explores South Korea's global influence in beauty and how a digital society narrows global appearance ideals.
References
External links
NPR bio
NPR's Seoul bureau announcement
Living people
American journalists of Chinese descent
American people of Taiwanese descent
University of Missouri alumni
NPR personalities
American women journalists
21st-century American women writers
21st-century American non-fiction writers
American women journalists of Asian descent
1982 births |
https://en.wikipedia.org/wiki/List%20of%20Rio%20de%20Janeiro%20BRT%20stations | Below is a list of stations on the BRT network in Rio de Janeiro, Brazil. The BRT Rio network consists of three operational bus rapid transit corridors, Transoeste, Transcarioca and Transolímpica.
Services
Services are a mix of non-stop, limited stops, express, and all stops (Portuguese:direto, semi-direto, expresso, parador). Stations are categorised by their level of service. Terminals are served by most passing buses. Express stations are served by many limited stop and express services as well as all-stop services. All-stop stations are generally only served by buses stopping at all stops. While there are clearly defined corridors, many services cross from one corridor to another. For example, while is located on the Transoeste corridor, it also receives services from Transcarioca and Transolímpica.
Stations
References
BRT (Rio de Janeiro) |
https://en.wikipedia.org/wiki/National%20Entrepreneurship%20Network | National Entrepreneurship Network or NEN is a community dedicated to fostering entrepreneurship. Services focus on providing institutional capacity building, entrepreneur support, entrepreneurial eco-system and national platforms. Based on an idea by Romesh Wadhwani, and co-founded with Sunita Singh, Nilima Rovshen, and Laura Parkin, the goal of the community is to enable new and future entrepreneurs to access events and resources, share ideas and content, organize and market activities, and forge relationships across India and the world. Programs include a variety of supports including competitions. They are located in Bangalore.
History of NEN
National Entrepreneurship Network (NEN) was launched in 2003, as a non-profit initiative of the Wadhwani Foundation. It was co-founded with IIT Mumbai, IIM Ahmedabad, BITS Pilani, SPJIMR Mumbai and IBAB Bengaluru
See also
Business incubator
Business cluster
Creative entrepreneurship
References
Further reading
Robert A. Baron (2010). Entrepreneurship: An Evidence-based Guide, Edward Elgar Publishing, 229 pages.
Kharas, Homi; Makino, Koji; and Woojin Jung (2011). Catalyzing Development: A New Vision for Aid, Brookings Institution Press, 305 pages.
Bornstein, David; and Susan Davis (2010). Social Entrepreneurship: What Everyone Needs to Know, Oxford University Press, 147 pages.
External links
Official website
Community building
Professional networks
Entrepreneurship organizations
Entrepreneurship in India
2003 establishments in Karnataka
Organisations based in Karnataka
Organizations established in 2003 |
https://en.wikipedia.org/wiki/Pixel%20Camera | Pixel Camera, formerly Google Camera, is a camera phone application developed by Google for the Android operating system. Development for the application began in 2011 at the Google X research incubator led by Marc Levoy, which was developing image fusion technology for Google Glass. It was publicly released for Android 4.4+ on the Google Play on April 16, 2014. It was initially supported on all devices running Android 4.4 KitKat and higher, but became only officially supported on Google Pixel devices in the following years. The app was renamed Pixel Camera in October 2023, with the launch of the Pixel 8 and Pixel 8 Pro.
Features
Google Camera contains a number of features that can be activated either in the Settings page or on the row of icons at the top of the app.
Pixel Visual/Neural Core
Starting with Pixel devices, the camera app has been aided with hardware accelerators to perform its image processing. The first generation of Pixel phones used Qualcomm's Hexagon DSPs and Adreno GPUs to accelerate image processing. The Pixel 2 and Pixel 3 (but not the Pixel 3a) include the Pixel Visual Core to aid with image processing. The Pixel 4 introduced the Pixel Neural Core.
HDR+
Unlike earlier versions of high dynamic range (HDR) imaging, HDR+, also known as HDR+ on, uses computational photography techniques to achieve higher dynamic range. HDR+ takes continuous burst shots with short exposures. When the shutter is pressed the last 5–15 frames are analysed to pick the sharpest shots (using lucky imaging), which are selectively aligned and combined with image averaging. HDR+ also uses Semantic Segmentation to detect faces to brighten using synthetic fill flash, and darken and denoise skies. HDR+ also reduces shot noise and improves colors, while avoiding blowing out highlights and motion blur. HDR+ was introduced on the Nexus 6 and brought back to the Nexus 5.
HDR+ enhanced
Unlike HDR+/HDR+ On, 'HDR+ enhanced' mode does not use Zero Shutter Lag (ZSL). Like Night Sight, HDR+ enhanced features positive-shutter-lag (PSL): it captures images after the shutter is pressed. HDR+ enhanced is similar to HDR+ from the Nexus 5, Nexus 6, Nexus 5X and Nexus 6P. It is believed to use underexposed and overexposed frames like Smart HDR from Apple. HDR+ enhanced captures increase the dynamic range compared to HDR+ on. HDR+ enhanced on the Pixel 3 uses the learning-based AWB algorithm from Night Sight.
Live HDR+
Starting with the Pixel 4, Live HDR+ replaced HDR+ on, featuring WYSIWYG viewfinder with a real-time preview of HDR+. HDR+ live uses the learning-based AWB algorithm from Night Sight and averages up to nine underexposed pictures.
Dual Exposure Controls
'Live HDR+' mode uses Dual Exposure Controls, with separate sliders for brightness (capture exposure) and for shadows (tone mapping). This feature was made available for Pixel 4, and has not been retrofitted on older Pixel devices due to hardware limitations.
With Bracketing
In April 2021, Google Ca |
https://en.wikipedia.org/wiki/Process%20qualification | Process qualification is the qualification of manufacturing and production processes to confirm they are able to operate at a certain standard during sustained commercial manufacturing. Data covering critical process parameters must be recorded and analyzed to ensure critical quality attributes can be guaranteed throughout production. This may include testing equipment at maximum operating capacity to show quantity demands can be met. Once all processes have been qualified the manufacturer should have a complete understanding of the process design and have a framework in place to routinely monitor operations. Only after process qualification has been completed can the manufacturing process begin production for commercial use. Equally important as qualifying processes and equipment is qualifying software and personnel. A well trained staff and accurate, thorough records helps ensure ongoing protection from process faults and quick recovery from otherwise costly process malfunctions. In many countries qualification measures are also required, especially in the pharmaceutical manufacturing field.
Process qualification should cover the following aspects of manufacturing:
Facility
Utilities
Equipment
Personnel
End-to-end manufacturing
Control protocols and monitoring software.
Process qualification is the second stage of process validation.
A vital component of process qualification is process performance qualification protocol. PPQ protocol is essential in defining and maintaining production standards within an organization.
See also
Installation qualification
Design qualification
Performance qualification
Process validation
References
External links
Drugregulations.org
Formal methods
Enterprise modelling
Business process management |
https://en.wikipedia.org/wiki/Corona%20Regional%20Medical%20Center | Corona Regional Medical Center is a for-profit hospital in Corona, California that is owned and operated by Universal Health Services. The hospital is a 238-bed community hospital network comprising a 160-bed acute care hospital and a 78-bed rehabilitation campus. It is certified by The Joint Commission, employs more than 1,000 trained healthcare workers, and has a medical staff of approximately 300 physicians representing more than 40 specialties.
History
Beginning as the Corona Community Hospital in 1933, the hospital has changed and expanded to meet the needs of the rapidly growing communities of Corona, Norco and Eastvale. In 1992, Corona Community Hospital merged with Circle City Medical Center, and the resulting entity became Corona Regional Medical Center. In 2004, CRMC became one of the hospitals owned and operated by a subsidiary of Universal Health Services, Inc.
Services
Acute Care Services: Allergy Medicine, Bloodless Medicine, Breast Imaging Center (3D Digital Mammography), Cardiology & Cardiac Catheterization, Diagnostic Imaging (MRI, CT, Angio, Nuc Med), Emergency Services, Gastroenterology, Intensive Care Unit, Laboratory Services, Neurology, OB/GYN, Oncology, Orthopedic/Joint/Spine, Pediatrics, Inpatient Physical Therapy/Occupational Therapy/Speech Therapy, Pulmonary, Surgical Services, Urology, Vascular Services, The Wound Care Center ® (Hyperbaric Oxygen Therapy)
Rehabilitation Services: Behavioral Health- Inpatient & Outpatient, Skilled Nursing/Subacute Care, Home Health & Hospice, Palliative Care
Awards and Accolades
Home Care Elite Award 2011, 2012 & 2013
American College of Radiology: Accreditation in MRI, CT, Nuclear Neducubem Ultrasound and Mammography
CEP (California Emergency Physicians Group) Award - PA Site of the Year
College of American Pathologist (CAP) Accreditation
HealthGrades 5 Star Award in Gynecology and Maternity
Leadership
Sam Itani, Chief Executive Officer
Morgan Topper, Chief Operating Officer
Kyle Kim, Chief Financial Officer
Phyllis Snyder, Chief Nursing Officer
Martin Kleinbart, Director of Strategic Business Development
References
External links
Corona Regional Medical Center
Buildings and structures in Corona, California
Hospitals in Riverside County, California |
https://en.wikipedia.org/wiki/Virtual%20metrology | In semiconductor manufacturing, virtual metrology refers to methods to predict the properties of a wafer based on machine parameters and sensor data in the production equipment, without performing the (costly) physical measurement of the wafer properties. Statistical methods such as classification and regression are used to perform such a task. Depending on the accuracy of this virtual data, it can be used in modelling for other purposes, such as predicting yield, preventative analysis, etc. This virtual data is helpful for modelling techniques that are adversely affected by missing data. Another option to handle missing data is to use imputation techniques on the dataset, but virtual metrology in many cases, can be a more accurate method.
Examples of virtual metrology include:
the prediction of the silicon nitride () layer thickness in the chemical vapor deposition process (CVD), using multivariate regression methods;
the prediction of critical dimension in photolithography, using multi-level and regularization approaches;
the prediction of layer width in etching.
References
Semiconductor device fabrication
Automation
Lithography (microfabrication)
Metrology |
https://en.wikipedia.org/wiki/Mac%20Data%20Recovery%20Guru | Mac Data Recovery Guru is a data recovery application, for macOS. It was designed to recover deleted files from hard disk drives, USB flash drives, memory cards of cameras and portable devices, MP3 players, PlayStations, X-Boxes, Wii's, palm devices and optical media.
Embedded file recovery
Mac Data Recovery Guru has a “Search for embedded files” option that will make it do an exhaustive search for every file type it can recover starting from every byte on the drive, instead just searching for files starting at a block boundary. This is for use by digital forensics professionals.
Supported file systems
macOS:
HFS, HFS+, HFSX
Microsoft:
NTFS, FAT
Linux:
Ext2, Ext3, Ext4, XFS, UFS
See also
Data recovery
File deletion
List of data recovery software
References
Data recovery software
Utilities for macOS |
https://en.wikipedia.org/wiki/Ingredient-flavor%20network | In network science, ingredient-flavor networks are networks describing the sharing of flavor compounds of culinary ingredients. In the bipartite form, an ingredient-flavor network consist of two different types of nodes: the ingredients used in the recipes and the flavor compounds that contributes to the flavor of each ingredients. The links connecting different types of nodes are undirected, represent certain compound occur in each ingredients. The ingredient-flavor network can also be projected in the ingredient or compound space where nodes are ingredients or compounds, links represents the sharing of the same compounds to different ingredients or the coexistence in the same ingredient of different compounds.
History
In 2011, Yong-Yeol Ahn, Sebastian E. Ahnert, James P. Bagrow and Albert-László Barabási investigated the ingredient-flavor networks of North American, Latin American, Western European, Southern European and East Asian cuisines. Based on culinary repository epicurious.com, allrecipes.com and menupan.com, 56,498 recipes were included in the survey.
The efforts to apply network analysis on foods also occurred in the work of Kinouchi and Chun-Yuen Teng, with the former examined the relationship between ingredients and recipes, and the latter derived the ingredient-ingredient networks of both compliments and substitutions. Yet Ahn's
ingredient-flavor network was constructed based on the molecular level understanding of culinary networks and received wide attention
Properties
According to Ahn, in the total number of 56,498 recipes studied, 381 ingredients and 1021 flavor compounds were identified. On average, each ingredient connected to 51 flavor compounds.
It was found that in comparison with random pairing of ingredients and flavor compounds, North American cuisines tend to share more compounds while East Asian cuisines tend to share fewer compounds. It was also shown that this tendency was mostly generated by the frequently used ingredients in each cuisines.
Food pairing
An important feature that the ingredient-flavor network showed is the principle of food pairing. A well known hypothesis states that ingredients sharing flavor compounds are more likely to taste well together than ingredients that do not. However, the sensory test by Miriam Kort, etc. claimed that the shared compound hypothesis can be debatable.
According to Ahn, the food pairing pattern changes in different cuisines. North American recipes tends to obey the shared compound hypothesis while East Asian cuisines tend to avoid it. Besides the spatial variance, Kush R. Varshney, Lav R. Varshney, Jun Wang, and Daniel Myers also showed the time variance in food pairing by comparing the modern European recipes with the Medieval European recipes. They concluded that the Medieval cuisine tend to share more compounds than the cuisine today.
See also
Albert-László Barabási
Bipartite graph
Bipartite network projection
Food science
Food pairing
Graph theory
N |
https://en.wikipedia.org/wiki/VP8%20%28disambiguation%29 | VP8 is a video compression format owned by Google and created by On2 Technologies.
VP8 may also refer to:
VP8 Image Analyzer, an analog computer made in 1972
VP-8, Patrol Squadron Eight, a U.S. Navy land-based patrol squadron
VP8, a viral protein; for example VP8* in Rotavirus |
https://en.wikipedia.org/wiki/Darshana%20Ashoka%20Kumara | Darshana Ashoka Kumara is a Sri Lankan journalist as well as a book author. Darshana is News Editor (English) of Independent Television Network, Sri Lanka.
Darshana used to be a full-time journalist to the Sri Lanka Broadcasting Corporation and a freelancer to Ceylon Today. He is also a lyricist and composer. Darshana has launched 5 books so far in journalism and media studies. His latest book titled Thorathuruwalata Hadawathak presents a critique on the modern-day media practice at the global scale.
He is a fellow of the South Asia Climate Change Award (SACCA) and Asia Journalism Fellowship, Singapore. He is a computer science graduate of the Sri Jayawardhanapura University and obtained his MA degrees from the Kelaniya University in Mass Communication and Sinhala. Darshana has been awarded with a PhD in philosophy from the University of Peradeniya.
References
Sinhalese writers
Year of birth missing (living people)
Living people |
https://en.wikipedia.org/wiki/Circular%20thresholding | Circular thresholding is an algorithm for automatic image threshold selection in image processing. Most threshold selection algorithms assume that the values (e.g. intensities) lie on a linear scale. However, some quantities such as hue and orientation are a circular quantity, and therefore require circular thresholding algorithms. The example shows that the standard linear version of Otsu's method when applied to the hue channel of an image of blood cells fails to correctly segment the large white blood cells (leukocytes). In contrast the white blood cells are correctly segmented by the circular version of Otsu's method.
Methods
There are a relatively small number of circular image threshold selection algorithms. The following examples are all based on Otsu's method for linear histograms:
(Tseng, Li and Tung 1995) smooth the circular histogram, and apply Otsu's method. The histogram is cyclically rotated so that the selected threshold is shifted to zero. Otsu's method and histogram rotation are applied iteratively until several heuristics involving class size, threshold location, and class variance are satisfied.
(Wu et al. 2006) smooth the circular histogram until it contains only two peaks. The histogram is cyclically rotated so that the midpoint between the peaks is shifted to zero. Otsu's method and histogram rotation are applied iteratively until convergence of the threshold.
(Lai and Rosin 2014) applied Otsu's method to the circular histogram. For the two class circular thresholding task they showed that, for a histogram with an even number of bins, the optimal solution for Otsu's criterion of within-class variance is obtained when the histogram is split into two halves. Therefore the optimal solution can be efficiently obtained in linear rather than quadratic time.
References and further reading
D.-C. Tseng, Y.-F. Li, and C.-T. Tung, Circular histogram thresholding for color image segmentation in Proc. Int. Conf. Document Anal. Recognit., 1995, pp. 673–676.
J. Wu, P. Zeng, Y. Zhou, and C. Olivier, A novel color image segmentation method and its application to white blood cell image analysis in Proc. Int. Conf. Signal Process., vol. 2. 2006, pp. 16–20.
Y.K. Lai, P.L. Rosin, Efficient Circular Thresholding, IEEE Trans. on Image Processing 23(3), 992–1001 (2014).
Image processing |
https://en.wikipedia.org/wiki/LinkNYC | LinkNYC is the New York City branch of an international infrastructure project to create a network covering several cities with free Wi-Fi service. The office of New York City Mayor Bill de Blasio announced the plan on November 17, 2014, and the installation of the first kiosks, or "Links," started in late 2015. The Links replace the city's network of 9,000 to 13,000 payphones, a contract for which expired in October 2014. The LinkNYC kiosks were devised after the government of New York City held several competitions to replace the payphone system. The most recent competition, in 2014, resulted in the contract being awarded to the CityBridge consortium, which comprises Qualcomm; Titan and Control Group, which now make up Intersection; and Comark.
All of the Links feature two high-definition displays on their sides; Android tablet computers for accessing city maps, directions, and services, and making video calls; two free USB charging stations for smartphones; and a phone allowing free calls to all 50 states and Washington, D.C. The Links also provide the ability to use calling cards to make international calls, and each Link has one button to call 9-1-1 directly. Since 2022, CityBridge has also installed poles under the Link5G brand, which provide both Wi-Fi and 5G service.
The project brings free, encrypted, gigabit wireless internet coverage to the five boroughs by converting old payphones into Wi-Fi hotspots where free phone calls could also be made. , there are 1,869 Links citywide; eventually, 7,500 Links are planned to be installed in the New York metropolitan area, making the system the world's fastest and most expansive. Intersection has also installed InLinks in cities across the UK. The Links are seen as a model for future city builds as part of smart city data pools and infrastructure.
Since the Links' deployment, there have been several concerns about the kiosks' features. Privacy advocates have stated that the data of LinkNYC users can be collected and used to track users' movements throughout the city. There are also concerns with cybercriminals possibly hijacking the Links, or renaming their personal wireless networks to the same name as LinkNYC's network, in order to steal LinkNYC users' data. In addition, prior to September 2016, the tablets of the Links could be used to browse the Internet. In summer 2016, concerns arose about the Link tablets' browsers being used for illicit purposes; despite the implementation of content filters on the kiosks, the illicit activities continued, and the browsers were disabled.
History
Payphones and plans for reuse
In 1999, thirteen companies signed a contract that legally obligated them to maintain New York City's payphones for fifteen years. In 2000, the city's tens of thousands of payphones were among the 2.2 million payphones spread across the United States. Since then, these payphones' use had been declining with the advent of cellphones. , there were 13,000 phones in over 10,000 i |
https://en.wikipedia.org/wiki/Disparity%20filter%20algorithm%20of%20weighted%20network | Disparity filter is a network reduction algorithm (a.k.a. graph sparsification algorithm
) to extract the backbone structure of undirected weighted network. Many real world networks such as citation networks, food web, airport networks display heavy tailed statistical distribution of nodes' weight and strength. Disparity filter can sufficiently reduce the network without destroying the multi-scale nature of the network. The algorithm is developed by M. Angeles Serrano, Marian Boguna and Alessandro Vespignani.
Overview of other network reduction algorithms and their limitations
k-core decomposition
k-core decomposition is an algorithm that reduces a graph into a maximal connected subgraph of vertices with at least degree k. This algorithm can only be applied to unweighted graphs.
Minimum spanning tree
A minimum spanning tree is a tree-like subgraph of a given graph G, in which it keeps all the nodes of graph G but minimizes the total weight of the subgraph. A minimum spanning tree is the least expensive way to maintain the size of a connected component. The significant limitation of this algorithm is that it overly simplifies the structure of the network (graph). The minimum spanning tree destroys local cycles, clustering coefficients which are usually present in real networks and are considered important in network measurement.
Global weight threshold
A weighted graph can be easily reduced to a subgraph in which any of the edges' weight is larger than a given threshold wc. This technique has been applied to study the resistance of food webs and functional networks that connect correlated human brain sites. The shortcoming of this method is that it disregards nodes with small strength. In real networks, both strength and weight distribution in general follow heavy tailed distributions which span several degrees of magnitude. Applying a simple cutoff on weight will remove all the information below the cut-off.
Disparity filter algorithm
The null model of normalized weight distribution
In network science, the strength notated as si of a node i is defined as si = Σjwij, where wij is the weight of the link between i and j.
In order to apply the disparity filter algorithm without overlooking nodes with low strength, a normalized weight pij is defined as pij = wij/si. In the null model, the normalized weights of a certain node with degree k is generated like this: k − 1 pins are randomly assigned between the interval 0 and 1. The interval is then divided into k subintervals. The length of the subinterval represents the normalized weight of each link in the null model.
Consecutively, and based on the null model, we can derive that the normalized weight distribution of a node with degree k follows .
Disparity filter
The disparity filter algorithm is based on p-value statistical significance test of the null model: For a given normalized weight pij, the p-value αij of pij based on the null model is given by which reduces to . The meaning of αi |
https://en.wikipedia.org/wiki/Temporal%20network | A temporal network, also known as a time-varying network, is a network whose links are active only at certain points in time. Each link carries information on when it is active, along with other possible characteristics such as a weight. Time-varying networks are of particular relevance to spreading processes, like the spread of information and disease, since each link is a contact opportunity and the time ordering of contacts is included.
Examples of time-varying networks include communication networks where each link is relatively short or instantaneous, such as phone calls or e-mails. Information spreads over both networks, and some computer viruses spread over the second. Networks of physical proximity, encoding who encounters whom and when, can be represented as time-varying networks. Some diseases, such as airborne pathogens, spread through physical proximity. Real-world data on time resolved physical proximity networks has been used to improve epidemic modeling.
Neural networks and brain networks can be represented as time-varying networks since the activation of neurons are time-correlated.
Time-varying networks are characterized by intermittent activation at the scale of individual links. This is in contrast to various models of network evolution, which may include an overall time dependence at the scale of the network as a whole.
Applicability
Time-varying networks are inherently dynamic, and used for modeling spreading processes on networks. Whether using time-varying networks will be worth the added complexity depends on the relative time scales in question. Time-varying networks are most useful in describing systems where the spreading process on a network and the network itself evolve at similar timescales.
Let the characteristic timescale for the evolution of the network be , and the characteristic timescale for the evolution of the spreading process be . A process on a network will fall into one of three categories:
Static approximation – where . The network evolves relatively slowly, so the dynamics of the process can be approximated using a static version of the network.
Time-varying network – where . The network and the process evolve at comparable timescales so the interplay between them becomes important.
Annealed approximation – where . The network evolves relatively rapidly, so the dynamics of the process can be approximated using a time averaged version of the network.
The flow of data over the internet is an example for the first case, where the network changes very little in the fraction of a second it takes for a network packet to traverse it. The spread of sexually transmitted diseases is an example of the second, where the prevalence of the disease spreads in direct correlation to the rate of evolution of the sexual contact network itself. Behavioral contagion is an example of the third case, where behaviors spread through a population over the combined network of many day-to-day social interactions.
Represen |
https://en.wikipedia.org/wiki/Silicon%20Investor | Silicon Investor is the first website that evaluated the stocks of high-tech companies. It is an Internet forum and social networking service concentrating on stock market discussion, with particular focus on tech stocks. Silicon Investor is currently owned and operated by Knight Sac Media Holdings.
Billing itself the "first internet community", the site hosts 30 million message posts made by 90,000 registered users. In late 1996, SI accounted for 5% of the AltaVista search engine index.
History
Silicon Investor was launched on August 8, 1995, just a day before Netscape went public. It was founded in Cupertino, California by two brothers, Jeff and Brad Dryer. SI was the first Internet community to grow purely out of the web browser. In November 1995, the Dryer brothers relocated Silicon Investor to their home town of Kansas City. The website was financed by membership fees charged and contributions from the founders.
On June 24, 1998, Go2Net, a Seattle-based Internet investment firm, acquired of Silicon Investor for $35 million in Go2Net stock. At that time, the website was averaging 100 million pageviews per month. The original staff continued to work on the site. Go2Net planned on integrating Silicon Investor with Go2Net's Stocksite.
In the early 2000s, during the crash of the dot-com bubble, Silicon Investor started losing web-traffic to free messaging boards such as RagingBull.com and Yahoo's YHOO Finance. Bryan Burdick the managing director of Silicon Investor at the time, however, dismissed speculations that Silicon Investor was losing traffic because of competing websites that offered free membership.
Financial news and services website TheStreet.com speculated that Silicon Investor was losing traffic because renowned stock-pickers such as Tokyo Joe, Anthony Elgindy, and Barbara J. Simon who amassed followings on Silicon Investor, launched their own private websites similar to Silicon Investor.
In July 2000, InfoSpace (now Blucora) bought Go2Net for $4 billion in stock. The following year, it fired Silicon Investor's main moderator and investment guru Bob Zumbrunnen, whom The Wall Street Journal described as a cross between a “bouncer, diplomat, and traffic cop”. However, in May 2003, Zumbrunnen bought Silicon Investor from InfoSpace for $250,000 and relaunched it with a new design.
In 2011, Snurf LLC, a web investment company founded by Silicon Investor's original owner Brad Dryer (also known as Brad Fire), acquired the site.
In January 2013, Knight Sac Media Holdings Corporation acquired Silicon Investor and announced a slew of updates to Silicon Investor, from the display of banner advertisements to signed-in users, to redesign of the home page.
Notable Members
Michael Burry
Michael Burry is a physician and American investment fund manager who founded more than 25 message boards on Silicon Investor, including subjects on Value Investing and Buffetology. Burry joined Silicon Investor in November 1996. Between 1996 and 2000, Bu |
https://en.wikipedia.org/wiki/Joseph%20Henry%20Condon | Joseph Henry 'Joe' Condon (born February 15, 1935 January 2, 2012) was an American computer scientist, engineer and physicist, who spent most of his career at Bell Labs. The son of Edward Condon (a distinguished American nuclear physicist, pioneer in quantum mechanics and a participant in the development of radar and nuclear weapons during World War II as part of the Manhattan Project) and Emilie Honzik Condon, he was named after the 19th-century American physicist Joseph Henry.
Education
Condon developed an interest in physics and electronics at an early age and credited his introduction to analytical thinking to an anonymous instrument maker. He attended Johns Hopkins University and received his BS degree in physics in 1958, and Northwestern University where he received a Ph.D. in physics in 1963.
Career
After graduate school, Condon joined the Metallurgy Research Division of AT&T Bell Laboratories at Murray Hill, New Jersey. He arrived about the same time that the division split. Formerly physics, metallurgy, and chemistry were under one executive director. After the split, physics had its own director, and chemistry and metallurgy were under another. He worked for five years on solid-state physics and metals at low temperatures electronic band structure of metals by means of the oscillatory diamagnetic susceptibility (the De Haas–van Alphen effect). His studies in beryllium and silver (19661968) showed that magnetic domains (later called 'Condon domains') form in non-ferromagnetic metals when the oscillating differential magnetic susceptibility is greater than unity. He developed the theory and verified it experimentally.
Condon then became interested more in electronics engineering, moving out of physics. He was exposed to UNIX on the Honeywell 516 machines in the early 1970s.
In the 1960s, Condon contributed to the development of local area network digital telephone switching.
Condon and Ken Thompson promoted the use of the C programming language for AT&T's switching system control programs. Condon acquired a small AT&T PBX (telephone switch) that handled about 50 phones; he made the necessary hardware changes and Thompson wrote the necessary software programs. The PBX code rewrite in C was a success and hastened the adoption of C for all switching system software within AT&T.
Circa 19681969, Condon was the head of department 13 which owned a PDP-7 computer. The computer was loaned to Dennis Ritchie and Ken Thompson, who used it to create the famous early computer game Space Travel and to port various features of the recently cancelled Multics project, developments which directly led to the development of the Unix operating system and all of its modern derivatives.
In 1975 Condon joined the Computer Research Center at Bell Labs where the C programming language and the UNIX operating system were created. Condon and his colleagues automated the laborious and error-prone task of manually converting drawings to fabricate circuit boards |
https://en.wikipedia.org/wiki/Computer%20supported%20brainstorming | In computer supported brainstorming, team members contribute their ideas through electronic means either synchronously or asynchronously. The brainstorming software selected by the team mediates the individual interactions and helps to organize and shape the products of the brainstorming session. Computer supported brainstorming can be implemented using a wide variety of electronic technologies.
Overview
In traditional group brainstorming all members of a team are present in the same physical location and their interaction is defined by a selected protocol. Proponents such as Gallupe et al. argue that electronic brainstorming eliminates many of the problems of standard brainstorming, including production blocking (i.e. group members must take turns to express their ideas) and evaluation apprehension (i.e. fear of being judged by others).
History
Brainstorming exists in many forms, but first began to be formalized in graphical representation known as "concept mapping" by Joseph D. Novak of Cornell University in the 1970s. Concept mapping involved collecting and organizing information in a hierarchical fashion.
Seth Hollander, then a student at the Thayer School of Engineering of Dartmouth College in Hanover, New Hampshire, is said to be the first individual to formally propose the use of computers to assist with brainstorming and concept mapping. In his Master of Science thesis "Computer-Assisted Creativity and the Policy Process", Hollander suggested an "interactive computer program designed to enhance creative thinking". One year later, in 1985, The Idea Generator, the first software for computer supported brainstorming, became publicly available.
In 1991 both GroupSystems at the University of Arizona and the Software Aided Meeting Management (SAMM) system at the University of Minnesota took advantage of emerging computer networking technology installed in rooms dedicated to computer supported meetings. When using these electronic meeting systems (EMS, as they came to be called), group members simultaneously and independently entered ideas into a computer terminal. The software collected (or "pooled") the ideas into a list, which could then be displayed on a central screen (anonymously if desired). Researchers found that the use of such computer supported systems helped groups categorize ideas, eliminate duplicates, and promote assessment and discussion of prioritized or controversial issues.
Available technologies and applications
Numerous software platforms have been designed for computer supported brainstorming, each of which has advantages and disadvantages over traditional brainstorming depending on the specific circumstances. The features of these software titles are similar in that they:
Allow real-time updates
Allow groups to download or print final versions
Allow color coding information
Identify information with the user who submitted it
Allow maps to be reorganized and restructured by the group
Offer te |
https://en.wikipedia.org/wiki/Display%20%28social%20network%29 | Display Inc., stylized as display, is an online social media and networking service based in Norwalk, Connecticut. The display app officially launched in May 2021.
History
In September 2019, display (formerly Tsū) announced its planned relaunch. According to Chief Executive Officer John Acunto, display would share ad revenue with users, a 50% payout of ad revenue. display also incorporated protections against spam and empowers users to access data, analytics and insights related to their content.
In an interview with Fox Business (in response to the October 29th NCAA Board of Governors unanimous vote to allow student-athletes to be paid for the use of their name, image and likeness), Tiki Barber, former NY Giants running back, cited display as a “great platform” to put the new NCAA rules to use, adding that display enables influencers of all kinds to have the ability to monetize their own content and brands. Barber went on to say that display is creating a platform that gives all users access to brand partnership, by sharing in ad revenue, providing storefronts and more. display’s John Acunto echoed Barber’s sentiment saying that college athletes were just one example of those who could benefit from display: "I see this as an opportunity for all kinds of categories of people who are influencers [and] who have brands to engage with us."
display rebranded from Tsū in April 2021.
Core pillars
"display, the ‘Social That Pays’, put the creators on the focus. Our platform revolves around the people who create valuable content. We believe that they deserve the reward for all the efforts they put in."
Awarding content creators based on the ad revenue they generate on the platform
Enabling commerce at the point of discovery via a personalized storefront
Providing tools that inspire content creation and empower creators to post efficiently
displayFest
Beginning on May 3, 2021, displayFest began. It featured a series of performances including sets from Snoop Dogg, Ice Cube, Fat Joe, Chinese Kitty, Polo G, Saweetie, Moneybagg Yo, YG, Lil Durk and more.
Each weeknight, Sarah Pribis, former host of viral trivia app HQ, led interactive question and answer style games with cash prizes ranging from $10,000 to as much as $100,000.
App features
Available for iOS and Android devices, main features include:
Profiles – Similar to other social media sites, a display “Profile” allows the user to upload photos and videos, friend/ follow, post, create a bio and promote personal websites.
Store - Creators can personally curate a marketplace in an easily created for, enabling purchase at the point of discovery.
Bank – The display bank allows users to be paid out via Paypal.
Analytics (“Insights”) – In-app console that provides post engagement data to the user. Shows users what posts performed the best, incentivizing them to post more content that their audience enjoys.
Live Streaming - Users can live stream from the app to their friends, followers a |
https://en.wikipedia.org/wiki/Efficiency%20%28network%20science%29 | In network science, the efficiency of a network is a measure of how efficiently it exchanges information and it is also called communication efficiency. The underlying idea (and main assumption) is that the more distant two nodes are in the network, the less efficient their communication will be. The concept of efficiency can be applied to both local and global scales in a network. On a global scale, efficiency quantifies the exchange of information across the whole network where information is concurrently exchanged. The local efficiency quantifies a network's resistance to failure on a small scale. That is the local efficiency of a node characterizes how well information is exchanged by its neighbors when it is removed.
Definition
The definition of communication efficiency assumes that the efficiency is inversely proportional to the distance, so in mathematical terms
where is the pairwise efficiency of nodes in network and is their distance.
The average communication efficiency of the network is then defined as the average over the pairwise efficiencies:
where denotes the number of nodes in the network.
Distances can be measured in different ways, depending on the type of networks. The most natural distance for unweighted networks is the length of a shortest path between a nodes and , i.e. a shortest path between is a path with minimum number of edges and the number of edges is its length. Observe that if then —and that is why the sum above is over — while if there is no path connecting and , and their pairwise efficiency is zero. Being a count, for and so is bounded between 0 and 1, i.e. it is a normalised descriptor.
Weighted networks
The shortest path distance can also be generalised to weighted networks, see the weighted shortest path distance, but in this case and the average communication efficiency needs to be properly normalised in order to be comparable among different networks.
In the authors proposed to normalise dividing it by the efficiency of an idealised version of the network :
is the "ideal" graph on nodes wherein all possible edges are present. In the unweighted case every edge has unitary weight, is a clique, a full network, and . When the edges are weighted, a sufficient condition (for having a proper normalisation, i.e. ) on the distances in the ideal network, called this time , is
for . should be known (and different from zero) for all node pairs.
A common choice is to take them as the geographical or physical distances in spatial networks or as the maximum cost over all links, e.g. where indicates the maximum interaction strength in the network. However, in the authors highlight the issues of these choices when dealing with real world networks, which are characterised by heterogeneous structure and flows. For instance, choosing makes the global measure very sensitive to outliers in the distribution of weights and tends to under-estimate the actual efficiency of a network. The auth |
https://en.wikipedia.org/wiki/National%20Highway%20966B%20%28India%29 | National Highway 966B, also known as NH 966B, is part of India's National Highway network. Its old name was NH 47A. It covers a distance of between Kundannoor and Willingdon Island in Kochi, in the state of Kerala. It starts from the junction of NH 66 at Kundannoor.
See also
List of National Highways in India by highway number
List of National Highways in India by state
National Highways Development Project
Smallest National Highway in india is NH 766EE (4.27km),Hattikeri to Belekeri port (in Karnataka)
References
External links
About NH 966B
Road Transport in Kerala
NH network map of India
National highways in India
966B
Roads in Kochi |
https://en.wikipedia.org/wiki/Kingpin%20%28book%29 | Kingpin: How One Hacker Took Over the Billion-Dollar Cybercrime Underground is a 2011 non-fiction book written by Kevin Poulsen.
Plot
Poulsen tells the story of real life computer hacker Max Butler, who, under the alias Iceman, stole access to 1.8 million credit card accounts.
References
2011 non-fiction books
American non-fiction books
Works about computer hacking
Non-fiction books about criminals
Crown Publishing Group books |
https://en.wikipedia.org/wiki/Korea%20Internet%20Neutral%20Exchange | Korea Internet Neutral Exchange (KINX Inc.), the only carrier-neutral Internet exchange (IX) in South Korea, is a B2B company that specializes in Internet infrastructure. KINX provides Internet data center (IDC), content delivery network (CDN), and cloud computing services to customers. The headquarters is in Seoul, South Korea. As of March 2020, KINX has 126 employees.
Services
IX (Internet exchange)
KINX operates a layer 2-based Internet exchange in South Korea. Its data center is carrier-neutral, which means that domestic and international Internet service providers (ISP), as well as content providers (CPs), are independent of any network providers and could freely select their peering partners. KINX is expanding its international coverage by establishing point of presence (PoP) in Hong Kong and Tokyo, Japan.
IDC (Internet data center)
KINX is currently operating four IDCs – all carrier-neutral – in and near the Seoul area. Its IX participants include Daum-Kakao, whose popular messenger service KakaoTalk boasts more than 140 million users.
CDN (Content delivery network)
KINX's CDN solution, based on peering with domestic and international ISPs, delivers contents in a fast and stable manner. It provides streaming, cache, and downloading services. Main customers of KINX’s solution are gaming companies, such as Com2uS and Neowiz Games, that need to deliver contents to end-users, and media outlets, such as the Korea Economic Daily and the Financial News, that provide real-time news updates to their audience.
Cloud (Cloud computing)
In 2012, KINX introduced 'IXcloud', becoming the first Korean company to provide public cloud service that utilizes OpenStack. It also provides support for both public and private companies' efforts to establish private cloud service. Since 2011, KINX, in partnership with AppCenter, has provided cloud service to mobile web developers for free-of-charge. In 2014, KINX signed the MOU with NEOPLY, a program managed by Neowiz Games to support startups and to provide infrastructure for cloud service.
CloudHub
KINX CloudHub is an advanced multi-cloud service platform that enables direct access to major international and domestic clouds including AWS, MS, Google, IBM, Tencent, Oracle, and Naver Business Platform. CloudHub service is a feature of ‘single port, many virtual circuits’, meaning that customers can save the costs of multiple circuits to each CSP. As KINX offers CloudHub service, customers now may choose hybrid cloud service with both colocation and muti-cloud service. Recently, the needs of multi-cloud and hybrid cloud services have been accelerating since diversity of the services is becoming more important.
History
In the early days of the Internet in South Korea, domestic Internet traffic had to go via overseas Internet exchange Points. As the demand for the Internet rose dramatically, the government had to find a way to address the network’s low quality and rising costs; furthermore, they were particularl |
https://en.wikipedia.org/wiki/Quantum%20complex%20network | Quantum complex networks are complex networks whose nodes are quantum computing devices. Quantum mechanics has been used to create secure quantum communications channels that are protected from hacking. Quantum communications offer the potential for secure enterprise-scale solutions.
Motivation
In theory, it is possible to take advantage of quantum mechanics to create secure communications using features such as quantum key distribution is an application of quantum cryptography that enables secure communications Quantum teleportation can transfer data at a higher rate than classical channels.
History
Successful quantum teleportation experiments in 1998. Prototypical quantum communication networks arrived in 2004. Large scale communication networks tend to have non-trivial topologies and characteristics, such as small world effect, community structure, or scale-free.
Concepts
Qubits
In quantum information theory, qubits are analogous to bits in classical systems. A qubit is a quantum object that, when measured, can be found to be in one of only two states, and that is used to transmit information. Photon polarization or nuclear spin are examples of binary phenomena that can be used as qubits.
Entanglement
Quantum entanglement is a physical phenomenon characterized by correlation between the quantum states of two or more physically separate qubits. Maximally entangled states are those that maximize the entropy of entanglement. In the context of quantum communication, entangled qubits are used as a quantum channel.
Bell measurement
Bell measurement is a kind of joint quantum-mechanical measurement of two qubits such that, after the measurement, the two qubits are maximally entangled.
Entanglement swapping
Entanglement swapping is a strategy used in the study of quantum networks that allows connections in the network to change. For example, given 4 qubits, A, B, C and D, such that qubits C and D belong to the same station, while A and C belong to two different stations, and where qubit A is entangled with qubit C and qubit B is entangled with qubit D. Performing a Bell measurement for qubits A and B, entangles qubits A and B. It is also possible to entangle qubits C and D, despite the fact that these two qubits never interact directly with each other. Following this process, the entanglement between qubits A and C, and qubits B and D are lost. This strategy can be used to define network topology.
Network structure
While models for quantum complex networks are not of identical structure, usually a node represents a set of qubits in the same station (where operations like Bell measurements and entanglement swapping can be applied) and an edge between node and means that a qubit in node is entangled to a qubit in node , although those two qubits are in different places and so cannot physically interact. Quantum networks where the links are interaction terms instead of entanglement are also of interest
Notation
Each node in the network co |
https://en.wikipedia.org/wiki/Choi%20Song-hyun | Choi Song-hyun (born April 11, 1982) is a South Korean actress. Choi began her television career as a KBS announcer in 2006, then she resigned from the network in 2008 to focus on acting. She has since starred in films and television dramas such as Insadong Scandal (2009), Mrs. Town (2009), Prosecutor Princess (2010), and I Need Romance (2011).
Filmography
Television series
Film
Variety show
Musical theatre
Awards and nominations
References
External links
1982 births
Living people
Actresses from Seoul
South Korean film actresses
South Korean musical theatre actresses
South Korean television actresses
South Korean television presenters
South Korean women television presenters
Yonsei University alumni
Korea University alumni
Signal Entertainment Group artists
Song-hyun |
https://en.wikipedia.org/wiki/1992%20Full%20Members%27%20Cup%20final | The 1992 Full Members' Cup final, also known by its sponsored name, the Zenith Data Systems Cup, was a football match which took place at Wembley Stadium on 29 March 1992. It was contested between Nottingham Forest and Southampton. The match was shown live on Sky Sports.
Match details
Summary
Scot Gemmill opened the scoring for Nottingham Forest in the 15th minute with a right foot volley from the right of the penalty area. Kingsley Black got the second with a low left footed shot into the corner of the net. Southampton got one back in the 64th minute with Matt Le Tissier header from six yards out after a cross from the left. Southampton equalised six minutes later when Kevin Moore headed in from six yards after a corner from the right. The match went to extra time and Scot Gemmill got the winning goal and his second with five minutes remaining when he volleyed in from six yards after a cross from the right. Des Walker collected the trophy, having taken over as captain when Stuart Pearce was substituted with an injury in the first half.
Teams
|| ||
|| ||
References
1992
1991–92 in English football
Full Members' Cup 1992
Full Members' Cup 1992
March 1992 sports events in the United Kingdom
1992 sports events in London |
https://en.wikipedia.org/wiki/Oon%20Shu%20An | Oon Shu An (born 5 August 1986) is a Singaporean actress and host. She is the web-show host of Clicknetwork.tv's Tried and Tested.
Early life
Oon was educated at Methodist Girls' School. She graduated from the LASALLE College of the Arts, majoring in acting.
Filmography
Oon has appeared in numerous Singaporean feature films, short films and television shows. She is also the host of Tried and Tested on Clicknetwork.tv.
Film
Television
Theatre
Oon's one-woman show, #UnicornMoment, which she wrote and performed, with Checkpoint Theatre, was picked a highlight of 2014's local theatre offerings by The Straits Times, and nominated for best original script at the Life! Theatre Awards in 2015. Oon has been nominated twice for the best actress award at the Life! Theatre Awards, Singapore's de facto national theatre awards in 2019 for her lead role in Mergers and Accusations, and in 2016 for the role of Xi Yan in the play Chinglish at the Life! Theatre Awards.
References
External links
Tried and Tested on clicknetwork.tv
Living people
Singaporean people of Chinese descent
Singaporean television actresses
Singaporean stage actresses
21st-century Singaporean actresses
1986 births
LASALLE College of the Arts alumni
Singaporean television presenters
Singaporean film actresses |
https://en.wikipedia.org/wiki/Shameless%20%28season%205%29 | The fifth season of Shameless, an American comedy-drama television series based on the British series of the same name by Paul Abbott, premiered on January 11, 2015 on the Showtime television network. Executive producers are John Wells, Paul Abbott and Andrew Stearn, and producer Michael Hissrich. Like all previous seasons, the season consisted of 12 episodes.
Plot
The season picks up two to three months after the events of the previous season. Fiona, officially off house arrest, is still a waitress at the Golden House diner, which has been renamed to Patsy's Pies and is now under the new ownership of Sean Pierce (Dermot Mulroney); Sheila leaves town after her house burns down; Frank, Sammi and Chuckie move into the Gallagher household; Mandy moves to Indiana with Kenyatta; and Ian remains in denial of his bipolarity as Mickey continues to look after him. When Ian begins showing increasingly erratic behavior, Mickey gets Ian to admit himself into a psychological evaluation ward.
Fiona begins a relationship with local musician Gus Pfender (Steve Kazee). After a one-week relationship, Fiona and Gus impulsively decide to get married. Her problems are compounded when Jimmy—going under the alias of Jack—suddenly returns to Chicago; Jimmy reveals that after boarding Nando's yacht, he had been forced to do slave labor in South America. Fiona has sex with Jimmy, who pleads with her to accompany him on a trip to Dubai, which she refuses. Jimmy later returns, stating that he cancelled the trip to stay with her; Fiona, recognizing the problems of their relationship, ends things with him for good. Fiona later learns from Jimmy's colleague Angela (Dichen Lachman), that the client had cancelled the Dubai trip—not Jimmy. Fiona and Gus' relationship strains following Fiona's infidelity, and Fiona ends up developing feelings for Sean, who is a recovering heroin addict.
Meanwhile, Debbie begins dating Derek, a boy she bonds with during boxing lessons. Debbie goes on birth control and has sex with Derek, despite being advised against doing so within 48 hours; this ultimately results in Debbie becoming pregnant, to Fiona's dismay. Lip and Amanda continue a non-exclusive relationship, though Amanda eventually begins showing feelings for Lip, which he ignores. When Lip pursues his older professor, Helene (Sasha Alexander), Amanda angrily lashes out at him for ditching her. Kevin and Veronica struggle with parental life, and the two go through a brief break-up period, in which Svetlana strikes an unlikely bond with Kevin. Kevin and Veronica eventually make amends at the end of the season.
At the Gallagher home, Sammi takes charge as the family's caretaker. She begins openly showing a disdain for Frank, her eyes opened to her father by her half-siblings. Frank wants to get rid of Sammi and convinces Carl, who has begun dealing drugs, to use Chuckie as a drug mule. In the second half of the season, Frank bonds with his doctor Bianca (Bojana Novakovic), who is diagnos |
https://en.wikipedia.org/wiki/Talal%20Shamoon | Talal G. Shamoon is a Silicon Valley executive, computer scientist, entrepreneur, and investor. In 2003 he became the chief executive of Intertrust Technologies Corporation. Starting in 1999, Shamoon has been involved in the development of digital rights management (DRM) technology which was first targeted to copyrights holders such as movie studios, music labels and publishers. He is the chairman of the developer community for the DRM technology Marlin.
Biography
Shamoon worked at the NEC Research Institute Princeton from 1994 to 1997 in the fields of signal processing and computer science.
Shamoon joined Intertrust Technologies as a researcher in July 1997 where he worked with Robert Tarjan. Since then, he was executive vice president for business development and marketing, and head of Intertrust's initiatives in the entertainment and media sectors. He became CEO in 2003 when Sony and Philips acquired Intertrust and took it private.
Shamoon was one of the authors of Secure spread spectrum watermarking for multimedia in 2014, a paper on digital watermarking published in IEEE Transactions on Image Processing (Volume 6, Issue 12). This paper was awarded the Sustained Impact Paper Award by the IEEE Signal Processing Society in 2015.
References
External links
IEEE Signal Processing Society Awardees
Nikkei Big Data Interview Article (English translation)
"Inventing the Internet of Trust" (blog post)
A Scheme For Protecting Content (article)
Watermarks in music? (article)
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Holiday%20Baking%20Championship | The Holiday Baking Championship is an American cooking competition series produced by Triage Entertainment and aired on Food Network. It airs from early November through late December, covering the U.S Thanksgiving and Christmas season. The first episode premiered on November 9, 2014, and it has become a yearly competition with several spin-off shows, including Spring Baking Championship, Halloween Baking Championship, Kids Baking Championship, and Wedding Cake Championship.
Rounds
Each episode has two rounds. The first round is the "Preliminary Heat" where the bakers must create small pastries centered around a holiday theme.
The person who wins the pre-heat gets an advantage going into the next round and aren't told about it until the second round theme is announced. The advantage usually varies.
The second round is the "Main Heat" where the contestants get more time than the first round to create a larger confection (in size or quantity) that sticks to the holiday theme of the episode. Partway through the main heat, there's often a curveball thrown in that has the bakers adapt or change their plans. The winner of the "Main Heat" advances to the next episode while the baker with the worst dish is eliminated. The 3 bakers remaining will compete in the final "Main Heat" challenge.
Host and judges
The show's first three seasons were hosted by Bobby Deen. Jesse Palmer has been host of the program since season four.
Cake Baker Duff Goldman (famously known for his popular former Food Network show Ace of Cakes) and Pastry Chef Nancy Fuller (host of current Food Network show Farmhouse Rules) serve as permanent judges of the show. Lorraine Pascale (a former UK model) was a judge for the first six seasons.
For season seven, Carla Hall replaced Pascale on the judges' panel, joining Fuller and Goldman.
Episodes
References
External links
Food Network original programming
Reality cooking competition television series
2014 American television series debuts
2010s American cooking television series
English-language television shows |
https://en.wikipedia.org/wiki/Composite%20index%20%28database%29 | A database composite index or multi-column index is an index that is based on several columns.
References
Databases
Database index techniques |
https://en.wikipedia.org/wiki/Almirante%20Tamandar%C3%A9%20do%20Sul | Almirante Tamandaré do Sul is a municipality in the state of Rio Grande do Sul in the Southern Region of Brazil.
Its population is roughly 1,949 inhabitants (data from 2020).
The main economy production of Almirante Tamandaré do Sul is agriculture. Soybeans, corn and wheat are the major products.
See also
List of municipalities in Rio Grande do Sul
References
Municipalities in Rio Grande do Sul |
https://en.wikipedia.org/wiki/BPDFamily.com | BPDFamily.com is an online support group for the family members of individuals with borderline personality disorder (BPD). The group is one of the first "cyber" support groups to be recognized by the medical providers and receive professional referrals.
BPDFamily.com provides articles and message boards for family members to learn and share their experiences. The articles explain borderline personality disorder in understandable terms, and the discussion groups help to normalize the experiences of family members. The site appeals to family members who care about someone with borderline personality disorder, but are frustrated with the relationship demands and conflict.
The site educates its members on concepts developed by Shari Manning PhD, Margalis Fjelstad PhD, Robert O. Friedel MD, and the NEA-BPD Family Connections Program and reached out to academia for collaborations. The site has an interactive web program that teaches the basic principles of cognitive behavioral therapy.
The website and support group are certified as a reputable health information resource by the Health On the Net Foundation.
Funding has come from benefactors and member donations.
Use by healthcare professionals
BPDFamily.com is a listed reference site of the National Health Service (England), the National Alliance on Mental Illness, the National Education Alliance for Borderline Personality Disorder, and the Personality Disorders Awareness Network.
The group's services and programs are recommended in Primer on Borderline Personality Disorder, Abnormal and Clinical Psychology: An Introductory Textbook, Resources to Improve Emotional Health and Strengthen Relationships, I Hate You--Don't Leave Me: Understanding the Borderline Personality, The Essential Family Guide to Borderline Personality Disorder, Stop Walking on Eggshells, and Discovering Your Inner Child: Transforming Toxic Patterns and Finding Your Joy. The site has been recommended by about.com expert Kristalyn Salters-Pedneault, PhD, Salon advice columnist Cary Tennis, PsychCentral columnist Kate Thieda, and by Randi Kreger at BPDCentral.
The organization has been involved and referenced in clinical research studies conducted by: Columbia University, University of Wollongong (Australia),
California State University, Sacramento, University of Toronto (Canada), University of Nevada, Bowling Green State University, Wright Institute (California), Colorado School of Professional Psychology, Long Island University, Alliant International University (California), Macquarie University (Australia), Middle Tennessee State University, Simon Fraser University (Canada) and Walden University. The organization also supports industry research studies conducted by the Treatment and Research Advancements Association for Personality Disorder (TARA-APD).
In a January 2013 column, Kristalyn Salters-Pedneault at Boston University School of Medicine says that although she highly recommends this group for family members, readers |
https://en.wikipedia.org/wiki/SpaceOps | SpaceOps (also referred to as the International Committee on Technical Interchange for Space Mission Operations and Ground Data Systems) is an international committee organisation formed in 1992 to "promote and maintain an international community of space operations experts".
Currently, thirteen space agencies are members of the organization. SpaceOps also has non-space agency members from academia and industry.
Conferences
SpaceOps Organization has held fifteen biennial conferences hosted by various countries around the world. These international fora have discussed operations principles, methods, cross-support and tools, management and technical interchange.
Most Recent Conferences
Daejeon, South Korea, hosted by: KARI, 2016
Marseille, France, CNES, 2018
Capetown, South Africa, SANSA, 2021. It was held virtually and was shifted from the original 2020 date due to COVID-19.
Next Conferences
Dubai, UAE, hosted by: MBRSC, March 2023.
Montreal, Canada, CSA, 2025
Publications
In 2004, the AIAA Space Operations and Support Technical Committee partnered with the SpaceOps Organization to publish the Journal of Space Operations & Communicator, a peer-reviewed journal dedicated to spaceflight operations and ground support.
Since 2006 most of the conference hosts have decided to publish a post-conference vook. These books contain around 30 of the best papers that have been handed in for the conference. The selected papers were all updated, corrected and in many cases extended by the authors following their nomination at the conference.
Awards program
Through its awards program, the SpaceOps Organization recognizes outstanding achievement by individuals and teams in the space operations field. The “International SpaceOps Exceptional Achievement Medal". award recognizes an individual who has distinguished himself or herself in the field of space operations and support.
References
External links
SpaceOps Website
Journal of SpaceOperations & Commincator
Space advocacy organizations
Spaceflight |
https://en.wikipedia.org/wiki/Sophos%20%28disambiguation%29 | Sophos is a computer security developer.
Sophos may also refer to:
Agathos kai sophos, a phrase used by Plato meaning "good and wise"
Sage (philosophy) or sophos, a philosophical term for someone who has attained wisdom |
https://en.wikipedia.org/wiki/Volodymyr%20Ivanenko | Volodymyr Oleksandrovych Ivanenko () was founder of the first nongovernmental cable and essential television network in the USSR (1988); initiator and organizer of the first direct satellite broadcast from the territory of the former USSR (1994); founder of the first nongovernmental TV stations in Ukraine: TONIS and TET; television and cinema producer; and public figure.
Education
His father was a career military man. From 1961 to 1971 he attended a school in Simferopol. In 1974 he enrolled into Admiral Makarov National University of Shipbuilding in Mykolaiv, and successfully graduated in 1980.
Career
After graduation from the National University of Shipbuilding, Vladimir Ivanenko proceeded to work at the Central Research Institute of Shipbuilding Technology in Mykolaiv. This period is marked by several authors' certificates for innovative developments in the field of shipbuilding.
For several years Vladimir Ivanenko worked at the criminal investigation department of the Ministry of Internal Affairs in Mykolaiv. He resigned his post as captain after becoming enamored with the idea unprecedented in those days: that of creating a nongovernmental TV broadcast in the USSR.
Dreaming about independent television
Years 1987 and 1988 were completely dedicated to creating the first nongovernmental cable television network in the USSR. Having managed to schedule a meeting with academician Dmitry Likhachev and Raisa Gorbacheva at the Soviet Culture Fund, Vladimir was able to convince them to support the idea of the channel.
On February 13, 1988, in Mykolaiv (then part of Ukrainian SSR), the first experimental Youth Video Channel (“Molodezhny Videokanal”) started broadcasting on the grounds of Mykolaiv City Komsomol Committee. Vladimir Ivanenko became the channel's first Director.
In late 1988, Youth Video Channel left the care of City Komsomol Committee. At Vladimir Ivanenko's initiative the name was changed to Creative Union of New Informational Systems (“Tvorcheskoye Obyedinenie Novykh Informatsionnykh Sistem”, shortened to TONIS).
In 1991, during the self-declared State Emergency Committee, TONIS (or Channel-22) became the only source of independent broadcast in southern Ukraine. The channel prepared stories for the popular youth program by Moscow's Ostankino studio, Look (“Vzglyad”).
It is symbolic that the TONIS independent television company launched its broadcast in early 1990 with the help of a transmitter (capacity of 1 kW) placed on a tower which had been previously used by KGB to silence foreign radio stations. In late 1991 TONIS moved its headquarters from Mykovaiv to Kyiv and was eventually renamed to TET-a-TET (TONIS-Enter Television).
International TONIS Union
In early 1992 Vladimir Ivanenko initiated the first congress of independent TV companies in Kharkiv (Ukraine) under the slogan “For copyright protection”. It was at that congress that the International TONIS Union was created. Vladimir Ivanenko was unanimously chosen as |
https://en.wikipedia.org/wiki/Epic%20TV | Epic TV is an Indian television channel that airs action, drama, comedy and narrative non-fiction and fictional programming with a focus on Indian history, folklore and epic genre. Launched by IN10 Media on 19 November 2014, a company owned by Anand Mahindra, it airs programmes in Hindi and English. Aditya Pittie, CEO of Pittie Group is the Managing Director of Epic TV.
Some of its programmes like Raja, Rasoi Aur Anya Kahaniyaan; Kahi Suni; Dharmakshetra; Sanrachana have been added to Netflix. The slogan of the channel is "Soch Se Aage"(means Ahead of Thought).
Their digital platform named Epic ON was launched in early 2017 with most shows available.
The company has revealed a vision of organising and building itself as a media network, with new ventures across every touch-point of the content life-cycle that would consolidate under the banner of IN10 Media. As part of its expansion plans, the company also announced the launch of two new television channels – Gubbare TV (a kids channel) and Ishara TV.
Shows
Fiction
Daanav Hunters
Dariba Diaries
Dharmakshetra
Kalyug: Ek Aarambh
Roz Sunday
Siyaasat
Stories by Rabindranath Tagore
Time Machine
Yam Kisi Se Kam Nahin
Non-Fiction
Adrishya
Animals in Mythology
Back to Flashback with Javed Jaffrey
Bharat - Rhythm of a Nation by Sadhguru (Acquired)
Bharat Ki Awaaz
Cultural Heritage India (Acquired)
DeepTalks by Deep Trivedi (Acquired)
Devlok with Devdutt Pattanaik (3 Seasons)
Ekaant (2 Seasons & Sarhad Paar Special Episode)
Epic Explorer
Epic IQ Challenge
Epic Ke Dus (2 Seasons)
Epic Khoj
Epicpedia
Epic Tales of Love
Glory to God (Acquired)
Hit The Road India (Acquired)
Indian Martial Arts - Ek Itihas
Indipedia
Jaane Pehchaane with Javed Akhtar
Journeys in India (Acquired)
Kahi Suni
Kalyug - Ek Aarambh
Khwaabon Ka Safar with Mahesh Bhatt
Kissa Currency Ka
Once More with Javed Jaffrey
Lootere - Bandits of British India (3 Seasons)
Lost Recipes
Made in India
Mid Wicket Tales with Naseeruddin Shah
Raja Rasoi Aur Andaaz Anokha (2 Seasons)
Raja, Rasoi Aur Anya Kahaniyaan (4 Seasons)
Rakkt (2 Seasons)
Regiment Diaries (2 Seasons)
Road Less Travelled (Acquired)
Sampatti Aur Sauda - Tales of Trade
Sanrachna
Sharanam - Safar Vishwas Ka (2 Seasons)
The Creative Indians (Acquired)
The Great Escape
Tyohaar Ki Thaali
Umeed India
Way Back Home (Acquired)
Wild Wild India (Acquired)
Wilderness Days (Acquired)
Jai Hanuman (Acquired)
Mahabharat (Acquired)
Mahabharat Katha (Acquired)
Shree Ganesh (Acquired)
Upgraded Full 202 or 404 error
Documentaries
A Tent, a Truck & Talkies
Air Battle of Srinagar
Andamans - Jewels of the Sea (Acquired)
Ayodhya - The Home Coming
Balasinor - Rediscover India's Dinosaurs
Beehad
Curry Pow (Acquired)
Cyber Yoddha (Acquired)
Drishti - Documentaries on Epic (2 Seasons, Acquired)
Ghaat Ghaat Ka Paani
Hai Junoon
Himalayan Misfits
Jallianwala Bagh - Punjab Da Dil (2 Part Series)
Janani (Acquired)
Jungle Ke Baahubali |
https://en.wikipedia.org/wiki/Sustainable%20Land%20Use%20Forum | The Sustainable Land Use Forum (SLUF) is a local Ethiopian non-governmental organization established in 1995 in Addis Ababa. It is a network of like-minded organizations under the name “NOVIB Partners Forum on Sustainable Land Use in Ethiopia and Eritrea”. The organisation was established due to data received from a 1994 study exposing severe land degradation and unsustainable population dynamics in Ethiopia and Eritrea. Partnerships with Eritrean organizations were discontinued due to the war between the two countries in 1998.
NOVIB has been gradually expanding the scope, geographic locations and diversity of its programs in Ethiopia, paving the way for SLUF in February 2002 and renamed as Sustainable Land Use Forum. In accordance with the Charities and Societies Proclamation No. 621/2009, SLUF was re-registered as an Ethiopian Residents Charities Consortium with certificate no. 0523 in November 2009.
SLUF is a membership organization where membership is open to all organizations engaged in Sustainable Land Use and Natural Resources Management. As of 2014 it had 29 members consisting of 3 international and 26 local NGOs. One of the international NGOs is an Honorary Member.
External links
Sustainable agriculture
Sustainability organizations
Environment of Eritrea
Environment of Ethiopia
Charities based in Ethiopia
Environmental organizations established in 1995
1995 establishments in Ethiopia |
https://en.wikipedia.org/wiki/This%20Sitcom%20Is...Not%20to%20Be%20Repeated | This Sitcom Is...Not to Be Repeated is a Canadian comedy television series, which aired on The Comedy Network in 2001. Created by and starring Ed Sahely, Kathy Greenwood and Jonathan Wilson based on their stage show Not to Be Repeated, the series incorporated improvisational comedy techniques.
Each episode of the series was structured as a sitcom episode with a narrative framework, but at various points the actors would be called upon to draw lines submitted by viewers out of a hat, and incorporate them into the dialogue. Fifteen episodes of the show were produced.
Episodes
References
External links
2000s Canadian comedy television series
2001 Canadian television series debuts
2001 Canadian television series endings
CTV Comedy Channel original programming
Improvisational television series |
https://en.wikipedia.org/wiki/SQL%20Database%20Studio | SQL Database Studio is professional client for Microsoft SQL Server developed by Jan Prochazka in Czech Republic.
SQL Database Studio (SDS) is used by database developers for designing database and also by average users for browsing data. SDS comes in two version. EXPRESS version is free even for commercial purposes but lacks some features that are in PRO version. SDS allows visualization of GPS data.
It is built using WPF application running on Microsoft .NET Framework 4.5.
Feature summary
GPS Visualization allows showing location data in map and exporting map
SQL Query Designer
Support for SELECT, INSERT, UPDATE queries
Specific join operators - WHERE NOT EXISTS, CROSS APPLY, OUTER APPLY
Database schema visualization
Table column's filter
Database projects
SQL Editor with auto complete
Run SQL commands in transaction
Run SQL commands on multiple connections simultaneously
Import and export to/from formats MS Excel, CSV, DBF
Saving SQL scripts in projects not affecting database
Database configuration with setting risk levels (Development database, production database)
Data widgets (simple queries saved in database project, which are bind to some table, application than shows results of query while browsing table data)
Database Jobs designer
Switching between various GUI layouts
DbShell Console is opensource project for database operation automation)
Supported databases
Microsoft SQL Server 2005, 2008, 2008R2,2012, 2014, 2016,2017,2019
References
Database administration tools
Windows-only free software
Microsoft database software
SQL |
https://en.wikipedia.org/wiki/Network%20medicine | Network medicine is the application of network science towards identifying, preventing, and treating diseases. This field focuses on using network topology and network dynamics towards identifying diseases and developing medical drugs. Biological networks, such as protein-protein interactions and metabolic pathways, are utilized by network medicine. Disease networks, which map relationships between diseases and biological factors, also play an important role in the field. Epidemiology is extensively studied using network science as well; social networks and transportation networks are used to model the spreading of disease across populations. Network medicine is a medically focused area of systems biology.
Background
The term "network medicine" was coined and popularized in a scientific article by Albert-László Barabási called "Network Medicine – From Obesity to the "Diseasome", published in The New England Journal of Medicine, in 2007. Barabási states that biological systems, similarly to social and technological systems, contain many components that are connected in complicated relationships but are organized by simple principles. Using the recent development of network theory, the organizing principles can be comprehensively analyzed by representing systems as complex networks, which are collections of nodes linked together by a particular relationship. For networks pertaining to medicine, nodes represent biological factors (biomolecules, diseases, phenotypes, etc.) and links (edges) represent their relationships (physical interactions, shared metabolic pathway, shared gene, shared trait, etc.).
Three key networks for understanding human disease are the metabolic network, the disease network, and the social network. The network medicine is based on the idea that understanding complexity of gene regulation, metabolic reactions, and protein-protein interactions and that representing these as complex networks will shed light on the causes and mechanisms of diseases. It is possible, for example, to infer a bipartite graph representing the connections of diseases to their associated genes using the OMIM database. The projection of the diseases, called the human disease network (HDN), is a network of diseases connected to each other if they share a common gene. Using the HDN, diseases can be classified and analyzed through the genetic relationships between them. Network medicine has proven to be a valuable tool in analyzing big biomedical data.
Research areas
Interactome
The whole set of molecular interactions in the human cell, also known as the interactome, can be used for disease identification and prevention. These networks have been technically classified as scale-free, disassortative, small-world networks, having a high betweenness centrality.
Protein-protein interactions have been mapped, using proteins as nodes and their interactions between each other as links. These maps utilize databases such as BioGRID and the Human Protein Refe |
https://en.wikipedia.org/wiki/Acaiatuca | Acaiatuca is a genus of longhorn beetles of the subfamily Lamiinae, containing the following species:
Acaiatuca denudata Galileo & Martins, 2001
Acaiatuca quadricostata (Tippmann, 1953)
References
Hemilophini
Cerambycidae genera |
https://en.wikipedia.org/wiki/Broadchurch%20%28series%201%29 | The first series of the British crime drama Broadchurch originally aired on the ITV broadcast network in the United Kingdom from 4 March 2013 to 22 April 2013. The eight-episode series began with the murder of an 11-year-old boy in the fictional, close-knit coastal town of Broadchurch in Dorset, United Kingdom. The series depicted the impact that suspicion and media attention have on the community.
Though Broadchurch was first conceived of in 2003, creator and writer Chris Chibnall first began fleshing out the story and writing scripts for the first episodes in 2011. He approached ITV in autumn 2011 with the series, and the network quickly approved it for production. The role of Reverend Paul Coates was written for Arthur Darvill, and leads David Tennant and Olivia Colman were the first cast. Other roles were cast using auditions. Principal photography began on 13 August 2012 in Dorset. Most scenes were shot on location, with the majority of filming in and around Clevedon and West Bay. Soundstages were used for some interior scenes. Dialogue rarely departed from the scripts, but other aspects of the performances were improvised. A documentary visual style and an emphasis on first takes were used to heighten the realism of the series and acting. Few of the crew and none of the actors knew the identity of the murderer when filming began. A number of steps were taken to maintain this secret. Only those cast and crew with an absolute need to know were told the identity of the murderer once filming began on the final three episodes.
Broadchurch series one received widespread critical acclaim and high viewership ratings. Music by Ólafur Arnalds helped to inspire the series' mood and tone. Arnalds composed the series' soundtrack, which won a BAFTA Craft award. Among the many honours received by cast and crew, Olivia Colman won a BAFTA for Best Actress and David Bradley for Best Supporting Actor, and the series was named Best Drama.
Episodes
Supplement content
The final episode of series one finished with a caption reading "Broadchurch Will Return". ITV executives confirmed that a second series of Broadchurch had been commissioned, with production to begin in 2014.
Following episode eight, an extra scene was released on YouTube depicting Danny's wake, held the afternoon after the funeral but before the evening when the beacons were lit. Nigel and Mark were shown reconciled, Olly turned down a job at the Herald, and Hardy spoke to Karen about why he alerted her to Joe's arrest. The video ended with the words "Broadchurch will return".
Cast
Characters in series one of Broadchurch included the following:
Police
Detective Inspector Alec Hardy (David Tennant) – an experienced detective who recently arrived in Broadchurch, wanting a quiet life due to his scandal-tinged work history. He has difficulty dealing with Danny's murder because of his involvement in the failed Sandbrook murder case.
Detective Sergeant Ellie Miller (Olivia Colman) – a local det |
https://en.wikipedia.org/wiki/Attack%20tolerance | In the context of complex networks, attack tolerance is the network's robustness meaning the ability to maintain the overall connectivity and diameter of the network as nodes are removed. Several graph metrics have been proposed to predicate network robustness. Algebraic connectivity is a graph metric that shows the best graph robustness among them.
Attack types
If an attack was to be mounted on a network, it would not be through random nodes but ones that were the most significant to the network. Different methods of ranking are utilized to determine the nodes priority in the network.
Average node degree
This form of attack prioritizes the most connected nodes as the most important ones. This takes into account the network (represented by graph ) changing over time, by analyzing the network as a series of snapshots (indexed by ); we denote the snapshot at time by . The average of the degree of a node, labeled , within a given snapshot , throughout a time interval (a sequence of snapshots) , is given by:
Node persistence
This form of attack prioritizes nodes that occur most frequently over a period of time. The equation below calculates the frequency that a node (i) occurs in a time interval . When the node is present during the snapshot then equation is equal to 1, but if the node is not present then it is equal to 0.
Where
Temporal closeness
This form of attack prioritizes nodes by the summation of temporal distances from one node to all other nodes over a period of time. The equation below calculates the temporal distance of a node (i) by averaging the sum of all the temporal distances for the interval [t1,tn].
Network model tolerances
Not all networks are the same, so it is no surprise that an attack on different networks would have different results. The common method for measuring change in the network is through the average of the size of all the isolated clusters, <s>, and the fraction of the nodes contained in the largest cluster, S. When no nodes have been attacked, both S and <s> equal 1.
Erdős–Rényi model
In the ER model, the network generated is homogeneous, meaning each node has the same number of links. This is considered to be an exponential network. When comparing the connectivity of the ER model when it undergoes random failures vs directed attacks, we are shown that the exponential network reacts the same way to a random failure as it does to a directed attack. This is due to the homogeneity of the network, making it so that it does not matter whether a random node is selected or one is specifically targeted. All the nodes on average are the same in degree therefore attacking one shouldn't cause anymore damage than attacking another. As the number of attacks go up and more nodes are removed, we observe that S decreases non-linearly and acts as if a threshold exists when a fraction of the nodes (f) has been removed, (f≈.28). At this point, S goes to zero. The average size of the isolated clusters behaves opposite, in |
https://en.wikipedia.org/wiki/Louvain%20method | The Louvain method for community detection is a method to extract non-overlapping communities from large networks created by Blondel et al. from the University of Louvain (the source of this method's name). The method is a greedy optimization method that appears to run in time where is the number of nodes in the network.
Modularity optimization
The inspiration for this method of community detection is the optimization of modularity as the algorithm progresses. Modularity is a scale value between −0.5 (non-modular clustering) and 1 (fully modular clustering) that measures the relative density of edges inside communities with respect to edges outside communities. Optimizing this value theoretically results in the best possible grouping of the nodes of a given network. But because going through all possible iterations of the nodes into groups is impractical, heuristic algorithms are used.
In the Louvain Method of community detection, first small communities are found by optimizing modularity locally on all nodes, then each small community is grouped into one node and the first step is repeated. The method is similar to the earlier method by Clauset, Newman and Moore that connects communities whose amalgamation produces the largest increase in modularity.
Algorithm
The value to be optimized is modularity, defined as a value in the range that measures the density of links inside communities compared to links between communities. For a weighted graph, modularity is defined as:
where
represents the edge weight between nodes and ;
and are the sum of the weights of the edges attached to nodes and , respectively;
is the sum of all of the edge weights in the graph;
and are the communities of the nodes; and
is Kronecker delta function ( if , otherwise).
Based on the above equation, the modularity of a community can be calculated as:
where
is the sum of edge weights between nodes within the community (each edge is considered twice); and
is the sum of all edge weights for nodes within the community (including edges which link to other communities).
In order to maximize modularity efficiently, the Louvain Method has two phases that are repeated iteratively.
First, each node in the network is assigned to its own community. Then for each node , the change in modularity is calculated for removing from its own community and moving it into the community of each neighbor of . This value is easily calculated by two steps: (1) removing from its original community, and (2) inserting to the community of . The two equations are quite similar, and the equation for step (2) is:
Where is sum of all the weights of the links inside the community is moving into, is the sum of all the weights of the links to nodes in the community is moving into, is the weighted degree of , is the sum of the weights of the links between and other nodes in the community that is moving into, and is the sum of the weights of all links in the network. T |
https://en.wikipedia.org/wiki/Maya%20the%20Bee%20%28film%29 | Maya the Bee (promoted theatrically as Maya the Bee Movie) is a 2014 computer-animated comedy adventure film directed by Alexs Stadermann, loosely based on the 1975 anime Maya the Bee as well as indirectly the German children's book The Adventures of Maya the Bee by Waldemar Bonsels. It features the voices of Coco Jack Gillies, Kodi Smit-McPhee, Noah Taylor, Richard Roxburgh, Jacki Weaver, Justine Clarke, The Umbilical Brothers, and Miriam Margolyes.
Maya the Bee was released theatrically on 4 September 2014. The film received mixed reviews from critics, but grossed $29.6 million worldwide. Two sequels to Maya the Bee were released; The Honey Games in 2018 and The Golden Orb in 2021.
Summary
Freshly hatched bee Maya is a little whirlwind and simply won't follow the rules of the hive. One of the rules, of course, she is not allowed to trust the other bugs, especially the hornets, that live beyond a camp in the meadow. But cute sweet little Maya can't help but make friends with all kinds of other bugs, including a violin-playing grasshopper, a dung beetle and even a young hornet named Sting, who has a hatred of bees.
Voice cast
Coco Jack Gillies as Maya, a young bee girl.
Kodi Smit-McPhee as Willy, a young bee boy, Maya's best friend.
Joel Franco as Sting, a young hornet, Maya and Willy's best friend and sidekick.
Richard Roxburgh as Flip, a grasshopper.
Justine Clarke as Miss Cassandra, a teacher at the bee school and Maya's mother at heart.
Jacki Weaver as Buzzlina Von Beena, the royal counselor of the beehive and Maya's arch-enemy.
Andy McPhee as Hank, the leader of hornets, Sting's father, Bees friends, and former arch-rivals.
Miriam Margolyes as The Queen, the mother of Bees.
David Collins as Arnie, an ant soldier, Paul's right-hand.
Shane Dundas as Barney, an ant soldier, Arnie's partner and Paul's right-hand.
Jimmy James Eaton as Paul, an ant colonel, the leader of ants.
Heather Mitchell as The Nurse, chief of the worker bees.
Noah Taylor as Crawley, the hilariously bumbling of the beehive, The Queen's loyal assistant and Buzzlina's former henchman.
Cameron Ralph as Momo, a moth.
Glenn Fraser as Kurt, a dung beetle.
Heather Mitchell as Thekla, a stubborn spider.
Stavroula Mountzouris as Lara, a ladybug who is Willy's love interest.
Sam Haft as Drago, a dragonfly.
Production
Animation World Network announced in May 2013 that Universum Film would distribute all German rights of the film. The film is directed by Alexs Stadermann, and produced by Patrick Elmendorff and Thorsten Wegener from Studio 100 Animation in Munich; Jim Ballantine and Barbara Stephen from Buzz Studios in Sydney. The film was produced in association with Flying Bark Productions and the channel ZDF. This film was Coco Jack Gillies' film debut, voicing the role of Maya. Gillies was 9 years old at the time of production.
Reception
Maya the Bee received mixed reviews from critics, scoring a 47% in Rotten Tomatoes with an average rating of 5.59/10 from s |
https://en.wikipedia.org/wiki/Conflict-free%20replicated%20data%20type | In distributed computing, a conflict-free replicated data type (CRDT) is a data structure that is replicated across multiple computers in a network, with the following features:
The application can update any replica independently, concurrently and without coordinating with other replicas.
An algorithm (itself part of the data type) automatically resolves any inconsistencies that might occur.
Although replicas may have different state at any particular point in time, they are guaranteed to eventually converge.
The CRDT concept was formally defined in 2011 by Marc Shapiro, Nuno Preguiça, Carlos Baquero and Marek Zawirski. Development was initially motivated by collaborative text editing and mobile computing. CRDTs have also been used in online chat systems, online gambling, and in the SoundCloud audio distribution platform. The NoSQL distributed databases Redis, Riak and Cosmos DB have CRDT data types.
Background
Concurrent updates to multiple replicas of the same data, without coordination between the computers hosting the replicas, can result in inconsistencies between the replicas, which in the general case may not be resolvable. Restoring consistency and data integrity when there are conflicts between updates may require some or all of the updates to be entirely or partially dropped.
Accordingly, much of distributed computing focuses on the problem of how to prevent concurrent updates to replicated data. But another possible approach is optimistic replication, where all concurrent updates are allowed to go through, with inconsistencies possibly created, and the results are merged or "resolved" later. In this approach, consistency between the replicas is eventually re-established via "merges" of differing replicas. While optimistic replication might not work in the general case, there is a significant and practically useful class of data structures, CRDTs, where it does work — where it is always possible to merge or resolve concurrent updates on different replicas of the data structure without conflicts. This makes CRDTs ideal for optimistic replication.
As an example, a one-way Boolean event flag is a trivial CRDT: one bit, with a value of true or false. True means some particular event has occurred at least once. False means the event has not occurred. Once set to true, the flag cannot be set back to false (an event having occurred cannot un-occur). The resolution method is "true wins": when merging a replica where the flag is true (that replica has observed the event), and another one where the flag is false (that replica hasn't observed the event), the resolved result is true — the event has been observed.
Types of CRDTs
There are two approaches to CRDTs, both of which can provide strong eventual consistency: operation-based CRDTs and state-based CRDTs.
The two alternatives are theoretically equivalent, as each can emulate the other.
However, there are practical differences.
State-based CRDTs are often simpler to design a |
https://en.wikipedia.org/wiki/VP3%20%28disambiguation%29 | VP3 is a video compression format owned by Google and created by On2 Technologies.
VP3 may also refer to:
Apollo VP3, a computer chipset
Virtual Pool 3, a video game
VP3, a viral protein; for example in Rotavirus
VP-3, a patrol squadron of the U.S. Navy |
https://en.wikipedia.org/wiki/Robustness%20of%20complex%20networks | Robustness, the ability to withstand failures and perturbations, is a critical attribute of many complex systems including complex networks.
The study of robustness in complex networks is important for many fields.
In ecology, robustness is an important attribute of ecosystems, and can give insight into the reaction to disturbances such as the extinction of species. For biologists, network robustness can help the study of diseases and mutations, and how to recover from some mutations. In economics, network robustness principles can help understanding of the stability and risks of banking systems. And in engineering, network robustness can help to evaluate the resilience of infrastructure networks such as the Internet or power grids.
Percolation theory
The focus of robustness in complex networks is the response of the network to the removal of nodes or links. The mathematical model of such a process can be thought of as an inverse percolation process. Percolation theory models the process of randomly placing pebbles on an n-dimensional lattice with probability p, and predicts the sudden formation of a single large cluster at a critical probability . In percolation theory this cluster is named the percolating cluster. This phenomenon is quantified in percolation theory by a number of quantities, for example the average cluster size . This quantity represents the average size of all finite clusters and is given by the following equation.
We can see the average cluster size suddenly diverges around the critical probability, indicating the formation of a single large cluster. It is also important to note that the exponent is universal for all lattices, while is not. This is important as it indicates a universal phase transition behavior, at a point dependent on the topology. The problem of robustness in complex networks can be seen as starting with the percolating cluster, and removing a critical fraction of the pebbles for the cluster to break down. Analogous to the formation of the percolation cluster in percolation theory, the breaking down of a complex network happens abruptly during a phase transition at some critical fraction of nodes removed.
Critical threshold for random failures
The mathematical derivation for the threshold at which a complex network will lose its giant component is based on the Molloy–Reed criterion.
The Molloy–Reed criterion is derived from the basic principle that in order for a giant component to exist, on average each node in the network must have at least two links. This is analogous to each person holding two others' hands in order to form a chain. Using this criterion and an involved mathematical proof, one can derive a critical threshold for the fraction of nodes needed to be removed for the breakdown of the giant component of a complex network.
An important property of this finding is that the critical threshold is only dependent on the first and second moment of the degree distribution and is valid for an |
https://en.wikipedia.org/wiki/Venticool | Venticool is an international platform formed in 2012 focusing on ventilative cooling issues, with the overall goal to "boost awareness, communication, networking and steering research and development efforts in the field" . In 2020, venticool's focus was broadened towards resilient ventilative cooling.
According to Annex 80 ‘Resilient Cooling of Buildings’ research project of the ‘Energy in Buildings and Communities Programme (EBC)’ of the International Energy Agency (IEA), the resilience of a building is described as the “ability of the building to withstand disruptions caused by extreme weather events, man-made disasters, power failure, change in use and atypical conditions; and to maintain capacity to adapt, learn and transform”.
venticool supports better guidance, to appropriately implement in practice and enable adequate credit for resilient ventilative cooling strategies in national and international building regulations.
The platform's main activities include the organization of events: conferences, workshops and webinars, as well as the production of publications: papers, reports, guidebooks etc.
History
The international platform for ventilative cooling- venticool was inaugurated in October 2012 during the 33rd AIVC Conference in Copenhagen. The platform is facilitated by the International Network for Information on Ventilation and Energy Performance- INIVE EEIG, which is a registered European Economic Interest Grouping (EEIG) whose members include building research centres in Europe. Since then, the platform has been financially and/or technically supported by its partners: AGORIA-naventa, Reynaers Aluminium, VELUX and WindowMaster.
Collaborations
venticool also collaborates with organizations that hold significant experience and/or are well identified in the field of ventilation and thermal comfort, such as the IEA-EBC's Annex 5: AIVC, which aims to provide reliable reference information on research and development in the fields of air infiltration and ventilation, the Active House Alliance, CIBSE nvg, REHVA, EuroWindoor AISBL and others.
venticool was the key partner in the communication and dissemination activities of the Annex 62 ‘ventilative cooling’ research project of the ‘Energy in Buildings and Communities Programme (EBC)’ of the International Energy Agency (IEA), an international collaborative project on ventilative cooling with a four-year working phase (2014–2018). The main aim of Annex 62 was to make ventilative cooling an attractive and energy efficient cooling solution to avoid overheating in both new and renovated buildings.
Currently, venticool is the main dissemination partner of IEA-EBC “Annex 80 Resilient Cooling of Buildings” which runs from 2018 to 2023, with the main objective to “support a rapid transition to an environment where resilient low energy and low carbon cooling systems are the mainstream and preferred solutions for cooling and overheating issues in buildings”.
venticool is also disseminat |
https://en.wikipedia.org/wiki/Wombridge%20Priory | Wombridge Priory was a small Augustinian monastery in Shropshire. Established in the early 12th century, it was supported by a network of minor nobility and was never a large community. Despite generally good financial management, it fell within the scope of the Suppression of Religious Houses Act 1535 and was dissolved in the following year.
Foundation
William Dugdale, the pioneering historian of Britain's monasteries, thought that Wombridge Priory was founded by William FitzAlan, who dominated Shropshire and large tracts of the Welsh marches in the early to mid 12th century. It is now known that it was founded by or for William of Hadley, a much less powerful landowner, and a vassal of William FitzAlan, who was tenant-in-chief of the manor of Hadley. William of Hadley was the terre tenant or lord of the manor. William was married to Seburga, an illegitimate daughter of a much wealthier and more powerful baron, Hamo Peveril, whose seat was High Ercall Hall. The earliest grant of lands to the Priory, consisting of the site in Hadley Wood and a half virgate at High Hatton, must date from 1136 or a little earlier and was made by William of Hadley, Seburga and their son, Alan of Hadley. The only record of it is in a document confirming William FitzAlan's approval of his tenants' actions. FitzAlan's confirmation quite explicitly recognises that the gift comes from William, Seburga and Alan but says it is pro salute animae suae – for the salvation of his soul, in the singular: perhaps simply a mistake. However it seems that William died around 1136, perhaps between the gift and its confirmation. The document refers to Canonicis de Wombrug, implying that the community envisaged in the grant was composed of Augustinian Canons Regular.
FitzAlan's confirmation seems to be the origin of the idea that he was the founder, although he appears only as William of Hadley’s feudal lord. A much later document of 1319 mentions FitzAlan's confirmation while omitting the original founders. FitzAlan had his own monastic foundation to tend, Haughmond Abbey, and was a great benefactor to Shrewsbury Abbey, as were his dynasty for centuries.
Location
The foundation document describes Wombridge Priory's location as
The Priory was built in a clearing in Hadley Wood, less than one kilometre north of Watling Street. The royal wood from which it was separated by a stream was properly called Mount Gilbert Forest, more commonly known as the Wrekin, and this neighbouring part of it subsequently became known as Wrockwardine Wood. The village of Wombridge grew up adjacent the priory, on its demesne lands, with Oakengates as a small hamlet nearby. During the Industrial Revolution, Oakengates grew rapidly, dwarfing and absorbing Wombridge itself. In the 1960s it became a constituent part of the new town of Telford, which is now part of the borough of Telford and Wrekin, a unitary authority, and so not under Shropshire Council. The priory site is now occupied by the Church of St |
https://en.wikipedia.org/wiki/Computer%20Engineer%20Barbie | Computer Engineer Barbie is the 126th career version of Mattel's Barbie doll. In response to poll results indicating strong support for computer engineers, the doll set was created and introduced in 2010. In 2014, Mattel apologized for the accompanying book, I Can Be a Computer Engineer, after complaints that it represented Barbie as incompetent in the field, needing the help of men.
Description
The doll has a pink laptop and a pink smartphone, and is wearing geometric pink glasses, a pink watch, black leggings, a T-shirt decorated with "Barbie" spelled in binary code, a fitted vest with saddle-stitch detailing, pink wedges, and a Bluetooth headset. The packaging included a code to unlock exclusive game content on the Barbie website. Female engineers including Betty Shanahan, CEO of the Society of Women Engineers, and Alice Agogino of the National Academy of Engineering were consulted on her wardrobe and work environment. They suggested that for authenticity she needed "a Coke can and a bag of Doritos" on her desk; she has a coffee cup. One mockup also included a Linux penguin; Barbie is running Linux on her dual-monitor set-up.
History
In 2010, Mattel invited people to vote for Barbie's 126th career, the first instance of this in the company's history. Voters were able to choose between five choices: computer engineer, architect, environmentalist, news anchor, and surgeon. Although girls preferred news anchor, computer engineer was the most popular choice in online polling, partly because of promotion by the Society of Women Engineers. The two dolls were launched together at the 2010 American International Toy Fair.
Reception
Many writers for tech publications and other reviewers were encouraged by the choice of career, hoping it would encourage girls to consider careers in computer science. However, the amount of pink, the hairstyle, and the stylish clothes struck some women as unrealistic and stereotyped.
The accompanying book, I Can Be a Computer Engineer, was issued in 2013 together with I Can Be an Actress. The book received extensive criticism, especially beginning in November 2014, for depicting Barbie as relying on two male friends to program the game she is designing. In addition, they need to help her after she accidentally infects her and her sister Skipper's computer with a virus (via the pink heart-shaped USB stick she wears around her neck), after ignoring advice from her (female) computer teacher.
A website was created to enable people to replace segments of the book's text with their own, and Mattel pulled the title from Amazon after many critical reviews. The publisher stated it was being discontinued. A Mattel spokesperson said that the book had first been published in 2010 and was outdated, and the company apologized. The book's Barbie says she's "only creating the design ideas" and that her two male friends will have to do the coding; the author, who proclaimed herself a feminist, said her assignment had been to portra |
https://en.wikipedia.org/wiki/Automated%20whole-breast%20ultrasound | Automated whole-breast ultrasound (AWBU) is a medical imaging technique used in radiology to obtain volumetric ultrasound data of the entire breast.
How it works
Similarly to the 3D ultrasound technique used for pregnant women, AWBU allows volumetric image data to be obtained from ultrasound sonography.
With automated whole-breast ultrasound, the ultrasound transducer is guided over the breast in an automatic manner. The position and speed of the transducer is regulated automatically, whereas the angle of incidence and the amount of pressure applied is set by the human operator. The entire breast is scanned in an automated manner, and the procedure yields volumetric image data of the breast. The resulting image data can be read at any convenient time by the radiologist, who is freed from performing the scan.
This allows selected scan planes to be visualized, and also allows the data to be displayed as a volumetric image.
Applications
AWBU has been proposed as an additional cancer screening modality, in particular for women with dense breasts.
Studies have consistently shown an increased detection of breast cancer by supplementary ultrasound screening, compared to mammography alone.
Comparison to hand-held ultrasound
AWBU offers advantages in terms of speed and standardization of ultrasound imaging, rendering the result largely independent of the skill of the operator. Furthermore, the position of any abnormality can be determined relative to the position of the nipple, allowing the same abnormality to be retrieved with precision in follow-up diagnostic procedures and also in biopsy interventions.
However, a number of AWBU techniques employ ultrasound transducers of lower frequency than hand-held ultrasound, resulting in lower spatial and contrast resolution. A disadvantage of AWBU imaging is that it captures static tissue features and does not show the dynamic images properties that can often be seen in images obtained from hand-held ultrasound devices.
Research
There have been preliminary investigations into the use of AWBU for performing ultrasound-guided biopsy. Also, algorithms for (semi-)automatic evaluation of the acquired image data are under development.
See also
Breast ultrasound
References
Medical ultrasonography
Breast imaging |
https://en.wikipedia.org/wiki/Alexander%20Tuzhilin | Alexander Sergei Tuzhilin (born 1957) is a Professor of Data Science and Information Systems and the Leonard N. Stern Endowed Professor of Business at New York University's Stern School of Business. He also serves as the Dean of Computer Science at the University of the People on the pro bono basis.
Professor Tuzhilin is known for his work on personalization, recommender systems, machine learning and AI, where he has made several contributions, including being instrumental in developing the area of Context-Aware Recommender Systems (CARS), proposing novel methods of providing unexpected and cross-domain recommendations based on the principles of deep-learning, developing novel approaches to customer segmentation, and discovery of unexpected patterns in data.
Education
Tuzhilin received his B.A. in Mathematics from the New York University in 1980, M.S. in Engineering Economics from the Department of Management Science and Engineering at Stanford University in 1981, and Ph.D. in computer science from NYU's Courant Institute of Mathematical Sciences in 1989, his doctoral advisor being Zvi Kedem.
Career
Tuzhilin joined the faculty at the New York University Stern School of Business in 1989 as an Assistant Professor of Information Systems. He is currently the Leonard N. Stern Professor of Business. He is also the Dean of Computer Science at the University of the People.
Research
Tuzhilin researches data mining in databases, personalization, recommender systems, and customer relationship management.
In 2006, Tuzhilin was hired by Google and given access to its monitoring systems to do a study on click fraud. This was part of a class-action settlement requiring Google to offer advertisers up to $60 million in refunds. Tuzhilin concluded that defining and tracking click fraud will be difficult, because it is often not possible to decipher whether Web surfers were clicking on an advertising link out of malice or as part of an innocent online excursion.
Patents
In 2001, Tuzhilin patented a method of building customer profiles and using them to recommend products and services. Tuzhilin said of the patent, 'It's very broad and very general, and occupies some prime real estate in this space. It essentially covers technologies that are crucial for implementation of customer relationship management.' He added that the patent was careful not to stipulate that the technology was designed for Internet applications. Others pointed out that there were legal exceptions to business methods patents. Any individuals or companies that can show they have been engaged in a business practice for at least a year before a patent application for that practice was filed may be able to circumvent the patent.
In March 2012, Yahoo sued Facebook for violating 10 of its patents. Facebook countersued Yahoo, claiming that it violated Facebook patents that covered 80% of the Yahoo's 2011 revenues. Three of Facebook's patents were originally granted to Tuzhilin.
References
|
https://en.wikipedia.org/wiki/Samsung%20SGH%20R220 | Samsung SGH R220 was one of the earliest phones made by Samsung Group. The phone was officially announced by the South Korean giant in January 2001. The dual-band GSM [900/1800] 2G network-equipped phone had single SIM functionality and it came with a WAP 1.1 inbuilt web browser. The phone came in three colors – Dark Gray, Green and Navy Blue.
The SGH R220 featured a monochrome graphics display with resolution of 128 X 64, blue back-lighting and dynamic font sizes. In addition to downloadable monophonic ringtones, it had a built-in ringtone composer. The phone did not come with internal memory but it had ability to keep the records of 10 dialed, missed and received calls, and was able to save up to 100 contacts.
The phone came with three games – Casino, Hexa and Mole. Its inbuilt applications included an organizer. It was backed by a Li-Ion battery which was able to deliver 150 hours of standby and 5 hours of talk-time. The phone measured 110 X 46 X 23.5mm in dimensions and weighed 99 grams.
References
Samsung mobile phones
Mobile phones introduced in 2001 |
https://en.wikipedia.org/wiki/Non-constructive%20algorithm%20existence%20proofs | The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P (complexity) by showing an algorithm that solves it in time that is polynomial in the size of the input; etc.
However, there are several non-constructive results, where an algorithm is proved to exist without showing the algorithm itself. Several techniques are used to provide such existence proofs.
Using an unknown finite set
In combinatorial game theory
A simple example of a non-constructive algorithm was published in 1982 by Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, in their book Winning Ways for Your Mathematical Plays. It concerns the game of Sylver Coinage, in which players take turns specifying a positive integer that cannot be expressed as a sum of previously specified values, with a player losing when they are forced to specify the number 1. There exists an algorithm (given in the book as a flow chart) for determining whether a given first move is winning or losing: if it is a prime number greater than three, or one of a finite set of 3-smooth numbers, then it is a winning first move, and otherwise it is losing. However, the finite set is not known.
In graph theory
Non-constructive algorithm proofs for problems in graph theory were studied beginning in 1988 by Michael Fellows and Michael Langston.
A common question in graph theory is whether a certain input graph has a certain property. For example:
Input: a graph G.
Question: Can G be embedded in a 3-dimensional space, such that no two disjoint cycles of G are topologically linked (as in links of a chain)?
There is a highly exponential algorithm that decides whether two cycles embedded in a 3d-space are linked, and one could test all pairs of cycles in the graph, but it is not obvious how to account for all possible embeddings in a 3d-space. Thus, it is a-priori not clear at all if the linkedness problem is decidable.
However, there is a non-constructive proof that shows that linkedness is decidable in polynomial time. The proof relies on the following facts:
The set of graphs for which the answer is "yes" is closed under taking minors. I. e., if a graph G can be embedded linklessly in 3-d space, then every minor of G can also be embedded linklessly.
For every two graphs G and H, it is possible to find in polynomial time whether H is a minor of G.
By Robertson–Seymour theorem, any set of finite graphs contains only a finite number of minor-minimal elements. In particular, the set of "yes" instances has a finite number of minor-minimal elements.
Given an input graph G, the following "algorithm" solves the above problem:
For every minor-minimal element H:
If H is a minor of G then return "yes".
return "no".
The non-constructive part here is the Robertson–Seymour theorem. Although it guarantees that there is a finite number of mino |
https://en.wikipedia.org/wiki/Biased%20random%20walk%20on%20a%20graph | In network science, a biased random walk on a graph is a time path process in which an evolving variable jumps from its current state to one of various potential new states; unlike in a pure random walk, the probabilities of the potential new states are unequal.
Biased random walks on a graph provide an approach for the structural analysis of undirected graphs in order to extract their symmetries when the network is too complex or when it is not large enough to be analyzed by statistical methods. The concept of biased random walks on a graph has attracted the attention of many researchers and data companies over the past decade especially in the transportation and social networks.
Model
There have been written many different representations of the biased random walks on graphs based on the particular purpose of the analysis. A common representation of the mechanism for undirected graphs is as follows:
On an undirected graph, a walker takes a step from the current node, to node Assuming that each node has an attribute the probability of jumping from node to is given by:
where represents the topological weight of the edge going from to
In fact, the steps of the walker are biased by the factor of which may differ from one node to another.
Depending on the network, the attribute can be interpreted differently. It might be implied as the attraction of a person in a social network, it might be betweenness centrality or even it might be explained as an intrinsic characteristic of a node. In case of a fair random walk on graph is one for all the nodes.
In case of shortest paths random walks is the total number of the shortest paths between all pairs of nodes that pass through the node . In fact the walker prefers the nodes with higher betweenness centrality which is defined as below:
Based on the above equation, the recurrence time to a node in the biased walk is given by:
Applications
There are a variety of applications using biased random walks on graphs. Such applications include control of diffusion, advertisement of products on social networks, explaining dispersal and population redistribution of animals and micro-organisms, community detections, wireless networks, and search engines.
See also
Betweenness centrality
Community structure
Kullback–Leibler divergence
Markov chain
Maximal entropy random walk
Random walk closeness centrality
Social network analysis
Travelling salesman problem
References
External links
Gábor Simonyi, "Graph Entropy: A Survey". In Combinatorial Optimization (ed. W. Cook, L. Lovász, and P. Seymour). Providence, RI: Amer. Math. Soc., pp. 399–441, 1995.
Anne-Marie Kermarrec, Erwan Le Merrer, Bruno Sericola, Gilles Trédan, "Evaluating the Quality of a Network Topology through Random Walks" in Gadi Taubenfeld (ed.) Distributed Computing
Network theory
Social networks
Social systems
Social information processing |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.